WGU C949 FINAL EXAM DATA STRUCTURES AND ALGORITHMS
- HIGHER EDUCATION COMPUTER SCIENCE CURRICULUM -
2026/2027 ACADEMIC YEAR - VERIFIED QUESTIONS AND
ANSWERS FOR ADVANCED DATA STRUCTURES AND
ALGORITHMS LEARNERS
160 Questions with Answers and Detailed Rationales
100 PERCENT GUARANTEED PASS
INSTANT DOWNLOAD ANSWERS INCLUDED
IMPORTANCE OF THIS DOCUMENT
This comprehensive examination preparation guide has been meticulously developed to help you succeed in the
WGU C949 FINAL EXAM DATA STRUCTURES AND ALGORITHMS - HIGHER EDUCATION COMPUTER
SCIENCE CURRICULUM - 2026/2027 ACADEMIC YEAR - VERIFIED QUESTIONS AND ANSWERS FOR
ADVANCED DATA STRUCTURES AND ALGORITHMS LEARNERS. It contains 160 carefully selected questions
that reflect the most current exam content and testing strategies. Each question is accompanied by a correct
answer and a detailed rationale that explains the underlying pathophysiology, pharmacology, or clinical reasoning.
Self-Assessment – Test your knowledge and Exam Preparation – Familiarize yourself with the
identify areas requiring further question format and content
study areas
Concept Reinforcement – Deepen your Confidence Building – Develop test-taking
understanding through strategies and reduce
evidence-based exam anxiety
rationales
Time Management – Practice answering
questions under simulated
exam conditions
Review Summary 160 Questions
Foundations - Application - WGU C949 DATA Structures AND Algorithms Higher Education Computer
Science Curriculum 2026/2027 Academic YEAR AND FOR Advanced DATA Structures AND Algorithms
Learners DATA Structures AND Algorithms Undergraduate YEAR 3 / Graduate
All answers with rationales
,Table of Contents
Content Area Questions Key Topics
WGU C949 DATA Structures 1-27 Algorithm, Graph, Number, Vertices, Amortized
AND Algorithms Higher
Education Computer Science
Curriculum 2026/2027
Academic YEAR AND FOR
Advanced DATA Structures
AND Algorithms Learners
DATA Structures AND
Algorithms Undergraduate
YEAR 3 / Graduate
Graph 28-54 Algorithm, TIME Complexity, Correctly, Binary, Vertices
Complexity 55-81 TIME Complexity, Algorithm, Context, Maximum, Graph
Number 82-108 Complexity, Algorithm, Graph, Search, Binary
Search 109-135 Graph, Algorithm, Shortest, TIME Complexity, Clustering
Binary 136-160 Algorithm, Complexity, Graph, Vertices, Describes
TOTAL 160 All questions include answers and detailed rationales
,Section A - WGU C949 DATA Structures AND Algorithms
Higher Education Computer Science Curriculum 2026/2027
Academic YEAR AND FOR Advanced DATA Structures AND
Algorithms Learners DATA Structures AND Algorithms
Undergraduate YEAR 3 / Graduate
Q1.
Consider a dynamic array that doubles its capacity when full. If the amortized cost per
insertion is O(1), what is the total cost of n insertions starting from capacity 1?
A. O(n) B. O(n log n)
C. O(n^2) D. O(2^n)
Correct: A - O(n)
Rationale:The total cost of n insertions is the sum of the geometric series of expansions: 1 +
2 + 4 + ... + n = 2n - 1, which is O(n). Thus, the amortized cost per insertion is O(1).
Q2.
Which of the following data structures is most appropriate for implementing a priority
queue where the maximum element needs to be extracted frequently, and merge
operations between two priority queues are also required?
A. Binary heap B. Binomial heap
C. AVL tree D. Hash table
Correct: B - Binomial heap
Rationale:Binomial heaps support merge in O(log n) time, which is more efficient than binary
heaps (O(n) for merge). AVL trees support priority queue operations but merge is O(n). Hash
tables do not maintain order.
Q3.
In a graph with V vertices and E edges, which algorithm can find the shortest path from a
single source to all other vertices in O(V log V + E) time when edge weights are
non-negative?
A. Bellman-Ford B. Floyd-Warshall
C. Dijkstra with a binary heap D. Dijkstra with an unsorted array
Correct: C - Dijkstra with a binary heap
Page 3
, Section A - WGU C949 DATA Structures AND Algorithms Higher Education Computer Science Curriculum 2026/2027 Academic YEAR AND
FOR Advanced DATA Structures AND Algorithms Learners DATA Structures AND Algorithms Undergraduate YEAR 3 / Graduate
Rationale: Dijkstra's algorithm with a binary heap achieves O((V+E) log V), which simplifies to
O(V log V + E) for connected graphs. Bellman-Ford is O(VE), Floyd-Warshall is O(V^3), and
Dijkstra with unsorted array is O(V^2).
Q4.
Given a set of intervals [s_i, f_i] where s_i < f_i, which greedy strategy optimally selects
the maximum number of non-overlapping intervals?
A. Pick the interval with the earliest start B. Pick the interval with the shortest duration
time
C. Pick the interval with the earliest finish D. Pick the interval that overlaps the fewest
time other intervals
Correct: C - Pick the interval with the earliest finish time
Rationale:The classic interval scheduling proof shows that selecting intervals by earliest
finish time yields an optimal solution. The other strategies do not guarantee optimality.
Q5.
Which of the following is NOT a characteristic of a B-tree of order m?
A. All leaves are at the same depth B. Every node has at most m children
C. Every node (except root) has at least D. The root has at least ceil(m/2) children
ceil(m/2) children
Correct: D - The root has at least ceil(m/2) children
Rationale:In a B-tree, the root may have as few as 2 children (or 0 if empty). The requirement
of at least ceil(m/2) children applies to internal nodes other than the root.
Q6.
For a hash table using open addressing with linear probing, what is the expected number
of probes for a successful search when the load factor = 0.5?
A. 1.5 B. 2.0
C. 1.25 D. 1.0
Correct: A - 1.5
Rationale:For linear probing, the expected number of probes for a successful search is
(1/2)(1 + 1/(1 - )). With = 0.5, this gives (1/2)(1 + 2) = 1.5.
Page 4
- HIGHER EDUCATION COMPUTER SCIENCE CURRICULUM -
2026/2027 ACADEMIC YEAR - VERIFIED QUESTIONS AND
ANSWERS FOR ADVANCED DATA STRUCTURES AND
ALGORITHMS LEARNERS
160 Questions with Answers and Detailed Rationales
100 PERCENT GUARANTEED PASS
INSTANT DOWNLOAD ANSWERS INCLUDED
IMPORTANCE OF THIS DOCUMENT
This comprehensive examination preparation guide has been meticulously developed to help you succeed in the
WGU C949 FINAL EXAM DATA STRUCTURES AND ALGORITHMS - HIGHER EDUCATION COMPUTER
SCIENCE CURRICULUM - 2026/2027 ACADEMIC YEAR - VERIFIED QUESTIONS AND ANSWERS FOR
ADVANCED DATA STRUCTURES AND ALGORITHMS LEARNERS. It contains 160 carefully selected questions
that reflect the most current exam content and testing strategies. Each question is accompanied by a correct
answer and a detailed rationale that explains the underlying pathophysiology, pharmacology, or clinical reasoning.
Self-Assessment – Test your knowledge and Exam Preparation – Familiarize yourself with the
identify areas requiring further question format and content
study areas
Concept Reinforcement – Deepen your Confidence Building – Develop test-taking
understanding through strategies and reduce
evidence-based exam anxiety
rationales
Time Management – Practice answering
questions under simulated
exam conditions
Review Summary 160 Questions
Foundations - Application - WGU C949 DATA Structures AND Algorithms Higher Education Computer
Science Curriculum 2026/2027 Academic YEAR AND FOR Advanced DATA Structures AND Algorithms
Learners DATA Structures AND Algorithms Undergraduate YEAR 3 / Graduate
All answers with rationales
,Table of Contents
Content Area Questions Key Topics
WGU C949 DATA Structures 1-27 Algorithm, Graph, Number, Vertices, Amortized
AND Algorithms Higher
Education Computer Science
Curriculum 2026/2027
Academic YEAR AND FOR
Advanced DATA Structures
AND Algorithms Learners
DATA Structures AND
Algorithms Undergraduate
YEAR 3 / Graduate
Graph 28-54 Algorithm, TIME Complexity, Correctly, Binary, Vertices
Complexity 55-81 TIME Complexity, Algorithm, Context, Maximum, Graph
Number 82-108 Complexity, Algorithm, Graph, Search, Binary
Search 109-135 Graph, Algorithm, Shortest, TIME Complexity, Clustering
Binary 136-160 Algorithm, Complexity, Graph, Vertices, Describes
TOTAL 160 All questions include answers and detailed rationales
,Section A - WGU C949 DATA Structures AND Algorithms
Higher Education Computer Science Curriculum 2026/2027
Academic YEAR AND FOR Advanced DATA Structures AND
Algorithms Learners DATA Structures AND Algorithms
Undergraduate YEAR 3 / Graduate
Q1.
Consider a dynamic array that doubles its capacity when full. If the amortized cost per
insertion is O(1), what is the total cost of n insertions starting from capacity 1?
A. O(n) B. O(n log n)
C. O(n^2) D. O(2^n)
Correct: A - O(n)
Rationale:The total cost of n insertions is the sum of the geometric series of expansions: 1 +
2 + 4 + ... + n = 2n - 1, which is O(n). Thus, the amortized cost per insertion is O(1).
Q2.
Which of the following data structures is most appropriate for implementing a priority
queue where the maximum element needs to be extracted frequently, and merge
operations between two priority queues are also required?
A. Binary heap B. Binomial heap
C. AVL tree D. Hash table
Correct: B - Binomial heap
Rationale:Binomial heaps support merge in O(log n) time, which is more efficient than binary
heaps (O(n) for merge). AVL trees support priority queue operations but merge is O(n). Hash
tables do not maintain order.
Q3.
In a graph with V vertices and E edges, which algorithm can find the shortest path from a
single source to all other vertices in O(V log V + E) time when edge weights are
non-negative?
A. Bellman-Ford B. Floyd-Warshall
C. Dijkstra with a binary heap D. Dijkstra with an unsorted array
Correct: C - Dijkstra with a binary heap
Page 3
, Section A - WGU C949 DATA Structures AND Algorithms Higher Education Computer Science Curriculum 2026/2027 Academic YEAR AND
FOR Advanced DATA Structures AND Algorithms Learners DATA Structures AND Algorithms Undergraduate YEAR 3 / Graduate
Rationale: Dijkstra's algorithm with a binary heap achieves O((V+E) log V), which simplifies to
O(V log V + E) for connected graphs. Bellman-Ford is O(VE), Floyd-Warshall is O(V^3), and
Dijkstra with unsorted array is O(V^2).
Q4.
Given a set of intervals [s_i, f_i] where s_i < f_i, which greedy strategy optimally selects
the maximum number of non-overlapping intervals?
A. Pick the interval with the earliest start B. Pick the interval with the shortest duration
time
C. Pick the interval with the earliest finish D. Pick the interval that overlaps the fewest
time other intervals
Correct: C - Pick the interval with the earliest finish time
Rationale:The classic interval scheduling proof shows that selecting intervals by earliest
finish time yields an optimal solution. The other strategies do not guarantee optimality.
Q5.
Which of the following is NOT a characteristic of a B-tree of order m?
A. All leaves are at the same depth B. Every node has at most m children
C. Every node (except root) has at least D. The root has at least ceil(m/2) children
ceil(m/2) children
Correct: D - The root has at least ceil(m/2) children
Rationale:In a B-tree, the root may have as few as 2 children (or 0 if empty). The requirement
of at least ceil(m/2) children applies to internal nodes other than the root.
Q6.
For a hash table using open addressing with linear probing, what is the expected number
of probes for a successful search when the load factor = 0.5?
A. 1.5 B. 2.0
C. 1.25 D. 1.0
Correct: A - 1.5
Rationale:For linear probing, the expected number of probes for a successful search is
(1/2)(1 + 1/(1 - )). With = 0.5, this gives (1/2)(1 + 2) = 1.5.
Page 4
