Questions

# Python code
# Create sets with various data types
set1 = {1, 2, 3, 'apple', 'banana', 4.5}
set2 = {2, 3, 'cherry', 4.5, 5.0}

# Union of sets
union_result = set1.union(set2)

# Intersection of sets
intersection_result = set1.intersection(set2)

# Difference between sets
difference_result = set1.difference(set2)

# Print the results
print("Set 1:", set1)
print("Set 2:", set2)
print("Union of sets:", union_result)
print("Intersection of sets:", intersection_result)
print("Difference between sets:", difference_result)

# Python code
def find_intersection(set1, set2):
    return set1.intersection(set2)

# Example usage:
set1 = {1, 2, 3, 4, 5}
set2 = {3, 4, 5, 6, 7}

intersection_result = find_intersection(set1, set2)
print("Intersection:", intersection_result)

# Python code
def is_subset(set1, set2):
    return set1.issubset(set2)

# Example usage:
set1 = {1, 2, 3}
set2 = {1, 2, 3, 4, 5}

is_subset_result = is_subset(set1, set2)
print("Is set1 a subset of set2?", is_subset_result)

# Python code
def find_symmetric_difference(set1, set2):
    return set1.symmetric_difference(set2)

# Example usage:
set1 = {1, 2, 3, 4, 5}
set2 = {3, 4, 5, 6, 7}

symmetric_difference_result = find_symmetric_difference(set1, set2)
print("Symmetric Difference:", symmetric_difference_result)

# Python code
original_list = [1, 2, 2, 3, 4, 4, 5, 6]

# Convert the list to a set to remove duplicates
unique_set = set(original_list)

# Convert the set back to a list if needed
unique_list = list(unique_set)

print("Original List:", original_list)
print("List with Duplicates Removed:", unique_list)

# Python code
my_set = {1, 2, 3, 4, 5}

# Remove element 3 using the remove() method
try:
    my_set.remove(3)
except KeyError:
    print("Element 3 not found in the set.")

# Remove element 2 using the discard() method
my_set.discard(2)

# Try to remove element 6 that doesn't exist using the remove() method
try:
    my_set.remove(6)
except KeyError:
    print("Element 6 not found in the set.")

# Try to remove element 5 that doesn't exist using the discard() method
my_set.discard(5)

print("Updated Set:", my_set)

# Python code
# Using set comprehension to create a set of squares
squares_set = {x ** 2 for x in range(1, 11)}

# Print the set of squares
print("Set of Squares:", squares_set)

# Python code
input_string = "hello world"
vowels_set = {char for char in input_string if char in "aeiouAEIOU"}

print("Set of Unique Vowels:", vowels_set)

# Python code
list1 = [1, 2, 3, 4, 5]
list2 = [3, 4, 5, 6, 7]

# Convert the lists to sets
set1 = set(list1)
set2 = set(list2)

# Find the common elements using the intersection method
common_elements = set1.intersection(set2)

# Convert the result back to a list if needed
common_elements_list = list(common_elements)

print("List 1:", list1)
print("List 2:", list2)
print("Common Elements:", common_elements_list)

# Python code
list1 = [1, 2, 3, 4, 5]
list2 = [3, 4, 5, 6, 7]

# Convert the lists to sets
set1 = set(list1)
set2 = set(list2)

# Find elements unique to each list using symmetric difference
unique_to_list1 = set1.symmetric_difference(set2)
unique_to_list2 = set2.symmetric_difference(set1)

# Convert the results back to lists if needed
unique_to_list1_list = list(unique_to_list1)
unique_to_list2_list = list(unique_to_list2)

print("List 1:", list1)
print("List 2:", list2)
print("Elements Unique to List 1:", unique_to_list1_list)
print("Elements Unique to List 2:", unique_to_list2_list)

# Python code
set1 = {"apple", "banana", "cherry", "date"}
set2 = {"banana", "cherry", "fig", "grape"}

# Common strings in both sets
common_strings = set1.intersection(set2)

# Unique strings in set1
unique_to_set1 = set1.difference(set2)

# Unique strings in set2
unique_to_set2 = set2.difference(set1)

# Total count of unique strings
total_unique_count = len(unique_to_set1) + len(unique_to_set2)

print("Set 1:", set1)
print("Set 2:", set2)
print("Common Strings:", common_strings)
print("Unique Strings in Set 1:", unique_to_set1)
print("Unique Strings in Set 2:", unique_to_set2)
print("Total Count of Unique Strings:", total_unique_count)

# Python code
def remove_duplicates_preserve_order(input_list):
    seen = set()
    output_list = []
    for item in input_list:
        if item not in seen:
            seen.add(item)
            output_list.append(item)
    return output_list

original_list = [1, 2, 2, 3, 4, 4, 5, 1]

# Remove duplicates while preserving the original order
unique_list = remove_duplicates_preserve_order(original_list)

print("Original List:", original_list)
print("List with Duplicates Removed (Preserving Order):", unique_list)

# Python code
def is_element_in_set(element, my_set):
    return {element}.issubset(my_set)

# Example usage:
my_set = {1, 2, 3, 4, 5}
element_to_check = 3

is_present = is_element_in_set(element_to_check, my_set)
print(f"Is {element_to_check} in the set? {is_present}")

# Python code
list_of_sets = [
    {1, 2, 3, 4, 5},
    {3, 4, 5, 6, 7},
    {5, 6, 7, 8, 9}
]

# Initialize the results with the first set
union_result = list_of_sets[0].copy()
intersection_result = list_of_sets[0].copy()
difference_result = list_of_sets[0].copy()

# Iterate through the list of sets starting from the second set
for s in list_of_sets[1:]:
    union_result.update(s)
    intersection_result.intersection_update(s)
    difference_result.difference_update(s)

print("List of Sets:")
for s in list_of_sets:
    print(s)

print("Union of Sets:", union_result)
print("Intersection of Sets:", intersection_result)
print("Difference of Sets:", difference_result)