Question Bank for II B.

Tech-I Semester
Course:Advanced Data Structures and Algorithms Regulation : R23
Academic Year:2024-2025 Branch :CSE
UNIT-1

Part-A
Short Answer Questions (2M)
Q. No Question BL CO PO
1 What is an algorithm? I I III
2 Write the pseudo code for finding the factorial of given
I I I
number.
3 How can you access a member variable of a structure in C+
+? Provide an example using both dot (.) and arrow (->) I I I
operators.

4 What is a structure in C++? Provide a brief definition. I I I

5 Define a pointer in C++ I I II
6 What is a pointer object in C++? How does it differ from a
I I I
regular pointer?
7 What is the balance factor of a node in an AVL tree? I I I
8 What is an AVL tree? Discuss its basic operations. I I I
9 Why is an AVL tree required? I I I
10 What are the applications of AVL trees? I I I
11 What is B-tree? I I I
12 What are the properties of B-trees? I I I
13 What are the Applications of B-Trees? I I I

Part-B
Long Answer Questions (10M)
Q. No Question BL CO PO
1 a Explain the principles of Object Oriented Programming. II I I
What are Objects and Classes inObject Oriented
b Programming.? Explain I I I

2 a Explain different Access Control Specifiers in C++. II I I

Page 1 of 11
 What is a structure in C++? How does it differ from a
b class?Explain I I II

3 How can you access members of a structure in C++?

a Provide syntax examples. I I I

Explain the concept of members in a structure. What

types of members can a structure contain?
b OR II I II
Can structures contain functions in C++? If so, how are
these functions defined and accessed?

4 How do you declare a pointer in C++? Provide syntax

examples for different data types. I I I

5 a Explain the concept of an array of pointers in C++. II I I

b What is an algorithm in the context of data structures? I I I

6 How to describe the algorithms in natural languages?
a Explain the structure of pseudo code for various algorithm II I I
constructs
What are the different pseudo code conventions used to
b I I I
represent an algorithm.
7 What is an AVL tree? How do we define the height of it?
a Discuss about the balance factor associated with a node of I I I
an AVL tree
Construct AVL tree for the following numbers 14, 8, 12,
b VI I I
36, 23, 5, 67, 78, 20
8 a Explain the rotations of AVL Tree with an example II I III

9 What do you mean by a balance factor in AVL tree and

a I I II
explain about LL & RR rotations with an example
What do you mean by height of an AVL tree and explain
b I I II
about double rotations with an example
10 a What are the Applications of AVL Trees? Explain I I II
What are the advantages and disadvantages of AVL
b VI I II
Trees? Explain
11 a Explain AVL insertion algorithm with an example. II I II
b Explain AVL deletion algorithm with an example. II I II
12 Explain the deletion operation of B Trees with an example
a II I II

What is a B-Tree. Specify its properties and describe the

construction of a B-Tree for the following elements 5,
b I I II
2,16,9,23,7,3,5,1,12

13 a What are the Applications of B- Trees? Explain I I II

What are the advantages and disadvantages of B-Trees?
b I I II
Explain

Page 2 of 11
 UNIT-11
Part-A
Short Answer Questions (2M)
Q. No Question BL CO PO
1 Which data structures are used in DFS and BFS I II I
2 How do you delete an element from heap? I II I
3 What are the working principles of divide and conquer with
I II II
finding factorial of ‘n’
4 What is the Difference between DFS and BFS ? I II II
5 Define algorithm. I II II
6 Define pseudo code. I II II
7 Define Connected component and Bi Connected component. I II II
8 Explain the Difference between Time complexity and space II II II
complexity .
9 Define Big Oh Notation for F(n)= 3n+2 I II II
10 Write different asymptotic notations. I II II
11 Explain the stages of divide and conquer? II II II
12 What are the applications of divide and conquer? I II II
13 Write the notations of worst case, best case and average case II
I II
time complexity for quick sort.
14 What are the Data structures using by DFS and BFS? I II II
15 What are the applications of Heap Trees? I II II
16 Write the notations of worst case, best case and average case II
I II
time complexity for Merge sort.
17 What is Convex Hull? I II II

Part-B
Long Answer Questions (10M)
Q. No Question BL CO PO
1 Write a short notes on heap trees and explain the insertion and
a deletion process with an example I II I

2 a What are the operations and applications of heap trees I II I

Explain the following terms with an example

b a)Complete graph b) degree of the node c) path II II III

d) weighted graph

3 Explain DFS Algorithm with an example II II III

4 Explain BFS Algorithm with an example II II III
Page 3 of 11
5 Write a short notes on connected components with an
example graphs I II III

6 Write an algorithm for quick sort and explain with an

a example I II II

Write an algorithm for Merge sort and explain with an

b example I II II

7 Explain briefly Graham’s Scan Algorithm with an

a example II II I

b Write a short notes on general method for Divide and conquer I II II

8 Define time complexity. describe different notations used
to represent their complexities
a I II III

