Faculty of Computer Studies

MT131 – Discrete Mathematics

Take Home Exam for Final Assignment (Spring 2019/2020)

Cut-Off Date: ---

Duration: 48 Hours
Total Marks: 100
Contents
Warnings and Declaration……………………………………………………………… 1
Question 1...……………………….…………………………………………………………… 2
Question 2…..………………………………………………………………………………….. 3
Question 3 ………….………..………………………………………………………………… 4
Question 4 ………….………..…………………………………………………………………. 5
Question 5 ………….………..…………………………………………………………………. 6

Plagiarism Warning:
As per AOU rules and regulations, all students are required to submit their
own STMA work and avoid plagiarism. The AOU has implemented
sophisticated techniques for plagiarism detection. You must provide all
references in case you use and quote another person's work in your STMA.
You will be penalized for any act of plagiarism as per the AOU's rules and
regulations.

Declaration of No Plagiarism by Student (to be signed and submitted by

student with STMA work):

I hereby declare that this submitted STMA work is a result of my own efforts
and I have not plagiarized any other person's work. I have provided all
references of information that I have used and quoted in my STMA work.

Name of Student: ………………………………..

Signature: …………………………………………...
MT131 – Discrete Mathematics Page 1 of
10
Date: ……………………………………………………
Answer the following questions:

Q‒1. [2×10 marks] In the questions below suppose that a “word” is any string
of seven letters of the alphabet, with repeated letters allowed.

MT131 – Discrete Mathematics Page 2 of

10
 a) How many words begin with R and end with T?

R 26 26 26 26 26 T
26 × 26 × 26 ×26 ×26 = 26 = 11881376
b)How many words begin with A or B?

A 26 26 26 26 26 26

OR
B 26 26 26 26 26 26
26 + 26 = 2 × 26 = 617831552

c) How many words begin with A or end with B?

A 26 26 26 26 26 26

OR
26 26 26 26 26 26 B
= 26 + 26 - 26 = 26 × 51 = 605950176
d) How many words begin with A or B and end with A or B?

A 26 26 26 26 26 B

OR
A 26 26 26 26 26 A

OR

B 26 26 26 26 26 A

OR
B 26 26 26 26 26 B
= 265 +265+265 +265
= 4 × 26 = 47525504

MT131 – Discrete Mathematics Page 3 of

10
 e) How many words begin with A or B or end with A or B?

A 26 26 26 26 26 26

OR
B 26 26 26 26 26 26

OR

26 26 26 26 26 26 A

OR
26 26 26 26 26 26 B
2 × 26 + 2 × 26 - 4 × 26 = 100× 26 = 1188137600

f) How many words begin with a vowel and end with a vowel?

5 26 26 26 26 26 5
5×5× 26 = 25 × 26 = 297034400

g) How many words begin with a vowel or end with a vowel?

5 26 26 26 26 26 26
OR
26 26 26 26 26 26 5
5 × 26 + 5 × 26 - 25 × 26 = 235 × 26 = 2792123360

h) How many words begin with AAB in some order?

A A B 26 26 26 5
3! × 26 = 6 × 26 = 2741856

MT131 – Discrete Mathematics Page 4 of

10
 i) How many words have no vowels?
21 21 21 21 21 21 21
S→21
21 21 21 21 21 21 21
21 = 1801088541
j) How many words have exactly one vowel?
5 × 7 × 𝟐𝟏𝟔 = 3001814235

MT131 – Discrete Mathematics Page 5 of

10
Q‒2. [4×5 marks] A box contains 24 transistors, 4 of which are defective. If 4
are sold at random, find the following probabilities.

There are ways to sell four transistors, so the denominator in

each case will be

b)

P (All defective)

MT131 – Discrete Mathematics Page 6 of

10
Q‒3. [10+10 marks] Find the transitive closure of 𝑅 if 𝑀 is
1 0 0
a) 0 1 1 .
1 0 1

1 0 1 0
1 0 0 1
b) .
0 1 1 0
0 1 0 0

