Mathematics provides many powerful insights for current and future fundamental principles of computer science. Learn how to model problems mathematically, reason about them abstractly and then apply techniques to explore their properties. This broad introduction to mathematical applications will prepare you to move forward and solve today’s most important problems within the computer science field.
- Keith Schwarz Lecturer, Computer Science
- Formal language theory such as finite automata, Turing machines and NP-completeness
- Induction, sets, functions and relations
- Proof techniques and applications
- Propositional predicate logic
Note on Course Availability
The course schedule is displayed for planning purposes – courses can be modified, changed, or cancelled. Course availability will be considered finalized on the first day of open enrollment. For quarterly enrollment dates, please refer to our graduate certificate homepage.
3.0 - 5.0
Students enrolling under the non degree option are required to take the course for 5.0 units.
Programming Abstractions (Stanford Course CS106B) or equivalent