Question

In Python

class int Set (object): "" "An intSet is a set of integers The value is represented by a list of ints, self.vals. Each int in the set occurs in self.vals exactly once. """ definit__(self): """Create an empty set of integers""" self.vals = 0 def insert (self, e): """Assumes e is an integer and inserts e into self""" if not e in self.vals: self.vals.append(e) def member (self, e): """Assumes e is an integer Returns True if e is in self, and False otherwise""" return e in self.vals def remove (self, e): "" "Assumes e is an integer and removes e from self Raises ValueError if e is not in self""" try: self.vals.remove (e) except: raise ValueError(str(e) + ' not found') def str__(self): """Returns a string representation of self""" self.vals.sort () return '{' + '.'.join([str(e) for e in self.vals]) +'}'

Answer 1

Code

class intSet(object):
"""An intSet is a set of integers
The value is represented by a list of ints, self.vals.
Each int in the set occurs in self.vals exactly once."""

def __init__(self):
"""Create an empty set of integers"""
self.vals = []

def insert(self, e):
"""Assumes e is an integer and inserts e into self"""
if not e in self.vals:
self.vals.append(e)

def member(self, e):
"""Assumes e is an integer
Returns True if e is in self, and False otherwise"""
return e in self.vals

def remove(self, e):
"""Assumes e is an integer and removes e from self
Raises ValueError if e is not in self"""
try:
self.vals.remove(e)
except:
raise ValueError(str(e) + ' not found')

def __str__(self):
"""Returns a string representation of self"""
self.vals.sort()
return '{' + ','.join([str(e) for e in self.vals]) + '}'

def __len__(self):
"""Returns the number of elements in s."""
return len(self.vals)

def intersect(self,other):
""" Returns a new IntSet that contains of integers in both s1 & s2 """
commonSet = intSet()
#Note member is intSet interal Method
for x in self.vals:
if other.member(x):
commonSet.insert(x)
return commonSet

#Test Case
s1 = intSet()
s2 = intSet()
s1.insert(1)
s1.insert(2)
s1.insert(3)
s1.insert(4)
s2.insert(3)
s2.insert(4)
s2.insert(5)
s2.insert(6)
s2.insert(7)

print(s1)
print(s2)
print(s1.intersect(s2))
print(len(s1))

output

Command Prompt B:\Chegg\Python>py setClass . py {3,4,5,6,7} (3,4) 4 B: \Chegg\Python> 20:55 OType here to search ENG 29-07-2019 !!

code snaps

setClass.py- BChegg Python-Atom File Edit View Selection Find Packages Help setClass.py class intSet(object): An intSet is a set of integers The value is represented by a list of ints, self.vals. Each int in the set occurs in self.vals exactly once. """ init_( self) : def "Create an empty set of integers"um self.vals - [] def insert(self, e): 18 "Assumes e is an integer and inserts e into self""" in self. vals 12 if not 13 self. vals . append (e) 14 15 def member(self, e): Assumes e is an integer 16 Returns True if e is in self, and False otherwise""" 17 18 in self.vals return 19 20 def remove(self, e): 21 "Assumes e is an integer and removes e from self 22 Raises Value Error if e is not in self""" 23 try: self.vals.remove (e) 24 25 except: raise ValueError (str (e) + not found' 27 _str_( self) : def O GitHub setClass.py 48:14 CRLE UTF-8 Python Git (0) 20: 56 Type here to search ENG 29-07-2019

setClass.py- B\Chegg Python-Atom File Edit View Selection Find Packages Help setClass.py def str_(self) : 28 29 "Returns a string representation of self""" self.vals.sort () return '','.join ( [str (e) for e in self. vals ] ) + '}' 30 def _len_(self) : Returns the number of elements in s.""". return len(self . vals ) intersect ( self, other) : def Returns new IntSet that contains of integers in both s1 & s2 "uu commonSet intSet() #Note member is intSet interal Method for x in self . vals : if other.member (x) : 42 commonSet.insert (x) 43 return commonSet 44 45 46 41 #Test Case - intSet () 48 s1 s2 intSet () 40 50 s1.insert (1) s1.insert(2) 51 s1.insert(3) 57 s1.insert (4) s2. insert (3) e2 incont/AY O GitHub setClass.py 48:14 CRLE UTF-8 Python Git (0) 20: 56 O Type here to search ENG 29-07-2019

setClass.pyBCheggPython-Atom File Edit View Selection Find Packages Help setClass.py intersect(self, other) : def auReturns new IntSet that contains of inteeers in both s1 & $2 """ commonSet intSet() 40 #No te member is intSet interal Method for x in self . vals : f other.member (x) : commonSet.insert (x) return commonSet #Test Case s1 = intSet 48 s2-intSet() s1.insert(1) 50 s1.insert(2) s1. insert (3) s1. insert (4) s2.insert (3) 54 s2.insert(4) 55 56 s2.insert(5) s2.insert(6) s2.insert(7) 57 58 60 print(s1) print (s2) 61 print (s1.intersect (s2) ) 62 print(len (s1) ) O GitHub setClass.py 48:14 CRLE UTF-8 Python Git (0) 20: 56 O Type here to search ENG 29-07-2019

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.