RV Institute of Technology

UGC-Autonomous
II-B.Tech II-Semester Question Bank
Branch :CSE,AIML,DS
Academic Year 2024-25

Advance data structures and algorithm analysis

Questions Bank

UNIT-1
Short Answer Questions:
S.
Question Marks CO BL PO PSO
No
Define asymptotic notations and list different
1 2 1 L1 PO1, PO2 PSO1
types.
PO1, PO2,
2 What is a B-Tree? Explain its applications. 2 1 L2 PSO1
PO3
PO1, PO2,
3 What is an AVL tree? Explain its applications. 2 1 L2 PSO1
PO3

4 Compare B-Trees and AVL Trees. 2 1 L4 PO2, PO4 PSO1

What is the balance factor in AVL trees? Give an

5 2 1 L3 PO1, PO2 PSO1
example.

Long Answer Questions:

S.
Question Marks CO BL PO PSO
No
Explain algorithm analysis and its importance.
PO1, PO2,
1 Discuss different types of complexities 10 1 L2 PSO1
PO4
Involved
Describe the time and space complexity
analysis of algorithms. How are Big O, Big PO1, PO2,
2 10 1 L3 PSO1
Theta, and Big Omega used to express PO3
complexity?
What are AVL trees? Explain insertion and PO1, PO2,
3 10 1 L4 PSO1
deletion with examples. PO3, PO4

What are B-Trees? Explain creation, insertion, PO1, PO2,

4 10 1 L4 PSO1
deletion, and applications. PO3, PO4

Explain the advantages of AVL and B-Trees over

PO1, PO2,
5 other tree data structure in term of Searching, I 10 1 L5 PSO1
insertion, and Deletion Operations PO3, PO4
 RV Institute of Technology
UGC-Autonomous
II-B.Tech II-Semester Question Bank
Branch : CSE,AIML,DS
Academic Year 2024-25

UNIT-2
Short Answer Questions:

SNO Question Marks CO BL PO PSO

1 Define Min Heap and Max Heap with 2 2 L1 PO1, PO2 PSO1
examples.
PSO1,PSO2
2 What are priority queues? Mention their 2 2 L2 PO1, PO2
applications.
3 Differentiate between BFS and DFS in graph 2 2 L4 PO2, PO3 PSO1
traversal.
What are connected and biconnected
4 2 2 L2 PO2, PO3 PSO1
components in graphs?
5 Define Divide and Conquer with an example. 2 2 L2 PO2, PO3 PSO1

Long Answer Questions:

1 What is a Heap? Explain the difference PO1, PSO1
between Min Heap and Max Heap. Discuss 10 2 L4 PO2,
the insertion and deletion operations in heaps. PO3
2 How do you represent a graph? Explain the PSO1
adjacency matrix and adjacency list 10 2 L3 PO2, PO3
representations of a graph.
3 Discuss the basic search and traversal PO2, PSO1,
techniques in graphs (BFS and DFS). How are PO3, PSO2
connected and biconnected components 10 2 L4 PO4
identified?
4 Explain the Divide and Conquer method. PO2, PSO1
Provide detailed steps for Quick Sort and 10 2 L5 PO3,
Merge Sort algorithms. PO5
5 What is the Convex Hull problem? Explain PO2, PSO1,
the solution to the Convex Hull problem 10 2 L5 PO3, PSO2
using Divide and Conquer technique. PO5
 RV Institute of Technology
UGC-Autonomous
II-B.Tech II-Semester Question Bank
Branch : CSE,AIML,DS
Academic Year 2024-25

UNIT-3
Short Answer Questions:
S. Question Marks CO BL PO PSO
No
1 What is the Greedy Method? 2 L1 PO1, PO2 PSO1
2
2 Define the Knapsack Problem. 2 L1 PO1, PO2 PSO1
2
3 What is a Minimum Cost Spanning Tree (MST)? 2 L2 PO2, PO3 PSO1
2
PSO1,
4 State Dijkstra’s algorithm and its purpose. 2 2 L2 PO2, PO3
PSO2
5 What is Dynamic Programming? Give an example. 2 2 L2 PO2, PO3 PSO1

