CS 2251 – Design and Analysis of Algorithms question bank

Unit 5
Graph Traversals and Branch & Bound
Part A

1. What is minimum cost spanning tree?

2. When do you say a tree as minimum spanning tree?
3. What is Hamiltonian cycle in an undirected graph?
4. What is branch and bound? Explain in detail.
5. When can a search path be terminated in a branch and bound algorithm?
6. Compare backtracking and branch and bound.
7. What are the additional features required in branch and bound when compared to
backtracking?
8. What are the searching techniques that are commonly used in branch and bound
method?
9. What are NP – hard and NP – complete problems?
10. What is maxclique problem?
11. What is approximate solution?
12. What is decision problem?
13. What is traversal of a graph? What are the types of traversal?
14. What is a graph? How are the graphs represented?
15. Define the term strongly connected components.

Part B

1. Explain the method of finding the minimum spanning tree for a connected graph using
Prim’s algorithm.
2. How will you find the shortest path between two given vertices using Dijkstra’s
algorithm? Explain.
3. Discuss the solution for traveling salesman problem using branch and bound technique.
4. Define spanning tree? Discuss the design steps in Prim’s Algorithm to construct
minimum spanning tree with an example.
5. Give a suitable example and explain the Breadth – First search and Depth first search
algorithms.
6. Write the Dijkstra’s algorithm for single source shortest path problem
7. Explain Kruskal’s algorithm.
8. Explain the difference between Breadth – First search and Depth first search.
9. Explain in detail about NP – hard Graph problems.
10. Write and explain the techniques in branch and bound method.
11. Write and explain the concepts of 0/1 knapsack problem.
12. Prove that any weighted connected graph with distinct weights has exactly one
minimum spanning tree
13. Explain the terms: NP-Hard and NP Complete problems
14. Discuss with examples, various graph traversal techniques.
15. Explain how bi connected components can be determined for a given graph. What is
its complexity.
16. Mention salient features of NP hard and NP complete classes. Discuss two examples
for each case.
17. Differentiate between NP Complete and NP hard.