DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Choice Based Credit System (CBCS)

SEMESTER – III
Discrete Mathematical Structures: 21CS37

Question Bank
Module – I

1. Cars of a particular manufactures come in 4 models, 12 colours, 3 engine sizes and 2

transmission types
a. How many distinct cars can be manufactured?
b. Out of these how many have the same colour?
2. Four different math books, five different computer science books and two different control
theory books are to be arranged in a shelf. How many arrangements are possible if : the
books in each particular subject must all be together only the mathematics books must be
together?
3. How many different strings (sequences) of length 4 can be formed using the letters of the
word FLOWER?
4. Find the number of permutations of (all) the letters of the word SUCCESS.
5. Find number of positive integers formed using the digits 3, 4,4,5,5,6,7 , exceeding
5,000,000?
6. What is the Cartesian product of A = {1, 2} and B = {a, b}?
7. Find the number of permutations of letters of the word MASSASAUGA. How many of these
all four A’s are together? How many of them begin with S?
8. A bit is either 0 or 1. A byte is a sequence of 8 bits. Find
i. No. of bytes
ii. No. of bytes that begin with 11 and end with 11
9. Find the coefficient of x5y2 in the expression of (2x-3y)7
10. Find the coefficient of w3x2yz2 in the expression of (2w-x+3y-2z)8
11. How many 5-digit telephone numbers can be constructed using the digits 0 to 9, if each
number starts with 67 and no digit appears more than once?
12. Let M, P and C be the sets of students taking Mathematics courses, Physics courses and
Computer Science courses respectively in a university. Assume |M| = 300, |P | = 350, |C| =
450, |M ∩ P | = 100, |M ∩ C| = 150, |P ∩ C| = 75, |M ∩ P ∩ C| = 10. How many students are
taking exactly one of those courses? Solve with the help of Venn diagram.
13. Cars of a particular company come in 4 models, 12 colours, 3 engine sizes, and 2
transmission types. Identify how many distinct cars of this company can be manufactured
and of these, how many have the same colour.
14. There are eight letters to eight different people to be placed in eight different addressed
envelopes. Find the number of ways of doing this so that atleast one letter gets to right
person.
15. Identify how many permutations of 1, 2, 3, 4, 5, 6, 7, 8 are not dearrangements?
16. How many arrangements are there for all letters in the word “sociological? In how many
of these arrangements (i) A and G are adjacent? (ii) All the vowels are adjacent?
17. A woman has 11 close relatives, and she wishes to invite 5 of them to dinner. In how many
ways can she invite them in the following-situations
i. There is no restriction on the choice.
ii. Two particular persons will not attend separately.
iii. Two particular persons will not attend together.
18. In how many ways can 10 identical pencils be distributed among 5 children's in the
following cases ?
19. There are no restrictions
20. Each child gets at least one pencil
21. The youngest child gets at least two pencils.
22. Find the coefficient of
23. 𝑥 9 𝑦 3 in the expansion of (2𝑥 − 3𝑦) 12
2 15
24. 𝑥 0 in the expansion of (3𝑥 2 − 𝑥)
25. Determine the coefficient of
i. 𝑥 𝑦 𝑧2 in the expansion of (2𝑥 − 𝑦 − 𝑧) 4
ii. 𝑥11 𝑦4 in the expansion of (2𝑥 3 − 3𝑥𝑦 2 + 𝑧2)6
iii. 𝑎2 𝑏 3 𝑐 2 𝑑5 in the expansion of (𝑎 + 2𝑏 − 3𝑐 + 2𝑑 + 5)16
26. A paper has two parts a and b each with 4 questions. how many ways can a student answer
5 by selecting at least 2 from each part.
27. In how many ways can we distribute 7 apples and 6 oranges among 4 children so that each
child gets at least 1 apple.
28. Out of 30 students in a hostel, 15 study History, 8 study Economics, and 6 study Geography.
It is known that 3 students study all these subjects. Show that 7 or more students study
none of these subjects.
29. In how many ways can the 26 letters of the English alphabet be permuted so that none of
the patterns CAR, DOG, PUN or BYTE occurs?
30. Find the number of permutation of the English letters which contain (i) exactly two (ii)
atleast two (iii) exactly three (iv) at least three of the pattern CAR, DOG, PUN and BYTE
31. Find the number of permutations of the letters a, b, c …..x, y, z in which none of the pattern
spin, game path or net occurs.
32. Out of 30 students in a hostel, 15 study History, 8 study Economics, and 6 study Geography.
It is known that 3 students study all these subjects. Show that 7 or more students study
none of these subjects.
33. Define the following:
i. Power set ii. Multiset iii. Proper subset iv. Subset
 Module – II
1. Prove the following using laws of logic
i. [(p → (q → r)] ⇔ [(p ˄¬ r) → ¬ q)]
ii. (𝑝 ∨ 𝑞) ∧ [∼ {(∼ 𝑝) ∧ 𝑞}] ⇔ 𝑝
iii. ∼ [∼ {(𝑝 ∨ 𝑞) ∧ 𝑟} ∨ ∼ 𝑞] ⇔ 𝑞 ∧ 𝑟
2. Define proposition, tautology and contradiction.
3. Determine whether the following statement is tautology or not using truth table
{ (p ∨ q) → r} ↔ {¬r → ¬ (p ∨ q) }
4. Negate and simplify ⅰ). ∃ x, [p(x) ⅴ q(x)] (ⅱ). Ɐ x, [p(x) ˄ ¬ q(x)]
5. Use Truth tables to verify that [¬p∧(¬q∧r)]∨[(q∧r)∨(p∧r)]⇔r
6. Prove that [(∼p∨q)∧(p∧(p∧q))]⇔p∧q Hence deduce that [(∼p∧q)∨(p∨(p∨q))]⇔p ∨q
7. Prove the the following logical equivalences without using truth table.
i) p→(q→r)⇔(p∧q)→r ii) [(∼p∨ ∼q)→(p∧q∧r)]
8. Prove that the following statements is valid using rules of inference
𝐼𝑓 𝑟𝑜𝑐𝑘𝑒𝑦 𝑔𝑜𝑒𝑠 𝑜𝑢𝑡 𝑤𝑖𝑡ℎ 𝑓𝑟𝑖𝑒𝑛𝑑𝑠, ℎ𝑒 𝑤𝑖𝑙𝑙 𝑛𝑜𝑡 𝑠𝑡𝑢𝑑𝑦
𝐼𝑓 𝑟𝑜𝑐𝑘𝑒𝑦 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 𝑠𝑡𝑢𝑑𝑦, ℎ𝑖𝑠 𝑓𝑎𝑡ℎ𝑒𝑟 𝑏𝑒𝑐𝑜𝑚𝑒𝑠 𝑎𝑛𝑔𝑟𝑦
𝐻𝑖𝑠 𝑓𝑎𝑡ℎ𝑒𝑟 𝑛𝑜𝑡 𝑎𝑛𝑔𝑟𝑦
∴ 𝑅𝑜𝑐𝑘𝑒𝑦 ℎ𝑎𝑠 𝑛𝑜𝑡 𝑔𝑜𝑛𝑒 𝑜𝑢𝑡 𝑤𝑖𝑡ℎ 𝑓𝑟𝑖𝑒𝑛𝑑𝑠
9. Show the number of positive integers ‘n’ such that 1 ≤ n ≤ 100 and ‘n’ is not divisible by 2,
3, or 5.
10. Explain the Set Operations and the Laws of Set Theory with an example?
11. Apply rule of inference to the below propositions and test the validity of the following
argument:
I will become famous, or I will not become a musician
I will become a musician
⸫ I will become famous
12. Define Converse, Inverse and Contrapositive of a conditional. Find converse, inverse and
contrapositive of Ɐx, (x > 3) → (x2 >9), where universal set is R.
13. For each of the following, determine whether the following arguments are valid or not.
𝐼𝑓 𝑛𝑜 𝐸𝑛𝑔𝑔. 𝑠𝑡𝑢𝑑𝑒𝑛𝑡 𝑜𝑓 𝐼 𝑜𝑟 𝐼𝐼 𝑠𝑒𝑚𝑒𝑠𝑡𝑒𝑟 𝑠𝑡𝑢𝑑𝑖𝑒𝑠 𝑙𝑜𝑔𝑖𝑐
𝐴𝑛𝑖𝑙 𝑖𝑠 𝑎𝑛 𝐸𝑛𝑔𝑔. 𝑠𝑡𝑢𝑑𝑒𝑛𝑡 𝑤ℎ𝑜 𝑠𝑡𝑢𝑑𝑖𝑒𝑠 𝑙𝑜𝑔𝑖𝑐
∴ 𝐴𝑛𝑖𝑙 𝑖𝑠 𝑛𝑜𝑡 𝑖𝑛 𝐼𝐼 𝑠𝑒𝑚𝑒𝑠𝑡𝑒𝑟
14. For each of the following, determine whether the following argument is valid or not.
𝑖𝑓 𝑎 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒 ℎ𝑎𝑠 𝑡𝑤𝑜 𝑒𝑞𝑢𝑎𝑙 𝑠𝑖𝑑𝑒𝑠, 𝑡ℎ𝑒𝑛 𝑖𝑡 𝑖𝑠 𝑖𝑠𝑜𝑐𝑒𝑙𝑒𝑠
𝑖𝑓 𝑎 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒 𝑖𝑠 𝑖𝑠𝑐𝑜𝑐𝑒𝑙𝑒𝑠, 𝑡ℎ𝑒𝑛 𝑖𝑡 ℎ𝑎𝑠 𝑡𝑤𝑜 𝑒𝑞𝑢𝑎𝑙 𝑎𝑛𝑔𝑙𝑒𝑠
𝐴 𝑐𝑒𝑟𝑡𝑎𝑖𝑛 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒 𝐴𝐵𝐶 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 ℎ𝑎𝑣𝑒 𝑡𝑤𝑜 𝑒𝑞𝑢𝑎𝑙 𝑎𝑛𝑔𝑙𝑒𝑠
∴ 𝑇ℎ𝑒 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒 𝐴𝐵𝐶 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 ℎ𝑎𝑣𝑒 𝑡𝑤𝑜 𝑒𝑞𝑢𝑎𝑙 𝑠𝑖𝑑𝑒𝑠
15. Let p(x):x^2-7x+10=0, q(x): x^2-2x-3=0, r(x):x<0. Determine the truth or falsity of the
following statements when the universe contains only integers 2 and 5. If a statement is
false provide counter example or explanation.
i. ∀x, p(x)→ ∼r(x) ii. ∀x, q(x)→ r(x)
 iii. ∃x, q(x)→ r(x) iv. ∃x, p(x)→ r(x)
16. Consider the following open statements with the set of all real numbers as the universe
p(x):x≥0 q(x): x^2≥0 r(x): x^2-3x-4=0 s(x): x^3-3>0
Determine the truth value of the following statements
∃x, p(x)∧q(x) ii. ∀x, q(x) → s(x)
iii. ∀x, p(x)→q(x) iv. ∃x, p(x)∧r(x)
17. Negate and simplify each of the following statement
𝑖. ∀𝑥, [ 𝑝(𝑥) → 𝑞(𝑥)] 𝑖𝑖. ∃𝑥, [ 𝑝(𝑥) ∨ 𝑞(𝑥)]
𝑖𝑖𝑖. ∃𝑥, [{p(x) ∨ q(x)} → r(x)]
18. Write down the negation of each of the following statements
i. If 𝑘, 𝑚, 𝑛 are integers where (𝑘 − 𝑚) and (𝑚 − 𝑛) are odd, then (𝑘 − 𝑛) is
even.
ii. If 𝑥 is a real number where 𝑥 2 ≥ 16, then 𝑥 < −4 𝑜𝑟 𝑥 > 4.
19. Solve the following propositions using laws of logic
𝑖. (𝑝 ∨ 𝑞) ∧ [∼ {(∼ 𝑝) ∧ 𝑞}] ⇔ 𝑝 ii. ∼ [∼ {(𝑝 ∨ 𝑞) ∧ 𝑟} ∨ ∼ 𝑞] ⇔ 𝑞 ∧ 𝑟
20. Test whether the following statements are valid
If I study, then I do not fail in the examination
If I do not watch TV in the evenings, I wil study
I failed in the examination

∴ I must have watched TV in the evenings

21. Show that R∨S follows logically from the premise

C∨D, (C∨D)→ ∼H, ∼H→(A∧ ∼B) and(A∧ ∼B) → R∨ S
22. Write down the negation of each of the following statements
If 𝑘, 𝑚, 𝑛 are integers where (𝑘 − 𝑚) and (𝑚 − 𝑛) are odd, then (𝑘 − 𝑛) is even.
If 𝑥 is a real number where 𝑥 2 ≥ 16, then 𝑥 < −4 𝑜𝑟 𝑥 > 4.
23. Let p(x): x ≥ 0 q(x): x2 ≥ 0 and r(x): x2 – 3x – 4 = 0, then for the universe completing of all
real numbers, find the truth value of
(i) ∃x {p(x) ˄ q(x)} (ii) Ɐx {p(x) → q(x)} (iii) ∃x {ϕ(x) ˄ r(x)}
24. Show the validity of the following argument:
∀𝑥, [𝑝(𝑥) →{𝑞(𝑥) ∧ 𝑟(𝑥)}]
∀𝑥, [𝑝(𝑥) ∧ 𝑠(𝑥)]
i. ∴∀𝑥, [𝑟(𝑥) ∧ 𝑠(𝑥)]

ii. Ɐx, p(x) ˅ q(x)

∃x, ¬p(x)
Ɐx, ¬q(x)˅ r(x)
Ɐx, s(x) → ¬r(x)
∴ ∃x, ¬s(x)
25. Give a proof of contradiction for the following statement: For every integer 𝑛, if 𝑛2 is odd,
then 𝑛 is odd.
26. Provide direct, indirect and proof by contradiction for the following statement: If 𝑛 is an
odd integer, then 𝑛 + 9 is an even integer.
 Module- 3
1. Determine the nature of the following relation
i. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}.
ii. Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = {3, 5, 6}
iii. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3}
2. Determine the partitions of the set {3, 4, 5, 6, 7}.
3. Explain types of function with example.
4. Explain the principle of mathematical induction principle?
5. Explain the domain of a function, range of a function?
6. Explain pigeon hole principle?
7. Let A={1,2,3,4,5,6,7,8,9,10,11}, then relation R on A defined by (x,y) є R only if x-y is a
multiple of 5. Verify that R is an equivalence relation.
8. Let N be the set of all natural numbers. On NXN the relation is defined by (a, b) R (c, d) if a+d
= b+c. Show that R is an equivalence relation.
9. Draw the Hasse diagram representing the positive divisors of 36.
10. Let A= {1,2,3,4,6} and R be a relation on A defined by xRy if and only if x divides y. Determine
the following:
i. R as ordered pairs
ii. Digraph
iii. In-degree and out degree of all the vertices
iv. Matrix of R.
11. Let A={1,2,3,4,5,6,7,8,9,10,11,12}, then relation R on A defined by (x,y) є R only if x-y is a
multiple of 5. Verify that R is an equivalence relation.
12. Let A = {1,2,3,4} and R be the relation on A defined by xRy if and only if y=2x.
i. Analyse R as a set of ordered pairs and draw the diagraph of R.
ii. Write a matrix and determine the in-degrees and outdegrees of the vertices
of the graph.
13. Let A={1,2,3,4} and R={(1,1),(1,2)(2,2)(2,4)(1,3)(3,3)(3,4)(1,4)(4,4)}. Check that R is a
partial order on A
14. Consider the Hasse diagram of a poset (A, R) given below:
B={a,b,c}, find (if they exist)
i. All upper bounds of B
ii. All lower bounds of B
iii. The least upper bound of B
iv. The greatest lower bound of B
15. Let f,g,h: R-> R where f(x)=x2, g(x)=x+5 and h(x)=√𝑥 2 + 2 . Show that (ℎ 𝑜 𝑔)𝑜 𝑓 =
ℎ 𝑜 (𝑔 𝑜 𝑓)
16. Define pigeonhole principle and mention some of the applications. By applying pigeonhole
principle solve the following:
i. Find the minimum number of students in a class such that three of them are born in the
 same month?
ii. A bag contains beads of two colours: black and white. What is the smallest number of
beads which must be drawn from the bag, without looking so that among these beads,
two are of the same colour?
17. Assume that R be a relation on the set A= {1, 2, 3 ,4} and defined by xRy if and only if “x
divides y”, written x|y.
a. Write drown R as a set of ordered pairs
b. Draw the diagraph of R
c. Determine the in-degrees and out-degree of the vertices in the digraph &Draw a
matrix the relation
18. Assume that R be a relation on the set A= {1,2,3,4} defined by xRy if and only if x divides y.
Prove that (A, R) is a posset. Draw its Hasse diagram.
19. Infer the concept of pigeonhole principle, if 5colours are used to paint 26 doors, pro that at
least 6 doors will have the same colour.
20. Simplify f: AB and g: B C are invertible functions, then g o f: AC is an invertible function and
(g o f)-1 = f -1o g-1
21. For A = {a,b,c,d,e}, the Hasse diagram for the poset (A,R) is as shown below construct the
diagraph for R.

22. Let A and B be finite sets. If there are 2187 functions from A to B and |B| =3. Determine |A|?

i.

i. All upper bounds of B

ii. All lower bounds of B
iii. The least upper bound of B
iv. The greatest lower bound of B Where B={c,d,e}.
23. If f: A → B and g: B → C are invertible functions, then prove that g ◦ f is also invertible and
(g ◦ f)−1 = f −1 ◦ g −1 .
24. Find f(0), f(−1), 𝑓 −1 (0), 𝑓 −1 (1), 𝑓 −1 [−5, 5] for the function 𝑓: 𝑅 → 𝑅 defined by
3𝑥 − 5 𝑓𝑜𝑟 𝑥>0
{
−3𝑥 + 1 𝑓𝑜𝑟 𝑥≤0
25. Explain any two types of function and find (𝑔 ◦ 𝑓), 𝑓 2 𝑎𝑛𝑑 𝑔2 for the functions 𝑓 and 𝑔
defined by 𝑓(𝑥) = 𝑥 3 and 𝑔(𝑥) = 𝑥 2 + 1 ∀𝑥 ∈ 𝑅.
26. Let 𝐴 = {1, 2, 3, 6, 9, 12, 18} and 𝑅 be the partially ordering on 𝐴 defined by
 𝑥𝑅𝑦 if and only if 𝑥|𝑦. Draw the Hasse diagram for R.
27. Consider shirts numbered consecutively from 1 to 20 are worn by 20 students of a class.
When any 3 of these students are chosen to be a debating team from the class, the sum of
their shirt numbers is used as the code number of the team. Show that if any 8 of the 20 are
selected, then from these 8 we may form atleast 2 different teams having the same code
number.
28. If f: A → B and g: B → C are invertible functions, then prove that g ◦ f is also invertible and
(g ◦ f)−1 = f −1 ◦ g −1 .
29. Consider the functions f and g defined by f(x)=x3 and g(x)=x2+1 ∀x∈R, Find (g◦f),(f◦g),
f2 and g2.
30. Let f, g, h be functions from Z × Z defined by f(x) = x – 1, g(x) = 3x, and
0 if x is even
h(x) = { }.
1 if x is odd

Determine [f ◦ (g ◦ h)]x and [(f ◦ g) ◦ h]x and verify that [f ◦ (g ◦ h)] = [(f ◦ g) ◦ h]

31. Let A= {1,2,3,4,5}, Define a relation R on AxA by (x1, y1) R (x2,y2) if and only if
x1+y1=x2+y2.
i. Verify that R is an equivalence relation on AxA.
ii. Determine the equivalence classes for [(1,3)], [(2,4)] and [(1,1)].
iii. Determine the partition of AxA induced by R.

Module – IV
1. Construct rook polynomial for 3X3 board .
2. Prove by Mathematical Induction for every positive integer n, 5 divides 𝑛5-𝑛
3. Solve the recurrence relation 𝑎𝑛 − 3𝑎𝑛−1 = 5 × 3𝑛 for 𝑛 ≥ 1 given that 𝑎0 = 2.
4. Solve the recurrence relation a_n+an-1-6an-2=0 ∀n≥2 given a0 = -1, a1=8
5. Prove by mathematical induction that, for all positive integers n ≥ 1,
6. In how many ways can the 26letters of the English alphabet be permuted so that none of
the pattern’s CAR, DOG, PUN, or BYTE occurs?
7. Solve the recurrence relation an-6an-1+9an-2=0 for n ≥ 2, given that a0=5, a1=12.
8. Establish the following by Mathematical Induction = 2 + (n-1) 2n+1
9. An apple, a banana, a mango, and an orange are to be distributed to four boys B1, B2, B3
and B4. The boys B1 and B2 do not wish to have apple, the boy b3 does not want banana
or mango and B4 refuses orange. In how many ways the distribution can be made so that
no boy is displeased?
10. Prove by Mathematical Induction that 6n+2 + 72n+1 is divisible by 43 for each positive
integer n.
11. The number of virus affected files in a system is 1000 (to start with) and this increases
250% every 2 hours. Use a recurrence relation to identify the number of virus affected
files in the system after one day.
12. Prove by Mathematical Induction that, ∀𝑛 ≥ 1,
1
1 + 2 + 3+. . . . . + 𝑛 = 2 𝑛(𝑛 + 1)
 13. Prove by Mathematical Induction that, ∀𝑛 ≥ 1,
𝑛(𝑛+1)(2𝑛+7)
1.3 + 2.4 + 3.5+. . . . . + 𝑛(𝑛 + 2) = 6

14. Prove by Mathematical Induction that, ∀𝑛 ≥ 1,

𝑛(𝑛+1)(2𝑛+1)
12 + 22 + 32 +. . . . . + 𝑛2 = 6

15. Determine the rook’s polynomial for the following board

1 2 3
4 5
16. Define Recursive definition? Obtain the recursive definition for the sequence 𝑎𝑛 in each of
the following cases i) 𝑎𝑛 = 6𝑛 𝑖𝑖)𝑎𝑛 = 𝑛(𝑛 + 3)
17. Prove by mathematical induction that, for any positive integer 𝑛, the number
11𝑛+2 + 122𝑛+1 is divisible by 133.
18. Find the Rook’s Polynomial for the 3× 3 board using the expansion formula.
19. The Ackerman’s numbers are defined recursively for 𝑚, 𝑛 ∈ 𝑁 as follows :
𝐴0, 𝑛 = 𝑛 + 1 for 𝑛 ≥ 0
𝐴𝑚, 0 = 𝐴𝑚−1, 1 for 𝑚 > 0
𝐴𝑚, 𝑛 = 𝐴𝑚−1, 𝑝 where 𝑝 = 𝐴𝑚, 𝑛−1 for 𝑚, 𝑛 > 0
Prove that 𝐴1, 𝑛 = 𝑛 + 2 ∀𝑛 ∈ 𝑁
20. Obtain the recursive definition for the sequence 𝑎𝑛 in each of the following cases
i) 𝑎𝑛 = 6𝑛 𝑖𝑖)𝑎𝑛 = 𝑛(𝑛 + 3) (𝑖𝑖𝑖) 𝑎𝑛 = 2 − (−1)𝑛
𝑖𝑣)𝑎𝑛 = (𝑛 + 1)
21. Find the Rook’s Polynomial for the boards shown below

22. Solve the recurrence relation 4𝑎𝑛 + 2𝑎𝑛−1 + 𝑎𝑛−2 = 0

23. A sequence {𝑎𝑛 } is defined recursively by 𝑎1 = 4, 𝑎𝑛 = 𝑎𝑛−1 + 𝑛 ∀𝑛 ≥ 2. Find 𝑎𝑛 in
explicit form
24. Find an explicit definition of the sequence defined recursively by 𝑎1 = 7, 𝑎𝑛 = 2𝑎𝑛−1 + 1
for 𝑛 ≥ 2.
Module – V
1. Define isomorphic graph with example.
2. A Poset in which every pair of elements has both a least upper bound and a greatest lower
bound is termed as lattice
3. A bridge cannot be a part of
i. a simple cycle
 ii. a tree
iii. a clique with size ≥ 3 whose every edge is a bridge
iv. a graph which contains cycles
4. Hasse diagrams are first made by
i. A.R. Hasse
ii. Helmut Hasse
iii. Dennis Hasse
iv. T.P. Hasse
5. Show that there is no graph with edges and vertices in the following case: The degree of a
vertex is either 3 or 4.
6. Infer the order of the graph in the following case: has edges with vertices of degree and all
other vertices of degree.
7. Prove that the number of vertices of odd degree must be even for the graph G = (V,E).
8. Show that a tree with two or more vertices contains at least two leaves (pendant vertices).
9. Develop an optimal prefix code for the symbols a,o,q,u,y,z that occur with
frequencies(weights) 20,28,4,17,12,7 respectively.
10. Determine the order |V| of the graph G = (V, E) in the following cases
(i) G is a cubic graph with 9 edges
(ii) G is regular graph with 15 edges
(iii) G has 10 edges with 2 vertices of degree 4 and all other vertices of degree 3.
11. Prove that there is no graph with 28 edges and 12 vertices in the following case:
i. The degree of a vertex is either 3 or 4.
ii. The degree of vertex is either 3 or 6.
12. Illustrate the following graph and tree concepts with examples
(i) Bipartite graph (ii) Binary rooted tree
(iii) Degree of a vertex of a graph (iv) Spanning subgraph
13. Apply the euler circuit to solve the konigsberg bridge problem.
14. Develop an optimal prefix code for the symbols a, o, q, u y, z that occur with
frequencies(weights) 28, 20, 4, 17, 12, 7 respectively.
15. Determine an optimal prefix code for the message ROAD IS GOOD
16. Determine an optimal prefix code for the message ENGINEERING
17. Check whether the graphs are isomorphic or not
18. Construct a graph for the following types and illustrate with an example and justify how these
graphs are different from each other. a. Simple Graphs b. complete Graphs c. Bipartite Graph
19. Show that the two graphs are Isomorphic

20. Construct an optimal prefix code for the symbols A, B, C, D, E, F, G, H, I, J that occurs with
frequencies 78, 16, 30, 35, 125, 31, 20, 50, 80, 3 respectively.
21. Prove that a tree with ‘n’ vertices has n-1 edges
22. Obtain the optimal prefix code for the message “ENGINEERING”. Indicate the code
23. Apply the concept of trees and prove that a graph is connected if and only if it has a spanning
tree.
24. Apply merge sort to the list -9, 6, 5, -3, 4, 2, -7, 6, -5, 10, -11, 0, 1
25. The computer laboratory of a college has 10 computers that are to be connected to a wall
socket that has 2 outlets. Connections are made by using extension cords that have 2 outlets
each. Identify the least number of cords needed to get these computers setup for use.
26. For a graph with n vertices and m edges, if δ is the minimum and ∆ is the maximum of the
2𝑚
degrees of vertices, show that 𝛿 ≤ 𝑛 ≤ ∆
27. Define spanning graph, induced graph , sub graph with examples
28. Prove the following for a graph G = (V,E)
(i) ∑v∈V deg(v) = 2|E |
(ii)The number of odd vertices must be even
29. A class room contains 25 microcomputers that must be connected to a wall socket that has 4
outlets. Connections are made by using extension cords that have 4 outlets each. Find the
least number of cords needed to get this computer set up for the class.
30. Construct an optimal prefix code for the symbols a, b, c, . . i, j that occur with frequencies 78,
16, 30, 35, 125, 31, 20, 50, 80, 3.