MC(A)/UG/S-II/21

END SEMESTER EXAMINATION OF SEMESTER – II (UG), 2021

SUBJECT- COMPUTER SC
PAPER- COSC-4 -Discrete Structures (Th)
FULL MARKS-40 TIME :2hrs

Instructions to the students: Answer two questions of 20 marks, one from each group in
A4 size paper in own hand-writing within – 2pages of A4-size paper (two single-side of A4-
size paper).
Each page of the answer sheet must contain:
Name of the Examination:
Student ID-No.----, class Roll No.-----------,Subject:......, Paper no.--------, Date of Exam:-----
--, Signature of the student.---

Answer two questions: one question from each group: 20x2=40

GROUP-A
(Answer any one : 1 x 20=20 )
1. i) How many 4-digits numbers can be formed by using the digits 2, 4, 1, 6. when repe-
tition ofdigits is allowed. ii) Solve the recurrence relation ar+2 − 3ar+1 + 2ar=2r; r ≥ 0
given a0 = 3, a1 = 6. iii) Solve the generating function ur − ur−1 − 2ur−2=0; with u0 = 5,
u1 = −3. iv) Write a short note on Konigsburg Bridge problem. 5+5+7+3
2. i) Consider the following statements:
P : He is coward.
Q: He is lazy.
R: He is rich
write the following compound statements in the symbolic form.
(a) He is either coward or poor.
(b) He is rich or else he is both coward and lazy.
n n−1
ii) Determine the value of 3 × P4 = 7 × P4.
iii) Distinguish between simple graph and multi graph with proper example.
iv) Obtain the principal disjunctive and conjunctive normal forms:
(p → (q ∧ r)) ∧ (¬p → (¬q ∧ ¬r))
v) A relation R is defined on the set Z by ”aRb if and only if a − b 1s divisible by 5” for a,
b ϵ Z. Examine if R is an equivalence relation on Z. 4+3+4+4+5

GROUP-B
(Answer any one : 1 x 20=20 )
3. i) In the ’Discrete Structures Paper there are 8 questions. In how many ways examiner
select five questions in all if first question is compulsory.
ii) Prove that n(n+1)(n+2) is a multiple of 6.
 iii) Prove the following by Mathematical Induction: 12 +22 +32 +..........+(−1)n+1n2 =
(−1)n+1n(n+1)
/2 .
iv) Prove that a tree with n vertices has (n-1) edges.
v) Distinguish between Hamiltonian path and circuit. 3+5+5+4+3
4. i) Write an algorithm for shortest spanning tree. Explain the algorithm stepwise with an ex-
ample. Define tree. Prove the following (Without Constructing the truth table) :
¬p → (q → r) ≡ q → (p V r). (5+5)+5+5