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

View solution

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

View solution

Q. After performing bit stuffing on the following stream : 01101111111111111110010, the output is-

View solution

Q. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces 1000 frames per second?

View solution

Q. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces 500 frames per second?

View solution

Q. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces 250 frames per second?

View solution

Q. A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200-kbps bandwidth. Find the throughput if the system (all stations together) produces 1000 frames per second.

View solution

Q. A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200-kbps bandwidth. Find the throughput if the system (all stations together) produces 500 frames per second.

View solution

Q. A network using CSMA/CD has a bandwidth of 10 Mbps. If the maximum propagation time (including the delays in the devices and ignoring the time needed to send a jamming signal, as we see later) is 25.6 μs, what is the minimum size of the frame?

View solution

Q. In collision free protocol channel efficiency is given by-

View solution