Week 7: Formative Task

1. a) Draw the directed graphs of each of the following

i. {(1,2), (1,3), (1,4), (2,3), (2, 4), (3,4)}
ii. {(1,1), (1,4), (2,2), (3,3), (4, 1), (4,4)}
iii. The binary relation 𝑥 ≈y defined on the set 𝑆 = {1,2,3,4} by 𝑦 = 𝑥 2
b) Are the graphs in a) reflexive? Symmetric? Asymmetric? Transitive?

2. Use Warshall’s algorithm to find the shortest paths of the following weighted
graph

3. Represent the following graph in memory using the adjacency matrix, edge list
and adjacency list representations.

UU-MTH- 1005 Discrete Mathematics/ Formative Task Page 1

 4. From the graph given below, give the root node, the leaf nodes and the parent
node of each node.

5. Use the breadth first search (From A to E) and the depth first search (from C)
methods on the following graph

6. Represent the following the following binary tree data structure using the array
and linked list representation.

UU-MTH- 1005 Discrete Mathematics/ Formative Task Page 2

UU-MTH- 1005 Discrete Mathematics/ Formative Task Page 3