Data Structure Flashcards Preview

Web Development > Data Structure > Flashcards

Flashcards in Data Structure Deck (6)
Loading flashcards...
1

What does the acronym LIFO mean?

last-in-first-out (LIFO) operations: the last thing pushed onto the stack is the first thing that can be popped out.

2

What methods are available on a Stack data structure?

push, pop, peek.

3

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

Keep popping until you get to the point you want.

4

What does the acronym FIFO mean?

first-in-first-out (FIFO) operations: the last thing enqueued onto the queue is the first thing that can be dequeued out.

5

What methods are available on a Queue data structure?

enqueue(value) - adds a value to the "back" of the queue

dequeue( ) - removes the "front" value from the queue and returns it

peek( )

6

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

Keep dequeue-ing