JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA 2018 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE Previous Question Paper (June/July - 2018 - R17)

MCA | 2018 | I | R17 | June/July - 2018

Answer PaperPaper Code: 841AAMaximum Marks: 75Time: 3hrs

Note: This question paper contains two parts A and B. Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 10 marks and may have a, b, c as sub questions.

Part A

5 x 5 Marks = 25

125 marks
a

Construct the truth table for (P ˄ Q) → (P ˅ Q) .

5 marks

Answer

PQP ˄ QP ˅ Q(P ˄ Q) → (P ˅ Q)
TTTTT
TFFTT
FTFTT
FFFFT
b

Define complement of a function and inverse of a function. Give examples.

5 marks

Answer

The complement of a function f: A → B, denoted as f', is a function where the output is the negation of the original function's output. For a Boolean function f(x), f'(x) = 1 - f(x). Example: If f(x) = x, then f'(x) = 1 - x.

The inverse of a function f: A → B, denoted as f-1: B → A, exists if f is a bijection (one-to-one and onto). It maps each element y in B back to the unique element x in A such that f(x) = y. Example: If f(x) = x + 2, then f-1(x) = x - 2.

c

Find the coefficient of x4y7 in the expansion of (x-y)11.

5 marks

Answer

Sign in to view the complete answer paper.

d

What is meant by generating function? What is its significance?

5 marks

Answer

Sign in to view the complete answer paper.

e

Find the minimum number of vertices in a simple, connected, planar graph with 19 edges. Justify your answer.

5 marks

Answer

Sign in to view the complete answer paper.

Part B

210 marks
a

Using indirect method of proof, derive P → ¬ S from P → Q ˅ R, Q → ¬ P, S → ¬ R, P.

5 marks

Answer

Sign in to view the complete answer paper.

b

Contrast propositional logic with predicate logic.

5 marks

Answer

Sign in to view the complete answer paper.

OR
3

Explain automatic theorem proving with the following expression P, ¬ P ˅ ( P ˅ Q) → Q

10 marks

Answer

Sign in to view the complete answer paper.

410 marks
a

If f : X→Y and g : Y→X the function g is equal to f-1 only if g • f = Ix and f •g = Iy .Prove the result.

5 marks

Answer

Sign in to view the complete answer paper.

b

Let f : R→ R and g : R→R where R is the set of real numbers. Find f •g and g • f where f(x) = x2 - 2, g(x) = x + 4. State whether these functions are injective, subjective or objective.

5 marks

Answer

Sign in to view the complete answer paper.

OR
510 marks
a

Let L a finite distributive lattice. Then prove that every element in L can be written uniquely (except for order) as the join of irredundant join-irreducible elements.

5 marks

Answer

Sign in to view the complete answer paper.

b

Prove the independent laws for the elements of a lattice.

5 marks

Answer

Sign in to view the complete answer paper.

6

Find the number of ways three roses, four marigolds and five hibiscuses can be planted:

10 marks
a

In a row such that all plants of the same family is next to each other.

5 marks

Answer

Sign in to view the complete answer paper.

b

In a row such that the hibiscus are planted in between the other two families of plants.

5 marks

Answer

Sign in to view the complete answer paper.

OR
710 marks
a

Find the number of different arrangements of the letters of the word REFERENCE.

5 marks

Answer

Sign in to view the complete answer paper.

b

State inclusion-exclusion principle.

5 marks

Answer

Sign in to view the complete answer paper.

8

Solve the recurrence relation an - 7an-1 + 26an-2 - 24an-3 = 0 for n >= 2.

10 marks

Answer

Sign in to view the complete answer paper.

OR
9

Demonstrate the solutions for non-homogeneous recurrence relation.

10 marks

Answer

Sign in to view the complete answer paper.

1010 marks
a

Prove that any two simple connected graphs with n vertices and all of degree two are isomorphic.

5 marks

Answer

Sign in to view the complete answer paper.

b

Suppose G1 and G2 are isomorphic prove that if G1 is connected then G2 is also connected.

5 marks

Answer

Sign in to view the complete answer paper.

OR
1110 marks
a

State and explain the Four - Colour problem for planar graphs.

5 marks

Answer

Sign in to view the complete answer paper.

b

Prove that the regions of a planar graph can be 4 - coloured if G has a Hamiltonian cycle.

5 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for MCA 2018 I, June/July - 2018, R17.

For the question paper without answers, switch to the Question Paper tab.

Other papers in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

Loading Question Papers

Fetching data from database...