21CS42 Dayananda Sagar University • Computer Science & Engineering (Semester 4)

Design and Analysis of Algorithms

💡 DSU Exam Strategy & Guidance

Master Theorem for recurrences, Divide-and-Conquer (Merge/Quick sort), Dynamic Programming (0/1 Knapsack, LCS), and Greedy strategies (Huffman Coding, Kruskal/Prim).

High-Yield Passing Strategy: Always provide Pseudocode + Recurrence relation + Time Complexity proof.

Most Repeated Question Topics:

Master Theorem Recurrences0/1 Knapsack Problem (DP vs Greedy)Longest Common Subsequence (LCS)Kruskal and Prim Minimum Spanning TreesNP-Complete vs NP-Hard Definitions

📄 Previous Year Question Papers (2)

END_SEM • 2024

End Semester Exam 2024

View PDF ↗

END_SEM • 2023

End Semester Exam 2023

View PDF ↗

Turn 21CS42 Notes into AI Flashcards

Upload your Design and Analysis of Algorithms lecture slides to generate spaced repetition study cards in seconds.

Start Free →