Introduction of SetsA set is defined as a collection of distinct objects of the same type or class of objects. The purposes of a set are called elements or members of the set. An object can be numbers, alphabets, names, etc. Examples of sets are:
We broadly denote a set by the capital letter A, B, C, etc. while the fundamentals of the set by small letter a, b, x, y, etc. If A is a set, and a is one of the elements of A, then we denote it as a ∈ A. Here the symbol ∈ means "Element of." Sets Representation:Sets are represented in two forms: a) Roster or tabular form: In this form of representation we list all the elements of the set within braces { } and separate them by commas. Example: If A= set of all odd numbers less then 10 then in the roster from it can be expressed as A={ 1,3,5,7,9}. b) Set Builder form: In this form of representation we list the properties fulfilled by all the elements of the set. We note as {x: x satisfies properties P}. and read as 'the set of those entire x such that each x has properties P.' Example: If B= {2, 4, 8, 16, 32}, then the set builder representation will be: B={x: x=2^{n}, where n ∈ N and 1≤ n ≥5} Standard Notations:
Cardinality of a Sets:The total number of unique elements in the set is called the cardinality of the set. The cardinality of the countably infinite set is countably infinite. Examples:1. Let P = {k, l, m, n} 2. Let A is the set of all nonnegative even integers, i.e. As A is countably infinite set hence the cardinality.
Next TopicTypes of Sets

Ansible
Mockito
Talend
Azure
SharePoint
Powershell
Kali Linux
OpenCV
Kafka
Pandas
Joomla
Reinforcement