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
-
6.7 / 10
- Time
-
5-10 hrs/week
- Overall
-
8.3 / 10
Reviews
The content of the class is very interesting and Gleizer's lectures are okay. The homework is manageable and translate fairly well to the midterms, but take some time and thought.
Showing 1 review
Course
Grading Information
-
No group projects
-
Attendance not required
-
2 midterms
-
Finals week final
-
0% recommend the textbook
Previous Grades
Grade distributions not available.