WGU C960: Discrete Mathematics II

Where C960 Sits in the BSCS Sequence

WGU C960, Discrete Mathematics II, is a four-competency-unit course that normally lands in term four of the Bachelor of Science, Computer Science plan. WGU's official description sets the scope plainly: abstract, discrete, computational methods for computer science, from searching and sorting algorithms and big-O estimates through number theory, cryptography, recursion, induction, counting, discrete probability, and modeling computation. If you have cleared C959 Discrete Mathematics I, the stated prerequisite, you own the logic and proof machinery; C960 asks you to aim it at real computational problems.

Direct answer: You pass C960 by doing problems, not by reading about problems. Work every practice set by hand until you can produce the modular arithmetic, recurrence, counting, and probability computations from memory, then use the pre-assessment to find your two weakest competencies and drill those before you schedule the exam.

One clarification first, because search results muddle this constantly. WGU also offers D422 Discrete Math: Algorithms and Cryptography, and the names overlap enough to cause real confusion. D422 is not a renamed C960: it is a one-competency-unit course in the cybersecurity and network engineering programs, it covers only the algorithms, big-O, and number-theory-for-cryptography slice, and it sits behind a different prerequisite. Check the code on your own degree plan before building a schedule around either.

C960 also carries more weight than four units suggests, because WGU's prerequisite chain leans on it. Data Structures and Algorithms II lists Data Structures and Algorithms I and Discrete Mathematics II as its two prerequisites, and that is where you evaluate the space and time complexity of self-adjusting data structures using big-O notation. Scraping through C960 tends to cost you two terms later.

The Six Competencies the Exam Is Built Around

C960 is assessed by a single proctored objective assessment. WGU's published program materials list no performance assessment for it, so there is nothing to submit or revise; everything rides on the exam. WGU does publish six competencies, and they are the most reliable map of the exam anywhere. Treat question counts, per-topic percentages, and passing scores circulating on student sites as guesswork, because WGU does not publish them.

• Analyzing linear algorithms and their big-O estimates. Trace searching and sorting procedures by hand, count comparisons, and reason about how the work grows with input size instead of reciting a memorized table.
• Analyzing the use of number theory in cryptography. Divisibility, the division algorithm, greatest common divisors, and modular arithmetic, then how those ideas make encryption and decryption possible.
• Analyzing recursive elements of algorithms using induction principles. Recursive definitions, recurrence relations, and induction as a reasoning tool rather than a proof-writing ritual.
• Solving problems using counting principles. Permutations, combinations, the pigeonhole principle, inclusion-exclusion, and the advanced methods layered on top of them.
• Analyzing problems using discrete probability or Bayesian methods. Finite sample spaces, conditional probability, expected value, and Bayesian updating.
• Determining computational models using finite-state machines. WGU names this one precisely: deterministic and nondeterministic machines. Expect to read a machine and say what it accepts, and to build one for a described language.

Notice what is absent. Set theory, Boolean algebra, matrix operations, series, relations, graphs, and trees are competencies of Discrete Mathematics I, not C960. Older guides promising graph algorithms and shortest-path problems on this exam mixed the two courses up.

How Hard C960 Is, and How to Budget the Time

Start with an honest correction. WGU does not publish an hours-on-content estimate for Discrete Mathematics II. Some catalog courses carry a line saying a learner with no prior knowledge can expect roughly 30 to 40 hours; C960's description carries no such line, so any hour figure attached to this course was borrowed from elsewhere. The BSCS Program Guidebook speaks only at program level: some students devote as little as 15 to 20 hours a week, others considerably more.

So plan by competency rather than by calendar. C960 is hard not because a single topic is impossible, but because six fairly independent competencies each demand their own fluency, and drilling one tends to push another out of your head. Counting especially punishes pattern-matching, since nearly every problem turns on a decision you must make before any formula applies.

The four-week scaffold below is a structure, not a prediction. Students with recent exposure to modular arithmetic and combinatorics move faster; first-timers should plan to repeat a week rather than compress one, because compressing usually means sitting the assessment twice. If you are still working toward the prerequisites, C958 Calculus I comes before C959, and C959 before this course.

A Four-Week Scaffold Built Around Problem Practice

WGU discrete math has commonly been delivered through an interactive textbook with embedded participation and challenge activities. Whatever platform your course of study names, the strategy is identical: the reading is orientation, the problems are the studying.

Week 1: algorithms and number theory. Start with big-O, because it recurs everywhere. Hand-trace a linear search and a binary search on a small array, then a bubble sort and a selection sort, counting the comparisons each performs. Then move into divisibility, gcd, and modular arithmetic, by hand and repeatedly, until reducing a large power modulo n stops feeling like a trick.

