WGU C949 Data Structures and Algorithms I Objective
Assessment (OA) – 150 Practice Questions Complete
Exam Prep for the WGU C949 OA (2026 Update)
|Instant PDF Download
About the WGU C949 OA
The WGU C949 Data Structures and Algorithms I Objective Assessment covers the
fundamentals of dynamic data structures including bags, lists, stacks, queues, trees, hash
tables, and their associated algorithms . The OA consists of 70 questions across three
competency areas:
Competency Area Weight
Data Types 36%
Data Structures 30%
Algorithms 34%
Key Focus Areas:
Abstract Data Types (ADT) and implementations
Big O time complexity analysis
Sorting and searching algorithms
Recursion and iterative problem solving
Memory layout and garbage collection
Section 1: Data Types & Foundational Concepts (Questions 1-30)
1. Which term refers to a template for creating an object?
A) Method
B) Algorithm
,C) Class
D) Variable
Answer: C
Rationale: A class is a blueprint or template from which objects are created. It defines
the properties (attributes) and behaviors (methods) that objects of that type will have .
2. Which characteristic of an algorithm is independent in nature?
A) It must be written in a specific programming language
B) It must use a specific data structure
C) It is agnostic to any specific programming language or platform
D) It must run on a specific operating system
Answer: C
Rationale: An algorithm should be described in a way that is not tied to a specific
programming language or implementation, making it language-agnostic .
3. What is referred to as a data structure that stores subitems (fields)?
A) Array
B) Record
C) List
D) Stack
Answer: B
Rationale: A record (or struct) is a data structure that groups together related data items
(fields) under a single name .
4. Which data type is appropriate for this array?
a = ["AF", "71", "BC", "157", "BA", "253"]
A) Byte
B) Char
C) Short
D) String
Answer: D
,Rationale: The array contains alphanumeric values that include both letters and
numbers, which are best represented as Strings .
5. What is the effect on the object Computing regarding garbage collection?
Computing obj = new Computing(); obj = null;
A) It is partially available for garbage collection
B) It is automatically available for garbage collection
C) It is moved to a cache for later use
D) It remains in memory indefinitely
Answer: B
Rationale: When the reference obj is set to null, the Computing object no longer has any
references pointing to it. It becomes eligible for garbage collection .
6. Which data structure may only store homogeneous data elements?
A) Arrays
B) Classes
C) Dictionaries
D) Linked lists
Answer: A
Rationale: Arrays are designed to store elements of the same data type (homogeneous)
in contiguous memory locations .
7. What does the charAt() method do?
A) Returns a character at a specific index in an array
B) Returns a character at a specific position in a string object
C) Converts a string to a character array
D) Returns the ASCII value of a character
Answer: B
Rationale: The charAt() method returns the character at the specified index position
within a string object .
8. What does the parseInt() method do?
, A) Returns the integer value of a character
B) Converts a string type into an integer
C) Parses a number into a string
D) Returns the value of a floating-point number
Answer: B
Rationale: parseInt() converts a string representation of a number into an integer data
type .
9. What is true about garbage collection?
A) It manually deallocates memory when the program ends
B) It reclaims memory from data structures implemented using linked allocations
C) It only works with arrays
D) It is only available in C++
Answer: B
Rationale: Garbage collection automatically deallocates memory that is no longer being
used by the program, particularly for dynamically allocated objects .
10. What is true about a data structure implemented using linked allocation?
A) Storage is allocated contiguously in memory
B) Storage is allocated using pointers to new locations as needed
C) Storage size is fixed at compile time
D) Storage cannot be dynamically resized
Answer: B
Rationale: Linked allocation uses pointers (references) to connect nodes, and memory
is allocated dynamically at runtime as new elements are added .
11. Which category of data does ("FB", 75.00, 75.03, 74.90) represent in the
pseudocode?
A) Tree
B) Hash(object)
C) Truncate
D) Tuple
Answer: D
Assessment (OA) – 150 Practice Questions Complete
Exam Prep for the WGU C949 OA (2026 Update)
|Instant PDF Download
About the WGU C949 OA
The WGU C949 Data Structures and Algorithms I Objective Assessment covers the
fundamentals of dynamic data structures including bags, lists, stacks, queues, trees, hash
tables, and their associated algorithms . The OA consists of 70 questions across three
competency areas:
Competency Area Weight
Data Types 36%
Data Structures 30%
Algorithms 34%
Key Focus Areas:
Abstract Data Types (ADT) and implementations
Big O time complexity analysis
Sorting and searching algorithms
Recursion and iterative problem solving
Memory layout and garbage collection
Section 1: Data Types & Foundational Concepts (Questions 1-30)
1. Which term refers to a template for creating an object?
A) Method
B) Algorithm
,C) Class
D) Variable
Answer: C
Rationale: A class is a blueprint or template from which objects are created. It defines
the properties (attributes) and behaviors (methods) that objects of that type will have .
2. Which characteristic of an algorithm is independent in nature?
A) It must be written in a specific programming language
B) It must use a specific data structure
C) It is agnostic to any specific programming language or platform
D) It must run on a specific operating system
Answer: C
Rationale: An algorithm should be described in a way that is not tied to a specific
programming language or implementation, making it language-agnostic .
3. What is referred to as a data structure that stores subitems (fields)?
A) Array
B) Record
C) List
D) Stack
Answer: B
Rationale: A record (or struct) is a data structure that groups together related data items
(fields) under a single name .
4. Which data type is appropriate for this array?
a = ["AF", "71", "BC", "157", "BA", "253"]
A) Byte
B) Char
C) Short
D) String
Answer: D
,Rationale: The array contains alphanumeric values that include both letters and
numbers, which are best represented as Strings .
5. What is the effect on the object Computing regarding garbage collection?
Computing obj = new Computing(); obj = null;
A) It is partially available for garbage collection
B) It is automatically available for garbage collection
C) It is moved to a cache for later use
D) It remains in memory indefinitely
Answer: B
Rationale: When the reference obj is set to null, the Computing object no longer has any
references pointing to it. It becomes eligible for garbage collection .
6. Which data structure may only store homogeneous data elements?
A) Arrays
B) Classes
C) Dictionaries
D) Linked lists
Answer: A
Rationale: Arrays are designed to store elements of the same data type (homogeneous)
in contiguous memory locations .
7. What does the charAt() method do?
A) Returns a character at a specific index in an array
B) Returns a character at a specific position in a string object
C) Converts a string to a character array
D) Returns the ASCII value of a character
Answer: B
Rationale: The charAt() method returns the character at the specified index position
within a string object .
8. What does the parseInt() method do?
, A) Returns the integer value of a character
B) Converts a string type into an integer
C) Parses a number into a string
D) Returns the value of a floating-point number
Answer: B
Rationale: parseInt() converts a string representation of a number into an integer data
type .
9. What is true about garbage collection?
A) It manually deallocates memory when the program ends
B) It reclaims memory from data structures implemented using linked allocations
C) It only works with arrays
D) It is only available in C++
Answer: B
Rationale: Garbage collection automatically deallocates memory that is no longer being
used by the program, particularly for dynamically allocated objects .
10. What is true about a data structure implemented using linked allocation?
A) Storage is allocated contiguously in memory
B) Storage is allocated using pointers to new locations as needed
C) Storage size is fixed at compile time
D) Storage cannot be dynamically resized
Answer: B
Rationale: Linked allocation uses pointers (references) to connect nodes, and memory
is allocated dynamically at runtime as new elements are added .
11. Which category of data does ("FB", 75.00, 75.03, 74.90) represent in the
pseudocode?
A) Tree
B) Hash(object)
C) Truncate
D) Tuple
Answer: D
