Maple Monica C. #42
Maple Monica C. #42
Conversation
There was a problem hiding this comment.
✨ Nice work Monica! I left suggestions on your __str__ implementations for both Stack and Queue.
Re: Implementation vs Using, implementation doesn't necessarily mean you are using another 'thing' as in one data type to define another data type, just that you are writing the code to make a function or larger piece of code work yourself. You are correct, using just means you are using code other people wrote.
Let me know what questions you have.
🟢
|
|
||
| def enqueue(self, element): | ||
| """ Adds an element to the Queue | ||
| Raises a QueueFullException if all elements | ||
| In the store are occupied | ||
| returns None | ||
| """ | ||
| pass | ||
|
|
|
|
||
| def dequeue(self): | ||
| """ Removes and returns an element from the Queue | ||
| Raises a QueueEmptyException if | ||
| The Queue is empty. | ||
| """ | ||
| pass |
|
|
||
| def front(self): | ||
| """ Returns an element from the front | ||
| of the Queue and None if the Queue | ||
| is empty. Does not remove anything. | ||
| """ | ||
| pass | ||
| return self.store[self.front] |
| def size(self): | ||
| """ Returns the number of elements in | ||
| The Queue | ||
| """ | ||
| pass | ||
| return self.size |
|
|
||
| def empty(self): | ||
| """ Returns True if the Queue is empty | ||
| And False otherwise. | ||
| """ | ||
| pass | ||
| return self.size == 0 |
|
|
||
| def empty(self): | ||
| """ Returns True if the Queue is empty | ||
| And False otherwise. | ||
| """ | ||
| pass | ||
| return self.size == 0 | ||
|
|
||
| def __str__(self): | ||
| """ Returns the Queue in String form like: | ||
| [3, 4, 7] | ||
| Starting with the front of the Queue and | ||
| ending with the rear of the Queue. | ||
| """ |
| @@ -12,7 +12,7 @@ def push(self, element): | |||
| """ Adds an element to the top of the Stack. | |||
| Returns None | |||
| """ | |||
| pass | |||
| self.store.add_first(element) | |||
| @@ -21,18 +21,21 @@ def pop(self): | |||
| The Stack is empty. | |||
| returns None | |||
| """ | |||
| if self.store.empty(): | ||
| raise StackEmptyException | ||
| else: | ||
| return self.store.remove_first() | ||
|
|
||
| def empty(self): |
|
|
||
| def __str__(self): | ||
| """ Returns the Stack in String form like: | ||
| [3, 4, 7] | ||
| Starting with the top of the Stack and | ||
| ending with the bottom of the Stack. | ||
| """ | ||
| pass | ||
| return self.store.__str__() |
There was a problem hiding this comment.
The __str__ method is an example of what we call operator overloading. Operator overloading is used for methods and operators such as str(), ==, and + where Python actually has a predefined way it will attempt to do these operations or methods on any object or data type. Methods like __str__, __eq__, and __add__ allow us to either extend or overwrite the predefined functionality with our own desired functionality.
When we implement the function, we use the dunders around the function name (ex. __str__ ) to indicate that we are about to do operator overloading. However, when we call the function, we can remove the dunders.
| return self.store.__str__() | |
| return str(self.store) |
Stacks and Queues
Thanks for doing some brain yoga. You are now submitting this assignment!
Comprehension Questions
OPTIONAL JobSimulation