Madras University (UnOM) 2008 B.C.A Computer Application COMPUTER SCIENCE - Question Paper

ans any 5 ques..

1. discuss Sets and its description.

2. explain about operations on Relations.

3. discuss Truth table with example.

4. explain about Tautology.

5. discuss Regular sets with examples.

6. discuss situation Free language.

7. describe Degree of the node and its kinds.

PART B — (5 × 10 = 50 marks)

ans any 5 ques..

8. discuss the functions and its kinds in detail.

9. discuss the tautological Implications and equivalence of formula.

10. discuss Forms and its kinds in detail.

11. discuss Non-deterministic Finite Automata with example.

12. discuss the Techniques for Turing Machine construction.

13. In a simple graph, G = (V,E) prove that every node of the digraph lies in exactly 1 strong component.

14. In a Simple digraph, the length of any elementary path is less than or equal to n-1, where n is the number of nodes in the graph, similarly the
length of any elementary cycle does not exceed n – Prove.

Earning:   Approval pending.