CPSC 311 - Discrete Computational Structures

Institution:
Slippery Rock University of Pennsylvania
Subject:
Computer Science
Description:
Introduces computational implementations of the mathematical structures most frequently used in computing including sets, equivalence relations, functions, graphs, trees and standard logic. Also introduces automata, formal languages, countability, decidability and computational complexity, Markov and stochastic processes. 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.
Credits:
3.00
Credit Hours:
Prerequisites:
Corequisites:
Exclusions:
Level:
Instructional Type:
Lecture
Notes:
Additional Information:
Historical Version(s):
Institution Website:
Phone Number:
(724) 738-9000
Regional Accreditation:
Middle States Association of Colleges and Schools
Calendar System:
Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.