AMTH140 Trimester 2 2012

Question 1 [8 marks]
Let A × B = {(1, 1), (2, 2), (3, 1), (3, 2), (1, 2), (1, 4), (2, 1), (2, 4), (3, 4)}. Find the power set of
B, P(B).
Question 2 [8 marks]
Let f (x) = x2 + 3x + 2. Evaluate f (2) and f (−2) by Horner’s method.
Question 3 [10 marks]
Use mathematical induction to show that

n! ≥ 2n−1 for n = 1, 2, . . .

Question 4 [10 marks]

Prove that if f, g : N → R, f1 (n) = O(g1 (n)) and f2 (n) = O(g2 (n)), then f1 (n) + f2 (n) =
O(max(g1 (n), g2 (n)))
Question 5 [8 marks]
In MERGE SORT algorithm, if we are given two sorted lists, LIST1 with n elements and
LIST2 with m elements, what is the maximum number of comparisons required to merge these
two lists into a single sorted list?
Question 6 [6 marks]
Use a truth table to prove that Modus Ponens is a valid argument.
Question 7 [8 marks]
Let G be a graph with seven vertices, such that two vertices have degree one, three vertices
have degree two and two vertices have degree three. Can G be a tree?
If your answer is yes, draw a tree with these properties. If your answer is no, prove that G
cannot be a tree.
Question 8 [6 marks]
Convert 0.1100012 to bases four, eight, and sixteen, respectively.
Question 9 [4 marks]
Given the adjacency matrix
 
 0 1 1 
A =  1 0 1
 

 1 1 1 

draw its corresponding graph.

Question 10 [6 marks]
Use a binary tree to sort the following list of numbers

65, 75, 6, 57, 99, 27, 0, 96

2
 AMTH140 Trimester 2 2012

Question 11 [8 marks]
Let A be the set of all integers greater than or equal to 2, and relation R be defined by
∀m, n ∈ A : (m, n) ∈ R iff m | n
Show that
(a) 7 is a minimal element of A.
(b) 6 is not a minimal element of A.
(c) A does not have any maximal elements.
(d) 2 is not a least element of A.
Question 12 [8 marks]
Given S = {0, 1}, the table below specifies a Boolean function f : S × S × S −→ S
x y z f (x, y, z)
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
(a) Use a Karnaugh map to simplify the Boolean expression corresponding to this function.
(b) Draw a gate implementation for the simplified Boolean expression.

Question 13 [5 marks]
Given that
X n!
(a1 + a2 + · · · + ak )n = an1 · an22 · · · ank k
n1 ,n2 ,...,nk ≥0
n1 ! · n2 ! · · · nk ! 1
n1 +n2 +···+nk =n

write down (a1 + a2 + a3 )3 =?

Question 14 [5 marks]
Let a sequence (xi )i∈N be determined by the recurrence relation
1 + xn+1
xn+2 =
xn
and the initial conditions x0 = a and x1 = b with a, b , 0 . Find x10 .
Please remember – This examination question paper MUST BE HANDED IN.
Failure to do so may result in the cancellation of all marks for this examination.
Writing your name and number on the front will help us confirm that your paper has been returned.