Greedy Methods
Q1. Explain Prim's and Kruskal's algorithm with some suitable examples. Also analyse algorithms.
Q2. Give single source shortest path algorithm. Give the time complexity.
Searching and traversal Techniques in trees and graphs
Q1. Explain binary tree traversal with the help of some examples.
Q2. Explain non-recursive preorder traversal give an algorithm for the same.
Q3. Give an algorithm breath first search and depth first search.