9 a Explain briefly about Asymptotic notations II II III

Write a short notes on convex hull concept with an
b example I II III

10 a Explain briefly strassen’s matrix multiplication algorithm II II II

UNIT-III
Part-A
Short Answer Questions (2M)
Q. No Question BL CO PO
1 Explain the general method of Greedy method. II III I
2 Write the control abstraction for Greedy method? I III I
3 List the applications of greedy method. V III I
4 Define i) Principles of optimality ii) Feasible solution iii)
Optimal solution I III I

5 State the Job – Sequencing Deadline Problem. II III I

6 What is knapsack problem? I III II
7 What are the constraints of Knapsack problem? I III II
8 Explain formulation of Knapsack problem using greedy III
method II II

9 What is spanning tree? I III I

10 What is minimum cost spanning tree? I III II
11 State single source shortest path algorithm. II III III

Page 4 of 11
 12 Define Dynamic programing I III I
13 What are the features of Dynamic programming? I III I
14 Explain the general method of Dynamic programming. II III I
15 What is meant by All pairs shortest path problem? I III II
16 Define Floyd’s algorithm. I III II
17 Define Optimal Binary Search tree(OBST). I III III
18 Prove that dynamic programming constructs solution in III
bottom up approach. V II

Part-B
Long Answer Questions (10M)
Q. No Question BL CO PO
Write a greedy algorithm for sequencing unit time jobs
1 A with deadlines and profits I III II

Construct optimal schedule for thefollowing jobs

n=8,
(p1,p2,p3,p4,p5,p6,p7,p8)=(40,100,50,30,4,7,12,11
B ) and VI III II
(d1,d2,d3,d4,d5,d6,d7,d8)=(1,4,2,3,3,2,2,1)

Formulate the Knapsack problem with greedy method and

2 find the optimal solution for n=7, m=15, (p1-
A p7)=(10,5,15,7,6,18,3), (w1-w2)=(2,3,5,7,1,4,1) II III II

ConsiderthefollowinginstanceofKnapsackproble
mN=3,M=20,(p1,p2,p3)=(25,24,15),
(w1,w2,w3)= V III II
(18,15,10) CalculateMaximum profit, Minimum
B weight and Maximum profit per unit weight

Apply
thegreedymethodtosolveKnapsackproblemforg
3 A iven instance Wheren=3,m=20, III III II
(p1,p2,p3)=(25,24,15)andweight
(w1,w2,w3)=(18,15,10).

What isMinimumcostspanningtree?
Explainanalgorithmforgenerating minimum cost
B I III II
spanning tree and list some applications of it.

A Write an algorithm for prim’s method and find the I III II

minimum cost spanning tree for the following graph.
Page 5 of 11
4

B ExplaintheworkingprincipleofKruskal’salgorithm II III I
5 Whatisminimumspanningtree?
ExplaintheKruskal’salgorithmtofindtheminimums
A I III II
panningbytakingan illustrative graph

Findshortestpathusingdijkstra’salgorithmforfollowinggra
ph

B I III II

Considerthedirectededge-weightedgraphshownbelow

A III III III

6

Show the execution of Dijkstra’s shortest path algorithm

for solving the Single Source Shortest Path (SSSP)
problem on this graph. Use the vertex S as the source.

Discuss the single – source shortest paths (i.e. Dijkstra’s)

algorithm with suitable example and also find the time IV III III
B complexity.

Dynamic Programming:How the reliability of a system III

7 is determined using dynamic programming? Explain the
A applications of Dynamic programming. I II

Compare and contrast divide and conquer, greedy and III

B dynamic programming problem solving strategies. IV I

A Illustrate the working principle of Dynamic VI III II

Page 6 of 11
8 Programming with All Pairs Shortest Path
problem
Write and explain an algorithm to compute the all III
B I II
pairs shortest path using dynamic programming.
What is All – Pair Shortest Path problem (APSP)? III
9 Discuss the Floyd’s APSP algorithm and discuss the
A I II
analysis of this algorithm.

Find all pairs shortest paths for the following graph and III
write the algorithm

B I III

Calculate shortest distances using All pairs shortest path III

algorithm

10
A III I

Compute All pairs-shortest path for following graph III

B V I

Explain a function to compute lengths of shortest paths III

between all pairs of nodes for the given adjacency
11 matrix.
A 0 6 13 II II
8 0 4.
5 α 0

Explain single source shortest path problem(Bellman III

B Ford Algorithm) using Dynamic programming. II II

Analyze the actions of shortest paths for the given graph

from vertex 1 to all remaining vertices.12=20, 21=2,
12 A 13=15, 25=10, 26=30, 36=10,34=4, IV III II
54=15, 64=4, 65=10

B Compute OBST w(i,j), r(i,j), c(i,j), 0<=i<=j<=4 for V III II

set(a1,a2,a3,a4)=(for, if, else, while) with p1=1, p2=4,
Page 7 of 11
 p3=2, p4=1, qo=4, q1=2, q2=4, q3=1, q4=1 Using r(i,j)
