Professional Documents
Culture Documents
IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
2?
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
( A B ) ( R S)
b. Show J S logically follows from the premises P Q , Q R , R , P ( J S)
8. a. Show that premises R QR S , S Q , P Q , P are inconsistent
b. Using CP or otherwise obtain the following implication.
x ( p (x ) Q (x );x ( R (x ) Q (x )) x ( R (x ) P (x)
9.a. Show that the following premises are inconsistent:
(i) If Jack misses many classes through illness, then he fails high school.
(ii) If Jack fails high school, then he is uneducated
(iii) If Jack reads a lot of books then he is not uneducated
(iv) Jack misses many classes through illness and reads a lot of book
b. Prove that xM (x) follows logically from the premises x(H (x ) M (x)) and xH (x)
10. a. Prove that x ( P (x ) Q (x )) xp (x ) xQ (x) .
b. Show that the hypothesis, It is not sunny this afternoon and it is colder than yesterday, We will go
swimming only if it is 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.
2
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
UNIT II COMBINATORICS
Part-A
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
9. Compute the number of distinct 13 card hands that can drawn from a deck of 52 cards. 10.Find
the coefficient of x
10
in (x+x +x +) .
( n >1) .
14. If seven colours are used to paint 50 bicycles, then show that at least 8 bicycles will be the
same colour.
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
for n 0.
1.
18. Among 200 people how many of them were born in the same month?
Part-B
1. a. i. Use mathematical induction to prove that 3n +7n 2 is divisible by 8 for all n 1
1 + 1 + 1 + ........ +
1 = n for all n 1
n ( n + 1) n +1
1.2 2.3 3.4
2
2
2
2
b.i. Use mathematical induction to prove that 1 + 3 + 5 + ....... + (2 n 1) = n (2 n 1)(2 n +1) for all n 1
ii. Use mathematical induction to prove that
3
ii. Prove by mathematical induction 6
n+2
+7
2n+1
a. ii. Use mathematical induction to prove that n + 2n is divisible by 3 for all integers n 1
b. Find the number of integers between 1 and 250 both inclusive that are
(i) divisible by any of the integers 2, 3.
(ii) divisible by 2,3,5.
(iii) not divisible by 2,3,5.
3. a. In a survey of 100 students , if was found that 40 studied mathematics , 64 studied physics 35 studied
chemistry , 1 studied all 3 subjects , 25 studied maths and physics , 3 studied maths and chemistry and 20 studied
physics and chemistry . Find the number of students who studied chemistry only.
b. i. How many 1-1 functions are there from a set with m element to a set with n elements?
ii. How many factors has 720?
4. a. i. Find the coefficient of x
10
5 10
in (1+x +x
+.)
ii . How many positive integers not exceeding 1000 are divisible by 7 or 11?
b. Find the minimum number of students needed to make sure that 5 of them take the same engineering course
ECE, CSE, EEE and Mech.
5
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
5. a. the generating function to solve the recurrence relation a n+2 8a n+1+ 15a n = 0
given that a0 = 2 , a1 = 8.
b. Using the generating function , solve the difference equation yn+2 y n+1 6 yn = 0 , y1 =1, y0 =2.
6. a. From the integers from 1 to 100, both inclusive 4-permutations are taken which contain 3 consecutive
integers in increasing order, but not necessarily in consecutive positions. How many such permutations are
there?
b. Sole the recurrence relation for the Fibonacci sequence 1,1,2,3,5,8,13,
7. a. Find the recurrence relation and give initial conditions to find the number of n-bit strings that do not
have two consecutive 0s. How many such 5-bit string are there?
nx
.
8. a. Show that n
th
Fibonacci number Fn
1 + 5 n2
n 3
2
b. How many integers between 100 and 999 inclusive a) are divisible by 7? b) are not divisible by 4? c) are
divisible by 3 or 4?
d) are divisible by 3 and 4?
e) are divisible by 3 but not by 4?
9. a. In how many arrangements of the letters of the word PHOTOGRAPH are there with exactly 5 letters
s
1
+
1
+
........ + ( 1)
1! 2! 3! 4!
1
n!
10.a. A friend writes a letters to six friends and places them in addressed envelope. In how many ways can he
place the letters in the envelopes so that
a) all the letters in the wrong envelops.
b) at least two of them are in the wrong envelopes
ii. Use mathematical induction to show that n -n is divisible by 3, for n Z
3
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
PART-B
0 1 0
1 0
0 1, 1
0 0
0 1
isomorphic?
b. Define the graph isomorphic and give an example of isomorphic and non-isomorphic graphs.
b. Find all cut vertices and cut edges of the following graph
v2 ), (v4 , v3 )
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
0 1 0
1 0 1
1 1 0
H
G
Define bipartite graph. Show that if G is bipartite simple graph with p vertices
and
q edges then
q
p
2
4
8. a. Define complement of a graph. Find the complement G of the following graph
G.Is it true that G is isomorphic to G . Justify your answer
b. Show that the complete bipartite graph Kn,n has the Hamiltonian cycle. When Kn,n
has
Eulerian circuit? Justify your answer
9
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
9. a. Define the degree of a vertex and prove that the number of vertices of odd
degree is always even.
b. Find the Euler path or an Euler circuit, if it exists, in the following graphs.
B
A
B
A
E
E
10. a. Define a complete graph kn , Draw a complete graph k6 . What is the degree of
each vertex in kn ? What is the total number of edges in kn ?
b. Define complement of a graph. Find the complement G of the following graph
G. Is it true that G is isomorphic to G
G
11.a.If G is a simple graph with n vertices and k components, then the number of
edges is at most ( n k )( n k +1) / 2
b. Prove that a simple graph with n vertices must be connected if it has more than
(n 1) (n 2)
edges
.2
10
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
prove that
,
5. Show that the inverse of an element in a group
6. Find a subgroup of order two of the group
is unique
2 3 4
2 5 1
5 6 is odd.
4 6
ab
2
If f =
2 3
and g =
2 3 4 1
2 3 4
3
find f
gf .
1 4 2
H a , b H
-1
20. Show that the set of all non-zero real numbers is an abelian group under the
11
CSEITQUESTIONS.BLOGSPOT.IN
operation
CSEITQUESTIONS.BLOGSPOT.IN
defined by a b =
CSEITQUESTIONS.BLOGSPOT.IN
ab
2
PART-B
1.a. If S is the set of all ordered pairs (a,b) of real numbers with the binary operation defined
by(a,b) (c,d)=(a+c,b+d), where a,b,c,d are real, prove that (S, ) is a commutative group.
1 2
3 4
andg
b. i. If f =
2 3 4
1 2 3 4
=
ii. ii. If P1 = 1 2 3 4 5 6
1 4
-1
Compute P1 P23. 2 5 1 4 26 1
1
2 3 4 5
and g =
2. a. If f =
gf
and gfg
2
123456
and P2 =
Verify that (P P ) = P
find f
-1
P -1.
42
1 2
2 3
3 4 5
5 2
4 3 1
51 6
2
4 5
b
form an abelian group with respect to matrix multiplication
b a
where a and b are real numbers, not both 0.
3. a. If H1 and H2 are subgroups of a group (G, ) prove that H1 H2 is a group of (G, )
b. Let S be a non-empty set and P(S) denote the power set of S. Verify whether
(P(S), ) is a group.
4. a. Find all non-trivial subgroups of (Z6, +6).
b. Determine whether H = { 0, 5, 10} and k = {0, 4, 8, 12} are subgroups of the group
{Z15, +15}.
5. a. State and prove Lagranges theorem .
b. If f is a homomorphism from a group (G, ) into ( G' , .) then prove that
a) f(e) = e' , where e, e' are the identities of G and G' respectively.
b) f ( a
) = ( f ( a))
for all a G
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
multiplication, where a = 1
-1
8. a. Let G be a group and a G. Show that the map f : G G defined by f(x) = a x a for every x
G is an isomorphism.
c. If H is a group of G such that x2 H x G , Prove that H is normal subgroup of G.
13
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
10. a. Let E = {2,4,6,8,.....}show that (E, +) and (E,) are semi groups, but not monoids. b. If H is a
subgroup of G, among the right cosets of H in G prove that there is only one
subgroup viz. H
11. a. If f is a homomorphism of a group G into a group G then prove that group
H
12. a. Prove that intersection of two normal subgroups of a group will be a normal subgroup. b. Show
that if every element in a group is its own inverse, then the group must be abelian.
1,2,4,5,10,20 .
is a Boolean algebra.
.
.
10. Give an example of a lattice which modular but not distributive.
11. Form the table of operations for the Boolean algebra
, given
Verify whether it is a lattice.
14
, ,0,1
0,1
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
14. Give an example of a lattice that is not distributive and not modular.
15. Let S = {a , b , c} then the power set P ( S ) ={, {a}, {b}, {c}, {a , b}, {a , c}, {b , c}, {a , b , c}}is a poset with
d
19. Define a lattice. Verify whether the lattice given by the Hasse diagram in the figure below is distributive. 1
b
a
c
0
15
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
PART-B
1.a. If poset has a least element, then prove that it is unique.
b. Let (L, ) be a lattice in which and denote the operations of meet and join respectively. For any a ,b
L prove that a b a b = a a b = b
2. a. Let (L, ) be a lattice. For any a,b,c L the following properties called isotonicity hold.
If b c then a) a b a c
b) a b a c
b. Let (L, ) be a lattice . For any a,b,c L the following inequalities known as distributive inequalities hold.
a) a (b c ) ( a b ) ( a c) b) a (b c ) ( a b ) ( a c)
3. a. Show that in a lattice (L, ) if a b and c d , then a) a c b d
b) a b b d
b.
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
CSEITQUESTIONS.BLOGSPOT.IN
is a Boolean homomorphism.
11. a. Let L be lattice, where a*b = glb(a,b) and a b=lub(a,b) for all a,b . Then both binary operations * &
defined as in L satisfies commutative law, associative law, absorption law and idempotent law.
b. Show that in a distributive and complemented lattice satisfied De Morgans law.
12. Show that in a distributive and complemented lattice
17