COURSEWORK COVER PAGE (INVIDUAL)

TO BE COMPLETED BY STUDENTS
FULL NAME MATRICULATION NO.

1) LAI CHEN SHENG 1)I21020546

2) 2)

3) 3)

4) 4)

5) 5)

6) 6)

7) 7)

COURSE CODE AND MAT2204 MATHEMATICS FOR COMPUTING

COURSE NAME
MISS TS SOONG
LECTURER’S NAME
6G1 JAN / MAR / JUNE /
SECTION / GROUP SESSION AUG 2022

ASSIGNMENT __1___
 LAB REPORT
COURSEWORK  PROJECT DUE
DETAILS  OTHERS: DATE
____QUIZ_____

NOTE: PLEASE SIGN THE STUDENTS’ DECLARATION ON THE NEXT PAGE

Page 1 of 5
Students’ declaration:
We understand what is meant by plagiarism. We declare that this is our own work except where
due references are made.

Name Signature
1)LAI CHEN SHENG
1) Sheng
2)
2)
3)
3)
4)
4)
5)
5)
6)
6)
7)
7)

Note:
Lecturer has, and may exercise, the right not to mark this coursework if the above declaration has
not been signed. If the above declaration is found to be false, appropriate action will be taken
which would lead to ZERO mark being awarded for this coursework.

OFFICE USE ONLY

Marker’s comments

Final Marks
Late submission Extension Granted Deduction
(20 Marks)
YES NO YES NO

Page 2 of 5
 MAT2204 MATHEMATICS FOR COMPUTING
QUIZ:

Question 1
Draw graph models, stating the type of graph used, to represent airline routes where every day there
are four flights from Boston to Newark, two flights from Newark to Boston, three flights from
Newark to Miami, two flights from Miami to Newark, one flight from Newark to Detroit, two flights
from Detroit to Newark, three flights from Newark to Washington, two flights from Washington to
Newark, and one flight from Washington to Miami, with an edge from a vertex representing a city
where a flight starts to the vertex representing the city where it ends.

Question 2
For Exercises a–d, determine whether the graph shown has directed or undirected edges, whether it
has multiple edges, and whether it has one or more loops.
a)

b)

c)

d)

Question 3
Use a Venn diagram to determine which relationship, ⊆, =, or ⊇, is true for the pair of sets.
1. A ∪ B, A ∪ (B − A)
2. A ∪ (B ∩ C), (A ∪ B) ∩ C
3. (A − B) ∪ (A − C), A − (B ∩ C)
4. (A − C) − (B − C), A – B

Page 3 of 5
Answers:
1.

2. a) Simple graph, because it has undirected edges, no parallel edges or loops.

b) Pseudograph, because it has undirected edges, with loops and parallel edges
c) Directed graph, because it has directed edges, no parallel edges but loops.
d) Directed multigraph, because it has directed edges, parallel edges and loops.

3.
1)

2)

Page 4 of 5
3)

4)

Page 5 of 5