8
156520
6
D 12609 (Pages : 2) Name.........................................
Reg. No.....................................
3
FIRST SEMESTER (CBCSS—UG) DEGREE EXAMINATION, NOVEMBER 2021
B.C.A.
1
BCA 1C 02—DISCRETE MATHEMATICS
(2021 Admissions)
Time : Two Hours Maximum : 60 Marks
Section A (Short Answer Type Questions)
Answer at least eight questions.
Each question carries 3 marks.
8
All questions can be attended.
Overall Ceiling 24.
1. Define contradiction.
6
2. Define dual of proposition. Write the dual of ( P ∧ Q ) ∨ T
3. Show that ¬P ∧ P is a tautology.
3
4. Explain universal quantifier.
5. Define transitive relation. Show whether the relation R = {<1, 2>, <2, 3>, <1, 3>, <2, 1>} is transitive.
1
6. Define Boolean algebra.
7. Define minterm.
8. Define partially ordered set.
9. Define subgraph of a graph with an example.
10. Define Euler Graph.
11. Define isolated vertex of a graph. Give an example.
8
12. Define an m-ary tree.
(8 × 3 = 24 marks)
Section B (Short Answer Essay Questions)
6
Answer at least five questions.
Each question carries 5 marks.
3
All questions can be attended.
Overall Ceiling 25.
13. Prove distributive law in logic using truth table.
1
14. Show that P —> (Q —> R) ⇔ (P ∧ Q) —> R using laws of logic.
Turn over
156520
156520
6
D 12609 (Pages : 2) Name.........................................
Reg. No.....................................
3
FIRST SEMESTER (CBCSS—UG) DEGREE EXAMINATION, NOVEMBER 2021
B.C.A.
1
BCA 1C 02—DISCRETE MATHEMATICS
(2021 Admissions)
Time : Two Hours Maximum : 60 Marks
Section A (Short Answer Type Questions)
Answer at least eight questions.
Each question carries 3 marks.
8
All questions can be attended.
Overall Ceiling 24.
1. Define contradiction.
6
2. Define dual of proposition. Write the dual of ( P ∧ Q ) ∨ T
3. Show that ¬P ∧ P is a tautology.
3
4. Explain universal quantifier.
5. Define transitive relation. Show whether the relation R = {<1, 2>, <2, 3>, <1, 3>, <2, 1>} is transitive.
1
6. Define Boolean algebra.
7. Define minterm.
8. Define partially ordered set.
9. Define subgraph of a graph with an example.
10. Define Euler Graph.
11. Define isolated vertex of a graph. Give an example.
8
12. Define an m-ary tree.
(8 × 3 = 24 marks)
Section B (Short Answer Essay Questions)
6
Answer at least five questions.
Each question carries 5 marks.
3
All questions can be attended.
Overall Ceiling 25.
13. Prove distributive law in logic using truth table.
1
14. Show that P —> (Q —> R) ⇔ (P ∧ Q) —> R using laws of logic.
Turn over
156520