Design and Analysis of Algorithm PYQ 2023-24 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 2023-24

1. Q1a. What do you mean by algorithm? Write the characteristic of algorithm. (2 marks, 2023-24)
2. Q1b. Show that equation are correct : 10n² + 9 = O(n²) (2 marks, 2023-24)
3. Q1c. Write short note on Fibonacci Heap. (2 marks, 2023-24)
4. Q1d. Explain Binary Search Tree. (2 marks, 2023-24)
5. Q1e. Define fractional Knap-Sack problem. (2 marks, 2023-24)
6. Q1f. Write name of Spanning tree algorithm with complexity. (2 marks, 2023-24)
7. Q1g. Define the term "Graph Coloring". (2 marks, 2023-24)
8. Q1h. What do you mean by Activity selection problem? (2 marks, 2023-24)
9. Q1i. What do you mean by Boyer-Moore Algorithm? (2 marks, 2023-24)
10. Q1j. Write short note on Fast Fourier Transform. (2 marks, 2023-24)
11. Q2a. Sort the following array by counting sort A={2,5,3,0,2,3,0,3} (10 marks, 2023-24)
12. Q2b. Prove all the four properties of Binomial Tree. (10 marks, 2023-24)
13. Q2c. Describe DFS with its algorithm. How DFS can be used to solve the problem. (10 marks, 2023-24)
14. Q2d. Apply Floyd-Warshall algorithm for constructing shortest path (10 marks, 2023-24)
15. Q2e. Write short notes on the following: i) Randomized Algorithm. ii) Approximation algorithm. (10 marks, 2023-24)
16. Q3a. What is stable sorting algorithm? Which of the sorting algorithms we have seen are stable and which are unstable? Give name with explanation. (10 marks, 2023-24)
17. Q3b. Write an algorithm of merge sort and prove its worst time complexity. (10 marks, 2023-24)
18. Q4a. Insert the following elements using the property of RB tree. 61,58,51,32,39,29 (10 marks, 2023-24)
19. Q4b. Explain B-Tree and its properties. Also write B-Tree deletion cases with example. (10 marks, 2023-24)
20. Q5a. Determine an LCS of X={A,B,C,B,D,A,B} and Y={B,D,C,A,B,A} (10 marks, 2023-24)
21. Q5b. Explain Backtracking. Let set S= {1,3,4,5} and X=8, we have to find subset sum problem using backtracking approach. (10 marks, 2023-24)
22. Q6a. Write an algorithm of Dijkstra and implement it by taking any example. (10 marks, 2023-24)
23. Q6b. Apply Branch and Bound technique to solve travelling salesman problem for the graph whose cost matrix given below. (10 marks, 2023-24)
24. Q7a. Explain P, NP, NP Hard and NP Complete Classes with example. (10 marks, 2023-24)
25. Q7b. Explain KMP matcher and also implement it by an algorithm, where P=a,a,b,a,b,b,a and T=b,a,b,a,a,b,a,b,b,a (10 marks, 2023-24)

Design and Analysis of Algorithm previous year papers

• PYQ 2024-25
• 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