EO

Elizabeth Orrico

Lecturer
Unit: School of Engineering and Applied Science
Department: Department of Computer Science
Office location and address
85 Engineers Way
Charlottesville, Virginia 22903
CS 2102: Discrete Mathematics
Credits: 3
Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include finite and infinite sets, elementary combinatorial problems, and graph theory. Development of tools and mechanisms for reasoning about discrete problems. Prerequisite: CS 1110, 1111, 1112, 1113, or 1120 with a grade of C- or higher; or the CS 1110 placement test.
CS 2120: Discrete Mathematics and Theory 1
Credits: 3
Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include sets, tuples, functions, relations, and combinatorial problems. Must have completed CS 1110 or CS 1111 or CS 1112 or CS 1113 with a grade of C- or better OR successfully completed the CS 1110 place out test.