Discrete Structure Solved MCQs

1) Let A and B be any two arbitrary events then

which one of the following is true ?
1. P( A intersection B) = P(A). P(B)
2. P(A union B) = P(A) + P(B)
3. P(AB) = P(A intersection B). P(B)
4. P(A union B) >= P(A) + P(B)

2) If X and Y be the sets. Then the set ( X - Y) union (Y

- X) union (X intersection Y ) is equal to?
1. X union Y
2. X union Y
c c

3. X intersection Y
4. X intersection Y
c c

3) If G is an undirected planer graph on n vertices

with e edges then ?
1. e<=n
2. e<=2n
3. e<=3n
 4. None of these

4) W hich of the following statement is false ?

1. G is connected and is circuitless
2. G is connected and has n edges
3. G is minimally connected graph
4. G is circuitless and has n- 1 edges

5) Probability that two randomly selected cards

from a set of two red and two black cards are of
same
color is ?
1. 1 / 2
2. 1 / 3
3. 2 / 3
4. None of these

6) The number of circuits that can be created by

adding an edge between any two vertices in a tree is ?
1. Two
2. Exactly one
3. At least two
4. None
7) In a tree between every pair of vertices there is ?
1. Exactly one path
2. A self loop
3. Two circuits
4. n number of paths

8) The minimum number of cards to be dealt from an

arbitrarily shuffled deck of 52 cards to guarantee that
three cards are from some same suit is ?
1. 8
2. 3
3. 9
4. 12

9) Context free languages are closed under ?

1. union, intersection
2. Intersection , complement
3. union , kleene star
4. Complement , kleene star

10) Let R be a symmetric and transitive relation on

a set A. Then ?
1. R is reflexive and hence a partial order
2. R is reflexive and hence an equivalence relation
 3. R is not reflexive and hence not an
equivalence relation
4. None of above

SET- 2

1) A graph is a collection of......?

1. Row and columns
2. Vertices and edges
3. Equations
4. None of these

Explanation: A graph contains the edges and vertices

2) The degree of any vertex of graph is.......?

1. The number of edges incident with vertex
2. Number of vertex in a graph
3. Number of vertices adjacent to that vertex
4. Number of edges in a graph

Explanation: The number of edges connected on a vertex v with

the self loop counted twice is called the degree of vertex.

3) If for some positive integer k, degree of vertex

d(v)=k for every vertex v of the graph G, then G
is called ?
 1. K graph
2. K- regular graph
3. Empty graph
4. All of above

Explanation: A graph in which all vertices are of equal degree is

called regular graph.

4) A graph with no edges is known as empty

graph. Empty graph is also known as... ?
1. Trivial graph
2. Regular graph
3. Bipartite graph
4. None of these

Explanation: Trivial graph is the second name for empty graph.

5) Length of the walk of a graph is.......?

1. The number of vertices in walk W
2. The number of edges in walk W
3. Total number of edges in a graph
4. Total number of vertices in a graph

Explanation: A walk is defined as finite altering sequence of

vertices and edges. No Edges appear more than once but vertex
may appear more than once.
6) If the origin and terminus of a walk are same, the walk is
known as... ?
1. Open
2. Closed
3. Path
4. None of these

Explanation: A walk which begins and ends with same vertex is

called closed walk otherwise it is open.

7) A graph G is called a ..... if it is a connected

acyclic graph ?
1. Cyclic graph
2. Regular graph
3. Tree
4. Not a graph

8) Eccentricity of a vertex denoted by e(v) is

defined by ?
1. max { d(u, v): u belongs to v, u does not equal to v
: where d(u, v) is the distance between u& v}
2. min { d(u, v): u belongs to v, u does not equal to v }
3. Both A and B
4. None of these

Explanation: The eccentricity E(v) of a vertex V in the graph is

the distance from v to the vertex farthest from v in G.

9) Radius of a graph, denoted by rad(G) is defined

by......?
1. max {e(v): v belongs to V }
2. min { e(v): v belongs to V}
3. max { d(u, v): u belongs to v, u does not equal to v }
4. min { d(u, v): u belongs to v, u does not equal to v }

Explanation: The diameter or radius of a graph G is largest

distance between two vertices in the graph G.

10)The complete graph K, has... different

spanning trees?
1.
n n- 2
2. n*n
3. nn
4. n2
.

SET- 3

1) A tour of G is a closed walk of graph G which

includes every edge G at least once. A ..... tour of G
is a tour which includes every edge of G exactly once
?
1. Hamiltonian
2. Planar
3. Isomorphic
4. Euler

Explanation: If some closed walk in a graph contains all the

edges then the walk is called Euler.
2) W hich of the following is not a type of graph ?
1. Euler
2. Hamiltonian
3. Tree
4. Path

Explanation:Path is a way from one node no another but not a

graph.

3) Choose the most appropriate definition of

plane graph ?
1. A graph drawn in a plane in such a way that
any pair of edges meet only at their end
vertices
2. A graph drawn in a plane in such a way that if the
vertex set of graph can be partitioned into two
non
- empty disjoint subset X and Y in such a way that
each edge of G has one end in X and one end in
Y.
3. A simple graph which is Isomorphic to Hamiltonian
graph
4. None of these

.
4) A continuous non - intersecting curve in the
plane whose origin and terminus coincide ?
1. Planer
2. Jordan
3. Hamiltonian
4. All of these
Explanation: The jordan graph is the set of all vertices of
minimum eccentricity that is the set of all vertices A where the
greatest distance to other vertex B is minimal.

5) Polyhedral is.......?
1. A simple connected graph
2. A plane graph
3. A graph in which the degree of every vertex
and every face is atleast 3
4. All of above

Explanation: A polyhedral graph is the undirected graph formed

from the vertices and edges of a convex polyhedron

6) A path in graph G, which contains every vertex of G once

and only once ?
1. Eulartour
2. Hamiltonian Path
3. Eular trail
4. Hamiltonian tour

Explanation:A Hamiltonian circuit in a connected graph is

defined as a closed walk that traverse every vertex of G exactly
once except the starting vertex.

7) A minimal spanning tree of a graph G is......?

1. A spanning sub graph
2. A tree
3. Minimum weights
4. All of above
Explanation: A tree is said to be spanning tree of connected
graph G if it is subgraph of G and contains all the vertices of G.

8) A tree having a main node, which has

no predecessor is?
1. Spanning tree
2. Rooted tree
3. W eighted tree
4. None of these

Explanation:A tree in which one vertex distinguish from all other

is called rooted tree.

9) Diameter of a graph is denoted by diam(G)

is defined by..?
1. max (e(v) : v belongs to V)
2. max( d(u, v) )
3. Both A and B
4. None of these

Explanation: The diameter of a graph G is largest distance

between two vertices in a graph G.

10) A vertex of a graph is called even or

odd depending upon ?
1. Total number of edges in a graph is even or odd
 2. Total number of vertices in a graph is even or odd
3. Its degree is even or odd
4. None of these

Explanation: The vertex of a graph is called even or odd based

on its degree.

SET- 4

1) Let A and B be any two arbitrary events then

which one of the following is true ?
1. P( A intersection B) = P(A). P(B)
2. P(A union B) = P(A) + P(B)
3. P(AB) = P(A intersection B). P(B)
4. P(A union B) >= P(A) + P(B)

2) If X and Y be the sets. Then the set ( X - Y) union (Y

- X) union (X intersection Y ) is equal to?
1. X union Y
2. X union Y
c c

3. X intersection Y
4. X intersection Y
c c

3) If G is an undirected planer graph on n vertices

with e edges then ?
1. e<=n
2. e<=2n
 3.e<=3n
4. None of these

4) W hich of the following statement is false ?

1. G is connected and is circuitless
2. G is connected and has n edges
3. G is minimally connected graph
4. G is circuitless and has n- 1 edges

5) Probability that two randomly selected cards

