JNTU

JNTU B.Tech II MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE Previous Question Paper (February - 2024 - R13)

B.Tech | II | I | R13 | February - 2024

Answer PaperPaper Code: 113BNMaximum Marks: 75Time: 3 Hours

Note: i) Question paper consists of Part A, Part B.
ii) Part A is compulsory, which carries 25 marks. In Part A, answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.

PART – A

1a

Give the truth table for the proportional formula (p→q) ↔ (¬p ∨ q).

2 marks

Answer

pqp → q¬p¬p ∨ q(p → q) ↔ (¬p ∨ q)
TTTFTT
TFFFFT
FTTTTT
FFTTTT

The truth table shows that the formula is a tautology, as the final column consists entirely of true values.

1b

Write the sentence “If 2+3 = 4 then sun rises in the east” in the symbolic form and also write its inverse and converse statement.

3 marks

Answer

Let p represent the statement "2+3 = 4" and q represent the statement "the sun rises in the east". The symbolic form of the conditional statement is p → q.

The converse statement is q → p, which translates to: "If the sun rises in the east, then 2+3 = 4".

The inverse statement is ¬p → ¬q, which translates to: "If 2+3 ≠ 4, then the sun does not rise in the east".

1c

Define equivalence relation.

2 marks

Answer

Sign in to view the complete answer paper.

1d

Differentiate between semi group and sub group.

3 marks

Answer

Sign in to view the complete answer paper.

1e

How many words of three distinct letters can be formed from DUST?

2 marks

Answer

Sign in to view the complete answer paper.

1f

Give the sequential rule for counting problem.

3 marks

Answer

Sign in to view the complete answer paper.

1g

What is closed form expression of the sequence an = 4, n ≥ 0?

2 marks

Answer

Sign in to view the complete answer paper.

1h

Find the coefficient of x32 in (1+x5+x9)10.

3 marks

Answer

Sign in to view the complete answer paper.

1i

State Euler’s formula for a connected planar graph.

2 marks

Answer

Sign in to view the complete answer paper.

1j

What are the advantages and disadvantages of breadth first search algorithm?

3 marks

Answer

Sign in to view the complete answer paper.

PART – B

210 marks
a

Show that the following proportions are contradiction:
i) (p ∧ q) ∧ ¬(p ∨ q)
ii) ¬(p ∧ q) ∧ p

5 marks

Answer

Sign in to view the complete answer paper.

b

Prove the following logical equivalence without using truth table: ((¬p ∨ ¬q) → (p ∧ q ∧ r)) ⇔ (p ∧ q)

5 marks

Answer

Sign in to view the complete answer paper.

OR
3

Describe the rules of inference in predicate logic and verify the validity of the following inference: If one person is more successful than another, then he has worked harder to deserve success. Naveen has not worked harder than Praveen. Therefore Naveen is not more successful than Praveen.

10 marks

Answer

Sign in to view the complete answer paper.

410 marks
a

Explain Warshall’s algorithm with an example.

5 marks

Answer

Sign in to view the complete answer paper.

b

Show that the inclusion relation ⊆ is a partial ordering on the power set of a set A.

5 marks

Answer

Sign in to view the complete answer paper.

OR
510 marks
a

If every element of a group G except the identity element is of order 2, then prove that the group G is abelian.

5 marks

Answer

Sign in to view the complete answer paper.

b

What are the necessary and sufficient conditions for a homomorphism of a group?

5 marks

Answer

Sign in to view the complete answer paper.

610 marks
a

There are 20 boys and 15 girls in LKG while there are 12 boys and 23 girls in UKG. In how many ways can a team of 10 be chosen so that there are 5 girls and 3 UKG students in the team?

5 marks

Answer

Sign in to view the complete answer paper.

b

Enumerate the number of ways of placing 20 indistinguishable balls into 5 boxes where each box is non empty.

5 marks

Answer

Sign in to view the complete answer paper.

OR
710 marks
a

Find the middle term of (x/3 - y/3)9.

5 marks

Answer

Sign in to view the complete answer paper.

b

Find the number of integers between 1 and 1000 which are not divisible by 2, 3, 5 or 7.

5 marks

Answer

Sign in to view the complete answer paper.

810 marks
a

Solve an - 6an-1 + 8an-2 = 4n where a0 = 8, a1 = 22.

5 marks

Answer

Sign in to view the complete answer paper.

b

Solve the following recurrence relation by substitution: an = an-1 + 3n2, Where a0 = 5.

5 marks

Answer

Sign in to view the complete answer paper.

OR
910 marks
a

Solve an - 2an-1 = 1 for n ≥ 1, where a0 = 2.

5 marks

Answer

Sign in to view the complete answer paper.

b

Find a general expression for an using generating functions: an - 3an-1 + 2an-2 = 0, n ≥ 2.

5 marks

Answer

Sign in to view the complete answer paper.

1010 marks
a

Suppose that G is a non directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. Determine the minimum number of vertices G can have.

5 marks

Answer

Sign in to view the complete answer paper.

b

Give an example of 2 non isomorphism graphs of order 6 and size 6 with degree sequence (2, 2, 2, 2, 2, 2).

5 marks

Answer

Sign in to view the complete answer paper.

OR
1110 marks
a

Find the chromatic number of the following graph (Figure 1).

5 marks

Answer

Sign in to view the complete answer paper.

b

Show that the following figure 2 has no Hamiltonian cycle. But the graph has a Hamilton path (Figure 2).

5 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE from JNTU for B.Tech IT II I, February - 2024, R13.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

Loading Question Papers

Fetching data from database...