Design and Analysis of Algorithms

CS 130B - Spring 2026


[ Home | Lectures ]

TENTATIVE LECTURE SCHEDULE


Extra resources:
  • Videos from Vigoda's Georgia Tech MOOC: https://edstem.org/us/join/b75ghf (Videos available via Ed; follow above link to join/access videos.)

    • Tentative schedule (exam dates may change):

    Dynamic Programming:
    Monday, March 30:
  • Fibonacci numbers
  • Longest increasing subsequences (LIS)
    • Reading: [DPV] Chapter 6.2-6.3
    Lecture video: DP1

    Wednesday, April 1:
  • Longest Common Subsequence (LCS) and Practice problem [DPV] 6.1
    • Reading: [DPV] Chapter 6.2-6.3
    Lecture video: DP1

    Monday, April 6:
  • Knapsack
    • Reading: [DPV] Chapter 6.4
    Lecture video: DP2 first half

    Wednesday, April 8:
  • Chain multiply
    • Reading: [DPV] Chapter 6.5
    Lecture video: DP2 second half

    Monday, April 13:
  • Practice DP

    • Wednesday, April 15:
  • TBD

    • Monday, April 20: Exam 1: Dynamic programming (DP)

    Divide and Conquer, FFT, NP-Completeness:
    Wednesday, April 22:
  • D&C intro, solving recurrences
  • D&C: Fast multiplication
  • D&C: Median
    • Reading: [DPV] Chapter 2.1, 2.2, 2.4

    Monday, April 27 - Wednesday, April 29:
  • FFT (Fast Fourier Transform)
    • Reading: [DPV] Chapter 2.6

    Monday, May 4 - Wednesday, May 6:
  • NP-Completeness

    • Monday, May 11 - Wednesday, May 13:
  • NP-Completeness

    • Monday, May 18:
  • Max-flow

    • Wednesday, May 20: (Week 8) Exam 2 on D&C, FFT, and NP-Completeness

    Monday, May 25: No class (Memorial Day)

    Max-Flow and Linear Programming (LP):
    Wednesday, May 27 - Wednesday, June 3:
  • Max-flow
  • Linear programming

    • Final Exam: Cumulative will cover DP, D&C, FFT, NP-Completeness and Max-flow/LP.
                            Tuesday, June 9, noon - 3pm
    (See UCSB final exam schedule)