CS 210 Discrete Structures I* (3 Hours)
Upon successful completion of this course, the student should be able to use fundamental discrete mathematics as it relates to computers and computer applications. The student will be exposed to a variety of discrete mathematical topics. The course will include fundamental mathematical principles, combinatorial analysis, mathematical reasoning, graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk.
...4 CS 210 Discrete Structures I* 3 CS 211 Discrete Structures II* 3 CS 235...