CSIS 305 - Discrete Structures

Discrete Structures, core to many areas of computer science, involves concepts and objects divisible into separate parts. Topics investigated in this course include: time-complexity, random-number generation, hashing, public-key cryptography, applications of matrix operations, recursively defined functions and solving recurrence equations to analyze running time, permutations, combinations, probability, graphs, trees, finite-state machines, logic, and Boolean algebra.

Credits: 4

Clock Hours - (Lect-Lab): (4-0)

Prerequisites: CSIS 210 (minimum grade of C-)

Notes:
Computer Science Information Systems (CSIS) courses were required for the following programs: Computer Science Information Systems: Computer Science Option, Computer Science Information Systems: Information Systems Option, Computer Science Information Systems minor and the Business Administration: Information Management option. These programs will no longer be offered with the 2011-12 catalog. Students in subsequent catalogs may continue to take CSIS courses as they are offered as long as the student meets all of the prerequisites.