Unit I 19. What is depth-first traversal? Give an example.

PART A 20. What is breadth-first traversal? Give an example.

1. Define the algorithm with its properties. PART B & C
2. Give the diagram representation of the Notion of an algorithm. 1. Explain the method used for performing the Multiplication of two large integers.
3. Give the Euclid’s algorithm for computing Gcd(m, n). 2. Apply Strassen’s algorithm to compute
4. What is abstraction? Why do we need an Abstract Data Type?
5. List out the various types of problems that are present in computational thinking.
6. What is performance measurement and order of growth?
7. How to measure an algorithm running time?
8. How do you measure the efficiency of an algorithm?
9. Define best, worst, average case time complexity.
10. Write down the basic asymptotic efficiency classes. exiting the recursion when n=2, i.e., computing the product of 2x2 matrices by the brute–force
11. Define the asymptotic notation “Big oh” (O) algorithm.
12. Define the asymptotic notation “Omega” (Ω). 3. Apply the DFS-based algorithm to solve the topological sorting problem for the following digraphs.
13. Define the asymptotic notation “theta” (θ).
14. Write down the properties of asymptotic notations.
15. Define recurrence.
16. What is an empirical analysis of the algorithm?
17. Write the algorithm for Iterative binary search.
18. Give computing time for Binary search.
19. Write an algorithm to find the number of binary digits in the binary representation of a positive
decimal integer.
20. Give the general plan for analyzing the recursive algorithm.
21. Define Recurrence Relation.
22. What are all the methods available for solving recurrence relations?
23. Give the general plan for analyzing non-recursive algorithms.
PART B & C 4. i) Illustrate in detail about Heap construction and Heap sort algorithm.
1. Explain in detail the fundamentals of algorithmic problem solving. ii) Construct and demonstrate the divide and conquer closest–pair algorithm.
2. Explain in detail about asymptotic notations. 5. Explain in detail the exhaustive search technique for
3. Explain in detail the mathematical analysis of the recursive algorithm. a. Assignment Problem.
4. Give the mathematical analysis for the non-recursive algorithm. b. Knapsack Problem.
5. Explain in detail about Empirical Analysis of Algorithm Time Efficiency and Algorithm c. Travelling Salesman Problem.
visualization. Unit III
Unit II PART A
PART A 1. State the Principle of Optimality.
1. What is the Brute Force approach? 2. What do you mean by Dynamic Programming?
2. Define a naïve string-matching algorithm. 3. Explain the characteristics of the Dynamic Programming Approach.
3. Write algorithmic steps for the string–matching problem using brute force technique. 4. Mention the two different approaches to handle the overlapping subproblems.
4. What is an exhaustive search? 5. List out the memory functions used under Dynamic programming.
5. How different is the traveling salesman problem from the problem of finding a Hamiltonian circuit? 6. Define the Transitive Closure of a Directed Graph.
6. Give the general plan for divide-and-conquer algorithms. 7. Define the Floyd-Warshall’s algorithm.
7. How does a divide-and-conquer algorithm work? 8. Write the pseudo code of Floyd’s algorithm.
8. List the advantages of the Divide and Conquer Algorithm. 9. What is Dijkstra’s algorithm used for?
9. Give the recurrence relation of divide-and-conquer. 10. How to calculate the efficiency of Dijkstra’s algorithm.
10. State Master’s theorem. 11. Compute the efficiency of Floyd-Warshall's algorithm.
11. What are the differences between dynamic programming and divide-and-conquer approaches? 12. Write down the optimization technique used for Warshall’s algorithm. State the rules and
12. What is the Closest-Pair Problem? assumptions that are implied behind that.
13. List the major variations of the Decrease – and – Conquer technique. 13. State the general principle of the Greedy Algorithm.
14. For a digraph with n vertices, what is the largest number of distinct solutions, the topological 14. Write all the properties of the Greedy Technique.
sorting problem can have? 15. Write the Pseudo-code for Greedy Algorithm
15. What is an articulation point in the graph? 16. Define Optimal Binary Search Trees.
16. What is the degree of a graph? 17. Define Multistage graphs. Give an example.
17. Define indegree, and outdegree in a graph. 18. What is the purpose of Huffman’s tree? State the applications of Huffman’s tree.
18. What are the different kinds of graph traversals? 19. What is Huffman Coding?
20. List any two major differences between Dynamic Programming and Greedy Method.
 PART B & C Unit IV
