WGU C959: Discrete Mathematics I

What WGU C959 Discrete Mathematics I Actually Is

C959 Discrete Mathematics I is the first of two discrete math courses in WGU's B.S. Computer Science program, worth 4 competency units. It introduces the abstract structures that computer science is built on: logic and proofs, Boolean algebra and Boolean functions, set theory, finite and infinite sequences and series, and relations, graphs, and trees — plus a unit on matrix operations. Calculus I is a prerequisite, so by the time you open this course you've already survived WGU math once, and that experience transfers more than you might expect.

Direct answer: To pass C959, work through the course material section by section, doing every practice problem by hand rather than reading solutions, then use the pre-assessment to find your weak units and drill those until you can solve problems cold. Most of the exam rewards fluent procedure — truth tables, set operations, Boolean simplification, matrix arithmetic, graph properties — so repetition with pencil and paper is what gets you through.

If discrete math is new to you, know that it's a different animal from calculus. There are no limits or derivatives here; instead you'll manipulate symbols, count things carefully, and reason about structures like sets and graphs. Many students who disliked continuous math find they actually prefer discrete math — it feels closer to programming, and the course leans into computer science applications throughout.

The Topics on the C959 Objective Assessment

C959 is assessed with a proctored Objective Assessment (OA) — a timed, closed-book exam of objective questions, with no performance assessment component. The official competencies span deductive logic and proofs, sets and functions, Boolean algebra, matrix operations, finite and infinite series, relations, and graphs and trees, and the exam draws across all of them:

• Logic and proofs — propositions, truth tables, logical equivalences, conditionals, quantifiers, and the structure of basic proofs.
• Set theory — unions, intersections, complements, subsets, power sets, and Venn-diagram reasoning.
• Functions — domain and range, one-to-one and onto properties, composition, and inverses.
• Boolean algebra and Boolean functions — simplifying Boolean expressions and connecting them to logic circuits.
• Matrix operations — matrix addition and multiplication, and using matrices to represent structures like relations and graphs. This unit is easy to overlook because it isn't named in the one-line course description, but "performs matrix operations" is an official competency — don't skip it.
• Sequences and series — finite and infinite sequences, summation notation, and arithmetic and geometric patterns.
• Relations, graphs, and trees — properties of relations, undirected and directed graphs, paths, and tree structures.

Notice what is not here: algorithms, big-O, cryptography, counting techniques, and probability belong to C960 Discrete Mathematics II. And if your program uses the newer three-course discrete math split instead — D420 Logic, D421 Functions and Relations, and D422 Algorithms and Cryptography — the same ground is carved up differently, so check your degree plan and study the right scope.

How Hard Is C959, Really?

Difficulty depends heavily on your math background. Students comfortable with symbolic manipulation often call C959 the easier of the two discrete math courses; students who lean on intuition rather than notation tend to struggle early with proofs and quantifiers, then find the later units (graphs, trees, relations) more concrete and approachable.

On timing, many students report finishing in roughly two to six weeks of consistent study, and some report passing in under three weeks by working the material daily. If math is a weak spot, budget one to two months and don't treat that as falling behind — this course is a foundation for Data Structures and Algorithms and much of what follows in the CS program, and rushing it costs you later. Since you've already cleared the C958 Calculus I prerequisite, you know your own pace with WGU math courses; C959 usually takes a comparable or shorter amount of effort because the problems are shorter, even if the ideas are more abstract.

A Study Plan That Matches How This Exam Tests You

The OA tests whether you can do discrete math, not whether you recognize it. Build your prep around producing answers from scratch:

1. Work every unit in order, on paper. The course material is interactive, and it's tempting to click through. Don't. For each section, close the explanation and re-derive the example yourself — build the truth table, simplify the Boolean expression, multiply the matrices, draw the graph. If you can't reproduce it without peeking, you haven't learned it yet.
2. Use active recall on definitions and laws. Make flashcards for the things that must be instant: logical equivalences (De Morgan's laws, contrapositive vs. converse), set identities, function properties (injective, surjective, bijective), and relation properties (reflexive, symmetric, transitive). Quiz yourself daily; five minutes of recall beats an hour of rereading.
3. Space your reviews. Discrete math units feel disconnected — logic one week, graphs the next — so earlier material decays fast. Every two or three days, pull a handful of problems from units you already "finished." Spaced repetition is what keeps unit 1 alive when you sit the OA weeks later.
4. Treat the pre-assessment as a diagnostic, not a dress rehearsal. Take it once you've covered all units, under exam-like conditions: timed, no notes. Then map every miss back to its topic and re-drill that section specifically. Retake it only after you've fixed the gaps, so your second score reflects real readiness.
5. Practice translating word problems into notation. A lot of exam difficulty is decoding: turning an English sentence into a quantified statement, or a described scenario into a set expression. Deliberately practice the translation step, because it's where points are quietly lost.

Supplement with free outside explanations when the course text doesn't click — university discrete math lectures on YouTube and Khan Academy's logic and set theory material cover the same ground from different angles. Just keep the WGU course material as your source of truth for scope.

Where C959 Students Lose Points

• Confusing converse, inverse, and contrapositive. These are heavily tested and easy to mix up under time pressure. Drill them until the distinctions are automatic.
• Reading solutions instead of solving. Discrete math has a strong "that looks easy" illusion. Watching a worked truth table is not the same as building one against the clock.
• Skimming quantifiers. Swapping "for all" and "there exists," or misreading a negated quantifier, flips the answer entirely. Slow down on every ∀ and ∃.
• Forgetting the matrix unit exists. Because matrices don't fit the "logic and sets" mental picture of the course, students under-study them and give away straightforward computation points.
• Neglecting the later units. Relations, graphs, and trees come at the end when fatigue sets in, but they carry real weight on the OA. Don't sprint the finish.
• Arithmetic slips in multi-step problems. Many OA questions have several parts. Dissecting a question into pieces — and skipping and returning to time-sinks — is often the difference between finishing and not.
• Not knowing notation cold. If you have to pause to remember what a power set symbol or composition notation means, you'll bleed time. Notation fluency is free points.

C959 Readiness Checklist

You're ready to schedule the OA when you can honestly check every box:

• Can you build a truth table for a compound proposition and identify tautologies and contradictions without notes?
• Can you state the converse, inverse, and contrapositive of a conditional and say which is logically equivalent to the original?
• Can you simplify a Boolean expression using standard laws and verify the result?
• Can you compute unions, intersections, differences, complements, and power sets for given sets, including with set-builder notation?
• Can you add and multiply matrices of compatible dimensions without prompting?
• Can you determine whether a function is one-to-one, onto, or bijective, and find a composition or inverse?
• Can you find a closed-form or next term for arithmetic and geometric sequences and evaluate summation notation?
• Can you classify a relation as reflexive, symmetric, or transitive and recognize an equivalence relation?
• Can you answer questions about paths, degrees, and basic properties of graphs and trees?
• Did you score comfortably on a timed, closed-book pre-assessment — and understand every question you missed?

WGU C959 FAQ

Is C959 an OA or a PA?

C959 is assessed by a single proctored Objective Assessment — an objective-question exam taken with online proctoring. There is no performance assessment or project component.

How many competency units is C959 worth?

C959 Discrete Mathematics I is a 4-competency-unit course in WGU's B.S. Computer Science program, per the official program guide.

Do I need calculus before taking C959?

Yes — Calculus I is listed as a prerequisite in the program guide. In practice, C959 doesn't use calculus techniques directly, but the mathematical maturity from C958 Calculus I helps with notation and proof-style reasoning.

How long does C959 take to finish?

It varies widely with math background. Many students report two to six weeks of steady study; some finish in under three weeks, while others take a couple of months. Consistent daily problem practice matters more than total calendar time.

Is Discrete Math I harder than Discrete Math II?

Opinions split. C959 is more abstract (logic, sets, proofs), while C960 Discrete Mathematics II adds counting, probability, cryptography, and algorithm analysis. Students strong in symbolic reasoning often find C959 easier; students who prefer concrete computation sometimes prefer it too, once past the logic units.

What should I use besides the course materials?

The included interactive textbook with its exercises is the core. For alternate explanations, free university discrete math lectures and Khan Academy's logic and set theory content work well. For the rest of your program, browse our School of Technology guides — including D333 Ethics in Technology — or the full guide index.