You are on page 1of 4

University of Aden

Faculty of Engineering
Even Semester Final Examination (2006-2007)

Subject: Discrete Maths Date: / 6 /2007
Class : B2CS/B2CSE/B2IT/B2ITE Time : 2 hours

ANSWER ANY FOUR QUESTIONS

1# (a) What is the Probability that two persons have the same birthday? Assume that all the 366
dates are equally likely.
(b) Draw the following graphs: L
5
, M
9
, K
2,4
, Q
3


2# (a) Find all the CUT_Edges and CUT_Vertices in the following graphs:






(b) Let f(x) = 4x + 3, and g(x) = 6x - 1. Find f g , and gf


3# (a) How many vertices and edges do the following graphs have?
(i) Q
4
(ii) C
n
(iii) W
6
(iv) K
3,4



(b) State whether the argument given is valid or not. If it is valid, identify the
tautology on which it is based:
If you invest in stack market you get rich. If you get rich then you become
happy. Therefore, if you invest in stack market you become happy.


4# (a) Show that the following proposition is Contradiction;

( ( ( ) ) ) B B A A .

using
(i) Logical equivalences
(ii) Truth table

(b) Prove or disprove each of the following statements:
1.
(
x x = for all real numbers x
2.

x x 2 2 =
for all real numbers x
3.
( ( (
y x xy = x,y are real numbers


e
i
j
c
h
d
g
b
a
f
5# (a) Let P(x,y) be " x has taken the course y" where the universe of discourse for x is set of
the students and for y is the set of computer science courses. Express each of the
following quantifications in English:

(i)
) , ( y x P
x y
-
(ii)
) , ( y Omer P
y
-
(iii) ) , ( y x P
y x
-


(b) Define a Recursive and an Explicit formulae for each of the following sequences:
(i) 4, 6, 9, 13, 18, 24, 31,
(ii) 89, 79, 69, 59, 49, 39,


6# (a) Determine whether each of the following functions from Z to Z is
one-to-one, and/or onto functions:
(i) 1 ) (
3
+ =
n
n f (ii)
(
(
(

=
2
) (
n
n f



(b) For each of the following relations on the set {1,2,3,4}, decide whether it is
Reflexive, Symmetric, Asymmetric, AntiSymm or Transitive;

1. {(1,1), (2,2), (2,4), (3,2), (3,3), (3,4)}

2. {(1,1), (1,2), (2,1), (2,2), (3,3), (4,4)}

3. {(1,3), (1,4), (2,3),(2,4),(3,1), (3,4),(4,1),(4,2)}













University of Aden
Faculty of Engineering
Even Semester Final Re-Examination (2006-2007)

Subject: Discrete Maths Date: / /2007
Class : B2CS/B2CSE/B2IT/B2ITE Time : 2 hours

ANSWER ANY FOUR QUESTIONS

1# (a) For which value of n are the following graphs are Bipartite?
(i) K
n
(ii) M
n
(iii) Q
n


(b) Let A= { a, b, d, e, h, r }. Identify each as True or False

(i) A b h _ } , { (ii)
A e |
(iii)
A c b a _ } , , {
(iv)
A r e
(v)
A d e } {



2# (a) A sequence of 10 bits is randomly generated.
(i) What is the probability that the number generated is 1024
(ii) What is the probability that only one of these bits is 0.


(b) Give the Relation R from A={0,1,2,3,4} to B= {0,1,2,3,4,5} , (a,b)
e
R
if and only if: b a > 1

3# (a) Determine whether the following graphs are bipartite?










(b) Does there exist a Simple Graph with six vertices of the following degrees:
(i) 1,1,2,3,4,5 (ii) 2,3,3,3,3,2 (iii) 0,3,3,3,3,2

4# (a) Determine whether each of the following functions from {a, b, c, d} to itself is
one-to-one, and/or onto functions:
(i) f(a) = b, f(b) = a, f(c) = c, f(d) = d
(ii) f(a) = b, f(b) = b, f(c) = d, f(d) = c
(iii) f(a) = d, f(a) = b, f(c) = c, f(d) = d
b
a
c
e
d
a
b
c
d

a
b
c
d
e
G
1
G
2

G
3


(b) Let f(x) = 4x + 3, and g(x) = 6x - 1. Find (f.g)(3) , and (g + f)(5)


5# (a) Let P(x) be the statement Student x knows OOP . Express each of the following as
quantifications of P(x) :

1. Some students know OOP.
2. Not every student knows OOP.
3. Salem knows OOP
4. No student knows OOP.

(b) Find the following values:
(i)
(

(
(
(

+
(

5
1
5
5
1
(ii)
(

4
7

(III)
(
4 . 2 3 . 2 9 . 5 +
(IV)
(
4 . 6




6# (a) State whether the argument given is valid or not. If it is valid, identify the
tautology on which it is based:

If you do every problem in this book, then you will learn OOP. You learned
OOP. Therefore, you did not do evey problem in this book.

(b) Let
(
(

=
3
) (
2
x
x f . Find f(s) if
1. s = { -2, -1, 0, 1,2}
2. s = { 0, 1,2,,5}

You might also like