VEL TECH MULTI TECH DR RANGARAJAN DR SAKUNTHALA ENGINEERING COLLEGE

231MA202 / Discrete Mathematics.

UNIT – I
LOGIC AND PROOFS
Part – A (1 mark)

S.NO. Question Bank CO C Level

1 Which of the following statement is correct? CO1.1 CL1
a) p ∨q ≡ q ∨ p b) ¬( p ∧q)≡¬ p ∨¬ q
c) ( p ∨q) ∨r ≡ p ∨(q ∨ r ) d) All the above

2 Which of the following statement is a proposition? CO1.1 CL1

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

3 A declarative statement which cannot be further split up into simple sentence is CO1.1 CL1
a) Declarative b) Primary c) Preposition d) Connectives
4 Let P: This is a great website, Q: You should not come back here. Then ‘This is a CO1.1 CL2
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
5 p ↔ q is logically equivalent to ________ CO1.2 CL1
a) ( p → q)→(q → p)b) ( p → q)∨(q → p)c)( p → q)∧(q → p)d)
( p ∧q) →(q ∧ p)
6 Let P, Q, R be true, false true, respectively, which of the following is true? CO1.2 CL1
a) P ∧Q ∧ R b) P ∧ Q ∧ R c) Q →(P∧ R) d) P →(Q∧ R)
7 Let P: We give a nice overall squad performance, Q: We will win the match. CO1.2 CL1
Then the symbolic form of “We will win the match if and only if we give a nice
overall squad performance.
a) P ⋀ Q b) Q ∧ P c) Q ↔ P d) P ⋀ Q
8 A compound proposition that is neither a tautology nor a contradiction is called a CO1.2 CL1
_____
a) Contingency b) Equivalence c) Condition d) Inference
9 What are the inverse of the conditional statement “ A positive integer is a CO1.3 CL1
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
10 What is the converse of the conditional statement “If it ices today, I will play ice CO1.3 CL1
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 not 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.”
11 The compound propositions p and q are called logically equivalent if ________ is a CO1. 3 CL1
tautology.
a) p ↔ q b) p → q c) ¬( p ∨q) d) ¬ p ∨¬ q
12 A statement formula which is always true? CO1.3 CL1
a) Contradiction b) Tautology c) contra positive d) Converse
13 Consider the set A = {1, 2, 3}, the power set of A has …. elements CO1.3 CL1
A) 23 B) 22 C) 25 d) None of these
14 The proposition ~p ν (p ν q) is a CO1.2 CL1
A) Tautology B) Contradiction C) Logical equivalence D)
None of these
15 Let P: I am in Bangalore.; Q: I love cricket.; then Q → P (Q implies P) is? CO1.2 CL2
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 A: I am in Delhi. ; B: Delhi is clean. ; then B ⋀ A (A and B) is? CO1.2 CL2
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
17 Which of the following statements is the negation of the statements “4 is odd or - CO1.2 CL2
9 is positive”?
a) 4 is even or -9 is not negative b) 4 is odd or -9 is not negative

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

c) 4 is even and -9 is negative d) 4 is odd and -9 is not negative
18 CO1.2 CL1
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 these
19 If P is always against the testimony of Q, then the compound statement P→(P v ~Q) is a CO1.2 CL1
__________
a) Tautology b) Contradiction c) Contingency d) None of these
20 The contrapositive of p → q is the proposition of ____________ CO1.2 CL1
a) ¬ p → ¬q b) ¬ q →¬ p c) q → p d) ¬ q → p
21 Translate ∀ x ∃ y ¿) in English, considering domain as a real number for both the CO1.3 CL2
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
22 CO1.4 CL2
Which one of the following well-formed formulae in predicate calculus is NOT valid?
a) ( ∀ xp(x )∨ ∀ xq (x)¿ ⇒(∃ x ¬ p (x)∨ ∀ xq (x))
b) (∃ xp (x)∨∃ xq (x ))⇒∃ x ( p(x )∨ q(x ))
c) ∃ x ( p(x )∧ q (x))⇒(∃ xp (x)∧∃ xq (x))
d ¿ ∀ x ( p (x)∨q (x))⇒(∀ xp(x )∨ ∀ xq (x ))
23 The truth value of ‘4+3=6 or 5 is not prime’ CO1.4 CL2
a) False
b) True
c) Neither true nor false
d) None of these
24 Consider the following statements. CO1.5 CL2
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
25 Consider the following two statements. CO 1.5 CL2
S1: If a candidate is known to be corrupt, then he will not be elected
S2: If a candidate is kind, he will be elected
Which one of the following statements follows from S1 and S2 as per sound
inference rules of logic?
a) If a person is kind, he is not known to be corrupt.
b) If a candidate is known to be corrupt, he will be elected.
c) If a candidate is kind, If a candidate is known to be corrupt.
d) None of these.

26 p ∨ q is logically equivalent to ________ CO1.2 CL2

a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q
27 ¬ (p ↔ q) is logically equivalent to ________ CO1.2 CL2
a) q↔p
b) p↔¬q
c) ¬p↔¬q

(p → q) ∧ (p → r) is logically equivalent to ________

d) ¬q↔¬p

a) p → (q ∧ r)
28 CO1.2 CL2

b) p → (q ∨ r)
c) p ∧ (q ∨ r)
d) p ∨ (q ∧ r)
29 Let P (x) denote the statement “x >7.” Which of these have truth value true? CO1.3 CL1
a) P (0)
b) P (4)
c) P (6)
d) P (9)
30 Which rule of inference is used in each of these arguments, “If it is Wednesday, then the CO1.5 CL1
Smartmart will be crowded. It is Wednesday. Thus, the Smartmart is crowded.”
a) Modus tollens
b) Modus ponens
c) Disjunctive syllogism
d) Simplification
31 Which of the following option is true? CO1.1 CL1
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
 a) A ∧ F
32 If A is any statement, then which of the following is a tautology? CO1.2 CL1

b) A ∨ F
c) A ∨ ¬A
d) A ∧ T
33 A compound proposition that is neither a tautology nor a contradiction is CO1.2 CL2
called a ___________
a) Contingency
b) Equivalence
c) Condition
d) Inference
34 The statement,” Every comedian is funny” where C(x) is “x is a comedian” CO1.6 CL2

a) ∃x(C(x) ∧ F (x))
and F (x) is “x is funny” and the domain consists of all people.

b) ∀x(C(x) ∧ F (x))
c) ∃x(C(x) → F (x))
d) ∀x(C(x) → F (x))
35 In proving √5 as irrational, we begin with assumption √5 is rational in which CO1.7 CL2
type of proof?
a) Direct proof
b) Proof by Contradiction
c) Vacuous proof
d) Mathematical Induction

PART B

Construct the truth table for ( P →Q ) ⟺ (¬ Q → ¬ P ).

S.NO. Question CO CL Level

[ A.U A/M 2015]

1 CO 1.2 CL2

Q 𝗏 (P ∧ ¬ Q) 𝗏 (¬ P ∧ ¬ Q) is a tautology. [ A.U N/D

2 What is meant by Tautology? With using truth table, show that CO 1.2 CL2

1996]
3 Using the truth table verify that the proposition (P ∧ Q) ∧ ¬ (P 𝗏 Q) CO 1.2 CL2
[ A.U N/D 2003]
 Show that ¬ (P ∧ Q) → (¬ P 𝗏 (¬ P 𝗏 Q)) ⟺ (¬ P 𝗏 Q) (Use
only the laws) [ A.U A/M 2004]
4 CO 1.3 CL2

Prove that (P → Q) ∧ (R →Q) ⟺ (P 𝗏 R ) → Q. [ A.U N/D

2002]
5 CO 1.3 CL3

P→ (P→ Q) ∧ ¬ (¬ Q 𝗏 ¬ P). [ A.U N/D 2003]

6 Obtain a conjunctive normal form of the formula CO1.4 CL3

P→(( P→Q) ∧¬(¬Q 𝗏¬P)).

7 Obtain disjunctive normal forms of CO1.4 CL3

[ A.U N/D 2010]

Obtain the PDNF of (¬ P 𝗏 Q) (or) P→ Q. Also find PCNF.
[ A.U A/M 2012]
8 CO1.4 CL2

[ A.U A/M 2003]

9 a) Symbolise: Fopr every x , there exists a y such that x 2+ y 2 ≥ 100. CO1.6 CL2

b) Give the symbolic form of the statement “every

book with a blue cover is a mathematics book”. [ A.U
N/D 2005]

P → Q , P → R , Q → ¬ R, P. [ A.U M/J 2006]

10 Show that the following sets of premises are inconsistent. CO1.6 CL2

Prove that (∃ x )[(P(x) ∧ Q(x)] ⇒ (∃ x ) P(x) ∧ (∃ x ) Q(x).

[ A.U A/M 2005]
11 CO1.7 CL2

12 Give a direct proof of the statement.”The square of an odd integer is an CO1.8 CL2

[ A.U A/M 2018]

odd integer”.

PART C

S.NO. Question CO C Level

a) Show that (¬ P ∧ (¬ Q ∧ R)) 𝗏 ((Q ∧ R) 𝗏 ( P ∧ R ))⟺ R

CO1.1 CL4

[ A.U A/M 2023]

1
 b) Show that ¬ ( P 𝗏 (¬ P ∧ Q)) and ¬ P ∧ ¬ Q are logically
equivalent. [ A.U N/D 2022]
2 Without Constructing the truth table obtain the product of sums canonical CO1.2 CL4

products canonical form. [ A.U A/M 2019]

form of the formula. (¬ P→ R) ∧ (Q↔ P). Hence find the sum of

a) Obtain the PDNF and PCNF of P 𝗏 (¬ P → ( Q 𝗏 (¬ Q → R))).

[ A.U A/M 2023]
3 CO1.4 CL4

b) Obtain the PCNF and PDNF for [P→ (Q ∧ R)] ∧ [¬ P→(¬

Q ∧¬ R)]

a) By indirect proof, show that P→ Q, Q→ R, P 𝗏 R →R.

[ A.U N/D 2004].
4 CO1.4 CL4

b) Show that the following implication by using

indirect method.
( R → ¬ Q), R 𝗏 S, S → ¬ Q, P → Q → ¬ P. [ A.U M/J 2006].

a) Show that (R 𝗏 S) follows logically from the premises

(C 𝗏 D), (C 𝗏 D) → ¬ H, ¬ H → (A ∧ ¬ B) and (A ∧ ¬ B) → ¬ ( R 𝗏 S).
5 CO1.5 CL5

[ A.U M/J 2006].

b) Show that R → S can be derived from the premises
P → (Q → S), ¬ R 𝗏 P and Q. [ A.U N/D 2005].
CO1.6 CL4

P → ¿𝗏 R), (Q → ¬ P ¿, (S→ ¬ R ¿ , P .
6 Using indirect method of proof, derive P → ¬ S from

[ A.U N/D 2022]

[ A.U N/D 2018]

7 a) Prove that √ 2 is irrational by giving a proof using contradiction. CO1.6 CL4

b) Write each of the following in symbolic form.

a) All men are good.
b) No men are good
c) Some men are good.

[ A.U A/M 2006]

d) Some men are not good.

8 Show that the following premises are inconsistent. CO1.7 CL4

1) If Jack misses many classes through illness, then

he fails high school.
2) If Jack fails high school, then he is uneducated.
3) If Jack reads a lot of books, then he is not
 uneducated.
4) Jack misses many classes through illness and reads
a lot of books. [ A.U A/M 2004]

Show that the following premises, one student in this class knows how to CO1.6 CL4
9 write programme in JAVA. Everyone who knows to write programme in
JAVA can get a high paid job. Implies that conclusion someone in this

[ A.U N/D 2022]

class can get a high paid job.

10 a) Use a direct proof to show that “ every odd integer is the difference of CO1.8 CL4
two squares.”

1
b) Prove that if x is irrational then is irrational.
[ A.U N/D 2005]
x

UNIT II COMBINATORICS

S.NO Question CO CL
.
level
 1 If xn – 1 is divisible by x – k, then the least positive CO2.1 CL2
integral value of k is
a) 1 b) 2 c) 3 d) 4
If P(n) is statement such that P(3) is true ,assuming P(k) is true and CL1
2 P(k+1) is true for all k ≥ 3 then P(n) is true CO2.1
a) For all n b) for n≥ 3 c) for n≥ 4 d) None of the above
3 In the principle of mathematical induction, which of the CO2.1 CL1
following steps is mandatory?
a) induction hypothesis b) inductive reference
c) induction set assumption d) minimal set representation
4 For every positive integer n, 7n – 3n is divisible by CO2.2 CL1
a) 3 b) 4 c) 7 d) 5
5 How many bit strings of length 10 both begin and end with 1? CO2. 3 CL2
a) 256 b) 128 c) 124 d) 277
6 The number of 4-digit numbers having their digits in non- CO2.3 CL2
decreasing order (from left to right) constructed by using
the digits belonging to the
set 1,2,3 is .
a) 15 b) 8 c) 10 d) 11
7 If m pigeon occupies n holes (m>n) then at least one hole has CO2. 3 CL1
more than……… Pigeon.

a) ( m+1
n )
+1 b) ( m−1
n )
−1

c) (
n )
d) (
n )
m+1 m+1
−1 +2
8 Find the number of distinct permutations that can be CO2.4 CL2
formed from all the letters of each word ‘UNUSUAL’
a) 815 b) 796 c) 840 d) 890
9 In how many ways can 5 persons be selected from among 10 CO2.4 CL2
persons?
a) 252 ways b) 246 ways c) 256 ways d) 456 ways
10 How many different words can be formed out of the CO2.4 CL2
letters of the word VARANASI?
a) 64 b) 120 c) 430 d) 720
11 In how many different ways can the letters of the word CO2.4 CL2
ENGINEERING could be arranged?
a) 7720 b) 22720 c) 20720 d) 277200
12 In how many ways can 6 boys and 4 girls be arranged in a CO2.5 CL2
straight line, so that no two girls are ever together?
a) 604500 b) 151200 c) 600400 d) None of these

In how many ways can the letters of the word ‘MOBILE’ be

 13 arranged, so that the consonants always occupy the odd places? CO2. 5 CL2
a) 26 b) 16 c) 36 d) None of these
14 In how many ways can 6 persons occupy 3 vacant seats CO2. 5 CL2
a) 110 ways b) 160 ways c) 120 ways d) 18
ways
15 The value of 7P2 is CO2. 5 CL2
a) 14 b) 42 c) 36 d)9
16 The recurrence relation capturing the optional execution time of CO2. 6 CL1
the Towers of Hanoi problem with n discs is
a)T(n) = 2T(n-1)+1 b) T(n) = 2T(n-1)-1
c) T(n) = 2T(n+1)+1 d) T(n) = 2T(nx1)+1
17 Find Sn , when characteristic roots are 2,-3 CO2. 6 CL2
a) Sn=α 1 (2)n +α 2 (−3)n
b) Sn=α 1 (−2)n +α 2 (−3)n
c) Sn=α 1 (2)n +α 2 (3)n
d) Sn=α 1 (−2)n +α 2 (3)n

18 CO2. 6 CL2
Write the characteristic roots of a n=6 a n−1−9 an−2
a) 3, 4 b) 1,2 c) -2,4 d) 3,3
19 CO2. 6 CL2
Find r, when a(n) n
n =α 1 (2) +α 2 (4)
n
.
a) 2,4 b) 2,3 c)4,1 d)3,4
20 CO2. 7 CL2
Find the recurrence relation whose solution is s ( k ) =5.2 k
a) 2 s ( k−1 ) −s ( k )=0 b) 2 s ( k +1 )−s ( k )=0
c) 2 s ( k +1 ) +s ( k )=0 d) 2 s ( k )−s ( k + 1 )=0
21 CO2. 7 CL2
If the sequence is G ( x )=7−4 x +3 x 2+ x 4 , then its generating
function is
a) ( 7 ,−4 ,3 , 0 , 1 ) b) ( 7 ,−4 ,3 , 0 ) c) ( 1 ,−4 , 3 , 0 ) d)
( 7 , 4 ,3 , 0 )
22 The Generating function for ‘s’, then G(x) is CO2. 7 CL1
∞ ∞
a) ∑
∞ an x
n
b) ∑1 an x
−n

c) ∑
n=0−a x n
n ∑ an x n
d) n=0
n=0 n=0

23 CO2. 7 CL1
Write the generating function for the sequence 1 , a , a2 , a3 , …

1 1
a) G ( x )= b) G ( x )=
(1−ax) (1+ax )
−1 1
c) G ( x )= d) G ( x )=
(1−ax) (−1−ax)
24 How many positive integers not exceeding 1000 are CO2. 8 CL1
divisible by 7 or 11?
a) 120 b) 100 c) 20 d) 220
25 CO2. 8 CL1
The principle of inclusion and exclusion says that | A 1 ∪ A2|
a) | A 1|+|A 2|−| A 1 ∩ A 2|
b) | A 1|+|A 2|+| A 1 ∩ A2|
c) | A 1|−| A2|−| A1 ∩ A2|

d) None of the above

PART B

CO2.1 CL2
n
1 Use mathematical induction to show that the inequality n < 2 is
true for all positive integer n
2 Using Mathematical Induction, CO2.1 CL2
show that 2n<n! Where n >=4
3 (i)Show that among 100 people atleast 9 of them were CO2.3 CL2
born in same month.
(ii) Show that it seven colours are used to paint 50 bicycles
then atleast 8 bicycles will be in same colour.
4 How many permutations of { a , b , c , d ,e , f , g },(i) end with a? CO2.4 CL2
(ii) begin with c? (iii) begin with c and end with a? (iv) c and a
occupy the end places?
5 Obtain the value of these quantities (a) P(8,1) (b) P(8, 8) (c) C(5,3) CO2.4 CL2
(d) C(8,0).
6 Obtain the number of distinct permutations that can be formed CO2.5 CL2
from the letters of each word. 1. RADAR 2.MISSISSIPPI
7 Solve a n=5 an−1−6 an−2 for n ≥ 2 , a0=1 , a1 =0 CO2.6 CL2
8 Solve the recurrence relation a n=6 a −9 a if a0=1, a1=6
n−1 n−2
CO2.6 CL2
9 Solve the recurrence relation for a n=3 an−1 for n≥ 1 , a0=2 by using CO2.7 CL2
generating function.
10 Obtain the generating function of the sequence CO2.7 CL2
(i) 1,4,16,64,.....∞ (ii) 3,-3,3,-3......
11 Among the first 1000 positive integers: Determine the integers CO2.8 CL1
which are not divisible by 5 nor by 7, nor by 9.
12 A total of 1232 students have taken a course in Spanish, 879 have CO2.8 CL1
taken a course in French and 114 have taken a course in Russian.
Further, 103 have taken courses in both Spanish and French, 23
have taken courses in both Spanish and Russian and 14 have taken
courses in both French and Russian. If 2092 students have taken
at least one of the Spanish, French, Russian. How many students
have taken a course in all three languages?

PART C
1 CO2.1 CL2
mathematical induction
Prove
n by
2 n(n+1)(2n+ 1)
∑i = 6 (N/D 2018)
i=0

n
2 3n +1−1 CO2.1 CL2
(i)Prove by mathematical induction ∑ 3 =
r
(M/J 2016)
r=0 2
(ii) Prove that any positive integer n ≥ 2 is a prime or a product of
primes.(A/M 2019) CO2.2 CL 3

3 (i) If N pigeon holes are occupied by (kn+ 1¿ pigeons, where CO2.3 CL2
k is a positive integer.Prove that atleast one pigeon hole is
occupied by k+1 or more pigeons. Hence find the minimum
number of m integers to be selected from s= { 1, 2 , 3 ,… .9 }so
that the sum of two of the m integers are even.

(ii)A box contains 6 white balls and 5 red balls. Find the
number of ways 4 balls can be drawn from the box if CO2.4 CL3
a) They can be any colour.
b) Two must be white and two red.
c) They must all be the same colour. (N/D 2019)
4 (a) There are six men and five women in a room. Find the CO2.4 CL2
number of ways four persons can be drawn from the room if
(i) they can be male or female,
(ii) two must be men and two women,
(iii) they must all are of the same gender.(M/J 2016)

(b) How many permutations can be made out of the letters

of the word “BASIC”? How many of these CO2.5 CL2
(i)Begin with B?
(ii)End with C?
(iii)B and C occupy the end places?
(iv) Begin with B and End with C?
(N/D 2018)
5 (i) Solve by recurrence relation CO2.6 CL2
an=an-1 – 11an-2+6an – 3 with a0=2, a1=5, a2=15
(ii) Using recurrence relation, solve
s ( k ) =−3 s ( k−1 )−3 s ( k −2 )−s ( k−3 ) with initial
conditios s ( 0 )=0 , s ( 1 )=−2∧s ( 2 )=−1
6 Use generating function, CO2.7 CL2
solve the recurrence relation a n=7 a n−1 −6 an−2 , n ≥2given that
a 0=8∧a1=6(A/M 2017)
7 Solve the recurrence relation CO2.7 CL3
s(n)= s(n-1)+2 s(n-2); n>=2, s(0)=3; s(1)=1 by finding its
generating function.(N/D 2018)
 Find the number of integers between 1 and 250 CO2.
