Scribd
Upload
6 views5 pages

FAQ's DSGT (3,4,5,6)

The document contains a series of mathematical problems and concepts across multiple modules, including counting principles, pigeonhole principle, permutations, combinations, group theory, and graph theory. It addresses specific questions related to divisibility, book selection, password creation, lattice structures, and algebraic systems. Each module presents distinct topics and exercises aimed at enhancing understanding of mathematical principles.

Uploaded by

dhansanushree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views5 pages

FAQ's DSGT (3,4,5,6)

The document contains a series of mathematical problems and concepts across multiple modules, including counting principles, pigeonhole principle, permutations, combinations, group theory, and graph theory. It addresses specific questions related to divisibility, book selection, password creation, lattice structures, and algebraic systems. Each module presents distinct topics and exercises aimed at enhancing understanding of mathematical principles.

Uploaded by

dhansanushree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Counting Module 4

1. Among the integers 1 to 300


(i) How many of them are divisible by 3 nor by 5 nor by 7?
(ii) How many of them are divisible only by 3
2. There are 6 communication skills books, 8 engg mathematics, 10 books on C
programming. How many ways can be used to choose 2 books of different categories
from them.
3. How many string of length 7 either begin with 2 zeros or end with 3 zeros.
4. State pigeon hole principle. If 30 people are assembled in a room then show that atleast
two of them must have their birthday on the same day of a week.
5. A bank password consists of two letters of the English alphabet followed by two digits.
How many different passwords are there?
6. (a) Find the number of distinguishable permutations of the letters in BOOLEAN. (b) Find
the number of distinguishable permu tations of the letters in PASCAL.
7. How many different 8-card hands with 5 red cards and 3 black cards can be dealt
from a deck of 52 cards?
8. State extended pigeon hole principle. If there are 10 marbles in a jar and you
have a jar filled with red green and blue marbles. show that you will arbitrarily
have 2 marbles of the same colour.
9. Show that if seven colors are used to paint 50 bicycles, at least 8 bicycles will be
the same color.
10. In how many ways can a committee of 6 people be selected from a group of 10
people if one person is to be designated as chair of the com- mittee?

11.

Module 3
1. What is a partial order relation? Determine the hasse diagram for the following
relation A={1,2,3,4} R={(1,1),(1,2),(1,3),(1,4),(2,2),(2,4),(3,3),(3,4),(4,4)}
2. Define lattice. Prove that in a distributive lattice the complement of any element is
unique. Determine whether D105 is a distributive lattice.
3. What is lattice? Determine whether following hasse diagram represents a lattice? Do
the naming of graph by yourself.
4. Draw the Hasse diagram of D72 and D105 and check whether they are lattice.
5. Define bounded lattice and Distributive lattice. Check if the following diagram is distributed
lattice or not?

6. Define sublattice.

7. Define chain and anti-chain. Give Chain and anti-chain for following POSET
A={1,2,3,4,5,6,9,12,18} where a divides b
8. List types of lattices and explain each one with example.
9. Check if these are Lattice or not

10. Check if the following are lattice or not


Module 5
1. Let A={0,1,2,3,4,5} (a) Explain term group (b) Prepare the composition table with
respect to the operation addition modulo 6. (c) Determine if it is group. (d)
Whether the elements of A are invertible, if yes find the inverse of these
elements. (e) Determine whether it is a cyclic group.
2. If addition and multiplication modulo 10 is defined on a set of integers
A={0,2,4,6,8} Them determine whether this algebraic system is a ring.
3. Define Ring, Cyclic group, Monoid
4. Let G be a group. Prove that identity element ‘e’ is unique.
5. Consider a set A={1,2,3,4,5,6} under multiplication modulo 7. Prove that it is a
cyclic group.
6. What is group? Let A={5,10,15,20} (a) Prepare the composition table with
respect the operation multiplication modulo 25. (b) whether it is a abelian group?
Justify your answer (c) Find the inverse of the elements (d) whether it is a cyclic
group.
7. What is ring? Ket A={0,1,2,3,4,5} Determine whether a set A with addition
modulo 6 and multiplication modulo 6 is a commutative Ring? Justify your
answer.
8. Consider (3,8) as an encoding finction e:B^3→B^8 defined as
e(000)=00000000 , e(001)=10111000, e(010)= 00101101, e(011)=10010101
e(100)=10100100, e(101)=10001001, e(110)=00011100, e(111)=00110001
How many errors can it detect and correct,
9. Consider (2,5) as an encoding finction e:B^2→B^5 defined as
e(000)=00000 , e(001)=01110, e(010)= 10101, e(011)=11011 Decode codes for
(a)11101 b)11111 c)10011

Module 6

1. List and explain different types of graphs with example


2. Check if 2 graphs are isomorphic
3.

4.
5. Define Eucler path, eucler circuit, Hamiltonian path and circuit
6.

7.

8. Define Bipartite and complete graph


9.

10.

You might also like