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
8.3 / 10
Organization
10.0 / 10
Time
5-10 hrs/week
Overall
8.3 / 10

Reviews

    Quarter Taken: Winter 2023 In-Person
    Grade: A

    Do was a great prof. Lectures were not necessary to attend as he would post his lecture notes. Gave 43% of people As during this quarter.

    Quarter Taken: Winter 2023 In-Person
    Grade: A

    The professor was decent but the class was poorly run.

    Quarter Taken: Winter 2023 In-Person
    Grade: A

    I really enjoyed this class and Prof. Do's teaching. I believe he was very clear in his lectures and was able to elaborate behind both formula and why those formula worked.

    Quarter Taken: Spring 2023 In-Person
    Grade: A-

    Grades pretty generously and is very understanding!! Material was not too difficult

    Quarter Taken: Spring 2023 In-Person
    Grade: B

    Fair tests and a decent lecturer. Could benefit from more in class examples, but discussions help with that. For tests, make sure to study quizzes and homework.

    Quarter Taken: Spring 2023 In-Person
    Grade: A

    Good lecturer, reasonable tests & homework

Course

Instructor
Kim Tuan Do
Previously taught
24S 23S 23W

Grading Information

  • No group projects

  • Attendance not required

  • 2 midterms

  • Finals week final

  • 67% recommend the textbook

Previous Grades

Grade distributions not available.