CS502 Final Term Current Paper (Feb 2011)
Saturday, February 12, 2011 Posted In .Final Term Exam (Feb 2011) Edit This
CS502 Final Term Current Paper (Feb 2011)
This is my today's Algo paper
Fibonacci sequence 2mark
Clique cover problem 2mark
Make Adjacency list from the given table 3marks
Communication design problem (MST).
Strong connected component problem
Heapify proof..... 5marks
Dijkstra Algorithmn
Define Floyd Marshall 5marks
Floyd Marshall 3marks
Fibonacci sequence 2mark
Clique cover problem 2mark
Make Adjacency list from the given table 3marks
Communication design problem (MST).
Strong connected component problem
Heapify proof..... 5marks
Dijkstra Algorithmn
Define Floyd Marshall 5marks
Floyd Marshall 3marks
runtime
space used
DFS algoritmn 3marks
space used
DFS algoritmn 3marks