from a set of two red and two black cards are of
same
color is ?
1. 1 / 2
2. 1 / 3
3. 2 / 3
4. None of these

6) The number of circuits that can be created by

adding an edge between any two vertices in a tree is ?
1. Two
2. Exactly one
3. At least two
4. None
7) In a tree between every pair of vertices there is ?
1. Exactly one path
2. A self loop
3. Two circuits
4. n number of paths

8) The minimum number of cards to be dealt from an

arbitrarily shuffled deck of 52 cards to guarantee that
three cards are from some same suit is ?
1. 8
2. 3
3. 9
4. 12

9) Context free languages are closed under ?

1. union, intersection
2. Intersection , complement
3. union , kleene star
4. Complement , kleene star

10) Let R be a symmetric and transitive relation on

a set A. Then ?
1. R is reflexive and hence a partial order
2. R is reflexive and hence an equivalence relation
 3. R is not reflexive and hence not an
equivalence relation
4. None of above

Discrete Structure [ MCQ's]

1. W hich of the following bits is the negation of the bits “ 010110” ?
a) 111001
b) 001001
c) 101001
d) 111111

2. W hich of the following option is suitable, if A is “ 10110110” , B

is” 11100000” and C is” 10100000” ?
a) C=A or B
b) C=~A
c) C=~B
d) C=A and B

3. How many bits string of length 4 are possible such that they contain 2
ones and 2 zeroes?
a) 4
b) 2
c) 5
d) 6

4. If a bit string contains {0, 1} only, having length 5 has no more than 2
ones in it. Then how many such bit strings are possible?
a) 14
b) 12
c) 15
d) 16

5. If A is “ 001100” and B is “ 010101” then what is the value of A (Ex- or)

B?
a) 000000
b) 111111
c) 001101
d) 011001

6. The Ex- nor of this string “ 01010101” with “ 11111111”

is? a) 10101010
b) 00110100
c) 01010101
d) 10101001

7. W hat is the one’ s complement of this string “ 01010100” ?

a) 10101010
b) 00110101
c) 10101011
d) 10101001
.
8. W hat is the 2’ s complement of this string “ 01010100” ?
a) 10101010
b) 00110100
c) 10101100
d) 10101001
9. If in a bits string of {0, 1}, of length 4, such that no two ones are together.
Then the total number of such possible strings are?
a) 1
b) 5
c) 7
d) 4

10. Let A: “ 010101” , B=?, If { A (Ex- or) B } is a resultant string of all ones
then which of the following statement regarding B is correct?
a) B is negation of A
b) B is 101010
c) {A (and) B} is a resultant string having all zeroes
d) All of the mentioned

11.W hich of the following statement is a proposition?

a) Get me a glass of milkshake
b) God bless you!
c) W hat is the time now?
d) The only odd prime number is 2

12.The truth value of ‘ 4+3=7 or 5 is not prime’ .

a) False
b) True

.
13.W hich of the following option is true?
a) If the Sun is a planet, elephants will fly
b) 3 +2 = 8 if 5- 2 = 7
c) 1 > 3 and 3 is a positive integer
d) - 2 > 3 or 3 is a negative integer

Explanation: Hypothesis is false, thus the whole statement is true.

14.W hat is the value of x after this statement, assuming the initial value of x
is 5?
‘ If x equals to one then x=x+2 else x=0’ .
a) 1
b) 3
c) 0
d) 2

.
15. Let P: I am in Bangalore.; Q: I love cricket.; then q - > p(q implies p) is?
a) If I love cricket then I am in Bangalore
b) If I am in Bangalore then I love cricket
c) I am not in Bangalore
d) I love cricket

16. Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil gets
out on first ball. Now if P is true and Q is false then which of the following
can be true?
a) Raju bowled and Sahil got out on first ball
b) Raju did not bowled
c) Sahil bowled and Saurabh hits a century
d) Sahil bowled and Saurabh got out

17. The truth value ‘ 9 is prime then 3 is even’ .

a) False
b) True

18. Let P: I am in Delhi.; Q: Delhi is clean.; then q ^ p(q and p) is?

a) Delhi is clean and I am in Delhi
b) Delhi is not clean or I am in Delhi
c) I am in Delhi and Delhi is not clean
d) Delhi is clean but I am in Mumbai

19. Let P: This is a great website, Q: You should not come back here. Then
‘ This is a great website and you should come back here.’ is best
represented by?
a) ~P V ~Q
b) P ∧ ~Q
c) P V Q
d) P ∧ Q

20. Let P: W e should be honest., Q: W e should be dedicated., R: W e

should be overconfident. Then ‘ W e should be honest or dedicated but
not
overconfident.’ is best represented by?
a) ~P V ~Q V R
b) P ∧ ~Q ∧ R
c) P V Q ∧ R
d) P V Q ∧ ~R

21. Let P and Q be statements, then P<- >Q is logically equivalent to

__________
a) P<- >~Q
b) ~P<- >Q
c) ~P<- >~Q
d) None of the mentioned

22.W hat is the negation of the statement A- >(B v(or) C)?

a) A ∧ ~B ∧ ~C
b) A- >B- >C
c) ~A ∧ B v C
d) None of the mentioned

23.The compound statement A- > (A- >B) is false, then the truth values of A,
B are respectively _ _ _ _ _ _ _ _ _
a) T, T
b) F, T
c) T, F
d) F, F

24. The statement which is logically equivalent to A∧ (and) B is?

a) A- >B
b) ~A ∧ ~ B
c) A ∧ ~B
d) ~(A- >~B)

25.Let P: W e give a nice overall squad performance, Q: W e will win

the match.
Then the symbolic form of “ W e will win the match if and only if we give a
nice overall squad performance. “ is?
a) P v Q
b) Q ∧ P
c) Q<- >P
d) ~P v Q

26.Let P, Q, R be true, false true, respectively, which of the following is

true?
a) P∧ Q ∧ R
b) P∧ ~Q ∧ ~R
c) Q- >(P∧ R)
d) P- >(Q ∧ R)

.
27. “ Match will be
played only if it is not a humid day.” The negation
of this statement is?
a) Match will be played but it is a humid day
b) Match will be played or it is a humid day
c) All of the mentioned statement are correct
d) None of the mentioned

28.Consider the following statements.

A: Raju should exercise.
B: Raju is not a decent table tennis player.
C: Raju wants to play good table tennis.
The symbolic form of “ Raju is not a decent table tennis player and if he
wants to play good table tennis then he should exercise.” is?
a) A- >B- >C
b) B∧ (C- >A)
c) C- >B ∧ A
d) B<- >A ∧ C

29.The statement (~P<- >Q) ∧ ~Q is true when ?

a) P: True Q: False
b) P: True Q: True
c) P: False Q: True
d) P: False Q: False

30.Let P, Q, R be true, false, false, respectively, which of the following is

true?
a) P∧ (Q ∧ ~R)
b) (P- >Q) ∧ ~R
c) Q<- >(P ∧ R)
d) P<- >(QvR)

31.W hich of the following statements is the negation of the statements “ 4

is odd or - 9 is positive” ?
a) 4 is even or - 9 is not negative
b) 4 is odd or - 9 is not negative
c) 4 is even and - 9 is negative
d) 4 is odd and - 9 is not negative

.
32.W hich of the following represents: ~A (negation of A) if A stands for “ I
like badminton but hate maths” ?
a) I hate badminton and maths
b) I do not like badminton or maths
c) I dislike badminton but love maths
d) I hate badminton or like maths

33.The compound statement A v ~(A ∧ B).

a) True
b) False

Explanation: Applying De- Morgan’ s law we get A v ~ A Ξ Tautology.

34.W hich of the following is De- Morgan’ s law?

a) P ∧ (Q v R) Ξ (P ∧ Q) v (P ∧ R)
b) ~(P ∧ R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧ ~R
c) P v ~P Ξ True, P ∧ ~P Ξ False
d) None of the mentioned

35.W hat is the dual of (A ∧ B) v (C ∧ D) ?

a) (A V B) v (C v D)
b) (A V B) ^ (C v D)
c) (A V B) v (C ∧ D)
d) (A ∧ B) v (C v D)

36.~ A v ~ B is logically equivalent to?

a) ~ A → ~ B
b) ~ A ∧ ~ B
c) A → ~B
d) B V A

Explanation: By identity A → B Ξ ~A V B.

37. Negation of statement (A ∧ B) → (B ∧ C) is _ _ _ _ _ _ _ _ _ _ _ _ _

a) (A ∧ B) →(~B ∧ ~C)
b) ~(A ∧ B) v ( B v C)
c) ~(A →B) →(~B ∧ C)
d) None of the mentioned

38.W hich of the following satisfies commutative law?

a) ∧
b) v
c) ↔
d) All of the mentioned

39. If the truth value of A v B is true, then truth value of ~A ∧ B can be

___________
a) True if A is false
b) False if A is false
c) False if B is true and A is false
d) None of the mentioned

40. If P is always against the testimony of Q, then the compound

statement P→(P v ~Q) is a _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned

41.A compound proposition that is always _ _ _ _ _ _ _ _ _ _ _ is called a

tautology.
a) True
b) False

42.A compound proposition that is always _ _ _ _ _ _ _ _ _ _ _ is called a

contradiction.
a) True
b) False

43.If A is any statement, then which of the following is a tautology?

a) A ∧ F
b) A ∨ F
c) A ∨ ¬A
d) A ∧T
45.If A is any statement, then which of the following is not a contradiction?
a) A ∧ ¬A
b) A ∨ F
c) A ∧ F
d) None of mentioned

46.A compound proposition that is neither a tautology nor a contradiction

is called a _ _ _ _ _ _ _ _ _ _ _
a) Contingency
b) Equivalence
c) Condition
d) Inference

46.¬ (A ∨ q) ∧ (A ∧ q) is a _ _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned

Explanation: ≡ (¬A ∧ ¬q) ∧ (A ∧ q)

≡ (¬A ∧ A) ∧ (¬q ∧ q)
≡ F ∧ F ≡ F.

47.(A ∨ ¬A) ∨ (q ∨ T) is a _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned

Explanation: ≡ (A ∨ ¬A) ∨ (q ∨ T)
≡ T ∨ T ≡ T.
48.A ∧ ¬(A ∨ (A ∧ T)) is always _ _ _ _ _ _ _ _ _ _
a) True
b) False

Explanation: ≡ A ∧ ¬ (A ∨ (A ∧ T))
≡ A ∧ ¬(A ∨ A)
≡ A ∧ ¬A ≡ F.

49.(A ∨ F) ∨ (A ∨ T) is always _ _ _ _ _ _ _ _ _
a) True
b) False

Explanation: ≡ (A ∨ F) ∨ (A ∨ T)
≡ A ∨ T ≡ T.

50.A → (A ∨ q) is a _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned

Explanation: ≡ A → (A ∨ q)
≡ ¬A ∨ (A ∨ q)
≡ (A ∨ ¬A) ∨ q
≡ T ∨ q ≡ T.

51. The contrapositive of p → q is the proposition of _ _ _ _ _ _ _ _ _ _ _ _

a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p
52. The inverse of p → q is the proposition of _ _ _ _ _ _ _ _ _ _ _ _
a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p

53. The converse of p → q is the proposition of _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p

54.W hat is the contrapositive of the conditional statement? “ The home

team misses whenever it is drizzling?”
a) If it is drizzling, then home team misses
b) If the home team misses, then it is drizzling
c) If it is not drizzling, then the home team does not misses
d) If the home team wins, then it is not drizzling

Explanation: q whenever p contrapositive is ¬q → ¬p.

55.W hat is the converse of the conditional statement “ If it ices today, I will
play ice hockey tomorrow.”
a) “ I will play ice hockey tomorrow only if it ices today.”
b) “ If I do not play ice hockey tomorrow, then it will noz have iced today.”
c) “ If it does not ice today, then I will not play ice hockey tomorrow.”
d) “ I will not play ice hockey tomorrow only if it ices today.”

Explanation: If p, then q has converse q → p.

56.W hat are the contrapositive of the conditional statement “ I come to

class whenever there is going to be a test.”
a) “ If I come to class, then there will be a test.”
b) “ If I do not come to class, then there will not be a test.”
c) “ If there is not going to be a test, then I don’ t come to class.”
d) “ If there is going to be a test, then I don’ t come to

class.” Explanation: q whenever p, has contrapositive ¬q →

¬p..

57.W hat are the inverse of the conditional statement “ A positive

integer is a composite only if it has divisors other than 1 and itself.”
a) “ A positive integer is a composite if it has divisors other than 1 and itself.”
b) “ If a positive integer has no divisors other than 1 and itself, then it is not
composite.”
c) “ If a positive integer is not composite, then it has no divisors other than 1
and itself.”
d) None of the mentioned

Explanation: p only if q has inverse ¬p → ¬q.

58.W hat are the converse of the conditional statement “ W hen Raj stay up
late, it is necessary that Raj sleep until noon.”
a) “ If Raj stay up late, then Raj sleep until noon.”
b) “ If Raj does not stay up late, then Raj does not sleep until noon.”
c) “ If Raj does not sleep until noon, then Raj does not stay up late.”
d) “ If Raj sleep until noon, then Raj stay up late.”

Explanation: Necessary condition for p is q has converse q → p.

60.W hat are the contrapositive of the conditional statement “ Mediha will
find a decent job when she labour hard.” ?
a) “ If Medha labour hard, then she will find a decent job.”
b) “ If Medha will not find a decent job, then she not labour hard.”
c) “ If Medha will find a decent job, then she labour hard.”
d) “ If Medha not labour hard, then she will not find a decent job.”
Explanation: The statement q when p has its contrapositive as ¬q → ¬p.

61.W hat are the inverse of the conditional statement “ If you make your
notes, it will be a convenient in exams.”
a) “ If you make notes, then it will be a convenient in exams.”
b) “ If you do not make notes, then it will not be a convenient in exams.”
c) “ If it will not be a convenient in exams, then you did not make your
notes.”
d) “ If it will be a convenient in exams, then you make your notes

Explanation: If p then q has inverse ¬p → ¬q.

62.The compound propositions p and q are called logically equivalent if

_ _ _ _ _ _ _ _ is a tautology.
a) p ↔ q
b) p → q
c) ¬ (p ∨ q)
d) ¬p ∨ ¬q

63.p → q is logically equivalent to _ _ _ _ _ _ _ _

a) ¬p ∨ ¬q
b) p ∨ ¬q
c) ¬p ∨ q
d) ¬p ∧ q

Explanation: (p → q) ↔ (¬p ∨ q) is tautology.

64.p ∨ q is logically equ ivalent to _ _ _ _ _ _ _ _

a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q
Explanation: (p ∨ q) ↔ (¬p → q) is tautology.

65.¬ (p ↔ q) is logically equivalent to _ _ _ _ _ _ _ _

a) q↔p
b) p↔¬q
c) ¬p↔¬q
d) ¬q↔¬p

Explanation: ¬(p↔q)↔(p↔¬q) is tautology.

66.p ∧ q is logically equivalent to _ _ _ _ _ _ _ _

a) ¬ (p → ¬q)
b) (p → ¬q)
c) (¬p → ¬q)
d) (¬p → q)

Explanation: (p ∧ q) ↔ (¬(p → ¬q)) is tautology.

67.W hich of the following statement is correct?

a) p ∨ q ≡ q ∨ p
b) ¬(p ∧ q) ≡ ¬p ∨ ¬q
c) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
d) All of mentioned

68.p ↔ q is logically equivalent to _ _ _ _ _ _ _ _

a) (p → q) → (q → p)
b) (p → q) ∨ (q → p)
c) (p → q) ∧ (q → p)
d) (p ∧ q) → (q ∧ p)

