Sri Indu College of Engineering & Technology

(An Autonomous Institution under JNTUH)

II B.Tech II Semester Examination

2021-2022

Question Bank

For

Design And Analysis Of Algorithms

 UNIT-I
Section A

Short Questions:

1. Describe an algorithm with example?(understanding)

2 List out the properties of the algorithm?(remembering)
3. What is Space Complexity and Time Complexity?(remembering)
4. What is Pseudo code?(remembering)
5. List asymptotic notations.?( remembering)
6. Define Divide and Conquer.( remembering)
7. What is binary search?( remembering)
8. What is sorting?( remembering)
9. Analyze time complexity of quick sort?(analyzing)
10. Compute time complexity of Merge sort.(analyzing)

Section B

Long Questions:

1. What do you mean by performance analysis of an algorithm? Explain (understanding)

2. Define algorithm. Explain the characteristics of the algorithm (remembering)
3. Find Big-oh notation and Little-oh notation for f(n) = 7n3+ 50n2+200.(evaluating)
4. What is meant by time complexity? Define different time complexity notations. Give
examples one for each.? (remembering)
5. Given f(n)=20n3-3, then prove that f(n)= O(n3).?(evaluating)
6. Explain Binary search algorithm with an example.?(understanding)
7.Develop general method for Divide and Conquer approach.?(applying)
8. Explain Merge sort algorithm using divide and conquer method.(understanding)
9. Explain Strassen’s Matrix multiplication with example.(understanding)
10.To construct how quick sort sorts the following sequences of keys in ascending order.
22,55,33,11,99,77,55,66,54,21,32(creating)
 UNIT-II
Section A

Short Questions:

1. Define Disjoint set.( remembering)

2. What is weighting rule for Union.( remembering)
3. What is Collapsing Rule?( remembering)
4. Explain different Tree traversals.(understanding)
5. Write algorithm for simple Union & find Operations.( remembering)
6. Define Graph.( remembering)
7. Define Connected component(remembering)ts.
8. Define Biconnected components.( remembering)
9. What is Adjacency Matrix?( remembering)
10. Define Spanning Tree.( remembering)
Section B

Long Questions:

1. Explain the usefulness of the following fundamental operations on sets

(a) FIND (b) UNION(understanding)
2. Determine weighted union and collapsing find algorithm With an Example.(evaluating)
3. Differentiate between BFS and DFS.(analyzing)
4. Explain the Properties of Depth first search.(understanding)
5. Explain different graph representation.(understanding)
6. Two sets S1 and S2 are given as below
S1= {1,2,4,6} and S2={7,8}(creating)
(a) Draw Disjoint sets S1 and S2 using Trees.
(b) Draw Disjoint sets S3 such that S3=S1US2
(c) Draw Disjoint sets S4 such that S4=S2US1
7. Write and explain the find algorithm using collapse rule with an example.(understanding)
8. Write and explain the UNION algorithm using weighted rule with an example.
(understanding)
9. Write algorithm to find DFN’s and L values.( remembering)
10. Explain algorithm for find Biconnected components.(understanding)

UNIT-III
Section A

Short Questions:
1. Give two real time problems that could be solved using greedy algorithm.(evaluating)

2. Define greedy method.( remembering)

3. What is minimum cost spanning tree?( remembering)
4. What is job sequencing?( remembering)
5. Define knapsack problem(remembering)
6. Find the minimum cost spanning tree of the given weight graph.(evaluating)

1 1 2

3
2 3

7. What is dynamic programming?( remembering)

8. Write general method of dynamic programming(remembering).
9. What is optimal binary search tree?( remembering)
10. What is travelling sales man problem.( remembering)

SECTION B

Long Questions:

1. Explain Job sequencing algorithm with an example.(understanding)

2. Explain 0/1 knapsack problem with example.(understanding)
3. Explain minimum cost spanning tree.(understanding)
4. Explain kruskal’s algorithm with an example .(understanding)
5. Solve the following problem of Job sequencing with the dead line specified using Greedy
strategy.(evaluating)
N=4, (p1, p2, p3, p4) = (100, 10, 15, 27)
 (d1, d2, d3, d4)= (2, 1, 2, and 1).
6. Find the optimal solution for the given instance of knapsack problem.( evaluating)
n=7, m=15,
(p1, p2, p3, p4, p5, p6, p7)= (10, 5, 15, 7, 6, 8, 3)
(w1, w2, w3, w4, w5, w6, w7)= (2, 3, 5, 7, 1, 4, 1)
Find the optimal solution for
a. Maximum profit. b. Minimum weight.

7. Show the step by step procedure of deriving the minimum cost spanning tree using Kruskal’s
algorithm.( remembering)

1
55 25 45
30
2 3 4 8

5 40 20
50
15
5 35 7 10

6
8. Explain Matrix chain multiplication with an Example.(understanding)
9. Develop optimal binary search tree algorithm with an example.(creating)
10. Compare Greedy method and Dynamic programming.(evaluating)
 UNIT-IV

Section A

Short Questions:
1. Define Backtracking (remembering)
2. What do you mean by State Space (remembering)Tree?
3. Define n-Queens Problem(remembering)
4. What is Hamiltonian cycle ? (remembering)
5. Define the term Branch and Bound Technique (remembering)
6. Define Feasible Solution and optimal solution (creating)
7. What is LIFO Search?( remembering)
8. What is FIFO Search?( remembering)
9. Define the following terms live node and E-node(remembering)
10. Define properties of LC-Search.( remembering)

Section B

Long Questions:
1. What is Backtracking? Explain in detail.(understanding)
2. Explain Subset-sum Problem & Discuss the possible solution strategies using backtracking.
(understanding)
3. Write short notes on
(a) Graph coloring
(b) 8-Queens problem(understanding)
4. Apply Backtracking technique to solve the following instance of the sum of sub sets problems
w={5,7,10,12,15,18,20} & m=35(applying)
5. Explain graph coloring algorithm.(understanding)
6. Explain Hamiltonian cycle with an example.(understanding)
7. Using Backtracking enumerate how can you solve the following problems
(a) 8-queens problem (8)
(b) Hamiltonian circuit problem(creating)
8. Explain 4-Queen problem with an example.(creating)
9. Explain General method of Branch and Bound.(understanding)
10. Solve the Travelling Salesperson Problem.(creating)

͚ 7 3 12 8
3 ͚ 6 14 9
5 8 ͚ 6 18
9 3 5 ͚ 11
18 14 9 8 ͚
 UNIT-V
Section-A

Short Questions:

1. Define polynomial.( remembering)

2. Define NP.( remembering)
3. What is NP-hard problem(remembering)?
4. What is NP-complete problem?( remembering)
5. What is halting problem?( remembering)
6. Write the statement of Cook’s theorem.(understanding)
7. What is Clique?( remembering)
8. What is Deterministic algorithm(remembering)
9. What is Decision Problem?( remembering)
10. Compare P and NP.(analyzing)
Section-B

Long Questions:

1. Explain NP-hard and NP-Complete Classes.(understanding)

2. Distinguish between Deterministic and non-deterministic algorithm.(analyzing)
3. What is meant by Halting problem explain with an example.( remembering)
4. Differentiate between NP-Complete and NP-Hard.(evaluating)
5. Explain maximum Clique.(understanding)
6. Explain Optimization problem.(understanding)
7. Briefly explain the concepts of the NP-Hard and NP-Complete?(understanding)
8. Explain the P, NP, NP-Hard and NP- complete classes? Give relationship between them?
(understanding)
9. State and explain Cook’s Theorem.(understanding)
10. Explain different types of NP problems?.(understanding)