Discrete Computational Structures

CT Score

1500

#0 of 0 in MATH

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

(Minimum of C- in COMS 2270 and MATH 1650) and ENGL 1500Concepts in discrete mathematics as applied to computer science. Logic, set theory, functions, relations, cardinality of sets, combinatorics and graph theory. Proof techniques, induction and recursion. State machines and invariants. (Typically Offered: Fall, Spring, Summer)→MATH 2300→unlocks 2 courses

2 mapped courses list MATH 2300 as a prerequisite. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.