Flipkart Interview QuestionSoftware Engineer / Developers
Interview Type: Phone Interview
we have lots of process, where dependency of one process on another is given.
ex: p1->p3, meaning p1 has to be executed after p3
p3->p7 , p5-p8, p2-p3 etc..
device an algorithm to schedule this process based on their dependencies.
Do an DFS on the given process graph and output the process(p1,p2 or p3) in ascending order of finishing times(Topological Sorting)
Can you be please be clear with your question. What did he ask you to do exactly??- Anonymous October 04, 2011