CS 502

Theoretical Foundations of Computer Science

Monmouth University · UGRD · Fall 2026

1 section
Add to a schedule

Catalog description

Concepts, methods, models, and associated computer exercises for important topics in discrete mathematics and probability. Includes: logic and mathematical reasoning, functions, sets, summations, asymptotic notation, algorithms and complexity, number theory, cryptography, matrix algebra, induction and recursion, counting techniques, combinatorial objects, discrete structures, discrete probability theory, relations, graph theory, moments, random variables, and graph algorithms. Limited to Computer Science majors.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 7 hours ago

001

Availability not recently verified
Class #monmouth_2-CS502Fall 2026UGRD3 credits
Days & times
No scheduled meeting time
Meeting dates
Location
Instructor
Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?