Neco 2019 Computer Studies Question 37

Practice objective / multiple choice question 37 from the 2019 Neco Computer Studies examination.

Neco 2019 Computer Studies Objective / Multiple Choice Medium Difficulty
Question 37 NECO • 2019 • COMPUTER_STUDIES • objective

Consider a network of five routers A, B, C, D and E with the following link costs: A‑B = 4, A‑C = 2, B‑C = 1, B‑D = 5, C‑D = 8, C‑E = 10, D‑E = 2. Using Dijkstra's algorithm, what is the minimum cost from router A to router E and which path achieves this cost?

Answer Options

A. 12, A‑C‑D‑E
B. 12, A‑C‑E
Correct Answer C. 10, A‑C‑B‑D‑E
D. 11, A‑B‑D‑E
Correct Answer
C
Correct Option:
10, A‑C‑B‑D‑E

About This Question

This is Neco 2019 Computer Studies Question 37. It is one of the objective questions from the 2019 Neco Computer Studies examination.

Difficulty level: Medium .

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support