Subjective Questions were as follows...
- 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
