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
6.7 / 10
Time
10-15 hrs/week
Overall
6.7 / 10

Enrollment Progress

Enrollment data not available.

Reviews

    Quarter Taken: Winter 2018 In-Person
    Grade: A

    In the first lecture, Prof. Das introduces himself as a pure mathematician. Unfortunately, mathematical purity is exactly how he approached teaching this class, despite the fact that the class is most notably meant as a preparation for computer science algorithm classes. Embarrassingly, he even spelled Dijkstra's algorithm (one of the most famous algorithms in computer science) wrong, which suggests a degree of unfamiliarity with the course material.

    In terms of the course itself, learning it well will make COM SCI 180 (the algorithms class) much easier to understand, as the CS professor tends to assume you already have an understanding of mathematical notations introduced in MATH 61.

Course

Instructor
Omprokash Das
Previously taught
18Su 18W

Grading Information

  • No group projects

  • Attendance not required

  • 2 midterms

  • Finals week final

  • 100% recommend the textbook

Previous Grades

Grade distributions not available.