Python data structures

# A list is being defined and printed
l1 = [1,2,3,4,5,6]
print(l1)
# print(l1[ : ])

# Initialize a list
numbers = [1,2,3,4,5,6]
# 1. append() function
numbers.append(10)
print("After append(10):", numbers)
# 2. copy() function
numbers_copy = numbers.copy()
print("Copied list:", numbers_copy)
# 3. pop() function
popped_element = numbers.pop()
print("After pop():", numbers)
print("Popped element:", popped_element)
# 4. sort() function
numbers.sort()
print("After sort():", numbers)
# 5. reverse() function
numbers.reverse()
print("After reverse():", numbers)
# 6. remove() function
numbers.remove(5)
print("After remove(5):", numbers)

t=(1,2,3,"Hello",3.14)
print(t)

# Define a tuple
t = (1, 2, 3, 2, 4, 2, 5)
# 1. count(value): Count the occurrences of a value in the tuple
count_of_2 = t.count(2)
print("Count of 2 in t:", count_of_2)
# 2. index(value): Find the index of the first occurrence of a value
index_of_3 = t.index(3)
print("Index of 3 in t:", index_of_3)
# Attempting index() with a non-existent value will raise an error
try:
  t.index(10)
except ValueError as e:
    print("Error:", e)

# Define the dictionary
d = {"car":"Baleno",
   "model":"GT500",
   "year":2020
   }
print(d)

# Define the dictionary
d = {"car":"Baleno",
"model":"GT500",
"year":2020
}
# Accessing all key-value pairs
items = d.items()
print("Items (key-value pairs):", items) 
# Accessing all keys
keys = d.keys()
print("Keys:", keys)
# Accessing all values
values = d.values()
print("Values:", values)
# Copying the dictionary
copydict = d.copy()
print(copydict)
# Clearing all entries from the dictionary
d.clear()
print("Dictionary after clearing:", d)
# Resetting the dictionary for next functions
d = copydict.copy()
# Retrieving a value for a specific key
car_model = d.get("model")
print("Model of the car:", car_model)
# Removing a key-value pair using popitem()
removed_value = d.popitem()
print("Removed item:", removed_value)
print("Dictionary after removal:", d)
# Checking if a key exists
has_key = "car" in d
print("Does the key 'car' exist?", has_key)

# Define a set
my_set = {1, 2, 3, 4}
# Print the set
print("Defined set:", my_set)

# Define two sets
set_a = {1, 2, 3, 4}
set_b = {3, 4, 5, 6}
# dd an element to the set
set_a.add(5)
print("After add(5):", set_a)
# Remove an element (raises an error if the element is not found)
set_a.remove(5)
print("After remove(5):", set_a)
# Remove an element (doesn't raise an error if not found)
set_a.discard(6)  # No error even if 6 is not in set_a
print("After discard(6):", set_a)
# Remove all elements from the set
temp_set = set_a.copy()  # Make a copy to preserve the original
temp_set.clear()
print("After clear():", temp_set)
# Remove and return an arbitrary element
popped_element = set_a.pop()
print("After pop():", set_a, "| Popped element:", popped_element)
# Combine elements from both sets (returns a new set)
union_set = set_a.union(set_b)
print("Union of set_a and set_b:", union_set)
# 7. Find common elements between sets (returns a new set)
intersection_set = set_a.intersection(set_b)
print("Intersection of set_a and set_b:", intersection_set)
# Find elements in set_a but not in set_b
difference_set = set_a.difference(set_b)
print("Difference (set_a - set_b):", difference_set)
# Find elements in either set_a or set_b but not both
symmetric_difference_set = set_a.symmetric_difference(set_b)
print("Symmetric difference of set_a and set_b:", symmetric_difference_set)
# Add elements from set_b to set_a
set_a.update(set_b)
print("After update(set_b):", set_a)
# Check if set_a is a subset of set_b
print("Is set_a a subset of union_set?", set_a.issubset(union_set))
# Check if set_a is a superset of set_b
print("Is set_a a superset of set_b?", set_a.issuperset(set_b))
# Check if set_a and set_b have no elements in common
print("Are set_a and set_b disjoint?", set_a.isdisjoint(set_b))