data-structures-stacks

Question 1

What does the acronym LIFO mean?

Answer 1

last-in-first-out

Question 2

What methods are available on a Stack data structure?

Answer 2

pop( ),push( ),peek( )

Question 3

What must you do to access the value at an arbitrary point in a stack (not just the “top”)?

Answer 3

a combination of pop, push and peek

Question 4

DATA STRUCTURES QUEUES

Answer 4

<>

Question 5

What does the acronym FIFO mean?

Answer 5

first in first out

Question 6

What methods are available on a Queue data structure?

Answer 6

enqueue( ), dequeue( ), peek( ), print( )

Question 7

What must you do to access the value at an arbitrary point in a queue (not just the “front”)?

Answer 7

combination of all the methods