ALLAMA IQBAL OPEN UNIVERSITY, ISLAMABAD

(Department of Mathematics)
WARNING
1.
2.

PLAGIARISM OR HIRING OF GHOST WRITER(S) FOR SOLVING

THE ASSIGNMENT(S) WILL DEBAR THE STUDENT FROM AWARD
OF DEGREE/CERTIFICATE, IF FOUND AT ANY STAGE.
SUBMITTING ASSIGNMENTS BORROWED OR STOLEN FROM
AIOU PLAGIARISM POLICY.

Level: BS (CS)
Total Marks: 100

Course: Discrete Mathematics (3406)

Semester: Autumn, 2016
Pass Marks: 40

ASSIGNMENT No. 1
(Units 1-4)
All questions carry equal marks.
Q.1 (a)
b)

Q.2 a)
b)

Use truth table to establish that whether the given statement is a tautology or
a contradiction.
(20)
(p~q) (~pq)
Write negation of the following statements:
i)
If x is non-negative then x is positive or x is zero.
ii)
If I am feeling headache then I will not take class.
Construct a digital logic circuit for the expression:
p (~pQ)
Compute the following summation:
n

K 1

Q.3 a)
b)
Q.4 a)

1
K

1
K 1

(20)

Prove the following statement by mathematical induction:

1 + 2 + 3 ++n = n (n+1) (2n+1)
6
Prove that 32n-1 is divisible by 8 for n 0.

(20)

Consider the following Venn diagram:

(20)

AAaaaaaaaaaaa
B

b)
Q.5 a)
b)

Then shade the region corresponding to set A- (BC)

Find the power set of the following set A= {a, b, c}.
How many positive two-digit integers are multiples of 3.
(20)
What is the probability that a randomly chosen 4 digit code (consisting of
0,1,2,3 and 4) has at least one repeated digit?

ASSIGNMENT No. 2
(Units 4-8)
Total Marks: 100

Pass Marks: 40
All questions carry equal marks.

Q.1 Let X= {1, 2, 3} and Y= {4, 5, 6}

a)
b)
Q.2 a)
b)
Q.3 a)
b)
Q.4 a)
b)
Q.5 a)

b)

(20)

Construct at least 5 arrow diagrams that represent a function f from X to Y.

Construct a function f: XY that is one-to-one but not onto.
How many cards you must pick from a standard desk of 52 cards, to be sure
of getting at least one picture card.
(20)
For the function f(x) = 2x+5.Find f-1(x) and prove that fof-1(x) = x.
Prove that the sequence defined by: 0,1,3,7... 2 n-1,
n 0 satisfies the
recursive relation d k= 3dk-1 - 2dk-2
(20)
Find the general formula of a sequence which is defined recursively as:
dk = 2dk-1 +3,
k2, d1 = 2
Let the sequence bn is defined by bn= C3n +D (-2)n .Find C and D so that
bo = 0,b1 = 5 also find b2
(20)
Define Geometric sequences and explain the formula of sums with the help
of example.
Find an order for the algorithm segment from amongst the set of power
function:
(20)
For i: = 3 to n-1
a: = 3.n +2.i 1
next i
Draw the graph with four vertices of degrees 1, 2, 3, and 4 if possible.