Explanation: (p ↔ q) ↔ ((p → q) ∧ (q → p)) is tautology.

70.(p → q) ∧ (p → r) is logically equivalent to _ _ _ _ _ _ _ _
a) p → (q ∧ r)
b) p → (q ∨ r)
c) p ∧ (q ∨ r)
d) p ∨ (q ∧ r)

Explanation: ((p → q) ∧ (p → r)) ↔ (p → (q ∧ r)) is tautology.

121. The complete graph with four vertices has k edges where k is:

a. 3
b. 4
c. 5
d. 6

122. W hich two of the following are equivalent for an undirected graph G?

(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n- 1) edges
(iv) G has n edges
a. (i) and (ii)
b. (i) and (iii)
c. (i) and (iv)
d. (ii) and (iii)
123. A relation R in {1, 2, 3, 4, 5, 6} is given by {(1, 2),(2, 3),(3, 4),(4, 4),(4, 5)}. This relation is:

a. reflexive
b. symmetric
c. transitive
d. not reflexive, not symmetric and not transitive

124. The set of positive integers under the operation of ordinary multiplication is:

a. not a monoid
b. not a group
c. a group
d. an Abelian group

125. In a set of 8 positive integers, there always exists a pair of numbers having the same
remainder when divided by:
a. 7
b. 11
c. 13
d. 15

126. A box contains six red balls and four green balls. Four balls are selected at random fr
the box. What is the probability that two of the selected balls are red and two are gre
a. 3/7
b. 4/7
c. 5/7
d. 6/7

127. The number o edges i a complete graph wit ‘ n’ vertices i equal to:
f n h s
a. n(n- 1)
b. n(n- 1)/2
c. n^ 2
d. 2n- 1

128. Depth ion travels of the following directed graph is:

a. ABCDEF
b. ABDEFC
c. ACEBDF
d. None of the above

129. If (a^ 2−b^ 2) is a prime number where a and bϵN, then:

a. a^ 2−b^ 2 = 3
b. a^ 2−b^ 2 = a−b
c. a^ 2−b^ 2 = a+b
d. a^ 2−b^ 2 = 5
130. For a complete graph with N vertices, the total number of spanning trees is given by:

a. 2N- 1
b. N^ (N- 1)
c. N^ (N- 2)
d. 2N+1

Domain and Range of Functions

1. W hat is the domain of a function?

a) the maximal set of numbers for which a function is defined
b) the maximal set of numbers which a function can take values
c) it is a set of natural numbers for which a function is defined
d) none of the mentioned

2. W hat is domain of function f(x)=

x1/2? a) (2, ∞)
b) (- ∞, 1)
c) [ 0, ∞)
d) None of the mentioned

Explanation: A square root function is not defined for negative real numbers.
3. W hat is the range of a function?
a) the maximal set of numbers for which a function is defined
b) the maximal set of numbers which a function can take values
c) it is set of natural numbers for which a function is defined
d) none of the mentioned

.
4. W hat is domain of function f(x) = x- 1 for it to be defined everywhere on
domain?
a) (2, ∞)
b) (- ∞, ∞) – {0}
c) [ 0, ∞)
d) None of the mentioned

5. The range of function f(x) = sin(x) is (- ∞, ∞).

a) True
b) False

6. Codomain is the subset of range.

a) True
b) False

7. What is range of function f(x) = x- 1 which is defined everywhere on its

domain?
a) (- ∞, ∞)
b) (- ∞, ∞) – {0}
c) [ 0, ∞)
d) None of the mentioned

8. If f(x) = 2x then range of the function is?

a) (- ∞, ∞)
b) (- ∞, ∞) – {0}
c) (0, ∞)
d) None of the mentioned

9. If f(x) = x2 + 4 then range of f(x) is given by?

a) [ 4, ∞)
b) (- ∞, ∞) – {0}
c) (0, ∞)
d) None of the mentioned

10. Let f(x)=sin 2(x) + log(x) then domain of f(x) is (- ∞, ∞).

a) True
b) False

Sets
1. A _ _ _ _ _ _ _ _ _ _ is an ordered collection of objects.
a) Relation
b) Function
c) Set
d) Proposition

2. The set O of odd positive integers less than 10 can be expressed by

_____________
a) {1, 2, 3}
b) {1, 3, 5, 7, 9}
c) {1, 2, 5, 9}
d) {1, 5, 7, 9, 11}

3. Power set of empty set has exactly_____________subset.

a) One
b) Two
c) Zero
d) Three

4. W hat is the Cartesian product of A = {1, 2} and B = {a,

b}? a) {(1, a), (1, b), (2, a), (b, b)}
b) {(1, 1), (2, 2), (a, a), (b, b)}
c) {(1, a), (2, a), (1, b), (2, b)}
d) {(1, 1), (a, a), (2, a), (1, b)}

5. The Cartesian Product B x A is equal to the Cartesian product A x B.

a) True
b) False

Explanation: Let A = {1, 2} and B = {a, b}. The Cartesian product A x B =

{(1, a), (1, b), (2, a), (2, b)} and the Cartesian product B x A = {(a, 1), (a, 2),
(b, 1), (b, 2)}. This is not equal to A x B.

6. What is the cardinality of the set of odd positive integers less than 10?
a) 10
b) 5
c) 3
d) 20

Explanation: Set S of odd positive an odd integer less than 10 is {1, 3, 5, 7, 9}.
Then, Cardinality of set S = |S| which is 5.

7. Which of the following two sets are equal?

a) A = {1, 2} and B = {1}
b) A = {1, 2} and B = {1, 2, 3}
c) A = {1, 2, 3} and B = {2, 1, 3}
d) A = {1, 2, 4} and B = {1, 2, 3}

Explanation: Two set are equal if and only if they have the same elements.
8. The set of positive integers is _ _ _ _ _ _ _ _ _ _ _ _ _
a) Infinite
b) Finite
c) Subset
d) Empty
.

9. What is the Cardinality of the Power set of the set {0, 1, 2}?
a) 8
b) 6
c) 7
d) 9

Explanation: Power set P ({0, 1, 2}) is the set of all subsets of {0, 1, 2}. Hence,
P({0, 1, 2}) = {null, {0}, {1}, {2}, {0, 1}, {0, 2}, {1, 2}, {0, 1, 2}}.

10. The members of the set S = {x | x is the square of an integer and x < 100}
is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
a) {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
b) {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
c) {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
d) {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}

Logics – Logical Equivalences

1. The compound propositions p and q are called logically equivalent if

_ __ _ __ _ _ is a tautology.
a) p ↔ q
b) p → q
c) ¬ (p ∨ q)
d) ¬p ∨ ¬q

2. p → q is logically equivalent to _ _ _ _ _ _ _ _
a) ¬p ∨ ¬q
b) p ∨ ¬q
c) ¬p ∨ q
d) ¬p ∧ q

3. p ∨ q is logically equivalent to __ _ _ _ _ __
a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q

4. ¬ (p ↔ q) is logically equivalent to _ _ _ _ _ _ _ _
a) q↔p
b) p↔¬q
c) ¬p↔¬q
d) ¬q↔¬p

5. p ∧ q is logically equivalent to __ _ _ _ _ __
a) ¬ (p → ¬q)
b) (p → ¬q)
c) (¬p → ¬q)
d) (¬p → q)
.

6. Which of the following statement is correct?

a) p ∨ q ≡ q ∨ p
b) ¬(p ∧ q) ≡ ¬p ∨ ¬q
c) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
d) All of mentioned
.
7. p ↔ q is logically equivalent to __ __ _ __ _
a) (p → q) → (q → p)
b) (p → q) ∨ (q → p)
c) (p → q) ∧ (q → p)
d) (p ∧ q) → (q ∧ p)

8. (p → q) ∧ (p → r) is logically equivalent to _ _ _ _ _ _ _ _
a) p → (q ∧ r)
b) p → (q ∨ r)
c) p ∧ (q ∨ r)
d) p ∨ (q ∧ r)

9. (p → r) ∨ (q → r) is logically equivalent to _ _ _ _ _ _ _ _
a) (p ∧ q) ∨ r
b) (p ∨ q) → r
c) (p ∧ q) → r
d) (p → q) → r

10. ¬ (p ↔ q) is logically equivalent to _ _ _ _ _ _ _ _

a) p ↔ ¬q
b) ¬p ↔ q
c) ¬p ↔ ¬q
d) ¬q ↔ ¬p
.
 Graphs Properties

1. In a 7- node directed cyclic graph, the number of Hamiltonian cycle is to

be __ __ _ _
a) 728
b) 450
c) 360
d) 260

2. If each and every vertex in G has degree at most 23 then G can have a
vertex colouring of _ _ _ _ _ _ _ _ _ _
a) 24
b) 23
c) 176
d) 54
.

3. Triangle free graphs have the property of clique number is _ _ _ _ _ _ _ _ _ _

a) less than 2
b) equal to 2
c) greater than 3
d) more than 10

4. Berge graph is similar to __ __ _ _ due to strong perfect graph theorem.

a) line graph
b) perfect graph
c) bar graph
d) triangle free graph

5. Let D be a simple graph on 10 vertices such that there is a vertex of

degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a
vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of
degree 8 and a vertex of degree 9. What can be the degree of the last
vertex?
a) 4
b) 0
c) 2
d) 5

6. A _ __ __ _ is a graph which has the same number of edges as its

complement must have number of vertices congruent to 4m or 4m modulo
4(for integral values of number of edges).
a) Subgraph
b) Hamiltonian graph
c) Euler graph
d) Self complementary graph

7. In a __ __ _ _ the vertex set and the edge set are finite sets.
a) finite graph
b) bipartite graph
c) infinite graph
d) connected graph
.
8. If G is the forest with 54 vertices and 17 connected components, G has
_ __ _ __ _ total number of edges.
a) 38
b) 37
c) 17/54
d) 17/53

9. The number of edges in a regular graph of degree 46 and 8 vertices is

____________
a) 347
b) 230
c) 184
d) 186

Explanation: In a complete graph which is (n- 1) regular (where n is the

number of vertices) has edges n*(n- 1)/2. In the graph n vertices are
adjacent to n- 1 vertices and an edge contributes two degree so dividing
by
2. Hence, in a d regular graph number of edges will be n*d/2 = 46*8/2 = 184.

10. An undirected graph G has bit strings of length 100 in its vertices and
there is an edge between vertex u and vertex v if and only if u and v differ in
exactly one bit position. Determine the ratio of the chromatic number of G to
the diameter of G?
a) 1/2101
b) 1/50
c) 1/100
d) 1/20

Explanation: For the given condition we can simply design a K- Map and
mark an edge between every two adjacent cells in K- map. Hence, that will
give us a Bipartite graph and chromatic number for this = 2. Hence the ratio
is 2/n=2/100=1/50 and the given graph is actually a hypercube graph.

Functions

1. A function is said to be _ _ _ _ _ _ _ _ _ _ _ _ _ _ if and only if f(a) = f(b)

implies that a = b for all a and b in the domain of f.
a) One- to- many
b) One- to- one
c) Many- to- many
d) Many- to- one
.
2. The function f(x)=x+1 from the set of integers to itself is onto. Is it True or
False?
a) True
b) False
.
3. The value of ⌊1/2.⌊5/2⌋ ⌋ is _ _ _ _ _ _ _ _ _ _ _ _ _ _
a) 1
b) 2
c) 3
d) 0.5

Explanation: The value of ⌊5/2⌋ is 2 so, the value of ⌊1/2.2⌋ is 1.

4. W hich of the following function f: Z X Z → Z is not onto?

a) f(a, b) = a+b
b) f(a, b) = a
c) f(a, b) = |b|
d) f(a, b) = a–b

5. The domain of the function that assign to each pair of integers the
maximum of these two integers is _ _ _ _ _ _ _ _ _ _ _
a) N
b) Z
c) Z +
d) Z+ X Z+

6. Let f and g be the function from the set of integers to itself, defined by f(x)
= 2x + 1 and g(x) = 3x + 4. Then the composition of f and g is _ _ _ _ _ _ _ _ _ _ _ _
a) 6x + 9
b) 6x + 7
c) 6x + 6
d) 6x + 8

7. _ _ _ _ _ _ _ _ _ _ bytes are required to encode 2000 bits of data.

a) 1
b) 2
c) 3
d) 8
Explanation: Two bytes are required to encode 2000 (actually with 2 bytes
you can encode up to and including 65, 535.

8. The inverse of function f(x) = x3 + 2 is _ _ _ _ _ _ _ _ _ _ _ _

a) f - 1 (y) = (y – 2) 1/2
b) f - 1 (y) = (y – 2) 1/3
c) f - 1 (y) = (y) 1/3
d) f - 1 (y) = (y – 2)

9. The function f(x) = x3 is bijection from R to R. Is it True or False?

a) True
b) False

10. The g - 1({0}) for the function g(x)= ⌊x⌋ is _ _ _ _ _ _ _ _ _ _ _

a) {x | 0 ≤ x < 1}
b) {x | 0 < x ≤ 1}
c) {x | 0 < x < 1}
d) {x | 0 ≤ x ≤ 1}
.

Logics – Nested Quantifiers

1. Let Q(x, y) denote “ M + A = 0.” W hat is the truth value of

the quantifications ∃A∀M Q(M, A).
a) True
b) False

Explanation: For each A there exist only one M, because there is no real
number A such that M + A = 0 for all real numbers M.

2. Translate ∀x∃y(x < y) in English, considering domain as a real number for

both the variable.
a) For all real number x there exists a real number y such that x is less than y
b) For every real number y there exists a real number x such that x is less
than y
c) For some real number x there exists a real number y such that x is less
than y
d) For each and every real number x and y such that x is less than y

3. “ The product of two negative real numbers is not negative.” Is given

by? a) ∃x ∀y ((x < 0) ∧ (y < 0) → (xy > 0))
b) ∃x ∃y ((x < 0) ∧ (y < 0) ∧ (xy > 0))
c) ∀x ∃y ((x < 0) ∧ (y < 0) ∧ (xy > 0))
d) ∀x ∀y ((x < 0) ∧ (y < 0) → (xy > 0))

4. Let Q(x, y) be the statement “ x + y = x − y.” If the domain for

both variables consists of all integers, what is the truth value of ∃xQ(x,
4).
a) True
b) False

5. Let L(x, y) be the statement “ x loves y,” where the domain for both x
and y consists of all people in the world. Use quantifiers to express, “ Joy is
loved by everyone.”
a) ∀x L(x, Joy)
b) ∀y L(Joy, y)
c) ∃y∀x L(x, y)
d) ∃x ¬L(Joy, x)
.

6. Let T (x, y) mean that student x likes dish y, where the domain for x
consists of all students at your school and the domain for y consists of all
dishes. Express ¬T (Amit, South Indian) by a simple English sentence.
a) All students does not like South Indian dishes.
b) Amit does not like South Indian people.
c) Amit does not like South Indian dishes.
d) Amit does not like some dishes.
.
7. Express, “ The difference of a real number and itself is zero” using
required operators.
a) ∀x(x − x! = 0)
b) ∀x(x − x = 0)
c) ∀x∀y(x − y = 0)
d) ∃x(x − x = 0)

8. Use quantifiers and predicates with more than one variable to express,
“ There is a pupil in this lecture who has taken at least one course in
Discrete Maths.”
a) ∃x∃yP (x, y), where P (x, y) is “ x has taken y,” the domain for x
consists of all pupil in this class, and the domain for y consists of all
Discrete Maths lectures
b) ∃x∃yP (x, y), where P (x, y) is “ x has taken y,” the domain for x
consists of all Discrete Maths lectures, and the domain for y consists of all
pupil in this class
c) ∀x∀yP(x, y), where P (x, y) is “ x has taken y,” the domain for x
consists of all pupil in this class, and the domain for y consists of all
Discrete Maths lectures
d) ∃x∀yP(x, y), where P (x, y) is “ x has taken y,” the domain for x
consists of all pupil in this class, and the domain for y consists of all
Discrete Maths lectures

9. Determine the truth value of ∃n∃m(n + m = 5 ∧ n − m = 2) if the

domain for all variables consists of all integers.
a) True
b) False
10. Find a counterexample of ∀x∀y(xy > y), where the domain for all
variables consists of all integers.
a) x = - 1, y = 17
b) x = - 2 y = 8
c) Both x = - 1, y = 17 and x = - 2 y = 8
d) Does not have any counter example

Sets – Venn Diagram

1. The shaded area of figure is best described by?

a) A∩B
b) AUB
c) A
d) B
.

2. The shaded area of figure is best described by?

a) A‘ (Complement of A)
b) AUB-B
c) A∩B
d) B
.
3. If n(A)=20 and n(B)=30 and n(A U B) = 40 then n(A ∩ B) is?
a) 20
b) 30
c) 40
d) 10

Explanation: n(A U B) = n(A) + n(B) – n(A ∩ B).

4. The shaded area of figure is best described by?

a) A‘ (Complement of A)
b) B – (A ∩ B) – (C ∩ B)
c) A ∩ C∩ B
d) B’ (Complement of B)

5. The relation between sets A, B, C as shown by venn diagram is

__________
a) A is subset of B and B is subset of C
b) C is not a subset of A and A is subset of B
c) C is subset of B and B is subset of A
d) None of the mentioned

6. Let A: All badminton player are good sportsperson.

B: All person who plays cricket are good sportsperson.
Let X denotes set of all badminton players, Y of all cricket players, Z of all
good sportsperson. Then which of the following statements is correct?
a) Z contains both X and Y
b) Z contains X and Y is outside
c) X contains Y and Z
d) None of the mentioned
7. If n(A)=10, n(B)=30, n(C)=50 and if set A, B, C are pairwise disjoint then
which of the following is correct?
a) n(A U B)=0
b) n(B U C)=0
c) n(A U B U C)=90
d) All of the mentioned

8. In the given figure the if n(A)=20, n(U)=50, n(C)=10 and n(A∩ B)=5 then
n(B)=?

a) 35
b) 20
c) 30
d) 10
Explanation: Here n(B)= n(U) – n(A) + n(A∩ B).

9. Let the students who likes table tennis be 12, the ones who like lawn
tennis 10, those who like only table tennis are 6, then number of students
who likes only lawn tennis are, assuming there are total of 16 students.
a) 16
b) 8
c) 4
d) 10

10. The shaded area of figure is best described by?

a) A‘ (Complement of A)
b) A U B – (A ∩ B)
c) A–B
d) B

Subsets

1. If a set contains 3 elements then the number of subsets is?

a) 6
b) 3
c) 12
d) 8

2. The set containing all the collection of subsets is known as _ _ _ _ _ _ _ _ _

a) Subset
b) Power set
c) Union set
d) None of the mentioned

Explanation: Power set contains all the subsets as its elements.

3. If a set is empty then number of subsets will be _ _ _ _ _ _ _ _ _

a) 1
b) 2
c) 0
d) 4
Explanation: The set has zero elements so 2o = 1.
4. If the number of subsets of a set are 4 then the number of elements in
that sets are _ _ _ _ _ _ _ _ _
a) 1
b) 2
c) 3
d) 4
Explanation: The number of elements be x then x2 = 4 thus x=2.

5. The number of subsets of a set is 5.

a) True
b) False
Explanation: The number of subsets will always be a power of 2.

6. The number of subsets of a set can be odd or even.

a) True
b) False
.

7. Let a set be A={1, 2, 3} then the number of subsets containing two

elements will be _ _ _ _ _ _ _ _ _
a) 4
b) 3
c) 5
d) 8
Explanation: The subsets will be {1, 2}, {2, 3}, {1, 3}.

8. Let the set be A= {a, b, c, {a, b}} then which of the following is false?
a) {a, b} Є A
b) a Є A
c) {a} Є A
d) b, c ЄA

9. If A={1, 2, 3, 4}, then the number of the subsets of A that contain the
element 2 but not 3, is?
a) 16
b) 4
c) 8
d) 24
Explanation: The subsets would be {1, 2, 4},{1, 2}, {2, 3}, {2}.

10. Let A(1), A(2), A(3),… … .., A(100) be 100 sets such that number of
elements in A(i)=i+1 and A(1) is subset of A(2), A(2)is subset of A(3),… ..,
A(99) is subset of A(100). The number of elements in union of the all the sets
are: n(A(1) U A(2) U A(3) … ..U A(100)).
a) 99
b) 100
c) 101
d) 102
.

Principle of Mathematical Induction

1. W hat is the base case for the inequality 7n > n3, where n = 3?
a) 652 > 189
b) 42 < 132
c) 343 > 27
d) 42 <= 431
2. In the principle of mathematical induction, which of the following steps is
mandatory?
a) induction hypothesis
b) inductive reference
c) induction set assumption
d) minimal set representation

3. For m = 1, 2, … , 4m+2 is a multiple of __ _ _ _ _ _ _

a) 3
b) 5
c) 6
d) 2

4. For any integer m>=3, the series 2+4+6+… +(4m) can be equivalent to
________
a) m2+3
b) m+1
c) mm
d) 3m2+4

5. For every natural number k, which of the following is true?

a) (mn)k = mknk
b) m*k = n + 1
c) (m+n)k = k + 1
d) mkn = mnk

6. By induction hypothesis, the series 12 + 22 + 32 + … + p2 can be proved

equivalent to _ _ _ _ _ _ _ _ _ _ _ _
a) p2+27
b) p∗(p+1)∗(2p+1)6
c) p∗(p+1)4
d) p+p 2
7. For any positive integer m __ __ _ _ is divisible by 4.
a) 5m2 + 2
b) 3m + 1
c) m2 + 3
d) m3 + 3m

8. According to principle of mathematical induction, if P(k+1) = m(k+1) + 5 is

true then _ _ __ _ must be true.
a) P(k) = 3m(k)
b) P(k) = m(k) + 5
c) P(k) = m(k+2) + 5
d) P(k) = m(k)

9. Which of the following is the base case for 4n+1 > (n+1)2 where n = 2?
a) 64 > 9
b) 16 > 2
c) 27 < 91
d) 54 > 8
.

10. W hat is the induction hypothesis assumption for the inequality m ! >
2m where m>=4?
a) for m=k, k+1!> 2k holds
b) for m=k, k!> 2k holds
c) for m=k, k!> 3k holds
d) for m=k, k!> 2k+1 holds

Logics – Tautologies and Contradictions

1. A compound proposition that is always _ _ _ _ _ _ _ _ _ _ _ is called a tautology.
a) True
b) False

2. A compound proposition that is always _ _ _ _ _ _ _ _ _ _ _ is called a

contradiction.
a) True
b) False

3. If A is any statement, then which of the following is a tautology?

a) A ∧ F
b) A ∨ F
c) A ∨ ¬A
d) A ∧ T

4. If A is any statement, then which of the following is not a contradiction?

a) A ∧ ¬A
b) A ∨ F
c) A ∧ F
d) None of mentioned

5. A compound proposition that is neither a tautology nor a contradiction is

called a _ _ _ _ _ _ _ _ _ _ _
a) Contingency
b) Equivalence
c) Condition
d) Inference
.
6. ¬ (A ∨ q) ∧ (A ∧ q) is a _ _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
7. (A ∨ ¬A) ∨ (q ∨ T) is a _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned

8. A ∧ ¬(A ∨ (A ∧ T)) is always _ _ _ _ _ _ _ _ _ _

