WGU C949 Data Structures and Algorithms I
Test Exam Review Questions with all Answers
verified for accuracy Updated 2024/2025
Interactive interpreter - correct answer A program that
allows the user to execute one line of code at a time.
Syntax error - correct answer To violate a programming
language's rules on how symbols can be combined to create a
program. An example is putting multiple prints on the same line.
Runtime error - correct answer Wherein a program's syntax
is correct but the program attempts an impossible operation,
such as dividing by zero or multiplying strings together (like
'Hello' * 'ABC').
Crash - correct answer Abrupt and unintended termination of
a program.
Integrated Development Environment (IDE) - correct answer
Provides a developer with a way to create a program, run the
program, and debug the program all within one application. IDLE
is the official Python ______.
Compiler - correct answer Translates a high-level language
program into low-level machine instructions.
Application - correct answer Another word for program.
,Machine instruction - correct answer A series of 0s and 1s,
stored in memory, that tells a processor to carry out a particular
operation like a multiplication.
Assembly language - correct answer Human-readable
processor instructions; an assembler translates to machine
instructions (0s and 1s).
Moore's Law - correct answer The observation that
computing power roughly doubles every two years. The doubling
of IC capacity roughly every 18 months.
Clock - correct answer Rate at which a processor executes
instructions.
Cache - correct answer Relatively-small volatile storage with
fastest access located on processor chip.
Random Access Memory (RAM) - correct answer Volatile
storage with faster access usually located off processor chip.
Disk - correct answer Non-volatile storage with slower
access.
Operating System - correct answer Manages programs and
interfaces with peripherals.
,Computational Problem - correct answer Specifies an input, a
question about the input that can be answered using a computer,
and the desired output.
NP-complete - correct answer ____ are problems with no
practical algorithmic solutions. A A set of problems for which no
known efficient algorithm exists
Data structure - correct answer A way of organizing, storing,
and performing operations on data. Operations performed on a
_____ include accessing or updating stored data, searching for
specific data, inserting new data, and removing data.
Record - correct answer The data structure that stores
subitems, with a name associated with each subitem.
Array - correct answer A data structure that stores an
ordered list of items, with each item is directly accessible by a
positional index.
Linked list - correct answer A data structure that stores
ordered list of items in nodes, where each node stores data and
has a pointer to the next node.
Binary tree - correct answer A data structure in which each
node stores data and has up to two children, known as a left
child and a right child.
, Hash table - correct answer A data structure that stores
unordered items by mapping (or hashing) each item to a location
in an array.
Heap - correct answer A max-_____ is a tree that maintains
the simple property that a node's key is greater than or equal to
the node's childrens' keys. A min-_____ is a tree that maintains
the simple property that a node's key is less than or equal to the
node's childrens' keys.
Graph - correct answer A data structure for representing
connections among items, and consists of vertices connected by
edges. A vertex represents an item in a _____. An edge represents
a connection between two vertices in a _____.
Abstract data type (ADT) - correct answer A data type
described by predefined user operations, such as "insert data at
rear," without indicating how each operation is implemented.
______ can be implemented using different underlying data
structures. However, a programmer need not have knowledge of
the underlying implementation to use ________.
List - correct answer An ADT for holding ordered data. Items
are ordered based on how items are added. Duplicate items are
allowed. The order is based on how the program insert or
removes items. Common underlying data structures (Array,
linked list)
Stack - correct answer An ADT in which items are only
inserted on or removed from the top of a _____. Common
underlying data structures (Linked list)
Test Exam Review Questions with all Answers
verified for accuracy Updated 2024/2025
Interactive interpreter - correct answer A program that
allows the user to execute one line of code at a time.
Syntax error - correct answer To violate a programming
language's rules on how symbols can be combined to create a
program. An example is putting multiple prints on the same line.
Runtime error - correct answer Wherein a program's syntax
is correct but the program attempts an impossible operation,
such as dividing by zero or multiplying strings together (like
'Hello' * 'ABC').
Crash - correct answer Abrupt and unintended termination of
a program.
Integrated Development Environment (IDE) - correct answer
Provides a developer with a way to create a program, run the
program, and debug the program all within one application. IDLE
is the official Python ______.
Compiler - correct answer Translates a high-level language
program into low-level machine instructions.
Application - correct answer Another word for program.
,Machine instruction - correct answer A series of 0s and 1s,
stored in memory, that tells a processor to carry out a particular
operation like a multiplication.
Assembly language - correct answer Human-readable
processor instructions; an assembler translates to machine
instructions (0s and 1s).
Moore's Law - correct answer The observation that
computing power roughly doubles every two years. The doubling
of IC capacity roughly every 18 months.
Clock - correct answer Rate at which a processor executes
instructions.
Cache - correct answer Relatively-small volatile storage with
fastest access located on processor chip.
Random Access Memory (RAM) - correct answer Volatile
storage with faster access usually located off processor chip.
Disk - correct answer Non-volatile storage with slower
access.
Operating System - correct answer Manages programs and
interfaces with peripherals.
,Computational Problem - correct answer Specifies an input, a
question about the input that can be answered using a computer,
and the desired output.
NP-complete - correct answer ____ are problems with no
practical algorithmic solutions. A A set of problems for which no
known efficient algorithm exists
Data structure - correct answer A way of organizing, storing,
and performing operations on data. Operations performed on a
_____ include accessing or updating stored data, searching for
specific data, inserting new data, and removing data.
Record - correct answer The data structure that stores
subitems, with a name associated with each subitem.
Array - correct answer A data structure that stores an
ordered list of items, with each item is directly accessible by a
positional index.
Linked list - correct answer A data structure that stores
ordered list of items in nodes, where each node stores data and
has a pointer to the next node.
Binary tree - correct answer A data structure in which each
node stores data and has up to two children, known as a left
child and a right child.
, Hash table - correct answer A data structure that stores
unordered items by mapping (or hashing) each item to a location
in an array.
Heap - correct answer A max-_____ is a tree that maintains
the simple property that a node's key is greater than or equal to
the node's childrens' keys. A min-_____ is a tree that maintains
the simple property that a node's key is less than or equal to the
node's childrens' keys.
Graph - correct answer A data structure for representing
connections among items, and consists of vertices connected by
edges. A vertex represents an item in a _____. An edge represents
a connection between two vertices in a _____.
Abstract data type (ADT) - correct answer A data type
described by predefined user operations, such as "insert data at
rear," without indicating how each operation is implemented.
______ can be implemented using different underlying data
structures. However, a programmer need not have knowledge of
the underlying implementation to use ________.
List - correct answer An ADT for holding ordered data. Items
are ordered based on how items are added. Duplicate items are
allowed. The order is based on how the program insert or
removes items. Common underlying data structures (Array,
linked list)
Stack - correct answer An ADT in which items are only
inserted on or removed from the top of a _____. Common
underlying data structures (Linked list)
