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
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.
The professor was decent but the class was poorly run.
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.
Grades pretty generously and is very understanding!! Material was not too difficult
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.
Good lecturer, reasonable tests & homework
Displaying all 6 reviews
Course
Grading Information
-
No group projects
-
Attendance not required
-
2 midterms
-
Finals week final
-
67% recommend the textbook
Previous Grades
Grade distributions not available.