Roza -cedar, re-submission including the comprehension questions

[haset-19]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?
Describe a Stack	Is a data structure that stores lists of data but those data can be accessed through last in-first out
What are the 5 methods in Stack and what does each do?	size, to return the total elements in a stack, is_empty to check if the stack is empty, pop to remove and return the element on top of the stack, push to insert element on the top, peek, to return top element but not doesn't remove
Describe a Queue	is an abstract data structure to store a list of elements like stack but allows access only in first come first out
What are the 5 methods in Queue and what does each do?	enqueue to add element at the end, dequeue to remove element from the front, is_empty, to check if the queue is empty, size to calculate the total elements and return,
What is the difference between implementing something and using something?	Implementing something the way the implementer prefers and abstracting the details, the data structures used etc, and the user doesn't have to know the details.

OPTIONAL JobSimulation

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