Scribd
Upload
75 views2 pages

Mca 1 Sem Discrete Mathematics Rca 103 2018

This document contains a discrete mathematics exam from 2017-2018 with 7 sections and multiple choice, short answer, and proof questions. The exam covers topics such as power sets, logic, equivalence relations, partial orders, recurrence relations, Boolean algebra, and quantifiers. It tests students' understanding of fundamental discrete math concepts as well as their ability to apply rules of inference, solve word problems, and prove statements. The exam is divided into different sections with varying point values and question types to comprehensively evaluate students' discrete math knowledge and skills.

Uploaded by

fictionalmenslove
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
75 views2 pages

Mca 1 Sem Discrete Mathematics Rca 103 2018

This document contains a discrete mathematics exam from 2017-2018 with 7 sections and multiple choice, short answer, and proof questions. The exam covers topics such as power sets, logic, equivalence relations, partial orders, recurrence relations, Boolean algebra, and quantifiers. It tests students' understanding of fundamental discrete math concepts as well as their ability to apply rules of inference, solve word problems, and prove statements. The exam is divided into different sections with varying point values and question types to comprehensively evaluate students' discrete math knowledge and skills.

Uploaded by

fictionalmenslove
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

www.aktuonline.

com

Printed pages: 2 Paper id: 1403 Sub Code: RCA103

M.C.A.
(SEM I) THEORY EXAMINATION 2017-18
DISCRETE MATHEMATICS
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
2. Any special paper specific instruction.

SECTION A

1. Attempt all questions in brief. 2 x 7 = 14


a. What do you mean by power set? Illustrate with an example.
b. Let f and g: R → R, be defined as follows:
f(x) = x + 2, g(x) = 1 / (x2 + 1). Compute f o g(x)
c. State and prove De Morgan‟s law for logic.
d. What do you mean by equivalence relations?
e. Draw the hasse diagram of poset (D72, „|‟). „|‟ represent the divisibility operation.
f. Write and prove „Modus Ponens‟ rule of inference.
g. Let A = {1, 2, 3, 4, 5, 6}. Compute (4, 1, 3, 5) o (5, 6, 3).
www.aktuonline.com

SECTION B

2. Attempt any three of the following: 7 x 3 = 21


a. Show that for any two sets, A and B:
A - (A ∩ B) = A - B.
Also draw Venn diagrams for both.
b. Define linearly orders set and partially ordered set. Explain the properties, a poset
must satisfy?
c. Using mathematical induction, show that 11n+1 + 122n-1 is divisible by 133 for all n ≥ 1.
d. Solve the following recurrence relations:
(i) fn =5 fn-1 +6 fn-2
(ii) dn = 2dn-1 – dn-2
e. Prove the validity of the following argument without using truth table:
“If I get the job and work hard, then I will get promoted. If I get promoted, then I will
be happy. I will not be happy. Therefore, either I will not get the job or I will not work
hard”.

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Prove that the relation “Congruence Modulo m”, given by „Ξ‟ = { (x, y) | x – y is
divisible by m}, over the set of positive integers is an equivalence relation.
Also, show that if X1 Ξ y1 and x2 Ξ y2, then (x1 + x2) Ξ (y1 + y2)
(b) What do you mean by function? Explain different types of functions with proper
examples.
4. Attempt any one part of the following: 7x1=7
(a) Define Supremum and infimum for a partial order. Determine LUB and GLB of
following subsets for Hasse diagram given below:
(i) {a, b, c}
(ii) {f, g, h}
www.aktuonline.com
www.aktuonline.com

(b) What do you mean by distributed lattice and complemented lattice? Consider the
bounded lattice L, given below. Check whether it is distributive or not.

5. Attempt any one part of the following: 7x1=7


(a) Use a K-map to find a minimal sum for:
www.aktuonline.com

E = y‟t‟ + y‟z‟t + x‟y‟zt + yzt‟


Also draw the circuit diagram for the expression obtained.
(b) Define minterms and maxterms with examples. Express the Boolean function f (x, y,
z) = x + y‟z as a sum of minterms.
6. Attempt any one part of the following: 7x1=7
(a) Write the following conditional statement in symbolic form. Also give the converse,
inverse and contra-positive of the statement:
“If the flood destroys Mohan‟s house or the fire destroy Mohan‟s house, then Mohan‟s
insurance company will pay him.”
(b) What do you mean by existential quantifiers and universal quantifiers? Explain with
proper examples.
Find a counterexample, if possible, to these universally quantified statements, where
the domain for all variables consists of all integers.
(i) ∀x(x2 ≥ x)
(ii) ∀x(x > 0 ∨ x < 0)
(iii) ∀x(x = 1)

7. Attempt any one part of the following: 7x1=7


(a) Solve the following linear nonhomogeneous recurrence relation with
constant coefficient:
an = 5an−1 + 6an−2 + 3.5n where a0 = 4 and a1 = 7
Verify your answer for a2.
(b) Write short notes on following:
(i) Poyla‟s Counting Theorem
(ii) Pigeonhole Principle

www.aktuonline.com

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