Code No: 811AA
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
--- Content provided by FirstRanker.com ---
MCA I Semester Examinations, June/July - 2018
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
Time: 3hrs Max.Marks:60
Note: This question paper contains two parts A and B.
Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.
--- Content provided by FirstRanker.com ---
PART - A 5 x4 Marks =20
- a) Find the disjunctive Normal form of ~(p(qAr)). [4]
- b) Discuss about Semi-group Homomorphism with example. [4]
- c) How many ways can we get sum of 4 or 8 when two distinguishable dice are rolled? How many ways can we get an even sum? [4]
- d) Find the generating function of (n-1)>. [4]
- e) Draw the binary tree whose level order indices are { 1,2,4,5,8,10,11,20 }. [4]
--- Content provided by FirstRanker.com ---
PART -B 5 x 8 Marks = 40
-
2. Define Well Formed Formula. Explain about Tautology with example. [8]
OR
3. Show that RA(P VQ) is a valid conclusion from the premises PVQ, Q—R, P—M and M. [8]
--- Content provided by FirstRanker.com ---
-
4. Let A be a given finite set and p (A) its power set. Let € be the inclusion relation on the elements of p (A). Draw Hasse diagram of { p (A), € ) for
a)A={a}; b)A={ab}; c)A={a,b,c}; d) A= {a, b, c, d} [8]
OR
5. Let a={1,2,3,4} and f and g are functions from A to A given by = {(1,4), (2,1), (3,2), (4,3)} and g= {(1,2),(2,3),(3.4),(4,1)} prove that f and g are inverse of each other. [8]
--- Content provided by FirstRanker.com ---
-
6. Find the number of permutations of the letters of the word MASSASAUGA
a) In how many of these, all four A’s are together?
b) How many of these of them begin with S? [4+4]
OR
--- Content provided by FirstRanker.com ---
7. Explain multinomial theorem and find binomial coefficient of x4 y2 in (3x + 4y) 2.[8]
-
8. Discuss about method of characteristic roots with an example. [8]
OR
9. Find a general expression for a solution to the recurrence relation an-5an-1 +6an-2=n(n-1) for n=2 [8]
--- Content provided by FirstRanker.com ---
-
10. Explain kruskal’s algorithm to find minimal spanning tree of a graph with suitable example. [8]
OR
11. What is the chromatic number of the following?
a) Cn b) Kn c) Km,n d) Tree with n vertices. [8]
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUH MCA 1st Sem Last 10 Years 2023-2013 Question Papers R20-R09 || Jawaharlal nehru technological university