J.B.

INSTITUTE OF ENGINEERING AND TECHNOLOGY

(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

COURSE : DESIGN AND ANALYSIS OF ALGORITHMS DEGREE: B.Tech

COURSE CODE: L225C YEAR: II SEMESTER: II

REGULATION: R22 COURSE TYPE: REGULAR
ACADEMIC YEAR : 2024-2025 CREDITS: 3

Name of Faculty Dr.M.BHEEMALINGAIAH

Question Bank

PART-A

S. NO Question CO Bloom’s Marks

Taxonomy
Module 1: Introduction Algorithms Algorithm
1 Define algorithms Algorithm CO1 L1 1
2 Define Pseudo Code for expressing Algorithms CO1 L1 1
3 What is Space Complexity? CO1 L1 1
4 What is Time Complexity? CO1 L1 1
5 What are different Asymptotic Notations? CO1 L1 1
6 Define Big-oh Notation, CO1 L1 1
7 Define Omega Notation CO1 L1 1
8 Define Theta Notation CO1 L1 1
9 Define Little oh Notation. CO1 L1 1
10 Explain Disjoint Set Operations CO1 L1 1
11 Explain Union and Find Algorithms CO1 L1 1
12 What is Spanning Trees CO1 L1 1
13 Explain Connected Components and Biconnected Components CO1 L1 1
Module-2: Divide and Conquer and Greedy Method
14 Define Divide and Conquer General Method CO2 L1 1
15 Explain Applications of Divide and Conquer CO2 L1 1
16 Explain Binary Search . CO2 L1 1
17 What is meant Best case, Average Case, Worst case? CO2 L1 1
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

18 What is Time complexity of Binary Search? CO2 L1 1
19 What is Time Complexity of Quick Sort? CO2 L1 1
20 What is Time Complexity of Merge Sort? CO2 L1 1
21 What is Time Complexity of Stassen’s Matrix Multiplication. CO2 L1 1
22 Define Greedy Method General Method CO2 L1 1
23 Write Applications of Greedy Method CO2 L1 1
24 Define Job Sequencing with Deadlines CO2 L1 1
25 Define 0/1 Knapsack Problem CO2 L1 1
26 Define Minimum Cost Spanning Trees: Single Source Shortest Path CO2
L1 1
Problem, Huffman Codes
27 What is difference between Prim’s and Kruskal’s Algorithms, CO2 L1 1
28 Define Single Source Shortest Path Problem, CO2 L1 1
29 Define Huffman Codes CO2 L1 1
Module 3: Dynamic Programming

30 Define Dynamic Programming General Method CO3 L1 1

31 Define Principle of Optimality CO3 L1 1
32 Write Applications of Dynamic Programming CO3 L1 1
33 What Multistage Graphs? CO3 L1 1
34 What is Matrix Chain Multiplication? CO3 L1 1
What is Optimal Binary Search Trees? CO3 L1 1
35 Explain how to apply Dynamic Programming to 0/1 Knapsack CO3
L1 1
Problem
36 What is All Pairs Shortest Path Problem? CO3 L1 1
37 What is Travelling Sales Person Problem? CO3 L1 1
38 What is Reliability Design? CO3 L1 1
Module – 4: Backtracking
39 Explain Backtracking General Method CO4 L1 1
40 Write Applications of Backtracking CO4 L1 1
41 Define Nqueen Problem CO4 L1 1
42 What is Recursive Permutation Generator CO4 L1 1
43 Define Sum of Subsets Problem CO4 L1 1
44 Define Graph Coloring CO4 L1 1
45 Define Hamiltonian Cycles CO4 L1 1
, CO4 L1 1
Module-5: Branch and Bound , NP-Hard and NP-Complete Classes
46 Define Branch and Bound General Method CO5 L1 1
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

47 Write Applications of Branch and Bound CO5 L1 1
48 Define LC Branch and Bound Solution CO5 L1 1
49 Define FIFO Branch and Bound Solution CO5 L1 1
50 Define P and NP Classes CO5 L1 1
51 Non-Deterministic Algorithms CO5 L1 1
52 NP-Hard and NP-Complete Classes CO5 L1 1
53 Cook’s Theorem. CO5 L1 1

PART-B

S. NO Question CO Bloom’s Marks

Taxonomy
Module 1: Introduction Algorithms Algorithm
1 Write difference algorithms Algorithm and Pseudo Code CO1 L2 5
2 What is Space Complexity and Time Complexity? CO1 L2 5
3 What are different Asymptotic Notations? CO1 L2 5
4 Define Big-oh Notation and show that
CO1 L3 5
𝑓 (𝑛) = 𝑂(𝑔(𝑛) 𝑤ℎ𝑒𝑟𝑒 𝑓 (𝑛) = 5𝑛 + 50
5 Define Omega Notation and show that
CO1 L3 5
𝑓 (𝑛) = Ω(𝑔(𝑛) 𝑤ℎ𝑒𝑟𝑒 𝑓(𝑛) = 10𝑛2 + 5
6 Define Theta Notation and show that
1 CO1 L3 5
𝑓 (𝑛) = 𝜃(𝑔(𝑛) 𝑤ℎ𝑒𝑟𝑒 𝑓(𝑛) = 𝑛2 − 3𝑛
2
7 Define Little oh Notation show that
CO1 L3 5
𝑓 (𝑛) = 𝑜(𝑔(𝑛) 𝑤ℎ𝑒𝑟𝑒 𝑓 (𝑛) = 2𝑛
8 Explain Disjoint Set Operations with suitable examples CO1 L2 5
9 Explain Union and Find Algorithms with suitable example CO1 L1 5
10
What is Spanning Trees and construct minimum cost spanning tree
for following graph

10 2 50
1
45 40 CO1 L3 5
30 35

25
55
20 15
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

12 Explain difference between Connected Components and Biconnected
CO1 L2 5
Components
13 What is Articulation Point in Graph? Find the Articulation Points in CO1 L3 5
the following graph
6

1 5

4 2 7

3 8

0 9

Module-2: Divide and Conquer and Greedy Method

14 Explain Divide and Conquer General Method and its Applications CO2 L2 5
15 Write Binary Search algorithm and its estimate time complexity CO2 L2 5
16 What is meant Best case, Average Case, Worst case with suitable CO2
L2 5
examples
17 Write Quick Sort Algorithm and sort following elements in CO2
L3 5
ascending order 65, 70 ,75, 80, 85, 60, 55, 45
18 Analyze the Time Complexity of Quick Sort ? Q L4 5
19 Write Merge Sort Algorithm and sort following elements in CO2
L3 5
ascending order 10,30,50,60,20,40,70,80
20 Estimate Time Complexity of Merge Sort? CO2 L4 5
21 Explain Stassen’s Matrix Multiplication and Apply it to following CO2
Matrices
1 2 4 3 10 2 4 3
8 7 5 9 8 7 5 9 L3 5
𝐴=[ ] 𝐵=[ ]
10 5 7 12 10 15 7 12
3 7 4 9 3 7 4 10
.
22 Explain difference between Dived and Conquer and Greedy Method CO2 L2 5
23 Write Applications of Greedy Method CO2 L2 5
24 Define Job Sequencing with Deadlines and Find the optimal solution CO2
For n=5, L3 5
(P1,P2,P3,P4,P5)=(20,15,105,1) and (d1,d2,d3,d4,d5)=(2,2,1,3,3)
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

25 Define 0/1 Knapsack Problem and Find the optimal solution for CO2
following for n=3, (P1,P2,P3)=(20,1515) , (W1,W2,W3)=(100,10,10)
L3 5
and m=105

26 Define Minimum Cost Spanning Trees and Find minim cost spanning CO2
tree for following graph using Kruskal’s Algorithms

L3 5

27 Explain is difference between Prim’s and Kruskal’s Algorithms with CO2

suitable example .
L2 5

28 Write Single Source Shortest Path algorithm and find shortest paths CO2
form vertex 0 in the following graph

L3 5

29 Explain Huffman Code with suitable example CO2 L2 5

Module 3: Dynamic Programming

30 Explain Dynamic Programming General Method and its applications CO3 L1 1

31 Explain difference between Dived and Conquer and Dynamic CO3
L1 1
Programming
32 Explain difference between Greedy Method and Dynamic CO3
Programming
L1 1
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

33 What Multistage Graphs? And Find Minmi cost form vertex 1 to

vertex 12 in the multistage graph

L3 5

34 What is Matrix Chain Multiplication? And Explain it suitable CO3

L2 5
example
35 What is Optimal Binary Search Trees? Explain it suitable example CO3 L2 5
35 Explain how to apply Dynamic Programming to 0/1 Knapsack CO3
L2 5
Problem
36 Explain is All Pairs Shortest Path Problem? And find shortest paths CO3
between all pairs in following graph

L3 5

37 Explain Travelling Sales Person Problem with suitable example CO3

L2 5
38 Explain Reliability Design with suitable example CO3

L2 5
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
(UGC AUTONOMOUS)
Bhaskar Nagar, Moinabad Mandal, R.R. District, Hyderabad -500075

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Module – 4: Backtracking
39 Explain Backtracking General Method and write Applications of CO4
L2 5
Backtracking
40 Explain Nqueen Problem and write solution using state space search CO4 L3 5
41 Explain Recursive Permutation Generator with suitable example CO4 L2 5
42 Describe Sum of Subsets Problem with suitable example CO4 L2 5
43 Describe Graph Coloring with suitable example CO4 L2 5
44 Describe Hamiltonian Cycles with suitable example CO4 L2 5
Module-5: Branch and Bound , NP-Hard and NP-Complete Classes
45 Define Branch and Bound General Method and Write Applications of CO5
L2 5
Branch and Bound
46 Explain Travelling Sales Person Problem using Branch and Bound CO5 L2 5
47 Explain 0/1 Knapsack problem using Branch and Bound CO5 L2 5
48 Explain FIFO Branch and Bound Solution with suitable example CO5 L2 5
49 Describe P and NP Classes with suitable example CO5 L2 5
50 Explain Non-Deterministic Algorithms CO5 L2 5
51 Describe NP-Hard and NP-Complete Classes with suitable example CO5 L2 5
53 Describe Cook’s Theorem. with suitable example CO5 L2 5