WGU C949 STUDY GUIDE NEWEST 2026/2027 QUESTIONS
and CORRECT DETAILED ANSWERS ALREADY GRADED A+
Reference Count - CORRECT ANSWER-An integer counter that represents how
many variables reference an object. When an object's count is 0, that object is no
longer referenced.
Memory allocation - CORRECT ANSWER-The process of an application
requesting and being granted memory.
Binary Search - CORRECT ANSWER-An algorithm that searches a SORTED LIST
for a key by first comparing the key to the middle element in the list and
recursively searching half of the remaining list so long as the key is not found.
constructor - CORRECT ANSWER-The __init__ method, commonly known as a
constructor, is responsible for setting up the initial state of the new instance.
Null - CORRECT ANSWER-A special value indicating a pointer points to nothing.
,Graph - CORRECT ANSWER-A data structure for representing connections
among items, and consists of vertices connected by edges.
Graph is a data structure that consists of following two components:
A vertex (vertices) represents an item (node) in a graph. An edge represents a
connection between two vertices in a graph.
vertex - CORRECT ANSWER-item in a graph. A finite set of vertices also called
as nodes
V -> Number of Vertices
edge - CORRECT ANSWER-a connection between two vertices in a graph. A
finite set of ordered pair of the form (u, v)
E -> Number of Edges
Binary Search Tree - CORRECT ANSWER-In a list, each node has up to one
successor. In this tree, each node has up to two children, known as a left child and
a right child.
Leaf - CORRECT ANSWER-A tree node with no children.
Internal node - CORRECT ANSWER-A node with at least one child.
, Parent - CORRECT ANSWER-A node with a child is said to be that child's
parent.
Node's ancestors - CORRECT ANSWER-include the node's parent, the parent's
parent, etc., up to the tree's root.
Array - CORRECT ANSWER-A data structure that stores an ordered list of
items, 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 Search 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 (or vector).
Hashing - CORRECT ANSWER-mapping each item to a location in an array (in a
hash table).
and CORRECT DETAILED ANSWERS ALREADY GRADED A+
Reference Count - CORRECT ANSWER-An integer counter that represents how
many variables reference an object. When an object's count is 0, that object is no
longer referenced.
Memory allocation - CORRECT ANSWER-The process of an application
requesting and being granted memory.
Binary Search - CORRECT ANSWER-An algorithm that searches a SORTED LIST
for a key by first comparing the key to the middle element in the list and
recursively searching half of the remaining list so long as the key is not found.
constructor - CORRECT ANSWER-The __init__ method, commonly known as a
constructor, is responsible for setting up the initial state of the new instance.
Null - CORRECT ANSWER-A special value indicating a pointer points to nothing.
,Graph - CORRECT ANSWER-A data structure for representing connections
among items, and consists of vertices connected by edges.
Graph is a data structure that consists of following two components:
A vertex (vertices) represents an item (node) in a graph. An edge represents a
connection between two vertices in a graph.
vertex - CORRECT ANSWER-item in a graph. A finite set of vertices also called
as nodes
V -> Number of Vertices
edge - CORRECT ANSWER-a connection between two vertices in a graph. A
finite set of ordered pair of the form (u, v)
E -> Number of Edges
Binary Search Tree - CORRECT ANSWER-In a list, each node has up to one
successor. In this tree, each node has up to two children, known as a left child and
a right child.
Leaf - CORRECT ANSWER-A tree node with no children.
Internal node - CORRECT ANSWER-A node with at least one child.
, Parent - CORRECT ANSWER-A node with a child is said to be that child's
parent.
Node's ancestors - CORRECT ANSWER-include the node's parent, the parent's
parent, etc., up to the tree's root.
Array - CORRECT ANSWER-A data structure that stores an ordered list of
items, 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 Search 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 (or vector).
Hashing - CORRECT ANSWER-mapping each item to a location in an array (in a
hash table).
