Set 1: Unit 1 (Set Theory and Logic & Proof)
1. Which of the following is a tautology?
A. (p ∨ ¬p)
B. (p ∧ ¬p)
C. p → q
D. q → p
■ Answer: A
2. The set {1,2,3} and {3,2,1} are:
A. Equal sets
B. Proper subsets
C. Improper subsets
D. Disjoint sets
■ Answer: A
3. If A ⊂ B and B ⊂ C, then:
A. A ⊂ C
B. C ⊂ A
C. A = B
D. None
■ Answer: A
4. Which is an example of a reflexive relation?
A. ≤ on natural numbers
B. < on natural numbers
C. ≠ relation
D. None
■ Answer: A
5. Cardinality of power set of {a,b,c} is:
A. 6
B. 8
C. 9
D. 3
■ Answer: B
6. Principle of Inclusion-Exclusion for 2 sets is:
A. |A∪B| = |A| + |B|
B. |A∪B| = |A| + |B| - |A∩B|
C. |A∪B| = |A| × |B|
D. None
■ Answer: B
7. Which of the following is countable?
A. Real numbers
B. Integers
C. Irrational numbers
D. Continuum
■ Answer: B
8. Diagonalization argument was given by:
A. Euclid
B. Aristotle
C. Cantor
D. Russell
■ Answer: C
9. In propositional logic, 'p → q' is false when:
A. p is true, q is false
B. p is false, q is true
C. p and q both true
D. p and q both false
■ Answer: A
10. Which of the following is NOT a property of equivalence relation?
A. Reflexive
B. Symmetric
C. Antisymmetric
D. Transitive
■ Answer: C
Set 2: Unit 2 (Relations and Functions)
1. A function f: A→B is bijective if it is:
A. Injective only
B. Surjective only
C. Both injective and surjective
D. None
■ Answer: C
2. The identity function f(x) is:
A. f(x)=1
B. f(x)=0
C. f(x)=x
D. f(x)=c
■ Answer: C
3. Which of the following is a partial order relation?
A. <
B. ≤
C. ≠
D. >
■ Answer: B
4. The transitive closure of a relation is found using:
A. DFS
B. BFS
C. Warshall’s Algorithm
D. Prim’s Algorithm
■ Answer: C
5. Hasse diagram is used for:
A. Functions
B. Partial order relations
C. Equivalence relations
D. Counting
■ Answer: B
6. Inclusion-Exclusion principle is used in:
A. Counting
B. Graph theory
C. Algebra
D. Geometry
■ Answer: A
7. Which of the following is uncountable?
A. Natural numbers
B. Integers
C. Rational numbers
D. Real numbers
■ Answer: D
8. If A has 4 elements, then P(A) has:
A. 8
B. 12
C. 16
D. 20
■ Answer: C
9. A constant function maps every element to:
A. Different values
B. Same value
C. Zero
D. None
■ Answer: B
10. Pigeonhole principle: If 10 pigeons in 9 holes, then at least one hole has:
A. 2
B. 3
C. 4
D. 5
■ Answer: A
