lec part

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶CSE101, Fall 22, Lec 12, part 1: Range search in balanced BSTsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
2. 2▶CSE101, Fall 22, Lec 11: AVL treesCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
3. 3▶CSE101, Fall 22, Lec 10, Part 1: Tree traversalsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
4. 4▶CSE101, Fall 22, Lec 10, Part 2: Self balancing trees and rotationsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
5. 5▶CSE101, Fall 22: Lec 6, asymptotic running time analysis of quadratic time sorting algorithmsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
6. 6▶CSE101, Fall 22, Lec 9: Binary Search TreesCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
7. 7▶CSE101, Fall 22, Lec 8: Binary heapsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
8. 8▶CSE101, Fall 22, Lec 7, Part 1: Analysis of binary searchCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
9. 9▶CSE101, Fall 22, Lec 7, Part 2: An introduction to priority queues and binary heapsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
10. 10▶CSE101, Fall 22, Lec 5: Starting asymptotic analysis of algorithms, big-Oh notationCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
11. 11▶CSE101, Fall 22, Lec 4: Stacks and recursionCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
12. 12▶CSE101 Fall 22, Lec 3, Part 3: An introduction to simulating recursion through stacksCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
13. 13▶CSE101 Fall 22, Lec 3, Part 2: An introduction to stacks and parentheses checkingCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
14. 14▶CSE101 Fall 22, Lec 3, Part 1: Reversing a linked listCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
15. 15▶CSE101, Fall 22: Linked listsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
16. 16▶CSE204, Lec 19: Basic of cryptography, from a complexity perspectiveCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
17. 17▶CSE204, Lec 17: Proving the Sumcheck protocol for #SAT, a short discussion about MIPCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
18. 18▶CSE204, Lec 18: The PCP theorem and hardness of approximationCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
19. 19▶CSE204, Lec 16: Proving the set lower bound protocol, and starting the proof that IP = PSPACECSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
20. 20▶CSE204, Lec 15: Arthur-Merlin protocols and the Goldwasser-Sipser set lower bound protocolCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
21. 21▶CSE204, Lec 13: Relating BPP to other complexity classesCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
22. 22▶CSE2014, Lec 12: Introduction to randomized complexity classes and BPPCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
23. 23▶CSE204, Lec 14: Introduction to Interactive ProtocolsCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
24. 24▶CSE 204, Lec 10, Part 1: Complete languages for the polynomial hierarchyCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
25. 25▶CSE204, Lec 10, Part 2: Introduction to circuit complexityCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
26. 26▶CSE204, Lec 9: Equivalences of definitions of the polynomial hierarchyCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
27. 27▶CSE204, Lec 3: 3SAT is NP-complete, and the class co-NPCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later
28. 28▶CSE204, Lec 2: NP-completeness and the Cook-Levin TheoremCSE204, Spring 2022: Computational Complexity TheoryNotes
    +Watch later