## 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

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 the add/drop period only.

Schedule #:

53799

## Course Sections

Sect # |
Credits | Instructor(s) | Instructor Email | Meeting Times | Location |
---|---|---|---|---|---|

01AD | 0.0 | M 3:35PM 4:25PM |