2026 WGU C949 DATA STRUCTURES AND ALGORITHMS OA EXAM PREP: TE… EXAM
P R O F E S S I O N A L P R A C T I C E M AT E R I A L S
2026 WGU C949 Data
Structures and Algorithms
OA Exam Prep:
Terminology Question
Bank
Verified Answers Exam Ready With Rationales
71 QUESTIONS
DOCUMENT OVERVIEW
This document provides 71 pre-answered questions with detailed explanations for data structures and
algorithms terminology. It serves as a valuable resource for students preparing for certification exams,
allowing for efficient review and comprehension of core concepts.
CONTENTS
01 Core Data Structures Q1–Q13
02 Data Structure Operations Q14–Q18
Page 1
, 03 Abstract Data Types Q19–Q29
04 Programming Concepts Q30–Q37
05 Data Types and Memory Q38–Q47
06 Data Representation Q48–Q50
07 Algorithmic Analysis Q51–Q58
08 Sorting Algorithms Q59–Q68
09 Additional Questions Q69–Q71
E XA M Q U EST I O N S
Q1 QUESTION 1 OF 71
record
CORRECT ANSWER
data structure that stores subitems, with a name associated with each subitem
RATIONALE
A record is a data structure that groups related data elements, allowing each element to be accessed via a
descriptive name, forming a composite data type. This organization is fundamental for representing structured
information and objects in programming.
Q2 QUESTION 2 OF 71
array
CORRECT ANSWER
a data structure that stores an ordered list of items, with each item is directly accessible by a positional
index
homogeneous data elements
Page 2
, RATIONALE
An array is defined by its contiguous memory allocation, allowing direct access to any element using its index,
and typically stores elements of the same data type. This structure facilitates efficient retrieval and
manipulation of ordered data.
Q3 QUESTION 3 OF 71
linked list
CORRECT ANSWER
data structure that stores ordered list of items in nodes, where each node stores data and has a pointer to
the next node; can have multiple subitems
RATIONALE
A linked list organizes data sequentially using nodes, each containing an element and a reference to the
subsequent node, facilitating dynamic memory allocation and efficient insertion/deletion. This structure's core
principle lies in its pointer-based, non-contiguous memory arrangement.
Q4 QUESTION 4 OF 71
binary tree
CORRECT ANSWER
A data structure that consists of nodes, with one root node at the base of the tree, and two nodes (left
child and right child) extending from the root, and from each child node
can have no children, single left or right, or both right and left
RATIONALE
A binary tree is defined by its hierarchical structure where each node has at most two children, referred to as
the left and right child, originating from a single root node. This organizational principle allows for efficient
searching and sorting operations.
Q5 QUESTION 5 OF 71
Page 3
P R O F E S S I O N A L P R A C T I C E M AT E R I A L S
2026 WGU C949 Data
Structures and Algorithms
OA Exam Prep:
Terminology Question
Bank
Verified Answers Exam Ready With Rationales
71 QUESTIONS
DOCUMENT OVERVIEW
This document provides 71 pre-answered questions with detailed explanations for data structures and
algorithms terminology. It serves as a valuable resource for students preparing for certification exams,
allowing for efficient review and comprehension of core concepts.
CONTENTS
01 Core Data Structures Q1–Q13
02 Data Structure Operations Q14–Q18
Page 1
, 03 Abstract Data Types Q19–Q29
04 Programming Concepts Q30–Q37
05 Data Types and Memory Q38–Q47
06 Data Representation Q48–Q50
07 Algorithmic Analysis Q51–Q58
08 Sorting Algorithms Q59–Q68
09 Additional Questions Q69–Q71
E XA M Q U EST I O N S
Q1 QUESTION 1 OF 71
record
CORRECT ANSWER
data structure that stores subitems, with a name associated with each subitem
RATIONALE
A record is a data structure that groups related data elements, allowing each element to be accessed via a
descriptive name, forming a composite data type. This organization is fundamental for representing structured
information and objects in programming.
Q2 QUESTION 2 OF 71
array
CORRECT ANSWER
a data structure that stores an ordered list of items, with each item is directly accessible by a positional
index
homogeneous data elements
Page 2
, RATIONALE
An array is defined by its contiguous memory allocation, allowing direct access to any element using its index,
and typically stores elements of the same data type. This structure facilitates efficient retrieval and
manipulation of ordered data.
Q3 QUESTION 3 OF 71
linked list
CORRECT ANSWER
data structure that stores ordered list of items in nodes, where each node stores data and has a pointer to
the next node; can have multiple subitems
RATIONALE
A linked list organizes data sequentially using nodes, each containing an element and a reference to the
subsequent node, facilitating dynamic memory allocation and efficient insertion/deletion. This structure's core
principle lies in its pointer-based, non-contiguous memory arrangement.
Q4 QUESTION 4 OF 71
binary tree
CORRECT ANSWER
A data structure that consists of nodes, with one root node at the base of the tree, and two nodes (left
child and right child) extending from the root, and from each child node
can have no children, single left or right, or both right and left
RATIONALE
A binary tree is defined by its hierarchical structure where each node has at most two children, referred to as
the left and right child, originating from a single root node. This organizational principle allows for efficient
searching and sorting operations.
Q5 QUESTION 5 OF 71
Page 3
