CS502 Current Final Term Paper spring 18 July 2011

[Vuhelper]

5 marks...................
- Describe depth-first search algorithm in graphs wd iterative version.
- where r clique problem arises.
- wat is decision problem.expalin wd example.
- find the minimum cost spaining tree.....diagram was given...
- there was given a recursive search function we have to the complexity of that search.
3 marks................
- Floyd-warshall algorithem wd respect to running time n spaced used.
- how khurkal algorithm wrks?
- T/F:A sequence of matrix in column of dynamic problem table for a instance of knapsack is always non decreasing?expalin briefly.
2 marks...............
- informal defination of algorithm.
- differentiate farwrd n backwrd edge.
- how dijshkra algorithm operate.
- one statement was given we have to ans it yes or no about NP-complete