Earth - Beauttie

[beauttie]

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 type of object described by its methods and their performance/behavior.
Describe a Stack	A stack is a data structure that stores a list of data and provides access to it in Last-In-First-Out order.
What are the 5 methods in Stack and what does each do?	Push puts an item on top of the stack, pop removes and returns the item on top of the stack, peek returns but does not remove the item on top of the stack, size returns the number of items in the stack, and empty? returns a boolean indicating if the stack is empty or not.
Describe a Queue	A queue is also a data structure that stores a list of data but provides access to it in First-In-First-Out 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 only returns the first item in the queue, size return the number of items in the queue, and empty? returns a boolean indicating if the queue is empty or not.
What is the difference between implementing something and using something?	Using something doesn't require you to know how to implement it.

OPTIONAL JobSimulation

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

[CheezItMan]

This is really well done Beauttie. Great work!

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

👍 nice and compact

[CheezItMan]

👍

[CheezItMan]

👍