Department of CSE (AI&ML)

B. Tech mid Question Bank (R22 Regulation)

Academic Year: 2025-26 Semester:V
Subject Name: Design & Analysis of Algorithms

PART-A
[Link] Questions Marks BL CO Unit No
Mid - I
1 Define algorithm. 2 L1 CO1 1
Define order of an algorithm and the need to analyse
2 2 L1 CO1 1
the algorithm.
3 Define time and space complexity? 2 L1 CO1 1
4 List the asymptotic notations. 2 L1 CO1 1
5 List the applications of Divide and conquer method. 2 L2 CO1 1
6 What is the time complexity of binary search? 2 L1 CO1 1
7 Define graph. 2 L1 CO2 2
8 What is sum of subsets problem? 2 L2 CO2 2
9 Write an algorithm of simple union. 2 L3 CO2 2
List the applications of backtracking and define the
10 2 L2 CO2 2
State Space tree in backtracking?
11 What is priority- Queue Heap? 2 L1 CO2 2
12 What is Hamiltonian cycle? 2 L1 CO2 2
13 DefineSingle source shortest path problem? 2 L1 CO3 3
14 List the application of dynamic programming. 2 L2 CO3 3
15 What do you mean by dynamic programming? 2 L1 CO3 3
Mid - II
What is the importance of knapsack algorithm in our
16 2 L2 CO3 3
daily life?
17 Define optimal binary search tree with an example. 2 L2 CO3 3
18 What is travelling sales person problem? 2 L1 CO3 3
19 List the applications of greedy method. 2 L2 CO4 4
20 What is complete binary tree? Give an example. 2 L1 CO4 4
21 List the tree traversal methods with an example. 2 L3 CO4 4
22 What is AND/OR graph? 2 L1 CO4 4
23 Define articulation point. 2 L1 CO4 4
24 Give brief description on greedy method. 2 L2 CO4 4
25 List the applications of branch and bound. 2 L2 CO5 5
26 What is minimum spanning tree? 2 L1 CO5 5
27 What do you mean by bounding? 2 L1 CO5 5
State the difference between FIFO and LC Branch
28 2 L4 CO5 5
and Bound algorithms.
29 What is NP-hard problem? 2 L1 CO5 5
30 What is meant by non-deterministic algorithm? 2 L1 CO5 5
 PART-B
[Link] Questions Marks BL CO Unit No
Mid – I
1 What is an algorithm? Explain its characteristics. 4 L2 CO1 1
Discuss various asymptotic notations used for best
2 case average case and worst case analysis of 4 L2 CO1 1
algorithms
Describe the master’s theorem. and solve the
following recurrence relation by using master’s
3 theorem 4 L3 CO1 1
T(n)=4T(n/2)+n b) T(n)=2T(n/2)+nlogn

Write an algorithm for quick sort Technique.

4 4 L3 CO1 1
Ex: 7,2,1,6,8,5,3,4.
Write an algorithm for merge sort. Explain with an
5 4 L3 CO1 1
example
Explain binary search algorithm and find the time
6 4 L2 CO1 1
complexity of it?
Why do we use asymptotic notations in the study of
7 algorithms? Briefly describe the commonly used 8 L2 CO1 1
asymptotic notations.
Show the results of running Quick sorting technique
8 on the sequence 38,27,43,3,9,82,[Link] derive the 8 L4 CO1 1
average case time complexity.
Explain the Strassen’s matrix multiplication and find
9 the time complexity of it? 8 L2 CO1 1

10 Explain the Find algorithm with collapsing rule. 4 L2 CO2 2

11 Describe Union and Find algorithms 4 L2 CO2 2
Write an algorithm of weighted union and also
12 4 L3 CO2 2
compute the time complexity of the same.
Solve the following to find the Hamiltonian cycles
using backtracking technique(Use state space tree)

13 4 L3 CO2 2

Describe the Backtracking technique to the m-

14 colouring graphand draw the state space tree for that 4 L3 CO2 2
problem?
Sort the following elements ( 82,90,10,12,15,77,55) by
15 4 L3 CO2 2
using Heap Sort Technique .
16 Solve the following using graph coloring problem? 8 L3 CO2 2
(Given colors R,G,B)
 Write an algorithm for the 8-queens problem using
