part - A should re candidates admitted during the academic year 201. ie ower ’ ‘be answered in OMR sheet within fist 45 minutes and OMR sheet “ver to hall invigilator af the end of 45 minute, . ‘Part B and Part - C should be answered in answer booklet. PART — A (20 x 1 =20 Marks) Answer ALL Questions 1. What does the algorithmic analysis count? (A) The numberof arithmetic operations that are required 10 run the program (B) The number of lines required by the program | (©) The number of seconds required by the program (D) The number of conditions required by the program 2 Let Tin) =n? +2n? +2)logn. What is the time complexity? (A) Orn) (©) O(n’ logn) 3. Which sorting algorithm is faster? (A) Bubble sort (©) Nonlinear sort (B) Of +7) () O(nlogn) (B) Insertion sort (D) Quick sort 4, The time factor when determining the efficiency of algorithm is measured by (A) Counting micro seconds (C) Counting the number of statements (B) Counting the number of key operations (D) Counting the kilobytes of algorithm 5, What is the recurrence for worst case of quick sort and what is the time complexity in worst case? (A) Recurrence is T(n) = Tin~2) + Ofn) and time complexity is Or) (B) Recurrence is T(n) (C) Recurrence is Tin) ‘n/0) + T(an/10) +O(n) and time complexity is O(n log nm) T(n/2) +O(n) and tire complexity is O(n log n) (D) Recurrence is T(n) = Tin-1) * O(n) and time complexity is Of?) 6. How do you call the selected keys in the quick sort method? (A) Outer key (©) Partition key 7. Worst case efficiency of binary search is (A) Logen +1 © (B) Inner key (D) Pivorkey (B) n (D) 2‘Time complexity of Kruskals algorithm in finding the minimum soaring ee of an . In TSP, we can get all the tours by generating all the permutations of _ undirected graph containing m vertices and n edges, ifthe edges are in (A) (mn) (B) O (mtn) © Om (D) Of) _ compute the tour Jengths and find the shortest among them (A) n+1 immediate cities (B)_n~ 1 intermediate (C) n+2immediate cities (D) n~2 intermediate cities Which of the following is not a backtracking algorithm? (A) Knight tour problem (B) N-queen problem. {C) Tower of Hanoi (D) M coloring problem What és the time complexity of the Floyd Warshall algorithm to calculate all pair shortest il. path in a graph with N vertices? (A) O (rr log n) (B) Or logn) © Om (D) © @) 12, Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph? (A) Dynamic programing (B) Back tracking (©) Greedy (D) Divide and conquer 13, In which of the following cases N queens problem does not exist. (A) n=2andn=4 (B) n=4andn=6 (©) n=2andn=3 (D) n=4andn=8 14, A solution that cither maximizes or minimizes a given objective function is called an (A) Optimal solution (B) Feasible solution (C) Local solution (D) Exact solution 15. What is an optimal Huffman code for alpha beta of the following set of frequencies 2:05, ! b:48, :07, d:17. e:10, 1:13? (A) 1010 (B) 0101 (©) 1001 (D) 1100 16. Which of the following is not used to solve a 0-1 knapsack problem? (A) Greedy (B) Dynamic programming (C) Branch and bound (D) Divide and conquer 17. Which of the following does not exist in complexity theory? (A) Best case (B) Worst case (C) Average case (D)_ Null case 18. Assuming P! = NP, which of the following is true? (A) NP hard = NP (B) NP complete = P (©) NP=o (D) NP complete up = Page 2 0f4 1OMPI-6/ASCS200)T(n)=2(n/2)+H then Tn) = ) OG) ®) 0) © 0) ®) OG) PART - B (§ x 4 = 20 Marks) Answer ANY FIVE Questions ‘21. Prove the equations using mathematical induction, where, T(1) = 0, T(m) = 2T (2) +n, where n 22. 22. Solve the recurrence relation using forward substitution method: fy =ty-1 +3 with inital condition fo = 4. 2B. ce . 25 10 Multiply the following two matrices using the Strassen method A=|~ |B=| , | and find the general resultant. 24. Find an optimal solution to the Knapsack instance m= 15 pr) = (10, 5, 15, 7, 6, 18, 3) and (w1, W2......W7) = (2, 3, 5, 7,1, 4, V. 2 Find the sum of subsets for the given set of integers: [5 10 25 50 100) forw=75. 26. Distinguish between NP-complete and NP-hard with suitable example. 27. List the merits and demerits of randomized algorithms. PART - C (5 x 12 = 60 Marks) Answer ALL Questions 28. 2.4. Solve the recurrence relation using Master theorem: T() = 87(n/2) +10n?, T(0)=0. ji, Solve the recurrence equation f,=nf,,.1 forn>1, fo (OR) b. Let i(n)=3n +2n? +3 for an algorithm. Let g(n) = n°. Prove that t(n) of this algorithm is Oli). | Caleulate the computing time of the step count and operation count for Fibonacei series and analyze the time complexity using Big-Oh notation. 29.a. Write an algorithm to perform merge sort on a sorted listed of elements. Analyze the algorithm for best case, average case and worst case. (OR) Page 3 of 4 AOMPL-6/1SCS2043,