WGU 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.
Fennie is independent and not affiliated with Western Governors University. This is an unofficial study guide.
Build my C949 study planWhat makes it hard
The OA mixes conceptual questions with code-reading, so you need both the vocabulary and the ability to trace Python snippets. Students who learned to code by pattern-matching struggle with the algorithm-analysis questions; Big-O of common operations is heavily represented and pure memorization without understanding tends to crack on edge cases.
What you'll cover
- • Arrays, linked lists, stacks, queues
- • Trees and binary search trees
- • Hash tables
- • Searching and sorting algorithms
- • Big-O analysis
- • Recursion
The C949 study guide
How to study for WGU C949, step by step.
- 1
Take the pre-assessment cold
The PA splits your gaps between vocabulary, code-reading, and complexity analysis — three different skills that need different practice. Let the score report assign your time.
- 2
Build a Big-O table by hand
Write out the complexity of every common operation on every structure — insert, search, delete on lists, trees, hash tables. Making the table yourself is what survives the OA's edge-case questions.
- 3
Trace algorithms by hand
Step through the sorts and short Python snippets on paper, tracking variables line by line. The OA's code-reading questions reward students who can execute code mentally, not pattern-match it.
- 4
Drill the structure vocabulary daily
Ten minutes a day on data-structure terms and sorting behaviors keeps the recall half of the exam cheap, leaving exam time for the tracing questions.
- 5
Retake the PA, then schedule the OA
Treat a clean pre-assessment pass — including its code-trace questions — as your scheduling signal, and book within a week.
- 6
Make Fennie your pacing layer
Upload the C949 outline to Fennie and Daily Plans schedules the units with recurring Big-O and sorting review toward your OA date, flashcards for operation complexities included. Free to start.
Start my C949 plan free
How Fennie helps with C949
Fennie's Daily Plans pace the C949 units with recurring review of Big-O and sorting behavior, the two topics the OA leans on hardest. Chat through code traces you can't follow, and drill generated flashcards on operation complexities until they're reflexive.
FAQ
Is WGU C949 hard?
Moderate — easier than the discrete math pair but harder than the intro programming courses. The OA expects you to trace code and reason about complexity, not just recognize definitions.
How long does C949 take?
Most students take 3–6 weeks. Comfortable Python readers move faster; the data-structure vocabulary and Big-O analysis are usually the time sinks.
How do I pass the C949 OA?
Be able to state the Big-O of common operations on each structure, trace short Python snippets by hand, and know how each sort behaves. The pre-assessment is a faithful preview — treat a clean pass on it as your scheduling signal.
Pass C949 with a plan, not a cram
Upload your C949 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
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.
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.
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.