both inclusive that are not divisible by any of the 8
8 CL3

integers 2, 3, 5 and 7. (M/J 2016)

Find the number of integers between 1 and 100 CO2.
that are not divisible by any of the integers 2, 3, 5 8
9 CL3

or 7.(N/D 2018)

UNIT III GRAPHS

S.NO. QUESTION CO CL
level

1 Which of the following statements for a simple graph is correct? CO3.1 CL 1

a) Every path is a trail
b) Every trail is a path
c) Every trail is a path as well as every path is a trail
d) Path and trail have no relation

2 What is the number of unlabeled simple directed graph that can be made with CO3.1 CL 2
1 or 2 vertices?
a) 2
b) 4
c) 5
d) 9

3 Find the number of edges present in a complete graph having n vertices? CO3.1 CL 1
a) (n∗(n+1))/2
b) (n∗(n−1))/2 c) n
d) Information given is insufficient

4 Which of the following properties does a simple graph not hold? CO3.2 CL 1
a) Must be connected
b) Must be unweighted
c) Must have no loops or multiple edges
d) Must have no multiple edges
5 Find the maximum number of edges in a bipartite graph having 10 vertices? CO3.2 CL 2
a) 24
b) 21
c) 25
d) 16

6 On which of the following statements does the time complexity of checking if CO3.2 CL 1
an edge exists between two particular vertices is not, depends?
a) Depends on the number of edges
b) Depends on the number of vertices
c) Is independent of both the number of edges and vertices
d) It depends on both the number of edges and vertices

7 Which of the following is true? CO3.3 CL 2

a) A graph may contain no edges and many vertices
b) A graph may contain many edges and no vertices
c) A graph may contain no edges and no vertices
d) A graph may contain no vertices and many edges

8 The degree of any vertex of graph is .... ? CO3.3 CL 1

A a) The number of edges incident with vertex

B b) Number of vertices in a graph

c) Number of vertices adjacent to that vertex

D d) Number of edges in a graph

9 A graph with all vertices having equal degree is known as a __________ CO3.3 CL 1
a) Multi Graph
b) Regular Graph
c) Simple Graph
d) Complete Graph

10 What is the maximum number of edges present in a simple directed graph CO CL 2

with 7 vertices if there exist no cycles in the graph? 3.3
a) 21
b) 7
c) 6
d) 49
11 How many of the following statements are correct? CO3.3 CL 1
i) All cyclic graphs are complete graphs.
ii) All complete graphs are cyclic graphs.
iii) All paths are bipartite.
iv) All cyclic graphs are bipartite.
v) There are cyclic graphs which are complete.
a) 1
b) 2
c) 3
d) 4

12 Which of the following ways can be used to represent a graph? CO3.4 CL 1

a) Adjacency List and Adjacency Matrix
b) Incidence Matrix
c) Adjacency List, Adjacency Matrix as well as Incidence Matrix
d) No way to represent

13 The number of elements in the adjacency matrix of a graph having 7 vertices CO3.4 CL 1
is __________
a) 7
b) 14
c) 36
d) 49

14 The time complexity to calculate the number of edges in a graph whose CO3.4 CL 1
information in stored in form of an adjacency matrix is ____________
a) O(V)
b) O(E2)
c) O(E)
d) O(V2)

15 For the adjacency matrix of a directed graph the row sum is the _________ CO3.4 CL 1
degree and the column sum is the ________ degree.
a) in, out
b) out, in
c) in, total
d) total, out

16 What is the maximum number of possible non zero values in an adjacency CO3.4 CL 1
matrix of a simple graph with n vertices?
a) (n∗(n−1))/2 b ¿ (n∗(n+1))/2 c ¿ n∗(n−1)d ¿ n∗(n+1)
17 Which of these adjacency matrices represents a simple graph? CO3.4 CL 2
a) [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]
b) [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]
c) [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]
d) [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

18 The column sum in an incidence matrix for a simple graph is __________ CO3.4 CL 2
a) depends on number of edges
b) always greater than 2
c) equal to 2
d) equal to the number of edges

19 The column sum in an incidence matrix for a simple graph is __________ CO3.4 CL 2
a) depends on number of edges
b) always greater than 2
c) equal to 2
d) equal to the number of edges

20 What are the dimensions of an incidence matrix? CO3.4 CL 1

a) Number of edges ¿number of edges
b) Number of edges ¿number of vertices
c) Number of vertices ¿number of vertices
d) Number of edges ¿ (1⁄2 ¿ number of vertices)

21 Every isomorphic graph must have ……. Representation CO3.5 CL 2

a)path b)cycle c)tree d) Adjacency matrix

22 A cycle on n vertices is isomorphic to its complement. What is the value of n? CO3.5 CL 2

a) 5 b) 7 c) 12 d) 32

23 An isomorphism of graphs G and H is a bijection if the vetex sets of G and H CO3.5 CL 2

such that any two vertices u and v of G are adjacent in G iff ……

a¿ f ( u )=f ( u )2 + f ( v )2b¿ f (u)=f (u)+ f (v )

