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

SectionDays & timeLocationInstructor
01Class #10263Tu Th · 11:00 AM – 12:15 PMAdv Technology & Science Hall 232Kwang B Lee

Fall 2026 · 2 sections

Aug 24 – Dec 12

SectionDays & timeLocationInstructor
01Class #31423UGRDMo We Fr · 9:00 – 9:50 AMAdv Technology &ampScience Hall 230Seetan, Raed
02Class #31424UGRDMo We Fr · 10:00 – 10:50 AMAdv Technology &ampScience Hall 230Seetan, Raed