C949- Data Structures and Algorithms I, C949 WGU

Which statement describes a queue data structure? - Answer- 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}; - Answer- 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? - Answer- 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)) - Answer- Tuple Which data type does the mystery function return? return_type mystery (int R) { int NumUnits = R;return NumUnits * 3.14; } - Answer- Double Which value is appropriate for the variable middle given the pseudocode? function mystery() { string last; string first; char middle; int phone; float rate; } - Answer- '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] - Answer- Array What is true about garbage collection? - Answer- It reclaims memory from data structures implemented using linked allocations. What is true about a data structure implemented using linked allocation? - Answer- 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 it