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
-
0-5 hrs/week
- Overall
-
8.3 / 10
Reviews
I thought the lectures were decently clear. The only issue for me was that the homework did not correspond very well with the exam questions.
He's a little harsh when grading proofs, but he does a great job at teaching this course. Some concepts can be hard to grasp, so definitely go to his or the TA's office hours.
Displaying all 2 reviews
Course
Grading Information
-
No group projects
-
Attendance not required
-
2 midterms
-
Finals week final
-
100% recommend the textbook
Previous Grades
Grade distributions not available.