WGU C949 COMPREHENSIVE QUESTIONS AND
VERIFIED ANSWERS 2024 UPDATE TEST GRADE A+
what is an advantage of a linked list over an array?n - (correct answer) inserting a
new item at the beginning it causes no shift to the data
In the worst case, inserting a new node into a tree with N nodes requires how many
comparisons? - (correct answer) N
A _____________is an integer counter that represents how many variables reference
an object. When an object's reference count is 0, that object is no longer referenced. -
(correct answer) reference count
directs a program to execute either one group of statements or another, depending on
the result of an expression. - (correct answer) Branching
A ______ executes a block of code as long as the loop's expression is True. - (correct
answer) while loop
The syntax __________ produces a new string, which repeats the value of user_value 5
times. In this case, the value of user_value may be "-", thus the result of the
multiplication is "-----". - (correct answer) print(user_value*5)
generates a sequence of numbers, starting at zero and ending before a value given
inside the parentheses. For example, for i in range(3) sets i to 0 during the first iteration
of the for loop, i to 1 during the second iteration, and finally i to 2 on the third iteration.
The value within the parentheses is not included in the generated sequence. - (correct
answer) range()
A ____________ maps names to objects. The Python interpreter uses namespaces to
track all of the objects in a program. - (correct answer) namespace
In a program, an ______ consists of some internal data items plus operations that can
be performed on that data. - (correct answer) object
A ________ such as "20", "abcdef", or 55. - (correct answer) Value:
Find the element in list with the smallest value. - (correct answer) min(list)
Find the sum of all elements of a list (numbers only). - (correct answer) sum(list)
find the index of the first element in list whose value matches val. - (correct answer)
list.index(val)
,Count the number of occurrences of the value val in list. - (correct answer)
list.count(val)
Find the element in list with the largest value. - (correct answer) max(list)
A ,__________ also called an identifier, is a sequence of letters (a-z, A-Z, _) and digits
(0-9), and must start with a letter. Note that "_", called an underscore, is considered to
be a letter. - (correct answer) name
built-in function ___________ prints the type of an object. - (correct answer) type()
A unique identifier that describes the object - (correct answer) Identity:
O(n^2) A sort algorithm that repeatedly searches remaining items to find the least one
and moves it to its final location. - (correct answer) selection sort
Removes x Remove(list, 77), list: 99 - (correct answer) Remove(list, x)
Returns item if found, else returns null Search(list, 99), returns item 99Search(list, 22),
returns null - (correct answer) Search(list, x)
Prints list's items in orderPrint(list) outputs: 99, 77 - (correct answer) Print(list)
Sorts the lists items in ascending orderlist becomes: 77, 99 - (correct answer)
Sort(list)
Returns true if list has no items
For list 99, 77, IsEmpty(list) returns false - (correct answer) IsEmpty(list)
Returns the number of items in the listGetLength(list) returns 2 - (correct answer)
GetLength(list)
data structure that stores subitems, with a name associated with each subitem -
(correct answer) record
a data structure that stores an ordered list of items, with each item is directly accessible
by a positional index
homogeneous data elements Inserting at the beginning requires making room for the
new item. So every current item must be shifted once. - (correct answer) array
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 No shifting of other
items is required, which is an advantage of using linked lists. - (correct answer)
linked list
, 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 - (correct answer)
binary tree
data structure that stores *unordered* items by mapping (or hashing) each item to a
location in an array - (correct answer) hash table
a tree that maintains the simple property that a node's key is greater than or equal to the
node's childrens' keys - (correct answer) max-heap
a tree that maintains the simple property that a node's key is less than or equal to the
node's childrens' keys - (correct answer) min-heap
data structure for representing connections among items, and consists of vertices
connected by edges - (correct answer) graph
part of a graph the represents an item in a graph - (correct answer) vertice
part of a graph that represents a connection between to vertices in a graph - (correct
answer) edge
data type described by predefined user operations, such as "insert data at rear", without
indication how each operation is implemented - (correct answer) ADT (Abstract data
Type)
ADT for holding ordered data - (correct answer) list
ADT which items are only inserted on or removed from the top of a stack
LIFO - (correct answer) stack
ADT in which items are inserted at the end of the queue and removed from the front of
the queue
FIFO - (correct answer) Queue
ADT in which items can be removed at both the front and back - (correct answer)
deque ("deck")
ADT for stroing items in which the order does not matter and duplicate items are
allowed - (correct answer) Bag
ADT for collection of distinct items
VERIFIED ANSWERS 2024 UPDATE TEST GRADE A+
what is an advantage of a linked list over an array?n - (correct answer) inserting a
new item at the beginning it causes no shift to the data
In the worst case, inserting a new node into a tree with N nodes requires how many
comparisons? - (correct answer) N
A _____________is an integer counter that represents how many variables reference
an object. When an object's reference count is 0, that object is no longer referenced. -
(correct answer) reference count
directs a program to execute either one group of statements or another, depending on
the result of an expression. - (correct answer) Branching
A ______ executes a block of code as long as the loop's expression is True. - (correct
answer) while loop
The syntax __________ produces a new string, which repeats the value of user_value 5
times. In this case, the value of user_value may be "-", thus the result of the
multiplication is "-----". - (correct answer) print(user_value*5)
generates a sequence of numbers, starting at zero and ending before a value given
inside the parentheses. For example, for i in range(3) sets i to 0 during the first iteration
of the for loop, i to 1 during the second iteration, and finally i to 2 on the third iteration.
The value within the parentheses is not included in the generated sequence. - (correct
answer) range()
A ____________ maps names to objects. The Python interpreter uses namespaces to
track all of the objects in a program. - (correct answer) namespace
In a program, an ______ consists of some internal data items plus operations that can
be performed on that data. - (correct answer) object
A ________ such as "20", "abcdef", or 55. - (correct answer) Value:
Find the element in list with the smallest value. - (correct answer) min(list)
Find the sum of all elements of a list (numbers only). - (correct answer) sum(list)
find the index of the first element in list whose value matches val. - (correct answer)
list.index(val)
,Count the number of occurrences of the value val in list. - (correct answer)
list.count(val)
Find the element in list with the largest value. - (correct answer) max(list)
A ,__________ also called an identifier, is a sequence of letters (a-z, A-Z, _) and digits
(0-9), and must start with a letter. Note that "_", called an underscore, is considered to
be a letter. - (correct answer) name
built-in function ___________ prints the type of an object. - (correct answer) type()
A unique identifier that describes the object - (correct answer) Identity:
O(n^2) A sort algorithm that repeatedly searches remaining items to find the least one
and moves it to its final location. - (correct answer) selection sort
Removes x Remove(list, 77), list: 99 - (correct answer) Remove(list, x)
Returns item if found, else returns null Search(list, 99), returns item 99Search(list, 22),
returns null - (correct answer) Search(list, x)
Prints list's items in orderPrint(list) outputs: 99, 77 - (correct answer) Print(list)
Sorts the lists items in ascending orderlist becomes: 77, 99 - (correct answer)
Sort(list)
Returns true if list has no items
For list 99, 77, IsEmpty(list) returns false - (correct answer) IsEmpty(list)
Returns the number of items in the listGetLength(list) returns 2 - (correct answer)
GetLength(list)
data structure that stores subitems, with a name associated with each subitem -
(correct answer) record
a data structure that stores an ordered list of items, with each item is directly accessible
by a positional index
homogeneous data elements Inserting at the beginning requires making room for the
new item. So every current item must be shifted once. - (correct answer) array
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 No shifting of other
items is required, which is an advantage of using linked lists. - (correct answer)
linked list
, 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 - (correct answer)
binary tree
data structure that stores *unordered* items by mapping (or hashing) each item to a
location in an array - (correct answer) hash table
a tree that maintains the simple property that a node's key is greater than or equal to the
node's childrens' keys - (correct answer) max-heap
a tree that maintains the simple property that a node's key is less than or equal to the
node's childrens' keys - (correct answer) min-heap
data structure for representing connections among items, and consists of vertices
connected by edges - (correct answer) graph
part of a graph the represents an item in a graph - (correct answer) vertice
part of a graph that represents a connection between to vertices in a graph - (correct
answer) edge
data type described by predefined user operations, such as "insert data at rear", without
indication how each operation is implemented - (correct answer) ADT (Abstract data
Type)
ADT for holding ordered data - (correct answer) list
ADT which items are only inserted on or removed from the top of a stack
LIFO - (correct answer) stack
ADT in which items are inserted at the end of the queue and removed from the front of
the queue
FIFO - (correct answer) Queue
ADT in which items can be removed at both the front and back - (correct answer)
deque ("deck")
ADT for stroing items in which the order does not matter and duplicate items are
allowed - (correct answer) Bag
ADT for collection of distinct items
