SEARCH COURSES

Fundamentals of Algorithms (VU)

(41 Lectures Available)


Lecture Course Institute Discipline
Introduction Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Model of computation, 2-d maxima Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Analysis of 2-d Maxima Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Runtime analysis Fundamentals of Algorithms (VU) Virtual University Applied Sciences
2-d maxima sweep line algorithm Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Asymptotic Notation Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Asymptotic notation, merge sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Analysis of Merge Sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Solving recurrence relations, median selection Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Median selection – partitioning algorithm Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Analysis of median selection, binary heaps, sorting Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Heap sort, analysis of heap sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Quick sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Analysis of quick sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Lower bounds for sorting, Linear time sorting, counting sort Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Bucket sort, radix sort, dynamic programming, Fibonacci sequence Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Dynamic programming – edit distance algorithm Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Dynamic programming – chain matrix multiply Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Dynamic programming – 0/1 knapsack Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Greedy algorithms – coin change problem Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Greedy algorithms – Huffman encoding Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Greedy algorithms – Activity scheduling Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Greedy algorithms – fracitional knapsack, Graphs – definitions Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Graphs – representations, traversal Fundamentals of Algorithms (VU) Virtual University Applied Sciences
Graphs – breadth-first search, generic traversal algorithms Fundamentals of Algorithms (VU) Virtual University Applied Sciences

of 2 41 Lectures Available.