WGU C959: Discrete Mathematics I
C959 introduces logic, set theory, functions, relations, and proof techniques — the math backbone of WGU's computer science degree. It ends in an OA and is widely treated as the first real difficulty checkpoint in the BSCS.
Fennie is independent and not affiliated with Western Governors University. This is an unofficial study guide.
Build my C959 study planWhat makes it hard
This is most students' first contact with formal logic and proofs, and the zyBooks material is dense. r/WGU consistently ranks the discrete math pair among the program's hardest courses; people who try to speed-run it without working the participation problems fail the OA on logic equivalences and proof structure.
What you'll cover
- • Propositional and predicate logic
- • Set theory
- • Functions and relations
- • Proof techniques (direct, contrapositive, induction)
- • Boolean algebra
- • Counting basics
The C959 study guide
How to study for WGU C959, step by step.
- 1
Take the pre-assessment to set expectations
For most students the first PA attempt is humbling — that's the point. It shows whether logic, sets, or proofs is your biggest gap before you commit weeks to the wrong unit.
- 2
Work every zyBooks participation problem
Reading discrete math doesn't teach discrete math. The students who fail the OA are the ones who skipped the embedded problems to read faster.
- 3
Drill logic equivalences until they're automatic
De Morgan's laws, implications and contrapositives, quantifier negation — the OA assumes you can manipulate these without thinking. Short daily reps get them there.
- 4
Write proofs out by hand
Practice direct, contrapositive, and induction proofs on paper from a blank page. Recognizing a correct proof and producing one are different skills, and the OA tests the second.
- 5
Retake the PA under exam conditions
Time yourself. Passing comfortably under time pressure — not just eventually getting answers — is the signal to schedule the OA.
- 6
Put the weeks of practice on rails with Fennie
Upload the C959 unit list to Fennie and Daily Plans breaks it into the small daily problem sessions this course demands, paced to your OA date with quizzes on the logic rules. Free to start.
Start my C959 plan free
How Fennie helps with C959
Fennie's Daily Plans break C959 into small daily problem sessions, which matters more here than anywhere — discrete math rewards repetition over marathons. Chat through proof steps you can't follow in the course text, and quiz yourself on logic equivalences until they're automatic.
FAQ
Is WGU C959 hard?
Yes — discrete math is the most common difficulty wall in the WGU computer science program. It's learnable, but it punishes cramming; daily problem practice over several weeks is the reliable path.
How long does C959 take?
Plan on 4–8 weeks if the material is new to you. Students with prior discrete math or strong logic backgrounds finish faster, but few one-week it.
How do I pass the C959 OA?
Work every practice problem in the course material, not just the readings — the OA tests problem-solving, not recognition. Use the pre-assessment to verify you can actually execute proofs and logic manipulations under time.
Pass C959 with a plan, not a cram
Upload your C959 materials and Fennie generates a Daily Plan paced to your deadline — plus chat, flashcards, and quizzes built from the actual course content.
Get started freeMore WGU courses
C960 — Discrete Mathematics II
C960 continues from C959 into counting, probability, graph theory, trees, recursion, and algorithm analysis concepts. It ends in an OA and rounds out the discrete math requirement for the BSCS.
C949 — Data Structures and Algorithms I
C949 covers core data structures — arrays, lists, stacks, queues, trees, hash tables — plus searching, sorting, and Big-O analysis, with examples in Python. It ends in an OA and is a pillar course in WGU's computer science and software degrees.
C950 — Data Structures and Algorithms II
C950 is the project course that follows C949: you build the well-known WGUPS package-routing program in Python, applying hash tables and a routing heuristic to deliver packages under constraints. It's assessed as a performance assessment (PA) — code plus a written analysis — not an exam.
C952 — Computer Architecture
C952 covers how computers actually work: data representation, CPU datapaths, pipelining, memory hierarchy and caches, and a look at parallelism. It's a BSCS requirement built around a famously dense textbook (Patterson and Hennessy) and ends in an OA.