Computer Science 250 - Introduction To Computation
Fall
2021
01
4.00
David Barrington
M W F 1:25PM 2:15PM
UMass Amherst
12481
Goessmann Laboratory room 20
barring@cs.umass.edu
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.
Open to Computer Science, Math, and CS Engineering majors only. COMPSCI 187/ECE241&MATH132 w/c STUDENTS MAY ONLY TAKE ONE OF 240 AND 250 IN THE SAME SEMESTER. THE UPC WILL DROP STUDENTS ENROLLED IN BOTH FROM ONE OF THE TWO COURSES. 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.
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.