07-17-2011, 08:08 PM
50% subjective from 1st half of book
50% objective from Huffman encoding
1. Heap sort Algorithm
2. Difference between Back edge and cross edge
3. Prim's Algorithm
4. Do go through k & Dont go through k at all
5. BFS pseudo code in graph
6. heapify
7. Prove that the generic TRAVERSE (S) marks every vertex in any connected graph exactly once and the set of edges (v, parent (v)) with parent (v) ¹F form a spanning tree of the graph.
8. Apply Kruskal’s algorithms on the following graph.[You can show final result in exam software and need not to show all intermediate steps].
50% objective from Huffman encoding
1. Heap sort Algorithm
2. Difference between Back edge and cross edge
3. Prim's Algorithm
4. Do go through k & Dont go through k at all
5. BFS pseudo code in graph
6. heapify
7. Prove that the generic TRAVERSE (S) marks every vertex in any connected graph exactly once and the set of edges (v, parent (v)) with parent (v) ¹F form a spanning tree of the graph.
8. Apply Kruskal’s algorithms on the following graph.[You can show final result in exam software and need not to show all intermediate steps].
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]