Ren - Fire

[RenCarothers]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	Abstract Data Type - describes the actions that the data type can preform, the details of which are hidden from the public user.
Describe a Stack	A type of ADT that stores data in LIFO order (last in first out).
What are the 5 methods in Stack and what does each do?	Push - adds to the top of the stack; pop - pops off the top element in the stack; is_empty - returns true if empty, top - displays top element without popping; size - returns size of stack (number of elements)
Describe a Queue	A type of ADT that stores data in a first in first out order, much like a checkout line in a grocery store.
What are the 5 methods in Queue and what does each do?	Enqueue - adds element to the back of the queue; dequeue - removes element from the front of the queue; is_empty - returns true if the queue is empty; front - displays element at the front without dequeuing; size - returns the number of elements in the queue.
What is the difference between implementing something and using something?	In the case of ADTs, using one doesn't require that you know how to implement it, for instance, someone might utilize a queue in their code without knowing how the queue works behind the scenes.

OPTIONAL JobSimulation

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

[CheezItMan]

Nice work Ren, this hits all the learning goals. I had a few comments on the Queue class, but otherwise this is quite well done.

[CheezItMan]

I think you need to do @back += 1 after the @store[@back] = element because otherwise you could add 1 element and front = back = 0 and then self.empty? would still be true.

[CheezItMan]

👍

[CheezItMan]

⚠️ I don't think this works in all cases

[CheezItMan]

👍