Design & Analysis of Algorithms
This subject walks you through the most important concepts step by step, starting from the foundations and moving towards practical exam-focused preparation. Use this page as your central place to revise topics, jump into notes, and quickly access practice material when you need it.
U1
General Topics
topic 1 to 28
28 topics
01
Introduction
02
Role of Algorithms in Computing
03
Analysis on Nature of Input and Size of Input
04
Asymptotic Notations
05
Big-O Notation
06
Big-Ω Notation
07
Big-Θ Notation
08
Little-o Notation
09
Little-ω Notation
10
Sorting Algorithm Analysis
11
Loop Invariants
12
Recursion and Recurrence Relations
13
Algorithm Design Techniques
14
Brute Force Approach
15
Divide-and-Conquer Approach
16
Merge Sort
17
Quick Sort
18
Greedy Approach
19
Dynamic Programming
20
Elements of Dynamic Programming
21
Search Trees
22
Heaps
23
Hashing
24
Graph Algorithms
25
Shortest Paths
26
Sparse Graphs
27
String Matching
28
Introduction to Complexity Classes
Past Papers
Open this section to load past papers
Click on Show Past Papers to see past papers.