17 8 L3 CO2 2
back tracking with an example.
Find the sum of sub sets for the following sets of
18 integers by using fixed tuple method. 8 L3 CO2 2
(5,10,12,13,15,18) For M=30
Discussing about the dynamic programming and find
the all pairs shortest path following graph.

19 4 L3 CO3 3

Explain bellman ford algorithm for single source

shortest method by using dynamic programming.

20 4 L2 CO3 3

Solve the following knapsack Problem using dynamic

programming approach where n=4,capacity of
21 4 L3 CO3 3
knapsack is m=8,
(p1,p,2,p3,p4)=(1,2,5,6),(w1,w2,w3,w4)=(2,3,4,5)
Mid - II
Compute all pairs shortest path for following graph

22 4 L3 CO3 3

What do you mean by forward and backward approach

23 4 L2 CO3 3
of problem solving in Dynamic Programming?
24 Discuss about the Reliability design problem? 4 L2 CO3 3
25 Define spanning tree. with an example. 4 L2 CO4 4
26 Explain the prim’s algorithm with an example. 4 L3 CO4 4
Discuss about the various binary tree traversal
27 4 L3 CO4 4
methods with an examples.
 Differentiate between greedy method and dynamic
28 4 L4 CO4 4
programming
Explain the properties of connected and Bi-connected
29 4 L2 CO4 4
components.
30 Discuss briefly about the minimum cost spanning tree. 4 L2 CO4 4
Explain about Kruskal’s Algorithm and find out the
Minimum Cost Spanning tree for the following graph
using Kruskals Algorithm

31 8 L3 CO4 4

Explain the problem of job sequencing with deadlines

by taking an example. Write the algorithm to solve the
problem using the Greedy Method. Show how the
32 8 L3 CO4 4
algorithm solves the following job sequencing with
deadlines problem. n = 4, (p1, p2, p3, p4) = (100, 10,
15, 27) and (d1, d2, d3, d4) = (2, 1, 2, 1)
Compute the optimal solution for knapsack problem
using greedy method N=3, M= 20, (p1,p2,p3)=
33 8 L3 CO4 4
(25,24,15), (w1,w2,w3) =(18,15,10)

34 Discuss about the satisfiability problem 4 L2 CO5 5

35 Differentiate between NP-complete and NP-Hard. 4 L4 CO5 5
36 Explain the non-deterministic sorting problem. 4 L2 CO5 5
37 Discuss the FIFO branch and bound. 4 L2 CO5 5
Solve the following knapsack instance, n=5, M=12
(P1P2P3P4P5) = (10,15,6,8,4)
38 (W1W2W3W4W5) = (4,6,3,4,2) 4 L3 CO5 5
Using LIFO branch and bound.

Explain the strategy to prove that a problem is NP

39 4 L2 CO5 5
hard.
Solve the following instance of travelling sales person
problem using Least Cost Branch Bound
∞ 12 5 7
40 11 ∞ 13 6 8 L3 CO5 5
4 9 ∞ 18
10 3 2 ∞

Draw the portion of state space tree generated by FIFO

branch and bound for the knapsack instance, n=4
41 (p1, p2, p3, p4) = 10,10,12,18 8 L3 CO5 5
(w1,w2,w3,w4)= 2,4,6,9 and M=15.

42 Explain the classes of P ,NP and cook’s theorem. 8 L2 CO5 5

 Note
 Mid Question paper contains Part-A and Part-B. Each question in Part-A
carries 2 marks. Prepare a list of 6 short answer questions from each unit
as per the format shown above for PART-A.
 For PART-B, prepare a list of 6 questions carrying 4 marks each from
[Link] list of 6 questions carrying 4 marks each and 3 questions
carrying 8 marks each from 1 st, 2nd, 4th and 5th Units as per the format
shown above for PART-B.
 Details of questions and marks unit wise:
No of Marks for each
[Link] Unit No PART-A/B
Questions question
PART-A 6 2
1 I 6 4
PART-B
3 8
PART-A 6 2
2 II 6 4
PART-B
3 8
PART-A 6 2
3 III
PART-B 6 4
PART-A 6 2
4 IV 6 4
PART-B
3 8
PART-A 6 2
5 V 6 4
PART-B
3 8