Flashcards on F453 Data Structures - Stacks and Queues, created by harvs899 on 05/02/2014.
|
Created by harvs899
over 11 years ago
|
|
Close
|
|
Created by harvs899
over 11 years ago
|
|
What is a static data structure?
What is a dynamic data structure?
What is a LIFO data structure?
What is a FIFO data structure?
How is the location of the top of a stack kept track of?
In a queue how many pointers are there and what are they?
Are items actually deleted from the stack? If not what happens instead?
If you add an item to a stack you _____ the item on to it.
If you remove an item from a stack you ____ an item off of it.
What happens if the stack gets too large?
What is a stack underflow?
In a queue what does it mean when the front and back pointers are in the same location?
What is the algorithm for pushing on to a stack?
What is the algorithm for popping off of a stack?
Where is an item removed from a queue?
Where is an item added to a queue?
What are the advantages of a static data structure?
What are the disadvantages of a static data structure?
What are the advantages of a dynamic data structure?
What are the disadvantages of a dynamic structure?
What is the algorithm to enqueue an item?
What is the algorithm to dequeue an item?
