[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 2+2+1
(MCA) (NEW) (i) A×B
(ii) A × A
Term-End Examination
(iii) A × ϕ
December, 2021
(d) Find the regular expression for the
MCS-212 : DISCRETE MATHEMATICS
language : 3
Time : 3 Hours Maximum Marks : 100 L = {aa, aba, abba, abbba, .........}
Note : Question No. 1 is compulsory and carries (e) Give one difference between Deterministic
40 marks. Attempt any three questions from Finite Automata and Non-deterministic
Finite Automata. 2
the rest four questions (Question Nos. 2 to 5).
(f) Find the order and degree of the following
1. (a) Make the truth table for : 5 recurrence relations : 3
(i) p qr (i) an an1 an2
(ii) pqr pr (ii) an an1 an22
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
(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
n
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
(c) Find the Boolean expression for the output
(i) Consider graph G = K4 on four vertices of the logic circuit given below : 3
a, b, c, d. Make three sub-graphs of
graph G. 3
(j) Show that C6 is a bipartite graph. 3
(k) Does the following graph have Eulerian
circuit ? If yes, give the Eulerian circuit, if
no, explain the reasons : 4 (d) Find, if the following Boolean expressions
are equivalent over the two-element
Boolean algebra B = {0, 1} : 4
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
(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 which women do not sit adjacent to each
other ? 5
(d) Explain the meaning of each symbol
in the finite automata definition (b) What is the probability that a number
M = (Q, Σ, δ, q0, F). 3 between 1 to 1,000 is divisible by
(e) Consider the following finite automata : neither 2, nor 3 nor 5 ? 5
(c) What is the meaning of ‘distributions’ of
objects ? Explain with the help of an
example. 5
(d) Explain the Fibonacci numbers. Also
explain the recurrence relation for
Fibonacci numbers. 5
5. (a) Define the following terms in the context of
a graph, with the help of an example : 8
(i) Digraph
(ii) Complete graph of three vertices
(i) What would be the values of Q, Σ, δ, q0
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
(d) State the travelling salesperson problem. 2
MCS–212
P. T. O.
