Computer Science 250 - Introduction To Computation
Spring
2024
01
4.00
David Barrington,Mordecai Golin
M W F 1:25PM 2:15PM
UMass Amherst
11831
Thompson Hall room 102
barring@cs.umass.edu
mgolin@umass.edu
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 Computer Science, Math, and Computer Systems Engineering (CSENG) majors only. CS187/ECE241/CICS160&MATH132wC STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDE VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.