C949 DATA STRUCTURES AND ALGORITHMS
PREASSESSMENT - MULTIPLE CHOICE
D - Answers- 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.
B - Answers- Which data structure allows inserting and deleting data elements at both
the front and the rear?
A.) Trees
B.) Deques
C.) Stacks
D.) Queues
C - Answers- 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
A - Answers- 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
A - Answers- 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
,C - Answers- Which data structure allows insertion and removal from only one end of
the data structure?
A.) List
B.) Queue
C.) Stack
D.) Deque
B - Answers- 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
C - Answers- 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
D - Answers- 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
A - Answers- Which data type is appropriate for the given data set?
a = [1, 717, 23, 12, 314, 6]
A.) Int
B.) Byte
C.) Char
D.) Boolean
, B - Answers- Which data type should be used for this object?
days = { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday",
"Saturday"}
A.) Float
B.) String
C.) Integer
D.) Boolean
C - Answers- 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
C - Answers- 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
A - Answers- Which value is appropriate for Test1 given the expression?
char Test1;
A.) 'L'
B.) 77
C.) 6.5
PREASSESSMENT - MULTIPLE CHOICE
D - Answers- 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.
B - Answers- Which data structure allows inserting and deleting data elements at both
the front and the rear?
A.) Trees
B.) Deques
C.) Stacks
D.) Queues
C - Answers- 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
A - Answers- 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
A - Answers- 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
,C - Answers- Which data structure allows insertion and removal from only one end of
the data structure?
A.) List
B.) Queue
C.) Stack
D.) Deque
B - Answers- 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
C - Answers- 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
D - Answers- 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
A - Answers- Which data type is appropriate for the given data set?
a = [1, 717, 23, 12, 314, 6]
A.) Int
B.) Byte
C.) Char
D.) Boolean
, B - Answers- Which data type should be used for this object?
days = { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday",
"Saturday"}
A.) Float
B.) String
C.) Integer
D.) Boolean
C - Answers- 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
C - Answers- 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
A - Answers- Which value is appropriate for Test1 given the expression?
char Test1;
A.) 'L'
B.) 77
C.) 6.5
