Computer Science 250 - Introduction To Computation
Spring
2018
01
4.00
David Barrington
M W F 1:25PM 2:15PM
UMass Amherst
55412
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. MATH132&COMPSC187orECE242w/ C STUDENTS ARE ADVISED NOT TO TAKE 240/250 IN THE SAME SEMESTER. DUE TO ENROLLMENT PRESSURE, THE UPC RESERVES THE RIGHT TO DROP STUDENTS ENROLLED IN BOTH FROM EITHER COURSE WHEN NECESSARY. CS MINORS, APPLICANTS-ON-CONTRACT, AND OTHERS NOT MEETING ELIGIBILITY, OR STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.