1. i) Apply Warshall’s algorithm to find the transitive closure of the digraph defined by the following PART A
adjacency matrix. 1. Describe the iterative improvement technique.
2. What is a linear programming problem?
3. List the requirements of standard form. (or) What are the requirements to represent the simplex
method to a linear programming problem in the standard form?
4. Why do we need slack and surplus variables in the LPP for solving using the simplex method?
5. State extreme–point theorem.
ii) Solve the All–Pair Shortest path problem for the digraph with the weight matrix given below. 6. Write short notes on the Maximum-Flow problem.
7. State the mathematical formulation of the Maximum Flow problem.
8. State the Max–Flow Min – Cut Theorem.
9. How is a transportation network represented?
10. What is the augmenting path?
11. What is a residual network in the context of flow networks?
12. Define flow cut.
2. Explain how Dijkstra’s algorithm uses the greedy approach to find the single source shortest paths 13. Define the constraint in the context of the maximum flow problem.
for the given graph. 14. Define maximum matching.
15. Define maximum cardinality.
16. Define Bipartite Graphs.
17. List the properties of the Bipartite graph.
18. What do you mean by perfect matching in the Bipartite graph?
19. State the Stable Marriage problem.
20. Define the Marriage Matching problem and State what is called stable or unstable in it.
21. Infer when a pair (m,w) is said to be a blocking pair.
PART B & C
1. i) List the steps of the Simplex method. Briefly discuss the simplex method with an example.
ii) Solve the following LPP geometrically.
Maximize 3x + y
Subject to -x + y <= 1
3. Write the Huffman’s Algorithm. Construct the Huffman’s tree for the following data and obtain its 2x + y <= 4
Huffman’s Code. x >=0, y>=0
2. i) State the shortest-–augmenting–path algorithm to find a maximum flow and a min-cut in the
networks.
ii) Determine the max – flow in the following network.
4. Outline the Dynamic programming approach to solve the Optimal Binary Search Tree problem and 4
analyze its time complexity. 1 2
5. i) Discuss how the coin-changing problem can be solved by dynamic programming with an
example. 2
4 1 3
ii) Indicate the algorithm to find the optimal feasible subset of first i entries by memory function for
the knapsack problem.
6. i) Devise an algorithm for the multistage graph problem using dynamic programming design 1
technique. S 3 t
ii) compute the minimum cost and path from s to t for the following multistage graph.
2

4
3. i) Explain the algorithm for the Maximum Matching Bipartite graph. 33. Give the purpose of the lower bound.
ii) Apply the maximum matching algorithm to the following Bipartite graph. 34. State Assignment problem.
35. Give the formula used to find the upper bound for the knapsack problem.
36. What is The Euclidean minimum spanning tree problem?
37. Define the accuracy ratio with an example.
38. Define the Performance ratio with an example.
39. Define the C-Approximation algorithm with an example.
40. What are the approximation algorithms used for TSP?
41. Write an algorithm for the Nearest Neighbor Problem.
4. i) Describe how you will find a stable marriage matching men’s and women’s preferences. 42. Write an algorithm for Twice around the Tree problem.
ii) Find a stable marriage matching for the instances defined by the following ranking matrix: PART B & C
1. i) Explain in detail about approximation algorithms.
ii) Prove that the twice- around-the-tree algorithm is a 2-approximation algorithm for the traveling
salesman problem with Euclidean distances.
2. Solve the following instance of the knapsack problem by the branch–and–bound algorithm:

Unit V
PART A
1. What are the tractable and intractable problems?
2. How does problem reduction find the lower bound?
3. What are the classes of computational complexity?
4. Differentiate between NP-hard and NP-complete problems
5. Define P and NP problems. 3. Apply the nearest–neighbor algorithm of the instance defined by the intercity distance matrix below.
6. List any three problems that have polynomial time algorithms. Start the algorithm at the first city, assuming that the cities are numbered from 1 to 5, and compute
7. What is meant by N – Queen’s Problem? the accuracy ratio of this approximate solution.
8. Differentiate feasible solutions and optimal solutions. 4. i) Justify how the backtracking technique is used to solve the sum of subsets problem with its
9. How does a Branch – and – Bound Algorithm work? pseudo code and complexity.
10. Write about information-theoretic lower bound. ii) Construct all possible subsets of weights that sum to M for the given instance n = 6. M = 30 and
11. State the Heuristic with an example. Weights(1:6) = (5,10,12,13,15,18).
12. What do you mean by polynomial time approximation algorithm? 5. i) Let w= {5, 7, 10, 12, 15, 18, 20} and m=35. Find all possible subsets of w whose sum is
13. Differentiate backtracking and Exhaustive search. equivalent to m. Draw the portion of the state space tree for this problem.
14. What factors influence the efficiency of the backtracking algorithm? ii) Describe how the backtracking works to solve the 8-Queens problem.
15. What is backtracking? 6. Write an algorithm to determine the Hamiltonian cycle in a given graph using backtracking. For the
16. Draw the solution for the 4-queen problem. following graph determine the Hamiltonian cycle.
17. What method is used to find the solution in the n-queen problem by symmetry?
18. Define the Hamiltonian cycle.
19. What is the subset-sum problem?
20. Give an example for the sum-of-subset problem.
21. When can a node be terminated in the subset-sum problem?
22. How can the output of a backtracking algorithm be thought of?
23. Give a template for a generic backtracking algorithm.
24. What are the two types of constraints used in Backtracking? Explain.
25. What is a promising and non-promising node in the state space tree?
26. What is a state space tree?
27. What do leaves in the state space tree represent?
28. Define live node and dead node. ---------------------------------------------ALL THE BEST-------------------------------------------------
29. Compare backtracking and branch and bound.
30. Define bounding.
31. When can a search path be terminated in a branch-and-bound technique?
32. State the reason for terminating the search path at the current node in the branch and bound
algorithm.