WGU 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.
Fennie is independent and not affiliated with Western Governors University. This is an unofficial study guide.
What makes it hard
Counting problems (permutations vs. combinations, with and without constraints) are the notorious sticking point. They look simple and aren't. Students also underestimate the graph theory and recurrence material; like C959, this course fails people who read instead of solving.
What you'll cover
- • Counting, permutations, and combinations
- • Discrete probability
- • Graph theory
- • Trees and traversals
- • Recursion and recurrence relations
- • Algorithm complexity basics
The C960 study guide
How to study for WGU C960, step by step.
- 1
Take the pre-assessment first
Coming off C959 you'll have some carryover, but the PA shows how much. Counting and probability are usually the units that need the most new work.
- 2
Over-invest in the counting unit
Permutations vs. combinations, with and without repetition, with and without constraints: work these until you can justify every setup. This is the unit that fails people.
- 3
Solve graph and tree problems, not just definitions
Know the properties (degrees, paths, spanning trees, traversal orders) and practice applying them. The OA asks you to use graph theory, not recite it.
- 4
Practice recurrences and probability setups
Work recurrence relations and discrete probability problems by hand daily. Like C959, this course fails readers and passes solvers.
- 5
Retake the PA, then book the OA
When the pre-assessment passes comfortably, especially its counting questions, schedule the proctored exam within the week.
Today
Today's C960 plan
What a Fennie Daily Plan looks like for C960. Yours is built from your own syllabus and adapts every day to your deadlines and progress.
First plan free, no card required. Fennie is independent and unaffiliated with your school.
FAQ
Is WGU C960 harder than C959?
Opinions split, but many students find C960's counting and probability sections harder than C959's logic. Both demand consistent problem practice rather than reading.
How long does C960 take?
Typically 4-8 weeks, similar to C959. Budget extra time for the counting unit; it's the most common OA pain point.
What should I focus on for the C960 OA?
Combinatorics setups, discrete probability, and graph/tree properties. If you can reliably decide when order matters and when repetition is allowed in counting problems, you're most of the way there.
More WGU courses
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.
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.