Introduction To Computation

Semester: 
Spring
Year: 
2013
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 contact CS Main Office for override. CMPSCI MINORS, applicants and others not meeting Eligibility may contact CS Main Office for Override options

Linked Course: 
Y
Instructor Permission Required: 
N
Schedule #: 
13675

Course Sections

Introduction To Computation
Sect # Credits Instructor(s) Instructor Email Meeting Times Location
D01 0.0

M 2:30PM 3:20PM