Department of Computer Science and Engineering

Date:
Jamia Hamdard December 7, 2021
Discrete Structure (Code: BCA-303)
Time: 1 hour Sessional 2 Maximum Marks: 20
1. Determine whether the relation R on the set of all integers is reflexive, symmetric, antisymmetric,
and/or transitive, where (x, y) ∈ R if and only if
a) xy ≥ 1. b) x ≡ y(mod 7). c)x = y 2 . [03]
2. List the ordered pairs in the relations on {1, 2, 3, 4} corresponding to these matrices (where
the rows and columns correspond to the integers listed in increasing order).
a)  
1 1 0 1
1 0 1 0
 
0 1 1 1
1 0 1 1
b)  
1 1 1 0
0 1 0 0
 
0 0 1 1
1 0 0 1
[02]
3. Determine whether each of these functions is a bijection from R to R.
a) f (x) = 2x + 1
b) f (x) = x2 + 1
c) f (x) = x3
d) f (x) = (x2 + 1)/(x2 + 2) [04]
4. Let m be an integer with m > 1. Show that the relation. R = {(a, b)|a ≡ b(mod m)} is
equivalence relation on the set of integers. [03]
5. List the ordered pairs in the equivalence relations produced by these partitions of {0, 1, 2, 3,
4, 5}.
a) {0}, {1, 2}, {3, 4, 5}
b) {0, 1}, {2, 3}, {4, 5}
c) {0, 1, 2}, {3, 4, 5}
d) {0}, {1}, {2}, {3}, {4}, {5} [02]
6. Represent each of these relations on {a, b, c} with a directed graph
a) {(a, a), (a, b), (a, c)}
b) {(a, b), (b, a), (b, b), (c, c)}
c) {(a, a), (a, b), (a, c), (b, b), (b, c), (c, c)}
d) {(a, c), (c, a)} [02]
7. Find f ◦ g and g ◦ f , where f (x) = x − 2 and g(x) = x2 , are functions from R to R [02]
8. Given, f (x) = 2x+1
x−1 , find f −1 . [02]

End of exam