Introduction To Computation Semester: Spring Year: 2014 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. Prq:MATH132&Cmp187orECE242w/C STUDENTS WHO HAVE COMPLETED CMPSCI 187 OR EQUIVALENT WITH A GRADE OF `C? OR BETTER AND HAVE A CO-REQUISITE OF MATH 132 MAY REQUEST OVERRIDE (IF SEATS AVAILABLE). 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.cs.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 #: 53721 Course Sections Year - Any -2018201720162015201420132012 Term - Any -FallSpring Subject Course Number Institution - Any -Amherst CollegeHampshire CollegeMount Holyoke CollegeSmith CollegeUMass Amherst Section Number Introduction To Computation Sect # Credits Instructor(s) Instructor Email Meeting Times Location 01 4.0 David Barrington M W F 1:25PM 2:15PM