Course Code: COMP313853 Topics
Design and Analysis of Algorithms
Master key topics and exam concepts step by step. Track completed lessons, practice past papers, and access verified study notes.
53
Total Topics
0
Completed
53
Pending
1
Units / Chapters
All Topics
0/53 done53 topics
01
Introduction to Algorithm Design02
Data Structures03
Efficiency in Algorithms04
Analysis of Algorithms05
Mathematical Review06
Mathematical Analysis of Algorithms07
Types of Functions08
Order of Growth09
Asymptotic Notations10
Sorting Algorithms11
Selection Sort Algorithm12
Example and Analysis of Selection Sort13
Insertion Sort Algorithm14
Divide and Conquer Algorithms15
Merge Sort Algorithm16
Quick Sort Algorithm17
Bucket Sort Algorithm18
Radix Sort Algorithm19
Counting Sort Algorithm20
Heap Sort Basics21
Heap Algorithms22
Heap Properties and Examples23
Heap Operations24
Heap Sort Algorithm Analysis25
Heap Insertion and Deletion26
Tree Based Algorithms and Hashing27
Red Black Tree Basics28
Binary Search Tree Basics29
Tree Searching Algorithms30
Analysis of Tree Searching Algorithms31
Analysis of Insertion and Deletion in BST32
Hashing Basics33
Examples of Hash Functions34
Analysis of Collision Resolution Techniques35
Dynamic Programming36
0-1 Knapsack Problem37
Fractional Knapsack Problem38
Longest Common Subsequence39
Shortest Path Finding40
Matrix Chain Multiplication41
Assembly Line Chain Problem42
Greedy Algorithms43
Prim's Algorithm44
Kruskal's Algorithm45
Dijkstra's Algorithm46
Huffman Coding47
NP-Completeness48
Polynomial Time Verification49
Reducibility50
NP-Completeness Proofs51
Randomized Algorithms52
Particle Swarm Optimization53
Genetic AlgorithmsPast Papers
Open this section to view and download past papers
Click on Show Past Papers to load available exam papers.