(2½ Hours) [Total Marks: 75

N. B.: (1) All questions are compulsory.

(2) Make suitable assumptions wherever necessary and state the assumptions made.
(3) Answers to the same question must be written together.
(4) Numbers to the right indicate marks.
(5) Draw neat labeled diagrams wherever necessary.
(6) Use of Non-programmable calculators is allowed.

1. Attempt any three of the following:

a. Let A = {c, d, f, g}, B = { f, j }, and C = {d, g}.

Answer each of the following questions. Give reasons for your answers.
a. Is B ⊆ A?
Ans False because j Є B but j does not Є A 1½ Mark
b. Is C ⊆ A?
Ans True All elements of Set C Є Set A 1 Mark
c. Is C ⊆ C?
Ans True Every Set is a subset of itself 1½ Mark
d. Is C a proper subset of A?
Ans True Set A has more elements than set C 1 Mark

b. Let S = {2, 4, 6} and T = {1, 3, 5}. Use the set-roster notation to write each of the following
sets, and indicate the number of elements that are in each set:
a. S × T
Ans { (2,1),(2,3),(2,5),(4,1),(4,3),(4,5),(6,1),(6,3),(6,5)} 1½ KMark
b. T × S
Ans { (1,2),(3,2),(5,2),(1,4),(3,4),(6,4),(1,6),(3,6),(5,6)} 1½ KMark
c. S × S
Ans { (2,2),(2,4),(2,6),(4,2),(4,4),(4,6),(6,2),(6,2),(6,6)} 1 KMark
d. T × T
Ans { (1,1),(1,3),(1,5),(3,1),(3,3),(3,5),(5,1),(5,3),(5,5)} 1 KMark

c. Use De Morgan’s laws to write negations for the statements below

a) Hellen is a math major and Hellen’s sister is a computer science major.
Ans Hellen is not a math major or Hellen’s sister is not a computer science major. 1 M
b) Sam is an orange belt and Kate is a red belt.
Ans Sam is not an orange belt or Kate is not a red belt. 1 Mark
c) The connector is loose or the machine is unplugged.
Ans The connector is not loose and the machine is not unplugged. 1 Mark
d) This computer program has a logical error in the first ten lines or it is being run
with an incomplete data set.
Ans This computer program has no logical error in the first ten lines and it is not
being run with an incomplete data set. 1 Mark
e) The dollar is at an all-time high and the stock market is at a record low.
Ans The dollar is not at all-time high or the stock market is not at a record low. ½ M
g) The train is late or my watch is fast.
Ans The train is not late and my watch is not fast. ½ Mark
d. Prove the following using truth table
a) p -> q = ~p v q 1 Mark
b) p <-> q = (~p v q) ^ (~q v p) 2 Mark
c) p ^ (q v r) = (p ^ q) v (p ^ r) 2 Mark

Ans of (a) and (b)

 p q ~p ~q P v ~q ~p v q P -> q P <-> q (~pvq) ^ (~q v p)
T T F F T T T T T
T F F T T F F F F
F T T F F T T F F
F F T T T T T T T

p Q r P^q P^r qvr P ^(q v r) (p^q) V (p ^ r)

T T T T T T T T
T T F T F T T T
T F T F T T T T
T F F F F F F F
F T T F F T F F
F T F F F T F F
F F T F F T F F
F F F F F F F F
e. Let A = {a, b}, B = {1, 2}, and C = {2, 3}. Find each of the following sets.
a. A × (B ∪ C)
(B U C) = {1,2,3} 2½ Marks
A x (B U C) = { (a,1), (a,2), (a,3), (b,1), (b,2), (b,3)}
b. (A × B) ∪ (A × C)
(A x B) = { (a,1), (a,2), (b,1), (b,2)} 2½ Marks
(A x C) = { (a,2), (a,3), (b,2), (b,3)}
(A x B) U (A x C) = { (a,1), (a,2), (a,3), (b,1), (b,2), (b,3)}

f. Let E = {1, 2, 3} and F = {−2,−1, 0} and define a relation T from E to F as follows: For all (x, y) ∈
E × F, (x, y) ∈ T means that (x – y)/3 is an integer.
a. Is 3 T 0? Is 1T (−1)? Is (2,−1) ∈ T? Is (3,−2) ∈ T ?
Y, N, Y, N 2 Marks
b. Write T as a set of ordered pairs.
{ (1,-2), (2,-1), (3,0)} 1 Mark
c. Write the domain and co-domain of T .
domain {1,2,3} co-domain {-2, -1 0 } 1 Mark
d. Draw an arrow diagram for T .
1 -2
2 -1
3 0

2. Attempt any three of the following: 15

a. Let D = {−48, −14, −8, 0, 1, 3, 16, 23, 26, 32, 36}.
Determine which of the following statements are true and which are false. Provide
counterexamples for those statements that are false.
a. ∀x ∈ D, if x is odd then x > 0.
True 1 Mark
b. ∀x ∈ D, if x is less than 0 then x is even.
True 1 Mark
c. ∀x ∈ D, if x is even then x ≤ 0.
False ∀x ∈ D, if x is even then x ≤ 36. 1 Mark
d. ∀x ∈ D, if the ones digit of x is 2, then the tens digit is 3 or 4.
True 1 Mark
e. ∀x ∈ D, if the ones digit of x is 6, then the tens digit is 1 or 2.
False ∀x ∈ D, if the ones digit of x is 6, then the tens digit is 1 or 2 or 3. 1 Mark
b. Rewrite the statement “No good cars are cheap” in the form “∀x, if P(x) then ∼Q(x).”
Indicate whether each of the following arguments is valid or invalid, and justify your
answers. 5 Marks
a. No good car is cheap.
A Rimbaud is a good car.
∴ A Rimbaud is not cheap.
 Valid
b. No good car is cheap.
A Simbaru is not cheap.
∴ A Simbaru is a good car.
Valid
c. No good car is cheap.
A VX Roadster is cheap.
∴ A VX Roadster is not good.
Valid
d. No good car is cheap.
An Omnex is not a good car.
∴ An Omnex is cheap.
Valid
c. Show that If r and s are any two rational numbers, then r+s2 is rational.
Ans Let r = a/b and s = c/d as r and s are rational numbers and a,b,c,d are integers
R + s = a/b + c2/d2
R + s = (ad2 + c2b)/bd2
Here r + s is represented as ratio of integers
Hence r + s is rational 5 Marks
d. In a certain town 2/3 of the adult men are married to 3/5 of the adult women. Assume that
all marriages are monogamous (no one is married to more than one other person).
Also assume that there are at least 100 adult men in the town. What is the least
possible number of adult men in the town? of adult women in the town?
Ans Adult men 108 & Adult Female 120 5 Marks
e. Prove that for all integers m and n, m + n and m – n are either both odd or both even.
Proof Let m & n both are even 5 Marks
Let m = 2r and n = 2s then m + n = 2r + 2s
M + n = 2(r+s)
Which means m + n is even
M – n = 2r – 2s
M – n = 2(r – s)
Which means m – n is odd
Let m & n both are odd
Let m = 2r + 1 and n = 2s + 1
M + n = 2r + 1 + 2s + 1
M + n = 2( r + s + 1)
Therefore m +n is odd when both m and n are odd
M – n = 2r + 1 – 2s – 1
M – n = 2(r – s) is even
Let m is odd and n is even
Then m= 2r + 1 and n = rs
M + n = 2r + 1 + 2s
M + n = 2(r+s) + 1
Which means m + n is odd
M – n = 2r + 1 – 2s
M – n = 2(r –s ) + 1
Which means m – n is odd
f. Prove that for all integers n, n2 − n + 3 is odd.
Let n is odd therefore n = 2r + 1
Now (2r+1)2 – (2r + 1) + 3
= 4r2 + 4r + 1 – 2r – 1 + 3
= 4r2 + 2r + 3
Here r be any integer 4rr and 2r will be always even but 3 is odd
Therefore n2 – n + 3 is odd

Let n be even therefore n = 2r

Now n2 – n + 3 = 4r2 - 2r + 3
Here r be any integer 4rr and 2r will be always even but 3 is odd
Therefore n2 – n + 3 is odd
3. Attempt any three of the following: 15
a. Prove that n! + 2 is divisible by 2, for all integers n ≥ 2.
Mathematical Induction

b. Prove that 7n − 1 is divisible by 6, for each integer n ≥ 0.

Mathematical Induction

c. Let A = {0, 1, 2, 3, 4}, and define functions f : A→A and g : A→A as follows: For each x ∈ A,
f (x)=(x + 4)2 mod 5 and g(x)=(x2 + 3x + 1) mod 5. Is f = g? Explain.
F(x) = { (0,1), (1,0), (2,1), (3,4), (4,4)} 5 Marks
G(x) = { (0,1), (1,0), (2,1), (3,4), (4,4)}
Yes f = g

d. Define g: Z → Z by the rule g(n) = 4n − 5, for all integers n.

(i) Is g one-to-one? Prove or give a counterexample.
Yes g is one-one 2½ Marks
(ii) Is g onto? Prove or give a counterexample. 2 ½ Marks
No g is not onto because let x = 4n – 5 then n = (x + 5) / 4 and n is not in Z for x = 0,1, 2
e. Explain
a) One-one function Definition 1 Mark
b) Onto function Definition 1 Mark
c) Inverse of a function Definition 1 Mark
d) Cardinality Definition 1 Mark
e) Composite function Definition 1 Mark

