 |
|
#1
11-27-2011, 08:13 AM
|
||||
|
||||
cs502 2011 final term
2011 paper Questions :
1)RAM(Random Access memory)and its Applications? 2)Describe Dijkstra’s algorithm working? 3)Prim algorithm graph? 4) Give a detailed example for 2-d maxima problem 5)Floyd-Warshall matrix complexity? 6)Convert Shortest path in to single source shortest path problem? 7)Different between Average case and Worst case? 8)Pseudo code algorithm for DFS Timestamp? 4 Questions of 5 Marks 1) Write steps of sieve techniques 2) Write Psuedo code of Dijkstra's algorithm 3) Prove the Lemma: Consider a diagraph G = ( V,E ) and any DFS forest for G. G has a cycle if and only if the DFS forest has a back edges 4) Answer the following Where the cliquer cover problem is used? What is decision problem, also explain with examples? 
|
|
Linear Mode
