Python number 1. is already done it is on the image, looking for help or insight for 2, 3, and 4. 1. From page 146, #22: Implement a stack using linked lists. 2. From page 146, #23: Implement a queue using linked lists. 3. From page 146, #24: Implement a deque using linked lists. 4. From page 147, #25: Design and implement an experiment that will compare the performance of a Python list with a list implmentd as a linked list
Python number 1. is already done it is on the image, looking for help or insight for 2, 3, and 4. 1. From page 146, #22: Implement a stack using linked lists. 2. From page 146, #23: Implement a queue using linked lists. 3. From page 146, #24: Implement a deque using linked lists. 4. From page 147, #25: Design and implement an experiment that will compare the performance of a Python list with a list implmentd as a linked list
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Python number 1. is already done it is on the image, looking for help or insight for 2, 3, and 4.
1. From page 146, #22: Implement a stack using linked lists.
2. From page 146, #23: Implement a queue using linked lists.
3. From page 146, #24: Implement a deque using linked lists.
4. From page 147, #25: Design and implement an experiment that will compare the
performance of a Python list with a list implmentd as a linked list
![class EmptyStack (Exception):
_init__(self):
def
super (). __init__('Stack is empty: invalid operation!
#linked list node
class Node:
def
_init_ (self):
self.data = None
self.next = None
#linked list class
class LinkedList:
def
init (self):
self.head = None
self.size = 0
def get_size (self):
return self.size
def add (self, item) : #to push element to stack
self.node = Node ()
self.node.data = item
self.node.next = self.head
self.head = self.node
self.size += 1
def remove (self):
if self.head == None:
raise EmptyStack
self.head_item = self.head.data
self.head = self.head.next
self.size = 1
return self.head_item
#creating Stack using linked list
class Stack:
def init (self):
-
self.s = LinkedList ()
def get_size (self):
return self.s.get_size()
def push (self, item): # to push element to stack
self.s.add(item)
def pop (self):
return self.s.remove()
1
==
name
main':
stack Stack()
for i in range (8):
stack.push(i*2)
print('size: {}'.format (stack.get_size()))
print ("Popped element: ", stack.pop())
print ("New size:" stack.get_size())
I
if](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F09910da7-adf3-4813-80f7-da7d1ae040d2%2F8d8870d9-ed80-4f56-93a7-490ea9991ac6%2F0tum4y9_processed.png&w=3840&q=75)
Transcribed Image Text:class EmptyStack (Exception):
_init__(self):
def
super (). __init__('Stack is empty: invalid operation!
#linked list node
class Node:
def
_init_ (self):
self.data = None
self.next = None
#linked list class
class LinkedList:
def
init (self):
self.head = None
self.size = 0
def get_size (self):
return self.size
def add (self, item) : #to push element to stack
self.node = Node ()
self.node.data = item
self.node.next = self.head
self.head = self.node
self.size += 1
def remove (self):
if self.head == None:
raise EmptyStack
self.head_item = self.head.data
self.head = self.head.next
self.size = 1
return self.head_item
#creating Stack using linked list
class Stack:
def init (self):
-
self.s = LinkedList ()
def get_size (self):
return self.s.get_size()
def push (self, item): # to push element to stack
self.s.add(item)
def pop (self):
return self.s.remove()
1
==
name
main':
stack Stack()
for i in range (8):
stack.push(i*2)
print('size: {}'.format (stack.get_size()))
print ("Popped element: ", stack.pop())
print ("New size:" stack.get_size())
I
if
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY