Data structures - just definitions

Question 1

What is a list
Can you create your list on the same line you declare it?

Answer 1

Add remove from beginning or end

No index

front()
back()

YES

Question 2

What is a stack
Can you create your list on the same line you declare it?

Answer 2

LIFO
.push()
.top()

Not indexed

NO

Question 3

What is a queue

Can you create your list on the same line you declare it?

Answer 3

FIFO
Not indexed
.push()
.front()
.back()
.pop()

NO

Question 4

What is a deque

Can you create your list on the same line you declare it?

Answer 4

Can add and remove from both ends
indexed
push_front()
push_back()
cars.at(2) = “thing”
insert here as well
YES

Question 5

What is a set

Can you create your list on the same line you declare it?

Answer 5

No repeated keys
Not indexed
Ascending order
1234
abcde
.insert()
.erase()

YES

Question 6

What is a map

Can you create your list on the same line you declare it?

Answer 6

Dictionary

people[‘jenny’] = 22;
people.insert({‘jenny’, 22})

Question 7

What is a vector

Can you create your list on the same line you declare it?

Answer 7

Indexed
dynamic

YES

Question 8

What data structures can your create on the same line that you declare them?

Answer 8

list, deque, set, map, vector

Question 9

What data structures do you have to declare before adding elements?

Answer 9

stack, queue

Question 10

What data structures do you have to use .push() with and which one can you choose to use it with

Answer 10

stack, queue, vector (vector has a push and an insert for the front)
deque

Question 11

What data structures are indexed?

Answer 11

vector
deque

Question 12

What data structures are not indexed

Answer 12

list
stack
queue
set
map