🌲 Algorithm-Driven • 8 PYQ Papers Analysed

Master Big-O
in DSA

21CSC201J · SRM IST · Semester 3
Data Structures & Algorithms — Complete Smart Study Hub

5
Units Covered
8
PYQs Analysed
40+
Algorithm Traces
15
Must-Know Topics
View PYQ Analysis → Start Studying
↓ scroll to explore
DRIVE RESOURCES

📚 Notes & Presentations

Unit-wise lecture notes, PPTs & study material synced from Google Drive

⏳
Connecting to Google Drive…
🔥 Units 2 & 3 = 55% of marks.  Trees, Graphs, Sorting, and Dynamic Programming appear in 7 out of 8 papers. Master these first! 60% of exam questions are "Trace the Algorithm" — dry-run every example step-by-step.
📈 Data-Driven Analysis

PYQ Pareto Analysis

Based on 8 exam papers. Master the 20% of topics that yield 80% of marks.

Unit 1
Linear Data Structures
18%
13 / 75 marks
🔥 HOT
Unit 2
Trees & Hashing
28%
21 / 75 marks
🔥 HOT
Unit 3
Graph Algorithms
22%
16 / 75 marks
Unit 4
Sorting & Searching
20%
15 / 75 marks
Unit 5
Algorithm Design
12%
10 / 75 marks

🏆 Top Topics — The Pareto List

Mastering only these topics lets you score 55–65 out of 75

🌡️ Topic Frequency Heatmap

📚 Complete Study Guide

Unit-by-Unit Study Guide

Clear concepts, Big-O complexity tables, traced algorithm examples, dry-runs, and common exam mistakes for every unit.

⚡ Quick Reference

Complexity & Algorithm Cheat Sheet

Key time complexities, recurrence relations, and algorithm templates. Click any card to highlight it.

🎯 Exam Strategy

Guaranteed Marks Plan

How to approach each part of the DSA exam for maximum marks.

Part A
25 MCQs × 1 = 25 marks
Target: 20–23 / 25
  • Big-O: identify worst/avg/best case complexity of algorithms 8/8
  • Trace BST Insert/Delete/Search operations 8/8
  • Tree traversals: Inorder, Preorder, Postorder output 8/8
  • Stack & Queue: push/pop/enqueue/dequeue state tracing 7/8
  • Graph BFS/DFS — identify order of visited vertices 7/8
  • Sorting: state of array after N passes of Bubble/Insertion Sort 7/8
  • Hashing: linear/quadratic probing — find slot of a key 6/8
  • Linked List: pointer manipulation after insert/delete 6/8
  • Heaps: min-heap/max-heap property verification 6/8
  • Master Theorem: apply to given recurrence relation 5/8
Part B
5 Questions × 8 = 40 marks
Target: 32–40 / 40
QUnitExpected Topic
21U1Linked List operations OR Stack/Queue implementation
22U2BST Insert/Delete with diagram + Inorder trace 🔥
23U3BFS or DFS traversal with adjacency matrix/list 🔥
24U4Merge Sort or Quick Sort — step-by-step trace 🔥
25U5Knapsack (0/1 or Fractional) OR LCS DP table
Part C
1 Question × 10 = 10 marks
Target: 8–10 / 10

Choose 1 of 2 questions. Typical options:

Q.26
Dijkstra's Algorithm — shortest path with step-by-step distance table 🔥 OR Kruskal's / Prim's Algorithm for Minimum Spanning Tree
Q.27
Dynamic Programming — 0/1 Knapsack with full DP table constructed step-by-step OR AVL Tree — Insert with rotations OR Heap Sort trace
💡 DSA Exam Secret: Always show the INTERMEDIATE STATES after each step. Examiners award marks for correct partial traces even if your final answer is wrong. Draw the tree/graph after every operation.

🔮 Predicted Next Exam Topics

Based on recent patterns

✏️ Practice Zone

Solved Questions & MCQ Drill

The most-repeated solved questions from 8 years of PYQs, plus MCQ flashcards.

🃏 MCQ Flashcards — Active Recall Drill

Click A, B, C, or D to commit your answer. Get instant feedback. Track your score below.

✅ Correct: 0
❌ Wrong: 0
📊 Total: 0

✅ Final Revision Checklist

📜 Past Year Papers

Solved PYQs

Select a paper to view its full HTML solution.

✍️ Quick Scratchpad
⚡ Quick Complexity Look-up
All Complexity Cards
📋 Copied to clipboard!
✨ New: Live Compiler + AI Assistant