Computer Science 250 - Introduction To Computation
Spring
2020
02
4.00
David Barrington
M W F 10:10AM 11:00AM
UMass Amherst
41503
Morrill Sci. Ctr. (II) rm 131
barring@cs.umass.edu
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 COMPSCI and Math majors only. MATH 132 or COMPSCI 187 w/ C STUDENTS ARE ADVISED NOT TO TAKE 240 AND 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. OPEN TO CSENG MAJORS WITH ECE 241 (OR ECE 242) WITH C OR BETTER, IF AVAILABLE SEATS. 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.
https://spire.umass.edu
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.