UCS415 โ€” STUDY GUIDE

Mastering DAA

Curated visual roadmap for Design & Analysis of Algorithms

66
Videos
0/66
Completed
9
Units
75
Max Marks
๐Ÿ“š View Full Resource Library (PDFs) ๐Ÿ“ View Comprehensive Master Notes
๐Ÿ”
๐ŸŽฏ RECOMMENDED โ€” For Backtracking problems, check out The Gate Hub. They provide excellent explanations for all complex backtracking algorithms.
๐Ÿ’ก EXAM TIP โ€” Attempt any 3 of 4 questions. Priority videos marked โญ map directly to Q.1โ€“Q.4 from the May 2025 paper. Focus order: Master Theorem โ†’ TSP B&B โ†’ Knapsack DP โ†’ Rabin-Karp โ†’ Huffman โ†’ SCC โ†’ Max Flow โ†’ Egg Drop
Channels
๐ŸŽ“
Abdul Bari
@abdul_bari
๐Ÿ“
Jenny's Lectures
@JennyslecturesCSITNETJRF
๐ŸŒ
William Fiset
@WilliamFiset-videos
๐Ÿ›๏ธ
MIT OCW
@mitocw
Unit 01
Introduction & Complexity Analysis 14 videos ๐Ÿ“„ PDF Notes
01
What is an Algorithm, Properties & Need
Abdul Bari
โ†’ 02
Algorithm vs Program
Abdul Bari
โ†’ 03
Stacks & Queues โ€” Basics
Jenny's Lectures
โ†’ 04
Trees โ€” Basics
Jenny's Lectures
โ†’ 05
Heaps โ€” Basics
Abdul Bari
โ†’ 06
Big O, ฮฉ, ฮ˜ โ€” Order Arithmetic & Asymptotic Notation
Abdul Bari
โ†’ 07
Complexity Classes Overview
Abdul Bari
โ†’ 08
Time & Space Trade-offs in Algorithms
Jenny's Lectures
โ†’ 09
Analysis of Iterative Algorithms
Abdul Bari
โ†’ 10
Analysis of Recursive Algorithms
Abdul Bari
โ†’ 11
Recurrence Relations Intro
Abdul Bari
โ†’ 12
Substitution Method
Abdul Bari
โ†’ 13
Recurrence Tree Method
Abdul Bari
โ†’ 14
Master Theorem (Master Method)
Abdul Bari
โญ Q.1a โ†’
Unit 02
Divide and Conquer 6 videos ๐Ÿ“„ PDF Notes
15
General Method of Divide & Conquer
Abdul Bari
โ†’ 16
Binary Search
Abdul Bari
โ†’ 17
Merge Sort
Abdul Bari
โ†’ 18
Quick Sort
Abdul Bari
โ†’ 19
Maximum Subarray Problem
Abdul Bari
โ†’ 20
Peak Element in Array (Mountain Array)
Jenny's Lectures
โ†’
Unit 03
Greedy Algorithms 7 videos ๐Ÿ“„ PDF Notes
21
General Method & Elements of Greedy Strategy
Abdul Bari
โ†’ 22
Activity Selection Problem
Abdul Bari
โ†’ 23
Minimum Platforms Problem
Jenny's Lectures
โ†’ 24
Coin Exchange Problem
Abdul Bari
โ†’ 25
Job Sequencing with Deadlines
Abdul Bari
โ†’ 26
Fractional Knapsack Problem
Abdul Bari
โญ Q.2b โ†’ 27
Huffman Coding
Abdul Bari
โญ Q.3b โ†’
Unit 04
Dynamic Programming 9 videos ๐Ÿ“„ PDF Notes
28
General Method & Elements of DP
Abdul Bari
โ†’ 29
Memoization vs Tabulation (Table instead of Recursion)
Jenny's Lectures
โ†’ 30
Fibonacci Series (Recursive vs DP)
Abdul Bari
โ†’ 31
Matrix Chain Multiplication
Abdul Bari
โ†’ 32
0/1 Knapsack Problem (DP)
Abdul Bari
โญ Q.2b โ†’ 33
Longest Common Subsequence (LCS)
Abdul Bari
โ†’ 34
Maximum Sum Subarray (Kadane's Algorithm)
Abdul Bari
โ†’ 35
Maximum Independent Set in a Tree
Jenny's Lectures
โ†’ 36
Egg Drop Problem (DP Table)
Search: Jenny's egg drop DP
โญ Q.4a โ†’
Unit 05
Backtracking 7 videos ๐Ÿ“„ PDF Notes
37
Introduction to Backtracking
Abdul Bari
โ†’ 38
N-Queens Problem
Abdul Bari
โ†’ 39
Sum of Subsets Problem
Abdul Bari
โ†’ 40
Graph Coloring
Abdul Bari
โ†’ 41
Puzzles / Sudoku using Backtracking
babbar saab
โ†’ 42
Hamiltonian Cycle Problem
Abdul Bari
โ†’ 43
0/1 knapsack by Backtracking
abhishek tiwari
โ†’ 43
TSP using Backtracking
Abdul Bari
โญ Q.1b โ†’
Unit 06
Branch and Bound 3 videos ๐Ÿ“„ PDF Notes
44
General Method of Branch & Bound
Abdul Bari
โ†’ 45
0/1 Knapsack using Branch & Bound
Abdul Bari
โ†’ 46
TSP using Branch & Bound
Abdul Bari
โญ Q.1b โ†’
Unit 07
Graphs & Algorithms 10 videos ๐Ÿ“„ PDF Notes
47
Introduction to Graphs & Representation
Abdul Bari
โ†’ 48
BFS & DFS Traversal
Abdul Bari
โ†’ 49
Euler Graphs & Euler Circuits
Abdul Bari
โ†’ 50
Fleury's Algorithm (Eulerian Path)
Search: Fleury's Algorithm
โ†’ 51
Hierholzer's Algorithm
Search: Hierholzer's
โ†’ 52
Topological Sort (Kahn's & DFS)
William Fiset
โ†’ 53
Connected Components (Undirected Graph)
William Fiset
โ†’ 54
Strongly Connected Components โ€” Kosaraju's Algorithm
William Fiset
โญ Q.4b โ†’ 55
Ford-Fulkerson Max Flow Algorithm
William Fiset
โญ Q.3a โ†’ 56
Max Flow โ€” Min Cut Theorem
Back To Back SWE
โญ Q.3a โ†’
Unit 08
String Matching Algorithms 5 videos ๐Ÿ“„ PDF Notes
57
Naive String Matching also KMP in there
Abdul Bari
โ†’ 58
Rabin-Karp Algorithm
Abdul Bari
โญ Q.2a โ†’ 59
KMP โ€” Knuth-Morris-Pratt Algorithm
Abdul Bari
โ†’ 60
Boyer-Moore Algorithm
Search: Boyer-Moore
โ†’ 61
Suffix Arrays
William Fiset
โ†’
Unit 09
Problem Classes & Advanced Topics 5 videos ๐Ÿ“„ PDF Notes
62
P vs NP
Abdul Bari
โ†’ 63
NP-Hard vs NP-Complete
Abdul Bari
โ†’ 64
Deterministic vs Non-Deterministic Algorithms
Search: Jenny's P NP NPC DAA
โ†’ 65
Approximation Algorithms (2-approx TSP)
Abdul Bari
โญ Q.1b โ†’ 66
Randomized Algorithms (Las Vegas & Monte Carlo)
MIT OCW
โ†’