Академический Документы
Профессиональный Документы
Культура Документы
rffi||ffim|ilililillffillll
.',Regl. No. : ...............o.o...o....o...r..
Name
! ......................o....tt.ofo....
M t82tl
III SemesterB.Tech.EngineeringDegree(Regular/Supplementary)
Examination,November 2010
2K6CS 303 : DISCRETE COMPUTATIONAL STRUCTURES
Max. Marks : 100
Time : 3 Hours
Instruction : Answerall questions.
PART - A
1 . a ) Let 'n' be an integer.Prove that rf n2 is odd then n is odd.
b) Write a note on Predicatelogic.
(8x5=40)
PART - B
2. a) i) Define Tautology and Contingency.Explain with an examplefor each.
ii) Write a note on Unification algorithm.
7
8
OR
b) i) Differentiate betweenConditional and Bioconditional statements.
ii) Write a note on Compactnesstheorems.
7
I
P"T"O,
M 18211
|[]Iililill|tiltffitil
fr
ii) Let S = {?,b, c} and A =P(S). Draw Hassediagramof the posetA with
the partial order c (set inclusion).
OR
b) i) Write a note on Diagonalization.
8
7
OR
b) i) Let G be a group. Each elementa in G has only one inverse in G.
ii) Write a note on Lagrange's theorem.
5. a) i) Write a note on Cyclic codes.
ii) What are Unique factonzation ? Explain.
6
9
7
8
OR
b) i) Explain Division Algorithm in detail.
ii) Write a note on Euclidean Domains.
10
)
J