Skip to content

All tests pass#32

Open
lizett wants to merge 1 commit intoAda-C16:masterfrom
lizett:master
Open

All tests pass#32
lizett wants to merge 1 commit intoAda-C16:masterfrom
lizett:master

Conversation

@lizett
Copy link
Copy Markdown

@lizett lizett commented May 29, 2022

Stacks and Queues

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

Comprehension Questions

Question Answer
What is an ADT? ADT stands for Abstract Data Type. It is a type of object described by methods where the implementation details are not included.
Describe a Stack A data structure that provides access in a LIFO (last-in-first-out) order.
What are the 5 methods in Stack and what does each do? Push - puts an item at top of stack. Pop - removes and returns item on top of stack. Is_empty - returns true if stack is empty and false otherwise. Clear() - removes all objects. Peek() - returns object at the top of the Stack without removing it.
Describe a Queue Operates in FIFO (first-in-first-out).
What are the 5 methods in Queue and what does each do? Enqueue(item) - Places item in back of queue. Dequeue - Removes and returns the item at the front of the queue. Is_empty - returns true if queue is empty, false otherwise.
What is the difference between implementing something and using something? Implementing is the process of using/implementing something whereas using it is the final state after something has been implemented.

OPTIONAL JobSimulation

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

Copy link
Copy Markdown

@kyra-patton kyra-patton left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

✨ Nice work! You definitely hit all of the learning targets. Let me know what questions you have.

🟢

Comment thread stacks_queues/queue.py
pass
return True if self.size == 0 else False

def full(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💫 Love this helper!

Comment thread stacks_queues/queue.py
Comment on lines +32 to +36
if self.full():
buffer_increase = int(self.buffer_size * 0.5)
self.store = self.store[:self.rear] + [None] * buffer_increase + self.store[self.front:]
self.buffer_size += buffer_increase
self.front += buffer_increase
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💫😎 Very nice, increasing the buffer size!

Comment thread stacks_queues/queue.py
self.rear = (self.rear + 1)% self.buffer_size
self.size += 1

def dequeue(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment thread stacks_queues/queue.py
self.size -= 1
return element

def front(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment thread stacks_queues/queue.py
return self.store[self.front]


def size(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment thread stacks_queues/queue.py
def full(self):
return self.size == self.buffer_size

def __str__(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment thread stacks_queues/stack.py
Returns None
"""
pass
self.store.add_first(element)
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment thread stacks_queues/stack.py
pass
self.store.add_first(element)

def pop(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment thread stacks_queues/stack.py
raise StackEmptyException("stack is empty")
return self.store.remove_first()

def empty(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

✨ The LinkedList class also has an empty method you could take advantage of

Comment thread stacks_queues/stack.py
pass
return not self.store.get_first()

def __str__(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants