Computer Science 250 - Introduction To Computation
Fall
2018
02AB
0.00
W 11:15AM 12:05PM
UMass Amherst
82614
Marston Hall room 211
Lecture, discussion. 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. Problem sets, 2 midterm exams, timed final.
Open to Computer Science and Math majors only. MATH 132 or COMPSCI 187 w/ C
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.