We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Total No. of Questions : 8] [Total No. of Printed Pages : 2
Note:
Roll No
CS-3005-CBGS
B.E. III Semester
Examination, December 2020
Choice Based Grading System (CBGS)
Discrete Structures
Time : Three Hours
Maximum Marks : 70
i) Attemptany five questions
ii) All questions carry equal marks.
1. a) Among integers 1 to 300, how many of them are divisible
neither by 3, nor by 5, nor by 7? How many of them are
divisible by 3 but not by 5, nor by 7?
b) Prove by mathematical induction:
14447+...+Gn—2)=2n Gn-1)
2. a) Prove:
i) Ax(BAC)=(AxB)N(AxC)
ii) Ax(BUC)=(AxB)U(AxC)
b) Explain Pigeonhole principle with an example.
1
3. a) Show that the mapping f: R—>R, f(x) = —..x#0 and
x€ R is one-one onto, where R is the set of non-zero real
numbers.
b) Prove that every finite group G is isomorphic to a per
mutation group.
€S-3005-CBGS Pro
https:/www.rgpvonline.com4. a)
b)
5. a)
b)
6. a)
b)
7. a)
b)
2)
Show that
[(pAq)= p]=(9A~ 4) is acontradiction.
‘Show that the language
Lalas
m=i°,i 21} is nota finite state
Prove by truth table that the following formula are
tautologies
) -q>~pP)q=p>Peg
i) (Peqan>-r>~p)
Explain Pigeonhole principle with an example.
Find the shortest path of the following graph.
pops
Define chromatic number with diagram.
Solve the recurrence relation
4,42 6d yy) #9 =3(2") +73"), 20
given test ap= 1 anda, = 4.
Explain Binomial theorem and prove it. Take any one
example to illustrate the theorem.
8. Write short notes:
a)
c)
d)
CS-3005-CI
Properties of Lattice
Muttinomial coefficients
Graph coloring
Universal and existential quantition
bis
https:/www.rgpvonline.com