CPSC 311Discrete Computational Structures
Slippery Rock University of Pennsylvania · 3 credits

Catalog
Introduces discrete mathematics with an emphasis on applications in computer science including logic, mathematical reasoning, proof techniques, sets, relations, functions, sequences, recursion, boolean algebra, counting, graphs, and trees. Also introduces computational complexity of algorithms. The course will stress traditional programming and mathematical approaches to these structures such as the use of recursion, elementary data structure, and proof techniques to instantiate, parse, traverse, demonstrate correctness, or use these computational objects.
Recent sections
Spring 2027 · 1 section
Jan 19 – May 8
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 01Class #10263 | Tu Th · 11:00 AM – 12:15 PM | Adv Technology & Science Hall 232 | Kwang B Lee |
Fall 2026 · 2 sections
Aug 24 – Dec 12
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 01Class #31423UGRD | Mo We Fr · 9:00 – 9:50 AM | Adv Technology &Science Hall 230 | Seetan, Raed |
| 02Class #31424UGRD | Mo We Fr · 10:00 – 10:50 AM | Adv Technology &Science Hall 230 | Seetan, Raed |