Introduction to Discrete Structures

Lecture, three hours; discussion, one hour. Requisites: courses 31A, 31B. Not open for credit to students with credit for course 180 or 184. Discrete structures commonly used in computer science and mathematics, including sets and relations, permutations and combinations, graphs and trees, induction. P/NP or letter grading.

Review Summary

Clarity
6.7 / 10
Organization
6.7 / 10
Time
5-10 hrs/week
Overall
8.3 / 10

Reviews

    Quarter Taken: Fall 2023 In-Person
    Grade: A

    The content of the class is very interesting and Gleizer's lectures are okay. The homework is manageable and translate fairly well to the midterms, but take some time and thought.

    Quarter Taken: Fall 2023 In-Person
    Grade: N/A

    Most of Oleg's lectures are based on his lecture notes. He would release them after lecture, but he later started posting them before lecture. He will solve some of the problems on the lecture notes during lecture as examples. Whatever he couldn't cover based on time would be assigned as homework.
    At the start of the quarter, he also asks whether we wanted a standard or curved learning scale.

Course

Instructor
Oleg Gleizer
Previously taught
24F 23F

Grading Information

  • No group projects

  • Attendance not required

  • 2 midterms

  • Finals week final

  • 0% recommend the textbook

Previous Grades

Grade distributions not available.