Lectures in course CS-250: Algorithms I

Introduction to Algorithms Log in to Mediaspace to watch this video

Introduces the importance of studying algorithms, presents a clever algorithm for calculating an arithmetic series, and discusses efficiency and correctness in algorithms.

Insertion Sort: Basics and Analysis Log in to Mediaspace to watch this video

Introduces Insertion Sort, explaining its basics, insertion process, and correctness analysis.

Heaps and Heapsort

Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.

Prim's and Kruskal's Algorithms Log in to Mediaspace to watch this video

Explores Prim's and Kruskal's algorithms, focusing on greedy approaches and implementation challenges.

Shortest Paths: Negative Weights Log in to Mediaspace to watch this video

Explores Bellman-Ford algorithm for negative weight graphs and currency exchange rates.

Bellman-Ford Algorithm: Analysis and Correctness Log in to Mediaspace to watch this video

Explores the Bellman-Ford algorithm, its correctness, and practical applications in dynamic networks and real-world scenarios.

Bellman Ford: Shortest Paths Log in to Mediaspace to watch this video

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.

Dijkstra's Algorithm and Probabilistic Analysis Log in to Mediaspace to watch this video

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Heapsort and Priority Queues

Explores heapsort, priority queues, and their operations, highlighting time complexity and practicality.

Heaps and Priority Queues

Explores heaps, heapsort, and priority queues, including operations and analysis.

Stacks and Queues: Implementation and Efficiency

Explores the implementation and efficiency of stacks and queues, along with an algorithmic challenge involving train order determination.

Data Structures: Stacks, Queues, Linked Lists

Covers stacks, queues, linked lists, and binary search trees in data structures.

Binary Search Trees: Operations and Implementations

Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.

Binary Search Trees: Operations and Implementations

Covers operations and implementations of binary search trees.

Dynamic Programming: Introduction and Fibonacci Numbers

Introduces Dynamic Programming, focusing on saving computation by remembering previous calculations and applying it to solve optimization problems efficiently.

Dynamic Programming: Fibonacci Numbers

Explores dynamic programming through Fibonacci numbers, memoization, and rod cutting applications.

Rod Cutting and Change-Making Problem

Covers the rod cutting problem and the change-making problem to optimize recursive calls and find the minimum number of coins needed for a given amount of money.

Merge Sort: Divide and Conquer Log in to Mediaspace to watch this video

Introduces growth of functions, sorting problem, insertion sort, computational model, and merge sort.

Dynamic Programming: Rod Cutting and Change Making

Explores dynamic programming through rod cutting and change making optimization problems.

Matrix Chain Multiplication: Optimal Substructure and Recursive Formula

Explores optimal substructure and recursive formula in matrix chain multiplication using dynamic programming.