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.

Prerequisites: CSIS 210

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