Happy Anniversary!

6th Anniversary
6th Anniversary

Happy Anniversary my dear WordPress!

If it was an actual relationship that I had, i might consider marrying you any day soon :p

Happy Anniversary!

On A Door of Opportunity

Someone once said to me, “You will find a lot of door of opportunity in the following years”. They also said, “Sometimes you need to close one of the door in order for you to find others”. What they said seems good and logical, one door that you close will enable you to find other door leading you to possibly brighter different path.

What they didn’t know is the following: What if most of your doors that you’ve opened up until know are indeed the doors that define who you are. Doors that you constantly open while believing there will be some kind of hidden treasure in the end. Doors that you constantly open while they improve yourself in the process.

Or maybe, the perfect image that we built of this ideal goal only exist in our mind. Yes it’s good in the sense that it enables us to grow in our full potential, but it’s not real. Maybe we need to start realizing that life is not a maze where there is exist only one route to a goal. Life is indeed full of possibilities and offers multiple ways. It’s only up to us to explore what life brings.

But that’s only possible if we are brave enough to close one door and search another.

On A Door of Opportunity

Computer Scientist Mentality

Computer scientists tend to think in worse case scenario. “Is this code secure enough?”, “What if it isn’t?”, “What if someone try to do this way in my code?”, “How fast is my algorithm? What if i use more data?”, and so on and so forth. In achieving so, and over-worrying that, they often forgot that they can do more with their time and man-resources.

Sometimes that mentality makes them see the world through the over-worried hyper-pessimistic spectacles. “Am I doing this correctly?”, “What if someone come and ruins my expectation of the world?”, “Can I survive this?”, and so on and so forth.

Computer Scientist Mentality

Functional Programming -.-

Udah jam 6 sore, lagi ada di lab kampus, saya pun kebingungan didepan komputer, bingung mau ngapain.

Mungkin ini namanya “resource overload” *istilah ngasal, jangan di-quote*, kalo diem di kosan aja, nggak ada internet, langsung pengen browsing ini-itu, tapi giliran ada internet sepuasnya, cepet, mantep di kampus langsung terpaku -.-

Oke lah ya daripada ngenet nggak jelas, dan bingung mau buka apaan, mending bikin postingan iseng tentang “Fun”Pro ah xD

In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. – wikipedia

Di semester 4 ini ada mainan baru, functional programming (y)! Continue reading “Functional Programming -.-“

Functional Programming -.-

Dijkstra oh Dijkstra

Dijkstra’s algorithm, conceived by Dutch computer scientistEdsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree.

Hoahmm, Okelah kalo Dijkstra tapi cuman ngecek bobot perjalanan aja, masih nggak terlalu susah lah implementasinya, tinggal ngeliat algoritma yang ada di wikipedia aja sih.

Let the node at which we are starting be called the initial node. Let the distance of node Y be the distance from the initial node to Y. Dijkstra’s algorithm will assign some initial distance values and will try to improve them step by step.

  1. Assign to every node a distance value. Set it to zero for our initial node and to infinity for all other nodes.
  2. Mark all nodes as unvisited. Set initial node as current.
  3. For current node, consider all its unvisited neighbors and calculate their tentative distance (from the initial node). For example, if current node (A) has distance of 6, and an edge connecting it with another node (B) is 2, the distance to B through A will be 6+2=8. If this distance is less than the previously recorded distance (infinity in the beginning, zero for the initial node), overwrite the distance.
  4. When we are done considering all neighbors of the current node, mark it as visited. A visited node will not be checked ever again; its distance recorded now is final and minimal.
  5. If all nodes have been visited, finish. Otherwise, set the unvisited node with the smallest distance (from the initial node) as the next “current node” and continue from step 3.

Tapi ini tugas terakhir Struktur Data dan Algoritma, salah satu matakuliah yang paling wow di kampus saya.

Yok ah, deadlinenya Sabtu, masih banyak waktu hahahahaha #stress

Dijkstra oh Dijkstra