Quick Links:
[Discussion & OH]
[Schedule]
[Calendar]
[Problem Sets]
[Policies]
[Resources]
[Staff]
Welcome to the course page for CSPC365 in Spring 2022
Instructor: Dr. Andre Wibisono
Times: Tu/Th 2:30-3:45pm
Classroom: David Auditorium
Announcements
- Apr 25: In-class exam on Apr 28 Thur at 2:30pm
- Apr 25: Review sessions for the midterm - Check the location and time info below
Course Content
Textbook: Algorithm Design written by Jon Kleinberg and Éva Tardos
- Class 1, Tue Jan 25: Introduction
- Class 2, Thur Jan 27: Review on Asymptotics and Graphs
- Review 0, Fri Jan 28 @ 3:00pm: Review on Logic, Proofs, Math
- Class 3, Tue Feb 1: Stable Matching Problem
- Class 4, Thur Feb 3: Graph explorations
- Class 5, Tue Feb 8: Depth First-search
- Class 6, Thur Feb 10: Breath-First Search, Shortest path in weighted graph: Dijkstra’s algorithm
- Discussion 2, Fri Feb 11:
- Class 7, Tue Feb 15: Proof of Correcteness Dijkstra’s algorithm, Implementation
- Class 8, Thur Feb 17: Minimal Spanning Tree
- Discussion 3, Fri Feb 18:
- Class 9, Tue Feb 22: Divide-and-Conquer 1: Integer Multiplication
- Class 10, Tur Feb 24: Divide-and-Conquer 2: Mergesort, Master Theorem
- Discussion 4, Fri Feb 25:
- Class 11, Tue Mar 1: Dynamic Programming 1: Fibonacci, Shortest paths
- Special Review Session, Tue Mar 1 @ 4:30 -5:30 pm:
- Class 12, Thur Mar 3: Dynamic Programming 2: Knapsack, longest increasing subsequence
- Class 13, Tue Mar 8: DP 3: Floyd-Warshall, longest increasing subsequence
- In-class Midterm Exam1, Thu Mar 10:
- David Auditorium @ 2:30-3:45
- One page (single-sided) of handwritten cheatsheet allowed
- Class 15, Tue Mar 15: Network Flow 1: Max Flow, Min Cut, Ford-Fulkerson
- Class 16, Thur Mar 17: Network Flow 2: Ford-Fulkerson Analysis: Running Time, Correctness
- Class 17, Tue Mar 29: Max-flow/min-cut; proof of correctness of FF
- Class 18, Thur Mar 30: Bipartite matching, applications
- Class 19, Tue Apr 5: Complexity 1: Reductions, SAT, 3-SAT, NP
- Class 20, Thur Apr 7: Complexity 2: Examples
- Class 21, Tue Apr 12: Complexity 3: NP, SAT, 3-SAT
- Class 22, Thur Apr 14: Complexity 4: 2-SAT, examples
- Discussion 8, Fri Apr 15:
- Class 23, Tue Apr 19: Complexity 5:
- Class 24, Tue Apr 21: Complexity 6:
- Discussion 9, Fri Apr 22:
- Class 25, Tue Apr 26: Review:
- Review Session:
- Michal (ULA): Apr 25 Mon @ 6pm in ML104
- John (TF): Apr 26 Tue @ 4:30 pm in HLH17 05
- Michal (ULA): Apr 27 Wed @ 6pm in BCT CO31
- Alden (ULA): Apr 27 Wed @ 7pm in ML221
- In-class Midterm Exam2, Thu Apr 28:
- David Auditorium @ 2:30-3:45
- One page (doubled-sided) of handwritten cheatsheet allowed