c) f ( u )=f ( u )2 −f (v )2d) f (u)∧f (v )are adjacent ∈H .

24 For a given graph G having v vertices and e edges which is connected and has CO3.6 CL 1
no cycles, which of the following statements is true?
a) v=e b ¿ v=e+1 c ¿ v +1=e d ¿ v=e−1
25 For which of the following combinations of the degrees of vertices would the CO3.6 CL 1
connected graph be eulerian?
a)1 , 2, 3 b ¿ 2 ,3 , 4 c ¿2 , 4 ,5 d ¿ 1 ,3 , 5

26 Number of vertices with odd degrees in a graph having a Eulerian walk is CO3.7 CL 1
________
a) 0 b) Can’t be predicted c) 2 d) either 0 or 2

27 A graph has an Euler circuit if CO3.7 CL 1

a) Every vertex has even degree.

b) It is connected and has an even number of vertices.

c) It is connected and has an even number of edges

d) It is connected and every vertex has even degree.

28 A graph without an Euler circuit but with an Euler path CO3.7 CL 1

a) must be connected and every vertex must have even degree.

b) must be connected and every vertex must have odd degree.

c) must be connected and have exactly one vertex of odd degree.

d) must be connected and have exactly two vertices of odd degree.

29 The problem of finding a path in a graph that visits every vertex exactly once CO3.8 CL 1
is called?
a) Hamiltonian path problem b) Hamiltonian cycle problem
c) Subset sum problem d) Turnpike reconstruction problem

30 In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be CO3.8 CL 1

______
a) 728 b ¿ 450 c ¿ 360 d ¿260
 PART B

1 Draw a diagram for the following graph CO 3.1 CL 1

G=(V,E), V= (v1, v2, v3, v4) ,E={ (v1, v2),(v4 , v1),(v3, v1),(v3, v4) }
2 How many edges are there in a graph with 10 vertices each of degree five? CO 3.1 CL 1
(M/J 2016)

3 Define pseudo graph and multi graph with example. CO3.1 CL 1

4 Draw directed and undirected graph with example. CO3.1 CL 1

5 Verify that the sum of the degree of all the vertices is even for the graph CO 3.2 CL 1

6 Draw the complete graph K5 with vertices A,B,C,D,E. Draw an complete sub CO3.3 CL 1
graphs of K5 with 4 vertices.

7 Construct the 4-regular graph on 6 vertices. CO3.3 CL 1

8 Find the adjacency matrix of K1,4.(N/D 2018) CO3.4 CL 1

9 Find the incidence matrix of the following graph CO3.4 CL 2

10 Draw the complete graph k5 and is it Euler graph? Justify your answer. CO3.7 CL 2

11 Find the Eulerian and Hamiltonian circuit of the following graph. CO3.8 CL 2

12 Give an example of a graph which is both Eulerian an Hamiltonian. CL 1

(N/D 2018)

PART C
1 (i) State and prove handshaking theorem CO3.1 CL 2

(ii)Verify the handshaking theorem for the graph

(N/D 2019)

2 (i) The maximum number of edges in a simple graph with n vertices is CO3.2 CL 2
n(n−1)
.
2
(ii) prove that the number of odd degree vertices in any graph is even.
(M/J 2016, N/D 2019)
3 Prove that the maximum number of edges in a simple disconnected graph CL 2
( n−k ) (n−k +1) CO3.3
G with n vertices and k components is . (N/D 2015)
2

4 Find the adjacency matrix of the following graph G. Hence find the CO3.4 CL 2
degree of each vertex.

5 State whether the following graphs are isomorphic or not. CO3.5 CL 2

6 Determine whether the graphs G and H are isomorphic? CO3.5 CL 2

7 Define isomorphism between two graphs. Are the simple graphs with the CO3.6 CL 3
following adjacency matrices isomorphic?
 | |
0 1 00 0 1
1 0 10 1 0
0 1 01 0 1
0 0 10 1 0
0 1 01 0 1
1 0 10 1 0

| |
0 1 00 0 1
1 0 10 0 1
0 1 01 1 0
0 0 10 1 0
0 0 11 0 1
1 1 00 1 0

(M/J 2016)
8 Determine whether the graphs given below are isomorphic CO3.6 CL 2
(N/D 2018)

9 Test the given graph is Euler graph or not. CO3.7 CL 2

(i) (ii)

10 Draw a graph for the following, CO3.8 CL 2

(i) Eulerian but not Hamiltonian
(ii) Hamiltonian but not Eulerian
(iii) Hamiltonian and Eulerian
(iv) Neither Hamiltonian nor Eulerian
11 Find Hamiltonian path and Hamiltonian cycles, if it exists in each of the CO3.8 CL 2
graph given below. Also identify which graph is Hamiltonian.
 UNIT IV – ALGEBRAIC STRUCTURES
S.N CO CL
QUESTIONS
o level Level
PART-A(1 marks)
1 The set of all real numbers under the usual multiplication operation is not a group since
a) multiplication is not a binary operation b)multiplicative is not associative CO4.1 CL1

The set of integers Z with the binary operation "*" is defined asa∗b=a+ b+1 for a,b ∈
c) identity element does not exist d) zero has no
2
Z, is a group. The identity element of this group is
CO4.1 CL2
a) 0 b) 1 c) -1 d) 12

