ADVANCED DATA STRUCTURES & ALGORITHMS
all important questions for unit wise
- 10 Mark's questions
- 5 Mark's questions
- 2 Mark's questions
UNIT -1 (Introduction to Algorithms)
1. What are the Asymptotic notations and its properties. (5m - Feb 2023 - R20)
2. Write a recurre algorithm to find the sum of first n integers and derive its time coexity. (5m - Feb 2023 - R20)
3. What is space complexity? Illustrate with an example for fixed and variable part in space complexity. (10m - Feb 2023 - R20)
5. using step count method. analyze the time complexity when 2 m * n (m x n ) matrix added. (2m - Feb 2023 - R20)
unit - 2 ( Trees Part-I )
1. Explain in-order, pre-order and post-order traversal of a binary tree. (5m - Feb 2023 - R20)
2. Explain in detail about AVL tree rotations. (5m - Feb 2023 - R20)
3. Construct a B tree of order 4 with the following data: (10m - Feb 2023 - R20)
4. Compare complete binary tree and full binary tree. (2m - Feb 2023 - R20)
5. Define B Tree. (2m - Feb 2023 - R20)
unit -3 ( Trees Part-II )
1. Explain Red-Back trees in detail with relevant examples. (5m - Feb 2023 - R20)
2. Explain advantages and disadvantages of Splay trees. (5m - Feb 2023 - R20)
3. Give an example to illustrate collision resolution using chaining. (5m - Feb 2023 - R20)
4. Explain the applications of Hashing. (5m - Feb 2023 - R20)
5. List the applicabons of Red-Black trees. (2m - Feb 2023 - R20)
6. What is Hashing? (2m - Feb 2023 - R20)
unit - 4 ( Divide and conquer, Greedy method )
1. Write the General method of Divide-And-Conquer approach. (5m - Feb 2023 - R20)
3. Derive the Best Worst and Average time complexities of Quick sorting technique. (5m - Feb 2023 - R20)
4. Explain the Single source shortest path problem with an example. (5m - Feb 2023 - R20)
5. Give the problem formulation of Knapsack problem using greedy method. (2m - Feb 2023 - R20)
6. State the best average and worst-case complexities of binary search for successful and unsuccessful search. (2m - Feb 2023 - R20)
1. Write the algorithm to compute 0/1 Knapsack problem using dynamic programming and explain it. (5m - Feb 2023 - R20)
2. Discuss Sum of subset problem with an example. (5m - Feb 2023 - R20)
3. Describe All-pairs shortest path algorithm with an example. (10m - Feb 2023 - R20)
4. Give the 4-Queens's solution using backtracking. (2m - Feb 2023 - R20)
5. What is Travelling Sales Man Problem? (2m - Feb 2023 - R20)
0 Comments