, WGU C949 STUDY GUIDECOMPUTER
SCIENCE DATA STRUCTURES &
ALGORITHMS CERTIFICATION
PRACTICE EXAM WITH CORRECT
ANSWERS GRADED A+ 2027
1. What is an array?
A. A collection of unordered data stored in nodes
B. A tree data structure with two children per node
C. A collection of key-value pairs
D. A data structure that stores an ordered list of items that are directly accessible by index
2. A linked list stores data:
A. In contiguous memory locations
B. Using hash functions
C. In a binary tree
D. In nodes connected by pointers
3. A Binary Search Tree (BST) is a data structure in which:
A. Every node has exactly three children
B. Items are stored randomly
C. Nodes are connected in a circle
D. Each node has up to two children: a left child and a right child
4. A hash table stores data by:
A. Sorting elements alphabetically
B. Linking nodes together
C. Using a binary search tree
D. Mapping each item to a location in an array
SCIENCE DATA STRUCTURES &
ALGORITHMS CERTIFICATION
PRACTICE EXAM WITH CORRECT
ANSWERS GRADED A+ 2027
1. What is an array?
A. A collection of unordered data stored in nodes
B. A tree data structure with two children per node
C. A collection of key-value pairs
D. A data structure that stores an ordered list of items that are directly accessible by index
2. A linked list stores data:
A. In contiguous memory locations
B. Using hash functions
C. In a binary tree
D. In nodes connected by pointers
3. A Binary Search Tree (BST) is a data structure in which:
A. Every node has exactly three children
B. Items are stored randomly
C. Nodes are connected in a circle
D. Each node has up to two children: a left child and a right child
4. A hash table stores data by:
A. Sorting elements alphabetically
B. Linking nodes together
C. Using a binary search tree
D. Mapping each item to a location in an array
