Computer Science 250 - Introduction To Computation

Spring
2014
01AB
0.00
M 3:35PM 4:25PM
UMass Amherst
53768
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
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.
Permission is required for interchange registration during the add/drop period only.