Scribd
Upload
32 views2 pages

DMCS (5th) Dec2017

This document contains questions about discrete mathematics topics relevant to computer science, including set theory, graph theory, Boolean algebra, and formal languages. It covers concepts such as subsets, functions, relations, recurrence relations, graph problems, finite state machines, algorithms, lattices, Boolean expressions, logical statements, switching networks, and more. Students are asked to prove statements, find solutions, draw diagrams, define terms, and apply concepts through examples and truth tables. The questions assess a range of skills in discrete mathematics.

Uploaded by

ayushsharma.blp001
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
32 views2 pages

DMCS (5th) Dec2017

This document contains questions about discrete mathematics topics relevant to computer science, including set theory, graph theory, Boolean algebra, and formal languages. It covers concepts such as subsets, functions, relations, recurrence relations, graph problems, finite state machines, algorithms, lattices, Boolean expressions, logical statements, switching networks, and more. Students are asked to prove statements, find solutions, draw diagrams, define terms, and apply concepts through examples and truth tables. The questions assess a range of skills in discrete mathematics.

Uploaded by

ayushsharma.blp001
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/ 2

Bachelor of Computer Applications 5th Semester

DISCRETE MATHEMATICS IN COMPUTER SCIENCE


Time : Three Hours] [Maximum Marks : 45
Note. Attempt five questions in all, including question.No. 9 in SECTION-E, which is compulsory
and taking one question each from Sections A-D. Each question carries 18 marks.
SECTION-A
1. (a) Let A, B and C be subsets of set U. Show that
(b) If is a function defined on the set of real numbers then show that f is both
one-one and onto function.
(c) Let and R be a binary relation on P(B), the power set of B, defined by
if and only if . That is, R is the “subset relation". .
Show that Ris Reflexive, anti-symmetric and transitive. That is, show that R is a partial order
relation.
2. (a) Find the solution of the recurrence relation a, + anti-12a = 0,
n> 0 satisfying the initial conditions ao = 1 and a, = 1.
(b) Find the general solution of the recurrence relation :

SECTION-B
3. Explain the solution to the following problem:
(a) Traveling Salesman Problem.
o m
.r c
(b) Shortest path from a source vertex to destination vertex in a graph.
4. (a) Find an Euler path or Euler circuit, if it exists in the following graphs. If it does not exist,
explain why?

p e m
a o
r p .r c
b p e
(b) Prove that number of vertices of odd degree in a graph is always even.

5.
SECTION-C

p a
(a) What is meant by a state in a finite state machine (FSM)? What the difference between

r
deterministic and nondeterministic find State Automation.

b
(b) What is an algorithm? What is meant by time complexity of algorithm ? Define
notations used in analysis algorithms.
and

6. (a) What are distributive and complemented lattices? Establish De Morgan's laws in a
complemented, distributive lattice.
(b) In a distributive lattice, prove that a × b = a × c and . imply b=c:
SECTION-D
7. (a) Prove by mathematical induction that, for all

(b) Write the dual of the Boolean expression ̅ ̅


(c) Find a minimal representation for the following Boolean expression:
̅ ̅ ̅
8. (a) For the following statements, find its negation and simplify your expression :
where R is the set of real numbers.
(b) Write each of the following compound propositions using logical connectives and symbols,
where c, d,r and w, mean "it is cold”, “it is dry”, “it is rainy", and "it is windy", respectively.
(i) It is neither cold nor dry.
(ii) It is rainy if it is not dry.
(ii) To be cold, it must be windy or rainy.
(iv) It is cold or dry, but not both.
(c) What are switching networks ? What is their purpose ?
SECTION-E
(Compulsory Question)
9. (a) What is Principle of Duality in set theory? Explain with an example.
(6) What is the use of Venn Diagrams in set theory ? Explain example.
(c) Giveşne possible partition of the set {1,2,3,4,5,6}.
(d) Define Degree of a Graph.
(e) Use De Morgan's Laws of Boolean Algebra to simplify
(f) Write down a truth table to show that ν is a tautology.
(g) How many edges are there in a graph with 10 vertices each of degree 5?
(h) Draw the graph of the function | | for
(f) Give an example of a lattice that is not complemented

o m
.r c
p e m
a o
r p .r c
b p e
p a
b r

You might also like