Scribd
Upload
133 views44 pages

Python Sets Presentation

Uploaded by

Bharat Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
133 views44 pages

Python Sets Presentation

Uploaded by

Bharat Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 44

Python Sets Methods

A PowerPoint Presentation Based on


Jupyter Notebook
Python Sets
• ---
are separated by commas and
enclosed within curly brackets {}.
Sets are unchangeable, meaning
you cannot change items of the set
once created. Sets do not contain
duplicate items
Code
• info = {"Anita", 5, False, 5.9, 19}
• print(info)
occur in random order and hence
they cannot be accessed using
index numbers. Also sets do not
allow duplicate values.
Accessing set items:
• ***
Using a For loop
• You can access items of set using a for loop.
Code
• info = {"Anita", 5, False, 5.9, 19}
• for item in info:
• print(item)
Joining Sets
• ---
• Sets in python more or less work in the same
way as sets in mathematics. We can perform
operations like union and intersection on the
sets just like in mathematics.

• ### I. union() and update():


• ---
• The union() and update() methods prints all
items that are present in the two sets. The
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• cities3 = cities.union(cities2)
• print(cities3)
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• cities.update(cities2)
• print(cities)
II. intersection and
intersection_update():
• ---
• The intersection() and intersection_update()
methods prints only items that are similar to
both the sets. The intersection() method
returns a new set whereas
intersection_update() method updates into
the existing set from another set.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• cities3 = cities.intersection(cities2)
• print(cities3)
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• cities.intersection_update(cities2)
• print(cities)
III. symmetric_difference and
symmetric_difference_update():
• ---
• The symmetric_difference() and
symmetric_difference_update() methods
prints only items that are not similar to both
the sets. The symmetric_difference() method
returns a new set whereas
symmetric_difference_update() method
updates into the existing set from another set.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• cities3 = cities.symmetric_difference(cities2)
• print(cities3)
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• cities3 = cities.symmetric_difference(cities2)
• print(cities3)
IV. difference() and
difference_update():
• ---
• The difference() and difference_update()
methods prints only items that are only
present in the original set and not in both the
sets. The difference() method returns a new
set whereas difference_update() method
updates into the existing set from another set.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Seoul", "Kabul", "Delhi"}
• cities3 = cities.difference(cities2)
• print(cities3)
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Seoul", "Kabul", "Delhi"}
• print(cities.difference(cities2))
Set Methods
• ---
• There are several in-built methods used for
the manipulation of set.They are explained
below

• ### isdisjoint():
• ---
• The isdisjoint() method checks if items of
given set are present in another set. This
method returns False if items are present, else
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Tokyo", "Seoul", "Kabul", "Madrid"}
• print(cities.isdisjoint(cities2))
issuperset():
• ---
• The issuperset() method checks if all the items
of a particular set are present in the original
set. It returns True if all the items are present,
else it returns False.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Seoul", "Kabul"}
• print(cities.issuperset(cities2))
• cities3 = {"Seoul", "Madrid","Kabul"}
• print(cities.issuperset(cities3))
issubset():
• ---
• The issubset() method checks if all the items
of the original set are present in the particular
set. It returns True if all the items are present,
else it returns False.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Delhi", "Madrid"}
• print(cities2.issubset(cities))
add()
• ---
• If you want to add a single item to the set use
the add() method.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities.add("Helsinki")
• print(cities)
update()
• ---
• If you want to add more than one item, simply
create another set or any other iterable
object(list, tuple, dictionary), and use the
update() method to add it into the existing set.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities2 = {"Helsinki", "Warsaw", "Seoul"}
• cities.update(cities2)
• print(cities)
remove()/discard()
• ---
• We can use remove() and discard() methods
to remove items form list.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities.remove("Seoul")
• print(cities)
remove and discard is that, if we
try to delete an item which is not
present in set, then remove() raises
an error, whereas discard() does
not raise any error.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities.remove("Tokyo")
• print(cities)
pop()
• ---
• This method removes the last item of the set
but the catch is that we don’t know which
item gets popped as sets are unordered.
However, you can access the popped item if
you assign the pop() method to a variable.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• item = cities.pop()
• print(cities)
• print(item)
del
• ---
• del is not a method, rather it is a keyword
which deletes the set entirely.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• del cities
• print(cities)
• What if we don’t want to delete the entire set,
we just want to delete all items within that
set?
clear():
• ---
• This method clears all items in the set and
prints an empty set.
Code
• cities = {"Tokyo", "Madrid", "Berlin", "Delhi"}
• cities.clear()
• print(cities)
Check if item exists
• ---
• You can also check if an item exists in the set
or not.
Code
Code
• info = {"Carla", 19, False, 5.9}
• if "Carla" in info:
• print("Carla is present.")
• else:
• print("Carla is absent.")

You might also like