INDIAN INSTITUTE OF TECHNOLOGY, KHARAGPUR

FOUNDATION OF COMPUTING SCIENCES (CS60005)

ASSIGNMENT-1

1. Justify whether the following claims are true or not

+1
= (2

)
2
2
= (2

)

2. Show that the function () =
4
and () =
1/4
for are inverses of each other.

3. Let 1,2, be a countable number of finite sets. Prove that the union = is countable.

4. Let be a relation on the set of natural numbers and is defined by the equation + 3 =
12. Answer the following:-

Write as a set of ordered pairs
Answer the following in ordered pair representation
a. Domain of .
b. Range of .
c.
1

d.
5. Assuming De Morgans law holds for only two sets and using induction prove that De
Morgans law holds good for n number of sets.

6. Let be the set, where is defined on set .
Is it an equivalence relation?
Find the equivalence classes of the relation
7. For each of the following relations, state whether they fulfil each of the 4 main properties
reflexive, symmetric, ant symmetric, and transitive. Briefly substantiate each of your
answers.
The coprime relation on Z. (Recall that a, b Z are coprime if and only if gcd (a, b) =
1.
Divisibility on .
The relation T on R such that aT b if and only if ab Q.
8. In a partially ordered set, a chain is a totally ordered subset. For example, in the set 1, 2,3, 4,
5, 6, the divisibility relation is a partial order and 1, 2, 4 and 1, 3, 6 are chains.
What is the longest chain on the set {1, 2, . . . , n} using the divisibility relation? How
many distinct chains have this length? For the second part, make sure to consider all
positive values of n.
What is the longest chain on the power set of a set A with |A| = n with the
relation? How many distinct chains have this length?

9. Convert the following English statements into propositional logic:-

You can use the software lab if you are a CS major or not a freshman.
It is not the case that if it is raining then John isnt a loud-mouth.
It is raining is not equivalent to John is a loud-mouth.
It is not the case that both Ben and Mark are tall.
You can take the flight if and only if you buy a ticket.
If you dont buy a ticket you cannot take the flight.

10. Let p, q, and r be the following propositions:
P: You get an A on the final exam.
Q: You solve every exercise of the book.
R: You get an A in this class
Write the following formulas using p, q, and r and logical connectives.
i. You get an A in this class but you do not do every exercise in the book.
ii. To get an A in this class it is necessary to get an A in the final.
iii. Getting an A on the final and doing every exercise in the book is sufficient for
getting an A in this class.



--THE END --