#### Fundamentals of Algorithms (VU)

(41 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1 Introduction Fundamentals of Algorithms (VU) Virtual University Applied Sciences
2 Model of computation, 2-d maxima Fundamentals of Algorithms (VU) Virtual University Applied Sciences
3 Analysis of 2-d Maxima Fundamentals of Algorithms (VU) Virtual University Applied Sciences
4 Runtime analysis Fundamentals of Algorithms (VU) Virtual University Applied Sciences
5 2-d maxima sweep line algorithm Fundamentals of Algorithms (VU) Virtual University Applied Sciences
6 Asymptotic Notation Fundamentals of Algorithms (VU) Virtual University Applied Sciences
7 Asymptotic notation, merge sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
8 Analysis of Merge Sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
9 Solving recurrence relations, median selection Fundamentals of Algorithms (VU) Virtual University Applied Sciences
10 Median selection – partitioning algorithm Fundamentals of Algorithms (VU) Virtual University Applied Sciences
11 Analysis of median selection, binary heaps, sorting Fundamentals of Algorithms (VU) Virtual University Applied Sciences
12 Heap sort, analysis of heap sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
13 Quick sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
14 Analysis of quick sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
15 Lower bounds for sorting, Linear time sorting, counting sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
16 Bucket sort, radix sort, dynamic programming, Fibonacci sequence Fundamentals of Algorithms (VU) Virtual University Applied Sciences
17 Dynamic programming – edit distance algorithm Fundamentals of Algorithms (VU) Virtual University Applied Sciences
18 Dynamic programming – chain matrix multiply Fundamentals of Algorithms (VU) Virtual University Applied Sciences
19 Dynamic programming – 0/1 knapsack Fundamentals of Algorithms (VU) Virtual University Applied Sciences
20 Greedy algorithms – coin change problem Fundamentals of Algorithms (VU) Virtual University Applied Sciences
21 Greedy algorithms – Huffman encoding Fundamentals of Algorithms (VU) Virtual University Applied Sciences
22 Greedy algorithms – Activity scheduling Fundamentals of Algorithms (VU) Virtual University Applied Sciences
23 Greedy algorithms – fracitional knapsack, Graphs – definitions Fundamentals of Algorithms (VU) Virtual University Applied Sciences
24 Graphs – representations, traversal Fundamentals of Algorithms (VU) Virtual University Applied Sciences
25 Graphs – breadth-first search, generic traversal algorithms Fundamentals of Algorithms (VU) Virtual University Applied Sciences
##### Social Sciences

of 2 41 Lectures Available.