𝑅 = {(𝑎, 𝑎), (𝑎, 𝑐), (𝑏, 𝑎), (𝑏, 𝑑), (𝑐, 𝑏), (𝑐, 𝑐), (𝑑, 𝑏)}
𝑅 = {(𝑎, 𝑐), (𝑎, 𝑏), (𝑎, 𝑐), (𝑏, 𝑎), (𝑏, 𝑐), (𝑏, 𝑏), (𝑐, 𝑎), (𝑐, 𝑑), (𝑐, 𝑏), (𝑑, 𝑎), (𝑑, 𝑑)}
𝑅 = {(𝑎, 𝑐), (𝑎, 𝑏), (𝑎, 𝑐), (𝑎, 𝑎), (𝑎, 𝑑), (𝑏, 𝑐), (𝑏, 𝑏), (𝑏, 𝑎), (𝑏, 𝑑), (𝑐, 𝑐)
, (𝑐, 𝑏), (𝑐, 𝑎) , (𝑐, 𝑑), (𝑑, 𝑎), (𝑑, 𝑐), (𝑑, 𝑏)}
𝑅 = {(𝑎, 𝑐), (𝑎, 𝑏), (𝑎, 𝑐), (𝑎, 𝑎), (𝑎, 𝑑), (𝑎, 𝑐), (𝑏, 𝑐), (𝑏, 𝑏), (𝑏, 𝑎), (𝑏, 𝑑), (𝑐, 𝑐)
, (𝑐, 𝑏), (𝑐, 𝑎), (𝑐, 𝑑), (𝑑, 𝑐), (𝑑, 𝑏), (𝑑, 𝑎), (𝑑, 𝑑)}
∗
𝑅 = {(𝑎, 𝑎), (𝑎, 𝑐), (𝑏, 𝑎), (𝑏, 𝑑), (𝑐, 𝑏), (𝑐, 𝑐), (𝑑, 𝑏), (𝑎, 𝑏), (𝑏, 𝑐), (𝑏, 𝑏), (𝑐, 𝑎)
, (𝑐, 𝑑), (𝑑, 𝑎), (𝑑, 𝑑), (𝑎, 𝑏), (𝑎, 𝑑), (𝑏, 𝑏), (𝑑, 𝑐), (𝑑, 𝑏)}

MT131 – Discrete Mathematics Page 7 of

10
Q‒4. [12+8 marks] Suppose 𝐴 is the set composed of all ordered pairs of
positive integers. Let 𝑅 be the relation defined on 𝐴 where (𝑎, 𝑏)𝑅(𝑐, 𝑑)
means that 𝑎 + 𝑑 = 𝑏 + 𝑐.

A-Given that A = (𝒂, 𝒃)|𝒂, 𝒃 ∈ 𝒛+

Define a relation on A such that
(a,b) R (c,d) iff a+d=b+c
i- Clearly (a,b) R (a,b) ꓯ (a,b) ∈ A
a+b=b+a
therefore this relation is reflexive

ii-suppose that (a,b) R (c,d)

suppose that a+d=b+c
suppose that d+a=c+b
suppose that c+b=d+a
suppose that (c,d) R (a,b)
Therefore this relation is symmetric

iii- Let (a,b) R (c,d) and (c,d) R (x,y) :

ꓯ (a,b) ,(c,d) ,(x,y) A

A+d=b+c c+y=d+x
A=b+c-d y=d+x-c
a+y= b+c-d+d+x-c
a+y=b+x
(a,b) R (x,y)
Therefore this relation is transitive
From (i), (ii)and(iii) : it is clear that given relation is an
equivalence relation on A

MT131 – Discrete Mathematics Page 8 of

10
 B - we find

It is called equivalence class

Of .

MT131 – Discrete Mathematics Page 9 of

10
Q‒5. [10+10 marks] Find an ordered pair, an adjacency matrix, and a graph
representation for the graph of:
a) 𝐾 .
𝑉 = {1,2,3,4,5,6}
𝐸 = {(1,2), (1,3), (1,4), (1,5), (1,6), (2,3), (2,4), (2,5), (2,6), (3,4),
, (3,5), (3,6), (4,5), (4,6), (5,6)}
1
0 1 1 1 1 1
⎡1 0 1 1 1 1⎤
⎢ ⎥
1 1 0 1 1 1⎥
𝑀=⎢ 2 3
⎢1 1 1 0 1 1⎥
⎢1 1 1 1 0 1⎥
⎣1 1 1 1 1 0⎦

4 5

b) 𝑊 :
Wn = n + 1 , 5+1 = 6
6
𝑽 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔}
𝑬 = {(𝟏, 𝟐), (𝟏, 𝟓), (𝟏, 𝟔), (𝟐, 𝟑), (𝟐, 𝟔), (𝟑, 𝟒), (𝟑, 𝟔), (𝟒, 𝟓), (𝟒, 𝟔), (𝟓, 𝟔)}

A 𝐵 𝐶 𝐷 𝐸 𝐹
𝐴 0 1 0 0 1 1
⎡ 𝐵 1 0 1 0 0 1⎤
⎢ ⎥ 1=A 2=B
𝐶 0 1 0 1 0 1⎥
𝑀=⎢
⎢ 𝐷 0 0 1 0 1 1⎥
⎢ 𝐸 1 0 0 1 0 1⎥
⎣ 𝐹 1 1 1 1 1 0⎦
F=6

5=E 3=C

4=D
MT131 – Discrete Mathematics Page 10 of
10