CS502 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan
Tuesday, July 19, 2011 Posted In .Final Term Exam Spring 2011 (July) Edit ThisCS502 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan
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
- 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
CS502 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan
MCQs ziyada tar new thy......huffman encoding aur ASCII coding se aye thy
Q1) answer the follwing according to Floyd Marshall 1) runing time 2) space use
2) write suedo code of dijkstra algorithm? 5marks
3)Give a detailed example for 2-d maxima problem 2marks
4)Make Adjacency list from the given table 5marks
5) how generic algorithms work with minimum spaning tree 3marks
6) Floyd-Warshall matrix diya tha os py 3 itration apply karny thy 5marks
7) Which points should be supposed to prove the correctness of the Dijkstra's Algorithm 3marks
Q1) answer the follwing according to Floyd Marshall 1) runing time 2) space use
2) write suedo code of dijkstra algorithm? 5marks
3)Give a detailed example for 2-d maxima problem 2marks
4)Make Adjacency list from the given table 5marks
5) how generic algorithms work with minimum spaning tree 3marks
6) Floyd-Warshall matrix diya tha os py 3 itration apply karny thy 5marks
7) Which points should be supposed to prove the correctness of the Dijkstra's Algorithm 3marks
