CS502: CS502 Handouts PDF
Fundamentals of Algorithms
Download the complete CS502 Fundamentals of Algorithms handouts in one PDF, all 48 lectures from start to end. Read a lecture, then test yourself with the matching quiz so it stays in your head on exam day.
- 48 lectures
- 185 pages
- PDF, 2.1 MB
- Updated November 2026
What is inside the CS502 handouts
Every lecture in the PDF. Tap one to practise its quiz.
- 0 CS502 Lecture 0Welcome Note
- 1 CS502 Lecture 1Introduction
- 2 CS502 Lecture 2Model of computation, 2-d maxima
- 3 CS502 Lecture 3Analysis of 2-d Maxima
- 4 CS502 Lecture 4Runtime analysis
- 5 CS502 Lecture 52-d maxima: sweep line algorithm
- 6 CS502 Lecture 6Asymptotic Notation
- 7 CS502 Lecture 7Asymptotic notation, merge sort
- 8 CS502 Lecture 8Analysis of Merge Sort
- 9 CS502 Lecture 9Solving recurrence relations, median selection
- 10 CS502 Lecture 10Median selection - partitioning algorithm
- 11 CS502 Lecture 11Analysis of median selection, binary heaps, sorting
- 12 CS502 Lecture 12Heap sort, analysis of heap sort
- 13 CS502 Lecture 13Quick sort
- 14 CS502 Lecture 14Analysis of quick sort
- 15 CS502 Lecture 15Lower bounds for sorting, Linear time sorting, counting sort
- 16 CS502 Lecture 16Bucket sort, radix sort, dynamic programming, Fibonacci sequence
- 17 CS502 Lecture 17Dynamic programming - edit distance
- 18 CS502 Lecture 18Dynamic programming - edit distance algorithm
- 19 CS502 Lecture 19Dynamic programming - chain matrix multiply
- 20 CS502 Lecture 20Dynamic programming - chain matrix multiply
- 21 CS502 Lecture 21Dynamic programming - / 1 knapsack
- 22 CS502 Lecture 22Dynamic programming - / 1 knapsack
- 23 CS502 Lecture 23Greedy algorithms - coin change problem
- 24 CS502 Lecture 24Greedy algorithms - Huffman encoding
- 25 CS502 Lecture 25Greedy algorithms - Huffman encoding
- 26 CS502 Lecture 26Greedy algorithms - Activity scheduling
- 27 CS502 Lecture 27Greedy algorithms - fractional knapsack, Graphs - definitions
- 28 CS502 Lecture 28Graphs - representations, traversal
- 29 CS502 Lecture 29Graphs - breadth-first search, generic traversal algorithms
- 30 CS502 Lecture 30Graphs - generic traversal algorithms
- 31 CS502 Lecture 31Graphs - depth-first search, timestamp structure
- 32 CS502 Lecture 32Graphs - cycles, topological sorting
- 33 CS502 Lecture 33Graphs - strong components
- 34 CS502 Lecture 34Graphs - strong components, minimum spanning tree (MST)
- 35 CS502 Lecture 35Graphs - MST: generic approach
- 36 CS502 Lecture 36Graphs - MST: Kruskal's algorithm
- 37 CS502 Lecture 37Graphs - MST: Prim's algorithm
- 38 CS502 Lecture 38Graphs - shortest paths
- 39 CS502 Lecture 39Graphs - Dijkstra's algorithm
- 40 CS502 Lecture 40Graphs - Dijkstra's algorithm, Bellman-Ford algorithm
- 41 CS502 Lecture 41Graphs - all-pairs shortest path, Floyd-Warshall's algorithm
- 42 CS502 Lecture 42Graphs - Floyd-Warshall algorithm
- 43 CS502 Lecture 43Complexity theory -classes P, NP
- 44 CS502 Lecture 44Complexity theory - Reductions, graph coloring
- 45 CS502 Lecture 45Complexity theory - boolean satisfiability, independent sets
- 46 CS502 Lecture 46UVAS Spring 2010 (Lecture 1-27)
- 47 CS502 Lecture 47Pre-Assessment
How to study CS502 with the handouts
Reading alone is not enough. This is what works for most VU students.
- 1Read one or two lecturesShort sessions stick better than reading the whole PDF the night before.
- 2Take the lecture quizEvery Gradup quiz matches the handout lectures, with explanations in English and Roman Urdu.
- 3Revise what you got wrongGo back to those pages in the handouts, then try the quiz again.
- 4Take a mock before the examPick the lectures in your midterm or final term syllabus and get a mock paper from only those.
Frequently asked questions
About the CS502 handouts.
Tap Download PDF on this page. You get the complete CS502 Fundamentals of Algorithms handouts in one file (185 pages, 2.1 MB). It is free and you do not need to sign up.
The CS502 handouts cover all 48 lectures of Fundamentals of Algorithms, from the first lecture to the last.
Your teacher announces the midterm and final term syllabus on VU LMS each semester. Usually the midterm covers about the first half of the lectures and the final term covers the whole course.
Read a few lectures, then take the matching CS502 lecture quiz on Gradup. Each answer comes with an explanation in English and Roman Urdu, and a midterm or final term mock tests you before the exam.