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: CS106B or equivalent. CS106B may be taken concurrently with
CS103.
Terms: Aut, Win, Spr
| Units: 3-5
| UG Reqs: GER:DB-Math, WAY-FR
Instructors:
Lee, C. (PI)
;
Schwarz, K. (PI)
;
Agu, C. (TA)
;
Amdur, G. (TA)
;
Dasu, G. (TA)
;
Fosli, I. (TA)
;
Gulshen, K. (TA)
;
Guo, N. (TA)
;
Hernandez, D. (TA)
;
Liu, A. (TA)
;
Mistele, M. (TA)
;
Murphy, D. (TA)
;
Ostrow, R. (TA)
;
Rottman-Yang, S. (TA)
;
SHAO, L. (TA)
;
Salgado, F. (TA)
;
Seshadri, S. (TA)
;
Suarez Robles, I. (TA)
;
Valdivia, H. (TA)
;
Wang, K. (TA)
;
Wang, Y. (TA)
;
Xu, K. (TA)
Filter Results: