Scribd
Upload
12 views3 pages

DM2020

Discrete mathematics

Uploaded by

ppawah04
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
12 views3 pages

DM2020

Discrete mathematics

Uploaded by

ppawah04
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/ 3

Total No.

of Questions 9 [Total Pages: 3

(2000)

5094
B.Tech. IVth Semester (CSEIT) Examination
DISCRETE MATHEMATICS AND
LOGIC DESIGN (CSE)
Paper CS-4001

Time Three Hours [Maximum Marks: 100

The candidates shall limit their answers precisely within the


answer-book (40 pages) issued to them and no supplementary/
ontinuation sheet will be issued.

Note Attempt five questions in all, by selecting one question


each from Section A, B, C and D. Section-E is
compulsory.

SECTION-A

1. What is propositional logic ? Discuss the most common


logical connectives with examples. 20

2. What are Quantifiers ? Discuss the 2 types of Quantification.


20

5094/200/7T7/421 P.T.O
SECTION-B

3. Discuss the discrete probability distribution. Differentiate


between permutations and combinations. 20

4. Define the Binary Relation. Discuss the properties of Binary


Relations. 20

SECTION-C

5. Write short note on:

(a) Paths and Circuits.


b) Shortest paths in weighted Graph.
(c) Eulerian path and circuits. 20

6. What is spanning tree ? Write an Algorithm for Minimum


Spanning tree taking suitable example.

SECTION-D

7. Define Recurrence Relation. Solve the Recurrence relation

F SF-1 - 6F,2 where F = 1 and F, = 4. 20

8. Write short notes on:

(a) Rings.
b) Groups.
(c) Integral Domain. 20

5094/200/777/421 2
SECTION-E
(Compulsory Question)

9. Answer the following


(a) Construct the truth table for P > - Q.

How many permutations are there on the word


(b)
BRILLLANT" ?

(c) State De-Morgan's Law is a Boolean Algebra.


(d) Conjuctive Normal Form.
(e) Define Isomorphism and Semi-Group.
What are Recurrence Trees ?

(g) What are Hamiltonian circuits?


(h) Discuss Infix and Polish Notation with suitable
example.

) What is Pigeonhole Principle?


Traveling salesperson Problem. 20
)

5094/200/777/421 3

You might also like