Print Settings
 

CS 103: Mathematical Foundations of Computing

Mathematical foundations required for computer science, including propositional predicate logic, induction, sets, functions, and relations. Formal language theory, including regular expressions, grammars, finite automata, Turing machines, and NP-completeness. Mathematical rigor, proof techniques, and applications. Prerequisite: 106A or equivalent.
Terms: Aut, Win, Sum | Units: 3-5 | UG Reqs: GER:DB-Math, WAY-FR
Instructors: ; McKay, D. (PI); Schwarz, K. (PI); Ahmed, D. (TA); Burton, E. (TA); Chang, K. (TA); Choi, S. (TA); Desai, S. (TA); Fisch, B. (TA); Gibbons, K. (TA); Griswold, K. (TA); Hata, K. (TA); Huang, B. (TA); Huang, Y. (TA); Jeje, K. (TA); Jung, Q. (TA); Kaymaz, C. (TA); Konda, D. (TA); Largman, R. (TA); Lee, C. (TA); Li, Y. (TA); Louie, J. (TA); McCann, B. (TA); Naik, J. (TA); No, A. (TA); Raghuvanshi, A. (TA); Rajan, S. (TA); Sax, S. (TA); Tang, R. (TA); Valdes, S. (TA); Yang, A. (TA)
© Stanford University | Terms of Use | Copyright Complaints