DEV Community

JAYA SRI J
JAYA SRI J

Posted on

Botanical garden

#python #beginners #tutorial #coding
  1. Create and print a set Concept: A set stores unique elements (no duplicates). 
rose_garden = {"red rose", "white rose", "yellow rose"}
print(rose_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Sets automatically avoid duplicates and are unordered.

2.Add an element
Concept: Use add() to insert a new item.

rose_garden.add("pink rose")
print(rose_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Adds a new element to the set.

3.Remove an element
Concept: Use remove().

rose_garden.remove("yellow rose")
print(rose_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Removes the specified element. If not present, it causes an error.

4.Union of two sets
Concept: Combine all elements.

botanical_garden = {"sunflower", "tulip", "red rose"}
print(rose_garden.union(botanical_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Union includes all unique elements from both sets.

5.Intersection of sets
Concept: Find common elements.

print(rose_garden.intersection(botanical_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Returns only elements present in both sets.

6.Difference of sets
Concept: Elements only in one set.

print(rose_garden.difference(botanical_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Shows elements only in rose_garden.

  1. Symmetric difference Concept: Unique elements from both sets. 
print(rose_garden.symmetric_difference(botanical_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Removes common elements and keeps unique ones.

  1. Subset check Concept: Check if one set is inside another. 
small_garden = {"red rose", "white rose"}
print(small_garden.issubset(rose_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Returns True if all elements exist in the main set.

9.Superset check
Concept: Opposite of subset.

print(rose_garden.issuperset(small_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Checks if rose_garden contains all elements of small_garden.

10.Count elements
Concept: Use len().

print(len(rose_garden))
Enter fullscreen mode Exit fullscreen mode

Explanation:
Returns total number of elements.

11.Discard elements
Concept: Safe removal.

rose_garden.discard("pink rose")
rose_garden.discard("blue rose")
print(rose_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
discard() does not throw an error if element is missing.

12.Clear the set
Concept: Remove all elements.

rose_garden.clear()
print(rose_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
The set becomes empty.

13.Copy a set
Concept: Duplicate a set.

copy_garden = botanical_garden.copy()
copy_garden.add("lily")
print(botanical_garden)
print(copy_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Original set remains unchanged.

14.Frozen set
Concept: Immutable set.

immutable_garden = frozenset({"orchid", "daisy", "red rose"})
# immutable_garden.add("lily")  # Error
Enter fullscreen mode Exit fullscreen mode

Explanation:
Frozen sets cannot be modified.

  1. Iterate through a set Concept: Loop through elements. 
for flower in botanical_garden:
    print(flower)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Used to access each element.

16.Set comprehension
Concept: Create sets in one line.

even_numbers = {x for x in range(1, 11) if x % 2 == 0}
print(even_numbers)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Generates even numbers from 1 to 10.

17.Remove duplicates using set
Concept: Convert list to set.

flowers = ["rose", "tulip", "rose", "daisy", "tulip"]
unique_flowers = set(flowers)
print(unique_flowers)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Sets automatically remove duplicates.

18.Check membership
Concept: Use in.

print("sunflower" in botanical_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Returns True or False.

19.intersection_update()
Concept: Keep only common elements.

botanical_garden.intersection_update(rose_garden)
print(botanical_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Updates the set instead of returning a new one.

20.difference_update()
Concept: Remove common elements.

botanical_garden.difference_update(small_garden)
print(botanical_garden)
Enter fullscreen mode Exit fullscreen mode

Explanation:
Removes elements of small_garden from botanical_garden.

Top comments (0)