SESI II 2022/2023

MATHEMATICS, SCIENCE AND COMPUTER DEPARTMENT

DBM 20083: DISCRETE MATHEMATICS
TOPIC: GRAPH AND TREES
CASE STUDY
(DURATION : 1 WEEK) 100 MARKS

CONSTRUCT MATHEMATICAL PROBLEMS USING APPROPRIATE CONCEPTS,

CLO 3
FORMULAS AND TECHNIQUES.
NAME

REG. NO

INSTRUCTION ANSWER ALL THE QUESTIONS

MINIMAL SPANNING TREE

Minimal Spanning Tree (MST) is a special kind of tree that minimize the lengths/ weights of the edges
in the tree. It is a way to connect all the vertices in a graph with minimal total of lengths/ weight. There
are two algorithms used in MST.
• Prim’s Algorithms
• Kruskal’s Algorithms

TASK
1. There are a lot of applications using MST in real life. In group of 4, choose one of the topic
below to find MST using Prim’s and Kruskal’s Algorithms.
a. Computer network
b. Telecommunication network
c. Transportation network
d. Water Supply networks
e. Electrical grid

2. Your group need to prepare a report to elaborate selected topic. The report must consist
a. Introduction of the selected topic
b. Identify issues / problem statement
c. Mathematical solution with Prim’s Algorithms
d. Mathematical solution with Kruskal’s Algorithms
e. Comparison between Prim’s and Kruskal’s Algorithms
f. Conclusion
 SESI II 2022/2023

Evaluation Rubric:

JPPKK_Sesi1:2021/2022

Prepared by: Checked by: Approved by:

…………………………………… …………………………………… ……………………………

(NORMASLINA BINTI JAMIL ) (MUHAMMAD. DANIEL BIN DEROME) SAL SABILAH BINTI MOHAMAD TAHIR)

DATE: 13.2.2023 DATE: DATE:14/2/2023

NORMASLINA BINTI JAMIL
PENSYARAH (DH48)
JABATAN MATEMATIK, SAINS DAN KOMPUTER
POLITEKNIK SULTAN IDRIS SHAH 13.2.2023
SELANGOR DARUL EHSAN