B.

Tech 4th Semester

Design and Analysis of Algorithm

QUESTION BANK

Section – A
1. What is Algorithm?
2. Give any 6 steps for problem development.
3. What are the characteristics of an algorithm?
4. Why analysis of algorithm is important?
5. Give me the three types of algorithm analysis.
6. What is order statistics.
7. What is median order statistics?
8. What is red-black tree?
9. What is an augmented data structure?
10. What is B-tree?
11. What is Binomial Tree?
12. What do you mean by MIN heap?
13. Give binomial tree structure for B0, B1, B2 and B3 .
14. What is the role of UNION operation in binomial heap?
15. What is Fibonacci Heap?
16. What is disjoint set?

Section – B

1. State the difference between algorithm and pseudocode. Give example.

2. What do you mean by asymptotic notation? Explain its terms.
3. How to analyse loops for complexity analysis? Explain.
4. Explain the time complexity of Quick Sort method with all cases.
5. State the properties of Red-Black tree.
6. Give a brief introduction about Red-Black tree.
7. How to search an element in an augmented Red-Black Tress? Explain.
8. How to insert the following numbers in a B-tree. Explain with suitable algorithm.
 5,3,21,9,1,13,2,7,10,12,4,8
9. How to search an element in B-Tree? Explain with suitable algorithm and example.
10. How to insert an element in B-Tree? Explain with suitable algorithm and example.
11. How to construct binomial heap through inserting numbers one by one? Explain with suitable
example with properties.

Section – C

1. How recurrence relation is proved in Master’s Throrem? Explain in detail.

2. Explain the time complexity of heap sort in detail.
3. Explain the following with suitable algorithm and example.
i) Counting Based Sorting Algorithm
ii) Radix Based Sorting Algorithm
4. How insertion is performed in Red-Black Tree? Explain with the suitable algorithm with the
following data set
10,18,7,15,16,30,25,40,60,2,1,70
5. How deletion is perforem in Red-Black Tree? Delete 55, 30, 90, 80, 50, 35, and 15 from the
following tree one by one.
5

30 65

70
15 35 55

68 80

90
6. How to delete elements in a B-Tree? Discuss all the cases and explain with suitable algorithm.
7. How to delete elements from B-Tree? Explain its ALL cases with suitable algorithm and
example.