construct OBST.

UNIT-1V
Part-A
Short Answer Questions (2M)
Q. No Question BL CO PO
1 Illustrate an n-queens problem solved with backtracking. II IV III
2 Define Graph colouring problem. I IV II
3 What is the general method of backtracking I IV II
4 Explain the general method of branch and bound II IV II
5 Which data structure is used for implementing a LIFO IV
branch and bound strategy. I II

6 IV
Define: i) State Space tree ii) E – Node and Iii) Dead Node. I I

7 IV
Define: i) Solution space ii) Live – Node and iii) Inactive I I
Node.

8 Define backtracking stratagy IV

I II
9 Give the statement of sum –of subsets problem. IV
I II

Part-B
Long Answer Questions (10M)
Q. No Question BL CO PO
1 Explain Solution space and draw the solution space for N-
Queens problem I IV I

2 Write an algorithm for N-Queens problem

V IV I

3 Give backtracking solution to sum of subsets problem IV

A II II
B Explain 4-Queen’s problem II IV II
Page 8 of 11
 4 A Explain about Graph coloring in detail. V IV I
B Explain in detail about backtracking I IV I
5 Discuss LC branch and bound solution for 0/1 Knapsack
problem V IV I

6 Illustrate on FIFO Branch and Bound solution. IV

I II
7 A Write a algorithm for 0/1 knapsack problem using VI IV II
backtracking
Give the formulation of modified knapsack problem using IV
branch and bound and find the optimal solution using
B Least Cost Branch and Bound (LCBB) with n=4, m=15, II II
(p1…p4) = (15,15,17,23), (w1…w4) = (3,5,6,9)

8 A Explain the general method of branch and bound II IV II

Explain the algorithm schema LC Branch and bound IV
B which searches for a least-cost answer node and explain II II
0/1 knapsack problem
9 A Explain the principles of FIFO and LC branch and bound II IV II
with example
Generate the optimal tour using LC-branch and bound for IV
B the given adjacency matrix: VI II
[ α 10,11, 6, 18 15, α 16 4 2 , 3 5 α 2 4 , 19 6 18 α 3,
16 4 7 16 α]
10 Interpret the method of reduction to solve TSP problem using IV
A I II
Branch and Bound
\ B Explain the travelling salesman problem with branch and II IV II
bound technique

UNIT-V
Part-A
Short Answer Questions (2M)
Q. No Question BL CO PO
1 Design the diagram that illustrates the relationship between
NP Hard and NP Complete.
VI V III
Explain the words, Choice, Failure Success.

2 Define nondeterministic algorithm. V

I III

3 Define nondeterministic Polynomial. V

I I

4 Define NP-Complete V
I II

5 Define Polynomial reducible. V

I II

6 What is the difference between tractable and intractable? V

I II

Page 9 of 11
 what is class P and NP? V
7 I I

8 Define Satisfiability? V
I III

Part-B
Long Answer Questions (10M)
Q. No Question BL CO PO
1 A Explainthefeaturesofnondeterministicalgorithms. II V I
BrieflyexplainaboutNP-hardandNP-completeproblems V
B with example. II I

2 Explainnondeterministicalgorithms? V
A Givesomeexamples. II I

B ExplainthestrategytoprovethataproblemisNPhard. II V I
3 DescribeCook’stheorem and V
A givetheapplicationsofCook’stheorem. II I

GivethecharacteristicsofNP-hardproblems. V
B I III

4 What are deterministic and non-deterministic algorithms? V

A Distinguish between them. I II

Explainthesatisfiabilityproblemandwritethealgorithmforth V
B esame. II II

5 What is satisfiability problem? Write Non- V

A deterministic algorithm for the same? I II

WritetheNondeterministicsortingalgorithmand V
B 6analyzeitscomplexity. I II

6 Show that the Hamiltonian cycles problem on V

A directed graphs isNP-complete. I II

Write about non deterministic algorithms and V

B choice, failure and success functions with I II
search example.

7 Explaintheclassesof P , NPandNP- V
A Completegivingexampleproblem for each. II I

Is Travelling salesman problem NP hard or NP- V

B Complete? Justify your answer. IV I

Page 10 of 11
8 Howmanystepsarerequiredtoprovethatadecisionpr V
A oblem is NP-Complete? Justify. I II

B Explain about Scheduling identical processors. II V II

9 A Explain Clique decision problem with an example. II V III

B Describe about Job Shop Scheduling with n example. I V II

10 Explain chromatic number decision problem by using NP V
A Hard graph concepts. II III

Explain the travelling salesman problem by using basic V

B concepts of NP hard and NP Complete problem. II II

11 Define reduced cost matrix for travelling sales person V

problem. Consider the instance define by the cost matrix:
A [ α 5 1 10 6 1 α 4 12 7 3 6 α 4 16 7 1 3 α 9 I II
16 12 7 6 α ]

Signature of Faculty Signature of HoD

Page 11 of 11