Data Structures that aren't vectors

Question 1

What is a list?

Answer 1

Multiple elements of the same type
dynamic in size

add and remove from beginning and end as opposed to vectors which are primarily the end
Not indexed

Question 2

Create a list of cars and then print them all out

Answer 2

include <list></list>

list<string> cars = {"Volvo", "BMW", "Ford", "Mazda"};</string>

// Print list elements
for (string car : cars) {
cout &laquo_space;car &laquo_space;“\n”;
}

Question 3

Can you change the list type from string to something else after you’ve declared it?

Answer 3

No

Question 4

Show the first or last element of a list

Answer 4

cars.front();
cars.back();

Question 5

Change the first or last element of a list

Answer 5

cars.front() = “Ford”
cars.back() = “Mazda”

Question 6

Add elements to the front of a list
Add elements to the back of a list

Answer 6

cars.push_front(“Tesla”)
cars.push_back(“vw”)

Question 7

Remove elements from the front and then the back of a list

Answer 7

cars.pop_front()
cars.pop_back()

Question 8

Show how many elements a list has

Answer 8

cars.size()

Question 9

Find out if a list is empty of not

Answer 9

cars.empty()

Question 10

Loop through a list

Answer 10

list<string> cars = {"Volvo", "BMW", "Ford", "Mazda"};</string>

for (string car : cars) {
cout &laquo_space;car &laquo_space;“\n”;
}

Question 11

What is a c++ stack

Answer 11

LIFO order
Last in First out

Everything is added and removed from the top. So if you just added something and remove something, it will be what you just added.

Not indexed, you can only grab what’s on top

You can’t add elements to the stack at time of declaration like you can with vectors

Question 12

Create a stack of strings

Answer 12

include <stack></stack>

stack<string> cars;</string>

cars.push(“chevy”);

Question 13

Add elements to a stack

Answer 13

cars.push(“Volvo”)

Question 14

Access a stack element

Answer 14

cars.top() <- you can only look at the top element

Question 15

Change a stack element

Answer 15

cars.top() = “Tesla”

You can only modify the top

Question 16

Remove the last added element from the stack

Answer 16

cars.top()

Question 17

Show the size of the stack

Answer 17

cars.size()

Question 18

Check if the stack is empty

Answer 18

cars.empty()

Question 19

What is a queue

Answer 19

FIFO
Like a queue of people, first person in line is first to pay and leave.

Not indexed

You can only access an element at the front or back

Question 20

Create a queue

Answer 20

include <queue></queue>

queue<string> cars;</string>

data type can’t be changed
You have to wait until after it’s declared to add data

you have to push these as well

Question 21

Add an element to the end of your queue

Answer 21

cars.push(“Volvo”)

Question 22

Show the only queue elements you have access to see

Answer 22

cars.front()
cars.back()

Question 23

Chant the only two elements you can change in a queue

Answer 23

cars.front() = “Tesla”

cars.back() = “Mazda”

Question 24

How do you remove an element? What element gets removed?

Answer 24

cars.pop();

the oldest element. So the first one you made

Question 25

Show the size of your queue

Answer 25

cars.size()

Question 26

Check if the queue is empty

Answer 26

cars.empty()

Question 27

What is a deque

Answer 27

Double ended queue. More flexible queue. Elements can be added and removed from both ends. It's also indexed

Question 28

Create a deque Print all of its elements

Answer 28

#include deque cars = {"what", "ever"}; for (string car : cars) { cout << car << "\n"; } data type can't be changed after declared

Question 29

Show the first and second element of a deque

Answer 29

cars[0] cars[1] cars.at(0) cars.at(1)

Question 30

Access the first and last element of a deque

Answer 30

cars.front() cars.back()

Question 31

Change a deque element

Answer 31

cars[0] = "Opel" cars.at(0) = "Opel"

Question 32

Add elements either to the front or the back of a deque and then remove them

Answer 32

cars.push_front("Tesla") cars.push_back("VW") cars.pop_front() cars.pop_back()

Question 33

Show deque size

Answer 33

cars.size()

Question 34

Check if deque is empty

Answer 34

cars.empty()

Question 35

Loop through a deque

Answer 35

deque cars = {"Volvo", "BMW", "Ford", "Mazda"}; for (int i = 0; i < cars.size(); i++) { cout << cars[i] << "\n"; } OR deque cars = {"Volvo", "BMW", "Ford", "Mazda"}; for (string car : cars) { cout << car << "\n"; }