Casestudy
Casestudy
Case Study
Question
Choose a real-life problem that can be solved using a graph or a tree. In order to solve the
problem, choose one algorithm from the list below or any other suitable algorithm that you
have explored.
1. Maximum Flow Algorithm
2. Kruskal’s Algorithm
3. Dijkstra’s Algorithm
1
DAT10203 Discrete Mathematics Case Study
The video or animation presentation, must fulfil the minimum requirements stated below.
1. Introduction to members of your team.
2. Introduction to the problem.
3. Demonstrate how the graph or tree is constructed. You are free to use any tool(s).
4. Describe the vertices (or nodes) and edges (or arcs) in the graph or tree.
5. Demonstrate how an algorithm is used to solve the problem. Visualise the process step
by step, by either using simple animation or any tool(s).
Your video presentation must not exceed eight minutes, must be recorded using your own
voice, and must be uploaded to YouTube.
2
DAT10203 Discrete Mathematics Case Study
Report Rubric
CLO3: Demonstrate the mathematical structure for advanced mathematics and information technology field independently to enrich the professional life.
15% contribution to the continuous assessment.
3
DAT10203 Discrete Mathematics Case Study
4
DAT10203 Discrete Mathematics Case Study