SRI VENKATESWARA COLLEGE OF ENGINEERING

(AUTONOMOUS)
Karakambadi Road, TIRUPATI – 517507

Question bank

Name of the
CSE/B.Tech
Branch/Course
ADVANCED DATA STRUCTURES AND
Subject
ALGORITHM ANALYSIS
Subject Code CS23APC301

Year & Sem II YEAR & I SEMESTER

10 Marks Questions
Unit – 1
What is Asymptotic Notation? Explain different types of asymptotic notations with an
1
example.
2 Explain about AVL Trees and its operations
3 Discuss the methods to compute time complexity of an algorithm
4 Explain about Heap Trees and its applications
5 Differentiate Space complexity and Time complexity with examples.
6 How min and max heap works , Explain its operations with examples
Insert the following sequence of elements into an AVL tree, starting with an empty tree:
7
10, 20, 15, 25, 30, 16, 8, 19 and delete 30 in the AVL Tree.
8 Describe different ways of specifying the algorithm
9 Discuss about Tree Traversal methods in detail
10 Differentiate AVL Trees and heap trees.
Unit – 2
1 Explain about graph traversal techniques?
2 Illustrate with an example, how merge sorting algorithm works.
3 Explain Strassen’s matrix multiplication and derive its time complexity.
4 Implement Quick sort and derive the time complexity of it.
5 Explain about convex hull problem with examples.
6 What is divide and conquer? Explain with general method with suitable examples.
7 Illustrate connected and Bi-connected components
8 Write an algorithm for quick sort and merge sort with an example.
9 Explain about BFS and DFS with examples.
10 Implement Merge sort to this array 38, 27, 43, 3, 9, 82, 10.
Unit – 3
1 What is greedy method? Explain general method with an example?
 Explain Job scheduling with deadlines and find solution for n=5, (P1,P2,…,P5) =
2
(20,15,10,5,1) and (d1,d2….d5)=(2,2,1,3,3)
Find minimum cost spanning tree using prim’s method for the given graph

4 Explain in detail about minimum cost spanning trees?

Solve the knapsack problem using greedy method. Find optimal solution for n=5, m=60,
5
(w1, w2, w3, w4, w5) = (5, 10, 15, 22, 25) and (p1, p2, p3, p4, p5) = (30, 40, 45, 77, 90)
6 Explain how all pairs shortest can be found in a graph using dynamic programming
Explain Job scheduling with deadlines and find solution for n=7, (P1,P2,…,P7) =
7
(3,5,20,18,1,6,30) and (d1,d2….d7)=(1,3,4,3,2,1,2)
8 Explain about single source shortest path algorithm with an example
9 What is knapsack? Explain Knapsack problem with an example?
10 Differentiate greedy method and dynamic programming with examples.
Unit – 4
1 Solve N-queen’s problem and write the algorithm of it.
Find the edit distance between the string x = (a, a, b, a, b) and y = (b, a, b, b) using
2
dynamic programming?
3 Explain 0/1 knapsack problem by using dynamic programming
4 Explain Sum of subsets problem and solve for m=30, s={10,12,13,5,15,18}
Explain 0/1 knapsack problem by using dynamic programming solution for n=6, m=165,
5
(w1, w2, w3, w4, w5, w6) = (p1, p2, p3, p4, p5, p6) = (100, 50, 20, 10, 7,3).
Solve Travelling salesman problem using dynamic programming and find optimal tour.
0 16 11 6
6 8 0 13 16
4 7 0 9
5 12 2 0
7 Describe general method of Backtracking and write its applications
8 Define chromatic number and explain Graph coloring using Backtracking
Describe the travelling salesman problem and discuss how to solve it using dynamic
programming?

0 10 15 20
9
5 0 9 10
6 13 0 12
8 8 9 0
10 Explain 0/1 knapsack problem by using backtracking solution for n=8, m=110, (w1, w2,
 w3, w4, w5, w6, w7, w8) = (11, 21, 31, 33, 43, 53, 55, 65) and (p1, p2, p3, p4, p5, p6, p7,
p8) = (1, 11, 21, 23, 33, 43, 45, 55).
Unit – 5
1 What is branch and bound? Explain with general method?
2 Compare and contrast NP Hard and NP Complete.
Solve Travelling Salesperson Problem using Branch and Bound for given graph

Describe the travelling salesman problem and discuss how to solve it using LCBB.

∞ 20 30 10 11
15 ∞ 16 4 2

4 3 5 ∞ 2 4

19 6 18 ∞ 3

16 4 7 16 ∞

5 What are the applications of branch and bound? Explain

Solve the 0/1 knapsack problem for the given instance using LCBB
6
M = 6,N = 3,W1 = 2, W2 = 3, W3 = 4 and P1 = 1, P2 =2, P3 = 5
7 Define P and NP-Classes.
8 Explain the strategy to prove that a problem is NP-hard?
9 Discuss consequences of being in P
Solve the 0/1 knapsack problem using Branch and Bound. Given profits (10, 10, 12, 18),
10
weights (2, 4, 6, 9) and capacity 15.
2 Marks Questions
Unit – 1
1 Define an Algorithm and the characteristics of an algorithm?
2 List the operations and applications of AVL Trees
3 List two phases of Performance Evaluation
4 List out applications of heap trees
5 List out Asymptotic notations
6 What is Recursive algorithm?
7 Define Time complexity and Space complexity.
8 What is min and max heap?
9 Define priority queues with examples
10 How you can measure an algorithm with different techniques.
Unit – 2
1 What is the terminology of graphs
2 How you can represent graphs and advantages of graphs
3 List out the searching and Traversing techniques?
4 Mention the applications of connected and Bi-connected components
5 Difference between connected components and Bi-connected components
6 What is general method of divide and conquer?
7 What is Quick sort?
8 What is merge sort with example?
9 How many additions, subtractions and multiplications in Stassen’s matrix multiplication
10 What is convex hull problem?
Unit – 3
1 What is Feasible solution?
2 Differences between Greedy and Divide and Conquer?
3 What is general method of dynamic programming
4 Define Optimal solution?
5 Define principle of optimality.
6 What is purging rule?
7 Differentiate Greedy method and Dynamic programming
8 What is spanning tree?
9 How you can calculate total profit in knapsack problem by using greedy method
10 List the advantages of dynamic programming.
Unit – 4
1 What is meant by 0/1 knapsack?
2 Differentiate dynamic programming and back tracking.
3 What is string editing?
4 Define backtracking and give its advantage.
5 What is graph coloring?
6 What are the rules to solve n queens problem?
7 What is general method of backtracking?
8 What is bounding function?
9 What is Travelling sales person problem?
10 What is chromatic number?
Unit – 5
1 List the applications of branch and bound?
2 What is NP Hard and NP Complete?
3 What is general method of branch and bound?
4 What is LCBB?
5 State traveling sales person problem.
6 What is Decision problem?
7 What is state space tree?
8 What is Satisfiability problem?
9 Is P=NP? Justify your answer?
10 An NP problem can be solved in deterministic polynomial time, how?