Catalog

CSE373 --- Analysis of Algorithms (Fall 2021) - Steven Skiena

Electrical Engineering and Computer Science unknown 26 lectures

Syllabus

  1. 1 CSE 373 --- Lecture 1: Introduction to Algorithms (Fall 2021)
  2. 2 CSE 373 --- Lecture 2: Asymptotic Notation (Fall 2021)
  3. 3 CSE 373 --- Lecture 3: Program Analysis (Fall 2021)
  4. 4 CSE 373 --- Lecture 4: Elementary Data Structures (Fall 2021)
  5. 5 CSE 373 --- Lecture 5: Dictionaries (Fall 2021)
  6. 6 CSE 373 --- Lecture 6: Hashing (Fall 2021)
  7. 7 CSE 373 --- Lecture 7: Heapsort/Priority Queues (Fall 2021)
  8. 8 CSE 373 --- Lecture 8: Mergesort/Quicksort (Fall 2021)
  9. 9 CSE 373 --- Lecture 9: Linear Sorting (Fall 2021)
  10. 10 CSE 373 --- Lecture 10: Graph Data Structures (Fall 2021)
  11. 11 CSE 373 --- Lecture 11: Breadth-First Search (Fall 2021)
  12. 12 CSE 373 --- Lecture 12: Depth-First Search (Fall 2021)
  13. 13 CSE 373 --- Lecture 13: Minimum Spanning Trees (Fall 2021)
  14. 14 CSE 373 --- Lecture 14: Shortest Path (Fall 2021)
  15. 15 CSE 373 --- Lecture 14: Shortest Path Part 2 (Fall 2021)
  16. 16 CSE 373 --- Lecture 15: Backtracking (Fall 2021)
  17. 17 CSE 373 --- Lecture 15: Backtracking Part 2 (Fall 2021)
  18. 18 CSE 373 --- Lecture 16: Introduction to Dynamic Programming (Fall 2021)
  19. 19 CSE 373 --- Lecture 17: Edit Distance (Fall 2021)
  20. 20 CSE 373 --- Lecture 17: Edit Distance (Part 2) (Fall 2021)
  21. 21 CSE 373 --- Lecture 18: Applications of Dynamic Programming (Fall 2021)
  22. 22 CSE 373 --- Lecture 18: Applications of Dynamic Programming (Part 2) (Fall 2021)
  23. 23 CSE 373 --- Lecture 19: Introduction to NP-Completeness (Fall 2021)
  24. 24 CSE 373 --- Lecture 20: Satisfiability (Fall 2021)
  25. 25 CSE 373 --- Lecture 20: Satisfiability (Part 2) (Fall 2021)
  26. 26 CSE 373 --- Lecture 21: The NP-Completeness Challenge (Fall 2021)