Ana Gabriele - Cedar c16 #49

Anagabsoares · 2022-07-18T05:11:33Z

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 which is described by the methods it has and how they perform.
Describe a Stack	A Stack is a data structure which stores a list of data and only provides access in a Last-In-First-Out (LIFO) order
What are the 5 methods in Stack and what does each do?	push() -. add element ,pop() - remove element , is_empty() - check if stack is empty, display() -> display elements
Describe a Queue	Queue is the data structure that is similar to the queue in the real world. A queue is a data structure in which whatever comes first will go out first, and it follows the FIFO (First-In-First-Out) policy.
What are the 5 methods in Queue and what does each do?	queue() _> add element to the queue dequeu() - remove element front() -> get first element is_empty() -> check if queue is empty size()-> return queue length
What is the difference between implementing something and using something?	Implementing -> development from scratch/ using - make use of something that already exists

OPTIONAL JobSimulation

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

kyra-patton

✨🌸 Nice work, Ana. Please check your implementation of front for the Queue class. I also left some minor style suggestions, but overall good work. Let me know what questions you have.

🟢

kyra-patton · 2022-07-22T19:38:41Z

stacks_queues/queue.py

        """
-        pass
+        if self.size == self.buffer_size:
+            raise QueueFullException('This will break it')


Small suggestion: When raising an exception, it's helpful to give a description of why the code is breaking

Suggested change

raise QueueFullException('This will break it')

raise QueueFullException('Queue full')

kyra-patton · 2022-07-22T19:39:08Z

stacks_queues/queue.py

            Raises a QueueFullException if all elements
            In the store are occupied
            returns None
        """


kyra-patton · 2022-07-22T19:39:46Z

stacks_queues/queue.py

+        #  find element in the store
+        # First in first out 
+        if self.size == 0:
+            raise QueueEmptyException('This will break it')


Same thing as above with the Exception here ⬆️

kyra-patton · 2022-07-22T19:40:11Z

stacks_queues/queue.py

        """ Removes and returns an element from the Queue
            Raises a QueueEmptyException if 
            The Queue is empty.
        """


kyra-patton · 2022-07-22T19:41:44Z

stacks_queues/queue.py

-        pass
-
+        if self.store[self.front]:
+            return self.store[0]


⚠️ With a circular queue, the front of the queue may not always be at index 0. That's why we have a front pointer that shifts as elements are dequeued.

The current tests don't cover front which is why you may not have caught this.

Suggested change

return self.store[0]

return self.store[self.front]

kyra-patton · 2022-07-22T19:42:40Z

stacks_queues/queue.py

            [3, 4, 7]
            Starting with the front of the Queue and
            ending with the rear of the Queue.
        """


kyra-patton · 2022-07-22T19:43:05Z

stacks_queues/stack.py

-        pass
-
+        self.store.add_last(element)
+        return element


Per the specification, this function should return None

Suggested change

return element

kyra-patton · 2022-07-22T19:43:46Z

stacks_queues/stack.py

+        if not self.store:
+            raise StackEmptyException("List is empty")
+
+        return self.store.remove_last()  


Again, per the function specification, this method should return None

Suggested change

return self.store.remove_last()

self.store.remove_last()

kyra-patton · 2022-07-22T19:43:55Z

stacks_queues/stack.py

            And False otherwise
        """
-        pass
+        return self.store.empty()


kyra-patton · 2022-07-22T19:44:31Z

stacks_queues/stack.py

            ending with the bottom of the Stack.
        """
-        pass
+        values = []


✨ Yes, this works! You could also take advantage of the str method in the LinkedList class

Anagabsoares added 3 commits July 17, 2022 19:27

implement stack

e90bf9d

implement queue and passes tests

1e61e39

remove extraneous testing code

275c1e2

kyra-patton reviewed Jul 22, 2022

View reviewed changes

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Ana Gabriele - Cedar c16 #49

Ana Gabriele - Cedar c16 #49

Uh oh!

Anagabsoares commented Jul 18, 2022

Uh oh!

kyra-patton left a comment

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

kyra-patton Jul 22, 2022

Uh oh!

Uh oh!

	raise QueueFullException('This will break it')
	raise QueueFullException('Queue full')

Ana Gabriele - Cedar c16 #49

Are you sure you want to change the base?

Ana Gabriele - Cedar c16 #49

Uh oh!

Conversation

Anagabsoares commented Jul 18, 2022

Stacks and Queues

Comprehension Questions

OPTIONAL JobSimulation

Uh oh!

kyra-patton left a comment

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Uh oh!