vi

[criacuervos]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	an abstract data type, which is defined by its behavior (what it does) rather than how it is written (implementation)
Describe a Stack	a data structure that stores a list of data and only allows access in a LIFO manner
What are the 5 methods in Stack and what does each do?	push puts an item on the top, pop removes and returns the item that was on top, is_empty returns true if the stack is empty, peek returns (without removing) the top item on the stack, and size returns the number of items in the stack.
Describe a Queue	a data structure that stores a list of data and allows access in a FIFO, first in first out, manner
What are the 5 methods in Queue and what does each do?	enqueue adds a value to the back of a queue, dequeue removes and returns the value from the front, is_empty returns true if empty, front returns the value at the start of a queue, and size returns the total amount of items in the queue
What is the difference between implementing something and using something?	when you implement something you've got to know intricately how it works; say we're implementing a linked list. a part of doing that is knowing how a linked list works, writes to memory, stores data. however, if we were using a method to for example, add a data to a list, we often don't need to even know the data structure involved in doing that.

OPTIONAL JobSimulation

Question	Answer
Did you include a sample run of your code as a comment?

[CheezItMan]

Well Stack is working and what you have in Queue is pretty well done, but several methods are not implemented further. Not bad, but there is more to do.

[CheezItMan]

Since you're going to advance @back one step later in this method better to set it to 0

[CheezItMan]

Other methods are missing here.