BUE401

USN

Model Question Paper-1 with effect from 2022-23 (CBCS Scheme)

Fourth Semester B.E. Degree Examination
Design and Analysis of Algorithms
Time: 03 Hours Max. Marks: 100

Note: Answer any FIVE full questions, choosing at least ONE question from each MODULE.

Bloom’s
Module -1 Taxonomy Marks
Level
a Define an Algorithm. Explain the characteristics of an Algorithm. L1, L2 06
b Explain the Divide and Conquer technique. L2 04
Q. 1 Explain the Merge Sort algorithm. Apply Merge Sort algorithm to sort the
c given characters. L3 10
U N I V E R S I T Y

OR
Explain the following Asymptotic notations:
a L1, L2 06
(i) Big O (ii) Big Ω (iii) Theta ϴ
b Explain how Strassen's algorithm is better for matrix multiplication. L2 04
Q. 2 Write the algorithm for Binary Search. Apply Binary Search algorithm to
c find the key value 63 from the given array. L3 10
7 14 21 28 35 42 49 56 63 70
Module-2
What are Disjoint Sets? Give the Tree, Data and Array representation for the
a L1, L2 05
given three sets: S1 = {3, 7 , 8, 9}, S2 = {2, 4, 5} and S3 = {1, 6}
Q. 3 b Explain how Union algorithm works on Disjoint Sets with an example. L2 05
c Solve the 4-Queens Problem by using the Backtracking approach. L3 10
OR
a Explain the Graph Coloring Problem with an example. L2 05
Apply Find algorithm to search for an element 4 in the given tree.

Q. 4 b L3 05

Apply Backtracking technique to solve the Sum of Subset Problem for the
c L3 10
instance d = 15 and S = {3, 5, 6, 7}.
Module-3
Find the all pairs shortest paths for the given graph using Floyd’s algorithm.

Q. 5 a L3 10

Page 1 of 3
 BUE401
Apply Dynamic Programming to solve the given travelling salesperson
problem.

b L3 10

OR
Construct an Optimal Binary Search Tree for the given data:
n=4
a (a1, a2, a3, a4) = (do, if, int, while) L3 10
p(1:4) = (3, 3, 1 ,1)
q(0:4) = (2, 3, 1, 1, 1).
Q. 6 Using Dynamic Programming, solve the given instance of 0/1 Knapsack
problem. Consider the capacity of Knapsack (m) = 5.
b Item 1 2 3 4 L3 10
Weight 2 1 3 2
Value 12 10 20 15

Module-4
Apply single source shortest path algorithm to the given graph by
considering ‘P’ as source vertex.

a L3 10

Q. 7

Apply Greedy method for the following instance of Knapsack problem.

Given: Knapsack capacity (M) = 15.
b Item 1 2 3 4 5 6 7 L3 10
Weight 2 3 5 7 1 4 1
Profit $ 10 $5 $ 15 $7 $6 $ 18 $3
OR
Apply Prim's algorithm to obtain a minimum cost spanning tree for the
given graph.

a L3 10

Q. 8

For the given data, find the optimal job sequence and maximum profit using
Greedy approach.
b Job J1 J2 J3 J4 J5 L3 10
Profit 60 100 20 40 20
Deadline 2 2 3 1 1

Page 2 of 3
 BUE401
Module-5
Solve the given instance of 0/1 Knapsack problem using Branch and Bound
technique. Given: Knapsack Capacity (m) = 15
a Item 1 2 3 4 L3 10
Profit 10 10 12 18
Weight 2 4 6 9
Q. 9
Explain the following:
(i) Class P
b (ii) Class NP L2 10
(iii) NP Complete Problem
(iv) NP Hard Problem.
OR
Apply the Branch and Bound algorithm to solve the travelling salesperson
problem for the given graph.

a L3 10
Q. 10

Explain:
b (i) Cook’s theorem L2 10
(ii) Non-deterministic algorithms.

*****

Page 3 of 3
 BUE401

USN

Model Question Paper-2 with effect from 2022-23 (CBCS Scheme)

Fourth Semester B.E. Degree Examination
Design and Analysis of Algorithms
Time: 03 Hours Max. Marks: 100

Note: Answer any FIVE full questions, choosing at least ONE question from each MODULE.

Bloom’s
Module -1 Taxonomy Marks
Level
Apply Strassen's algorithm to multiply the following matrices.
a 4 3 1 2 L3 10
[ ]*[ ]
1 2 6 5
Q. 1
b What are the criteria that an algorithm must satisfy? L1 05
c Explain Space Complexity and Time Complexity of an algorithm. L2 05
OR
Apply Quick Sort algorithm to the following set of numbers.
a L3 10
65, 70, 75, 80, 85, 60, 55, 50, 45
Q. 2
What are Asymptotic Notations? List and describe the various asymptotic
b L1, L2 10
notations.
Module-2
Apply Backtracking technique to solve the Sum of Subset Problem for the
a L3 10
instance d = 7 and S = {1, 3, 4, 6}.
Q. 3 Explain the following operations of Disjoint Sets:
b (i) Union L2 10
(ii) Find
OR
Construct the state space tree using Graph Coloring approach for the given
graph when m=3.

a L3 10
Q. 4

b Discuss the N-Queens Problem using Backtracking approach. L2 10

Module-3
What is an Optimal Binary Search Tree? Obtain an Optimal Binary Search
Tree for the given data:
(a1, a2, a3, a4) = (end, goto, print, stop)
a 1 1 1 1 L1, L3 10
p1 = 20 , p2 = 5 , p3 = 10 , p4 = 20
1 1 1 1 1
q0 = 5 , q1 = 10 , q2 = 5 , q3 = 20 , q4 = 20

Apply all pairs shortest path algorithm for the given graph.
Q. 5

b L3 10

Page 1 of 3
 BUE401
OR
State Traveling Salesperson Problem. For the given cost matrix, obtain the
optimal cost tour for the travelling salesperson using Dynamic
Programming.

a L1, L3 10

Q. 6

Solve the given instance of 0/1 Knapsack problem using Dynamic

Programming. Given the capacity of Knapsack (m) = 8.
b Item 1 2 3 4 L3 10
Weight 2 3 4 5
Profit 1 2 5 6

Module-4
Apply Greedy method for the following instance of Knapsack problem,
where Knapsack capacity (M) = 5.
Item Weight Value
a 1 2 $12 L3 07
2 1 $10
3 3 $20
4 2 $15
Q. 7 Apply Dijkstra’s algorithm to the given graph by considering ‘a’ as source.

b L3 08

c What is Job Sequencing with Deadlines problem? Explain. L2 05

OR
Define minimum cost spanning tree. Obtain a minimum cost spanning tree
for the given graph using (i) Prim’s Algorithm and (ii) Kruskal’s Algorithm.

a L1, L3 15
Q. 8

Explain the concept of Reliability Design when devices are connected in

b L2 05
series and parallel.
Module-5
a State and explain Cook’s theorem. L1, L2 05
b Write a note on Non-deterministic algorithms. L2 05
Obtain LC Branch and Bound solution to the given 0/1 Knapsack problem,
Q. 9 which has a capacity of 15.
c Item 1 2 3 4 L3 10
Weight 2 4 6 9
Value 10 10 12 18

Page 2 of 3
 BUE401
OR
Explain the following:
(i) Class P
a (ii) Class NP L1, L2 10
(iii) NP Complete Problem
(iv) NP Hard Problem.
Solve the given traveling salesperson problem using Branch and Bound
technique.
Q. 10

b L3 10

*****

Page 3 of 3