Kristy, Branches

[kristyh32]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	An ADT is an abstract data type
Describe a Stack	A stack is a LIFO abstract data structure
What are the 5 methods in Stack and what does each do?	Initialize makes a new stack with an empty linked list, push adds a new item onto the stack, pop takes the top item off the list, empty tells you whether the stack has anything in it, and to_s prints out what's int the stack
Describe a Queue	A queue is a FIFO abstract data structure
What are the 5 methods in Queue and what does each do?	enqueue adds to the back of the queue, dequeue takes the item from the front of the queue, size tells you how many items are in the queue, and front tells you what the item at the front of the queue is without taking it off
What is the difference between implementing something and using something?	If you implement something you're putting the pieces of it in place/setting it up. Using it is using it.

OPTIONAL JobSimulation

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

[CheezItMan]

Some issues with your Queue class. Take a look at my comments and let me know if you have questions. Other than that this works.

[CheezItMan]

👍

[CheezItMan]

This part works better as an elsif to raise an error if the queue is full. You're not doing anything here.

[CheezItMan]

You also need to check if the queue is empty before and after you dequeue an element.

[CheezItMan]

This works, but it's quite expensive O(n) for both space and time and you lose some of the benefits of the circular buffer.

[CheezItMan]

Why the conditional? Why not just return @store.compact.empty?

Oh and like the previous method, this becomes very expensive.

[CheezItMan]

This mostly works, but if back < front, the order of materials in the queue won't be maintained.