SundarSTEM

Monthly Test IOI Class 9

Mathematics for Computer Science
27th of September, 2022
Time: 120 minutes Total Marks: 120

Name: ________________________________________________ Reg. Number: [__][__][__]

________________________________________________
1. [16] Multiple Choices Questions. Each MCQ carries .8 marks.
An unattended MCQ grants .2 marks, a wrong answer penalizes .4 marks.

0) What is the multiplicative identity?

(A) 1 (B) 0 (C) 2 (D) -1 (E) -2

Correct way: (the only)

(A) 1 (B) 0 (C) 2 (D) -1 (E) -2
Incorrect ways: (some of the)
(A) 1 (B) 0 (C) 2 (D) -1 (E) -2
(A) 1 (B) 0 (C) 2 (D) -1 (E) -2
(A) 1 (B) 0 (C) 2 (D) -1 (E) -2
(A) 1 (B) 0 (C) 2 (D) -1 (E) -2

1) Which of the following is not always true?

I. If A⊆B, and B⊆C, then A⊆C.
II. If A⊂B, and B⊂C, then A⊂C.
III. If A∈B, and B∈C, then A∈C.
(A) Only II. (B) I. & II. (C) Only III. (D) II. & III. (E) I., II., & III.

2) What is the cardinality of the set A={{{∅}, ∅}}?

(A) 0 (B) 1 (C) 2 (D) 3 (E) ∞

3) Which of the following is not always true?

I. If A⊂B, then A=B.
II. If A⊃B, and B⊃C, then A⊃C.
III. If A⊆B, and B⊆C, then A⊆C.
(A) Only II. (B) I. & II. (C) Only III. (D) II. & III. (E) None of these

4) Let n(A), n(B), and n(A∪B) be m, n, and o respectively. What is n(A-B)?

(A) m-n (B) mn (C) n-o (D) no (E) o-m

5) What is the cardinality of the set P(P(∅))?

(A) 0 (B) 1 (C) 2 (D) ∅ (E) ∞
6) (20)3 in base 4 would be?
(A) 22 (B) 24 (C) 12 (D) 42 (E) 21

7) The 4-bit signed 2’s complement numbers 0110 and 1101 sum up to:
(A) 0011 (B) 0110 (C) 1100 (D) Overflow (E) Underflow

8) What is 20&22, where & is the bitwise and operator?

(A) 20 (B) 22 (C) 0 (D) 1

9) What is 27^9, where ^ is the bitwise xor operator?

(A) 27 (B) 9 (C) 3 (D) 18

10) In the 4-bit sign-magnitude system, which of the following would overflow?
(A) 1110+1010 (B) 0011-1110 (C) Both A and B (D) None of these

11) The relation R={(a, 3), (b, 4), (c, 1)} from A={a, b, c} to B={1, 2, 3, 4} is:
(A) Injective (B) Surjective (C) Bijective (D) Neither 1-1, nor onto (E) Not a function

12) The relation R={(a, 2), (b, 1), (c, 2), (d, 3)} from A={a, b, c, d} to B={1, 2, 3, 4} is:
(A) Injective (B) Surjective (C) Bijective (D) Neither 1-1, nor onto (E) Not a function

13) Let n(A)=4, and n(B)=3. The total number of functions from A to B are:
(A) 81 (B) 64 (C) 12 (D) 24 (E) None of these

14) Let n(A)=3, and n(B)=4. The total number of injective functions from A to B are:
(A) 81 (B) 64 (C) 12 (D) 24 (E) None of these

15) Let n(A)=n(B)=4. The total number of bijective functions from A to B are:
(A) 81 (B) 64 (C) 12 (D) 24 (E) None of these

16) Which of the following type of functions is invertable?

(A) Injective (B) Surjective (C) Bijective (D) All of these (E) None of these

17) Which of the following is not a relation from A={00, 01, 10, 11} to B={0,1}?
(A) ∅ (B) {∅} (C) {(00, 0), (11, 1)} (D) All of these (E) None of these

18) Which of the following is not a function from A={00, 01, 10, 11} to B={0,1}?
(A) ∅ (B) {∅} (C) {(00, 0), (11, 1)} (D) All of these (E) None of these

19) Let A⊕B be the symmetric difference, then which of the following is always true?
I. A⊕B = (A∪B) - (A∩B)
II. A⊕B = (A - B)∪(B - A)
(A) I. only (B) II. only (C) I. & II. (D) Neither I., nor II.

