By Aditi Mam

By Aditi Mam

Propositional Logic
By Aditi Mam
By Aditi Mam
By Aditi Mam
 By Aditi Mam

q unless ¬p
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
 By Aditi Mam

The notation ∃!xp(x) denotes the proposition "there exists a unique x such
that P(x) is true".

Give the truth values of the following statements :

I. ∃!xP(x) → ∃xP(x)
II. ∃!x ¬ P(x) → ¬∀xp(x)

(A)Both I and II are true

(B) Both I and II are false
(C) I-false, II-true
(D) I-true, II-false
 By Aditi Mam

(A) Both I and II are true

I. ∃!xP(x) → ∃xP(x)
This statement asserts that if there exists a unique x such that P(x) is
true, then there exists at least one x such that P(x) is true.

If there exists a unique x such that P(x) is true, then obviously there
exists at least one x such that P(x) is true. So, this statement is true.

II. ∃!x ¬ P(x) → ¬∀xP(x)

This statement asserts that if there exists a unique x such that ¬P(x)
(not P(x)) is true, then it is not the case that for all x, P(x) is true.

If there exists a unique x such that ¬P(x) is true, then obviously it is

not the case that for all x, P(x) is true. So, this statement is also true.
 By Aditi Mam

Give a compound proposition involving propositions p, q and r that is true

when exactly two of p, q and r are true and is false otherwise.

(A) (p∨q∧¬r) ∧ (p∧¬q∧r) ∧ (¬p∧q∧r)

(B) (p∧q∧¬r) ˄ (p∨q∧¬r) ∧ (¬p∧q∧r)
(C) (p∧q∧¬r) ∨ (p∧¬q∧r) ∧ (¬p∧q∧r)
(D) (p∧q∧¬r) ∨ (p∧¬q∧r) ∨ (¬p∧q∧r)
 By Aditi Mam

Give a compound proposition involving propositions p, q and r that is true

when exactly two of p, q and r are true and is false otherwise.

(A) (p∨q∧¬r) ∧ (p∧¬q∧r) ∧ (¬p∧q∧r)

(B) (p∧q∧¬r) ˄ (p∨q∧¬r) ∧ (¬p∧q∧r)
(C) (p∧q∧¬r) ∨ (p∧¬q∧r) ∧ (¬p∧q∧r)
(D) (p∧q∧¬r) ∨ (p∧¬q∧r) ∨ (¬p∧q∧r)
 By Aditi Mam

In propositional logic P Q is equivalent to (Where ~ denotes NOT):

(A) ~(P∨Q)∧~(Q∨P)
(B) (~P∨Q)∧(~Q∨P)
(C) (P∨Q)∧(Q∨P)
(D) ~(P∨Q)→~(Q∨P)
 By Aditi Mam

(B) (~P∨Q)∧(~Q∨P)

P Q
(P → Q) ∧ (Q → P)
(~ P ∨ Q) ∧ (~ Q ∨ P)
 By Aditi Mam

The equivalence of

¬ ∃x Q(x) is:

(1) ∃ x ¬ Q(x)
(2) ∀x ¬ Q(x)
(3) ¬ ∃x ¬ Q(x)
(4) ∀x Q(x)
 By Aditi Mam

(2) ∀x ¬ Q(x)

Given statement is: ¬ ∃ x Q (x) is : This negation ¬ will change the quantifier and
also it negates the element with the quantifier. So, it becomes. ∀ x ¬ Q (x)
 By Aditi Mam

In mathematical logic, which of the following are statements?

(i) There will be snow in January.

(ii) What is the time now?
(iii) Today is Sunday.
(iv) You must study Discrete mathematics

Choose the correct answer from the code given below:

(1) i and iii

(2) i and ii
(3) ii and iv
(4) iii and iv
 By Aditi Mam

(1) i and iii

Statement (i): There will be snow in January It is a

mathematical statement because either there will be snow
in January or there will not be snow in January. It has only
two possible values either true or false.

Statement (ii): What is the time now? In this case, there is no

meaning of true or false. It is only asking the current time
and you can answer that but not in true or false.

Statement (iii): Today is Sunday It is a statement. As, it is

true of Sunday and false on any other day. So, there are two
possibilities of either true or false.

Statement (iv): You must study Discrete Mathematics. It is

not a statement. It is not giving meaning in true or false
sense.
 By Aditi Mam

The negation of "Some students like hockey" is:

1. Some students dislike hockey

2. Every student dislike hockey
3. Every student like hockey
4. All students like hockey
 By Aditi Mam

2. Every student dislike hockey

~(Some students like hockey) => Every student dislike hockey

 By Aditi Mam

Match List - I with List - II

Choose the correct answer from the options given below :

(1) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(2) (A)-(II), (B)-(I), (C)-(III), (D)-(IV)
(3) (А)-(III), (B)-(I), (C)-(II), (D)-(IV)
(4) (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
 By Aditi Mam

Match List - I with List - II

Choose the correct answer from the options given below :

(1) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(2) (A)-(II), (B)-(I), (C)-(III), (D)-(IV)
(3) (А)-(III), (B)-(I), (C)-(II), (D)-(IV)
(4) (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
 By Aditi Mam

If universe of disclosure are all real numbers, then which of the following are true?

Choose the correct answer from the options given below:

(1) (A) and (B) Only

(2) (A), (C) and (D) Only
(3) (A), (B) and (D) Only
(4) (A), (B), (C) and (D) Only
 By Aditi Mam

If universe of disclosure are all real numbers, then which of the following are true?

Choose the correct answer from the options given below:

(1) (A) and (B) Only

(2) (A), (C) and (D) Only
(3) (A), (B) and (D) Only
(4) (A), (B), (C) and (D) Only
 By Aditi Mam

Set & Relation

By Aditi Mam
By Aditi Mam
 By Aditi Mam

A ∈ P(A)
A ⊈ P(A)
∅ ∈ P(A)
∅ ⊆ P(A)
By Aditi Mam
By Aditi Mam
By Aditi Mam
 By Aditi Mam
Types Of Property Example
Relation
Reflexive if (a,a) € R holds for every element a € A set A = {a,b} then R = {(a,a), (b,b)} is reflexive
Relation relation.
R = Φ not reflexive
Irreflexive if no (a,a) € R holds for every element a € A set A = {a,b} then R = {(a,b), (b,a)} is irreflexive
Relation relation.
R = Φ irreflexive
Symmetric if (b,a) € R holds when (a,b) € R R={(4,5),(5,4),(6,5),(5,6)} on set A={4,5,6} is
Relation symmetric.
R = Φ symmetric
Anti Symmetric if (a,b)€ R and (b,a) € R then a = b Relation R={(1,2),(1,1)} on set A={1,2} is
Relation antisymmetric.
R = Φ anti symmetric
Asymmetric if no (b,a) € R when (a,b) € R R = Φ asymmetric
relation
Transitive if (a,b) € R and (b,c) € R then (a,c) € R for all Relation R={(1,2),(2,3),(1,3)} on set A={1,2,3} is
Relation a,b,c € A transitive.
Equivalence if relation is reflexive, symmetric, and R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2),(1,3),(3,1
Relation transitive )} on set A={1,2,3} is equivalence relation
 By Aditi Mam

2n . 3n(n-1)/2
By Aditi Mam
 By Aditi Mam

Draw Hasse diagram for (D12, /)

By Aditi Mam
 By Aditi Mam

Maximal elements: A, B, F
Minimal elements: C, D, E

Maximal element: E
Minimum element: A
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
 By Aditi Mam

Suppose that R1 and R2 are reflexive relations on a set A.

Which of the following statements is correct?

(A) R1∩R2 is reflexive and R1UR2 is irreflexive.

(B) R1∩R2 is irreflexive and R1UR2 is reflexive.
(C) Both R1∩R2 and R1UR2 are reflexive.
(D) Both R1∩R2 and R1UR2 are irreflexive.
 By Aditi Mam

(C) Both R1∩R2 and R1UR2 are reflexive.

suppose we have A={a,b,c}

so reflexive relation must have R1={(a,a),(b,b),(c,c)} all diagonal elements+ any

thing

similarly R2= {(a,a),(b,b),(c,c)} all diagonal elements+ any thing

so R1 intersection R2 must have {(a,a),(b,b),(c,c)}==>reflexive

and R1 union R2 must have {(a,a),(b,b),(c,c)}==>reflexive

 By Aditi Mam

Let A and B be sets in a finite universal set U.

Given the following:

Which of the following is in order of

increasing size ?
 By Aditi Mam

Answer: D
 By Aditi Mam

Which of the following statements is true?

(1) (Z, ≤ ) is not totally ordered

(2) The set inclusion relation ⊆ is a partial ordering on the power set of a set S
(3) (Z, ≠ ) is a poset
(4) The directed graph is not a partial order
 By Aditi Mam

(2) The set inclusion relation ⊆ is a partial ordering on the power set of a set S

Option 1: (Z, ≤) is not totally ordered

This is false. As, ≤ is totally ordered. A partial ordered set with comparison is
known as totally ordered set. Consider the set contains elements {1, 2, 3, 4}.
This represents as totally ordered set. As 1<= 2, 2<=3, 3< = 4.

Option 2: The set inclusion relation ⊆ is a partial ordering on the power set of a
set S If we consider the set S = {a, b} . So possibilities with this set are {Ø, a, b ,
ab}. As, subset relation is reflexive, antisymmetric and transitive. So, it is
partially ordered. Because if a is subset of b, then b is superset of a.

Option 3: (Z, ≠ ) is a poset It is not partially ordered set. As, it follows symmetric
property. Example if a is not equal to b , then b is also not equal to a. It can not
be poset. Given statement is incorrect.

Option 4: The directed graph is not a partial order This statement is incorrect.
This graph represents partial order. It can be represented as:

It is satisfying the property of partially ordered set. So, given directed graph is
poset. It is reflexive, antisymmetric and transitive.
 By Aditi Mam

A survey has been conducted on methods of commuter travel. Each

respondent was asked to check Bus, Train and Automobile as a
major method of travelling to work. More than one answer was
permitted. The results reported were as follows:

Bus 30 people; Train 35 people; Automobile 100 people; Bus and

Train 15 people; Bus and Automobile 15 people; Train and
Automobile 20 people; and all the three methods 5 people. How
many people completed the survey form?

(1) 120
(2) 165
(3) 160
(4) 115
 By Aditi Mam

(1) 120

A=Bus
B=Train
C=Automobile

n(A∪B∪C)=n(A)+n(B)+n(C)-n(A∩B)-n(B∩C)-n(C∩A)+n(A∩B∩C)
n(A∪B∪C)=30+35+100-15-20-15+5
n(A∪B∪C)=120
 By Aditi Mam

The relation ≤ and > on a boolean algebra are defined as:

x≤y if and only if x∨y=y

x<y means x≤y but x≠y
x≥y means y≤x and
x>y means y<x

Considering the above definitions, which of the following is

not true in the boolean algebra?

(i) If x≤y and y≤z, then x≤z

(ii) If x≤y and y≤x, then x=y
(iii) If x<y and y<z, then x≤y
(iv) If x<y and y<z, then x<y

Choose the correct answer from the code given below:

(1) (i) and (ii) only (2) (ii) and (iii) only
(3) (iii) only (4) (iv) only
 By Aditi Mam

(3) (iii) only

Consider all the options one by one:

1) If x ≤ y and y ≤ z, then x ≤ z This is true by transitive property. As x

≤ y and y ≤ z, then x should be less than or equal to z.

2) If x ≤ y and y ≤ x, then x=y As x<=y, it means x ∨ y = y //given in

question
Y<=x, means x ∨ y = x
Here, x ∨ y = y = x
So, this is true.

3) If x < y and y < z, then x ≤ y In this, it says that x< y which means
x< =y where, x should not be equal to y.
But in this only first condition is given, second is not present.
So, it is false.

4) If x < y and y < z, then x < y This statement is true.

As x< y, then x < y which is same in both the cases.
 By Aditi Mam

Consider the poset ({3, 5, 9, 15, 24, 45}, | ). Which of the following is
correct for the given poset?

(a) There exists a greatest element and a least element.

(b) There exists a greatest element but not a least element.
(c) There exists a least element but not a greatest element.
(d) There does not exist a greatest element and a least element.
 By Aditi Mam

(d) There does not exist a greatest element and a least element.
 By Aditi Mam

What are the greatest lower bound (GLB) and the least upper bound (LUB) of
the sets A={3, 9, 12} and B={1, 2, 4, 5, 10} if they exist in poset (z*,/)?

(1) A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)

(2) A(GLB – 3, LUB – 12); B(GLB –1, LUB – 10)
(3) A(GLB –1, LUB – 36); B(GLB – 2, LUB – 20)
(4) A(GLB – 1, LUB – 12); B (GLB – 2, LUB – 10)
 By Aditi Mam

(1) A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)

In poset (z+, /), / is the division relation. Hence, Hasse diagram for the given POSET
A = {3, 9, 12, 36 (added)}
A with GLB = 3 and LUB = 36

B = {1, 2, 4, 5, 10, 20 (added)}

B with GLB = 1 and LUB = 20
 By Aditi Mam

Consider the following properties:

A Reflexive
B Antisymmetric
C Symmetric

Let A={a, b, c, d, e, f, g} and R={(a, a), (b, b), (c, d), (c, g), (d,
g), (e, e) (f, f), (g,g)} be a relation on A. Which of the following
property (properties) is (are) satisfied by the relation R

a) Only A
b) Only C
c) Both A and B
d) B and not A
 By Aditi Mam

d) B and not A

If a binary relation R over a set X relates every element of X to

itself, it is said to be reflexive. Since (c,c) and (d,d) is not
given in the given question, it is not reflexive.

A binary relation is antisymmetric if there is no pair of

distinct elements of X each of which is related by R to the
other. The given relation R is antisymmetric because for (c,d)
(d,c) is not present in R. Similarly for (c,g) and (d,g).

A binary relation is a type of binary relation. An example is

the relation "is equal to", because if a=b is true then b=a is
also true. Here since (c,d) is pair in a given relation R for
which (d,c) is not present in it. So. it violates the Symmetric
property of the relation. Hence it is not symmetric.
 By Aditi Mam

Let R = {x : x ∈ to N, x is multiple of 3 and x ≤100) and {x : x ∈ to N, x is multiple

of 5 and x < 100). What is the number of elements in
(R ∩ S)⨯(S ∩ R)?

1. 36
2. 33
3. 20
4. 6
 By Aditi Mam

1.36

R= {x| x ∈ N, x is a multiple of 3 and x ≤ 100} = {3, 6, 9, 12, …., 99}

⇒ n (R) = 33.
S = {y| y ∈ N, x is a multiple of 5 and y ≤ 100} = {5, 10, 15, …, 100}
⇒ n (S) = 20.

∵ R ∩ S = {15, 30, 45, 60, 75, 90} = S ∩ R

⇒ (R ∩ S) × (R ∩ S) = {15, 30, 45, 60, 75, 90} × {15, 30, 45, 60, 75, 90}
⟹ n ((R ∩ S) × (R ∩ S) ) = 36.
 By Aditi Mam

Match List - I with List - II

Choose the correct answer from the options given below :

(1) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(2) (A)-(II), (B)-(I), (C)-(III), (D)-(IV)
(3) (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
(4) (A)-(I), (B)-(II), (C)-(IV), (D)-(III)
 By Aditi Mam

Match List - I with List - II

Choose the correct answer from the options given below :

(1) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)

(2) (A)-(II), (B)-(I), (C)-(III), (D)-(IV)
(3) (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
(4) (A)-(I), (B)-(II), (C)-(IV), (D)-(III)
 By Aditi Mam

Graph & Group Theory

By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
By Aditi Mam
 By Aditi Mam

Consider the graph given below as :

Which one of the following graph is isomorphic to the above graph?

 By Aditi Mam

Answer: C

From given figure we can say that, every vertex has degree = 3,

in all options but C, graph has at least one vertex with degree = 4
 By Aditi Mam

A certain tree has two vertices of degree 4, one vertex of degree 3 and one
vertex of degree 2. If the other vertices have degree 1, how many vertices are
there in the graph?

(A) 5
(B) n – 3
(C) 20
(D) 11
 By Aditi Mam

(D) 11

There are 2 vertices of degree 4, 1 vcertex of degree 3, 1 vcertex of degree 2 and

vertex of degree one is unknown.

Let's assume k be the nof vertex of degree one.

Total vertex = 2 + 1 + 1 + k = k + 4.
Number of edges = vertex - 1 i.e. k + 4 - 1 = k + 3.
Now apply handshaking lemma(For more information on handshaking
2 * 4 + 1 * 3 + 1 * 2 + 1 * K = 2 * (No of edges)
i.e. 13 + k = 2 * (k + 3) k = 7.
Total vertex = 7 + 4 = 11.
 By Aditi Mam

Consider the Graph shown below :

This graph is a ...............

(A) Complete Graph

(B) Bipartite Graph
(C) Hamiltonian Graph
(D) All of the above
 By Aditi Mam

(C) Hamiltonian Graph

A. In complete graph, every vertex should have an edge to all other

vertices.
In given graph, there is no edge between D and B, A and C.
Graph is not complete

B. If nodes in graph can be colored with just two colors, it is bipartitie.

Suppose we colored A with red and all neighbours B, D, F with blue.
But neighbours B, F and D,F are connected. So they cant have same
color.
It is not 2 colorable
It is not bipartite

C. According to Dirac's theorem, in a graph of n nodes, if each node has

degree greater than n/2, graph is Hamiltonian
In given graph n =6
All nodes have degree =4
Hence graph is Hamiltonian
Sample Hamiltonian path is ABCDEF
 By Aditi Mam

Which of the following propertyies a Group G must hold, in

order to be an Abelian group?

(a) The distributive property

(b) The commutative property
(c) The symmetric property

Codes:

(A) (a) and (b)

(B) (b) and (c)
(C) (a) only
(D) (b) only
 By Aditi Mam

(D) (b) only

 By Aditi Mam

The number of different spanning trees in complete graph, K4 and

bipartite graph K2,2 have .......... and .....…. respectively.

(A) 14, 14
(B) 16, 14
(C) 16, 4
(D) 14, 4
 By Aditi Mam

(C) 16, 4
 By Aditi Mam

A clique in a simple undirected graph is a complete subgraph that is not contained

in any larger complete subgraph. How many cliques are there in the graph shown
below?

(A) 2
(B) 4
(C) 5
(D) 6
 By Aditi Mam

(C) 5
 By Aditi Mam

Consider the following statements:

(A) Any tree is 2-colorable

(B) A graph G has no cycles of even length if it is bipartite.
(C) A graph G is 2-colorable if is bipartite
(D) A graph G can be colored with d+1 colors if d is the maximum
degree of any vertex in the graph G.
(E) A graph G can be colored with O(log) colors if it has O(v) edges.

Choose the correct answer from the options given below

a) (C) and (E) are incorrect

b) (B) and (C) are incorrect
c) (B) and (E) are incorrect
d) (A) and (D) are incorrect
 By Aditi Mam

c) (B) and (E) are incorrect

Any tree is 2-colourable. True every tree is no loops and a bipartite

graph with chromatic number 2. Odd levels coloured with one
colour and even levels coloured with another colour.

A graph G has no cycles of even length if it is bipartite. False

A graph G is 2-colourable if is bipartite True. A graph K(2,3), set of

V1 vertices coloured with one colour and set of V2 vertices
coloured with another colour.

A graph G can be coloured with d+1 colours if d is the maximum

degree of any vertex in the graph [Link] as the vertex of degree d
means it is adjacent to d vertices hence need d+1 different colours
required.

A graph G can be coloured with O(log∣v∣) colours if it has O(∣v∣)

degrees False as Kn has O(n^2) edges with chromatic number n
so it needs O (√ V) colours
 By Aditi Mam

Which of the following graphs is/are planar?

Choose the correct answers from the option given below:

a) A and B only
b) A only
c) B and C only
d) B only
 By Aditi Mam

a) A and B only
Figure A can be redraw as:

Figure B can be redraw as :

But, Figure C cant not be redraw in such a way that no

edge intersect each other. Therefore ,Figure A and B both
are planar graph.
 By Aditi Mam

Given below are two statements

Statement I: In an undirected graph, number of odd degree

vertices is even.

Statement II: In an undirected graph, sum of degrees of all

vertices is even.

In light of the above statements, choose the correct answer

from the options given below.

a) Both Statement I and Statement II are false

b) Both Statement I and Statement II are true
c) Statement I is false but Statement II is true
d) Statement I is true but Statement II is false
 By Aditi Mam

b) Both Statement I and Statement II are true

In an undirected graph, number of odd degree vertices is even

as per handshaking lemma.

In an undirected graph, sum of degrees of all vertices is even,

as sum of degree of the vertices = 2 * number of edges .
 By Aditi Mam

Miscellaneous
 By Aditi Mam

How many cards must be chosen from a deck to guarantee

that atleast

i. two aces of two kinds are chosen.

ii. two aces are chosen.
iii. two cards of the same kind are chosen.
iv. two cards of two different kinds are chosen

(A) 50, 50, 14, 5

(B) 51, 51, 15, 7
(C) 52, 52, 14, 5
(D) 51, 51, 14, 5
 By Aditi Mam

(A) 50, 50, 14, 5

since we have to be sure (guarantee) consider the worst cases for

all

i) two aces of same kind are chosen (first 48 cards without ace 49th
will surely be an ace and 50 th will be of another ace) Here kind
word is incorrectly given

ii) two aces are chosen first 48 cards can be without ace then 49th
and 50th will definitely be ace

iii)two cards of same kind that is same number so first 13 can be of

different numbers but 14 th will definitely match with someone

iv)2 cards of 2 different kinds let first 4 are of same number say all
ace or all 2 etc now 5th one will be definitely different number

So ans is A 50 50 14 5
 By Aditi Mam

Consider a set A = {1, 2, 3, …….., 1000}. How many members of

A shall be divisible by 3 or by 5 or by both 3 and 5 ?

(A) 533
(B) 599
(C) 467
(D) 66
 By Aditi Mam

(C) 467

(A U B ) = (A) + (B) - (A ∩ B)
A=1000/3 = 333 [No's divisible by 3]
B=1000/5=200 [No's divisible by 5]
A ∩ B= 1000/15=66 [No's divisible by both 3 and 5]
A U B = 333+200-66=533-66=467
 By Aditi Mam

How many ways are there to pack six copies of the same
book into four identical boxes, where a box can contain as
many as six books?

a) 4
b) 6
c) 7
d) 9
 By Aditi Mam

d) 9

Here, there are six copies of the same book into four identical
boxes(same box). We will enumerate all ways to pack the books. For
each way to pack the books, we will list the number of books in the
box with the largest number of books, followed by the numbers of
books in each box containing at least one book, in order of
decreasing the number of books in a box

6,0,0,0
5,1,0,0
4,2,0,0
4,1,1,0
3,3,0,0
3,2,1,0
3,1,1,1
2,2,2,0
2,2,1,1.

So the total number of ways is 9.

 By Aditi Mam

The number of positive integers not exceeding 100 that are

either odd or the square of an

a) 63
b) 30
c) 55
d) 60
 By Aditi Mam

c) 55

By using inclusion exclusion principle, |AUB|= |A|+|B|-|A∩B|

Number of odd numbers in the range of (1-100)=100 ÷ 2=50 (1,3,5,7....97,99)=|A|
Number of squares=10 (1,4,9,16,25,36,49,64,81,100)=|B|
Number of odd numbers and squares=5 (1,9,25,49,81)=|A∩B|
Number of positive integers not exceeding 100 that are either odd or the
square=|AUB|= 50+10-5=55
 By Aditi Mam

How many ways are there to assign 5 different jobs to 4

different employees if every employee is assigned at least 1
job?

a) 1024
b) 20
c) 240
d) 625
 By Aditi Mam

c) 240

For Case 1,Number of ways : 5C2 * 3C1 * 2C1 * 1C1 =10*3*2*1 = 60ways
For Case 2,Number of ways : 5C1 * 4C2 * 2C1 * 1C1 =5*6*2*1= 60ways
For Case 3,Number of ways : 5C1 * 4C1 * 3C2 * 1C1 =5*4*3*1 = 60ways
For Case 4,Number of ways : 5C1 * 4C1 * 3C1 * 2C2 =5*4*3*1 = 60ways
Total number of possible ways is = (60+60+60+60)=240
 By Aditi Mam

A company stores products in a warehouse. Storage bins in this

warehouse are specified by their aisle, location in the aisle, and self.
There are 50 aisles, 85 horizontal locations in each aisle, and 5
shelves throughout the warehouse. What is the least number of
products the company can have so that at least two products must
be stored in the same bin?

a) 21251
b) 251
c) 4251
d) 426
 By Aditi Mam

a) 21251

In the warehouse , No. of aisles = 50

Horizontal locations in each aisle = 85
No. of shelves =5
Therefore, total number of bins = 50 * 85 * 5 = 21250

According to the pigeonhole principle, if there are N+1 pigeon then

there must be N pigeonholes, such that at least two pigeons are in
same pigeonholes.
Here, N = 21250,therefore number of products = 21250+1 =21251 so
that at least two products are in the same bin.
 By Aditi Mam

Let us assume a person climbing the stairs can take one stair or two
stairs at a time. How many ways can this person climb a flight of
eight stairs?

a) 21
b) 24
c) 31
d) 34
 By Aditi Mam

d) 34

Let us consider 1 as one step and 2 as two step. Consider the

following conditions to reach the flight with 1 or 2.
1, 1, 1, 1, 1, 1, 1, 1 - This can be done in 8C0 ways = 1.
1, 1, 1, 1, 1, 1, 2 - This can be done in 7C1 ways = 7.
1, 1, 1, 1, 2, 2 - This can be done in 6C2 ways = 15.
1, 1, 2, 2, 2 - This can be done in 5C3 ways = 10.
2, 2, 2, 2 - This can be done in 4C0 ways = 1

Total number of ways = 1 + 7 + 15 + 10 + 1 = 34

 By Aditi Mam

Find the sum of all four digit numbers formed using the digits 1,2,4
and 6 .

1. 86,658
2. 88,8858
3. 91,958
4. 93,358
 By Aditi Mam
1) 86,658.

There are total 4! = 4*3*2*1 = 24 ways to permute 4 different digits

in 4 places.
The sum of all 4-digit numbers can be found by calculating the
sum for each of the 4 positions (Thousands, Hundreds, Tens, and
Units), then summing those results.
For each position:
Each of the 4 numbers (1, 2, 4, 6) will appear in each position 1/4th
of the time in the total permutations, so 24 / 4 = 6 times for each.
The sum of the digits is 1 + 2 + 4 + 6 = 13. So, the contribution for each
position will be 13 * 6 = 78.
Now, we calculate the total sum taking into account the place
value:
The Thousands place contributes 78 * 1000 = 78,000.
The Hundreds place contribute 78 * 100 = 7,800. The Tens place
gives 78 * 10 = 780.
The Units place contributes 78 * 1 = 78.
Adding those up, the total sum of all 4-digit numbers that can be
made with the digits 1, 2, 4, and 6 is 78,000 + 7,800 + 780 + 78 =
86,658. So the answer is option 1) 86,658.
 By Aditi Mam

What is the probability that a positive integer selected at random

from the set of positive integer not exceeding 100 is divisible by
either 2 or 5?

(1) 10/5
(2) 3/5
(3) 2/5
(4) 1/5
 By Aditi Mam
(2) 3/5

We need to find the probability that a positive integer, selected

randomly from 1 to 100 is divisible by either 2 or 5.
First, find the total number of positive integers from 1 to 100, which
is 100.
Divisible by 2: Every second number is divisible by 2, so there are
100 / 2 = 50 such numbers.
Divisible by 5: Every fifth number is divisible by 5, so there are 100 /
5 = 20 such numbers. There is an intersection between these two
sets of numbers, namely, those numbers which are divisible by
both 2 and 5 (that is, numbers divisible by 10). To avoid counting
these twice, we need to subtract these from the total.
Divisible by 10 (both 2 and 5): Every tenth number is divisible by 10,
so there are 100 / 10 = 10 such numbers.
So, numbers that are divisible by either 2 or 5 are 50 (divisible by 2)
+ 20 (divisible by 5) - 10 (divisible by both) = 60.
Now, the probability of a number randomly picked from 1 to 100
being divisible by either 2 or 5 is 60/100 = 3/5.
By Aditi Mam