DISCRETE STRUCTURES
DISCRETE STRUCTURES
2019 Fall Term
3 Units
Computer Science 215
The course offers a formal approach to the mathematics of Computer Science, including set theory, methods of proof, propositional logic, discrete probability, sequences, recurrence relations, introduction to graphs, and algorithmic analysis.
Other Requirements: PREREQ: MATH 150 WITH A GRADE OF C OR BETTER, OR MATH 152 WITH A GRADE OF C OR BETTER, OR MATH 243, OR MATH 250
Class Schedule
Disclaimer
- This schedule is informational and does not guarantee availability for registration.
- Sections may be full or not open for registration. Please use WINS if you wish to register for a course.
| Section Details | Meeting Details & Topic | Instructor | Syllabus | ||
|---|---|---|---|---|---|
|
01-LEC 4186
3 Units
|
09/03 - 12/13 (1) | MW 9:30 AM - 10:45 AM |
Zachary Oster
|
||
|
|||||
