2000

Prerequisite: C or better in CSCI 1302. Students strengthened in the knowledge of object oriented languages and the concepts of object oriented design of algorithms. The central issues of data hiding, encapsulation and polymorphism are emphasized throughout the course. This course is non-repeatable.

Prerequisites: C or better in MATH 1113 and CSCI 1302. This course offers an intensive introduction to discrete mathematics as it is used in computer science. Topics include functions, relations, sets, propositional and predicate logic, simple circuit logic, proof techniques, elementary combinatorics, and discrete probability. This course is non-repeatable.