2022 Fall
COMPSCI 70 001 - LEC 001
Discrete Mathematics and Probability Theory
Satish B Rao, Babak Ayazifar
Class #:27632
Units: 4
Instruction Mode:
In-Person Instruction
Time Conflict Enrollment Allowed
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
50
Enrolled: 812
Waitlisted: 0
Capacity: 862
Waitlist Max: 500
No Reserved Seats
Hours & Workload
3 hours of instructor presentation of course materials per week, 9 hours of outside work hours per week, and 2 hours of the exchange of opinions or questions on course material per week.
Final Exam
TUE, DECEMBER 13TH
03:00 pm - 06:00 pm
Haas Faculty Wing F295
Hearst Field Annex A1
Bechtel 210
Li Ka Shing 245
Lewis 100
Hearst Mining 390
North Gate 105
Other classes by Babak Ayazifar
Course Catalog Description
Logic, infinity, and induction; applications include undecidability and stable marriage problem. Modular arithmetic and GCDs; applications include primality testing and cryptography. Polynomials; examples include error correcting codes and interpolation. Probability including sample spaces, independence, random variables, law of large numbers; examples include load balancing, existence arguments, Bayesian inference.
Class Notes
* Time conflicts are allowed BUT no alternate final exam will be offered. Be sure you do not have a conflict with final exam if you enroll with a time conflict in CS 70!
Rules & Requirements
Requisites
- All Undergraduate Students including Visitors
Credit Restrictions
Students will receive no credit for Computer Science 70 after taking Mathematics 55.
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials