Gandhinagar Institute of Technology

Mathematics & Humanities Department

Discrete Mathematics (3140708)
SET THEORY
1. Let 𝑈 = {1,2,3,4,5,6}, 𝐴 = {1,2,3,4}, 𝐵 = {4,5,6}, 𝐶 = {2,4,6} . Find the following sets.
(a) 𝐴′ (b) 𝐵 ′ (c) (𝐴 ∪ 𝐵)′ (d) 𝐴 − 𝐵 (e) (𝐴 ∪ 𝐵) − 𝐶 (f) 𝐴 ⊕ 𝐵.
2. Define power set. Determine power set 𝑃(𝐴) of the set 𝐴 = {1,2,3,4}. How many elements are in
𝑃(𝐴) ?
3. Among 100 students, 32 study mathematics, 20 study physics, 65 study biology, 15 study mathematics
and biology, 7 study mathematics and physics, 10 study physics and biology and 30 do not study any
of the three subjects.
(a) Find the number of students studying all three subjects.
(b) Find the number of students studying exactly one of the three subjects.
4. Prove that 𝐴 ∩ (𝐵 ∪ 𝐶) = (𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶).
5. Prove that (𝐴 ∪ 𝐵)′ = 𝐴′ ∩ 𝐵 ′ .
6. Prove that 𝐴 − (𝐵 ∩ 𝐶) = (𝐴 − 𝐵) ∪ (𝐴 − 𝐶).
7. Find how many integers between 1 and 60 that are not divisible by 2 nor by 3 and nor by 5. Also
determine the number of integers divisible by 5, not by 2, not by 3.
8. Among 200 students in a class, 104 students got an ‘A’, in the first examination and 84 students got
‘A’ in second examination. If 68 students did not get an ‘A’ in either of the examination then How
many students got ‘A’ in both the examination.
9. One hundred sportsmen were asked whether they ply which game: cricket, hockey, football. The
results were :45 play cricket, 38 play hockey, 21 play football, 18 play cricket and hockey, 9 play
cricket and football, 4 play football and hockey and 23 play none of these.
Draw a venn diagram that will show the result of the survey and determine the number of sportsmen
who play: (a) Exactly one of the games (b) Exactly two of the games.
10. In a class of 55 students the number of studying different subjects are as below: maths 23, physics 24,
chemistry 19, maths & physics 12, maths& chemistry 9, physics & chemistry 7, all three subjects 4.
Then find the number of students who have taken: (a) at least one subject (b) exactly one subject
(c) Exactly three subject.
11. Prove that 𝐴 − (𝐵 − 𝐶) = (𝐴 − 𝐵) ∪ (𝐴 ∩ 𝐶).
12. If 𝐴 = {1,2,3,4} , 𝐵 = {2,3,4,5}, 𝐶 = {3,4,5,6} find A-B, A-(B-C).
13. Prove that ∅ = (𝐴 ∩ 𝐵) ∩ (𝐴 − 𝐵).

