Fire - Ida

[idago123]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	A type of object which is described by the methods it has and how they perform.
Describe a Stack	A data structure which stores a list of data and only provides access in a last in first out order.
What are the 5 methods in Stack and what does each do?	push - adds an element to the end of the stackpop - removes and returns the item on the top of the stack.is_empty - checks if a stack is empty
Describe a Queue	A data structure which stores a list of data and provides access in a first in first out order
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, is_empty - returns true if queue is empty, false if it isn't
What is the difference between implementing something and using something?

OPTIONAL JobSimulation

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

[CheezItMan]

Nice work Ida, I had a few comments on the Queue. Take a look at my comments and let me know what questions you have.

[CheezItMan]

This could be added to .gitignore

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

This will let front wrap around without having to make the elif-else.

Suggested change

	elsif (@front == @size-1)
	@front = 0
	else
	@front = @front + 1
	end
	else
	@front = (@front + 1) % @store.length
	end

[CheezItMan]

This lets the rear wrap around

Suggested change

	@rear += 1
	@queue[@rear] = element
	@rear = (@rear + 1) % @store.length
	@queue[@rear] = element