NP - 162
Semester B.C.A. Degree Examination, May 2022
(NEP -2021-2022 and Onwards)
COMPUTER SCIENCE
e\ ./r3' Paper - 1.1 : Discrete Structures
(o^ )-----l,rn+"/
\-3"'/rr r.u.-,Eut'-Y
ime:2% Hogrs Max. Marks : 60
lnstruction : Answer any four questions from each Section.
SECTION -A
l. Answer any four questions. Each question carries 2 marks. (4x2=8)
1) Find the intersection A n B and set difference A - B if
A = t1, 3, 5, 7, 9) and B - {2,3,4, 5, 6, 8}.
2) Prove that (p + q) <_> (7q + 7p) is a tautology.
3) Find the values of i) 4P, ii) 6Ca.
4') Find A-1 if' o= [l124)
:l i
5) Define the terms :
i) Graph ii) Adjacency Matrix.
6) What is a [Link] cost spanning tree ?
SECTION - B
ll. Answer any four questions. Each question carries 5 marks. (4x5=20)
7) Prove that for any three propositiors p, q and r show that
p + (q n r) =[(p + q) n (p + r)].
8) Considerthefunctionsf &g:R-+Rdefined byf(x) =x2+5and g(x) =5x-2
Find the composite functions.
i) fog ii) gof iii) fof
P.T.O.
NP - 162 I ffiiltl ililt rlr ililililfi ilil tilr
9) How many ways are there to form a committee, if the committee consists of
3 women and 4 men if there are 6 women and 7 men ?
10) Define rank and nullity of a matrix. Find the rank of the following matrix
'[s-1 41
A=16 1 -1 l.
. tt
L1 s 8l
11) Define isomorphism of graphs. Verify that the two graphs shown l:elow are
isomorphic or not.
12\ What is a Harniltonian circuit ? Check whether the following graph contains
Hamiltonian circuit. Justify your answer.
1 2
5 6
llillllllilillllllllllllillllllil .3- Np - 162
SECTION _ C
lll. Apswer any four questions. Each question carries I marks. (4x8=32)
13) Let A and B non-empty sets. Define :
i) 0ne-to-one function
ii) Onto function
iii) Bijective function
iv) if lAl = 4 and lBl = 7 find the number of functions from A to B.
14) Using Mathematical induction prove that 13 + 23 + 33 + ... + n3 - n2(n +
4
1)2
where n is a natural number ?
15) a) ln how many ways can the letters of the word 'LEADING' be arranged
in such a way that the vowels always come together ? I
b) A box contains 2 white balls, 3 black balls and 4 red balls. ln how many
ways can 3 balls be drawn from the box, if atleast one black ball is to be
included in the draw ? 4
16) Solve the following system of linear equations using Cramer's rule.
x+y*Z=6
2x+3y-z=5
6x-2y *32=-7
17) a) tt 2A* r
l+ 4 z1
=1, 3 o)
'o =L 1 -1 z_j tnen find A and B. 4
,,
lil| lil lffi ilil| lill llll
NP - 162 I lllilril
b) Find the in order, preorder and post order traversal of the following tree.
4
18) Obtain the minimum cost spanning tree for the following graph using
Kruskal's algorithm.
