Maple - Ruiz #55
Maple - Ruiz #55
Conversation
There was a problem hiding this comment.
Hi Juliana, while it looks like your implementation may work for whatever classes you were originally looking at, it doesn't work for the starter code we provide. Additionally, the comprehension questions haven't been filled out.
Please try this project again using the starter code and README we have provided for you as the basis for your implementation.
🔴
| pass | ||
| if self.is_full(): | ||
| raise QueueFullException | ||
| return self.items.insert_at_end(element) |
There was a problem hiding this comment.
items and insert_at_end aren't attributes or methods of the Queue class that we provide.
Additionally, it looks like you are implementing a Queue with an array or linked list of some sort, but this project asks you to implement a Queue using a circular buffer.
| @@ -12,7 +12,8 @@ def push(self, element): | |||
| """ Adds an element to the top of the Stack. | |||
| Returns None | |||
| """ | |||
| pass | |||
| self.stack_size += 1 | |||
| self.stack_list.append(element) | |||
There was a problem hiding this comment.
Again, stack_list and append don't exist as attributes/methods for the LinkedList class we provide
Stacks and Queues
Thanks for doing some brain yoga. You are now submitting this assignment!
Comprehension Questions
OPTIONAL JobSimulation