O Level Maths 1.1 (2024)
O Level Maths 1.1 (2024)
c h ap t e r - 2
se t s
P a g e 137 o f 176
P a g e 138 o f 176
Sets:
Types of sets:
Universal set is denoted by ɛ. A universal set is one, which contains the total number of
elements. It contains all available elements for a particular question.
Finite set is one in which there are finite or limited numbers of elements, e.g. {1, 2,
3…..10}
Equal sets: sets are considered to be equal sets if they have exactly the same elements,
e.g. A {2, 4, 6, 8}, B {all positive even numbers less than 10}, therefore A & B are equal
sets.
Null set: A null set does not contain any elements. They are denoted by empty curly
brackets, e.g. { }
Subset: A subset is divided into 2 categories; proper subset and finite subset. If every
element of a set A is also an element of set B, while set B contains other elements too
then A is a finite subset of B and is written as A B, whereas if A contains some elements
of set B then A does not equal to B, then A is called a proper subset of B and is written as
A B.
Intersection: The intersections of 2 or more sets are the common elements in those
sets. Intersection is denoted by ᴒ, e.g. if A (1,2,3) and B (2,3,5) then A ᴒ B= (2,3)
Union: The union of 2 or more sets represents all the elements that are present in the
sets without repetition. Union is denoted by U, e.g. if A is {1, 2, 3} and B is {2, 3, 5} then
A U B= {1, 2, 3, 5}
Compliment: A compliment of any set is the elements that are not present in that set
but are present in the universal set. Compliment is denoted by ‘. Therefore, if the
compliment of A is required, it will be denoted by A’. A’ will be all the elements that are
present in the universal set except those that are present in A.
Disjoint sets: When the sets have no common element present in their sets, or the
intersection of their sets is zero then these sets are known as disjoint sets. Disjoint sets
are denoted by Φ, e.g. if A and B are disjoint sets they will be represented as A ᴒ B= Φ
Number of elements: if in any set number of elements is required rather than the
element itself, it is denoted by n before the set notation, e.g. if we are required to find n
P a g e 139 o f 176
SETS (P1)
SHADING
Q1)
Q2)
Q3)
P a g e 142 o f 176
Q4)
Q5)
Q6)
Q7)
P a g e 143 o f 176
Q8)
Q9)
Q10)
Q11))
Q12)
P a g e 144 o f 176
Q13)
Q14)
BACKWARD APPROACH
Q1)
Q2)
P a g e 145 o f 176
Q3)
Q4)
Q5)
Q6)
P a g e 146 o f 176
BASIC
Q1)
Q2)
Q3)
P a g e 147 o f 176
Q4)
Q5)
Q6)
Q7)
Q8)
P a g e 148 o f 176
Q9)
Q10)
Q11)
Q12)
Q13)
P a g e 149 o f 176
Q14)
Q15)
Q16)
Q17)
P a g e 150 o f 176
Q18)
Q19)
Q20)
P a g e 151 o f 176
Q21)
Q22)
Q23)
Q24)
P a g e 152 o f 176
Q25)
WORD PROBLEMS
Q1)
Q2)
Q3)
P a g e 153 o f 176
Q4)
Q5)
P a g e 154 o f 176
Q6)
Q7)
Q8)
Q9)
P a g e 155 o f 176
Q10)
MIN/MAX
Q1)
P a g e 156 o f 176
SHADE
Q1) Q6)
Q2) Q7)
Q8)
Q3)
Q9)
Q4)
Q10)
Q5) Q11)
P a g e 157 o f 176
Q12)
Q13)
Q14)
BACKWARD APPROACH
Q1)
Q2)
Q3)
Q4)
Q5)
Q6)
P a g e 158 o f 176
BASIC
Q1) Q7)
Q8)
Q2)
Q9)
Q3)
Q10)
Q11)
Q4) Q12)
Q5) Q13)
Q6) Q14)
P a g e 159 o f 176
Q15) Q22)
Q16)
Q23)
Q17)
Q24)
Q18)
Q25)
Q19)
Q20)
Q21)
P a g e 160 o f 176
WORD PROBLEM
Q1) Q7)
Q2) Q8)
Q3) Q9)
Q10)
Q6)
P a g e 161 o f 176
SETS (P2)
SHADING
Q1)
Q2)
Q3)
P a g e 162 o f 176
BACKWARD APPROACH
Q1)
Q2)
Q3)
P a g e 163 o f 176
Q4)
Q5)
BASIC
Q1)
P a g e 164 o f 176
Q2)
Q3)
P a g e 165 o f 176
Q4)
Q5)
Q6)
P a g e 166 o f 176
Q7)
Q8)
Q9)
Q10)
P a g e 167 o f 176
Q11)
Q12)
P a g e 168 o f 176
Q13)
Q14)
Q15)
P a g e 169 o f 176
WORD PROBLEMS
Q1)
Q2)
Q3)
Q4)
P a g e 170 o f 176
Q5)
Q6)
Q7)
P a g e 171 o f 176
Q8)
Q9)
P a g e 172 o f 176
Q1)
Q2)
Q3)
BACKWARD APPROACH
Q1)
Q2)
Q3)
Q4)
P a g e 173 o f 176
Q5)
BASIC
Q1)
Q2)
Q3)
P a g e 174 o f 176
Q4)
Q5)
Q6)
Q7)
Q8)
P a g e 175 o f 176
Q9)
Q10)
Q11)
Q12)
Q13)
Q14)
Q15)
P a g e 176 o f 176
WORD PROBLEMS
Q1)
Q2)
Q3)
Q4)
Q5)
Q6)
Q7)
Q8)
Q9)