3 The identity element for a set of natural numbers is

a) 0 b)2 3)1 4) 3 CO4.2 CL1

4 If (G, .) is a group such that (ab)- 1 = a-1b-1, ∀ a, b ∈ G, then G is a/an

a) commutative semi group b) abelian group c) non-abelian group d) None of these CO4.3 CL2
5 If (G, .) is a group such that a2 = e, ∀a ∈ G, then G is
a) Semi group b) abelian group c) Non abelian group d) none of the above CO4.3 CL2

6 If (G, .) is a group, such that (ab)2 = a2 b2 ∀ a, b ∈ G, then G is a/an

a) Commutative semi group b) abelian group c) non-abelian group d)none of these. CO4.3 CL2

7 Every cyclic group is

a)abelian b) monoid c)cyclic d)subgroup
CO4.3 CL1
8 The property a∗b=a is termed as
a)commutative b)identity c)inverse d)closure
CO4.3 CL1
A set satisfying the properties closure and associatively is known as
a) semi-group b )monoid c)group d)subgroup
CO4.3 CL1
9
10 A set satisfying the properties closure, associatively and identity is known as
a)semi-group b)monoid c)group d)subgroup
CO4.3 CL1
11
A set satisfying the properties closure, associatively, identity and inverse is known as
a)semi-group b)monoid c)group d)subgroup
CO4.3 CL1

12 The inverse of - i in the multiplicative group, {1 ,−1, i ,−i } is

a) 1 b) -1 c) i d) -i
CO4.4 CL2

13 Let G denoted the set of all n X n non-singular matrices with rational numbers as entries.
Then under multiplication G is a/an
a) Subgroup b) Finite abelian group
CO4.4 CL1
c) Infinite non abelian group d) infinite, abelian group
14 If a, b are positive integers, define a∗b=a where ab=a (modulo 7), with this *
operation, then inverse of 3 in group G (1, 2, 3, 4, 5, 6) is CO4.4 CL2
a) 3 b) 1 c) 5 d) 4

15 The intersection of two subgroups is CL1

a)a subgroup b)group c)normal subgroup d) not a subgroup CO4.4
16 An algebraic structure with two binary operations under addition and multiplication is
called a CO4.4 CL1
a) Kernel b)Ring c)Group d)Commutative group
17 The cubic roots of unity under the binary operation “.” is a
a) monoid b) abelian group c) normal subgroup d) group
CO4.4 CL1
18 A group of order 3 is
 UNIT V- LATTICES AND BOOLEAN ALGEBRA
S.NO. QUESTIONS CO CL
level
PART-A
1 A set ‘P’ together partially ordering relation is called a …… CO5.1 CL 1
a) Poset b) Equivalence relation c) Coset d) Lattice.
2 Hasse diagrams are drawn for CO5.1 CL 1
a) Partially ordered sets b) Lattices
c) Boolean algebra d) None of these.
3 A poset can have ………… than one maximal element and ……… than one minimal CO5.1 CL 1
element
a) More and less b) Less and more
c) More and more d) Less and less.
4 The relation is a partial order if it is ___________ CO5.1 CL 1
a) reflexive, antisymmetric and transitive b) reflexive,symmetric
c) asymmetric, transitive d) irreflexive and transitive
5 Power set of empty or Null set has exactly _________ subset. CO5.1 CL 1
a) one b) two c) zero d) three
6 Boolean algebra can be used _____ CO5.2 CL 1
a)For designing of the digital computers b) In building logic sysbols c)circuit theory
d)building algebraic functions
7 The cardinality of the Power set of the set {1, 5, 6} is______________. CO5.2 CL 2
a) 5 b) 6 c) 8 d) 10
8 A__________ is a Boolean variable CO5.2 CL 1
a)literal b) string c)keyword d)identifier
10 Find the simplified expression A' BC '+AC '. CO5.2 CL 2

a)B b)A+C c)(A+B)C ' d) B' C

11 The greatest and least element of a lattice is CO5.3 CL 1

a) x and y b) 0 and 1 c)1 and -1 d) a and b.
12 A complemented distributive lattice is a CO5.3 CL 2
a) Boolean algebra b) Modular lattice
c) Bounded lattice d) Poset
13 ………… is a poset in which for every pair element there exist a GLB and LUB CO5.3 CL 1
a) Modular lattice b) Complemented lattice
c) Boolean algebra d) Lattice.
14 Every finite lattice is …… CO5.3 CL 2
a) a chain b) Poset c) Modular d) Bounded
15 Any chain is a ………………… lattice CO5.4 CL 1
a) Commutative b) Associative
c) Distributive d) Complemented
16 Every distributive lattice is …………… but not conversely CO5.4 CL 1
a) Chain b) Modular c) Associative d) Linear
17 The ___________ of all the variables in direct or complemented from is a maxterm. CO5.4 CL 1
a) Addition b) Product c) Moduler d) Subtraction
18 A one-one homomorphism in a lattice is called CO5.5 CL 1
a) Isomorphism b) Surjective
c) Injective d) Lattice isomorphism
19 What is the simplification value of MN(M+ N ' ¿+M(N+ N ' ¿? CO5.5 CL 2
a)M b)MN+ M ' N ' c)(1+M) d)M+ N '
20 ______ and _______ are the two binary operations defined for lattices. CO5.5 CL 1
a) Join, meet b) Addition, subtraction
c) Union, intersection d) Multiplication, modulo division
21 The Boolean algebra deals with variables that can have CO5.5 CL 1
a)Two discrete values b) Three discrete values
c) Four discrete values d) Five discrete values
22 The Boolean algebra represents a ____ distributive lattice, each element of ‘B’ has a CO5.6 CL 1
unique complement.
a) Complemented b) Supplemented
c) Adjacent d) None of these
23 Boolean algebra can be used ____________ CO5.6 CL 1
a) For designing of the digital computers b) In building logic symbols
c) Circuit theory d) Building algebraic functions
24 A _____________ is a product of all variables taken either in their direct or CO5.7 CL 1
complemented form.
a) Minterm b) Maxterm
c) Variables d) None of the above
25 The elements 0 and 1 in a Boolean algebra CO5.7 CL 2
a) Unique b) Minimal c) Complemented d) Maximal

