Total Pages:6 II1-CC-CSc-7

2021
COMPUTER SCIENCE

(Honours)
Paper-CC-CSc-VII

(Discrete Mathematical Structure)

Full Marks: 60

Time: 3 hours

Answer all questions.

The figures in the right-hand margin

indicate marks.

GROUP-A

1. Answer the following questions 1x8

(a Define proposition.

(by Define conditional proposition.

(Turn Over)
 2

(c) Define sum rule.

(Define permutation.
(What is Isomorphism ?
Define cut-set.
(g) Define FSM.
h) What is a regular language?

GROUPB
2. Answer any eight (within two or three
sentences maximum): 1.5 x8
(a) Define set. Give one example.
What is partial ordering well order-
ing?
(c) What do you understand by lattice?

(d) For a set of six true or false questions,

find the number of ways answering all
questions.
IIL-CC-CSc-7 (Continued)
 3)

(e) In
Se) how many ways 4 boys and 4 girls
can be seated in a row so that boys
and girls are alternate?

What is recurrence relation ?

(g) Write the method of characteristic
roots.

(h) Define Euler Circuit.

)Define languageinautomata ?
( Define NFA.

GROUPC

3. Answer any eight (within 75 words maxi-

mum) 2x8

a) The number of possible subset from a

set S having n-element is -

(b) What do you mean by relation ? Give

one example of relation.

1-CC-CSc-7 Turn Over)

 4)

suitable
Discuss function with
e)
example.

Md) What is pigeonhole principle?

on a
e) The number of reflexive relation
set S having n-element is

What is spanning tree ?

cate
gDefine graph. How graphs
are

of
gorized based on the properties
edges?
What do you mean by growth of
(h)
functions ?

i) What is tautology ? Give an example

oftautology.
G) The number of edges possible on a
tree having 'n' vertices is -

II1-CC-CSc-7 (Continued)
 5)

GROUP-D
Answer all questions
(Within 500 words maximum) 6x4

4. Show that ?+2n is divisible by 3 for

all n>=1 by mathematical induction.

Or
Differentiate Relation and Function
with suitable examples and diagrams. Write
down the Reflexive, Symmetric and Tran-
sitive closures of relations with suitable
example.
5. Out of 7 consonants and 4 vowels, how
many words of 3 consonants and 2 vowels
can be formed?

Or
What is Recurrence Relation ? Use
iteration to solve recurrence relation,
a, a - t n with a, 4.
=

I-CC-CSc-7 (Turn Over )

 6
6. Prove that
and k
a
simple graph withn vertices
components can have at most
n-k) (n-k+ 1/2 edges.
Or
Discuss the following terms associated
with a graph G (V, E) with suitable
examples and diagrams : vertex, edge,
adjacent node, degree of node, path, cycle
and self-loop.

7. Design a finite-state automata that will

accept the set of natural numbers x which
are divisible by 3.

Or

Design a DFA and NFA which accepts

set of all strings ending with 00.

1-CC-CSc7
NA-300