Download WGU C949 - DATA STRUCTURES AND ALGORITHMS EXAM | OBJECTIVE ASSESSMENT and more Exams Nursing in PDF only on Docsity!
WGU C949 - DATA STRUCTURES AND
ALGORITHMS EXAM | OBJECTIVE
ASSESSMENT WITH COMPLETE QUESTIONS
AND CORRECT DETAILED ANSWERS (VERIFIED
ANSWERS) GRADED A+
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:
"cat" "dog" What is the return value of the pop operation? "bird" How many times will count++ execute when i = 3, in this pseudocode? int count = 0; int N = 4; for (int i = 0; i < N; i++) for (int j = 0; j < i; j++) count++; 3 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.
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 s.push(4), q.push(4), and p.push(4) are executed. What is the triple (s.pop(), q.pop(), p.pop())? (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 will insert object x at position index in a list? Add(int index, Object x) Which command will return true if x is in a list, otherwise return false? Contains(Object x) When should a dictionary be used instead of a list? When the program uses key-value pairs as its data Which data structure is indexed? Array Which data structure may only store homogeneous data elements? Arrays
Which data structure uses a last in, first out (LIFO) removal of items? Stack Given: heapList = [22, 33, 44, 55, 66] Which index is the right child of item 22? 44 What is the logical first step in an algorithm that extracts all the positive values from a given list of numbers? Initialize the result to an empty list What is displayed when n = 2 in this pseudocode? for(int i = 2; i <= n; i++){ for(j = 0; j <= n;){ display j;
Subprogram Sub(Integer Num1, Integer Num2 as Reference) Declare X as Integer Set Num1 = 3 Set Num2 = 4 Set X = 5 Write X End Subprogram 5 14 How many times in this pseudocode is the function F called? Main Declare K as Integer K = 3 Set Result = F(K) Write Result End Program Function F(N) as Integer
If N == 1 Then Set F = 1 Else Set F = N * F(N - 1) Set N = N - 1 End If End Function 3 What is displayed in Step 5 if A = 15 and B = 5 in the pseudocode below? Step 1: Start Step 2: Read A, B Step 3: C= A*B Step 4: D=A/B Step5: Print C Step 6: Stop 75
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), datetime.date(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' At the end of obj, what is the time complexity of inserting in this pseudocode? void DynamicArrayAppend(DynamicArray obj, const void input) { if (obj->logicalSize == obj->capacity - 1) {
return cSum; } O(n) What is the time complexity of the instructions in this pseudocode? for (i = 0; i < N; i++){ for (j = i+1; j < N; j++) { ... // sequence of statements that do not alter N } } O(N^2) What is the time complexity of this pseudocode? Algorithm Algo1(A) Input: An array A storing n ≥ 1 integers Output: The sum of the elements in A
s=A[1] for i=1 to n do s=s+A[i] return s O(n) What is the time complexity of this pseudocode? Algorithm Algo3(A, B) Input: Arrays A and B, each of them storing n≥1 integers Output: Count array B[i], where B[i] equals the sum of A[1] to A[i], i= to n c= for i=1 to n do for j=1 to n do s=A[1] for k=1 to j do s=s+A[k] if B[i]=s then c=c+
