Design and Analysis of Algorithms

CS 130B - Winter 2023


[ Home | Lectures ]

COURSE INFO


CLASS TIMES: Tu+Th 5-6:15pm in LSB 1001


INSTRUCTOR:   Eric Vigoda,
TAs:   Michael Kuhn, Kevin Lai, Zach Miller, Lucas Nguyen, Andrew Peng, Yuval Steinhart, Sharath Vemula
Office hours: (Check Ed Discussion)


TEXTBOOK: (required) Algorithms by Dasgupta, Papadimitriou, and Vazirani [DPV]
(Available at UCSB Bookstore or via Amazon)
(Note, exercise/section numbers may differ in unofficial online versions.)

Other good references:
Algorithms by Jeff Erickson
Algorithms Unlimited by Roughgarden
Algorithm Design by Kleinberg and Tardos
Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein
(Some of these books are available online from the library)


TOPICS COVERED:
  • Dynamic programming
  • RSA public-key cryptosystem
  • Divide-and-conquer strategies including FFT
  • Linear programming
  • NP-completeness

    • GRADING SCHEME:
    1. Homeworks: 10%
    2. Daily quizzes: 15%
    3. In-class checks: 5%
    4. 2 midterm exams: 40% (equally weighted)
    5. Final exam: 30% (see UCSB final exam schedule)
      (The final will be cumulative but focused on NP-completeness.)


    In-class checks: On Thursdays, there will often be an in-class mini-quiz. This will be short and low stress. You can think of this as a bonus for attending class.
    DAILY QUIZ: Following every class there will be a short quiz posted on Gradescope. It is due by 11:59pm the following day.
    EXAMS: 2 midterm exams plus a final exam, see the lecture schedule for tentative dates.
    No books, no notes, no calculators. We will provide scrap paper.


    DSP: If you have special accommodations for testing or homeworks then you should discuss it with me during the first week of classes.

    Exam Absences: If you have an institute approved absence around an exam date then notify the instructor at least 10 days in advance and email me a copy of the institute approved absence from the Dean of Students. If you are sick for an exam then you need to submit documentation to the Dean of Students and then email the instructor an excused absence letter from the Dean of Students (we cannot be privy to any medical information).

    Cheating:
    Any evidence of cheating or plagarism on homeworks or exams will be immediately reported to the Office of Student Conduct.
    You will be given a zero on that aspect (total homework grade for the course or that exam) AND your overall course grade will be lowered by one letter.
    There are typically multiple versions of the exam so it is easy to identify students who copy from other students.

    HOMEWORK POLICIES:
     Submissions:
    Homeworks are submitted via Gradescope.
    No late homeworks will be accepted since we will often discuss the solutions during
    class and solution sets will be posted to Canvas after the homeworks are collected.

    Collaboration:
    Homework solutions must be in your own words.
    It is probably best to try the homework on your own first. For the challenging problems, it might be useful to work together with other students. However, you should redo the solution from scratch by yourself, and write it up in your own words.
    List at the top of your homework who you collaborated with and any outside sources you consulted (including any solution sets you might have found on the web).
    Note homeworks are not worth much, the point of homeworks is to practice and learn the material so copying the solutions does not serve much purpose.
    We will typically do a fast grading of the homeworks and only of a subset of the problems, so you should double-check the solutions yourself.