Design and Analysis of Algorithm PYQ 2024-25 AKTU Question Paper

Design and Analysis of Algorithm AKTU syllabus

1. Unit 1: Introduction: Algorithms and Sorting
2. Unit 2: Advanced Data Structures
3. Unit 3: Divide and Conquer & Greedy Methods
4. Unit 4: Dynamic Programming, Backtracking & Branch and Bound
5. Unit 5: Selected Topics

Questions in Design and Analysis of Algorithm AKTU PYQ 2024-25

1. Q1a. With example define algorithm. List few algorithm design techniques. (2 marks, 2024-25)
2. Q1b. Briefly discuss the basic steps taken to design an algorithm. (2 marks, 2024-25)
3. Q1c. Derive the time complexity of Heap Sort. (2 marks, 2024-25)
4. Q1d. List the properties of Binomial Heap (2 marks, 2024-25)
5. Q1e. With a suitable example explain the concept of Convex –Hull Problem (2 marks, 2024-25)
6. Q1f. With a suitable example explain “Branch and Bound”. (2 marks, 2024-25)
7. Q1g. Describe “Randomized algorithms”. List few randomized algorithms. (2 marks, 2024-25)
8. Q2a. Illustrate the operation of Merge –Sort on array A= (38, 27, 43, 3, 9, 82, 10). Also drive the time complexity of Merge Sort. (7 marks, 2024-25)
9. Q2b. Define Binomial Heap. Write an algorithm for union of two binomial heaps. Also take a suitable example which clearly illustrates merging operation of two binomial heaps. (7 marks, 2024-25)
10. Q2c. Apply the greedy single source shortest path algorithm on the graph given below. (7 marks, 2024-25)
11. Q2d. Write Floyd’s and Warshal’s algorithm to find all pair shortest path in a graph. Discuss its time complexity. (7 marks, 2024-25)
12. Q2e. Explain Vertex Cover Problem. Solve vertex cover problem using approximation algorithm (7 marks, 2024-25)
13. Q3a. Write Quick –Sort partition algorithm. Drive best and worst case time complexity of quick sort. (7 marks, 2024-25)
14. Q3b. Find out Upper, Lower and Average bounds for the function f (n) = 3n+2 (7 marks, 2024-25)
15. Q4a. Insert the following string in the initially empty tries: DOG, DONE, CAT, CAN, RIGHT, DO, JUG, DAA, CA, CAME. Also make a compress tries of it. (7 marks, 2024-25)
16. Q4b. Design a Binomial Heap for the following A. A= {7, 2, 4, 17, 1, 11, 6, 8, 15, 10, 20} (7 marks, 2024-25)
17. Q5a. Write and explain the Kruskal’s algorithm to find Minimum Spanning Tree of a graph with a suitable example. (7 marks, 2024-25)
18. Q5b. Find the optimal solution of the fractional Knapsack problem with n=7 and the knapsack capacity of m=15. The profits and weights of the items are given below. Objects: 1 2 3 4 5 6 7 Profit (P): 5 10 15 7 8 9 4 Weight (w): 1 3 5 4 1 3 2 (7 marks, 2024-25)
19. Q6a. Illustrate the N-queens problem? Draw “State Space Tree” for 4 queen’s problem using backtracking. (7 marks, 2024-25)
20. Q6b. Find the optimal solution to the 0/1 Knapsack instances with n=4 and Knapsack capacity m=8 where profits and weights as follows : P={1, 2, 5,6} and W={2, 3, 4, 5} (7 marks, 2024-25)
21. Q7a. Explain P, NP, NP –Complete and NP-Hard complexity classes. How they are related to each other. (7 marks, 2024-25)
22. Q7b. Write Knuth-Morris-Pratt string matching algorithm. Take a suitable example Compute the prefix function π for the pattern ababbabbabbababbabb when the alphabet is Σ = {a, b}. (7 marks, 2024-25)

Design and Analysis of Algorithm previous year papers

• PYQ 2023-24
• PYQ 2022-23

More Design and Analysis of Algorithm resources

• Handwritten Notes: Unit 5 Handwritten Notes
• Important Questions: Unit 1 Important Questions
• Important Questions: Unit 2 Important Questions
• Important Questions: Unit 3 Important Questions
• Important Questions: Unit 4 Important Questions
• Important Questions: Unit 5 Important Questions
• Notes: Unit 1 Notes
• Notes: Unit 2 Notes
• Notes: Unit 3 Notes
• Notes: Unit 4 Notes
• Notes: Unit 5 Notes

Design and Analysis of Algorithm exam preparation

• Design & Analysis of Algorithm Important Topics
• Design & Analysis of Algorithm PYQ Analysis (unit-wise)
• Design & Analysis of Algorithm Predicted Paper
• Design & Analysis of Algorithm Important Questions