II/BCA/202 Student’s Copy

2018
( CBCS )
( 2nd Semester )
BACHELOR OF COMPUTER APPLICATIONS
Paper No. : BCA–202
[ Mathematics—II ( Discrete Mathematics ) ]

Full Marks : 75

Time : 3 hours

( PART : A—OBJECTIVE )
( Marks : 25 )
The figures in the margin indicate full marks for the questions
SECTION—A
( Marks : 15 )
1. Tick (3) the correct answer in the brackets provided : 1×10=10
(a) A set A is a proper subset of a set B, if
(i) A Í B ( ) (ii) A ¹ B ( )
(iii) A = B ( ) (iv) Both (i) and (ii) ( )
(b) In a distributive lattice, if b Ù c = 0, then
(i) b £ c ( ) (ii) c £ b ( )
(iii) c = b ( ) (iv) b Ù c = 0 ( )
(c) For any statement formula P ® Q , the statement ù P ®ù Q is called its
(i) inverse ( ) (ii) converse ( )
(iii) contrapositive ( ) (iv) transitive ( )
(d) If A and B are well-formed formulas, then
(i) A Ù B is not well-formed formula ( )
(ii) A Ú B is not well-formed formula ( )
(iii) A ¯ B is not well-formed formula ( )
(iv) A ® B is well-formed formula ( )

/538 1 [ Contd.
 (e) The number of different messages than can be represented by
sequences of 3 dashes and 2 dots is
(i) 7 ( ) (ii) 8 ( )
(iii) 6 ( ) (iv) 10 ( )
(f) The third term in the expansion of (2x - 3y )5 is
(i) 720 x 3y 2 ( ) (ii) 720 x 2y 3 ( )
(iii) 670 x 3y 2 ( ) (iv) 670 x 2y 3 ( )
(g) Any subgroup of a cyclic group
(i) is non-Abelian ( ) (ii) has order 5 ( )
(iii) is cyclic ( ) (iv) is non-cyclic ( )
(h) In the group { 2, 4, 6, 8} under multiplication modulo 10, the identity
element is
(i) 4 ( ) (ii) 6 ( )
(iii) 2 ( ) (iv) 8 ( )
(i) An edge of a graph that is not self-loop is called a/an
(i) loop ( ) (ii) empty ( )
(iii) proper edge ( ) (iv) regular edge ( )
(j) A graph without multiple edges and loops is called
(i) digraph ( ) (ii) tree ( )
(iii) branch ( ) (iv) simple graph ( )
2. Tick (3) whether the following statements are True (T ) or False (F ) : 1×5=5
(a) A closed walk that does not contain a repeated edge is called a loop.
( T / F )
(b) Every finite group is isomorphic to a permutation group.
( T / F )
(c) A sequence of n distinct elements of a finite set A with n elements is
called a permutation.
( T / F )
(d) A product of the variables and their negations in a formula is called
elementary sum.
( T / F )
(e) A set A is said to be uncountable if A is finite or countable.
( T / F )

II/BCA/202/538 2 [ Contd.
 SECTION—B
( Marks : 10 )
Answer the following questions : 2×5=10

1. Compute the total number of students in a class if 50 students take

Mathematics and 6 students take Computer Science but 30 students are
taking both the courses.

2. Write the truth table for (P Ú Q )Ú ù P .

3. Show that C (k, 1) + 6C (k, 2 ) + 6C (k, 3 ) = k 3 .

4. If a 2 = e " a Î G, then show that G is Abelian.

5. Define a subgraph and a tree.

( PART : B—DESCRIPTIVE )
( Marks : 50 )
The figures in the margin indicate full marks for the questions

1. (a) Define a Boolean algebra and write its basic properties. 5

(b) Let n = p 1 p 2 ... p k , where p i are distinct primes known as set of atoms.
Show that the poset D n is a Boolean algebra. 5
OR
(c) If A, B and C are sets, prove that A Ç (B - C ) = (A Ç B ) - (A Ç C ). 5
(d) Draw Venn diagrams and show the sets ~ B, ~ (A È B ), B - (~ A ),
~ A È B and ~ A Ç B , where A Ç B ¹ f and ~ denotes complement. 5

2. (a) Show that ( ù P Ù ( ù Q Ù R )) Ú (Q Ù R ) Ú (P Ù R ) Û R. 5

(b) Obtain disjunctive normal form of ù (P Ú Q ) ¯ (P Ù Q ). 5
OR
(c) Obtain the principal disjunctive normal form of
P ® ((P ® Q ) Ù ù (ù Q Ú ù P )) 5
(d) Define tautologies. Explain them with an example. 5

3. (a) Find the number of distinguishable permutations of the letters in the

word ‘Mathematics’. What is a ‘combination’? 4+1=5

II/BCA/202/538 3 [ Contd.
 9
æ 4x 2 3 ö
(b) Find the term independent of x in the expansion of çç - ÷ .
è 3 2x ÷ø 5

OR
(c) A woman has 11 close friends and she wants to invite 5 of them to
dinner. In how many ways can she invite them, if—
(i) there is no restriction on the choice;
(ii) two particular persons will not attend separately? 1+4=5
(d) Find the sum of the coefficients of even powers of x in the expansion
of (1 + x + x 2 + x 3 )5 . 5
4. (a) Prove that the set G of all non-zero complex numbers is a group under
usual multiplication. 5
(b) State and prove Lagrange’s theorem. 5
OR
(c) Let G be a group such that (ab )n = a n b n for 3 consecutive integers n for
all a, b Î G. Show that G is Abelian. 5
(d) Show that union of two subgroups is a subgroup if one of them is
contained in the other. 5
5. (a) Prove that a tree with n vertices has (n -1) edges. 5
(b) Let G be a planar graph with v vertices, e edges and f faces. Then show
that
v -e + f = 2 5
OR
(c) Obtain a minimal spanning tree for the graph G : 10
a 9 b

1 8 2 4
7 6
c e
d
10 5
11 3

f 14 g

HHH

II/BCA/202/538 4 8G—270