01:23:11

CSE101, Fall 22, Lec 19: Depth First Search (DFS)

01:27:59

CSE101, Fall 22, Lec 18: Single Source Shortest Path, Bellman-Ford and Dijkstra's algorithms

13:30

CSE101, Fall 22, Lec 17, Part 2: Introduction to Single Source Shortest Paths

01:09:43

CSE101, Fall 22, Lec 17, Part 1: Breadth First Search

44:40

CSE101, Fall 22, Lec 16, Part 2: Introduction to Breadth First Search (BFS)

49:18

CSE101, Fall 22, Lec 16, Part 1: Introduction to graphs

01:30:06

CSE101, Fall 22, Lec 13: Mergesort and Quicksort

54:47

CSE101, Fall 22, Lec 12, Part 2: Hash tables

30:46

CSE101, Fall 22, Lec 12, part 1: Range search in balanced BSTs

01:30:48

CSE101, Fall 22, Lec 11: AVL trees

46:59

CSE101, Fall 22, Lec 10, Part 1: Tree traversals

37:56

CSE101, Fall 22, Lec 10, Part 2: Self balancing trees and rotations

01:19:45

CSE101, Fall 22: Lec 6, asymptotic running time analysis of quadratic time sorting algorithms

01:28:12

CSE101, Fall 22, Lec 9: Binary Search Trees

01:28:47

CSE101, Fall 22, Lec 8: Binary heaps

43:30

CSE101, Fall 22, Lec 7, Part 1: Analysis of binary search

38:51

CSE101, Fall 22, Lec 7, Part 2: An introduction to priority queues and binary heaps

01:31:19

CSE101, Fall 22, Lec 5: Starting asymptotic analysis of algorithms, big-Oh notation

01:21:52

CSE101, Fall 22, Lec 4: Stacks and recursion

23:12

CSE101 Fall 22, Lec 3, Part 3: An introduction to simulating recursion through stacks

25:58

CSE101 Fall 22, Lec 3, Part 2: An introduction to stacks and parentheses checking

25:31

CSE101 Fall 22, Lec 3, Part 1: Reversing a linked list

01:35:02

CSE101, Fall 22: Linked lists

01:30:28

CSE204, Lec 19: Basic of cryptography, from a complexity perspective

01:31:47

CSE204, Lec 17: Proving the Sumcheck protocol for #SAT, a short discussion about MIP

01:28:08

CSE204, Lec 18: The PCP theorem and hardness of approximation

01:28:47

CSE204, Lec 16: Proving the set lower bound protocol, and starting the proof that IP = PSPACE

01:32:46

CSE204, Lec 15: Arthur-Merlin protocols and the Goldwasser-Sipser set lower bound protocol

01:33:16

CSE204, Lec 13: Relating BPP to other complexity classes

01:32:22

CSE2014, Lec 12: Introduction to randomized complexity classes and BPP

01:32:50

CSE204, Lec 14: Introduction to Interactive Protocols

01:34:31

CSE 204, Lec 10, Part 1: Complete languages for the polynomial hierarchy

45:26

CSE204, Lec 10, Part 2: Introduction to circuit complexity

01:31:01

CSE204, Lec 9: Equivalences of definitions of the polynomial hierarchy

01:27:13

CSE204, Lec 3: 3SAT is NP-complete, and the class co-NP

01:29:57

CSE204, Lec 2: NP-completeness and the Cook-Levin Theorem

01:26:07

CSE201, Lec 19: The Fast Fourier Transform

01:25:23

CSE201, Lec 18: Cuts and flows

01:30:56

CSE201, Lec 17: An introduction to NP-completeness and the connection with optimization problems

01:30:18

CSE201, Lec 16: The nlog n lower bound for comparison based sorters

01:30:01

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

01:32:02

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

01:28:37

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

01:28:04

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

01:27:26

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

01:28:29

CSE201, Lec 10: Minimum Spanning Trees

01:29:51

CSE201, Lec 9: Huffman coding

01:24:19

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

01:32:54

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

01:31:22

CSE201, Lec 6: Intro to Dynamic Programming

01:33:06

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

01:26:31

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

01:28:27

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

01:26:05

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

01:10:19

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

22:26

Student recital for Pt. Partha Chatterjee: Raga Khamaj

01:27:57

CSE101, Lec 7: Binary Heaps

01:25:25

CSE202, Lec 18: Maxcut and the Goemans-Williamson SDP relaxation

01:26:25

CSE202, Lec 17: Conductance and spectral gap, the Cheeger inequality

01:33:52

CSE202, Lec 16: The conductance of graphs, the normalized Laplacian and the spectral gap