RSS Amplifier

Video feed

CSE201, Winter 2022: Analysis of Algorithms

youtube.com ↗Source feed ↗15 videos

Subscribe:.rss.atom.json.md

Dormant Last read · last published · next check
Read 8 days ago and current, but nothing has been published for 5 years.

Written by

Latest videos

Saves to your Watch queue, to pick up on another day or another device.

CSE201, Lec 15: Karatsuba multiplication and Strassen's matrix multiplication

Play

CSE201, Lec 14: Linear time selection using divide and conquer

Play

CSE201, Lec 13: Introduction to divide and conquer, Mergesort and the stock market problem

Play

CSE201, Lec 12: Dijkstra's algorithms, All Pairs Shortest Paths, and matrix multiplication

Play

CSE201, Lec 11: Single source shortest paths and the Bellman-Ford algorithm

Play

CSE201, Lec 10: Minimum Spanning Trees

Play

CSE201, Lec 9: Huffman coding

Play

CSE201, Lec 8: Greedy Algorithms; the Fractional Knapsack Problem and introduction to Huffman Coding

Play

CSE201, Lec 7: Dynamic Programming for the Longest Common Subsequence and Optimal BST problems

Play

CSE201, Lec 6: Intro to Dynamic Programming

Play

CSE201, Lec 5: Using Depth-First Search to find Strongly Connected Components

Play

CSE201, Lec 4: More on Depth-First Search, Topologically sorting a DAG

Play

CSE201, Lec 3: Depth First Search (DFS) and the concept of finishing times

Play

CSE201, Lec 2: More on the BFS invariant, and using BFS for 2-coloring/bipartiteness

Play

CSE201, Lec 1:The Breadth First Search (BFS) invariant

Play