Scribd
Upload
4 views2 pages

OctoberNovember 2022

The document is an examination paper for the MCA I Semester at Jawaharlal Nehru Technological University Hyderabad, focusing on Mathematical Foundations of Computer Science. It includes various questions on topics such as truth tables, logical equivalences, set theory, algorithms, and graph theory. Students are required to answer any five questions, with each question carrying equal marks.

Uploaded by

muninetwork1
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
4 views2 pages

OctoberNovember 2022

The document is an examination paper for the MCA I Semester at Jawaharlal Nehru Technological University Hyderabad, focusing on Mathematical Foundations of Computer Science. It includes various questions on topics such as truth tables, logical equivalences, set theory, algorithms, and graph theory. Students are required to answer any five questions, with each question carrying equal marks.

Uploaded by

muninetwork1
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/ 2

Code No: 871AA R20

JN
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA I Semester Examinations, October/November - 2022
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
Time: 3 Hours Max.Marks:75
TU
Answer any five questions
All questions carry equal marks
---
H
1.a) Construct a truth table for each of these compound propositions.
i) (𝑃 ↔ 𝑞) ⊕ (𝑝 ↔ ¬𝑞)
ii) (𝑝 ⊕ 𝑞) → (𝑝 ⊕ ¬𝑞)
U
b) State the converse, contrapositive and inverse of each of these conditional statements.
i) If it snows tonight, then I will stay at home.
SE
ii) I go to the beach whenever it is a sunny summer day. [8+7]

2.a) What do you mean by a logical equivalence? Give identity, idempotent, commutative,
associative, distributive and De Morgan’s laws of Boolean algebra.
D
b) Use of rules of inference to show that ∀𝑥 (𝑃(𝑥) → (𝑄(𝑥) ∧ 𝑆(𝑥))) and ∀𝑥(𝑃(𝑥) ∧
𝑅(𝑥)) are true, then ∀𝑥 (𝑅(𝑥) ∧ 𝑆(𝑥)) is true. [8+7]
PA
3.a) Let 𝐴 = {𝑎, 𝑏, 𝑐}, 𝐵 = {𝑥, 𝑦}, and 𝐶 = {0,1}. Find 𝐴 × 𝐵 × 𝐶 and 𝐶 × 𝐵 × 𝐴.
b) Let 𝐴, 𝐵, and 𝐶 be sets. Show that ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅ ̅̅̅̅ ∩ 𝐴̅.
𝐴 ∪ (𝐵 ∩ 𝐶) = (𝐶̅ ∪ 𝐵) [7+8]

4.a) Give examples of different types of correspondences.


PE
b) Find 𝑎8 of the sequence {𝑎𝑛 } if an equals 1 + (−1)𝑛 .
1 1 1
c) Determine whether relation 𝑅 = [0 1 1] is an equivalence relation or not. [5+5+5]
1 1 1
R
5.a) Demonstrate with an example bubble sort algorithm.
S
b) Explain big-omega and big-theta notations with examples. [8+7]

6.a) Prove that the sum of first n positive odd integers is 𝑛2 by mathematical induction.
20
b) Give a recursive definition of the set of positive integers that are multiples of 5. [8+7]

7.a) Explain the following:


22
i) Conditional probability
ii) Independence of events
b) What is the Tower of Hanoi problem? Let 𝐻𝑛 denote the number of moves needed to solve
the Tower of Hanoi problem with n disks. Give a recurrence relation for the
sequence {𝐻𝑛 } . [8+7]
8.a) What are complete and planar graphs? Is 𝐾4 a planar graph? If so give non-planar
JN
embedding of 𝐾4 .
b) Give the order of vertices visited in pre-order, in-order and post-order traversal of the
following tree. [6+9]
TU
H
U
---oo0oo---
SE
D
PA
PE
R
S
20
22

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy