[2] MCS-212

(b) Show that 5 is irrational using the proof

No. of Printed Pages : 7 MCS-212
by contradiction. 5
MASTER OF COMPUTER
(c) If A = {a, b, c} and B = {x, y, z}, find :
APPLICATIONS

o m 2+2+1

(MCA) (NEW) (i)

u
A×B
.c
Term-End Examination
u r
(ii) A × A

December, 2021

nt G (iii) A × ϕ

(d) Find the regular expression for the

MCS-212 : DISCRETE MATHEMATICS
e
m
language : 3
Time : 3 Hours Maximum Marks : 100

i gn L = {aa, aba, abba, abbba, .........}

Note : Question No. 1 is compulsory and carries

s s (e) Give one difference between Deterministic

U A
40 marks. Attempt any three questions from Finite Automata and Non-deterministic

Finite Automata. 2

N O
the rest four questions (Question Nos. 2 to 5).
(f) Find the order and degree of the following

(i) p qr I G
1. (a) Make the truth table for : 5 recurrence relations :

(i) an  an1  an2

3

(ii) pqr  pr (ii) an  an1  an22

P. T. O.
 [3] MCS-212 [4] MCS-212

(g) Determine the number of integer solutions 2. (a) What is a tautology ? Find, if the following
of the equation ; 4 is a tautology : 5

( x1  x2  x3  x4 )  7 , [( p  q )   q ]   p

om
(b) Explain how principle of mathematical
where xi  0 for all i = 1, 2, 3, 4.
induction can be used to prove : 8
(h) How many three-letter words, which has

u . c n

r
12  22  32  ...... n 2  (n  1) (2n  1), n  N
vowel in the middle position, can be formed 6
using the letter of English alphabets ? 3

G u
(c) Find the Boolean expression for the output
(i) Consider graph G = K4 on four vertices

nt of the logic circuit given below : 3

a, b, c, d. Make three sub-graphs of

e
graph G. 3

n m
(j) Show that C6 is a bipartite graph. 3

s i g
(k) Does the following graph have Eulerian

A s
circuit ? If yes, give the Eulerian circuit, if
no, explain the reasons :

O U 4 (d) Find, if the following Boolean expressions

N
are equivalent over the two-element

G
Boolean algebra B = {0, 1} : 4

I X  ( a  b )  ( a  c ) and Y  a  (b  c)

3. (a) Find the power set of the set A = {a, b, c, d}.

P. T. O.
 [5] MCS-212 [6] MCS-212

(b) If A = {1, 2, 3, 4} and B = {2, 3, 4, 5, 6, 7} (ii) Give one string that will be accepted
and f : A → B is f (x) = x + 1, then find the and one string that will not be

domain and range of f. 4 accepted by this finite automata. 3

4. (a) If there are 7 men and 5 women, how many

m
(c) If f ( x)  x 2 and g ( x )  x  1 , then find
circular arrangements are possible in
f o g (x) and (g o f) (x). 4

.c o
which women do not sit adjacent to each

u
other ? 5
(d) Explain the meaning of each symbol
in the finite automata definition

u r
(b) What is the probability that a number

G
M = (Q, Σ, δ, q0, F). 3 between 1 to 1,000 is divisible by
(e) Consider the following finite automata :

nt neither 2, nor 3 nor 5 ? 5

e (c) What is the meaning of ‘distributions’ of

m
objects ? Explain with the help of an

i gn example. 5

s
(d) Explain the Fibonacci numbers. Also

A s explain the
Fibonacci numbers.
recurrence relation for
5

O U 5. (a) Define the following terms in the context of

N
a graph, with the help of an example : 8

(i)
I G
What would be the values of Q, Σ, δ, q0
(i) Digraph

(ii) Complete graph of three vertices

and F for the automata given above ? (iii) Degree of a vertex

3 (iv) A regular graph

P. T. O.
 [7] MCS-212

(b) Explain the terms tree and forest in the

context of graphs, with the help of an
example. 5

(c) What are Hamiltonian graphs ? Explain

with the help of an example. 5

o m
(d) State the travelling salesperson problem. 2

u.c
u r
nt G
e
n m
s i g
A s
O U
G N
I
MCS–212

P. T. O.
 No. of Printed Pages : 5 MCS-212

om
MASTER OF COMPUTER APPLICATIONS
(MCA-NEW)
Term-End Examination

.c
June, 2022

u ru
tG
MCS-212 : DISCRETE MATHEMATICS

Time : 3 hours Maximum Marks : 100

en
Note : Question no. 1 is compulsory and carries
40 marks. Attempt any three questions from
m
questions no. 2 to 5.
ign

1. (a) Write the mathematical notation for the

following : 4
(i) The set of all odd numbers
ss

(ii) The set of all natural numbers whose

square is more than 26
UA

(b) Assuming that p and q are two

propositions, find if the following two
NO

statements are logically equivalent or not,

by constructing the truth table. 5
 (p  q)   q and (p   q)  q
IG

MCS-212 1 P.T.O.
 (c) Use the principle of mathematical

om
induction to prove that
n(n  1)
1 + 2 + 3 + ... + n = for each n  N. 5
2

.c
(d) Define the term regular expression with
the help of an example. 5

ru
(e) How many different permutations are
possible of the letters, taken all at a time,

u
of the word : ASSESSES ? 3
(f) A die is rolled once. What are the

tG
probabilities of the following events : 4
(i) Getting an odd number
(ii)
en
Getting at least a value 2
(iii) Getting at most a value 2
m
(iv) Getting at least 7
(g) Define the problem of the Tower of Hanoi.
ign

Explain the recurrence relation to solve

this problem. 6
(h) Draw a hypercube graph Q3 (also called the
ss

cubical hypercube). 3
(i) Find, if the following graphs G1 and G2 are
UA

isomorphic or not. Explain how you arrived

at your answer. 5
NO
IG

MCS-212 2
 2. (a) Define the degree and order of a recurrence

om
relation. Find the degree and order of the
following recurrence relations : 6
(i) an = a 2n 1 + an–2 an–3 an–4

.c
(ii) an = nan–2 + 2n

ru
(b) What is a finite automata ? Why is it
needed ? How is a finite automata

u
represented ? Explain with the help of an

tG
example. 8

(c) What is divide-and-conquer approach ?

en
Explain how this approach can be used to
apply binary search in a sorted list. 6
m

3. (a) What is proposition ? Explain with the help

of an example. Explain Disjunction and
ign

Conjunction with the help of truth table for

each. 6
ss

(b) Prove the following theorem by direct proof

method :
UA

‘‘The square of an even integer is an even

integer.’’ 6
NO

(c) Given the Boolean expression

(a  (b  c))  (b  d), draw the
corresponding circuit, where a, b, c and d
IG

are the inputs to the circuitry. 8

MCS-212 3 P.T.O.
 4. (a) Show the intersection and difference
operation on two sets using Venn diagram. 4

om
(b) Define the terms Domain, Co-domain and
Range in the context of a function. Also find
the domain, co-domain and range for a
function A to B, where A = {1, 2, 3, 4} and

.c
B = {1, 4, 9, 16, 25}. 6

ru
(c) A committee consisting of 2 male and
2 female workers is to be constituted from
8 male and 9 female workers. In how many

u
distinct ways can this be done ? 4

tG
(d) Show, using the pigeonhole principle, that
in any group of 30 people, 5 people can
en
always be found who were born on the
same day of the week. 3
(e) Find how many of the four digit numbers
m
are even. 3
ign

5. (a) Define the following in the context of graph,

with the help of an example : 6
(i) Complete graph
ss

(ii) Star topology

(iii) Degree of a vertex
UA

(b) Find the complement of the following

graph : 5
NO
IG

MCS-212 4
 (c) What is a bipartite graph ? Explain with
the help of an example. 4

om
(d) Differentiate between Eulerian graph and
Eulerian circuit. Find the Eulerian circuit
in the following graph, if it exists. 5

.c
u ru
tG
en
m
ign
ss
UA
NO
IG

MCS-212 5 P.T.O.
 No. of Printed Pages : 4 MCS-212

om
MASTER OF COMPUTER
APPLICATIONS (MCA) (NEW)

u.c
Term-End Examination
December, 2022

ur
MCS-212 : DISCRETE MATHEMATICS

tG
Time : 3 Hours en Maximum Marks : 100

Weightage : 70%
Note : (i) Question No. 1 is compulsory
m

(ii) Attempt any three questions from the

ign

rest.
ss

1. (a) Differentiate between predicate and

proposition. Also, write De Morgan’s laws
for both. 5
UA

(b) Use De Morgan’s law to derive AND gate

from NOR gate. 5
NO

(c) Explain the conditions for a relation to be

an equivalence relation. 5
(d) Prove that S* = (S*)* = S**, where S is a
IG

set of strings. 5

P. T. O.
 [2] MCS-212

(e) Briefly discuss non-deterministic Turing

machine. 5

om
(f) What is addition principle ? Use addition
principle to solve the following case : 5

u.c
“Say there are three political parties P1 , P2
and P3 having 4, 5 and 6 members

ur
respectively.” In how many ways we can
select two persons from same party to

tG
become President and Vice President ? 5

(g) What is power set ? Find the power set for

en
the following given sets : 5

A : {0, 1, 3, 5}
m

B : {φ, A, B, C, E}
ign

(h) Briefly discuss Pigeon hole principle with

suitable example. 5
ss

2. (a) Using induction, verify : 5

n n
1 + 5  1 − 5 
UA

=5 fn   −  n ≥1
 2   2 

(b) Define “Stirling number of the second

NO

kind.” Calculate S32 and S24 . 5

(c) Explain Handshaking theorem with

IG

suitable example. 5
 [3] MCS-212

(d) What is a spanning tree ? Can we have a

unique spanning tree ? Draw three

om
spanning tress for the graph given below : 5

u.c
ur
3. (a) For any two propositions x and y, verify
that : 5

tG
~ ( x ∨ y) = ~ x ∧ ~ y
en
(b) Find the number of three-letter words that
can be formed using the letters of the
English alphabet. How many of them end
m

in ‘x’ ? How many of them have a vowel in

the middle position ? 7
ign

(c) What is regular expression ? Find a

regular expression to describe each of the
ss

following languages : 2+3+3

(i) {a, b, c}
UA

(ii) { ∧ , a, abb, abbbb .......}

4. (a) Differentiate between the following : 10
NO

(i) Deterministic finite automata and

Non-deterministic finite automata
(ii) Moore machines and Mealy machines
IG

(b) Briefly discuss the Halting problem. 5

P. T. O.
 [4] MCS-212

(c) A box contains 3 red, 3 blue and 4 white

balls. In how many ways can 8 balls be

om
drawn out of the box, one at a time
provided order is important ? 5

u.c
5. (a) Determine the recurrence relation and
iterative relation for the power set p (S) of
set ‘S’. 10

ur
(b) Write short notes on the following : 2×5=10

tG
(i) Path in a graph

(ii) Circuits in a graph

en
(iii) Cycles in a graph

(iv) Degree of vertex

m

(v) Regularity of graph

ign
ss
UA
NO
IG

MCS–212
 No. of Printed Pages : 4 MCS-212

om
MASTER OF COMPUTER
APPLICATIONS (MCA) (NEW)

u.c
Term-End Examination

ur
June, 2023
MCS-212 : DISCRETE MATHEMATICS

Time : 3 Hours
tG Maximum Marks : 100
en
Weightage : 70%
m
Note : (i) Question No. 1 is compulsory

(ii) Attempt any three questions from the

ign

rest.

1. (a) Verify that a  b  ~ a is a contradiction

ss

and (a  b)  (~ a  b) is a tautology. 5

(b) Reduce the Boolean expression

UA

(X1  X2 )  (X1  X2 ) to its simplest form.5

NO

(c) Find inverse of the function f ( x)  x3  3 . 5

(d) What is Kleene closure ? Find Kleene

IG

closure for   {0,1} . 5

P. T. O.
 [2] MCS-212

(e) What is multiplication principle ? Use it to

om
find the number of ways to choose two

persons as President and Vice President

u.c
from a party of 35 members. 5

(f) Briefly discuss Inclusion-Exclusion

ur
principle with suitable example. 5

tG
(g) What is Eulerian graph ? Explain with the

help of a suitable diagram. 5

en
(h) What is Tautology ? Show that the given
m
expression is a tautology : 5
ign

[( p  q) ~ q]  ~ p .

2. (a) Using induction, show that : 5

ss

Tn  2n  1, n  1.
UA

(b) In how many ways can 20 employees be

NO

assembled into 3 groups ? 5

(c) Explain isomorphic graphs with suitable

IG

example. 5
 [3] MCS-212

(d) What are Bipartite graphs ? Show that C6

om
is a Bipartite graph : 5

u.c
ur
3. (a) Check whether (~ p  q) and ( p  q) are

logically equivalent. 5

tG
(b) What is chromatic number of a graph ?
Draw a graph with chromatic number 5. 5
en
(c) Write short notes on the following : 10
m

(i) Hamiltonian Graph

(ii) Vertex Cover Problem

ign

4. (a) Show that the number of words of length

‘n’ on an alphabet for ‘m’ letters is mn. 5
ss

(b) Construct the logic circuit and truth table

UA

for the given expression : 5+5

x1  ( x2  x3 ) .
NO

(c) Given two switches, a battery and bulb

design the Boolean circuit for AND gate
IG

and OR gate. 5

P. T. O.
 [4] MCS-212

5. (a) Briefly discuss the following with suitable

om
example for each : 5

(i) Finite Automata

u.c
(ii) Regular expression

(b) Differentiate between Turing Acceptable

ur
Language and Turing Decidable Language.

tG
(c) If Cn is the number of comparisons
en
required to sort a list of n integers,
determine the recurrence relation and
m
iterative relation for Cn. 10
ign
ss
UA
NO
IG

MCS–212 5,980