FUNCTION
1. If 𝐴 = {𝑥, 𝑦, 𝑧}, 𝐵 = {𝑎, 𝑏, 𝑐, 𝑑}. Check whether the following are function from 𝐴 to 𝐵, if they are
functions give the range of each, if not then give the reason.
a) 𝑓 = {(𝑥, 𝑎), (𝑦, 𝑏), (𝑧, 𝑐)}
b) 𝑓 = {(𝑥, 𝑎), (𝑦, 𝑐), (𝑧, 𝑏), (𝑥, 𝑐)}
c) 𝑓 = {(𝑥, 𝑑), (𝑦, 𝑏)}
d) 𝑓 = {(𝑥, 𝑎), (𝑦, 𝑏), (𝑧, 𝑑)}
3𝑥 − 4, 𝑥 > 0
2. If the function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = { .
−3𝑥 + 2, 𝑥 ≤ 0
Determine (𝑎)𝑓(0), 𝑓(2/3), 𝑓(−2) (𝑏)𝑓 −1 (0), 𝑓 −1 (−7), 𝑓 −1 (2)
3. Determine which of the following function 𝑓: 𝑅 → 𝑅 are one-one and which are onto 𝑅.
a) 𝑓(𝑥) = 𝑥 + 1
b) 𝑓(𝑥) = 𝑥 3
c) 𝑓 (𝑥) = 𝑥 + |𝑥|
4. Let 𝑓: 𝑁 → 𝐴 , be defined by𝑓(𝑥) = 2𝑥, where 𝐴 is the set of even integers. Check whether the
function is one-one, onto or both. If 𝑓 is one-one and onto then find 𝑓 −1 .
5. Let 𝑓 and 𝑔 be two functions from 𝑅 to 𝑅 defined by 𝑓(𝑥) = 𝑥 2 and 𝑔(𝑥) = 𝑥 + 2. Find 𝑓𝑜𝑔 and
𝑔𝑜𝑓 . Show that 𝑓𝑜𝑔 ≠ 𝑔𝑜𝑓 . Also find 𝑓𝑜𝑔(1) and 𝑔𝑜𝑓(1) .
6. Let 𝐴 = 𝐵 = 𝐶 = 𝑅. Let 𝑓: 𝐴 → 𝐵 be defined by 𝑓(𝑥) = 3𝑥 + 1 and 𝑔: 𝐵 → 𝐶 be defined by 𝑔(𝑦) =
𝑦
⁄4 . Verify that (𝑔𝑜𝑓)−1 = 𝑓 −1 𝑜𝑔−1.
7. Define the following: 1 One One function. 2 Onto function 3. Bijective function. 4. Inverse of a
function.
8. Let 𝑓, 𝑔, ℎ be three functions from 𝑅 → 𝑅 as: 𝑓(𝑥) = 2𝑥 3 + 5 , 𝑔(𝑥) = cos 𝑥 , ℎ(𝑥) = 𝑥 3 − 1. Find
ℎ𝑜(𝑔𝑜𝑓) and(ℎ𝑜𝑔)𝑜𝑓. Are they equal?

COUNTING
1. In how many ways can the letters of the word MONDAY be arranged? How many of them begin with
M and end with Y? How many of them do not begin with M but end with Y? Ans. 720, 24, 96
2. A man has 7 relatives, 4 of them are ladies and 3 gentlemen, his wife has 7 relatives and 3 of them are
ladies and 4 gentlemen. In how many ways can they invite a dinner party of 3 ladies and 3 gentlemen
so that there are 3 of man’s relatives and 3 of wife’s relative? Ans. 485
3. If 𝑛𝑃𝑟 = 72, find the value of 𝑛. Ans 9
4. If 𝑛𝐶𝑥 = 56 and 𝑛𝑃𝑥 = 336, find 𝑛 and 𝑥. Ans. 𝒏 = 𝟖, 𝒙 = 𝟑
5. Out of 5 men and 2 women, a committee of 3 is to be formed. In how many ways can this be doe so
as to include (i) exactly one woman (ii) at least one woman. Ans. (i) 20 (ii) 25
6. A house has 4 doors and 10 windows. In how many ways can a burglar rob the house by entering
through a window and exiting through a door? Ans. 40
7. How many three-digit numbers can be formed without using the digits 1, 1, 3? Ans. 216
8. How many numbers are there between 100 and 1000 such that 7 is in the unit’s places? Ans. 90
9. How many permutations can be made out of the letters of the word TRIANGLE? How many of these
will begin with 𝑇 and end with 𝐸? Also find how many permutations will begin with 𝑇 but will not
end in E? Ans. 40320, 720, 4320
10. In how many ways can the letters of the word COMBINE be arranged so that (i) the vowels are never
separated (ii) all the vowels never come together (iii) vowels occupy only the odd places? Ans.
720,4320,576
11. How many arrangements can be made with the letters of the word MATHEMATICS? In how many of
them the vowels occur together? Ans. 4989600, 120960
12. There are 6 gentlemen and 4 ladies to dine at a round table. In how many ways they can seat themselves
so that no two ladies are together? Ans. 43200
13. In how many ways can 10 people sit around a table so that all shall not have the same neighbours in
𝟏
any two arrangements? Ans. 𝟐 (𝟗!)
14. A committee of 11 members sits at a round table. In ow many ways can they be seated in if the president
and the secretary choose to sit together? Ans. 2 (9!)
15. (a) What is the coefficient of 𝑥 6 𝑦 3 in (𝑥 + 𝑦)9 ?

(b) What is the coefficient of 𝑥 5 𝑦 7 in (𝑥 − 2𝑦)12 ?

