Design and Analysis of Algorithm PDF

TRIDENT ET GROUP OF INSTITUTIONS, GHAZIABAD
Question Bank
Design and Analysis of Algorithm (CSE), III Year
Subject Code: CS-502
Faculty Name-Vinit Kumar
Section- A
Short Question
1. Determine the asymptotic order of following:
1. F (n) = 3 +
2.F (n) = + +
3. =
2. What is big Oh notation?

3. What are the two different types of recurrence?
4. State the best case and worst case analysis for linear search.
5. Solve the recurrence equation:
T () = 100T (/99 ) +log ( !)
6. Write the complexity of divide and Conquer algorithms.

7. List out the disadvantage of merge sort.
8. List out any two drawbacks of binary search algorithm.
9. Write the procedure for selection sort.
10.
What is the difference between forward & backward approach?
11.
What is the concept of Convex Hull problem?
12.
What is 0/1 Knapsack Problem.
13.
Define Backtracking.
14.
Define n-queens problem.
15.
Define Hamiltonian Circuit problem in an undirected Graph.
16.
State the principle of Backtracking.
17.
Define Traversal of Trees. What are the different ways of traversal of Trees?
18.
Define depth first searching techniques.
19.
Compare NP-hard and NP-completeness.
20.
What is a minimum cost spanning tree?
21.
Example of Approximation algorithm and Randomized algorithms.
Question Bank of DAA by Vinit Kumar
Page 1
Section- B
Long Question
1. What is the height of a node, black height of a node in the Red Black Tree?
2. Define the divide and conquer rule with an example of sorting?
3. What is the height of a B-Tree, if there are n nodes in it? What is the maximum
height of a B- Tree with 10, 00,000 keys and having minimum degree 10?
4. Prove that the maximum degree of any node in an n node binomial tree is log n.
5. Write down the algorithm of Quick Sort and perform the algorithm on the following
array: A={10,12,1,7,4,6,9,5,3,11,0}.
6. Discuss any one sorting having linear time complexity.
7. Insert
the
following
keys
into
an
initially
empty
Red
Black
Tree,(4,7,12,15,3,5,14,18,16).
8. Let A= {7,2,4,17,1,11,6,8,15,10,20}. Draw a binomial Heap whose keys are elements
of A. And Insert a new element with key 5 into this Heap.
9. Explain the method of binding the minimum spanning tree for a connected graph
using Prims algorithm.
10. Discuss the design steps in Kruskal algorithm to construct minimum spanning tree
with example.
11. Explain the master theorem and solve the following:
1) =
2) = / +
12. Define B-Tree. Discuss the deletion of a key from a B-Tree.

13. Explain Greedy method and discuss some problems which are solved using this
algorithm.
14. Write short notes on
(a) Graph coloring
b) 8-Queens problem
15. Apply Backtracking technique to solve the following instance of the subset sum
problems. [s= (1, 3, 4, 5) & d=11].
16. Discuss the use of greedy method in solving knapsack problem and subset sum
problem.
17. Discuss the solution for knapsack problem using branch bound techniques.
18. Write Short Note on:
a) Fast Fourier Transform.
b) Maximum Flow Problem
Page 2

19. Discuss the classes P, NP, NP complete, and NP hard with examples. How can we
show that a problem is NP complete?
20. What do you understand by Polynomial time reducibility?
Section- C
Very Long Question
1. Explain the various asymptotic notations with the properties.
2. Explain the Insertion Sorting and analysis of its sorting.
3. How the results inserting the keys F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X,
Y, D, Z, E, G, I in order into an empty B-Tree only and the minimum degree of BTree is 3. Draw the configuration of some node must split and also draw the final
configuration.
4. Solve the recurrence relation using Master Method:
T () = 3T (1/3 ) +3
T () = 100T (/99 ) +log ( !)
5. Illustrate the operation of RADIX-SORT on the following list of English words: COW,
DOG, SEA, ROW, MOB, BOX, TAB, BAR, EAR, BIG, TEA, NOW. Apply BUCKETSORT algorithm on the following array: 0.78, 0.17, 0.39, 0.26, 0.72, 0.94, 0.21, 0.21,
0.12, 0.23, 0.68.
6. Solve the following instance of the single source shortest path problem with vertex
a as the source: write the algorithm for this problem.
Page 3

7. Apply Kruskals and Prims Algorithm to find minimum spanning tree on the following
graph:
8. Explain Boyer- Moore algorithm for string matching for text: a b c a a b c c a a b b

a b c a. Compute worst time complexity of this algorithm.
9. Use Floydd-Warshall Algorithm to find the shortest paths for all pairs of vertices in
the given graph.

10. Using Backtracking enumerate how can you solve the following problems:
a) 8-queens problem
b) Hamiltonian circuit problem
******************************ALL THE BEST******************************
Page 4

Design and Analysis of Algorithm PDF

Uploaded by

Design and Analysis of Algorithm PDF

Uploaded by

TRIDENT ET GROUP OF INSTITUTIONS, GHAZIABAD

Faculty Name-Vinit Kumar

2. What is big Oh notation?

6. Write the complexity of divide and Conquer algorithms.

What is the difference between forward & backward approach?

What is the concept of Convex Hull problem?

What is 0/1 Knapsack Problem.

Define n-queens problem.

Define Hamiltonian Circuit problem in an undirected Graph.

State the principle of Backtracking.

Define depth first searching techniques.

Compare NP-hard and NP-completeness.

What is a minimum cost spanning tree?

Example of Approximation algorithm and Randomized algorithms.

Question Bank of DAA by Vinit Kumar

TRIDENT ET GROUP OF INSTITUTIONS, GHAZIABAD

12. Define B-Tree. Discuss the deletion of a key from a B-Tree.

(a) Graph coloring

Question Bank of DAA by Vinit Kumar

b) Maximum Flow Problem

TRIDENT ET GROUP OF INSTITUTIONS, GHAZIABAD

T () = 100T (/99 ) +log ( !)

Question Bank of DAA by Vinit Kumar

TRIDENT ET GROUP OF INSTITUTIONS, GHAZIABAD

8. Explain Boyer- Moore algorithm for string matching for text: a b c a a b c c a a b b

the given graph.

b) Hamiltonian circuit problem

ALL THE BEST

Question Bank of DAA by Vinit Kumar

You might also like