Data Structure Flashcards Preview

Web Development > Data Structure > Flashcards

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

What does the acronym LIFO mean?

A

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

2
Q

What methods are available on a Stack data structure?

A

push, pop, peek.

3
Q

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

A

Keep popping until you get to the point you want.

4
Q

What does the acronym FIFO mean?

A

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

5
Q

What methods are available on a Queue data structure?

A

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

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

peek( )

6
Q

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

A

Keep dequeue-ing