(c) What is the coefficient of 𝑥 3 𝑦 2 in (3𝑥 − 𝑦)5 ?
(d) What is the coefficient of 𝑥 2 𝑦 3 𝑧 2 in (𝑥 + 𝑦 + 𝑧)7 ?
 (e) What is the coefficient of 𝑥 3 𝑦 2 𝑧 5 in (𝑥 + 𝑦 + 𝑧)10 ?
(f) What is the coefficient of 𝑥 2 𝑦𝑧 in (2𝑥 − 𝑦 + 𝑧 + 1)7 ?
Ans. (a) 84 (b) -101376 (c) 2700 (d) 210 (e) 2520 (f) -280
16. Show that 7 colours are used to paint 50 bicycles, at-least 8 bicycles will be of same colour.
17. In how many ways letter ‘ORGANISE’ can be arranged in such a way that all vowels always come
together.
18. In how many ways can you take 5 cards, with at-least two aces, out of well shuffled pack of 52 cards.

PREDICATE LOGIC
1. Write negations for each of the following:
a) Real number 𝑥, 𝑖𝑓 𝑥 > 3 𝑡ℎ𝑒𝑛 𝑥 2 > 9.
b) 𝑥 ∈ 𝑅 𝑖𝑓 𝑥(𝑥 + 1) > 0 then 𝑥 > 0 𝑜𝑟 𝑥 < −1.
c) Integers 𝑎, 𝑏 𝑎𝑛𝑑 𝑐 𝑖𝑓 𝑎 − 𝑏 is even and 𝑏 − 𝑐 is even, then 𝑎 − 𝑐 is even.
2. Rewrite the following argument using quantifiers, variables and predicate symbols:
a) All birds can fly.
b) Not all birds can fly
c) Some med are genius.
d) Some numbers are not rational.
e) There is a student who likes mathematics but not Geometry.
3. Remove all negations of the quantifiers of following expression:
~∀𝑦(∃ 𝑥 𝑃 (𝑥, 𝑦) ∧ ∼ ∀𝑥 𝑄(𝑥, 𝑦))
4. Translate each of the statement into symbols, using quantifiers, variables and predicate symbols:
Let 𝑃(𝑥): 𝑥 can speak Tamil and 𝑄(𝑥): 𝑥 knows the language 𝐶 + +
a) There is a student who can speak Tamil and who knows 𝐶 + +
b) There is a student who can speak Tamil but does not know 𝐶 + +
c) Every student either can speak Tamil or knows 𝐶 + +
d) No student can speak Tamil or knows 𝐶 + +
5. Consider the following premises:
∃ 𝑥 𝑀(𝑥), ∀ 𝑥 (𝑀(𝑥)) ⟹ ∃ 𝑦 𝐶 (𝑥, 𝑦) And ∀ 𝑥 (∃𝑦 𝐶 (𝑥, 𝑦) ⟹ 𝐹(𝑥))
Give a formal derivation to prove that these premises lead one to the conclusion and there must be
a 𝑦 such that 𝐹(𝑦) is true. State the rules of inference in the derivation.
6. Consider the following premises:
∀ 𝑥 ∀ 𝑦 [𝑃(𝑥, 𝑦) ⟹ 𝑄(𝑥, 𝑦)], 𝑄(𝑎, 𝑏)
Prove that these premises lead to a conclusion ~𝑃(𝑎, 𝑏).
7. Use predicate calculus to prove the following agreement:
a) All mammals are animals. Some mammals are two-lagged. Therefore, some animals are two-
legged.
b) All animals are mortal. All human being are animals. Therefore, all humans are mortal.
c) No human being are quadrupeds. All women are human beings. Therefore, no women are
quadrupeds.
 PROPOSITIONAL LOGIC

1. For the statements 𝑝 and q, Define Conjunction and Disjunction. Also write their truth tables.
2. Define concept of contrapositive of implication 𝑝 → 𝑞 and write its truth table.
3. Express the contrapositive, converse, inverse and negative forms of the following conditional
statement. ‘if 𝑥 is rational, then 𝑥 is real’.
4. State inverse and converse of the following implications.
(a) If I am fine, then I go to gym.
(b) If I am the director of an institute, then I will go by car.
(c) If you work hard, then you can earn money.
5. If 𝑝, 𝑞 and 𝑟 are three statements, using truth table show that
(a) 𝑝 ∧ (𝑞 ∨ 𝑟) = (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)
(b) 𝑝 ∨ (𝑞 ∧ 𝑟) = (𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟)
6. Using truth table prove the absorption laws
(a) 𝑝 ∧ (𝑝 ∨ 𝑞) = 𝑝
(b) 𝑝 ∨ (𝑝 ∧ 𝑞) = 𝑝
7. Define tautology. Show that ∼ (𝑝 ∧ (∼ 𝑞)) is a tautology
8. Show that (𝑝 → 𝑞) ↔ (∼ 𝑝) ∨ 𝑞 is a tautology.
9. If the statements, 𝑝: I read book and 𝑞: I go for swimming then find
(i) 𝑝 ∨ 𝑞 (ii) 𝑝 ∧ 𝑞 (iii) (∼ 𝑝) ∨ 𝑞 (iv) 𝑝 ∧ (∼ 𝑞)
10. Construct truth table for (𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟)).
11. Construct truth table for (𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟)).
12. Construct truth table for (𝑝 ∧ 𝑞) ∧ (∼ (𝑝 ∨ 𝑞)).
13. For the statements 𝑝 and 𝑞 , Show that 𝑝 ↔ 𝑞 is logically equivalent to (𝑝 → 𝑞) ∧ (𝑞 → 𝑝).

RELATION
1. Let 𝐴 = {2,3,4} and 𝐵 = {3,4,5}. List the elements of each relation 𝑅 defined below and the domain
and range.
a) 𝑎 ∈ 𝐴 is related to 𝑏 ∈ 𝐵 that is 𝑎 𝑅 𝑏 if and only if 𝑎 < 𝑏.
b) 𝑎 ∈ 𝐴 is related to 𝑏 ∈ 𝐵 that is 𝑎 𝑅 𝑏 if 𝑎 and 𝑏 are both odd numbers.
2. Give an example of a relation which is:
a) Reflexive and transitive but not symmetric
b) Symmetric and transitive but not reflexive
c) Reflexive and symmetric but not transitive
3. If 𝑅 be a relation in the set of integers 𝑍 defined by 𝑅 = {(𝑥, 𝑦): 𝑥 ∈ 𝑍, 𝑦 ∈ 𝑍, (𝑥 − 𝑦) is divisible by
6} Then prove that 𝑅 is an equivalence relation .
4. Given 𝐴 = {1,2,3,4} , 𝐵 = {𝑎, 𝑏, 𝑐} 𝑎𝑛𝑑 𝐶 = {𝑥, 𝑦, 𝑧} . Let 𝑅 and 𝑆 are the following relations from
𝐴 𝑡𝑜 𝐵 and 𝐵 𝑡𝑜 𝐶, respectively 𝑅 = {(1, 𝑏), (2, 𝑎), (2, 𝑐)} and 𝑆 = {(𝑎, 𝑦), (𝑏, 𝑥), (𝑐, 𝑦), (𝑐, 𝑧)}
a) Determine the matrix and graph of the relation 𝑅 , 𝑆, 𝑅 −1 , 𝑆 −1 , 𝑎𝑛𝑑 𝑅 ∘ 𝑆.
b) Determine inverse 𝑅 −1 and 𝑆 −1.
c) Find the range and domain of 𝑅 −1 and 𝑆 −1 .
5. Consider the following relation on {1,2,3,4,5,6}. 𝑅 = {(𝑖, 𝑗): |𝑖 − 𝑗| = 2}
Is ′𝑅′ transitive? Is ′𝑅′ reflexive? Is ′𝑅′ symmetric?
6. Let 𝑅 be a binary relation defined as 𝑅 = {(𝑎, 𝑏) ∈ 𝑅 2 ∶ (𝑎 − 𝑏) ≤ 3}
Determine whether 𝑅 is reflexive, symmetric, antisymmetric and transitive.
7. Let 𝐴 = {1,2,3,4,5} and 𝑅 = {(1,2), (1,1), (2,1), (2,2), (3,3), (4,4), (4,5), (5,4), (5,5)} be
equivalence relation on 𝐴. Determine the partitions corresponding to 𝑅 −1 , if it is an equivalence
relation.
8. Let 𝑆 = {1,2,3,4,5,6,7,8,9} and let ∼ be the relation on A× 𝐴 defined by (𝑎, 𝑏) ∼ (𝑐, 𝑑) whenever
𝑎+𝑑 =𝑏+𝑐
a) Prove that ∼ is an equivalence relation.
b) Find equivalence class of (2,5) or [(2,5)].
9. Consider the set 𝑸 of rational numbers with the usual order ≤ and 𝐷 is the subset of 𝑸 defined by
𝐷 ={y | y ∈ Q and 4<𝑦 2 <13}
(a) Is D bounded above or below?
(b) Does sup(𝐷) or inf(𝐷)exist? If yes, then find them.
10. If 𝑅 be a relation in the set of integers 𝑍 defined by
𝑅 = {(𝑥, 𝑦): 𝑥 ∈ 𝑍, 𝑦 ∈ 𝑍, (𝑥 − 𝑦) is multiple of 3} Show that it is an equivalence relation. What is
the equivalence class of 0? How many equivalence classes are there?
11. Draw the directed graph that represents the relation
𝑅 = {(1,1), (2,2), (1,2), (2,3), (3,2), (3,1), (3,3)} on 𝑋 = {1,2,3}
12. 𝐴 = {1,2,4,8} 𝑎 𝑅 𝑏 if and only if 𝑎|𝑏 (𝑎 divides 𝑏) then find the digraph of relation.
1 0 1 0
0 0 1 1
13. 𝐴 = {1,2,3,4} the relation matrix is 𝑀𝑅 = [ ]. Draw its graph.
1 1 1 1
0 1 1 0
14. Consider a relation 𝑅 defined on 𝐴 = {1,2,3} whose matrix representation is given below.
Determine its inverse 𝑅 −1 and complement 𝑅 ′ .
1 0 0
𝑀𝑅 = [1 1 1]
0 0 1

