adplus-dvertising
frame-decoration

Question

Find the distance from source A to destination D using Dijkstra algorithm.

a.

10

b.

11

c.

12

d.

14

Answer: (a).10

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Find the distance from source A to destination D using Dijkstra algorithm.

Similar Questions

Discover Related MCQs

Q. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the requirement to make this frame collision-free?

Q. Fiber Distributed Data Interface (FDDI) and Copper Distributed Data Interface (CDDI) uses

Q. In Frequency Division Multiple Access, the data link layer in each station tells its physical layer to make

Q. When a station needs to make a reservation before sending data then it is called the

Q. If the station has been authorized by other stations then a station can

Q. FDMA, TDMA and CDMA are

Q. The collision may result in

Q. In Frequency Division Multiple Access, the bandwidth of each channel is shifted by the

Q. The type which improves the efficiency of pure ALOHA is

Q. In token passing method, the station can send data when it receives the

Q. During collisions in the wired network, the detecting energy is almost

Q. The number of sequences in a Walsh table i.e. N=

Q. The p-persistent method uses its back off procedure if the line is

Q. Multiple-access Protocol is divided into

Q. In Carrier Sense Multiple Access/Collision Detection (CSMA/CD), we do not send the entire frame and then look for a

Q. A pure ALOHA can transmit the 200-bit frames on a shared channel of

Q. The p-persistent method is used if the time slots with a slot duration equal to or greater than the maximum of

Q. A collision in a wireless network may add additional energy from 5 to

Q. Walsh table is a two-dimensional table in which the number of rows and columns are

Q. In Code Division Multiple Access, the orthogonal sequence is unique for each