a) True
b) False
.

9. (A ∨ F) ∨ (A ∨ T) is always _ _ _ _ _ _ _ _ _
a) True
b) False

10. A → (A ∨ q) is a _ _ _ _ _ _ _ _ _ _
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned

Types of Set

1. {x: x is an integer neither positive nor negative} is _ _ _ _ _ _ _ _

a) Empty set
b) Non- empty set
c) Finite set
d) Non- empty and Finite set
2. {x: x is a real number between 1 and 2} is an _ __ _ __ _ _
a) Infinite set
b) Finite set
c) Empty set
d) None of the mentioned

3. W rite set {1, 5, 15, 25,… } in set- builder form.

a) {x: either x=1 or x=5n, where n is a real number}
b) {x: either x=1 or x=5n, where n is a integer}
c) {x: either x=1 or x=5n, where n is an odd natural number}
d) {x: x=5n, where n is a natural number}
.
4. Express {x: x= n/ (n+1), n is a natural number less than 7} in roster form.
a) { 1⁄2, 2⁄3, 4⁄5, 6
⁄ 7}
b) { 1⁄2, 2⁄3, 3⁄4 , 4
⁄ 5 , 5 ⁄ 6 , 6 ⁄ 7, 7⁄ 8 }
c) { 1⁄2, 2⁄3, 3⁄4 , 4
⁄ 5 , 5 ⁄ 6 , 6 ⁄ 7}
d) Infinite set

5. Number of power set of {a, b}, where a and b are distinct elements.
a) 3
b) 4
c) 2
d) 5

Explanation: Power set of {a, b} = {∅, {a, b}, {a}, {b}}.

6. Which of the following is subset of set {1, 2, 3, 4}?

a) {1, 2}
b) {1, 2, 3}
c) {1}
d) All of the mentioned
Explanation: There are total 16 subsets.

7. A = { ∅,{∅}, 2,{2, ∅}, 3}, which of the following is true?

a) {{∅,{∅}} ∈ A
b) {2} ∈ A
c) ∅ ⊂ A
d) 3 ⊂ A
Explanation: Empty set is a subset of every set.
8. Subset of the set A= { } is?
a) A
b) {}
c) ∅
d) All of the mentioned
.

9. {x: x ∈ N and x is prime} then it is _ _ _ _ _ _ _ _

a) Infinite set
b) Finite set
c) Empty set
d) Not a set
.

10. Convert set {x: x is a positive prime number which divides 72} in roster
form.
a) {2, 3, 5}
b) {2, 3, 6}
c) {2, 3}
d) {∅}
.

Cardinality of Sets

1. The cardinality of the set A = {1, 2, 3, 4, 6} is?

a) 5
b) 6
c) Integer
d) None of the mentioned
Explanation: 5, it is a number of elements in the sets.

2. For two equal sets there _ _ _ _ _ _ _ _ _ _ _

a) Cardinality is same
b) Cardinality is different
c) May be same or different
d) None of the mentioned

3. If A is a subset of B then _ _ _ _ _ _ _
a) The cardinality of A is greater than B
b) The cardinality of B is greater than A
c) Can’ t say
d) None of the mentioned
.

4. If there is a bijection between two sets A and B then _ _ _ _ _ _ _

a) Cardinality of A is greater than B
b) Cardinality of B is greater than A
c) Cardinality of B is equal to A
d) None of the mentioned
.

5. Let a set E ={0, 2, 4, 6, 8… .} of non- negative even numbers and O = {1, 3,

5, 7, 9,… ..} of non- negative odd numbers then?
a) Cardinality of set E is greater than that of O
b) Cardinality of set O is greater than that of E
c) Cardinality of set E is equal to that of O
d) None of the mentioned
.
6. Cardinality of the set of lower letter english alphabets is 26.
a) True
b) False
Explanation: From a, b, c… z there will be 26 elements.
7. Cardinality of the set of even prime number under 10 is 4.
a) True
b) False
Explanation: Since 2 is only even prime thus cardinality should be 1.

8. If for sets A and B there exists an injective function but not bijective
function from A to B then?
a) Cardinality of A is strictly greater than B
b) Cardinality of B is strictly greater than A
c) Cardinality of B is equal to A
d) None of the mentioned

9. If cardinality of (A U B) = cardinality of A+ cardinality of B. This means

____________
a) A is a subset of B
b) B is a subset of A
c) A and B are disjoint
d) None of the mentioned
.

10. If A is a subset of B and B is a subset of C, then cardinality of A U B U C

is equal to _ _ _ _ _ _ _ _ _ _ _ _
a) Cardinality of C
b) Cardinality of B
c) Cardinality of A
d) None of the mentioned
.

Set Operations – 1
1. The union of the sets {1, 2, 5} and {1, 2, 6} is the set _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
a) {1, 2, 6, 1}
b) {1, 2, 5, 6}
c) {1, 2, 1, 2}
d) {1, 5, 6, 3}

2. The intersection of the sets {1, 2, 5} and {1, 2, 6} is the set _ _ _ _ _ _ _ _ _ _ _ _ _

a) {1, 2}
b) {5, 6}
c) {2, 5}
d) {1, 6}

3. Two sets are called disjoint if there _ _ _ _ _ _ _ _ _ _ _ _ _ is the empty set.

a) Union
b) Difference
c) Intersection
d) Complement
.

4. W hich of the following two sets are

disjoint? a) {1, 3, 5} and {1, 3, 6}
b) {1, 2, 3} and {1, 2, 3}
c) {1, 3, 5} and {2, 3, 4}
d) {1, 3, 5} and {2, 4, 6}

5. The difference of {1, 2, 3} and {1, 2, 5} is the set _ _ _ _ _ _ _ _ _ _ _ _

a) {1}
b) {5}
c) {3}
d) {2}
6. The complement of the set A is _ _ _ _ _ _ _ _ _ _ _ _ _
a) A – B
b) U – A
c) A – U
d) B – A

7. The bit string for the set {2, 4, 6, 8, 10} (with universal set of natural
numbers less than or equal to 10) is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
a) 0101010101
b) 1010101010
c) 1010010101
d) 0010010101

8. Let Ai = {i, i+1, i+2, … ..}. Then set {n, n+1, n+2, n+3, … ..} is the _ _ _ _ _ _ _ _ _
of the set Ai.
a) Union
b) Intersection
c) Set Difference
d) Disjoint
.
9. The bit strings for the sets are 1111100000 and 1010101010. The union
of these sets is _ _ _ _ _ _ _ _ _ _ _
a) 1010100000
b) 1010101101
c) 1111111100
d) 1111101010
.

10. The set difference of the set A with null set is _ _ _ _ _ _ _ _ _ _

a) A
b) null
c) U
d) B
Set Operations – 2

1. Let the set A is {1, 2, 3} and B is {2, 3, 4}. Then the number of elements in
A U B is?
a) 4
b) 5
c) 6
d) 7
Explanation: AUB is {1, 2, 3, 4}.

2. Let the set A is {1, 2, 3} and B is { 2, 3, 4}. Then number of elements in A

∩ B is?
a) 1
b) 2
c) 3
d) 4

3. Let the set A is {1, 2, 3} and B is {2, 3, 4}. Then the set A – B is?
a) {1, - 4}
b) {1, 2, 3}
c) {1}
d) {2, 3}
Explanation: In A – B the common elements get cancelled.

4. In which of the following sets A – B is equal to B – A?

a) A = {1, 2, 3}, B = {2, 3, 4}
b) A = {1, 2, 3}, B = {1, 2, 3, 4}
c) A = {1, 2, 3}, B = {2, 3, 1}
d) A = {1, 2, 3, 4, 5, 6}, B = {2, 3, 4, 5, 1}
5. Let A be set of all prime numbers, B be the set of all even prime numbers,
C be the set of all odd prime numbers, then which of the following is true?
a) A ≡ B U C
b) B is a singleton set.
c) A ≡ C U {2}
d) All of the mentioned
Explanation: 2 is the only even prime number.