PARTIAL ORDERING

1. Show that the relation ≤ is a POSET on the set of integers.

2. Shoe that the relation > is not a POSET on the set of integers.
3. Shoe that the set of positive integers under divisibility forms a POSET.
4. Let 𝑥 = {1,2,3,4,5,6}, then / is a POSET on x. draw the Hasse diagram of (X,/).
5. LET 𝐴 = {1,2,3,4} and consider the relation 𝑅 = {(1,1), (2,1), (2,2), (3,1), (3,3), (3,4), (4,4)} show
that R is a POSET and also draw its Hasse diagram.
6. Consider the divides relation on each of the following sets S. draw the Hasse diagram for each
relation then find
a) All minimal and maximal element where 𝑆 = {2,3,5,30,60,120,180,360}}
b) Greatest and least element where 𝑆 = {1,2,3,4,6}.
7. Find the greatest lower bound and the least upper bounds of the sets {3,9,12} and {1,2,4,5,10} if
they exist, in POSET(𝑍 + , 11).
8. Answer the following questions concerning the poset
{{1}, {2}, {4}, {1,2}, {1,4}, {2,4}, {3,4}, {1,3,4}, {2,3,4}, ⊆}
a) Find the maximal and minimal elements.
b) Find the upper bounds of {{2}, {4}} and the least upper bound, if it exists.
c) Find the lower bounds of {1,3,4} and the greatest lower bound of {1,3,4}.
9. Prove that pentagonal lattice is not modular.
10. Show that in a complemented, distributive lattice, the followings are equivalent.
a) 𝑎 ≼ 𝑏
b) 𝑎 ∧ 𝑏 ′ = 0
c) 𝑎′ ∨ 𝑏 = 1
d) 𝑏′ ≼ 𝑎′.
11. Observing the following diagrams
(i) which of the following are the sublattices of 𝐿: 𝐿1 = {0, 𝑎, 𝑏, 𝑖}, 𝐿1 = {0, 𝑎, 𝑒, 𝑖}, 𝐿1 =
{𝑎, 𝑐, 𝑑, 𝑖}𝐿1 = {0, 𝑐, 𝑑, 𝑖}
(ii) Is 𝐿 is distributive?
(iii) Find the complements of 𝑎, 𝑏 and 𝑐 if they exist.
(iv) Is 𝐿 a complemented lattices?

12. Let 𝑀 = {2,3,4, … … } and let 𝑀2 = 𝑀 × 𝑀 be ordered as follows:

