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
-
10.0 / 10
- Organization
-
10.0 / 10
- Time
-
5-10 hrs/week
- Overall
-
10.0 / 10
Reviews
Professor Ramsey is super cool! I had a great time in his class, he makes lectures engaging and fun to attend :) The tests and homework are very reasonable as well, nothing too difficult.
Professor Ramsey is great. Great lectures and funny guy. One of the best classes I've ever taken.
Ramsey is a very clear professor who makes the concepts very clear and easy to digest. But don't let that fool you into thinking the exams are easy. They're proofs which are doable even with no previous skill writing proofs, but definitely do have a strong, foundational understanding of the concepts presented.
Displaying all 3 reviews
Course
Grading Information
-
No group projects
-
Attendance not required
-
1 midterm
-
Finals week final
-
33% recommend the textbook
Previous Grades
Grade distributions not available.