ASSESSMENT QUESTIONS

UNIT-I LOGIC & PROOFS

PART A
S.NO QUESTIONS BLOOM CO’S
S LEVEL
1. Define Tautology with an example K1 CO1
2. Construct a truth table for the compound proposition
K1 CO1
(p q)(q p).
3. Write the following in symbolic form “ some men are CO1
K1
clever ”.
4. Define a rule of Universal Specification. K1 CO1

5. Show that the propositions p  q and p  q are logically

K1 CO1
equivalent.
6. Show that P (Q R)  (PQ)  (PR) is a CO1
K1
tautology.
7. Define functionally complete set. And give an example K1 CO1
8. Give the contra positive of the statement “ If there is CO1
K1
rain,then I buy an umbrella”.
9. Symbolically express the following statement. “The CO1
K1
crop will be destroyed if there is a flood”.
10. Define a rule of Universal generalization. K1 CO1
PART-B
1. Obtain the PDNF and PCNF of the statement
CO1
P(P→(Q(Q→R))). ) K2
2. Prove that (x)( p( x)  q( x))  (x) p( x)  (x)q( x) using
CO1
indirect method K2
3. Show that R  S can be derived from the premises
P  Q  S , R  P and Q.
CO1
K2
4. Verify the validity of the argument.If one person is more
successful than another, then he has worked harder to deserve
K2 CO1
success. Ram has not worked harder than Siva. Therefore, Ram
is not more successful than Siva.
5. Prove ((pq)(p(qr)))(pq)(pr) is a
K2 CO1
tautology
6. Show that the hypotheses, “it is not sunny this afternoon and it is
colder than yesterday,” “we will go swimming only if it is
K2 CO1
sunny,” “if we do not go swimming, then we will take a canoe
trip,” and “if we take a canoe trip, then we will be home by
 sunset” lead to the conclusion “we will be home by sunset”.
7. Show that the following premises are inconsistent
a) If Rajkumar misses many classes through illness then he
fails high school.
b) If Rajkumar fails high school, then he is uneducated. K2 CO1

c) If Rajkumar reads lots of books then he is not uneducated.

d) Rajkumar misses many classes through illness and reads
a lots of books
8. Find PCNF and PDNF of (P  R)  (Q  P) . CO1
K2
9. Using indirect method of proof derive P  (S ) follows from
the premises K2 CO1

P  (Q  R), Q  P, S  R and P

10. Prove that 2 is irrational by contradiction K2 CO1

UNIT-II: COMBINATORICS
PART A
S.NO QUESTIONS BLOOMS CO’S
LEVEL
1. State pigeonhole principle.
K1 CO2

2. State the principle of Mathematical Induction. K1 CO2

3. State the principle of strong induction. K1 CO2
n 1
4. Use mathematical induction to show that n!  2 , n =5,6… K1 CO2

5. In how many ways can all the letters in MATHEMATICS be

arranged? K1 CO2

6. How many permutations are there in the word MISSISSIPPI . K1 CO2

7. Show that if seven colours are used to paint 50 bicycles, at least 8
K1 CO2
bicycles will be the same colour.
8. Write down the generating function for the sequence 1, 2, 3, 4, 5
…….. K1 CO2

9. Find the recurrence relation for Fibonacci sequence. K1 CO2

10. Find the recurrence relation for J k   2  4 k  5  3k . K1 CO2

PART-B
1. Prove by principle of mathematical induction, for n positive
integer,
CO2
K2
n(n  1)( 2n  1)
1  2  .....  n 
2 2 2
.
6
2. How many positive integers n can be formed using the digits
3,4,4,5,5,6,7 if n has to exceed 5000000? CO2
K2
3. rove, by mathematical induction , that for all n≥1, n3+2n is a
multiple of 3. CO2
K2

4. A box contains six white balls and five red balls. Find the number
of ways four balls can be drawn from the box if

K2 CO2
(1) They can be any colour.
(2) Two must be white and two red.
(3) They must all be the same colour
5. n 2
Prove that 6  7 2 n1 is divisible by 43 K2 CO2
6. Find the number of integers between 1 to 250 that are not divisible
by any of the integers 2,3,5, 7 K2 CO2

7. 1 1 1 1
Show that     n , n  2. K2 CO2
1 2 3 n
8. Solve the recurrence relation an 1  an  3n 2  n , n≥0 and a0 =3 K2 CO2
9. Use generating function to solve the recurrence relation
CO2
yn2  5 yn1  6 yn  0, n  0 with y0  1 and y1  1. K2

10. Using the generating functions, solve the recurrence relation

K2 CO2
a  2  8a n1  15a n  0, a0  2 , a1  8

UNIT-III: GRAPHS

PART A
S.NO QUESTIONS BLOOM CO’S
S LEVEL
1. CO3
Define Graph. K1
2. Let G be a graph with ten vertices. If four vertices has
degree four and six vertices has degree five, then find the K1 CO3
number of edges of G.
3. Define Complete graph and give an example. K1 CO3
4. Define Bipartite graph and give an example K1 CO3
5. Draw a complete bipartite graph of K 2,3 and K3,3 CO3
K1
6. Draw the graph represented by the given adjacency matrix CO3

0 1 0 1
1 0 1 0
 K1
0 1 0 1
 
1 0 1 0
7. Represent the given graph using an adjacency matrix CO3

K1

8. Define Isomorphism of two graphs.. K1 CO3

9. Give example for non- Eulerian graph which is
Hamiltonian. K1 CO3

10. State the condition for Eulerian cycle. CO3

