Scribd
Upload
31 views

Question Bank1 (PCC CS401) solved

This document is a question bank for a Discrete Mathematics course (PCC CS401) dated February 15, 2025. It contains a series of multiple-choice questions covering topics such as set theory, relations, mappings, and properties of numbers. Each question presents a scenario or definition followed by four possible answers.

Uploaded by

sahil03kar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Question Bank1 (PCC CS401) solved

This document is a question bank for a Discrete Mathematics course (PCC CS401) dated February 15, 2025. It contains a series of multiple-choice questions covering topics such as set theory, relations, mappings, and properties of numbers. Each question presents a scenario or definition followed by four possible answers.

Uploaded by

sahil03kar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Discrete Mathematics Question Bank

PCC CS401

February 15, 2025

1. Let A and B be two non-empty sets. Then, (A ∪ B)c =


(a) Ac ∪ B c
(b) Ac ∩ B c
(c) A ∩ B
(d) A ∪ B
2. Let A and B be two non-empty sets. Then, A△B =
(a) A ∪ B
(b) A ∩ B
(c) (A ∪ B) − (A ∩ B)
(d) Ac ∩ B c
3. Let S be a non-empty set and ρ be a relation on S. ρ is reflexive and
transitive. Then ρ is
(a) equivalence relation
(b) partial order relation
(c) both
(d) none

4. Let N be the set of natural numbers with the relation ‘<’ with its usual
meaning. Then ‘<’ is
(a) reflexive
(b) symmetric
(c) transitive
(d) none
5. Let us consider the set of integers Z with the relation ‘ρ‘ defined as ‘aρb‘
if and only if (a + b) is an even number. Then ρ is

(a) partial order relation

1
(b) equivalence relation
(c) none
(d) both

6. Let S be a non-empty set with an equivalence relation ‘ρ‘. Consider a, b ∈


S such that a is not related to b. Then
(a) cl(a) = cl(b)
(b) cl(a) ⊂ cl(b)
(c) cl(b) ⊂ cl(a)
(d) cl(a) ∩ cl(b) = ∅
7. Let S be the set of all the divisors of 12. Consider the partial order relation
‘≤‘ on S as ‘a ≤ b‘ if and only if a divides b, for a, b ∈ S. Then
(a) 2 ≤ 3
(b) 3 ≤ 4
(c) 4 ≤ 6
(d) 3 ≤ 6
8. Let us consider the set of integers Z with the equivalence relation ‘ρ‘,
defined as ‘aρb‘ if and only if (a + b) is an even number. Then
(a) cl(4) = {4}
(b) cl(4) = {2, 4, 6, . . . }
(c) cl(4) = Z
(d) cl(4) = {0, ±2, ±4, ±6, . . . }

9. Let us consider the set of integers Z with a relation ‘ρ’, defined on Z as


‘aρb’ if and only if (a − b) is divisible by 3, for a, b ∈ Z. Then
(a) ρ is a partial order relation
(b) ρ is an equivalence relation
(c) none
(d) both
10. Let us consider the set of integers Z with a relation ‘ρ’, defined on Z as
‘aρb’ if and only if a divides b, for a, b ∈ Z. Then

(a) ρ is an equivalence relation


(b) ρ is a partial order relation
(c) both
(d) none

2
1
11. Let us consider the assignment f : R → R such that f (x) = x for x ∈ R.
Then
(a) f is an injective mapping
(b) f is an onto mapping
(c) both
(d) none
12. Let us consider the assignment f : R → R such that f (x) = x2 for x ∈ R.
Then
(a) f is a surjective mapping
(b) f is an injective mapping
(c) both
(d) none
13. Let us consider the assignment f : Z → Z such that f (x) = x2 for x ∈ Z.
Then
(a) f is a injective mapping
(b) f is an onto mapping
(c) both
(d) none
14. Let us consider the assignment f : N → N such that f (n) = n + 1 for
n ∈ N. Then
(a) f is an injective mapping
(b) f is a surjective mapping
(c) both
(d) none
15. Let us consider the assignment f : R → R such that f (n) = n + 1 for
n ∈ R. Then
(a) f is an injective mapping
(b) f is an onto mapping
(c) f is a bijective mapping
(d) f is not a mapping

16. Let us consider the set of natural numbers N with the relation ≤ with its
usual meaning. Then
(a) lub{2, 6} = 6
(b) glb{2, 6} = 2

3
(c) both
(d) none
17. Let us consider the poset (P, ), where P is the set of positive integers and ≤
stands for a ≤ b iff a divides b. Then

(a) lub{3, 4} = 4
(b) lub{3, 4} = 3
(c) lub{3, 4} = 12
(d) lub{3, 4} = 1

18. Let S = {1, 2, 3} and P be the collection of all proper non-empty subsets
of S. Let us define a relation ≤ on P as A ≤ B iff A ⊆ B. Then
(a) glb of {1} and {2} is ∅
(b) glb of {1} and {2} is {1}
(c) glb of {1} and {2} is {2}
(d) glb of {1} and {2} does not exist.
19. Let S = {1, 2, 3} and P be the collection of all subsets of S. Let us define
a relation ≤ on P as A ≤ B iff A ⊆ B. Then

(a) lub of {2, 3} and {3, 1} is S.


(b) lub of {2, 3} and {3, 1} does not exist.
(c) lub of {2, 3} and {3, 1} is {1, 2}
(d) lub of {2, 3} and {3, 1} is ∅

20. Let S be a non-empty set and ρ is a relation defined on S such that ρ is


symmetric and transitive. Then ρ is
(a) reflexive
(b) anti-symmetric
(c) both
(d) none

You might also like