Scribd
Upload
107 views5 pages

Unit 1 Maths - AEEE

The document outlines the syllabus for Unit 1 of the AEEE exam, focusing on Sets, Relations, and Functions, with a series of questions and answers. It covers topics such as set operations, power sets, equivalence relations, and function properties, providing multiple-choice questions along with correct answers and explanations. Each section includes specific problems designed to test understanding of the concepts related to sets and functions.

Uploaded by

kapilailookup
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
107 views5 pages

Unit 1 Maths - AEEE

The document outlines the syllabus for Unit 1 of the AEEE exam, focusing on Sets, Relations, and Functions, with a series of questions and answers. It covers topics such as set operations, power sets, equivalence relations, and function properties, providing multiple-choice questions along with correct answers and explanations. Each section includes specific problems designed to test understanding of the concepts related to sets and functions.

Uploaded by

kapilailookup
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Unit 1: Sets, Relations, and Functions of the AEEE exam syllabus.

Each question follows


the AEEE pattern with four answer choices.

1. Sets and Their Representation

1. If A = {1, 2, 3, 4} and B = {2, 3, 5, 6}, then (A ∪ B) ∩ (A ∩ B)' is:


a) {1, 2, 3, 4, 5, 6}
b) {1, 4, 5, 6}
c) {2, 3}
d) {1, 4}
2. If A and B are two sets such that n(A) = 20, n(B) = 30, and n(A ∩ B) = 5, then
n(A ∪ B) is:
a) 25
b) 45
c) 55
d) 50
3. If U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {2, 4, 6, 8, 10} and B = {1, 2, 3, 4, 5}, then A'
∩ B is:
a) {1, 3, 5}
b) {2, 4}
c) {6, 8, 10}
d) {7, 9}
4. The number of subsets of the set {a, b, c, d, e} is:
a) 5
b) 10
c) 25
d) 32
5. If A = {x | x is a prime number less than 10} and B = {x | x is an odd number less
than 10}, then A ∩ B is:
a) {2, 3, 5, 7}
b) {3, 5, 7}
c) {1, 3, 5, 7, 9}
d) {2, 3, 7}

2. Union, Intersection, and Complement of Sets

6. If A = {1, 2, 3, 4} and B = {2, 3, 4, 5, 6}, then A ∪ B – A ∩ B is:


a) {1, 5, 6}
b) {1, 2, 3}
c) {1, 4, 5, 6}
d) {2, 3, 4}
7. If A and B are two sets such that A ⊆ B, then which of the following is always
true?
a) A ∩ B = A
b) A ∪ B = B
c) A - B = ∅
d) All of the above
8. If P(A) = 3/5 and P(B) = 2/5, then what is P(A ∪ B) given that A and B are
disjoint?
a) 1
b) 4/5
c) 3/5
d) 5/5
9. If A and B are two sets such that A ∩ B = ∅, then which of the following is true?
a) A and B are disjoint sets
b) A and B are equal sets
c) A ∪ B = U
d) None of the above
10. If n(A) = 10 and n(B) = 15, and n(A ∩ B) = 5, then n(A' ∩ B') in a universal set U
with n(U) = 30 is:
a) 20
b) 10
c) 15
d) 5

3. Power Set

11. If S = {a, b, c}, then the number of elements in the power set of S is:
a) 6
b) 8
c) 9
d) 12
12. If A is a set containing n elements, then the number of subsets of A is:
a) 2n
b) n²
c) n!
d) n² - n
13. If P(A) represents the power set of A and |A| = 4, then |P(A)| is:
a) 4
b) 16
c) 8
d) 32
14. How many subsets of {1, 2, 3, 4, 5, 6} contain at least one element?
a) 63
b) 31
c) 64
d) 32
15. If a power set of a set contains 128 elements, then how many elements does the
original set have?
a) 6
b) 7
c) 8
d) 9
4. Relations and Their Types

16. A relation R on a set A is called an equivalence relation if it is:


a) Reflexive
b) Symmetric
c) Transitive
d) All of the above
17. Which of the following relations is not an equivalence relation on set A = {1, 2, 3,
4}?
a) R = {(1,1), (2,2), (3,3), (4,4)}
b) R = {(1,2), (2,1), (3,4), (4,3)}
c) R = {(1,1), (2,2), (3,3)}
d) R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,1)}
18. The number of reflexive relations on a set with n elements is:
a) 2^n
b) 2^(n²)
c) 2^(n²-n)
d) None of the above
19. Which of the following is NOT a valid equivalence relation?
a) "is equal to"
b) "is a sibling of"
c) "is taller than"
d) "is congruent to (mod n)"
20. A function f(x) = x² is an example of a:
a) One-one function
b) Onto function
c) Many-one function
d) None of the above

