BTEC Higher National in Computing: Discrete Maths Assignment - Graph Theory, Assignments of Business Strategy

Download BTEC Higher National in Computing: Discrete Maths Assignment - Graph Theory and more Assignments Business Strategy in PDF only on Docsity! PROGRAM TITLE: BTEC HIGHER NATIONAL IN COMPUTING UNIT TITLE: DISCRETE MATHS ASSIGNMENT NUMBER: 02 ASSIGNMENT NAME: GRAPH THEORY SUBMISSION DATE: 20 Nov. 21 DATE RECEIVED: ……………………………………………. TUTORIAL LECTURER: LUU THI HUONG GIANG WORD COUNT: ……………………………………………... STUDENT NAME: Hoang Thi Hong Phuong STUDENT ID: BKC 19101 MOBILE NUMBER: 0388239554 Summative Feedback: Internal verification: III. Part 3 : 1. Check whether the following graphs have an Eulerian and/or Hamiltonian circuit. Graph 1 Graph 1 is not an Eulerian circuit because it cannot go through every edge without repeating nor starts and ends at the same vertex. It’s also not an Hamiltonian circuit because if it visits every vertex once without repeating, then it cannot start and end at the same vertex and vice versa. Graph 2.1 Graph 2.2 Graph 2.1 is not an Eulerian circuit because it cannot go through every edge without repeating nor starts and ends at the same vertex. But it is a Hamiltonian circuit because it can go through every vertex without repeat and ends at the same start point (highlighted with green colour in Graph 2.2) Graph 3 Graph 3 is not an Eulerian circuit because it cannot start and end at the same vertex, but it can go through every edge once. It is also not a Hamiltonian circuit since it can’t go through every vertex once neither start and end at a same vertex. IV. REFERENCES GeeksforGeeks (2021) Binary Tree | Set 3 (Types of Binary Tree) – GeeksforGeeks. Available at: https://www.geeksforgeeks.org/binary-tree-set-3-types-of-binary-tree/ (Accessed: 20 Nov. 21) Neelam Tyagi (2020) Dijkstra’s Algorithm: The Shortest Path Algorithm. Available at: https://www.analyticssteps.com/blogs/dijkstras-algorithm-shortest-path-algorithm (Accessed 20 Nov. 21)