Computer Science 250 - Introduction To Computation

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 COMPSCI and Math majors only. CICS160,210,CS187ECE&MATH132wC SEATS ARE BEING SAVED FOR INCOMING TRANSFER STUDENTS UNTIL THE END OF NEW STUDENT ORIENTATION AND TRANSFER (NSOT) ENROLLMENT PERIOD AT THE END OF JULY. REMAINING SEATS WILL BE RELEASED AT THAT TIME. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDE VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.