20) Let f: A→B be a function, and g: B→A be its inverse, then f◦g(x) is an identity on
(A) A (B) B (C) ∅ (D) None of these
2. [4] The decimal value of a binary number is determined by the system it
belongs to. Find the decimal value of the 4-bit numbers.

Bits Unsigned Signed Two’s Complement Sign-Magnitude

0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111

3. [5] Formally show that two sets are equal iff A⊆B and B⊆A.

4. [5] Formally show that union is associative, i.e. A∪(B∪C)=(A∪B)∪C.

5. [5] Using truth table, show that:
a xor b = (a and ~b) or (~a and b),
where and, or, and xor are logical operators, and a, b are boolean variables.

6. [5] Using Venn Diagram, show that for any sets A, B, and C:
n(A∪B∪C)=n(A)+n(B)+n(C)-n(A∩B)-n(A∩C)-n(B∩C)+n(A∩B∩C).

7. [5] Formally show that cross product is not commutaitve, i.e. A×B≠B×A.

8. [5] Show that we can represent the pairs (a, b) as sets {a, {a, b}} retaining
the property: (a, b)=(b, a) iff a=b.
9. [2] Determine whether these statements are true or false.
a) ∅ ∈ {∅} _______
b) ∅ ∈ {∅, {∅}} _______
c) {∅} ∈ {∅} _______
d) {∅} ∈ {{∅}} _______
e) {∅} ⊂ {∅, {∅}} _______
f ) {{∅}} ⊂ {∅, {∅}} _______

10. [4] Prove that P(A)⊆P(B) if and only if A⊆B.

11. [4] Translate each of these quantifications into English and determine its
truth value.
a) ∃x∈ R (x3 = −1)

b) ∃x∈ Z (x + 1 > x)

c) ∀x∈ Z (x − 1 ∈ Z)

d) ∀x∈ Z (x2 ∈ Z)
12. [5] Describe a procedure for listing all the subsets of a finite set.

13. [5] The successor of the set A is the set A∪{A}. Find the successor of the
successor of the following sets:
a) {1, 2, 3}

b) ∅

c) {∅}

d) {∅, {∅}}

14. [5] Let A={3·a, 2·b, 5·c} and and B={7·a, 1·b, 4·d} be the multisets. Find:
a) A ∪ B.

b) A ∩ B.

c) A − B.

d) B − A.

e) A + B.
15. [5] Let F={0.6 Alice, 0.9 Brian, 0.4 Fred, 0.1 Oscar, 0.5 Rita} be the set of
famous people, e.g. Alice has a 0.6 degree of membership in F. Also suppose
that R = {0.4 Alice, 0.8 Brian, 0.2 Fred, 0.9 Oscar, 0.7 Rita} is the set of rich
people. Find:
a) Fc (the fuzzy set of people who are not famous)

b) Rc (the fuzzy set of people who are not rich)

c) The fuzzy set F∪R of rich or famous people

d) The fuzzy set F∩R of rich and famous people

16. [5] Show that a set S is infinite if and only if there is a proper subset A of S
such that there is a one-to-one correspondence between A and S.

17. [5] Suppose that f: Y → Z and g: X → Y are invertible functions. Show that
the inverse of the composition f◦g is given by (f◦g)−1 = g−1◦f−1.
18. [10] Describe addition and subtraction for each of the following systems
of numbers providing their rules, and their overflow and underflow cases.
a) unsigned numbers
b) signed two’s complement numbers
c) sign-magnitude numbers
Also device ways to resolve the overflow and underflow cases for each.
19. [5] Let S be a subset of a universal set U . The characteristic function fS of
S is the function from U to the set {0, 1} such that fS(x)=1 if x belongs to S, and
fS(x)=0 otherwise. Let A and B be sets. Show that for all x ∈ U,

a) fA∩B (x) = fA(x) · fB(x)

b) fA∪B (x) = fA(x) + fB(x) − fA(x) · fB(x)

c) fAc(x) = 1 − fA(x)

d) fA⊕B(x) = fA(x) + fB(x) − 2fA(x) · fB(x)

20. [5] Data are transmitted over a particular Ethernet network in blocks of
1500 octets (blocks of 8 bits). How many blocks are required to transmit the
150 kilobytes of data over this Ethernet network? (Note that a byte is a
synonym for an octet, a kilobyte is 1000 bytes bytes.)
21. [5] Let f : R → R and let f (x) > 0 for all x ∈ R. Show that f (x) is strictly
increasing if and only if the function g(x) = 1/f (x) is strictly decreasing.

22. [5] Determine whether each of these functions is a bijection from R to R.

a) f (x) = 2x + 1

b) f (x) = x2 + 1