6. If A has 4 elements B has 8 elements then the minimum and maximum

number of elements in A U B are _ _ _ _ _ _ _ _ _ _ _ _
a) 4, 8
b) 8, 12
c) 4, 12
d) None of the mentioned
.

7. If A is {{Φ}, {Φ, {Φ}}}, then the power set of A has how many element?
a) 2
b) 4
c) 6
d) 8

Explanation: The set A has got 2 elements so n(P(A))=4.

8. Two sets A and B contains a and b elements respectively. If power set of
A contains 16 more elements than that of B, value of ‘ b’ and ‘ a’ are
_______
a) 4, 5
b) 6, 7
c) 2, 3
d) None of the mentioned
.

9. Let A be {1, 2, 3, 4}, U be set of all natural numbers, then U-

A’ (complement of A) is given by set.
a) {1, 2, 3, 4, 5, 6, … .}
b) {5, 6, 7, 8, 9, … … }
c) {1, 2, 3, 4}
d) All of the mentioned
Explanation: U – A’ ≡ A.

10. W hich sets are not empty?

a) {x: x is a even prime greater than 3}
b) {x : x is a multiple of 2 and is odd}
c) {x: x is an even number and x+3 is even}
d) { x: x is a prime number less than 5 and is odd}

Graphs – Hasse Diagrams

1. Hasse diagrams are first made by __ __ _ _

a) A.R. Hasse
b) Helmut Hasse
c) Dennis Hasse
d) T.P. Hasse

Explanation: Hasse diagrams can be described as the transitive reduction as

an abstract directed acyclic graph. This graph drawing techniques are
constructed by Helmut Hasse(1948).

2. If a partial order is drawn as a Hasse diagram in which no two edges

cross, its covering graph is called _ __ __ _
a) upward planar
b) downward planar
c) lattice
d) biconnected components
3. If the partial order of a set has at most one minimal element, then to test
whether it has a non- crossing Hasse diagram its time complexity
__________
a) NP- complete
b) O(n2)
c) O(n+2)
d) O(n3)
.
4. W hich of the following relation is a partial order as well as an equivalence
relation?
a) equal to(=)
b) less than(<)
c) greater than(>)
d) not equal to(!=)

5. The relation ≤ is a partial order if it is _ _ _ _ _ _ _ _ _ _ _

a) reflexive, antisymmetric and transitive
b) reflexive, symmetric
c) asymmetric, transitive
d) irreflexive and transitive

6. In which of the following relations every pair of elements is comparable?

a) ≤
b) !=
c) >=
d) ==

7. In a poset (S, ⪯), if there is no element n∈ S with m<n, then which of

the following is true?
a) an element n exists for which m=n
b) An element m is maximal in the poset
c) A set with the same subset of the poset
d) An element m is minimal in the poset
.
8. In a poset P({v, x, y, z}, ⊆) which of the following is the greatest
element?
a) {v, x, y, z}
b) 1
c) ∅
d) {vx, xy, yz}
.

9. Suppose P1 is a partially ordered class and a cut of P1 is pair (D, T) of

nonempty subclasses of P1 satisfies which of the following properties?
a) D∩ T=Ø
b) D ∪ T=P 1
c) xyz∈ T
d) z∈ T and zx∈ D
.

10. Let G be the graph defined as the Hasse diagram for the ⊆ relation on
the set S{1, 2,… , 18}. How many edges are there in G?
a) 43722
b) 2359296
c) 6487535
d) 131963

Graphs – Lattices

1. A Poset in which every pair of elements has both a least upper bound and
a greatest lower bound is termed as _ _ _ _ _ _ _
a) sublattice
b) lattice
c) trail
d) walk

2. In the poset (Z+, |) (where Z+ is the set of all positive integers and | is the
divides relation) are the integers 9 and 351 comparable?
a) comparable
b) not comparable
c) comparable but not determined
d) determined but not comparable
.
3. If every two elements of a poset are comparable then the poset is called
________
a) sub ordered poset
b) totally ordered poset
c) sub lattice
d) semigroup
.
4 . _ __ __ _ and _ _ _ _ _ _ _ are the two binary operations defined for lattices.
a) Join, meet
b) Addition, subtraction
c) Union, intersection
d) Multiplication, modulo division

5. A _ _ _ _ _ _ _ _ has a greatest element and a least element which satisfy

0<=a<=1 for every a in the lattice(say, L).
a) semilattice
b) join semilattice
c) meet semilattice
d) bounded lattice
.
6. The graph given below is an example of _ _ _ _ _ _ _ _ _
a) non- lattice poset
b) semilattice
c) partial lattice
d) bounded lattice

7. A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if

_________
a) x>=z, where x in S implies z in S, for every element x, y in L
b) x=y and y<=z, where x, y in S implies z in S, for every element x, y, z in L
c) x<=y<=z, where x, y in S implies z in S, for every element x, y, z in L
d) x=y and y>=z, where x, y in S implies z in S, for every element x, y, z in L
.
8. The graph is the smallest non- modular lattice N5. A lattice is__________if
and only if it does not have a _ _ _ _ _ _ _ isomorphic to N5.

a) non- modular, complete lattice

b) moduler, semilattice
c) non- modular, sublattice
d) modular, sublattice

9. Every poset that is a complete semilattice must always be a _ _ _ _ _ _ _

a) sublattice
b) complete lattice
c) free lattice
d) partial lattice
.
10. A free semilattice has the__________property.
a) intersection
b) commutative and associative
c) identity
d) universal
.

Complete and Connected Graphs

1. A bridge can not be a part of _ _ _ _ _ _ _

a) a simple cycle
b) a tree
c) a clique with size ≥ 3 whose every edge is a bridge
d) a graph which contains cycles
.
2. Any subset of edges that connects all the vertices and has minimum total
weight, if all the edge weights of an undirected graph are positive is called
_______
a) subgraph
b) tree
c) hamiltonian cycle
d) grid

3. G is a simple undirected graph and some vertices of G are of odd degree.

Add a node n to G and make it adjacent to each odd degree vertex of G.
The resultant graph is _ __ __ _
a) Complete bipartite graph
b) Hamiltonian cycle
c) Regular graph
d) Euler graph
4. Let G be a directed graph whose vertex set is the set of numbers from 1
to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1
or j = 3i. Calculate the minimum number of edges in a path in G from vertex
1 to vertex 50.
a) 98
b) 13
c) 6
d) 34
.
5. W hat is the number of vertices in an undirected connected graph with
39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of
degree 6?
a) 11
b) 14
c) 18
d) 19

Explanation: W e know that, sum of degree of all the vertices = 2 * number of

edges
2*7 + 5*2 + 6*x = 39*2
x=9
Number of vertices = 7 + 2 + 9 = 18.

6 . __ __ _ _ is the maximum number of edges in an acyclic undirected graph

with k vertices.
a) k- 1
b) k2
c) 2k+3
d) k3+4
.

7. The minimum number of edges in a connected cyclic graph on n vertices

is _ _ _ _ _ _ _ _ _ _ _ _ _
a) n – 1
b) n
c) 2n+3
d) n+1
.

8. The maximum number of edges in a 8- node undirected graph without

self loops is _ _ _ _ _ _ _ _ _ _ _ _
a) 45
b) 61
c) 28
d) 17

9. Let G be an arbitrary graph with v nodes and k components. If a vertex is

removed from G, the number of components in the resultant graph must
necessarily lie down between _____ and _____
a) n- 1 and n+1
b) v and k
c) k+1 and v- k
d) k- 1 and v- 1
.
10. The 2n vertices of a graph G corresponds to all subsets of a set of size n,
for n>=4. Two vertices of G are adjacent if and only if the corresponding
sets intersect in exactly two elements.
The number of connected components in G can be _ _ _ _ _ _ _ _ _ _ _
a) n+2
b) 3n/2
c) n2
d) 2n