1
Data structure using C
Attempt all questions.
1- Write and explain the BFS and DFS traversal algorithm. What are their complexities?
2- Define spanning tree. Write Kruskal’s algorithm to find the minimum cost spanning tree using example.
3- Describe Floyd Warshall algorithm for finding all pairs shortest path.
4- Describe hashing and collision resolution strategies.