QUESTION 1

In the ourvector implementation, the [] method and the at method have the exact same functionality.

True

False

5 points

QUESTION 2

What ADTs have the fastest search/lookup capabilties?

		Map
		Dynamic array
		Queue
		Set
		Stack

10 points

QUESTION 3

Click all ADTs below that do not allow looping through each element.

		map
		set
		dynamic array
		stack
		queue

10 points

QUESTION 4

A stringstream can be used to convert a string to a series of different variables including variables of a different type.

		True
		False

10 points

QUESTION 5

Which of the following are potential/possible implementations of a stack? (which of the following below could implement a stack)

		queue
		linked list
		array
		deque

10 points

QUESTION 6

What data structure is used to implement the ourvector class?

		deque
		linked list
		stack
		array

10 points

QUESTION 7

A stack is an ADT in which items are inserted at the end of the stack and removed from the front of the stack.

True

False

5 points

QUESTION 8

Which ADTs maintain the order which elements are inserted?

		Queue
		Set
		Map
		Dynamic Array
		Stack

10 points

QUESTION 9

Which is NOT an example of an abstract data type (ADT)?

	A.	Stack
	B.	Integer
	C.	Queue
	D.	Vector

5 points

QUESTION 10

Match the ADT with its behavior.

- A. B. C. D.

Stack

A.	Last-In-First-Out (LIFO) structure

- A. B. C. D.

Queue

B.	Collection of pairs (k, v), where v can be found quickly if you know k.

- A. B. C. D.

Set

C.	First-In-First-Out (FIFO) structure

- A. B. C. D.

Map

D.	An unordered collection of distinct elements.