CS502: Fundamentals of Algorithms
CS502 Fundamentals of Algorithms is a course taught at Virtual University of Pakistan. Practise every lecture of CS502 with lecture-wise quizzes and Past Papers Style Solved MCQs, then test yourself with midterm and final term mocks made from your own syllabus.
- 48 lectures
- Past papers style solved MCQs
- Answers in English and Roman Urdu
- CS502 handouts PDF
How to prepare for CS502
CS502 Lecture Quizzes
Each quiz covers a few lectures. New here? Start with Lecture 0-2 Quiz.
Tap the lectures in your exam. Only matching quizzes stay highlighted.
CS502 Exam Mocks
A practice paper made only from the lectures in your syllabus. Pick the one that fits your next exam.
CS502 Leaderboard
Points are your correct answers in lecture quizzes.
Loading leaderboard…
Stuck on a lecture? Ask other CS502 students.
Post your question, discuss a tricky MCQ or help someone else. Be the first to start a discussion.
CS502 Fundamentals of Algorithms
Gradup covers all 48 lectures of CS502 Fundamentals of Algorithms with Past Papers Style Solved MCQs. Use the lecture quizzes while you study the CS502 handouts, then switch to the CS502 midterm and final term mocks. Every answer comes with an explanation and the handout reference, so you know exactly where to revise.
See all 48 CS502 lectures
- 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
Frequently asked questions
Quick answers about practising CS502 on Gradup.
Gradup has lecture-wise CS502 quizzes with Past Papers Style Solved MCQs covering all 48 lectures, with explanations in English and Roman Urdu.
Yes. Choose the lectures that are in your midterm and Gradup builds a CS502 midterm mock from Past Papers Style Solved MCQs of only those lectures. Try again for other questions from the same lectures.
Yes. The CS502 final term mock mixes easy, medium and hard MCQs from the lectures you select, just like the real paper.
You can take any quiz without an account. Sign up free to get one month of full access with progress tracking, mocks, streaks and the leaderboard.