e. Define G: R × R → R × R as follows:
G(x, y) = (y−2x) for all (x, y) ∈ R × R.
a. Is G one-to-one? Prove or give a counterexample.
Yes G is one-one 2½ Marks
b. Is G onto? Prove or give a counterexample.
Yes G is onto 2½ Marks

4. Attempt any three of the following: 15

a Define the following:
a) Trail b) Connected Graph c) Spanning Tree d) Hamiltonian Graph e) Hamiltonian
Cycle
Definitions 1 Mark each
b Find Shortest Path by applying Dijkstra’s Algorithm for the complete weighted graph given
below:

v3 To v6 is 9
c Prove that every non trival tree has at least two vertices of degree 1 by filling in the
details and completing the following argument. Let T be a nontrival tree and let S be the
set of all paths from one vertex to another of T. Among all the paths in S, choose a path P
with the most edges. (Why is it possible to find such a P?) What can you say about the
initial and final vertices of P? Why?
Proof.
d I) Draw all nonisomorphic graphs with six vertices, all having degree 2.
ii) Draw four nonisomorphic graphs with six vertices, two of degree 4 and four of degree 3.
e Let S = {(0, 0), (0, 3), (1, 0), (1, 2), (2, 0), (3, 2)}. Find St , the transitive closure of S.
St = { (0,0), (0,3), (1,0), (1,2), (2,0), (3,2), (0,2), (3,0),(2,3),(2,2)}
f i) If R and S are reflexive, is R ∩ S reflexive? Why?
R ∩ S is reflexive: Suppose R and S are reflexive. 2 Marks
To show that R ∩ S is reflexive, we must show that ∀x ∈ A, (x, x) ∈ R ∩ S.] So suppose x ∈
A. Since R is reflexive, (x, x) ∈ R, and since S is reflexive, (x, x) ∈ S. Thus, by definition of
intersection, (x, x) ∈ R ∩ S
ii) If R and S are symmetric, is R ∩ S symmetric? Why?
Yes 1½ Marks
iii) If R and S are transitive, is R ∩ S transitive? Why?
Yes 1½ Marks

5. Attempt any three of the following: 15

a. i. How many five-digit integers (integers from 10,000 through 99,999) are divisible by 5?
18000
ii. What is the probability that a five-digit integer chosen at random is divisible by 5?
0.18001
b. i. If any seven digits could be used to form a telephone number, how many seven-digit
telephone numbers would not have any repeated digits?
9 x 9 x 8 x7 x 6 x 5 x 4 = 544320 (1st digit cannot start with 0) 2 Marks
ii. How many seven-digit telephone numbers would have at least one repeated digit?
9455680 2 Marks
iii. What is the probability that a randomly chosen seven digit telephone number would have
at least one repeated digit?
94.55 % 1 Mark
c. i. How many distinguishable ways can the letters of the word MILLIMICRON be arranged in
order?
1663200 or 11!/2! X 2! X 3! 1½ Marks
ii. How many distinguishable orderings of the letters of MILLIMICRON begin with M and end
with N?
30240 or 9!/2! X 3! 1½ Marks
iii. How many distinguishable orderings of the letters of MILLIMICRON contain the letters CR
next to each other in order and also the letters ON next to each other in order?
151200 ways CR and 151200 ways on next to each other 2 Marks
d. A coin is loaded so that the probability of heads is 0.7 and the probability of tails is 0.3.
Suppose that the coin is tossed twice and that the results of the tosses are independent.
a. What is the probability of obtaining exactly two heads?
P(H1 ∩ H2) = 0.7 X 0.7 = 49 % 2 Marks
b. What is the probability of obtaining exactly one head?
The probability of obtaining exactly one head is 1 Mark
P((H1 ∩ T2) ∪ (T1 ∩ H2))
= P(H1 ∩ T2) + P(T1 ∩ H2)
= P(H1)P(T2) + P(T1)P(H2)
= (0.7)(0.3) + (0.3)(0.7) = 42%.
c. What is the probability of obtaining no heads?
P (T1 x T2) = 0.3 X 0.3 = 9% 1 Mark
d. What is the probability of obtaining at least one head?
1 – P(no heads) = 1 – 0.09 = 0.91 i.e 91% 1 Mark
e. Prove that for all integers n ≥ 2, P(n + 1, 2) − P(n, 2) = 2P(n, 1).
Proof 5 Marks
f. Three officers—a president, a treasurer, and a secretary— are to be chosen from among four
people: Ann, Bob, Cyd,and Dan. Suppose that Bob is not qualified to be treasurer and Cyd’s
other commitments make it impossible for her to be secretary. How many ways can the
officers be chosen? Can the multiplication rule be used to solve this problem?
There are 14 different paths from “root” to “leaf” of this possibility tree, and so there are
14 ways the officers can be chosen. Because 14 = 2· 7, reordering the steps will not make it
possible to use the multiplication rule alone to solve this problem. 5 Marks

_____________________________