Long Answer Questions:

1 What is the Greedy method? Discuss the Job PO1, PO2, PSO1
Sequencing with deadlines problem and its 10 2 L4 PO3
solution using the Greedy approach.
2 Explain the 0/1 Knapsack problem. How can PO2, PO3 PSO1,
the Greedy method be used to solve this 10 2 L4 PSO2
problem?
3 Describe the process of finding the Minimum PO2, PO3, PSO1
Cost Spanning Tree using Prim’s and 10 2 L5 PO4
Kruskal’s algorithm.
4 What is Dynamic Programming? Explain the PO2, PO3, PSO1,
All-Pairs Shortest Paths problem and the 10 2 L5 PO5 PSO2
solution using Dynamic Programming.
5 Explain the Bellman-Ford algorithm and its PO2, PO3, PSO1,
application to find the shortest paths from a 2 PO5 PSO2
10 L5
single source in a graph with negative
weights.
 RV Institute of Technology
UGC-Autonomous
II-B.Tech II-Semester Question Bank
Branch : CSE,AIML,DS
Academic Year 2024-25

UNIT-4
Short Answer Questions:
S.
Question Marks CO BL PO PSO
No
1 What is backtracking? Give an example. 4 L2 PO1, PO2 PSO2
2
2 State the 8-Queens problem. 4 L2 PO1, PO2 PSO2
2

Explain the graph coloring problem in 2

3 backtracking. Define the Travelling 4 L3 PO1, PO2 PSO2
Salesperson Problem (TSP) in Branch and
Bound.
What is the difference between backtracking L4
4 2 4 PO1, PO2 PSO1
and Branch & Bound?

Long Answer Questions:

Mar
SNo Question CO BL PO PSO
ks
What is Backtracking? Discuss the general
P PO2,
1 method of backtracking and its application to the 10 4 L4 PSO2
PO3
8-Queens problem.
Explain the Sum of Subsets problem and how
2 10 4 L4 PO1, PO2 PSO2
backtracking is used to solve it.
How is Graph Coloring approached using
PO1, PO2,
3 backtracking? Explain the solution approach and its 10 4 L5 PSO2
PO3
complexity.
What is the 0/1 Knapsack problem and how is it
4 10 4 L5 PO1, PO2 PSO2
solved using Backtracking?
Explain the concept of Branch and Bound. How is it
5 applied to solve the Traveling Salesperson Problem 10 4 L5 PO2, PO3 PSO2
(TSP)?
 RV Institute of Technology
UGC-Autonomous
II-B.Tech II-Semester Question Bank
Branch : CSE,AIML,DS
Academic Year 2024-25

UNIT-5
Short Answer Questions:

SNo Question Marks CO BL PO PSO

1 Define NP-Hard and NP-Complete 5 PO1, PO2 PSO2
2 L1
problems.
2 What is Cook’s theorem? 5 L1 PO1, PO2 PSO2
2
3 Define the Clique Decision Problem 5 PO1, PO2 PSO2
2 L1
(CDP).
4 What is the Chromatic Number Decision 2 5 L2 PO1, PO2 PSO2
Problem (CNDP)?
Explain the difference between P, NP,
5 2 5 L2 PO1, PO2 PSO1
NP-Hard, and NP- Complete classes.

Long Answer Questions:

SNo Question Marks CO BL PO PSO

What are NP-Hard and NP-Complete problems?

1 10 5 L2 PO1, PO2, PO3 PSO2
Explain the difference between these two classes
with examples.
Explain Cook’s theorem and its significance in the
2 10 5 L2 PO1, PO2 PSO2
theory of NP-completeness.
Discuss the Clique Decision Problem (CDP) and its
3 10 5 L3 PO1, PO2, PO3 PSO2
relation to NP-Hard problems.

How is the Chromatic Number Decision Problem

4 10 5 L3 PO1, PO2 PSO2
(CNDP) related to graph coloring and NP-Hard
problems?
Explain the Job Shop Scheduling problem in the
5 context of NP-Hard problems. How is it classified, 10 5 L4 PO2, PO3 PSO2
and what are its practical applications?