CBSE NET: Previous Year Questions

Discrete math + Graph theory

[2018-2004]
December 2018

HINT: D is correct option.

HINT: B is correct option.

HINT: D is correct option.

Page | 1
HINT: A is correct option

HINT: D is correct option

Q6: 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 :
(a) (i) and (ii) (b) (iii) and (iv) (c) (ii) and (iv) (d) (i) and (iii)

HINT: c is correct option

Q8: A survey has been conducted methods of commuter travel. Each respondent was
asked to check Bus, Train or 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; all the three
methods 5 people. How many people completed the survey form?
(a) 160 (b) 120 (c) 115 (d) 165

Q9: Consider a vocabulary with only four propositions A, B, C and D. How many
models are there for the following sentence?
¬A ∨ ¬B ∨ ¬C ∨ ¬D
(a) 7 (b) 16 (c) 15 (d) 8

Page | 2
 JULY-2018
Q1: Consider the following English sentence:
―Agra and Gwalior are both in India‖.
A student has written a logical sentence for the above English sentence in First-Order
Logic using predicate In(x, y), which means x is in y, as follows :
In(Agra, India) w In(Gwalior, India)
Which one of the following is correct with respect to the above logical sentence?
(1) It is syntactically valid but does not express the meaning of the English sentence.
(2) It is syntactically valid and expresses the meaning of the English sentence also.
(3) It is syntactically invalid but expresses the meaning of the English sentence.
(4) It is syntactically invalid and does not express the meaning of the English sentence

Q2: The equivalence of ¬∃xQ(x) is

(1)∃x¬Q(x) (2)∀x ¬Q(x) (3)¬∃x¬Q(x) (4)∀xQ(x)

Page | 3
 November 2017
Q1. How many distinguishable permutations of the letters in the word BANANA are
there?
(1) 720 (2) 120 (3) 60 (4) 360

Q2. Let P and Q be two propositions, ⌐(P ↔ Q) is equivalent to:

(1) P ↔ ⌐ Q (2) ⌐P↔ Q (3) ⌐P↔ ⌐Q (4) Q → P

Q3. Negation of the proposition Ǝ x H(x) is:

(1) Ǝ x ⌐H(x) (2) ∀ x ⌐H(x) (3) ∀ x H(x) (4) ⌐ x H(x)

Page | 4
Q4. ―If X, then Y unless Z‖ is represented by which of the following formulae in
propositional logic? (―¬‖ is negation ―^‖ is conjunction, and ―→‖ is implication)
(A) (X ^ ¬ Z) → Y (B) (X ^ Y) → ¬ Z
(C) (X → (Y ^ ¬ Z) (D)(X → Y(^ ¬ Z)

Q5. Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ? (¬ P ⇒ P)
Which of the following statements is correct?
A. F1 is Satisfiable, F2 is valid B. F1 is unsatisfiable, F2 is Satisfiable
C. F1 is unsatisfiable, F2 is valid D.F1 and F2 both are Satisfiable

JANUARY 2017

Q1. The functions mapping R into R are defined as:

f(x) = x3-4x, g(x)=1/(x2+1) and h(x)=x4
Then find the value of the following composite functions:
hog(x) and hogof(x)
-4
(1) (x2+1)4 and [(x3-4x)2+1]4 (2) (x2+1)4 and [(x3-4x)2+1]
4
(3) (x2+1)- 4 and [(x3-4x)2+1]4 (4) (x2+1)- 4 and [(x3-4x)2+1]-

Q2. How many multiples of 6 are there between the following pairs of numbers?
0 and 100 and -6 and 34
(1) 16 and 6 (2) 17 and 6 (3) 17 and 7 (4) 16 and 7

Q3. Consider a Hamiltonian Graph G with no loops or parallel edges and with
|V(G)|=n≥3. Then which of the following is true?
(1) deg(v) ≥ n/2 for each vertex v.
(2) |E(G)| ≥ 1/2(n-1)(n-2)+2
(3) deg(v)+deg(w) ≥ n whenever v and w are not connected by an edge.
(4) All of the above

Q4. In propositional logic if (P→Q)˄(R→S) and (P˅R) are two premises such that

Y is the premise:
(1) P˅R (2) P˅S (3) Q˅R (4) Q˅S

Page | 5
Q5. The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of
the following?
(1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))
(3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P)) (4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))

August 2016 (Re-test)

Q1. The Boolean function [~ (~p˄q)˄~(~p˄~q)]˅(p˄r) is equal to the Boolean
function:
(A) q (B) p˄r (C) p˅q (D) p

Q2. Let us assume that you construct ordered tree to represent the compound
proposition (~(p˄q))↔(~p˅~q).Then, the prefix expression and post-fix expression
determined using this ordered tree are given as ...........and ............. respectively.
(A) ↔~˄pq˅ ~~pq, pq˄~p~q~˅↔ (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔
(C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

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

following: |A−B|,|A⨁B|,|A|+|B|and |A∪B|. Which of the following is in
order of increasing size?
A. |A−B|<|A⨁B|<|A|+|B|<|A∪B|
B. |A⨁B|<|A−B|<|A∪B|<|A|+|B|
C. |A⨁B|<|A|+|B|<|A−B|<|A∪B|
D. |A−B|<|A⨁B|<|A∪B|<|A|+|B|

Q4. What is the probability that a randomly selected bit string of length 10 is a
palindrome?
(A) 1/64 (B) 1/32 (C) 1/8 (D) ¼

Q5. Given the following graphs:

Which of the following is correct?

(A) G1 contains Euler circuit and G2 does not contain Euler circuit.
(B) G1 does not contain Euler circuit and G2 contains Euler circuit.
(C) Both G1 and G2 do not contain Euler circuit.
(D) Both G1 and G2 contain Euler circuit.

Page | 6
Q6. Let v(x) mean x is a vegetarian, m(y) for y is meat, and e(x, y) for x eats y. Based
on these, consider the following sentences:
I. ∀x v(x) ⇔ (∀y e(x, y) ⇒ ¬m(y))
II. ∀x v(x ) ⇔ (¬(∃y m(y) ˄ e(x, y)))
III. ∀x (∃y m(y) ˄ e(x, y)) ⇔ ¬v(x)
One can determine that
(A) Only I and II are equivalent sentences (B) Only II and III are equivalent sentences.
(C) Only I and III are equivalent sentence. (D) I, II, and III are equivalent sentences.

July 2016
Q1. How many different equivalence relations with exactly three different
equivalence classes are there on a set with five elements?
(A) 10 (B) 15
(C) 25 (D) 30

Q2. The number of different spanning trees in complete graph, K 4 and bipartite
graph K2,2 have .......... and .....…. respectively.
(A) 14, 14 (B) 16, 14 (C) 16, 4 (D) 14, 4

Q3. 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.

Q4. There are three cards in a box. Both sides of one card are black, both sides of
one card are red, and the third card has one black side and one red side. We pick a
card at random and observe only one side.What is the probability that the opposite
side is the same colour as the one side we observed?
(A) 3/4 (B) 2/3 (C) 1/2 (D) 1/3

Q5. 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

Page | 7
Q6. Consider the statement,
"Either -2 ≤ x ≤ -1 or 1 ≤ x ≤ 2"
The negation of this statement is
(A) x<-2 or 2<x or -1<x<1 (B) x<-2 or 2<x
(C) -1<x<1 (D) x ≤ -2 or 2 ≤ x or -1<x<1

December 2015
Q1. How many committees of five people can be chosen from 20 men and 12 women
such that each committee contains at least three women?
(A) 75240 (B) 52492 (C) 41800 (D) 9900
Explanation:
We must choose at least 3 women, so we calculate the case of 3 women, 4 women and 5
women and by addition rule add the results. 12C3 x 20C2 + 12C4 x 20C1 + 12C5 x 20C0

Q2. Which of the following statement(s) is/are false?

(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even
degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has
exactly two vertices of odd degree.
(c) A complete graph (Kn) has a Hamilton Circuit whenever n≥3
(d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3
vertices is bipartite.
Codes:
(A) (a) only (B) (b) and (c) (C) (c) only (D) (d) only

Q3. Consider the graph given below:

The two distinct sets of vertices, which make the graph bipartite are:
(A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6)
(C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5)

Explanation:
A simple graph G=(V,E) is called bipartite if its vertex set can be partitioned into two
disjoint subsets V=V1⋃V2, such that every edge has the form e=(a,b) where aϵV1 and
bϵV2.
Bipartite graphs are equivalent to two-colorable graphs.

Page | 8
1. Assign Red color to the source vertex (putting into set V1).
2. Color all the neighbours with Black color (putting into set V2).
3. Color all neighbour‟s neighbour with Red color (putting into set V 1).
4. This way, assign color to all vertices such that it satisfies all the constraints of m way
coloring problem where m = 2.
5. While assigning colors, if we find a neighbour which is colored with same color as
current vertex, then the graph cannot be colored with 2 colors (ie., graph is not Bipartite).
So answer is option (C).

Q4. A tree with n vertices is called graceful, if its vertices can be labelled with
integers 0, 1, 2, ...,n such that the absolute value of the difference of the labels of
adjacent vertices are all different. Which of the following trees are graceful?

Codes:
(A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

From the above figure, we can see that (a), (b) and (c) are graceful.

Page | 9
Q5. Which of the following arguments are not valid?
(a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets
promotion, then he will be happy. He will not be happy, therefore, either he will not get
the job or he will not work hard”.
(b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth,
therefore, Puneet is not guilty”.
(c) If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1.
Codes:
(A) (a) and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)
Answer: Marks to all

6. Let P(m,n) be the statement ―m divides n‖ where the Universe of discourse for
both the variables is the set of positive integers. Determine the truth values of the
following propositions.
(a) ∃m ∀n P(m,n) (b) ∀n P(1,n)
(c) ∀m ∀n P(m,n)
(A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False
(C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Q7. Match the following terms:

List - I List - II
(a) Vacuous proof (i) A proof that the implication p→q is true
based on the fact that p is false
(b) Trivial proof (ii) A proof that the implication p→q is true
based on the fact that q is true
(c) Direct proof (iii) A proof that the implication p→q is true
that proceeds by showing that q must be true when p is true.
(d) Indirect proof (iv) A proof that the implication p→q is true
that proceeds by showing that p must be false when q is false.
Codes:
(a) (b) (c) (d)
(A) (i) (ii) (iii) (iv)
(B) (ii) (iii) (i) (iv)
(C) (iii) (ii) (iv) (i)
(D) (iv) (iii) (ii) (i)

Q8. Consider the compound propositions given below as:

(a) p˅~(p˄q) (b) (p˄~q)˅~(p˄q) (c) p˄(q˅r)
Which of the above propositions are tautologies?
(A) (a) and (c) (B) (b) and (c) (C) (a) and (b) (D) (a), (b) and (c)
Answer: Marks to all :Only (a)

Page | 10
Q9. Which of the following property/ies 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

Q10. A data cube C, has n dimensions, and each dimension has exactly p distinct
values in the base cuboid. Assume that there are no concept hierarchies associated
with the dimensions. What is the maximum number of cells possible in the data cube,
C?
(A) pn (B) p (C) (2n-1)p+1 (D) (p+1)n

Explanation:
(a) What is the maximum number of cells possible in the base cuboid? pn.
This is the maximum number of distinct tuples that you can form with p distinct values per
dimensions.
(b) What is the minimum number of cells possible in the base cuboid? p.
You need at least p tuples to contain p distinct values per dimension. In this case no tuple
shares any value on any dimension.
(c) What is the minimum number of cells possible in the data cube, C?(2n-1)×p+1.
The minimum number of cells is when each cuboid contains only p cells, except for the
apex, which contains a single cell.
(d) What is the maximum number of cells possible (including both base cells and
aggregate cells) in the data cube, C?(p+1)n.
The argument is similar to that of part (a), but now we have p+1 because in addition to the
p distinct values of each dimension we can also choose ∗.

Q11. Suppose that from given statistics, it is known that meningitis causes stiff neck
50% of the time, that the proportion of persons having meningitis is 1/50000, and
that the proportion of people having stiff neck is 1/20. Then the percentage of people
who had meningitis and complain about stiff neck is:
(A) 0.01% (B) 0.02% (C) 0.04% (D)
0.05%
Explanation:
The computation is based on the simplified Bayes‟ formula.
P{B|A} = (P{A|B}·P{B) / P{A}.
P{M|S} = probability that a person had meningitis, conditioned by the existence of stiff
neck.
P{S|M} = probability that a person complains about stiff neck, conditioned by the
existence of meningitis. = 50%=1/2
P{S} = proportion of people who complain about stiff neck. = 1/20
P{M} = proportion of people who had meningitis. = 1/50,000
Then:
P{M|S} = (P{S|M}·P{M}) / P{S} =(1/2 x 1/50,000) / 1/20 = 0.0002 = 0.02%

Page | 11
Q12. How many solutions are there for the equation x+y+z+u=29 subject to the
constraints that x≥1, y≥2, z≥3 and u≥0?
(A) 4960 (B) 2600 (C) 23751 (D) 8855
Explanation:
We let y1=x-1, y2=y-2, y3=z-3, y4=u-0
We count the number of solutions for y1+y2+y3+y4 =29-6=23
n=4, r=23
The number of solutions is C(n+r-1, r) = C(4+23-1, 23)
= C(26,23) = C(26,3) = 26x25x24/1x2x3 = 2600

Q13. In Propositional Logic, given P and P→Q, we can infer.................

(A) ~Q (B) Q (C) P∧Q (D) ~P∧Q

June 2015
Q1. How many strings of 5 digits have the property that the sum of their digits is 7?
(A) 66 (B) 330 (C) 495 (D) 99

Q2. Consider an experiment of tossing two fair dice, one black and one red. What
is the probability that the number on the black die divides the number on red die?
(A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36
Q3. In how many ways can 15 indistinguishable fish be placed into 5 different ponds,
so that each pond contains at least one fish?
(A) 1001 (B) 3876 (C) 775 (D) 200

Q4. Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of
the following is true with respect to this Graph (G)?
(a) deg(v) ≥ n/2 for each vertex of G
(b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges
(c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge
(A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Q5. "lf my computations are correct and I pay the electric bill, then I will run out of
money. If I don't pay the electric bill, the power will be turned off. Therefore, if I
don't run out of money and the power is still on, then my computations are
incorrect."
Convert this argument into logical notations using the variables c, b, r, p for propositions
of computations, electric bills, out of money and the power respectively. (Where ¬ means
NOT)
(A) if (c∧ b) → r and ¬b → ¬p, then (¬r∧ p)→¬c
(B) if (c∨ b) → r and ¬b → ¬p, then (r∧ p)→c
(C) if (c∧ b) → r and ¬p → ¬b, then (¬r∨ p)→¬c
(D) if (c∨ b) → r and ¬b → ¬p, then (¬r∧ p)→¬c

Page | 12
Q6. Match the following:
List - I List - II
(a) (p →q) ⇔(¬q→¬p) (i) Contrapositive
(b) [(p∧ q)→r]⇔[p→ (q→r)] (ii) Exportation law
(c) (p→q)⇔[(p∧ ¬q)→o] (iii) Reductio ad absurdum
(d) (p⇔q)⇔[(p→q)∧ (q→p)] (iv) Equivalence
Codes:
(a) (b) (c) (d)
(A) (i) (ii) (iii) (iv)
(B) (ii) (iii) (i) (iv)
(C) (iii) (ii) (iv) (i)
(D) (iv) (ii) (iii) (i)

Q7. Consider a proposition given as:

"x≥6, if x2≥25 and its proof as:
If x≥6, then x2=x.x=6.6=36≥25
Which of the following is correct w.r.to the given proposition and its proof ?
(a) The proof shows the converse of what is to be proved.
(b) The proof starts by assuming what is to be shown.
(c) The proof is correct and there is nothing wrong.
(A) (a) only (B) (c) only (C) (a) and (b) (D) (b) only

Q8. The clausal form of the disjunctive normal form ¬A∨ ¬B∨ ¬C∨ D is:
(A) A ∧ B ∧ C ⇒ D (B) A ∨ B ∨ C ∨ D ⇒ true
(C) A ∧ B ∧ C ∧ D ⇒ true (D) A ∧ B ∧ C ∧ D ⇒ false

Q9. 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)

December 2014
Q1. 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

Q2. 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

Page | 13
Q3. Consider the Graph shown below:

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

(A) Complete Graph (B) Bipartite Graph
(C) Hamiltonian Graph (D) All of the above

Q4. A computer program selects an integer in the set {k: 1 ≤ k ≤ 10,00,000} at

random and prints out the result. This process is repeated 1 million times. What is
the probability that the value k = 1 appears in the printout atleast once?
(A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Q5. If we define the functions f, g and h that map R into R by :

f(x) = x4, g(x)=√(x2+1), h(x) = x2+72, then the value of the composite functions ho(gof)
and (hog)of are given as
(A) x8 – 71 and x8 – 71 (B) x8 – 73 and x8 – 73
(C) x8 + 71 and x8 + 71 (D) x8 + 73 and x8 + 73

Q6. Equivalent logical expression for the Well Formed Formula (WFF),~(∀x) F[x]is
(A) ∀x (~F[x]) (B) ~(∃x) F[x](C) ∃x (~F[x]) (D) ∀x F[x]

Q7. The resolvent of the set of clauses(A ∨ B, ~A ∨ D, C ∨ ~B) is

(A) A ∨ B (B) C ∨ D (C) A ∨ C (D) A ∨ D

June 2014
Q1. How many different truth tables of the compound propositions are there that
involve the propositions p & q?
(A) 2 (B) 4 (C) 8 (D) 16

Q2. 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

Page | 14
Q3. 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)

Q4. Consider a complete bipartite graph km,n. For which values of m and n does this,
complete graph have a Hamilton circuit
(A) m=3, n=2 (B) m=2, n=3 (C) m=n≥2 (D) m=n≥3

Q5. 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

Q6. Consider the graph given below as:

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

Answer: C

Page | 15
 December 2013
Q1. Let P(m, n) be the statement
"m divides n" where the universe of discourse for both the variables is the set of
positive integers. Determine the truth values of each of the following propositions:
I. ∀ m ∀ n P(m,n),
II. ∃ m ∀ n P(m, n)
(A) Both I and II are true (B) Both I and II are false
(C) I - false & II – true (D) I - true & II – false

Q2. How many edges are there in a forest of t-trees containing a total of n vertices?
A) n+t (B) n-t (C) n*t (D) nt

Q3. Let f and g be the functions from the set of integers to the set integers defined by
f(x) = 2x + 3 and g(x) = 3x + 2
Then the composition of f and g and g and f is given as
(A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7
(C) 5x + 5, 5x + 5 (D) None of the above
Explanation:
fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7
gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

Q4. If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to
(A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r)
(C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)
Explanation:
p(n, r) = n!/(n-r)!
p( n+1, r) = (n+1)!/(n+1-r)!= (n+1) n! /(n+1-r) (n-r)!= P(n, r)(n+1)/(n+1-r)

Q5. A graph is non-planar if and only if it contains a subgraph homeomorphic to

(A) K3,2 or K5 (B) K3,3 and K6
(C) K3,3 or K5 (D) K2,3 and K5
Explanation:
Kuratowski’s Theorem: A graph is non-planar if and only if it contains a subgraph that is
homeomorphic to either K5or K3,3.

June 2013 (Re-test 8th Sept. 2013)

Q1. Consider an undirected graph G with 100 nodes. The maximum number of
edges to be included in G so that the graph is not connected is
(A) 2451 (B) 4950 (C) 4851 (D) 9900

Q2. Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of
them pink, 2 of them yellow and the rest ones white.
(A) 55,440 (B) 1,66,320 (C) 4.790E+08 (D) 39,91,680

Page | 16
Q3. Consider the following statements:
(i) A graph in which there is a unique path between every pair of vertices is a tree.
(ii) A connected graph with e = v – 1 is a tree.
(iii) A graph with e = v – 1 that has no circuit is a tree.
Which of the above statements is/are true?
(A) (i) & (iii) (B) (ii) & (iii) (C) (i) & (ii) (D) All of the above

Q4. A simple graph G with n-vertices is connected if the graph has

(A) (n – 1) (n – 2)/2 edges
(B) more than (n – 1) (n – 2)/2 edges
(C) less than (n – 1) (n – 2)/2 edges
(D) Σki=1 C(ni, 2) edges

Q5. The quantification ∃ !x P(x) denotes the proposition ―There exists a unique x
such that P(x) is true‖, express the quantification using universal and existential
quantifications and logical operators:
(A) ∃ x P(x) ∨ ∀ x∀ y ((P(x) ∨ P(y)) → x = y)
(B) ∀ x P(x) ∧ ∀ x∀ y ((P(x) ∨ P(y)) → x = y)
(C) ∃ x P(x) ∧ ∀ x∀ y ((P(x) ∧ P(y)) → x = y)
(D) ∃ x P(x) ∧ ∃ x∃ y ((P(x) ∨ P(y)) → x = y)

Q6. Which of the following is a correct predicate logic statement for ―Every Natural
number has one successor‖?
(A) ∀ x∃ y (succ(x, y) ∧ (∃ z succ(x, z) ⇒ equal (y, z)))
(B) ∀ x∃ y (succ(x, y) ∨ (∃ z succ(x, z) ⇒ equal (y, z)))
(C) ∃ y∀ x (succ(x, y) ∧ (∃ z succ(x, z) ⇒ equal (y, z)))
(D) ∀ x∃ ysucc (x, y)
Q7. How many people must there be in a room before there is a 50% chance that
two of them were born on the same day of the year?
(A) At least 23 (B) At least 183 (C) At least 366 (D) At least 730

June 2013
Q1. The relation "divides" on a set of positive integers is..................
(A) Symmetric and transitive (B) Anti symmetric and transitive
(C) Symmetric only (D) Transitive only
Explanation:
The „divide‟ operation is antisymmetric because if a divides b does not necessarily implies
that b divides a. If a divides b and b divides c then a divides c. So, it is transitive as well.

Q2. A test contains 100 true/false questions. How many different ways can a student
answer the questions on the test, if the answer may be left blank also.
(A) 100P2 (B) 100C2 (C) 2100 (D) 3100
Explanation:

Page | 17
 For every question we can leave it blank or answer TRUE or answer FALSE. So, for each
question we have 3 options.
So, total ways of answering the test is 3*3*3*..... 100 times = 3 100

Q3. Which of the following connected simple graph has exactly one spanning tree?
(A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above

Q4. How many edges must be removed to produce the spanning forest of a graph
with N vertices, M edges and C connected components?
(A) M+N-C (B) M-N-C (C) M-N+C (D) M+N+C

Q5. Which of the following shall be a compound proposition involving the

propositions p, q and r, that is true when exactly two of the p, q and r are true and is
false otherwise?
( ⌉ IS NEGATION )
A) (p∨q∧⌉r)∨(p∧q∧r)∧(⌉p∧q∨r) B) (p∧q∨r)∧(p∧q∧r)∨(⌉q∧⌉q∧⌉r)
C) (p∧q∧⌉r)∨(p∧⌉q∧r)∨(⌉p∧q∧r) D) (p∨r∧q)∨(p∧q∧r)∨(⌉p∧q∧r)

Q6. The truth value of the statements:

∃!xP(x)→ ∃xP(x) and ∃!x˥P(x)→˥∀ xP(x), (where the notation ∃ !xP(x) denotes the
proposition "There exists a unique x such that P(x) is true'') are:
(A) True and False (B) False and True(C) False and False (D) True and True
Q7. A vertex cover of an undirected graph G(V, E) is a subset V 1 ⊆ V vertices such that
(A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and
v ∈ V1
(C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1
(D) All pairs of vertices in V1 are not connected by an edge
December 2012
Q1. The power set of the set {ϕ} is
(A) {ϕ} (B) {ϕ, {ϕ}} (C) {0} (D) {0, ϕ, {ϕ}}

Q2. Consider the tree given below:

Using the property of eccentricity of a vertex, find every vertex that is the centre of
the given tree.
(A) d&h (B) c&k(C) g, b, c, h, i, m (D) c&h

Q2. Consider the tree given below: [Dec -2012]

Page | 18
Using the property of eccentricity of a vertex, find every vertex that is the centre of
the given tree.
(A) d&h (B) c&k(C) g, b, c, h, i, m (D) c&h

Q3. The no. of ways to distribute n distinguishable objects into k distinguishable

boxes, so that ni objects are placed into box i, i = 1, 2,….,k equals which of the
following?

Answer: C

Q4. How many solutions do the following equationshave?

x1+x2+x3=11where x1≥1, x2≥2, x3≥3
(A) C(7, 11) (B) C(11, 3) (C) C(14, 11) (D) C(7, 5)
Explanation:
x1+x2+x3=11, x1≥1, x2≥2, x3≥3
x1=y1+1, x2=y2+2, x3=y3+3
y1+y2+y3=x1+x2+x3 - 6 = 11-6 = 5
Then the solutions are 5+3-1C5 = 7C5
Theorem: there are C(n+r-1,r) solutions, r-combinations from a set with n elements when
repetition of elements is allowed.

Q5. The number of distinct bracelets of five beads made up of red, blue, and green
beads (two bracelets are indistinguishable if the rotation of one yield another) is,
(A) 243 (B) 81 (C) 51 (D) 47

Page | 19
Q6. 58 lamps are to be connected to a single electric outlet by using an extension
board each of which has four outlets. The number of extension boards needed to
connect all the light is
(A) 29 (B) 28 (C) 20 (D) 19

Q7. The power set of AUB, where A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is

(A) 256 (B) 64 (C) 16 (D) 4
Explanation:
AUB = {2, 3, 5, 7, 8, 9}, having 6 elements the power set have 2 6 = 64

Q8. Two graphs A and B are shown below:Which one of the following statement is
true?

(A) Both A and B are planar.

(B) Neither A nor B is planar.
(C) A is planar and B is not.
(D) B is planar and A is not.

Explanation:

A planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the
plane in such a way that its edges intersect only at their endpoints. In other words, it can
be drawn in such a way that no edges cross each other.

Q9. Let θ(x, y, z) be the statement ―x+y=z‖ and let there be two quantifications
given as
(i) ∀ x ∀ y ∃ Z θ(x, y, z)
(ii) ∃ Z ∀ x ∀ y θ(x, y, z)
Where x, y, z are real numbers. Then which one of the following is correct?
(A) (i) is true and (ii) is true.
(B) (i) is true and (ii) is false.
(C) (i) is false and (ii) is true.
(D) (i) is false and (ii) is false.

Page | 20
 June 2012
Q1. The number of colours required to properly colour the vertices of every planer
graph is
(A) 2 (B) 3 (C) 4 (D) 5

Q2. Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as
(i) ∃y∀x Q(x, y)
(ii) ∀x∃y Q(x, y)
where x & y are real numbers. Then which of the following is valid?
(A) (i) is true & (ii) is false. (B) (i) is false & (ii) is true.
(C) (i) is false & (ii) is also false. (D) both (i) & (ii) are true.

Q3. How many relations are there on a set with n elements that are symmetric and a
set with n elements that are reflexive and symmetric?
(A) 2n(n+1)/2 and 2n.3n(n–1)/2 (B) 3n(n–1)/2 and 2n(n–1)
n(n+1)/2 n(n–1)/2
(C) 2 and 3 (D) 2n(n+1)/2 and 2n(n–1)/2

Q4.

G1 and G2 are two graphs as shown:

(A) Both G1 and G2 are planar graphs.
(B) Both G1 and G2 are not planar graphs.
(C) G1 is planar and G2 is not planar graph.
(D) G1 is not planar and G2 is planar graph.

December&june 2011

Q1. Domain and Range of the functionY = –√(–2x + 3) is

(A) x≥3/2, y≥0 (B) x>3/2, y≤0(C) x≥3/2, y≤0 (D) x≤3/2, y≤0

Q2. Maximum number of edges in a n-Node undirected graph without self loop is
(A) n2 (B) n(n – 1)(C) n(n + 1) (D) n(n – 1)/2

Q3. The proposition ~qvp is equivalent to

(A) p→q (B) q→p (C) p↔q (D) p˅q

Page | 21
Q4. What is the probability of choosing correctly an unknown integer between 0 and
9 with 3 chances?
(A) 963/1000 (B) 973/1000 (C) 983/1000 (D) 953/1000

December 2010
Q1. The number of integers between 1 and 250 that are divisible by 2, 5 and 7 is
(A) 2 (B) 3 (C) 5 (D) 8

Q2. An undirected graph possesses aneulerian circuit if and only if it is connected

and its vertices are
(A) all of even degree (B) all of odd degree
(C) of any degree (D) even in number

Q3. A partially ordered set is said to be a lattice if every two elements in the set have
(A) a unique least upper bound
(B) a unique greatest lower bound
(C) both (A) and (B)
(D) none of the above

Q4. The minimum number of edges in a connected graph with ‗n‘ vertices is equal to
(A) n(n–1) (B) n(n–1)/2 (C) n2 (D) n–1

Q5. Consider the problem of connecting 19 lamps to a single electric outlet by using
extension cords each of which has four outlets. The number of extension cords
required is
(A) 4 (B) 5 (C) 6 (D) 7

December 2009
Q1. The number of edges in a complete graph of n vertices is
(A) n (B) n(n – 1)/2 (C) n(n + 1)/2 (D) n2/2
June 2009
Q1. The complete graph with four vertices has k edges where k is:
(A) 3 (B) 4 (C) 5 (D) 6

December 2008
Q1: The graph K3,4 has:
(A) 3 edges (B) 4 edges (C) 7 edges (D) 12 edges

Q2. The total number of spanning trees that can be drawn using five labeled vertices
is:
(A) 125 (B) 64 (C) 36 (D) 16

Page | 22
Explanation:
Cayley devised the well-known formula nn−2 for the number of spanning trees in the
complete graph Kn. = 55-2 = 125

Q3. 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

June 2008
Q1. Which of the following does not define a tree?
(A) A tree is a connected acyclic graph.
(B) A tree is a connected graph with n-1 edges where ‟n‟ is the number of vertices in the
graph.
(C) A tree is an acyclic graph with n-1 edges where ‟n‟ is the number of vertices in the
graph.
(D) A tree is a graph with no cycles.

Q2. 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

Q3. 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

Q4. An example of a tautology is:

(A) x v y (B) x v (~y) (C) x v (~x) (D) (x=>y)˄(x<=y)

December 2007
Q1. A box contains six red balls and four green balls. Four balls are selected at
random from the box. What is the probability that two of the selected balls are red
and two are green?
(A) 3/7 (B) 4/7 (C) 5/7 (D) 6/7

C(6,2)C(4,2)
Explanation: /C(10,4)

Q2. The number of edges in a complete graph with ‗n‘ vertices is equal to:

Page | 23
(A) n(n-1) (B) n(n-1)/2 (C) n2 (D) 2n-1

Q3. A WFF that is equivalent to the WFF x=>y is:

(A) y=>x (B) ~y=>x (C) ~y=>~x
(D) y=>~x

June 2006
Q1: For a complete graph with N vertices, the total number of spanning trees is
given by:
(A) 2N-1 (B) NN-1 (C) NN-2 (D) 2N+1

Q2. The preposition (p→q) ˄ (~q˅p) is equivalent to:

(A) q→p (B) p→q (C) (q→p) ˄ (p→q) (D) (p→q) ˅ (q→p)

Q3. Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is:

(A) injective
(B) surjective
(C) both injective and surjective
(D) neither injective nor surjective

Q4. Which of the following statement is false?

(A) Every tree is a bipartite graph
(B) A tree contains a cycle
(C) A tree with n nodes contains (n-1) edges
(D) A tree is connected graph

December 2005
Q1: If the proposition ¬p→q is true, then the truth value of the proposition
¬p∨ (p→q), where ¬ is negation, ∨ is inclusive OR and → is implication, is
A) True
B) Multiple Values
C) False
D) Cannot be determined

Q2: Let A and B be two arbitrary events, then:

(A) P(A∩B) = P(A)P(B)
(B) P(AUB) = P(A)+P(B)
(C) P(AUB) ≤ P(A)+P(B)
(D) P(A/B) = P(A∩B)+P(B)

Page | 24
 June 2005
Q1: The transitive closure of a relation R on set A whose relation matrix

AnswerKEY: B

Q2. Consider the relation on the set of non-negative integers defined by x≡y if and
only if:
(A) x mod 3=3 mod y
(B) 3 mod x≡3 mod y
(C) x mod 3=y mod 3
(D) None of the above

Q3: Minimum number of individual shoes to be picked up from a dark room

(containing 10 pair of shoes) if we have to get at least one proper pair:
(A) 2 (B) 20
(C) 11 (D) None of these

Q4. Which of the following statement is false?

(A) Every tree is a bipartite graph
(B) A tree contains a cycle
(C) A tree with n nodes contains n-1 edges
(D) A tree is a connected graph

December 2004
Q1: If f(x) =x+1 and g(x)=x+3 then fofofof is:
(A) g
(B) g+1
(C) g4
(D) None of the above

Q2: The following lists are the degrees of all the vertices of a graph:
(i) 1, 2, 3, 4, 5 (ii) 3, 4, 5, 6, 7 (iii) 1, 4, 5, 8, 6 (iv) 3, 4, 5, 6
then, which of the above sequences are graphic?
(A) (i) and (ii)
(B) (iii) and (iv)
(C) (iii) and (ii)
(D) (ii) and (iv)

Page | 25
Q3. If Im denotes the set of integers modulo m, then the following are fields with
respect to the operations of addition modulo m and multiplication modulo m:
(i) Z23 (ii) Z29 (iii) Z31 (iv) Z33
Then
(A) (i) only
(B) (i) and (ii) only
(C) (i), (ii) and (iii) only
(D) (i), (ii), (iii) and (iv)

Q4. Weighted graph:

(A) Is a bi-directional graph (B) Is directed graph
(C) Is graph in which number associated with arc (D) Eliminates table method

Q5: The degree sequence of a simple graph is the sequence of the degrees of the
nodes in the graph in decreasing order. Which of the following sequences can not be
the degree sequence of any graph?

I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2
III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8, 7, 7, 6, 4, 2, 1, 1
(A) I and II (B) III and IV
(C) IV only (D) II and IV

Q6: An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is called graphic if
there exists a simple undirected graph with n vertices having degrees d 1, d2, … , dn
respectively. Which of the following 6-tuples is NOT graphic?
(A) (1, 1, 1, 1, 1, 1)
(B) (2, 2, 2, 2, 2, 2)
(C) (3, 3, 3, 1, 0, 0)
(D) (3, 2, 1, 1, 1, 0)

X
Tayyab khan
faculty @ AIM

“Learn from yesterday, live for today,

hope for tomorrow.‖ —Albert Einstein

Page | 26