Assignment 2 Questions Paper for BITI 1213

Linear Algebra and Discrete Mathematics Thursday, 12 December 2013

INSTRUCTIONS
1. 2. 3. 4. 5. Write your MATRIX NUMBER, NAME, and GROUP (max 2 students) at the top-right corner of the first page of your answer sheets. There are 3 (three) questions. Answer ALL questions. Show all necessary workings neatly. You may use pens to write the answer for questions; but your handwriting must be readable. Your answers have to be submitted by 27 December 2013, at 5 pm at your lecturers office.

QUESTION 1 [30 marks]

Let R be the relation on {1, 2, 3, 4, 5} such that R = {(1, 1), (1, 3), (1, 5), (2, 2), (2, 4), (3, 1), (3, 3), (3, 5), (4, 2), (4, 4), (5, 1), (5, 3)}. 1. Determine whether R is: (a) reflexive. (b) symmetric. (c) antisymmetric. (d) transitive. 2. Find: (a) the reflexive closure (b) the symmetric closure (c) the transitive closure of R. 3. Is R an equivalence relation? Give your reason.
QUESTION 2 [30 marks]

1. 2. 3. 4.

State the definition of a circuit State the definition of an Euler circuit State the definition of an Euler graph Draw the graph , where

and ) and

( )( )( )( )( )( )( )( determine whether or not it is an Euler graph. Justify your answer. 5. Based on the given weighted graph in Figure 1, i) Find the length of a shortest path between a and z. ii) Find a shortest path between a and z.

Figure 1
QUESTION 3 [30 marks]

1.

Given a sequence of numbers: 40, 20, 80, 17, 95, 120, 99, 27, 36, 55, 60, 44. i) Draw the binary search tree for the numbers. ii) Determine the order if we want to travel through the tree by using a) preorder traversal b) inorder traversal c) postorder traversal

2.

By using a table, express the values for each of these Boolean functions:
F ( x, y, z ) x y ( xyz )

3.

Construct circuits from inverters, AND gates and OR gates to produce the output:

-END-