Reg.
No
MANIPAL INSTITUTE OF TECHNOLOGY
MANIPAL UNIVERSITY, MANIPAL - 576 104
Third Semester B.Tech Degree End Semester Examination-December 2014
MAT 209: Engineering Mathematics III
(Revised Credit System - 2011)
Time: 3 Hrs. Max. Marks: 50
Note: a) Answer any FIVE full questions b) All questions carry 3+3+3+1 marks.
1A. Let L, be a distributive lattice. Prove that for any elements x, y L , if a x a y
and a x a y for some a L , then x y .
1B. How many arrangements of 5 𝛼s, 5 𝛽s and 5 𝛾s are there with at least one 𝛽 and at least one
𝛾 between each successive pair of 𝛼s.
1C. Let G, · be a group, and let Z (G) {a G | x G, ax xa} . Show that Z (G) is a
subgroup of G .
1D. State true or false: 𝑚𝑎𝑥[𝑎, 𝑚𝑖𝑛(𝑎, 𝑏)] = 𝑚𝑖𝑛[𝑎, 𝑚𝑎𝑥(𝑎, 𝑏)].
2A. Show that, if diameter of 𝐺̅ is greater than or equal to 3 then diameter of 𝐺 is less than or equal
to 3. Hence show that diameter of a self-complementary graph is either 2 or 3.
2B. Show that from x F ( x) S ( x) y M ( y ) W ( y ) and y M ( y ) W ( y )
the conclusion x F ( x) S ( x) follows.
2C. Find the number of ways to place 25 people into three rooms with at least one person in each
room.
2D. State true or false: There can exist a group of seven people in which each person knows exactly
three other persons.
3A. Let : G1 G2 be a homomorphism with ker x G1 | ( x) e2 , where e2 is the
identity element of G2 . Show that ker is a normal subgroup of G1 .
3B.
Let E ( x1 , x2 , x3 ) x1 x2 x1 x3 x2 x3 be a Boolean expression over the two-
valued Boolean algebra. Write E( x1 , x2 , x3 ) in both disjunctive and conjunctive normal forms.
3C. Show that a (𝑝, 𝑞) graph 𝐺 is a tree if and only if 𝐺 is acyclic and 𝑝 = 𝑞 + 1.
3D. Let 𝐺 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒} be a set with a binary operation ∗ defined as follows:
𝑎 ∗ 𝑎 = 𝑏, 𝑎 ∗ 𝑏 = 𝑐, 𝑎 ∗ 𝑐 = 𝑑, 𝑎 ∗ 𝑑 = 𝑒, where 𝑒 is the identity element with respect to ∗.
Is 〈𝐺, ∗〉 abelian?
Page 1 of 2
4A. In the following network, find the shortest distance to the vertices A, C , D, E from B using
Dijkshtra’s Algorithm.
4B. Let 〈𝐴, ∨, ∧, −〉 be a finite Boolean algebra. Let 𝑏 be any non-zero element in 𝐴 and
𝑎1 , 𝑎2 , … , 𝑎𝑘 be all the atoms of 𝐴 such that 𝑎𝑖 ≤ 𝑏. Then show that 𝑏 = 𝑎1 ∨ 𝑎2 ∨ … ∨ 𝑎𝑘 .
4C. Show that (𝑥)[𝑃(𝑥) ∨ 𝑄(𝑥)] ⇒ (𝑥)𝑃(𝑥) ∨ (∃𝑥)𝑄(𝑥)
𝑛(𝑛+1)
4D. State true or false: Every triangular number (number of the form 2 for some positive
integer 𝑛) has a partition whose Ferrer’s graph representation is self-conjugate.
5A. Let (𝐺,∗) be a group and 𝑎, 𝑏 ∈ 𝐺 such that 𝑎2 = 𝑒 and 𝑎 ∗ 𝑏 ∗ 𝑎 = 𝑏 7 . Prove that 𝑏 49 = 𝑏.
Can 𝑜(𝑏) = 50?
5B. Find the number of permutations of 𝑛 elements, 1, 2, … , 𝑛 such that 𝑖 does not occur in 𝑖 𝑡ℎ place
in any permutation for 𝑖 = 1, 2, … , 𝑛.
5C. Find the following permutations for 𝑛 = 5 with initial permutation 12345.
(a) 34𝑡ℎ permutation in Lexicographical order
(b) 108𝑡ℎ permutation in Fike’s order
5D. Are the following two statements logically equivalent?
Good food is not cheap.
Cheap food is not good.
6A. Use Ferrer’s diagram to show that number of partitions of an integer 𝑛 with no part greater
than 𝑘 is equal to the number of partition of 𝑛 with at most 𝑘 parts.
6B. If A works hard, then either B or C will enjoy themselves. If B enjoys himself, then A will not
work hard. If D enjoys himself, then C will not enjoy. If A works hard, then show that D will
not enjoy himself using inference theory of propositional calculus.
6C. Show that any two right cosets of a subgroup 𝐻 of a group 𝐺 are either identical or disjoint.
𝑎 𝑏 𝑐 𝑑 𝑎 𝑏 𝑐 𝑑 ) be two permutations of the set 𝑆 =
6D. Let 𝜋1 = ( ) and 𝜋2 = (
𝑎 𝑑 𝑏 𝑐 𝑏 𝑎 𝑐 𝑑
{𝑎, 𝑏, 𝑐, 𝑑}. Then (𝜋1 ∘ 𝜋2 )−1 = _________.
***********
Page 2 of 2
