DISCRETE STRUCTURES
DISCRETE STRUCTURES
2016 Spring Term
Computer Science 215
The course offers a formal approach to the logic of Computer Science, including set theory, methods of proof, discrete probability, sequences, recurrence relations, introduction to graphs, and algorithmic analysis. It also introduces finite state machines, Turing machines, and formal languages and grammars.
Other Requirements: PREREQ: MATH 152 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 2161
3 Units
|
01/19 - 05/17 (1) | MW 11:00 AM - 12:15 PM |
Lopamudra Mukherjee
|
||