Water - Beatrice

[Beatress]

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 is a data type that hides its internal working through encapsulation. It is often based off of primitive datatypes
Describe a Stack	A stock is like a pile of books that can only be manipulated from the top. It operates on a last in first out model
What are the 5 methods in Stack and what does each do?	Push puts an item on the top of the stack. Pop takes an item and returns it off the top of the stack. Then there is a method to check if the stack is empty
Describe a Queue	A queue is like a line of people. Items are added to the back and leave from the front. This means that it operates on a first in first out model
What are the 5 methods in Queue and what does each do?	A queue has methods to enqueue, putting an element at the end, dequeue, taking an element from the beginning of the queue, check if it is empty, peek at the first element, and return the length
What is the difference between implementing something and using something?	When you implement something you have to be concerned with all of the details, but when you use something you just have to worry about how it is used

OPTIONAL JobSimulation

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

[CheezItMan]

Nice work Beatrice, you hit the main learning goals here. Well done.

[CheezItMan]

This defeats the circular nature of the list, so that you can work with a fixed size, but it does let you resize the buffer.

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

Size should be the number of elements in the queue not the size of the underlying buffer.

[CheezItMan]

What if @back < @front

[CheezItMan]

👍