Computer Science
Based on all available term-level grade data for this course
Ranked highest to lowest GPA — using A, B, C, D, and F outcomes only
Compare a professor, browse nearby courses, or ask Sparky.
Top GPA signal with 191 grades.
Get a quick summary of difficulty, fit, and professor picks.
Discrete mathematics concepts fundamental to computing: propositional logic, predicates and quantifiers; proofs; sets; recursive definitions and induction; functions, relations and graphs; combinatorics and discrete probability; applications. Course Information: 3 hours. Credit is not given for CS 151 if the student has credit in MCS 361 . Prerequisite(s): Grade of C or better in CS 111 or Grade of C or better in CS 112 or Grade of C or better in CS 113 or Grade of C or better in CS 107 or Grade of C or better in CS 109 or Grade of C or better in MCS 160 ; and Credit or concurrent registration in MATH 180 ; or appropriate score on the department placement test Note that a grade of C in MCS 260 (the prior course number for ) is also considered a valid prerequisite replacement for . Class Schedule Information: To be properly registered, students must enroll in one Lecture and one Discussion.
