Model Question Papers Ivy Re eC cl Sum Max.Marks: 70 PT i cr lennon 1. Mention the characteristics of an algorithm. 2. Define the terms: i. Space complexity 3, Write the time complexities of ii, Time complexity i, Binary search ii, Merge sort 4, Write the control abstraction of divide and conquer. 5, Define minimum cost spanning tree fferent ways to represent a graph. 6. Mention two dit 7, What is meant by an optimal solution? 8, Define the terms related to graphs: FE cycl ii. Degree of anode . Cycle 9, State the travelling sales™ 10, What is sum of subset proble™ 11, State the N-Queens problem 12. D ; fefine the terms: ii. Complete Binary tree. an problem i, Binary tree Scanned with CamScannertotic Notations with examples: 13. Explain Asymp? and minimum in a set of members using divigg ang 14, Write an algori conquer techniq Write a recursive binary search algorith he minimum cost thm to find maximum Jain with an example. ia 1m. Explain with an example. spanning tree by Prim’s algorithm, Write Prim’s algorithm. Find t 17*Find the shortest distance from node 1 to all other nodes using Dijkstra's algorithm, 18, a. Write merge sort algorithm to sort a set of numbers in ascending order. b. Trace the merge sort algorithm to sort the following elements. 41, 32, 11, 92, 66, 74, 87, 38, 19. Write recursion algorithm for pre-order traversal and apply it to the following complete binary @ (2) ( DOO 0°@ 20. a. Write a note on Graph Coloring, b. Explain 8 i Explain 8 queens problem using back tracking with an example. PnSion Scanned with CamScanner| “al rere fime:3 Hours > Max.Marks: 70 Fete ce acolainata eee 1. Define algorithm. 2, Define order of growth. 4, Whatis divide and conquer technique?. 4, Write the time complexities of (0 Binary search (i) MaxMin, 5, Whatis meant by feasible solution ? 6, What are the types of greedy techniques ? 7. List any two applications of minimum spanning tree. 8. Definetheterms: i. Acyclic graph ii, Degree of node. 9, Write the adjacency matrix of the following graph. ® 2) | 10. Name the different graph traversal techniques . | 11. state N-Queens problem. 12, Define graph coloring. 13. a. Explain asymptotic notations. b. Write an algorithm for general method of backtracking. 14a. Write an algorithm for finding maximum and minimum of list of elements. \b. Trace the maxmin algorithm for the given set of data 90, 67, 34, 88, 94, 40. 15, a. Explain sum of subsets problem. b, Write the control abstraction of Greedy techniques. 4, For the Knapsack problem, n = 3, m = 20, (P1, P2, P3) = (25, 24, 15) and (w1. w2, w3) = (18, 15, 10). Find the feasible solution and optimal solution. » Find the minimum spanning tree using Kruskal algorithm. ee Scanned with CamScanner17. a. Explain DFS algorithm. b. Traverse the following graph using DFS. with number of jobs n = 5. Their profits are idlines are (d,, d,, d,,d,,d,) = (1,2,4 1 3). Scanned with CamScanner