Implementing Set Operations The code template initializes two sets, A and B containing lower case characters as elements. Block 1 computes A-B and prints out the resulting set. In Block 2 write code to compute B-A and output the resulting set. In Block 3 write code to compute A⊕B and output the resulting set. Note that according to the definition of a set, the order of the elements does not matter. In this code, the elements of a set are printed in sorted order so that your output will match the expected output in the test cases. main.py # Initialize sets A and B A = { 'a', 'b', 'c', 'd', 'e', 'f' } B = { 'c', 'd', 'f', 'h', 'j', 'k' } print('A = ', sorted(A)) print('B = ',sorted(B)) print(' ') #Block 1: computes and prints out the set A - B AminusB = set() for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add it AminusB every element in A if the element is also not in B print('A - B = ', sorted(AminusB)) print(' ') #Block 2: put your code here to compute B minus A BminusA = set() print('B - A = ', sorted(BminusA)) print(' ') #Block 3: put your code here to compute the symmetric difference of A and B #Hint: you may need two loops AsymdiffB = set() print('Symmetric Difference of A and B = ', sorted(AsymdiffB))
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Implementing Set Operations
The code template initializes two sets, A and B containing lower case characters as elements.
Block 1 computes A-B and prints out the resulting set.
In Block 2 write code to compute B-A and output the resulting set.
In Block 3 write code to compute A⊕B and output the resulting set.
Note that according to the definition of a set, the order of the elements does not matter. In this code, the elements of a set are printed in sorted order so that your output will match the expected output in the test cases.
main.py
# Initialize sets A and B
A = { 'a', 'b', 'c', 'd', 'e', 'f' }
B = { 'c', 'd', 'f', 'h', 'j', 'k' }
print('A = ', sorted(A))
print('B = ',sorted(B))
print(' ')
#Block 1: computes and prints out the set A - B
AminusB = set()
for element in A: # this line runs through every element in A
if not(element in B): #A - B is the set of elements that are in A and are not in B
AminusB.add(element) # Add it AminusB every element in A if the element is also not in B
print('A - B = ', sorted(AminusB))
print(' ')
#Block 2: put your code here to compute B minus A
BminusA = set()
print('B - A = ', sorted(BminusA))
print(' ')
#Block 3: put your code here to compute the symmetric difference of A and B
#Hint: you may need two loops
AsymdiffB = set()
print('Symmetric Difference of A and B = ', sorted(AsymdiffB))
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
