Course Code: DC-32128 Topics
Design & Analysis of Algorithms
Master key topics and exam concepts step by step. Track completed lessons, practice past papers, and access verified study notes.
28
Total Topics
0
Completed
28
Pending
1
Units / Chapters
All Topics
0/28 done28 topics
01
Introduction02
Role of Algorithms in Computing03
Analysis on Nature of Input and Size of Input04
Asymptotic Notations05
Big-O Notation06
Big-Ω Notation07
Big-Θ Notation08
Little-o Notation09
Little-ω Notation10
Sorting Algorithm Analysis11
Loop Invariants12
Recursion and Recurrence Relations13
Algorithm Design Techniques14
Brute Force Approach15
Divide-and-Conquer Approach16
Merge Sort17
Quick Sort18
Greedy Approach19
Dynamic Programming20
Elements of Dynamic Programming21
Search Trees22
Heaps23
Hashing24
Graph Algorithms25
Shortest Paths26
Sparse Graphs27
String Matching28
Introduction to Complexity ClassesPast Papers
Open this section to view and download past papers
Click on Show Past Papers to load available exam papers.