Question

Using Python.

3) Create a single-linked list (StudentList) where the data in the link is an object of type pointer to Student as defined below. Note that you need to store and pass a pointer of type Student so that you do not create duplicate objects. Test your list with the provided program. You will find example code for a single-linked list of integers in Moodle that you can base your solution on. For your find methods, you can either use getName0 to check for equality of two Student objects or you can overload operator== and use the same code as provided in the Moodle example for integers. I would suggest placing the Student class in a Student.h file and the StudentList class in a separate .h/.cpp pair. Note that you will have to name your link for StudentList different from your link for TextClass or the compiler will complain of duplicate names. StudentList should support the following methods: Definition of Student: class Student{ private: String name; int age; public: Student 0 name-""; age 0; ) Student(String n, int a) fname - n; age- a; ) void setName( String n ) { name-n; } String getName O {return name; void setAge (int a ) age-a;) int getAge O {return age; ) Parameters Action insertHead Student*sInsert a link pointing to the object s at the head of insertTail Student*s Insert a link pointing to the object s at the end of deleteHeadNone isEmpty the list the list Delete first link and return its value. Throw an exception if the list is empty. Return true if list is empty None findKeyString name Return true if a link exists containing a Student with the name. If the key is not found in the list, return false. deleteKey String Name Delete the first link you find that contains a Student with the name. Return true if success, false if failure.

Answer 1

linklist linklis File Edit Format Run Options Window Help class Student: def init__(self, name, age) self.name-name self.age-age self.nextval-None class SLinkedList: def init (self): self.headval - None self.preva1-None def listprint (self): printval - self.headval while printval is not None: print (printval.name) print (printval.age) printval - printval.nextval def insertHead (self,newnode) NewNode newnode # Update the new nodes next val to existing node NewNode.nextval-self.headval self.headval -NewNode def insertTail (self, newnode): NewNode-newnode if self.headval is None: self.headval -NewNode return lasteself.headval1 Ln: 1 Col: 18 l6:00 AM 4/26/2019

linklist linklis File Edit Format Run Options Window Help while (laste.nextval): laste.nextval-NewNode if self.headval is None: laste-laste.nextval def isEmpty (self) print("List is empty") return True else: return False def deleteHead (self): x-self.headval x-X.nextva1 self. headval=x def findKey (self, name): f=False laste - self.headva ї while (laste.nextval): laste-laste.nextval if laste.name--name: fprint ("found") f-True break if f: return True return False laste-self.headval else: while (laste.nextval): Ln: 58 Col: 29 4/26/2019

linklist linklis File Edit Format Run Options Window Help aste -Laste.nextva return True else: return False' def deleteKey (self,name): HeadVal -self.headval if (HeadVal is not None): if (HeadVal.name --name): self.headval -HeadVal.nextval Headva 1 = None while (HeadVal is not None): if HeadVal.name name: break prev = HeadVal HeadVaľ = Headval . nextval if (Headva! == None): return prev.nextva! = HeadVal.nextval Headva 1 = None Ln: 87 Col:0 l6:03 AM 4/26/2019

linklist linklis File Edit Format Run Options Window Help if f return True else: return False' def LListprint (self): printval - self.headval while (printval): print (printval.name), printval-printval.nextval list1 = SLinkedList () listl.headvalStudent ("Mack", 20) s2- Student ("Jack", 22) s3-Student ("Tom", 23) #Link first Node to second node listl.headval.nextval-s2 #Link second Node to third node S2.nextval- SJ S4-Student ("Maaz", 18) listl.listprint () print(" print("Insert At Head") listl.insertHead (s4 listl.listprint () s5-Student ("Harry", 39) list1.insertTail (s5) print(" print("insert at tail") listl.listprint Ln: 115 Col: 17 l6:04 AM 4/26/2019

linklistu File Edit Format Run Options Window Help print(" print("Delete at head") listl.deleteHead) listl.listprint () print ("List is Empty or not : ",listl.isEmpty ) print ("Student is present or not: ",listl.findKey ("Tom")) listl.deleteKey ("Jack" print("Link List after deletion by name") listl.LListprint ) Ln: 1 Col:0 l6:07 AM 4/26/2019

2 Shell File Edit Shell Debug Options Window Help Python 3.6.2 (v3.6.2:5fd33b5, Jul 8 2017, 04:14:34) [MSC v.1900 32 bit (Intel)] on win32 Type"copyright", "credits" or "license)" for more information. RESTART C:/Users/delll/linklistupload.py Mack 20 Jack Tom 23 Insert At Head Maaz 18 Mack 20 Jack от 23 insert at tail Maaz 18 Mack 20 Jack Tom Ln: 1 Col: 4 4/26/2019

2 Shell File Edit Shell Debug Options Window Help Harry 39 Delete at head Mack 20 Jack Tom 23 Harry 39 List is Empty or not False Student is present or not: True Link List after deletion by name Mack Tom Harry C:/Users/de111/1inklistupload.py RESTART ; Mack 20 Jack Tom 23 Insert At Head Ln: 58 Col: 4 4/26/2019

2 Shell File Edit Shell Debug Options Window Help Maaz 18 Mack 20 Jack от 23 insert at tail Maaz 18 Mack 20 Jack Tom 23 Harry 39 Delete at head Mack 20 Jack от 23 Harry Ln: 86 Col: 2 6:14 AM 4/26/2019

2 Shell File Edit Shell Debug Options Window Help insert at tail Maaz 18 Mack 20 Jack Tom 23 Harry 39 Delete at head Mack 20 Jack от 23 Harry 39 List is Empty or not False Student is present or not True Link List after deletion by name Mack от Harry >7 Ln: 95 Col: 4 4/26/2019