Week 2: recursion, induction, and cryptography. Write recursive definitions for sequences you already know, then solve the corresponding recurrence relations. Practise induction as a fill-in-the-structure exercise, with base case, inductive hypothesis, and inductive step every single time, until the skeleton is automatic. Then connect number theory to encryption and decryption, so cryptography becomes an application of week one rather than a separate memorization job.

Week 3: counting and discrete probability. This is where retakes are lost. For every counting problem, say out loud whether order matters and whether repetition is allowed before reaching for a formula. Discrete probability is then counting with a denominator, so study the two together, finishing on conditional probability, expected value, and Bayesian problems.

Week 4: finite-state machines, review, and readiness. Cover deterministic and nondeterministic finite-state machines properly rather than skimming them, then switch to retrieval practice. Take the pre-assessment cold and rebuild whatever it flags from problems. Space the review: revisit week one on day two of week four, not on the last night.

Three habits matter more than any resource choice. Keep a single page of formulas and write it out from memory at the start of each session before checking it. Space your repetition of the facts that decay fastest, such as counting formulas and complexity classes. And practise with a timer and no notes, so the proctored exam is not the first time you have produced answers under pressure. Confirm WGU's current proctoring and calculator policy before exam day.

Mistakes That Sink Otherwise-Prepared Students

• Reading instead of solving. A worked example creates a feeling of understanding that evaporates the moment the numbers change. If your pen is not moving, you are not studying for C960.
• Memorizing counting formulas without the decision rule. Students who know all four permutation and combination formulas still miss questions because they never practised deciding which situation they are in.
• Treating cryptography as separate from number theory. The encryption content is number theory wearing a costume; studying them as unrelated units doubles the work and halves the retention.
• Skipping finite-state machines because they come last. Computational models are one of the six published competencies and are unlike everything before them, so leaving them for the night before predictably loses points.
• Taking the pre-assessment too late. Used at the end as a formality, it only tells you that you are unprepared. Used a week out, it tells you what to fix.
• Chasing answer-key sites. Shared question banks carry genuine academic-integrity risk and teach you to compute nothing. C960 rewards fluency, and there is no shortcut to it.

C960 Readiness Checklist

• Can you determine the big-O complexity of a short block of pseudocode and justify why, without guessing from a list?
• Can you compute a gcd and reduce a large power modulo n by hand, accurately, in a couple of minutes?
• Can you explain how number theory makes public-key encryption work, and carry out a small encryption and decryption?
• Can you write a correct proof by induction from a blank page, including a properly stated inductive hypothesis?
• Can you set up and solve a recurrence relation for a recursively defined sequence?
• On an unfamiliar counting problem, can you decide whether order matters and whether repetition is allowed before choosing a formula?
• Can you compute a conditional probability and apply Bayesian reasoning to a word problem you have not seen before?
• Can you build a deterministic finite-state machine for a described language, and explain how a nondeterministic one differs?
• Have you scored comfortably on the pre-assessment and re-drilled every competency it flagged?

C960 FAQ

Is WGU C960 an OA or a PA?

C960 is assessed by a proctored objective assessment. WGU's published program materials list no performance assessment for it, so there is no project to submit and no revision cycle to fall back on. Confirm this in your course of study when the course opens.

How many competency units is C960 worth?

Four. WGU's Bachelor of Science, Computer Science Program Guidebook lists Discrete Mathematics II at four competency units in term four, with Discrete Mathematics I, itself four units, as its prerequisite.

How long does C960 take to finish?

WGU publishes no hours-on-content estimate for this course, so treat specific figures found elsewhere with suspicion. Pace depends almost entirely on how recently you have worked with modular arithmetic, combinatorics, and proof by induction. Plan against the six competencies, take the pre-assessment early, and let it tell you how much time you need.

Is C960 harder than C959?

They are hard in different ways, and there is no official difficulty ranking. C959 builds cumulatively on logic, proof, and structure, so momentum carries you. C960 spans six fairly independent competencies, each needing its own fluency, so there is less carry-over and more to keep warm at once. Passing C959 is a good sign, not a guarantee.

Which part of C960 should I budget the most time for?

Counting and advanced counting techniques, with discrete probability close behind. Both reward students who reason about a problem's structure and punish those who reach straight for a remembered formula. Finite-state machines deserve a real week too, because they are unlike everything else and usually get left until last.

Is C960 being replaced by D422?

No. D422 Discrete Math: Algorithms and Cryptography is a separate one-unit course in WGU's cybersecurity and network engineering programs, covering a narrower slice of this material behind a different prerequisite. C960 remains the computer science program's four-unit Discrete Mathematics II. See WGU's official computer science program page for the current lineup, and browse our School of Technology guides or the full course guide index.