Leaves_Ga-Young

[gyjin]

Stacks and Queues

Thanks for doing some brain yoga. You are now submitting this assignment!

Comprehension Questions

Question	Answer
What is an ADT?	an object that is described by its method and how it performs
Describe a Stack	a data structure that stores data in a LIFO format, such as a stack of plates
What are the 5 methods in Stack and what does each do?	initialize: start a new stack. push: add data to the top of the stack. pop: remove data from the top of the stack. empty?: returns whether the stack is empty of data. to_s: returns the stack data in a string form
Describe a Queue	a data structure that stores data in a FIFO format, such as a line of customers waiting to check out
What is the difference between implementing something and using something?	a user does not need to know how a data structure is implemented. a data structure can be implemented in different ways. however, using that data structure will appear the same to the user.
When is a circular buffer advantageous over a dynamic array or LinkedList?	when time and space complexities need to be more efficient, using a circular buffer is better.