26 A Poset in which every pair of elements has both a least upper bound and a greatest CO5.8 CL 1
lower bound is termed as _______
a) sublattice b) lattice c) trail d) walk
27 If every two elements of a poset are comparable then the poset is called ________ CO5.8 CL 1
a) sub ordered poset b) totally ordered poset
c) sub lattice d) semigroup
28 Every poset that is a complete semilattice must always be a _______ CO5.8 CL 1
a) sublattice b) complete lattice c) free lattice d) partial lattice
29 Which of the following is/are the universal logic gates? CO5.9 CL 1
a) ORand NOR b)AND c)NAND and NOR d)NOT
30 The ________ of all the variables in direct of complemented from is a maxterm. CO5.9 CL 1
a)addition b)product c)moduler d)subtraction

PART B

1 Let A =a,b,cand (A) be its power set. Draw a Hasse diagram of ((A), CO 5.1 CL 3
 (A.U.N/D-2008)
2 Draw the Hasse diagram of the set of partitions of 5. CO 5.2 CL 2
3 State Prove any four properties of Lattice. (A.U.M/J2009) CO5.3 CL 2
4 Let S={a,b,c}.Draw the diagram of (P(S),⊆ ¿ CO5.3 CL 3
(A.U.A/M 2003,2005)

5 State and Prove distribution inequalities in lattices. CO5.4 CL 3

(A.U.N/D2011)
' '
6 In any Boolean algebra. Show that a a b + a b =0. Iff a=b CO5.4 CL 2
(A.U.N/D-2014)

7 State and Prove CO5.5 CL 2

(i)Every distributive lattice is modular. (A.U.N/D2004)
(ii)Let (L,*,⨁ ) be a distribution lattice.
For any a,b,c∈ L (a*b=a*c)∧(a⨁ b=a⨁ c ¿ ⟹ b=c (A.U.N/D 2004)
8 In Boolean algebra, Prove that (a ∧ b ¿' = a ' ⋁ b ' (A.U.N/D-2014) CO5.7 CL 3
9 Let (L,∧ , ⋁ ) be a distributive lattice and a,b,c ∈ L. CO5.8 CL 3
If a∧b=a∧c and a ⋁ b =a ⋁ c, then b=c (A.U.N/D-2006)
10 In a distributive lattice, show that CO5.8 CL 3
(a*b)⨁ (b*c) ⨁ (c*a)= (a⨁ b ¿*(b⨁ c)*(c⨁ a) A.U.A/M-2005
11 In any Boolean algebra, show that a=b if and only if ab +a b = 0 CO5.9 CL 3
(A.U.N/D-2002)
' '
12 In any Boolean algebra, show that a=0⇔ ab +a b=b CO5.9 CL 3
(A.U.N/D2002)

PART C

1 (i)Which elements of the poset are maximal, and which are minimal. CO5.1 CL 3
(ii)Draw the Hasse diagram of the set under the product partial order.
2 Let L be the complemented, distributed lattice. For the CO5.3 CL 3
a, b∈ L the following are equivalent.
(i) a≤ b (ii) a*b '=0 (iii)a ' b =1
(iv) b ' ≤ a' where ‘1’ denotes corresponding complement.
(A.U.N/D 2004-M/J-2013)
3 Let a,b,c be any elements in a Boolean algebra B. Prove that CO5.3 CL 3
(i)a*a=a (ii)a+a=a (iii)a+1=1 (iv)a*0=0 (v)a+(a*b)=a (vi)a*(a+b)=a
4 Show that the operation of meet are join on a lattice are associative, CO5.4 CL 3
A.U.N/D-2012
5 If (L,∧ , ⋁ ) is a complemented distributive lattice, then the De Morgan’s law are valid. CO5.5 CL 3
A.U.M/J 2013
6 (i)Prove that every chain is a distributive lattice. CO5.5 CL 3
(ii)State and prove Isotonocity property in a lattice.
7 State and prove the necessary and sufficient condition for a lattice to be modular. CO5.6 CL 3
A.U.N/D2005
8 In a Boolean lattice, prove that the De- Morgan’s laws. A.UM/J-2006 CO5.7 CL 3

9 Show that the direct product of any two distributive lattices is a distributive lattice. CO5.8 CL 3
A.U.M/J-2002
10 In any Boolean algebra, Show that (a+ b ') (b+c ' ) (c+a ')=(a ' +b ¿ (b ' +c ¿( c' +a) CO5.9 CL 3
A.U.N/D-2013,M/J-2014