(𝑎, 𝑏) ≺ (𝑐, 𝑑) 𝑖𝑓 𝑎|𝑐 𝑎𝑛𝑑 𝑏 < 𝑑
Find all minimal and maximal elements of 𝑀 × 𝑀.
13. Let M = {1,2,3,4,5,6} be ordered as in below Fig. Find all minimal and maximal elements of M.
Does M have a first or last elements?

14. Find the solution of recurrence relation

(i) 𝑎𝑛 = 3𝑎𝑛−1 − 10𝑎𝑛−2 𝑎0 = 5, 𝑎1 = 11
(𝑖𝑖) 𝑎𝑛 = 11𝑎𝑛−1 − 39𝑎𝑛−2 + 45𝑎𝑛−3
15. Consider the set A = {1, 2, 3, 9, 18}. Let R be the relation a ≤ b iff a|b on A. Draw the directed graph
and the Hasse diagram of R.
16. Consider the set 𝑸 of rational numbers with the usual order ≤ and 𝐷 is the subset of 𝑸 defined by
1
𝐷 ={(−1)𝑥 - 𝑥 such that 𝑥 ε N}
(i) Is D bounded above or below?
 (ii) Does sup(𝐷) or inf(𝐷)exist? If yes, then find them.
17. Consider the set A = {4, 5, 6, 7}. Let R be the relation ≤ on A. Draw the directed graph and the
Hasse diagram of R.

GROUP THEORY
1. Let 𝑄+ be the set of all positive rational numbers and ′ ∗ ′ a binary operation on 𝑄+ defined by 𝑎 ∗
𝑎𝑏
𝑏= is an abelian group.
3
2. Let 𝑅 = {0°, 60°, 120°, 180°, 240°, 300°} and ∗ = binary operation, so that for a and b in R 𝑎 ∗ 𝑏 is
overall angular rotation corresponding to successive rotations by a and then by b. Show that (𝑅,∗) is
a group.
3. if * is a binary operation in R defined by 𝑎 ∗ 𝑎 = 𝑎 + 𝑏 − 𝑎𝑏 ∀ 𝑎, 𝑏 ∈ 𝑅 then Show that the inverse
𝑎
of 𝑎 ≠ 1 is 𝑎−1 .
4. G is a group and there exists two relatively prime positive integers m and n such that 𝑎𝑚 𝑏 𝑚 = 𝑏 𝑚 𝑎𝑚
and 𝑎𝑛 𝑏 𝑛 = 𝑏 𝑛 𝑎𝑛 for all 𝑎, 𝑏 ∈ 𝐺. Prove that G is an abelian group.
5. Prove that 𝐺 = {1, 𝜔, 𝜔2 } is a group with respect to multiplication where 1, 𝜔, 𝜔2 are cube roots of
unity.
𝑎𝑏
6. Let G be the set of all non-zero real numbers and let 𝑎 ∗ 𝑏 = Show that (𝐺,∗) is an abelian group.
2
7. Let G be a group, for a fixed element of G, Let 𝐺𝑥 = {𝑎 ∈ 𝐺; 𝑎𝑥 = 𝑥𝑎}. Show that 𝐺𝑥 is a subgroup of
G for all 𝑥 ∈ 𝐺.
8. Show that the set of four transformations 𝑓1 , 𝑓2 , 𝑓3 𝑎𝑛𝑑 𝑓4 on the set of complex numbers be defined
1 −1
by 𝑓1 (𝑧) = 𝑧, 𝑓2 (𝑧) = −𝑧, 𝑓3 (𝑧) = 𝑧 , 𝑓4 (𝑧) = Forms a finite abelian group with respect to the
𝑧
binary operation as the composition of product of two functions.
9. Four fourth roots of unity form a cyclic group 𝐺 = {1, −1, 𝑖, −𝑖}.
10. Let G be a group with identity e. Show that function 𝑓: 𝐺 → 𝐺 defined by 𝑓(𝑎) = 𝑒 for all 𝑎 ∈ 𝐺 is a
homomorphism.
11. Show that the set 𝐺 = {0,1,2,3,4} is an abelian group with respect to addition modulo 5.
12. Prove that the set {1,2,3,4,5,6} of order 6 is a finite abelian group of order 6 under multiplication
modulo 7.
13. Prove that the set 𝐺 = {𝑎 + √2𝑏: 𝑎, 𝑏 ∈ 𝑄 } is a group with respect to addition.
14. If (𝐺,∗) is a group then (𝑎 ∗ 𝑏)−1 = 𝑏 −1 ∗ 𝑎−1 for all 𝑎, 𝑏 ∈ 𝐺
15. Let 𝐻 = {1, −1} and 𝐺 = {1, −1, 𝑖, −𝑖} then (𝐻,∗) is a sub group (𝐺,∗)
16. The groups (𝑍, +) and (𝑛𝑍, +), 𝑛 ∈ 𝑍 are isomorphic to each other.
17. State and prove that Cayley’s Theorem.
18. State and Prove the Fundamental Theorem on Homomorphism.
19. If 𝐴 = {1,2,3,4,5,6} compute (5 6 3)°(4 1 3 5)
1 2 3 4 5 6 7 8
20. Show that 𝑓 = ( ) is odd.
1 4 3 6 5 8 7 2
21. Set M of 2 × 2 matrices where entries of matrices are real numbers form a ring with unity with
respect addition (+) and multiplication (.) of matrices.
22. Consider the set (𝐶, +, . ) where C is the set of complex numbers and “+” and “.” are ordinary addition
and multiplication operation. Show that (𝐶, +, . ) is a ring.
23. Show that (𝐹, +, . ) is a field where F is set of all rational numbers and “+” and “.” are ordinary addition
and multiplication operators.
24. Show that 𝑅 = {𝑎 + √2𝑏: 𝑎, 𝑏 ∈ 𝐼 } for the operation +,× is an integral domain but not a field.
 GRAPHS, REACHABILITY, CONNECTEDNESS
