CS 1134 creditsPrereq: (MAT 103 or MAT 103A) or (MAT 104 or MAT 104A) or MAT 130 with minimum grade C, or Math Placement Exam Score of 40 or 50
CS 113: Mathematical Structures for Computer Science
No student reviews yet
Planning Spring 2027? Save classes to your plan.
No ratings yet
We don't have ratings, grades or reviews for CS 113 yet.
Below: what the catalog says, the CS classes numbered next to it and how Computer Science classes rate at Pace.
Yours would be the first. About two minutes, anonymous.
Took CS 113? How hard was it?
1 is easy, 5 is hard. Anonymous, no account.
Difficulty
What we know
- From the catalog
- Covers proof techniques, mathematical logic, set theory, discrete probability, graph theory, and combinatorics. Topics include Boolean algebra, propositional and predicate logic, functions, relations, conditional probability, weighted graphs, and counting principles.
- Credits
- 4
- Department
- Computer Science
Classes next to CS 113
CS courses at Pace with the closest numbers
- CS 113Mathematical Structures for Computer ScienceThis class
- CS 121Introduction to Computer ScienceNo ratings yet
- CS 122Object-Oriented ProgrammingNo ratings yet
- CS 232Computer OrganizationNo ratings yet
- CS 271Fundamentals of UNIX and C ProgrammingNo ratings yet
- CS 312Research Methods in Computers and SocietyNo ratings yet
- CS 327Introduction to Neural NetworksNo ratings yet
How Computer Science classes rate at Pace
0–100 scores from ratings across the web
Highest rated
Most challenging
What students say
Be the first to review CS 113
Six short steps, about two minutes. Anonymous, no account, no email.