print("Set Operations:")
A = {0, 2, 4, 6, 8};
B = {1, 2, 3, 4, 5};
print("Union :", A | B)
print("Intersection :", A & B)
print("Difference :", A - B)
print("Symmetric difference :", A ^ B)
print("A is subset of B:")
A = {1, 2, 3}
B = {1, 2, 3, 4, 5}
print(A.issubset(B))
def get_subsets(fullset):
listrep = list(fullset)
subsets = []
for i in range(2**len(listrep)):
subset = []
for k in range(len(listrep)):
if i & 1<<k:
subset.append(listrep[k])
subsets.append(subset)
return subsets
subsets = get_subsets(set({1,2,3,4}))
print("Power Set:",subsets)
print("Number of subsets:",len(subsets))
print("Cartesian Product of two Sets:")
def findCart(arr1, arr2, n, n1):
for i in range(0,n):
for j in range(0,n1):
print("{",arr1[i],", ",arr2[j],"}, ",sep="",end="")
arr1 = [ 1, 2, 3 ]
arr2 = [ 4, 5, 6 ]
n1 = len(arr1)
n2 = len(arr2)
findCart(arr1, arr2, n1, n2);
