← Back to Study Guide

Resource Library

Complete collection of PDF notes and exam papers

Unit 01: Recurrence

Recurrence Relation

Unit 1 / Primary Notes

Recurrence Relation Examples

Unit 1 / Examples

Unit 02: Divide & Conquer

MergeSort Analysis

QuickSort Analysis

Unit 2 / Search

Max Subarray Sum (D&C)

Unit 2 / DP vs D&C

Peak Index in Mountain Array

Unit 2 / Advanced

Unit 03: Greedy

Greedy Algorithms Final

Unit 3 / Complete

Unit 3 / Compression

Coin Exchange Algorithm

Unit 3 / Greedy

Minimum Platforms Problem

Unit 3 / Scheduling

Unit 04: Dynamic Programming

Basics & Matrix Chain Mult.

Longest Common Subsequence

0/1 Knapsack (DP)

Unit 4 / Optimization

Maximum Independent Set

Unit 4 / Tree DP

Max Subarray Sum (DP)

Unit 4 / Kadane

Unit 05: Backtracking

General Backtracking Method

N-Queens & Puzzles

Unit 5 / Queens

0/1 Knapsack (Backtracking)

Unit 5 / Knapsack

Sudoku Analysis

Unit 5 / Sudoku

Unit 06: Branch & Bound

TSP using Branch & Bound

Branch & Bound Examples

Unit 6 / Examples

Branch & Bound 0/1 Knapsack

Unit 6 / Knapsack

Unit 07: Graphs

Graphs: Basics & Euler/Hamiltonian

Max Flow & Ford-Fulkerson

Unit 08: String Matching

String Matching Algorithms

Unit 8 / Complete

Unit 09: Complexity Classes

P, NP, NP-Hard & Complete

Unit 9 / P vs NP

Approximation Algorithms

Unit 9 / Approx

Randomized Algorithms

Unit 9 / Randomized

Miscellaneous

MAY 2025 QUESTION PAPER

Root / Exam Paper

EST FINAL (WITH SOLUTIONS)

Root / Exam Paper

MAY 2024 EST SOLUTION

Root / Exam Paper

No resources found matching your search.