Create a flow chart using this code: #class for nodes class Node: def init(self, data=None, link=None): self.data=data self.link=link def str(self): return str(self.data) #class for Linked list class LinearList: def init(self, start=None,nodecount=0): self.start=start self.nodecount=nodecount #stores number of nodes in linked list def addBegNode(self, value=None):#Adding nodes at beginning node=Node(value) node.link=self.start self.start=node self.nodecount=self.nodecount+1 def printList(self):#traverse add display nodes ptr=self.start while ptr: print(ptr) ptr=ptr.link print() def bubblesort(self): for lst in range(self.nodecount-1): #for controlling passes of Bubble Sort current=self.start nxt=current.link previous=None while nxt: #Comparisons in passes if current.data>nxt.data: if previous==None: previous=current.link nxt=nxt.link previous.link=current current.link=nxt self.start=previous else: temp=nxt nxt=nxt.link previous.link=current.link previous=temp temp.link=current current.link=nxt else: previous=current current=nxt nxt=nxt.link lst=lst+1 # blank Linked List print("\n=============== MOVIE LIST ===============") movie=LinearList() movienum= input('\nEnter the number of movies to add: ') #add nodes at begging in the Linked List for cnt in range(int(movienum)): ele= input('\nEnter the name of the movie: ') movie.addBegNode(ele) cnt=cnt+1 #Linked List before sorting print("\nAdded movies: ") movie.printList() movie.bubbsort() #Linked List After sorting print("\nSorted movie list from A-Z: ") movie.printList()

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...

See similar textbooks

Related questions

Question

Create a flow chart using this code:

#class for nodes
class Node:
def __init__(self, data=None, link=None):
self.data=data
self.link=link
def __str__(self):
return str(self.data)

#class for Linked list
class LinearList:
def __init__(self, start=None,nodecount=0):
self.start=start
self.nodecount=nodecount #stores number of nodes in linked list
def addBegNode(self, value=None):#Adding nodes at beginning
node=Node(value)
node.link=self.start
self.start=node
self.nodecount=self.nodecount+1

def printList(self):#traverse add display nodes
ptr=self.start
while ptr:
print(ptr)
ptr=ptr.link
print()

def bubblesort(self):
for lst in range(self.nodecount-1): #for controlling passes of Bubble Sort
current=self.start
nxt=current.link
previous=None
while nxt: #Comparisons in passes
if current.data>nxt.data:
if previous==None:
previous=current.link
nxt=nxt.link
previous.link=current
current.link=nxt
self.start=previous
else:
temp=nxt
nxt=nxt.link
previous.link=current.link
previous=temp
temp.link=current
current.link=nxt
else:
previous=current
current=nxt
nxt=nxt.link
lst=lst+1

# blank Linked List
print("\n=============== MOVIE LIST ===============")
movie=LinearList()
movienum= input('\nEnter the number of movies to add: ')
#add nodes at begging in the Linked List
for cnt in range(int(movienum)):
ele= input('\nEnter the name of the movie: ')
movie.addBegNode(ele)
cnt=cnt+1

#Linked List before sorting
print("\nAdded movies: ")
movie.printList()
movie.bubbsort()