1
Q
What does the acronym LIFO mean?
A
last in first 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
pop until…
4
Q
What does the acronym FIFO mean?
A
first in first out
5
Q
What methods are available on a Queue data structure?
A
enqueue(), dequeue(), peek()
6
Q
What must you do to access the value at an arbitrary point in a queue (not just the “front”)?
A
dequeue until…
7
Q
How are linked lists different from an array?
A
sequential access
8
Q
How would you access an arbitrary node in a linked list (not just the “head”)?
A
list.next(.next.next).data
Web Development
flashcards
Decks in class (12)
# Cards
