Data Structures I

Question 1

Which statement describes a queue data structure?

Answer 1

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.

Question 2

Which data structure allows inserting and deleting data elements at both the front and the rear?

Answer 2

Deques

Question 3

Which data structure allows elements to be inserted and deleted from one end and provides no direct access to the other end?

Answer 3

Stack

Question 4

What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10};

Answer 4

0, 1, 2, 3, 4, 5

Question 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 5

List

Question 6

Which data structure allows insertion and removal from only one end of the data structure?

Answer 6

Stack

Question 7

Which data type does the mystery function return?
return_type mystery (int R)
{
int NumUnits = R;return NumUnits * 3.14;
}

Answer 7

Double

Question 8

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))

Answer 8

Tuple

Question 9

Which value is appropriate for Test1 given the expression?

char Test1;

Answer 9

‘L’

Question 10

Which value is appropriate for the variable middle given the pseudocode?
function mystery()
{
string last;
string first;
char middle;
int phone;
float rate;
}

Answer 10

‘D’