[2] BCA–A-104
(b) Maximal set of numbers which a function
Roll No. …………………..
can take values.
(c) It is set of natural numbers for which a
function is defined.
BCA–A-104 (d) None of the mentioned.
(iii) How many properties can be held by a group ?
B. C. A. (First Semester)
(CO1)
EXAMINATION, 2020-21
(a) 2
MATHEMATICAL FOUNDATION OF COMPUTER
SCIENCE (b) 3
Time : 2 Hours (c) 4
Maximum Marks : 60 (d) 5
Note : All questions have to be attempted.
(iv) The binary relation {(1,1), (2, 1), (2, 2), (2, 3),
Section—A (2, 4), (3, 1), (3, 2) on the set {1, 2, 3} is : (CO2)
(Multiple Choices Type Questions)
(a) Reflexive, symmetric and transitive.
1. Answer the following questions : 1 each
(b) Irreflexive, symmetric and transitive
(i) A compound proposition that is neither a
tautology nor a contradiction is called a ........... . (c) Neither reflexive, nor irreflexive but
(CO1) transitive
(a) Contingency (d) Irreflexive and antisymmetric
(b) Equivalence (v) Self-complemented, distributive lattice is called :
(c) Condition (CO3)
(d) Inference (a) Boolean algebra
(ii) What is the range of the range of the function ? (b) Modular lattice
(CO2)
(c) Complete lattice
(a) Maximal set of numbers for which a
function is defined. (d) Self-dual lattice
P. T. O.
[3] BCA–A-104 [4] BCA–A-104
(vi) A compound proposition that is neither a (x) If f ( x) x sec x , then f (0) = ? (CO2)
tautology nor a contradiction is called as ............
(a) –1
(CO4)
(b) 0
(a) Contingency
(b) Equivalence (c) 1
(c) Condition (d) 2
(d) Inference
(xi) For two distinct sets, A and B, having
(vii) In the principal of mathematical induction, which
cardinalities m and n respectively, the maximum
of the following step is mandatory ? (CO3)
cardinality of a relation R from A to B is : (CO3)
(a) Induction hypothesis
(a) mn
(b) Induction reference
(b) m*n
(c) Induction set assumption
(c) mn
(d) Minimal set representation
(viii) The binary relation S = (empty set) on set (d) None of the above
A = {1, 2, 3} is : (CO4) (xii) The function f ( x) x3 is bijection from R to R.
(a) Transitive and reflexive Is it True or False ? (CO1)
(b) Symmetric and reflexive (a) True
(c) Transitive and symmetric (b) False
(d) Neither reflexive and nor symmetric
2. Attempt all questions : 3 each
(ix) The compound propositions p and q are called
(a) Which of the following is not a partial order
logically equivalent if ............ is a tautology.
relation ? (CO2)
(CO5)
(a) pq (i) R1 = (a, b) | ab z, a b
(b) pq (ii) R2 = (a, b) | ab z, a b
(c) ( p q)
(b) Find the ordinary generating function for
(d) p q sequence (1, -1, 1, -1, 1, -1 ............ ). (CO5)
P. T. O.
[5] BCA–A-104 [6] BCA–A-104
(c) Which of the following is not a equivalence (b) Show that p (q r ) ( p q) ( p q) . (CO4)
relation on set of real numbers ? (CO3)
(c) Show that ( p q) (p) (q) is contradiction.
(i) R1 = {(a, b) | a – b is a int} (CO4)
(ii) R2 = {(a, b) | a – b is divisible by 3}
5. Attempt any two of the following : 6 each
(iii) R4 = {(a, b) | a – b is even number}
(a) If ar is a numeric function as : (CO1)
(d) Let R = {(1, 2), (3, 4), (2, 2)}, S = {(4, 2), (2, 5),
(3, 1), (1, 3). Find (R0S, S0R, S0S). (CO1) 0 ; 0r2
ar r
Section—B 2 7 ; r 3
(b) Draw Hasse diagram for (D12, /). (CO3)
3. Attempt any two of the following : 6 each
(c) Find the recursive definition of the given function
(a) If f ( x) sin x 2 , g ( x) e x , then find fog (x), fn an , where an 5n . (CO1)
gof (x) and fof (x). (CO2)
(b) Which of the following is not a partial order
relation ? (CO2)
(i) R1 (a, b) | ab z, a b
(ii) R2 (a, b) | ab z, b/a z
(c) Solve the recurrence relation.
ar 7ar 1 10ar 2 3r ,
given that a0 0 , a1 1 (CO5)
4. Attempt any two of the following : 6 each
(a) Solve the recurrence relation
ar 5ar 1 6ar 2 2 r , given that a0 1 and
a1 1. (CO5) BCA–A-104 80
P. T. O.