Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
8 views3 pages

Discreate Mathematics - 2020

This document is an examination paper for a Computer Science course focusing on Advanced Discrete Mathematics and Graph Theory. It consists of two groups of questions, with Group A requiring answers to five short questions and Group B requiring answers to three detailed questions. The topics covered include set theory, propositional logic, graph theory, and algebraic structures.

Uploaded by

hacker01gt
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
8 views3 pages

Discreate Mathematics - 2020

This document is an examination paper for a Computer Science course focusing on Advanced Discrete Mathematics and Graph Theory. It consists of two groups of questions, with Group A requiring answers to five short questions and Group B requiring answers to three detailed questions. The topics covered include set theory, propositional logic, graph theory, and algebraic structures.

Uploaded by

hacker01gt
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

PG/Comp. Sc.

/2nd Sem/20(CBCS)

2020
COMPUTER SCIEN CE
Paper : COMP 203 (Core 3)
(Advanced Discrete Mathematics and Graph Theory)
Full Marks : 40 Time : Two Hours
The figures in the margin indicate full marks.
Group - A

1. Answer any five : 2×5=10


(a) What do you mean by cardinality of a Set? What is the cardinality of
a Null Set?
(b) Let |C|=k and |D|=j. What is |P(C X D)|?
(c) When a compound proposition is called tautology?
(d) What do you mean by a monoid?
(e) What is multigraph?
(f) Define isomorphic in Graphs.
(g) Define Complete Graph.

Group - B
Answer any three questions.
2. (a) Show that each of these conditional statements is a tautology by using truth
tables :

(i)  p  q   p

(ii)  p  q    q  r    p  r 

Page : 1 of 3
(b) Let Q(x) be the statement “x < 2”. What is the truth value of the
quantification xQ  x  , where the domain consists of all real numbers?
(c) How to bind variables using quantifiers? 4+2+4
3. (a) What do you mean by Power Set? What is the power set of the set
{1,2,3}?
(b) Determine whether each of the below functions is a bijection from R to
R:

(i) f  x  =2x+1

(ii) f  x  =x 3

(c) Show that the relation R is an equivalence relation in the set A = { 1, 2,


3, 4, 5 } given by the relation R = {(a, b) : | a – b | is even}.
(1+2)+(2+2)+3
4. (a) Define Group.
(b) Prove that whether (Z, *) is a commutative Group or not (* represents
arithmetical multiplication).
(c) Prove that (Z, +) is a Quasigroup. 3+4+3
5. (a) Represent the following graph in adjacency list and adjacency matrix :

(b) When a graph becomes bipartite? Prove the following statement


“A graph is bipartite if and only if it has no cycles of odd length”.
(2+2)+(2+4)

Page : 2 of 3
6. (a) Prove the following statement :
“A connected graph has an Eulerian tour if and only if every vertex has
even degree.”
(b) Let G be a connected plane graph with v vertices, e edges and f faces.
Then show that :
v – e + f = 2. 5+5

——————

Page : 3 of 3

You might also like