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
-
6.7 / 10
- Organization
-
1.7 / 10
- Time
-
0-5 hrs/week
- Overall
-
3.3 / 10
Reviews
proofs based class that goes over counting and graph theory
This class started out easy and the first midterm was super easy. Things started to pick up after that for sure and the next exams were significantly harder. I think discrete math comes naturally to some people and it doesn't to others, so it might require practice. I honestly didn't put much time into this class, but I think if you do, it is a good class. The professor is nice and he also gives four grading schemes. The homeworks were graded very leniently and he drops the lowest three, so they are definitely worth doing.
Difficulty of finals and midterms wildly varied
The first midterm was very easy but the second midterm and final were harder.
Displaying all 4 reviews
Course
Grading Information
-
No group projects
-
Attendance not required
-
2 midterms
-
Finals week final
-
50% recommend the textbook
Previous Grades
Grade distributions not available.