Scribd
Upload
37 views7 pages

MT 01

This 7-page document contains an exam for a discrete mathematics course, including instructions, questions, and definitions. It is divided into 3 sections: Section A contains 4 long answer questions worth 9.5 marks each, Section B contains 8 short answer questions worth 4 marks each, and Section C contains 10 true/false and multiple choice questions worth 0.5 marks each. The document provides context and questions to test students' knowledge of topics like fields, grammars, boolean functions, trees, graphs, and more.

Uploaded by

Baby
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
37 views7 pages

MT 01

This 7-page document contains an exam for a discrete mathematics course, including instructions, questions, and definitions. It is divided into 3 sections: Section A contains 4 long answer questions worth 9.5 marks each, Section B contains 8 short answer questions worth 4 marks each, and Section C contains 10 true/false and multiple choice questions worth 0.5 marks each. The document provides context and questions to test students' knowledge of topics like fields, grammars, boolean functions, trees, graphs, and more.

Uploaded by

Baby
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/ 7

Total Pages : 7 Roll No. ......................

MT-01
Discrete Mathematics

Bachelor of Science (BSC-12/16)

First Year, Examination, 2019 (June)

Time : 3 Hours] Max. Marks : 40

Note : This paper is of Forty (40) marks divided into three


(03) sections A, B and C. Attempt the questions
contained in these sections according to the detailed
instructions given therein.

SECTION–A/
(Long Answer Type Questions)/

Note : Section 'A' contains four (04) long answer type


questions of Nine and half (9½) marks each. Learners
are required to answer any two (2) questions only.
(2×9½=19)

MT-01
S-250-mt-01 [P.T.O.
P.T.O.
(9½)

1. Every field is an integral domain but its converse is not true.

2. If G = {V, �, S, P} is a grammar, where V = {S, A, B},


� = {a, b, c}.

S is initial symbol and

P = {S � aaS, S � bA, A � cBb, A � cb, B � bbB,


B � bb}

Find language generated by G.


G = {V, �, S, P} V = {S, A, B},
� = {a, b, c}
S

P = {S � aaS, S � bA, A � cBb, A � cb, B � bbB,


B � bb}
G

3. Find Disjunctive Normal Form (DNF) for boolean function

f(x1, x2, x3) = (x1 + x2 + x3) (x1. x2, x1�. x3)�.


f(x1, x2, x3) = (x1 + x2 + x3) (x1. x2, x1�. x3)�
(DNF)
MT-01
S-250-mt-01 [2
2]
4. If height of a binary tree T on n vertices is h then

h + 1 � n � 2h+1 –1.

n T h

h + 1 � n � 2h+1 –1.

SECTION–B/
(Short Answer Type Questions)/

Note : Section 'B' contains eight (08) short answer type


questions of four (04) marks each. Learners are required
to answer any four (04) questions only. (4×4=16)

1. Define cartesian product of sets.

2. What is equivalence relation give one example.

MT-01
S-250-mt-01 [3
3] [P.T.O.
P.T.O.
3. If f : R � R, g : R � R s.t. f(x) = x + 2 and g(x) = x2
then find gof and fog.

f : R � R, g : R � R
f(x) = x + 2 g(x) = x2

gof fog

4. Z4 = {0, 1, 2, 3} is an abelian group for t4 (addition modulo


4).

Z4 = {0, 1, 2, 3} t4

5. A polygon has 44 diagonals. Find the number of its sides.

6. Write powers of an alphabet.

7. Find the solution of homogeneous linear recurrence relation

ar = 4 (ar–1 – ar–2), r � 2, a0 = a1 = 1.

ar = 4 (ar–1 – ar–2), r � 2, a0 = a1 = 1.

MT-01
S-250-mt-01 [4
4]
8. Define spanning trees.

SECTION–C/

(Objective Type Questions)/

Note : Section 'C' contains ten (10) objective type questions


of half (½) mark each. All the questions of this section
are compulsory. (10×½=05)

(½)

Indicate whether the following statements are True or False :

1. If A, B and C are sets then


A × (B � C) = (A × B) � (A × C).

A, B C

A × (B � C) = (A × B) � (A × C).

2. Set of natural numbers is a group for addition.

MT-01
S-250-mt-01 [5
5] [P.T.O.
P.T.O.
3. 5! = 120.

5! = 120.

4. Which language, generate L(G) = {anbn+1, n � 0}, is one


phrase structure grammar.

L(G) = {anbn+1 , n � 0}

5. If a is an element of Boolean algebra <B, +, �, ', 0, 1> then


(a�)� = a.

a <B, +, �, ', 0, 1>


a� � = a.

6. In a graph a vertex is called isolated vertex if its degree is 1.

7. If G is a simple graph, then G � G is a complete graph.

G G�G

8. A graph G is Eulerian graph if every vertex of G is odd


vertex.

G G

MT-01
S-250-mt-01 [6
6]
9. Thickness of K6 is 2.

K6

10. A graph G is connected graph if and only if G have a


spanning tree.
G G

MT-01
S-250-mt-01 [7
7]

You might also like