C949 WGU
Study online at https://quizlet.com/_a90h5t
1. inserting a new what is an advantage of a linked list over an array?n
item at the begin-
ning it causes no
shift to the data
2. N In the worst case, inserting a new node into a tree with N nodes requires how
many comparisons?
3. reference count A _____________is an integer counter that represents how many variables ref-
erence an object. When an object's reference count is 0, that object is no longer
referenced.
4. Branching directs a program to execute either one group of statements or another, depend-
ing on the result of an expression.
5. while loop A ______ executes a block of code as long as the loop's expression is True.
6. print(user_val- The syntax __________ produces a new string, which repeats the value of
ue*5) user_value 5 times. In this case, the value of user_value may be "-", thus the result
of the multiplication is "-----".
7. range() 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.
8. namespace A ____________ maps names to objects. The Python interpreter uses name-
spaces to track all of the objects in a program.
9. object In a program, an ______ consists of some internal data items plus operations that
can be performed on that data.
10. Value: A ________ such as "20", "abcdef", or 55.
, C949 WGU
Study online at https://quizlet.com/_a90h5t
11. min(list) Find the element in list with the smallest value.
12. sum(list) Find the sum of all elements of a list (numbers only).
13. list.index(val) find the index of the first element in list whose value matches val.
14. list.count(val) Count the number of occurrences of the value val in list.
15. max(list) Find the element in list with the largest value.
16. name 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.
17. type() built-in function ___________ prints the type of an object.
18. Identity: A unique identifier that describes the object
19. selection sort O(n^2) A sort algorithm that repeatedly searches remaining items to find the least
one and moves it to its final location.
20. Remove(list, x) Removes x Remove(list, 77), list: 99
21. Search(list, x) Returns item if found, else returns null Search(list, 99), returns item 99Search(list,
22), returns null
22. Print(list) Prints list's items in orderPrint(list) outputs: 99, 77
23. Sort(list) Sorts the lists items in ascending orderlist becomes: 77, 99
24. IsEmpty(list) Returns true if list has no items
For list 99, 77, IsEmpty(list) returns false
25. GetLength(list) Returns the number of items in the listGetLength(list) returns 2
, C949 WGU
Study online at https://quizlet.com/_a90h5t
26. record data structure that stores subitems, with a name associated with each subitem
27. array 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.
28. linked list 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.
29. binary tree 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
30. hash table data structure that stores *unordered* items by mapping (or hashing) each item
to a location in an array
31. max-heap a tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys
32. min-heap a tree that maintains the simple property that a node's key is less than or equal to
the node's childrens' keys
33. graph data structure for representing connections among items, and consists of vertices
connected by edges
34. vertice part of a graph the represents an item in a graph
35. edge part of a graph that represents a connection between to vertices in a graph
36.
Study online at https://quizlet.com/_a90h5t
1. inserting a new what is an advantage of a linked list over an array?n
item at the begin-
ning it causes no
shift to the data
2. N In the worst case, inserting a new node into a tree with N nodes requires how
many comparisons?
3. reference count A _____________is an integer counter that represents how many variables ref-
erence an object. When an object's reference count is 0, that object is no longer
referenced.
4. Branching directs a program to execute either one group of statements or another, depend-
ing on the result of an expression.
5. while loop A ______ executes a block of code as long as the loop's expression is True.
6. print(user_val- The syntax __________ produces a new string, which repeats the value of
ue*5) user_value 5 times. In this case, the value of user_value may be "-", thus the result
of the multiplication is "-----".
7. range() 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.
8. namespace A ____________ maps names to objects. The Python interpreter uses name-
spaces to track all of the objects in a program.
9. object In a program, an ______ consists of some internal data items plus operations that
can be performed on that data.
10. Value: A ________ such as "20", "abcdef", or 55.
, C949 WGU
Study online at https://quizlet.com/_a90h5t
11. min(list) Find the element in list with the smallest value.
12. sum(list) Find the sum of all elements of a list (numbers only).
13. list.index(val) find the index of the first element in list whose value matches val.
14. list.count(val) Count the number of occurrences of the value val in list.
15. max(list) Find the element in list with the largest value.
16. name 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.
17. type() built-in function ___________ prints the type of an object.
18. Identity: A unique identifier that describes the object
19. selection sort O(n^2) A sort algorithm that repeatedly searches remaining items to find the least
one and moves it to its final location.
20. Remove(list, x) Removes x Remove(list, 77), list: 99
21. Search(list, x) Returns item if found, else returns null Search(list, 99), returns item 99Search(list,
22), returns null
22. Print(list) Prints list's items in orderPrint(list) outputs: 99, 77
23. Sort(list) Sorts the lists items in ascending orderlist becomes: 77, 99
24. IsEmpty(list) Returns true if list has no items
For list 99, 77, IsEmpty(list) returns false
25. GetLength(list) Returns the number of items in the listGetLength(list) returns 2
, C949 WGU
Study online at https://quizlet.com/_a90h5t
26. record data structure that stores subitems, with a name associated with each subitem
27. array 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.
28. linked list 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.
29. binary tree 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
30. hash table data structure that stores *unordered* items by mapping (or hashing) each item
to a location in an array
31. max-heap a tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys
32. min-heap a tree that maintains the simple property that a node's key is less than or equal to
the node's childrens' keys
33. graph data structure for representing connections among items, and consists of vertices
connected by edges
34. vertice part of a graph the represents an item in a graph
35. edge part of a graph that represents a connection between to vertices in a graph
36.
