Source : (did-you-kno)

Source : (chickenshit)

Source : (did-you-kno)

Source : (small talks)

Source : (chickenshit)

Learn queue with Java | denmased.

bismillah...
Assalamualaikum Wr. Wb.

         Hello, at this time, i wanna discuss about queue. In data structure, queue is a special form of linear list where the operation of insertion only allowed through one side, called the back side ( REAR ) and the operation of deletion only allowed through another side, called the front side ( FRONT ) from list.

 For example :          Q = [ Q₁ , Q₂ , Q₃ , … , Q_n ]
                        FRONT (Q) = Q₁ and REAR (Q) = Q_n .

         Here, i wanna share coding about queue with Java language. So, check this out and hope can be useful for you.

Learn infix to postfix with Java | denmased.

bismillah...
Assalamualaikum Wr. Wb.

        I think this first time , i'm writing on my blog with english language. It looks the way i write a very stiff and formal, hehe. Besides being able to improve my english skill, it's as my exercise in preparing my thesis later . Of course, with the help of google translate i can do this :D . 
       In data structure course, infix, postfix and prefix must be learned by you. So, you must know what the definitions and differences of all.
        You can visit this link, for more information about it. Oh iya, one thing i learned from structure data course is ' how to store data in memory as small as possible and how to make the process as quickly as possible ' . After you visit and read the link i provided earlier, at least you have basic about infix, postfix, and prefix . Here, i wanna share coding about how to convert the notation infix into postfix with Java language. So, check this out and hope can be useful for you.

Source : (madistroaisya) , (afrhdianti)

No edit, no pict hoax.

Source : (flyingscotsman)

Source : (tothefridgeandbeyond)

Source : (chickenshit)