Design and Analysis of Algorithms
⏰ How much time do you have?
Questions below update with thisWe'll show only the topics you can realistically cover.
Do din hai — ye actually kafi hai agar seriously padho 💪
2 din hai — ye kafi hai. Sorting + Graph + DP seriously padho. Har algorithm ek graph pe trace karo — yahi aata hai exam mein.
📊 Topic Weightage by Block
9 papers · 2021–2025📝 Question Bank
2 Days plan · 26 questions
⭐ Must Practice First
17Big-O Notation — Mathematical Definition & Proof
QuickSort Recurrence — Recursion Tree Method
Recurrence — Substitution Method [T(n)=2T(n/2)+n]
Master Theorem — All 3 Cases
Fractional Knapsack Problem (Greedy)
Task Scheduling Algorithm (Maximize Profit with Deadlines)
Huffman Coding — Build Tree & Optimal Prefix Codes
Prim's MST Algorithm — Apply & Derive Complexity
Kruskal's MST Algorithm — Apply on Graph
Merge Sort — Algorithm, Trace & Complexity
Quick Sort — Algorithm, Partition Trace & Complexity
BFS & DFS — Algorithm, Traversal & Complexity
Dijkstra's Single Source Shortest Path
Floyd-Warshall Algorithm — Apply & Show D² Matrix
Matrix Chain Multiplication (Dynamic Programming)
Horner's Method for Polynomial Evaluation
P, NP, NP-Complete & NP-Hard Classes
Good to Prepare
9Big-Omega (Ω) Notation — Definition & Verification
Big-Theta (Θ) Notation — Definition & Diagram
Growth Rate Ordering
Strassen's Matrix Multiplication
Topological Sort — Algorithm & Apply on DAG
0/1 Knapsack Problem (Dynamic Programming)
KMP String Matching Algorithm & LPS Array
Cook-Levin Theorem & CNF-SAT Problem
Rabin-Karp Algorithm (Rolling Hash)
✅ Pass Strategy (40+)
Focus on Block 3 Unit 1 (Dijkstra + Floyd-Warshall) + Block 2 Unit 1 (Fractional Knapsack + Prim's) + Block 4 Unit 1 (P/NP). These 3 units alone cover ~40 marks. For Q1 compulsory: learn asymptotic notation proof + one recurrence solution = 10 marks free. Attempt only 2 optional questions where you can apply algorithms step-by-step.
⭐ Distinction Strategy (72+)
Master all Block 2 and Block 3 units. Learn to trace every algorithm on a graph. Dijkstra + Floyd-Warshall + Prim/Kruskal + Merge/Quick Sort + Greedy Knapsack + KMP + Matrix Chain DP = covers 70+ marks. Add P/NP theory for 10 more. Know how to derive complexity for every algorithm.