Fire - Noor

[hn4ever]

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 where it's described by its methods.
Describe a Stack	A data structure in which stores a list of data that can only be accessed in 'Last In First Out' order.
What are the 5 methods in Stack and what does each do?	They are: push (to add an item at the top), pop (to remove an item from the top), is_empty(to check if the stack is empty), peek (return the value of the top item without removing it), size (return the number of items in the stack)
Describe a Queue	A type of data structure in which stores a list of data that are only accessible in a 'First In First Out' Order.
What are the 5 methods in Queue and what does each do?	They are: enqueue (to add an item at the back of the queue, dequeue (to remove an item from the front of the queue), is_empty (checks if a queue is empty or not), front (return the value of the front item without removing it), and size (return number of items in a queue
What is the difference between implementing something and using something?	If we use something, we will not need to know how it was implemented, while if we implement something we need to know most of its use cases.

OPTIONAL JobSimulation

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

[CheezItMan]

Well done Noor, you hit the learning goals here. Well done.

[CheezItMan]

👍

[CheezItMan]

👍 , very compact, nicely done!

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

👍

[hn4ever]

Thank you Chris :)