Earth - Kal

[kashenafi]

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 an object that is defined by its methods--the actual implementation is hidden to the public user.
Describe a Stack	An ABT that stores data in a LIFO order
What are the 5 methods in Stack and what does each do?	pop: removes and returns the item on the top of the stack; push: pushes an item to the top of the stack; peek: returns the item at the top of the stack (but does not remove); is_empty: returns true if the stack is empty, false otherwise; size: returns the number of items on the stack
Describe a Queue	An ABT that stores data in a FIFO order
What are the 5 methods in Queue and what does each do?	enqueue: puts an item to the back of the queue; dequeue: removes and returns the item at the front of the queue; front: returns the item at the front of the queue (but does not remove); is_empty: returns true if the queue is empty, false otherwise; size: returns the number of items in the queue
What is the difference between implementing something and using something?	Implementing something is when you build something and use it strategic to how you want things done--using it is just using something that is made.

OPTIONAL JobSimulation

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

[CheezItMan]

Nice work Kal, well done. You hit the learning goals here.

[CheezItMan]

This could also be written as:

Suggested change

	elsif @back == (MAX_SIZE - 1) && @front != 0
	@back = 0
	else
	@back += 1
	end
	else
	@back = (@back + 1) % MAX_SIZE
	end

[CheezItMan]

Just a note that this could be updated similar to what I mentioned in enqueue.

[CheezItMan]

👍