How to use function symmetric_difference in Python? - with practical example

Symmetric difference is a set operation in Python that returns a new set with elements that are present in either of the sets, but not in both. It is represented by the caret (^) operator or by using the symmetric_difference() method. Example 1: Let's say we have two sets, set1 and set2, and we want to find the symmetric difference between them. Step 1: Define two sets Step 2: Use the caret (^) operator to find the symmetric difference Step 3: Print the result 
set1 = {1, 2, 3, 4, 5}
set2 = {4, 5, 6, 7, 8}

sym_diff = set1 ^ set2
print(sym_diff)

In this example, we have two sets, set1 and set2. The symmetric difference between the two sets is {1, 2, 3, 6, 7, 8}, which are elements present in either set1 or set2, but not in both. Example 2: Let's use the symmetric_difference() method to find the symmetric difference between two sets. Step 1: Define two sets Step 2: Use the symmetric_difference() method to find the symmetric difference Step 3: Print the result 
set3 = {10, 20, 30, 40, 50}
set4 = {40, 50, 60, 70, 80}

sym_diff = set3.symmetric_difference(set4)
print(sym_diff)

In this example, we have two sets, set3 and set4. The symmetric difference between the two sets is {10, 20, 30, 60, 70, 80}, which are elements present in either set3 or set4, but not in both.

Comments

Post a Comment

Popular posts from this blog

What is the difference between a module and a package in Python?

In the first example, we are going to explore the concept of a module in Python. A module is a file containing Python code that can define functions, classes, and variables. It allows you to organize your code into reusable components. Here is an example code snippet demonstrating the use of a module in Python: # Create a module named mymodule.py # Define a function inside the module def greet(name): return "Hello, " + name In the code above, we have created a module named mymodule.py that defines a function called greet . This function takes a name as an argument and returns a greeting message. To use this module in another Python script, we can import it using the import keyword. import mymodule message = mymodule.greet("Alice") print(message) When we run the above code, it will import the mymodule module and use the greet function to print a greeting message for the name "Alice". In the second example, we are going to discuss the ...
Read more

What are the different evaluation metrics used in machine learning?

In the first example, we are going to demonstrate how to use accuracy as an evaluation metric in machine learning using Python. Here is the code: from sklearn.metrics import accuracy_score y_true = [0, 1, 1, 0, 1] y_pred = [0, 1, 0, 0, 1] accuracy = accuracy_score(y_true, y_pred) print("Accuracy:", accuracy) Step 1: Import the accuracy_score function from sklearn.metrics. Step 2: Define two lists, y_true and y_pred, containing the true and predicted values. Step 3: Calculate the accuracy score by calling the accuracy_score function with y_true and y_pred as arguments. Step 4: Print out the accuracy score. In the second example, we are going to demonstrate how to use precision and recall as evaluation metrics in machine learning using Python. Here is the code: from sklearn.metrics import precision_score, recall_score y_true = [0, 1, 1, 0, 1] y_pred = [0, 1, 0, 0, 1] precision = precision_score(y_true, y_pred) recall = recall_score(y_true, y_pred) print("Precis...
Read more

Sorting Algorithms in Python? - with practical example

Sorting algorithms are essential tools in computer science to organize data in a specific order. In Python, there are various sorting algorithms available that can be used to arrange elements in a list in a particular sequence. Two common sorting algorithms in Python are Bubble Sort and Merge Sort. Example 1: Bubble Sort Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the list is sorted. Step 1: Compare the first two elements of the list. If the first element is greater than the second element, swap them. Step 2: Move to the next pair of elements and repeat the comparison and swapping process until the end of the list. Step 3: Repeat steps 1 and 2 until no more swaps are needed, indicating that the list is sorted. def bubble_sort(arr): n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] > arr[j+1]: ...
Read more