0% found this document useful (0 votes)
30 views4 pages

Design of Algorithm Sep 2020 (2017 Scheme)

The document is an examination paper for the Fourth Semester B.E. Degree in Design and Analysis of Algorithms, consisting of various modules with questions on algorithms, data structures, sorting techniques, and optimization problems. It includes topics such as asymptotic notations, quick sort, greedy techniques, dynamic programming, and backtracking. Students are required to answer five full questions, choosing one from each module, with a total of 100 marks available.

Uploaded by

enoshmuthyala484
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
30 views4 pages

Design of Algorithm Sep 2020 (2017 Scheme)

The document is an examination paper for the Fourth Semester B.E. Degree in Design and Analysis of Algorithms, consisting of various modules with questions on algorithms, data structures, sorting techniques, and optimization problems. It includes topics such as asymptotic notations, quick sort, greedy techniques, dynamic programming, and backtracking. Students are required to answer five full questions, choosing one from each module, with a total of 100 marks available.

Uploaded by

enoshmuthyala484
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
For More Question Papers Visit - www.pediawikiblog.com 17843 Fourth Semester B.E. Degree Examination, Aug./Sept.2020 Design and Analysis of Algorithms me: 3 hrs. Max. Marks: 100 Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 1 a, Define an algorithm. Explain the characteristics of an algorithm (04 Marks) b. What are Asymptotic notations? List and describe the various asymptotic notations with an example of each, (08 Marks) c. Explain the general plan of mathematical analysis of non-recursive algorithm with an example. (08 Marks) OR 2 a. What is the worst case, best case and average case efficiencies of sequential search? (04 Marks) b. Illustrate mathematical analysis of recursive algorithm for Towers of Hanoi problem. (08 Marks) ¢. Discuss the important problem types and fundamental data structures. (08 Marks) Module-2 Discuss how Quick sort algorithm works to sort an array and trace for the following data Draw the tree of recursive calls made. (2s [91 [ 46 82 14 [ 5s _] Derive best case complexity of quick sort algorithm. (10 Marks) b. Obtain the topological sorting for the digraph shown in Fig.Q3(b), using source removal method. @ es Fig.Q3(b) (06 Marks) c. List out the advantages and disadvantages of divide and conquer technique. (04 Marks) OR 4a. Explain divide and conquer technique with its control abstraction. (04 Marks) b. Develop an algorithm for sorting elements using Simple merge. Apply the same for sorting list of elements given below: (67 [90 [ 12 J 56 | 23 [ 34 | 45 | (08 Marks) ©. Apply Strassen’s algorithm to compute 1021) fo1o01 4110/2104 + (08 Marks) 0130) |2 011 so21} [1350 For More Question Papers Visit - www.pediawikiblog.com For More Question Papers Visit - www. pediawikiblog.com 0 State Job sequencing with deadline problem. Find the solution generated by job sequencing problem for 7 jobs given profits 3, 5, 20, 18, 1, 6, 30 and deadlines 1, 3, 4, 3, 2, 1, 2 respectively. (04 Marks) Explain the concept of greedy technique for Prim’s algorithm. Obtain a minimum cost spanning tree for the graph below in Fig.Q5(b). 1 (08 Marks) Sort the given list of number using Heap sort: 2,777 176 Ts [473 ) (08 Marks) OR Explain Greedy criterion. Apply greedy method for the following instance of knapsack problem. Capacity of the knapsack (M) = 5 Item Weight | Value 1 Zz $12 2 1 $10 | eee ae ey ee 4 LA26 sis (08 Marks) Construct a Huffman code for the following data and encode the test BADEC. Character A |B | c | DE Probability [04 | 0.1 | 0.2 | 0.15 | 0.15 (06 Marks) Solve the below instance (Fig.Q6(c)) of single source shortest path problem with vertex a as the source. Fig. Q6(c) (06 Marks) Module-4 What is Dynamic programming? Using Warshall’s algorithm, obtain the transitive closure of the graph defined by the following adjacency matrix. 0100 r-|? 00! (04 Marks) 0000 1010 For More Question Papers Visit - www.pediawikiblog.com For More Question Papers Visit - www.pediawikiblog.com b. Define multistage graph problem. Determine the minimum cost path from source (S) to sink (T) for the graph in Fig.Q7(b) u Fig.Q7(b) (06 Marks) ©. Solve the below instance of Bellman-Ford algorithm [Fig.Q7(c)]. 1 Fig.Q7(c) (10 Marks) OR a. Explain Travelling Salesperson Problem (TSP). Solve the below instance of TSP using dynamic programming. 3 q 1 15 | 20_| 2 9 10 iB ai} - (08 Marks) b. Obtain optimal Binary search Tree for the following identifiers. 1 2 afi) [do [it pli] ot [02 (12 Marks) Module-5 a, Draw the state-space tree top generate solutions to 4-Queen’s problem. (04 Marks) b. Apply backtracking technique to solve the below instance of the subset sum problem. s={1,3,4,6} d=7 (08 Marks) ¢. Apply Branch_and_Bound technique to the following insurance of assignment problem. job! job2 job3 job4 9 2 7 8)Persona _|6 Person b C= (08 Marks) 5 7 noe 3 7 1 8] Persone 9 4] Persond For More Question Papers Visit - www.pediawikiblog.com For More Question Papers Visit - www.pediawikiblog.com OR How the Branch_and_Bound technique is different from backhacking? Solve the following insurance of knapsack problem using Branch_and Bound technique. Give knapsack capacity = 10. tesntenstima eal 2 Weight | 4 7 Valve 40 | 42— (08 Marks) Define Hamiltonian cycle. Check whether the Hamiltonian cycle exists for the graph given below in Fig.Q10(b). Fig.Q10(b) (04 Marks) Define the following : (Class P_— (ii) Class NP_—_(iii) NP Complete Problem (iv) NP Hard Problem, (08 Marks) For More Question Papers Visit - www.pediawikiblog.com

You might also like