Scribd
Upload
5 views

Discrete Mathematics For Computer Science

Uploaded by

Ramya Shaun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Discrete Mathematics For Computer Science

Uploaded by

Ramya Shaun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

STELLA MARIS COLLEGE (AUTONOMOUS) CHENNAI 600 086

(For candidates admitted during the academic year 2019 – 20)

SUBJECT CODE: 19CS/PC/DM14

M. Sc. DEGREE EXAMINATION, NOVEMBER 2019


INFORMATION TECHNOLOGY
FIRST SEMESTER

COURSE : MAJOR CORE


PAPER : DISCRETE MATHEMATICS FOR COMPUTER SCIENCE
TIME : 3 HOURS MAX. MARKS: 100

SECTION - A
Answer ALL the questions. (10x2=20)

1. Define Lattice.
2. What is Pseudo code?
3. Prove that (p→q)v(q→p) is a tautology.
4. List out the types of normal forms.
5. Write the examples for predicate logic.
6. Differentiate universal quantifier and existential quantifier.
7. State Pigeon-hole principle.
8. Define algorithm.
9. When the matrix is called as an adjacency matrix?
10. What are the uses of decision tree?

SECTION - B
Answer any SIX of the following questions: (6x5=30)

11. Explain briefly the algorithm for computing square root.


12. Discuss briefly about combinatorial network?
13. Differentiate symmetric and antisymmetric relations.
14. Write short notes on automating logic.
15. Explain briefly about adjacency matrix.
16. Explain in detail restricted quantification.
17. Prove that P≠NP conjecture.
18. What is the strong form of mathematical induction?

SECTION - C
Answer any FIVE of the following questions: (5x10=50)

19. Explain about binary search with example.


20. Write the algorithm to generate perfect square with example.
21. Write in detail about the steps to convert DNF to CNF
22. Explain about the problems in divisors and schedules.
23. Explain Pigeon-hole principle.
24. Explain Hamiltonian cycle with example.
25. Write short notes on the following.
I. Directed trails.
II. Paths.
III. Circuits and cycles.

************

You might also like