Computer Science 250 - Introduction To Computation
Fall
2023
99BE
W 4:00PM 4:50PM
UMass Amherst
83780
Flint Laboratory room 105
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. CS187/ECE241/CICS160&MATH132wC
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.