Sri Lanka Institute of Information Technology

Year 1 Semester II 2012

Foundation of computer science
Assignment 1
Chapter 1 - Logic
1. Simplify the following propositions using the laws of algebra.
i) ( ) ( ) ( ) q p r q p q p ~ ~ ~ ~ ~ v v . . v . ii) ( ) ( ) ( ) r q r p q p v v . v ~
iii) ( ) ( ) ( ) | | r r q r p q p . . v
2. Let p : n is prime.
q : n is odd or n is 2.
Write down the Converse, Inverse and Contrapositive of q p .
3. Let p, q and r be propositions. Justify using truth tables.
i) ( ) ( ) r q p r q p
ii) ( ) | | q q q p ~ ~ ~ ~ ~ v
iii) ( ) ( ) ( ) r q p r p q p . .
4. Determine, by using a truth table, whether the proposition ( ) ( ) q p q p v ~
is a tautology.
5. Taking p : Computers are used in industry.
q : Unemployment problem is resolved.
r : Economic development is achieved.
Express each of the following propositions in the symbolic form.
i) If computers are not used in industry then unemployment problem is resolved.


ii) If computers are used in industry and the unemployment problem is resolved then
economic development is not achieved.
iii) If the economic development is achieve or computers are not used in industry
then the unemployment problem is not resolved.

Chapter 2 Set Theory
1 Let { } 8 s e =
+
x Z x U and A, B and C are the subsets {1,2,3}, {2,3,5,7,6} and
{1,3,6,8} respectively.
i) Find the following subsets of U.
( )
c c
C B A and ( ) ( )
c
C B C A
ii) Find
C A
( ) B C A
( ) C B A
C B A
2 Determine which of the following sets are equal to the empty set
i) { } 8
2
s e
+
x Z x
ii) { } 2 2
2
= = e x and x R x
iii) { } 2
2
= e x Z x
iv) { } 2 1 < < e x R x
3 Prove that ( )
c c c
B A B A =



Chapter 3 Counting Techniques

1. How many odd integers from 10 through 99 have distinct digits?
2. Suppose the group of fourteen consists of five men and nine women.
(a) How many six-person teams can be chosen that consist of 3 men and 3 women?
(b) How many six-person teams contain at least one man?
(c) How many six-person teams contain at most one man?


3. Find
i)

ii)
iii)
iv)
v)
vi)
vii)
viii)
4. Simplify: i)
)! 1 (
!
+ n
n
ii)
)! 1 (
!
n
n
iii)
!
)! 1 (
n
n +

) 1 ( + n
n
iv)
( ) 2 !
)! 3 (
+
+
n n
n

4 How many distinguishable permutations are there of the letters in the following words?
i) MISSISSIPPI ii) AMARASARA

5 How many different arrangements can be made using the letters in the word TEETH, if
the word must start with H?

6 Expand the following expression using the binomial theorem.
i) ( )
8
2y x + ii)
7
4
5
4
|
|
.
|

\
|
+
y
x
7 Find the coefficient of
20 15
b a when
10
4
3
5
2
|
|
.
|

\
|
+
b
a is expanded by the binomial theorem.
8 i) In how many ways can 10 people be seated around a circular table?
ii) In how many ways can they be seated if 2 of them insist on sitting next to each other?

Chapter 4 Method of Proof
Prove the following theorems.
1 If n is odd integer then n n +
2
is even.
2 For all integers n, if n is prime then( ) 1 1 =
n
.
3 The product of any even integer and any integer is even.
4 The square of any rational number is rational.
5 The sum of any three consecutive integers is divisible by 3. (Two integers are
consecutive if, and only if, one is one more than the other.)
6 The product of any two even integers is a multiple of 4.
7 Prove or disprove that for all real numbers and .
8 Prove or disprove that for all real numbers and .
9 Prove or disprove that for all real numbers and .
Chapter 5 Mathematical Induction
1 Prove by mathematical induction, when 2 > n
n
n
n 2
1 1
1 * ... *
3
1
1 *
2
1
1
2 2 2
+
= |
.
|

\
|
|
.
|

\
|
|
.
|

\
|



2 Prove that by mathematical induction
( )( ) 1 2 1 2 1 2
1
...
7 . 5
1
5 . 3
1
3 . 1
1
+
=
+
+ + + +
n
n
n n


for all positive integers 1 > n .
3. Prove by using mathematical induction 1 2 2 ... 2 2 2 1
1 3 2
= + + + + +
+ n n
for all
integers 0 > n .
4 For all integers 1 > n , 1 4
n
is divisible by 3.


Submit on or before 2012.08.15