CS502 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan
Paper of CS502
40% subjective from 1st half of book
60% objective from Huffman encoding
1) polynomial time algorithm
2) what is a run time analysis and its two criteria
3) Dijkstra algorithm correctness criteria two conditions
4) Floyd algorithm
5) a table is given and we have to make the adjacency list and matrix
6) an mst graph is given and we have to calculate its weight
40% subjective from 1st half of book
60% objective from Huffman encoding
1) polynomial time algorithm
2) what is a run time analysis and its two criteria
3) Dijkstra algorithm correctness criteria two conditions
4) Floyd algorithm
5) a table is given and we have to make the adjacency list and matrix
6) an mst graph is given and we have to calculate its weight
