Computer Science 250 - Introduction To Computation

Fall
2025
02AC

W 1:25PM 2:15PM

UMass Amherst
61606
Marston Hall room 220
Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem.

Open to COMPSCI and Math majors only. CICS160,210,CS187ECE&MATH132wC

Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.
Permission is required for interchange registration during the add/drop period only.
Link to Campus Courses
Back to the Five College Course Schedule