Five College Consortium

Introduction To Computation

Semester: 
Fall
Year: 
2016
Subject Name: 
Computer Science
Course Number: 
250
Institution: 
UMass Amherst
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.
Comments: 
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. STUDENTS WHO HAVE COMPLETED MATH 131 AND COMPSCI 187 OR EQUIVALENT AND HAVE A CO-REQUISITE OF MATH 132 MAY REQUEST OVERRIDE (PERMISSION MAY BE GRANTED IF BETTER THEN AVERAGE GRADES AND 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.
Linked Course: 
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.
Instructor Permission: 
Permission is required for interchange registration during all registration periods.
Schedule #: 
79348

Course Sections

Introduction To Computation
Sect # Credits Instructor(s) Instructor Email Meeting Times Location
01 4.0 Neil Immerman M W F 1:25PM 2:15PM