| - CS201 DISCRETE COMPUTATIONAL STRUCTURES [S3] KTU B TECH MODEL QUESTIONS |QUESTION PAPER PATTERN | IMPORTANT QUESTIONS FOR SECOND YEAR STUDENTS | QUESTION BANK


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

CS201 DISCRETE COMPUTATIONAL STRUCTURES [S3] KTU B TECH MODEL QUESTIONS |QUESTION PAPER PATTERN | IMPORTANT QUESTIONS FOR  SECOND YEAR STUDENTS | QUESTION BANK,ktu Discrete computational structures important questions,Discrete computational structures ktu btech questions,Discrete computational structures previous questions,Discrete computational structuresquestions,ktu Discrete computational structures questions,ktu s1,ktu s2,ktu s1 s2 Discrete computational structures,ktu Discrete computational structures questions,ktu CS Discrete computational structures important questions,CS Discrete computational structures ktu btech questions,CS Discrete computational structures previous questions,CS Discrete computational structures questions,ktu CS Discrete computational structures questions,ktu s1,ktu s2,ktu s1 s2 CS Discrete computational structures,Computer engineering Discrete computational structures Important Questions

PART A

( Answer All Questions Each carries 3 Marks )

1.Differentiate between a partition and Covering of a Set with an example.

2.Give an example of an equivalence relation.

3.State Principle of inclusion exclusion.

4.51 numbers are chosen from the integers between 1 and 100 inclusively.
Prove that 2 of the chosen integers are consecutive.

PART B

( Answer any TWO, Each carries 9 Marks )



5.(a) For any two sets A and B Show that A – (A∩B) = A – B. (4 marks)
(b)  Let R and S be two relations on a set of positive integers I.

R={ <x, 2x>/ xεI} S= { <x, 7x>/ xεI}   Find RoS, RoR, RoRoR, RoSoR. (5 marks)
6.( a) Explain Pigeon Hole Principle with example. (4 marks)

( b) Five friends run a race everyday for 4 months (excluding Feb). 

If no race ends in a tie, show that there are at least 2 races with identical outcomes. (5 marks)

7.(a) Let a0=1, a1= 2, a2 = 3. an= an-1+ an-2+ an-3 for n ≥ 3 Prove that an ≤ 3n (5 marks)

(b) Draw the Hasse Diagram of (P(A), ≤) where ≤ represents A ⊆ B and A ={ a, b, c } (5 marks)

PART C

( Answer All Questions Each Carries 3 Marks )

8.Let (A,.) be a Group. Show that. 

9.List out the properties of a ring.

10.Prove that the Zero element and Unit element of a Boolean algebra B are unique?

11.Simplify the following Boolean expression.
 (a ⋀ b ) ⋁c) ⋀ (a ⋁ b ) ⋀c)

CLICK HERE FOR MORE QUESTIONS


No comments:

Powered by Blogger.