Branches - Amal

[ashassan]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	ADT is a type of object which is described by the methods it has and how they perform
Describe a Stack	stacks store a list of data but only provides access in last-in-first-out order.
What are the 5 methods in Stack and what does each do?	initialize creates a new instance of stack. The pop method puts an item at the top of the stack. The pop method removes the top item of the stack and returns it. The method is_true returns a boolean depending on if it is empty.
Describe a Queue	stores data but only provides access in first-in-first-out order
What is the difference between implementing something and using something?	you need to implement something before it can be used
When is a circular buffer advantageous over a dynamic array or LinkedList?

[CheezItMan]

Your Stack class works, but Queue has some serious issues. Take a look at my comments and let me know what questions you have.

[CheezItMan]

I suggest making this an elsif otherwise front and back will have an extra space between them due to the fact that the 1st if sets back at 1.

Suggested change

	end
	if @front == @back
	raise ArgumenetError
	end
	@back = 0
	elsif @front == @back
	raise ArgumentError, "Queue is full"
	end

[CheezItMan]

Suggested change

	raise ArgumenetError
	raise ArgumentError, "Queue is Empty"

[CheezItMan]

The queue won't be empty until you remove an element and advance @front

[CheezItMan]

After this line is where you should check to see if the queue is empty.

[CheezItMan]

Suggested change

	return true if @front = -1 && @back - 1
	return @front = -1 && @back == - 1

[CheezItMan]

This doesn't work, and assumes that @front < @back.