Page 1 of 80
WGU C949 DATA STRUCTURES AND ALGORITHMS I OBJECTIVE
ASSESSMENT EXAM ACTUAL EXAM AND STUDY GUIDE LATEST
2024-2025 COMPLETE 350 QUESTIONS AND CORRECT
ANSWERS ALREADY GRADED A+
WGU C949 DATA STRUCTURES AND ALGORITHMS I OBJECTIVE ASSESSMENT ACTUAL EXAM
Which abstract data type (ADT) has elements of the same type so that the elements can be
retrieved based on the index or position?
A.) List
B.) Bag
C.) Stack
D.) Queue
List
Which data structure allows insertion and removal from only one end of the data structure?
A.) List
B.) Queue
C.) Stack
D.) Deque
Stack
Which data type does the mystery function return?return_type mystery (int R)
{
int NumUnits = R;
return NumUnits * 3.14;
}
A.) Byte
B.) String
C.) Double
D.) Boolean
Double
1
,Page 2 of 80
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))
A.) List
B.) Float
C.) Tuple
D.) Operator
Tuple
Which value is appropriate for Test1 given the expression?
char Test1;
A.) 'L'
B.) 77
C.) 6.5
D.) "value"
'L'
Which value is appropriate for the variable middle given the pseudocode?
function mystery()
{
string last;
string first;
char middle;
int phone;
float rate;
}
A.) 'D'
B.) 'Da'
2
,Page 3 of 80
C.) "david"
D.) "David"
'D'
Which type of operation is represented in the pseudocode?
int x,y,z;
x=y=z=100;
A.) Ternary
B.) Assignment
C.) Comparison
D.) Equality
Assignment
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]
A.) List
B.) Tuple
C.) Array
D.) Dictionary
Array
Which statement describes a queue data structure?
A.) It is a sequence of elements in which insertion and deletion takes place at one end.
B.) It is a sequence of elements in which insertion and deletion takes place at both ends.
C.) It is a sequence of elements in which insertion can take place anywhere in the sequence
and deletion takes place only at the front.
D.) 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.
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.
Which data structure allows inserting and deleting data elements at both the front and the
rear?
3
, Page 4 of 80
A.) Trees
B.) Deques
C.) Stacks
D.) Queues
Deques
Which data structure allows elements to be inserted and deleted from one end and provides
no direct access to the other end?
A.) List
B.) Deque
C.) Stack
D.) Queue
Stack
What are the official indexes for the list list01 given this declaration?
int[ ] list01 = {0, 2, 4, 6, 8, 10};
A.) 0, 1, 2, 3, 4, 5
B.) 0, 2, 4, 6, 8, 10
C.) 1, 2, 3, 4, 5, 6
D.) 2, 4, 6, 8, 10, 12
0, 1, 2, 3, 4, 5
Which data type is appropriate for this array to store the given data?
a = ["AF", "71", "BC", "157", "BA", "253"]
A.) Byte
B.) Char
C.) Short
D.) String
String
Which data type is appropriate for the given data set?
a = [1, 717, 23, 12, 314, 6]
4
