C949- Data Structures and Algorithms I, C949 WGU questions and answers

Which statement describes a queue data structure? It is a sequence of elements in which insertions can take place only at the back end and deletions can take place only at the front end. What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; 0, 1, 2, 3, 4, 5 Which abstract data type (ADT) has elements of the same type so that the elements can be retrieved based on the index or position? List Which category of data does ("FB", 75.00, 75.03, 74.90) represent in the pseudocode? import datetime def middle(stock, date): symbol, current, high, low = stock return (((high + low) / 2), date) mid_value, date = middle(("FB", 75.00, 75.03, 74.90), (2014, 10, 31)) Tuple Which data type does the mystery function return? return_type mystery (int R) { int NumUnits = R;return NumUnits * 3.14; } Double Which value is appropriate for the variable middle given the pseudocode? function mystery() { string last; string first; char middle; int phone; float rate; } 'D' What is the most efficient data type to use for this data set of a fixed size in Java? a = [0, 0, 1, 4, 7, 16, 31, 64, 127] Array What is true about garbage collection? It reclaims memory from data structures implemented using linked allocations. What is true about a data structure implemented using linked allocation? Storage is allocated using pointers to new locations as needed. What are the array elements corresponding to the mid-values in the first and second iterations of a binary search in an array arr = {45, 77, 89, 90, 94, 99, 100} and key = 100? 90 and 99 What is the effect on the object Computing regarding garbage collection? Computing obj = new Computing(); obj = null; It is automatically available for garbage collection. What are the mid-values in the first and second levels of recursion in this binary search? int arr = {46, 76, 89, 90, 94, 99, 100} and key = 99 90 and 99 Which data set is represented using the dictionary data type? A set of students and their test scores What is a characteristic of keys in an associative dictionary data type? They are unique and immutable. Which method can be used to take a value out of a dictionary? D1[key].remove(value) Given this data dictionary in Python: dict = {'white':0x0000, 'black':0x1111} Which command/function generates the output ['white','black']? () Items were added sequentially in this stack starting with 'ham': 'sausage' 'toast' 'eggs' 'ham' What is the correct order of contents after the push operation is performed with the value 'bacon'? 'bacon' 'sausage' 'toast' 'eggs' 'ham' Items were added sequentially in this stack starting with "dog": "bird" "rabbit" "cat" "dog" What is the return value of the pop operation? "bird" Which sequence of letters represents preorder traversal of the nodes of this tree? A / B C / / D E / F G H / I A B C D F E G I H An array soc of size 1009 is used where the index is an integer in [0,1008] and the hash-function key%1009. Where will the data associated with the key given by the last 4 social security digits '2023' be stored? In soc[5] A stack s, a queue q, and a max value priority queue p each have a single 3 in them. Next (4), (4), and (4) are executed. What is the triple ((), (), ())? (4,3,4) This stack reads left to right with the top to the right: 'green' 'yellow' 'blue' 'red' What could be the stack after a push operation? ['red','blue','yellow', 'green', 'purple"] Items were added sequentially onto the stack starting with 'red': 'green' 'yellow' 'blue' 'red' What is the stack after a pop operation? 'yellow' 'blue' 'red' Which command helps to speed up comparisons using dictionary keys during a dictionary (d) lookup in this pseudocode clip? h = hash(key) for pair in d: if h == pair[0]: return pair[1] hash(object)