1. How many nodes are necessary to construct a graph with exactly 8 edges in which each node is of
degree 2
2. Draw a simple graph with 6 nodes all of degree 2 or greater and with at least 2 nodes of degree 3.
3. Draw a graph with 4 nodes and 7 edges.
4. Is there exist a regular graph of degree 5 on 9 vertices? Give reason
5. Determine the number of edges in a graph with 6 nodes, 2 of degree 4 and 4 of degree 2. Draw two
such graphs.
6. Draw a complete bipartite graph which is not regular.
7. Draw a graph which is regular but not bipartite.
8. How many edges have each of the following graphs (1)𝐾7 (2)𝐾3,7
9. If G is a graph and H is a subgraph then draw complement of H

10. Is 𝐾6 is 1-factorable graph? Then draw 1-factor non isomorphic graphs.

11. Find following graphs are isomorphic or not?

12. Draw complements of given graphs which are subgraphs of complete graphs

13. Draw all non-isomorphic simple graphs with 5 vertices.

14. Whether 𝐾4 & 𝐾2,2 are isomorphic?
15. Draw a graph which contains an Eulerian circuit
16. Draw a graph which contains an Eulerian path but does not contain an Eulerian circuit.
17. Find under what conditions 𝐾𝑚,𝑛 the complete bipartite graph will have an Eulerian circuit
18. Draw a planar representation of each graphs for the following figure if possible
19. Find the shortest path between each pair of vertices for a simple digraph using Warshall’s algorithm.

20.
21. If G=(V,E) is a simple connected planar graph then 𝑒 ≤ 3𝑣 − 6 where e is total number of edges and
v is total number of vertices in the graph G.
22. Draw all non-isomorphic trees with six and seven points.
23. Show that it is possible to draw a tree with 10 vertices which has vertices either of degree 1 or of
degree 3. Draw the tree. Is it possible to draw the same type of tree with 11 vertices?
24. A telephone network is established among 100 people. Information received by the first person is
passed along to the 99 others as follows; the first person calls exactly 3 people, and each of these
people call 3 others and so on till there are no others to call. If each call taken 5 minutes, then how
long does it takes for message to be relayed from first person to receive the message to everyone
else? How many people make no calls?
25. What is the total number of nodes in a full binary tree with 20 leaves?
26. 19 lamps are to be connected to a single electrical outlet, using extension chords, each of which has
4 outlets, find the number of extension chords needed and draw the corresponding tree.
27. For the following set of weights construct an optimal binary prefix code. For each weight in the set
give corresponding code word. 5,7,8,15,35,40.