WGU C949 Data Structures and Algorithms| OA |
Objective Assessment | Actual Questions and
Answers Latest Updated (Graded A+)
Correct
100%
Incorrect
WGU C949 Data Structures and Algorithms| Objective Assessment
1 of 69
Term
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))
Give this one a try later!
, Tree Hash(object)
Truncate Tuple
Don't know?
2 of 69
Term
What is the effect on the object Computing regarding garbage
collection?
Computing obj = new Computing(); obj = null;
Give this one a try later!
It is automatically available for
It is moved to a cache for later use.
garbage collection.
It is immediately destroyed. It remains in memory indefinitely.
Don't know?
3 of 69
Term
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'
'sausage''toast''eggs''ham''bacon'
'sausage''toast''eggs''bacon''ham'
'sausage''bacon''toast''eggs''ham'
Give this one a try later!
['red','blue','yellow', 'green', 'purple"] Initialize the result to an empty list
"bird" 'bacon''sausage''toast''eggs''ham'
Don't know?
4 of 69
Term
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']
, ['blue','yellow', 'green']
['red','blue','yellow', 'green', 'purple"]
['purple', 'red','blue','yellow', 'green']
Give this one a try later!
Bubble Java.io.FileInputStream
['red','blue','yellow', 'green', Checking that the list contains at least
'purple"] one number
Don't know?
5 of 69
Term
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)
O(N2)
O(log N)
O(N log N)
Objective Assessment | Actual Questions and
Answers Latest Updated (Graded A+)
Correct
100%
Incorrect
WGU C949 Data Structures and Algorithms| Objective Assessment
1 of 69
Term
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))
Give this one a try later!
, Tree Hash(object)
Truncate Tuple
Don't know?
2 of 69
Term
What is the effect on the object Computing regarding garbage
collection?
Computing obj = new Computing(); obj = null;
Give this one a try later!
It is automatically available for
It is moved to a cache for later use.
garbage collection.
It is immediately destroyed. It remains in memory indefinitely.
Don't know?
3 of 69
Term
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'
'sausage''toast''eggs''ham''bacon'
'sausage''toast''eggs''bacon''ham'
'sausage''bacon''toast''eggs''ham'
Give this one a try later!
['red','blue','yellow', 'green', 'purple"] Initialize the result to an empty list
"bird" 'bacon''sausage''toast''eggs''ham'
Don't know?
4 of 69
Term
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']
, ['blue','yellow', 'green']
['red','blue','yellow', 'green', 'purple"]
['purple', 'red','blue','yellow', 'green']
Give this one a try later!
Bubble Java.io.FileInputStream
['red','blue','yellow', 'green', Checking that the list contains at least
'purple"] one number
Don't know?
5 of 69
Term
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)
O(N2)
O(log N)
O(N log N)
