Data Structures & 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 37
37 topics
01
Abstract Data Types
02
Complexity Analysis
03
Big Oh Notation
04
Stacks (Linked Lists and Array Implementations)
05
Recursion and analyzing recursive algorithms
06
Divide and Conquer Algorithms
07
Sorting Algorithms
08
Selection Sort
09
Insertion Sort
10
Merge Sort
11
Quick Sort
12
Bubble Sort
13
Heap Sort
14
Shell Sort
15
Radix Sort
16
Bucket Sort
17
Queue
18
Dequeuer
19
Priority Queues (linked and array implementations of queues)
20
Linked List and Its Various Types
21
Sorted Linked List
22
Searching an Unsorted Array
23
Binary Search for Sorted Arrays
24
Hashing and Indexing
25
Open Addressing and Chaining
26
Trees and Tree Traversals
27
Binary Search Trees
28
Heaps
29
M-Way Trees
30
Balanced Trees
31
Graphs
32
Breadth-First Traversal
33
Depth-First Traversal
34
Topological Order
35
Shortest Path
36
Adjacency Matrix and Adjacency List Implementations
37
Memory Management and Garbage Collection
Past Papers
Open this section to load past papers
Click on Show Past Papers to see past papers.
📁 Subject Resources