Computer Science 250 - Introduction To Computation
Fall
2012
01
4.00
Neil Immerman
M W F 2:30PM 3:20PM
UMass Amherst
73765
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-3 midterm exams, timed final.
Open to Computer Science, Math, and CS Engineering majors only. Prq:MATH132&Cmp187orECE242w/C Students who have completed CMPSCI 187 or equivalent with a grade of 'C' or better and have a co-requisite of MATH 132 may contact the CS Main Office for an override.
CMPSCI Minors, applicants and others not meeting eligibility may contact CS main office for override options.
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.