Register Number:
MODEL EXAMINATION II Date/Session 21.11.2024/FN Marks 100
Course code AD3351 Course Title Design and Analysis of Algorithm
Regulation 2021 Duration 3 Hours Academic Year 2024-2025
Year II Semester III Department AI&DS
COURSE OUTCOMES
CO1: Understand the design challenges in the cloud
CO2: Apply the concept of virtualization and its type
CO3: Experiment with virtualization of hardware resources and Dockers
CO4: Develop and deploy services on the cloud and set up a cloud environment
CO5: Explain security challenges in the cloud environment.
[Link]. Question CO BTS
PART A
(Answer all the Questions 10 x 2 = 20 Marks)
1 What are algorithm design technique? CO1 R
2 What is big oh notation? CO1 R
3 Enumerate some important types of problem. CO1 U
4 Define binary heaps. CO2 R
5 Write the applications of binary heap. CO2 R
6 What is spanning tree and minimum spanning tree CO3 R
7 Define quick sort and its steps. CO2 R
8 Comparison between Greedy method and Dynamic programming CO3 U
9 Define merge sort CO2 R
10 Difference between Prim’s and Kruskal’s algorithm CO3 R
PART B
(Answer all the Questions 2 x 15 = 30 Marks)
11 a Discuss in detail about fundamentals of problem solving CO1 U
OR
11 b Explain in detail about the algorithm efficiency CO1 R
12 a Write short notes on Mathematical analysis of recursive algorithms CO1 R
OR
12 b Solve the knapsack problem using assignment problem given below
Job 1 Job 2 Job 3 Job 4
Person 1 9 2 7 8
Person 2 6 4 3 7 CO2 R
Person 3 5 8 1 8
Person 4 8 6 9 4
13 a Explain in detail about quick sort algorithm with example CO2 E
Page 1 of 4
OR
Obtain the optimal binary search tree for the following nodes (do,if,int,while)
13 b With the following probabilities
CO3 U
a[i] 1 2 3 4
P[i] 0.1 0.2 0.4 0.3
OR
14 a Explain Strassen’s algorithm to compute
3 5 2 7 CO2 E
4 6 8 3
OR
14 b Write the pseudo code of the Floyd’s algorithm. Explain one application of CO3 E
Floyd’s algorithm
OR
15 a Explain the following: CO3 E
i) Kruskal’s Algorithm
ii) Dijkstra’s Algorithm
OR
15 b Explain the following: CO3 E
i) Prim’s algorithm
ii) Huffman tree’s
PART C
(Answer all the Questions 1 x 15 = 15 Marks)
16 a Apply the memory function method to the instance of knapsack problem given
below. Capacity W=5
Item (i) Weight (wi) Value (vi)
CO3 E
1 2 3
2 3 4
3 4 5
4 5 6
OR
16 b Discuss in detail about binary heaps following insertion and deletion operation CO2 A
Course Faculty HoD Principal
[Link] [Link] [Link]
Page 2 of 4