Computer Science 250 - Introduction To Computation
Spring
2026
99AJ
W 12:20PM 1:10PM
UMass Amherst
84634
Lederle Grad Res Ctr rm A203
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 Computer Science, Math, and Computer Systems Engineering (CSENG) majors only. CICS160,210,CS187ECE&MATH132wC
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.