June 4, 2010
goto Answer
— devadutta @ 11:59 pm, GMT +0000 ( 1275695999 ) 
Play
Play Think computer science and tell us who connects 1, 2. He also likes to write 3 + 4 = 7 as 3 4 + = 7
Sorry about the delay people. Question will be up longer
Cracked By: shrik , Sumanth Patlolla , umang , varuns88 , Ajay Parasuram , Dibyo , udupendra , KK , Logik , Thejas V R , akhi , piezocake , Ananth , Manish Achuth , Ganesh Prasad , dineshk , Rogi , Abinaya , Rahulk , Anubhav , dheeraj , Aravindh , Aparna , Shwetha Maiya and Xanda
Answer:
Edsger W. Dijkstra
Reverse polish notation, Train shunting problem as popularized by him and Semaphores were invented by him
Major dude, he is
Subscribe
Play
Lite Version
Head 2 Head
this->bb();
June 5th, 2010 at 8:11 pm, GMT +0000 ( 1275768705 )
Shunting yard algo, semaphores, RPN/postfix notation.
As my OS prof used to say – Dijikisstra.
Edsger Dijkstra.
June 5th, 2010 at 9:17 pm, GMT +0000 ( 1275772629 )
Edsger Wybe Dijkstra
June 5th, 2010 at 9:35 pm, GMT +0000 ( 1275773704 )
Edsger Dijkstra
June 5th, 2010 at 10:08 pm, GMT +0000 ( 1275775690 )
E.W.Dijkstra
June 6th, 2010 at 12:47 am, GMT +0000 ( 1275785225 )
Edsger Dijkstra
June 6th, 2010 at 1:03 am, GMT +0000 ( 1275786218 )
Edsger W. Dijkstra
June 6th, 2010 at 1:38 am, GMT +0000 ( 1275788297 )
Dijkstra.
June 6th, 2010 at 2:05 am, GMT +0000 ( 1275789916 )
E. W. Dijkstra
Semaphores are a programming construct designed by E. W. Dijkstra in the late 1960s. Dijkstra’s model was the operation of railroads.
June 6th, 2010 at 2:20 am, GMT +0000 ( 1275790844 )
dijkstra
June 6th, 2010 at 2:35 am, GMT +0000 ( 1275791702 )
Edsger Dijkstra
His works include shortest path algorithm (1), semaphore concept(2) and reverse polish notation.
June 6th, 2010 at 4:15 am, GMT +0000 ( 1275797729 )
Dijkstra?
June 6th, 2010 at 4:42 am, GMT +0000 ( 1275799364 )
Dijkstra.
June 6th, 2010 at 5:10 am, GMT +0000 ( 1275801015 )
E. W. Dijkstra
June 6th, 2010 at 7:05 am, GMT +0000 ( 1275807956 )
Semaphores???
June 6th, 2010 at 7:26 am, GMT +0000 ( 1275809219 )
Edsger W Dijkstra -> Railway Semaphore signals and Semaphore programming.
June 6th, 2010 at 8:22 am, GMT +0000 ( 1275812550 )
(2) Flag Semaphore that was implemented in (1)Railway Signalling …invented by Charles Hutton Gregory
June 6th, 2010 at 10:15 am, GMT +0000 ( 1275819357 )
Edsger W. Dijkstra who introduced the semaphore concept in parallel computing. The visuals are the Railway semaphore signals for railway lines and the semaphore flag coding system. Dijkstra also pioneered the case against the goto statement and is a co-inventor of the reverse polish notation.
June 6th, 2010 at 2:14 pm, GMT +0000 ( 1275833689 )
Edsger W. Dijkstra.
You haven’t lived till you’ve implemented Dijkstra’s Algorithm on a sphere using javascript.
June 6th, 2010 at 4:21 pm, GMT +0000 ( 1275841316 )
Semaphores used in Railways to signal is also a Operating System concept.
June 6th, 2010 at 11:29 pm, GMT +0000 ( 1275866992 )
Edsger W. Dijkstra
June 7th, 2010 at 4:49 am, GMT +0000 ( 1275886190 )
guessing Edsger W. Dijkstra
(Semaphore)
June 7th, 2010 at 9:08 am, GMT +0000 ( 1275901681 )
Reverse Polish notation
we are talking about semaphores over her…
Edsger W. Dijkstra
June 7th, 2010 at 8:16 pm, GMT +0000 ( 1275941777 )
Edsger Wybe Dijkstra
June 7th, 2010 at 9:00 pm, GMT +0000 ( 1275944403 )
Dijkstra
June 9th, 2010 at 3:50 am, GMT +0000 ( 1276055416 )
Edsger W. Dijkstra
June 10th, 2010 at 1:25 am, GMT +0000 ( 1276133111 )
Edsgar W Dijkstra, Shortest path algorithm, semaphores, and also against “goto” statements.