K1
PART-B
1. Prove that an undirected graph has an even number of
vertices of odd degree. State and prove Hand Shaking
CO3
theorem K2

2. Does there exit a simple graph with 5 vertices of the

following degree? If so CO3
K2
draw such graph (a) 1,1,1,1,1 (b) 3,3,3,3,2.
3. If all the vertices of an undirected graph are each of degree
k, show that the number of edges of the graph is a CO3
K2
multiple of k.
4. A graph is Bipartite if and only if it contains no odd cycle.
K2 CO3

6. Determine whether the following graphs G and H are

K2 CO3
isomorphic or not. Give reasons.
 (8)

7. Draw the graph whose adjacency matrix given below:

0 3 0 2
3 0 1 1 
 K2 CO3
0 1 1 2
 
2 1 2 0

8. Prove that maximum number of edges in a simple disconnected

(n  k )( n  k  1) K2 CO3
graph G with n vertices and K components is
2
9. Prove that a simple graph with n vertices must be connected if it has
more than
(n  1)( n  2) K2 CO3
edges.
2
10. Prove that a connected graph G is Eulerian if and only if
all the vertices are of even degree.
If G is a connected simple graph with n vertices with n  K2 CO3
3, such that the degree n
of every vertex in G is atleast , then prove that G
has a Hamilton cycle 2
UNIT-IV: ALGEBRAIC STRUCTURES
PART A
S.NO QUESTIONS BLOOM CO’S
S LEVEL
1. Prove that identity element of a group is unique. CO4
K1
2. State any two properties of a group. K1
CO4

3. Define semigroups and monoids. K1

CO4

4. When is a group (G,*) called abelian? K1 CO4

5. Define Cyclic group. CO4
K1
6. Prove that any group of prime order is cyclic. K1 CO4

7. Prove or disprove: Every subgroup of an abelian is normal. K1 CO4

8. If 𝑎 is a generator of a cyclic group 𝐺, then show that a 1
K1 CO4
is also a generator of 𝐺.
9. Define a commutative ring. K1 CO4

10. Give an example of a ring which is not a field. K1 CO4

PART-B
1. If  is a binary operation on the set R of real numbers defined by
a  b  a  b  2ab
i) Prove that R, is a semi group.
CO4
ii) Find the identity elements , if exists. K2
iii) Which elements have inverse and what are they?

2.  1 0   1 0 1 0    1 0 
Prove that G=  0 1 ,  0 1  , 0 
 1 0  1 
,
     
CO4
K2
forms an abelian group under matrix multiplication

3. Show that the union of two subgroup of group G is a subgroup of

G if and only if one is contained in the other. CO4
K2

4. Prove that the necessary and sufficient condition for a non empty
subset H of a group (G, *) to be a subgroup of G if
CO4
a, b  H  a  b1  H . K2

5. Prove that every finite group of order ‘n’ is isomorphic to

permutation group of degree ‘n’ K2
CO4

6. If f is a homomorphism from a group (G,  ) into ( G' ,  )

then prove that f ( a −1 ) = ( f ( a))−1 for all a ∈G. K2
CO4

7. State and prove the Lagrange’s theorem for the group CO4
K2
8. If G is a finite group of order n, then prove that a n  e, for any CO4
K2
 element a  G .
9. Let f : G,  G ' , be a homomorphism ,then prove that
CO4
Ker f is a subgroup. K2

10. Prove that every cyclic group is an abelian group CO4

K2

UNIT-V: LATTICES & BOOLEAN ALGEBRA

PART A
S.NO QUESTIONS BLOOM CO’S
S LEVEL
1. Define lattice. CO6
K1
2. Define sub lattice with example CO6
K1
3. When a lattice is called complete? K1 CO6
4. Show that the “greater than or equal to “relation (≥) is a
K1 CO5
partial ordering on the set of integers.
5. Which elements of the poset ({2,4,5,10,12,20,25}, / ) are
K1 CO5
maximal and which are minimal?
6. What values of the Boolean variables x and y satisfy
K1 CO5
xy  x  y ?

7.  
Show that in any Boolean Algebra a  b a ' c  ac  a 'b  bc . K1 CO5

8. Show that in any Boolean Algebra a  a  b a. K1 CO5

9. Define Sub-Boolean Algebra. K1 CO5

10. Define partially ordered set. K1 CO5

PART-B
1. Show that the direct product of any two distributive lattice
K2 CO6
is a distributive lattice.
In a Boolean algebra, prove that (i) a  b  ' = a '  b' (ii)
2.
K2 CO5
a  b  '= a '  b'.
3. Draw Hasse diagram representing the partial ordering
A, B : A  B on the power
CO5
K2
 set P(S) where S  a, b, c . Find the maximal, minimal,
greatest and least element of the poset.
.
4.
State and prove distributive and modular inequality of K2 CO6
lattice.
5. Prove that (i) a  bb  c = a  bc. (ii) a  a b  a  b . K2 CO5

6. If S 42 is the set of all divisors of 42 and D is the relation

“divisor of ” on S 42 . prove that S 42 , D  is a complimented
K2 CO5
lattice.

7. Let L,,  be a lattice in which  and  denote the

operation of meet and join respectively. For any a, b  L .
K2 CO6
then , show that a  b  a  b  a  a  b  b .

8 State and prove Isotonicity property of lattice.

K2 CO6

9. Simplify the Boolean expression a '. b'.c + a . b'.c + a '. b'.

c' using Boolean algebra identities. K2 CO5

Prove that every chain is a distributive lattice.

10. K2 CO6