This is a c++ question please do according to the instructions saying and do exactly like what is saying in the question and do not plagarize. and do it as soon as possible

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

This is a c++ question please do according to the instructions saying

and do exactly like what is saying in the question and do not plagarize.

and do it as soon as possible

Suppose you are near NSU to sit for the final exam of CSE225L. You are already
late. To save time, you need to take the shortest path for your exam hall. First,
you have to reach an entry point. From there, you have to take the shortest path
to reach the exam hall. There are some checkpoints that are equidistant. By
those checkpoints, you have to calculate the shortest path to reach your
destination.
After finishing your exam, you will take your exit from NSU. As there are several
exit points. You have to find which exit point will be the shortest distance.
Input format :
First mention how many entrylexit points there are. Then, take those points. After
mentioning the number of checkpoints, you have to take all these checkpoints.
Lastly, assign a value for the exam hall. (You have to keep in mind that you can
not consider those entrylexit points when you find the shortest path for the exam
hall.)
Now, take all the edges that connect all the checkpoints to reach the exam hall.
At the end, give the entry point that you will take.
4
7
10
6.
5
8
1
3
Sample Input:
4
2.
CO
Transcribed Image Text:Suppose you are near NSU to sit for the final exam of CSE225L. You are already late. To save time, you need to take the shortest path for your exam hall. First, you have to reach an entry point. From there, you have to take the shortest path to reach the exam hall. There are some checkpoints that are equidistant. By those checkpoints, you have to calculate the shortest path to reach your destination. After finishing your exam, you will take your exit from NSU. As there are several exit points. You have to find which exit point will be the shortest distance. Input format : First mention how many entrylexit points there are. Then, take those points. After mentioning the number of checkpoints, you have to take all these checkpoints. Lastly, assign a value for the exam hall. (You have to keep in mind that you can not consider those entrylexit points when you find the shortest path for the exam hall.) Now, take all the edges that connect all the checkpoints to reach the exam hall. At the end, give the entry point that you will take. 4 7 10 6. 5 8 1 3 Sample Input: 4 2. CO
0123
6
456789
10
14
04
45
46
16
18
5 10
6 10
67
10 9
63
79
89
39
27
2
Output Format:
First, show the shortest distance between the entry point and exam hall.
Then show the exit points that have the shortest distance from the exam hall.
Sample Output:
3
13
Transcribed Image Text:0123 6 456789 10 14 04 45 46 16 18 5 10 6 10 67 10 9 63 79 89 39 27 2 Output Format: First, show the shortest distance between the entry point and exam hall. Then show the exit points that have the shortest distance from the exam hall. Sample Output: 3 13
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY