Computer Science 250 - Introduction To Computation
Spring
2022
01AC
F 11:15AM 12:05PM
UMass Amherst
27854
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 Computer Science and Computer Systems Engineering majors only. COMPSCI 187/ECE241&MATH132 w/c
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.