Design and 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 53
53 topics
01
Introduction to Algorithm Design
02
Data Structures
03
Efficiency in Algorithms
04
Analysis of Algorithms
05
Mathematical Review
06
Mathematical Analysis of Algorithms
07
Types of Functions
08
Order of Growth
09
Asymptotic Notations
10
Sorting Algorithms
11
Selection Sort Algorithm
12
Example and Analysis of Selection Sort
13
Insertion Sort Algorithm
14
Divide and Conquer Algorithms
15
Merge Sort Algorithm
16
Quick Sort Algorithm
17
Bucket Sort Algorithm
18
Radix Sort Algorithm
19
Counting Sort Algorithm
20
Heap Sort Basics
21
Heap Algorithms
22
Heap Properties and Examples
23
Heap Operations
24
Heap Sort Algorithm Analysis
25
Heap Insertion and Deletion
26
Tree Based Algorithms and Hashing
27
Red Black Tree Basics
28
Binary Search Tree Basics
29
Tree Searching Algorithms
30
Analysis of Tree Searching Algorithms
31
Analysis of Insertion and Deletion in BST
32
Hashing Basics
33
Examples of Hash Functions
34
Analysis of Collision Resolution Techniques
35
Dynamic Programming
36
0-1 Knapsack Problem
37
Fractional Knapsack Problem
38
Longest Common Subsequence
39
Shortest Path Finding
40
Matrix Chain Multiplication
41
Assembly Line Chain Problem
42
Greedy Algorithms
43
Prim's Algorithm
44
Kruskal's Algorithm
45
Dijkstra's Algorithm
46
Huffman Coding
47
NP-Completeness
48
Polynomial Time Verification
49
Reducibility
50
NP-Completeness Proofs
51
Randomized Algorithms
52
Particle Swarm Optimization
53
Genetic Algorithms
Past Papers
Open this section to load past papers
Click on Show Past Papers to see past papers.