NATIONAL INSTITUTE OF PUBLIC ADMINISTRATION

BACHELORS OF COMPUTER SCIENCE

BSC 104- DISCRETE MATHEMATICAL STRUCTURES

JUNE 2018 EXAMINATION

TIME ALLOWED: THREE HOURS

INSTRUCTIONS TO CANDIDATE:
1. 1. This paper contains FIVE questions.

Answer any THREE FULL questions.

2. Number each answer clearly in the left margin along with the sub question number.
3. Draw the diagram whenever required.
4. Start each answer on a new page.
5. Total marks: 60%.

DO NOT TURN THIS PAPER UNTIL TOLD TO DO SO

PLEASE LEAVE THE ANSWER SCRIPT BEHIND AFTER THE EXAMINATION
QUESTION 1:

a) Define the following terms with respect to propositional logic. Give example for each.
(4 Marks)
i) Tautology ii) Duality Principle
iii) Contradiction iv) Contingency
b) Let s, t and u denote the following simple statements: (4 Marks)
s: Phyllis goes out for a walk.
t: The moon is out.
u: It is snowing.
Translate each of the following into an English sentence. .

i) ( t∧¬u ) →s ii) t → (¬u→ s ) iii) ¬ ( s ↔ ( u∨t ))

iv) s ↔ ( ¬t∨¬u )
c) In a class there are 110 students, 40 likes basketball, 45 likes football, 33 likes golf, 11
likes both basketball and football, 8 likes football and golf, 5 likes basketball and golf
only. 4 like all the three sports. Using the formula of cardinality and Venn diagram find
the following. (7 Marks)
i) How many of them take at least one sport?
ii) How many does not take any of the sports?
iii) How may take exactly one sports?
iv) How many takes exactly 2 sports?
v) How many likes foot ball and basketball only?
d) Define the following with respect to set theory. Give example for each. (5 Marks)
i) Universal set ii) Subset iii) Power set
iv) Relative complement of a set v) Symmetric difference
[Total = 20 marks]
QUESTION 2:

¿={ 1,2,3,4,5,6,7 ,8 ,9,10 } , A= { x ∈∪|x is prime } , B= { x ∈∪|x is odd }

2) If ,
C={ x ∈∪|x is even }
. Find the following:
AΔ ( BΔC ) ( A∪B )−( A∩B ) ( A−B )∪(C−B )
i) ii) iii)
A−( B−C ) B∩C
iv) v)
a) Using laws of logic solve the following compound propositions. (6 Marks)

ii) [ p∧(¬p∨q )]∨[ q∧¬( p∧q )]

iii) [( p∨¬q )∧(¬ p∨¬q )]∨q

b) Using truth table verify whether [ p→ ( q → r ) ] → [ ( p → q ) → ( q → r ) ] is a tautology or

contradiction or contingency? (5 Marks)
A∩( B∪C )⇔( A∩B)∪( A∩C )
c) Using laws of set theory prove that (4 Marks)

[Total = 20 marks]

QUESTION 3

a) Define the following with respect to relation. Give example for each. (5 Marks)
i) Reflexive relation ii) Transitive relation
iii) Symmetric relation iv) Equivalence relation
v) Inverse of a relation
b) Consider the set A = {1, 2, 3, 4}. Determine whether the following relation is an
equivalence relation or not. Give reason. (5 Marks)
R = {(1, 1), (1, 4), (4, 1), (4, 4), (2, 2), (2, 3), (3, 2), (3, 3)}
c) A = {a, b, c}, and R, S are relations on A whose matrices are (5 Marks)
 [ ] [ ]
1 0 1 0 0 1
1 1 0 0 1 0
MS =
0 1 1 MR =
1 0 0

Using both the matrices find the relation S ∘R and also prove that MS.MR = MS ∘ R

d) Using truth table verify the logical equivalence for the following compound statement
[ ( r ∧s ) →q ] ⇔ [ ¬ ( r∧s ) ∨q ] (5 Marks)
[Total = 20 marks]

QUESTION 4:

a) A = {2, 3}, B = {3, 4, 5, 6} and R is a relation from A to B defined as follows: (a, b) ∈ R

if “a divides b” write the relation R. And also write the domain and range. (3 Marks)
b) Define the following with respect to the graph. Give example for each. (5 Marks)
i) Self loop ii) Multi-graph. iii) Simple graph
iv) Pendant vertex v) isolated vertex
a) Show that a Simple Graph of order 4 and size 7 does not exist. (4 Marks)
b) Let R = {(1, 2), (3, 4), (2, 2)} and S = {(4, 2), (2, 5), (3, 1), (1, 3)}. Find the following,
(5 Marks)

i. R ∘S ii) S ∘R iii) ( R ∘S ) ∘ R

iv) ( S ∘R ) ∘ S v) ( R ∘ R ) ∘ R
c) Write the incidence matrix for the following graph. (3 Marks)

[Total = 20 marks]
QUESTION 5:

a) For the graph shown below verify that ∑ deg ( v i )=2|E| (5 Marks)

b) Write the Pre-order, Post-order, and In-order, traversal for the following binary tree.
(6 Marks)

d) Draw a complete graph K5 and K6 (4 Marks)

e) Define the following with respect to tree. Give example for each. (5 Marks)
i) Root ii) Leaf iii) Siblings
iv) Internal nodes v) Sub Tree
[Total = 20 marks]