MCA (CBCS) I Semester Examinations, January-2020

Subject: Mathematical Foundations of Computer Science

Time: 3 Hours

Max. Marks: 70

Note: Answer all questions from Part-A and Part-B.

PART - A (10 x 2 = 20 Marks)

Answer all questions.

1. Define Disjunction and Conjunction.

--- Content provided by⁠ FirstRanker.com ---

2. Write about Indirect method of proof.
3. Define Relations and Functions.
4. Write the properties of Relations.
5. Define Monoid and Abelian Group.
6. Write about Lagrange's Theorem.

--- Content provided by​ FirstRanker.com ---

7. Define Graph and Sub graph.
8. Write about Isomorphism of Graphs.
9. Define Spanning Tree.
10. Write about Minimal Spanning Tree.

PART - B (5 x 10 = 50 Marks)

Answer all questions.

--- Content provided by⁠ FirstRanker.com ---

1. a) Explain about Tautologies and Contradictions with examples.
   (OR)
   b) Explain about Normal Forms.
2. a) Explain about Types of Functions.
   (OR)
   

   --- Content provided by‌ FirstRanker.com ---

   b) Let R be a binary relation on the set of all positive integers such that R = {(a, b) / a – b is an even positive integer}, is R reflexive, symmetric, transitive? Justify your answer.
3. a) State and prove Lagrange's Theorem.
   (OR)
   b) Explain about Properties of Groups.
4. a) Explain about Matrix Representation of Graphs.
   

   --- Content provided by FirstRanker.com ---

   (OR)
   b) Explain about Graph Traversals.
5. a) Explain Kruskal's Algorithm with example.
   (OR)
   b) Explain Prim’s Algorithm with example.

--- Content provided by⁠ FirstRanker.com ---

Visit FirstRanker.com for more question papers.