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
-
0.0 / 10
- Time
-
0-5 hrs/week
- Overall
-
8.3 / 10
Reviews
Didn’t love the material but class was easy enough as long as you attend lectures and pay attention.
Professor was great and super nice. First midterm was fair but kinda hard, second one was super easy, and the final was super hard. I recommend reading the textbook and reviewing all of the examples from the textbook. I also recommend going to discussion section. Overall, the content of the class was pretty interesting.
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.