5. Functions and Their Properties

21. If f: A → B and g: B → C, then the composition of functions (g ∘ f): A → C is


defined as:
a) g(f(x))
b) f(g(x))
c) g ∘ f ∘ x
d) None of the above
22. A function is one-one if and only if:
a) Different inputs have different outputs
b) Same inputs have the same outputs
c) Different inputs can have the same output
d) None of these
23. A function is onto if and only if:
a) Every element in the codomain has a pre-image in the domain
b) One element maps to multiple elements
c) The function is reflexive
d) None of these
24. If f(x) = x² and g(x) = x + 1, then (f ∘ g)(x) is:
a) x² + 2x + 1
b) x² + 1
c) x² + x + 1
d) x² + 2
25. If f: A → B is both one-one and onto, then f is called:
a) Bijective
b) Injective
c) Surjective
d) None of the above

Here are the answers (only options) for the above questions:

1. (b)
2. (b)
3. (a)
4. (d)
5. (b)
6. (a)
7. (d)
8. (a)
9. (a)
10. (b)
11. (b)
12. (a)
13. (b)
14. (a)
15. (b)
16. (d)
17. (c)
18. (b)
19. (c)
20. (c)
21. (a)
22. (a)
23. (a)
24. (a)
25. (a)

Here are explanations for each question:

1. Sets and Their Representation

1. (b) → We first find A ∪ B = {1, 2, 3, 4, 5, 6} and A ∩ B = {2, 3}. The complement of


A ∩ B is {1, 4, 5, 6}. Their intersection is {1, 4, 5, 6}.
2. (b) → Formula: n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap
B). Substituting values: 20+30−5=4520 + 30 - 5 = 45.
3. (a) → A' (Complement of A) = {1, 3, 5, 7, 9}. A' ∩ B = {1, 3, 5}.
4. (d) → Formula for power set: 2n2^n. Since n = 5, we get 25=322^5 = 32.
5. (b) → Prime numbers less than 10 are {2, 3, 5, 7}. Odd numbers less than 10 are {1,
3, 5, 7, 9}. Their intersection is {3, 5, 7}.

2. Union, Intersection, and Complement of Sets

6. (a) → A ∪ B = {1, 2, 3, 4, 5, 6}, A ∩ B = {2, 3, 4}. Difference: {1, 5, 6}.


7. (d) → If A ⊆ B, then all properties hold: A ∩ B = A, A ∪ B = B, A - B = ∅.
8. (a) → Since A and B are disjoint, P(A ∪ B) = P(A) + P(B) = 3/5 + 2/5 = 1.
9. (a) → If A ∩ B = ∅, the sets are disjoint.
10. (b) → Formula: n(A′∩B′)=n(U)−n(A∪B)n(A' \cap B') = n(U) - n(A \cup B).
n(A∪B)=10+15−5=20n(A \cup B) = 10 + 15 - 5 = 20, so n(A′∩B′)=30−20=10n(A'
\cap B') = 30 - 20 = 10.

3. Power Set

11. (b) → Formula: 2n2^n. Since n = 3, we get 23=82^3 = 8.


12. (a) → Formula: 2n2^n.
13. (b) → Power set formula: 24=162^4 = 16.
14. (a) → Total subsets = 26=642^6 = 64. Removing empty set: 63.
15. (b) → If power set contains 128 subsets, original set has log⁡2(128)=7\log_2(128)
= 7 elements.

4. Relations and Their Types

16. (d) → A relation is equivalence if it is reflexive, symmetric, and transitive.


17. (c) → (1,2) and (2,1) are missing, so not symmetric.
18. (b) → Reflexive relations must contain (x, x) for all x. Formula: 2n2−n2^{n^2-n}.
19. (c) → "Taller than" is not symmetric or transitive, so not an equivalence relation.
20. (c) → f(x)=x2f(x) = x^2 is many-one (e.g., f(2) = f(-2) = 4).

5. Functions and Their Properties

21. (a) → Composition means substituting f(x) inside g(x), so g(f(x)).


22. (a) → One-one means different inputs have different outputs.
23. (a) → Onto means every codomain value has a pre-image in the domain.
24. (a) → f(g(x))=(x+1)2=x2+2x+1f(g(x)) = (x+1)^2 = x^2 + 2x + 1.
25. (a) → A function that is both one-one and onto is bijective.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy