50 Computer Networks MCQs with Answers

Consider a source computer(S) transmitting a file of size 10⁶ bits to a destination computer(D)over a network of two routers (R₁ and R₂) and three links(L₁, L₂, and L₃). L₁connects S to R₁; L₂ connects R₁ to R₂; and L₃ connects R₂ to D.Let each link be of length 100 km. Assume signals travel over each link at a speed of 10⁸ meters per second.Assume that the link bandwidth on each link is 1Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D?

Consider the cyclic redundancy check (CRC) based error detecting scheme having the generator polynomial X³+X+1. Suppose the message m₄m₃m₂m₁m₀ = 11000 is to be transmitted. Check bits c₂c₁c₀ are appended at the end of the message by the transmitter using the above CRC scheme. The transmitted bit string is denoted by m₄m₃m₂m₁m₀c₂c₁c₀. The value of the checkbit sequence c₂c₁c₀ is

Assume that Source S and Destination D are connected through an intermediate router R. How many times a packet has to visit the network layer and data link layer during a transmission from S to D?

An Ethernet frame that is less than the IEEE 802.3 minimum length of 64 octets is called

How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame?

Consider a network using the pure ALOHA medium access control protocol, where each frame is of length 1,000 bits. The channel transmission rate is 1 Mbps (=10⁶ bits per second). The aggregate number of transmissions across all the nodes (including new frame transmissions and retransmitted frames due to collisions) is modelled as a Poisson process with a rate of 1,000 frames per second. Throughput is defined as the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is ______________ .

Match the following:

The minimum positive integer p such that 3^p modulo 17 = 1 is

Consider a network with five nodes, N1 to N5, as shown below.

The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following. N1: (0, 1, 7, 8, 4) N2: (1, 0, 6, 7, 3) N3: (7, 6, 0, 2, 6) N4: (8, 7, 2, 0, 4) N5: (4, 3, 6, 4, 0)

Each distance vector is the distance of the best known path at the instance to nodes, N1 to N5, 

where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors. 52. The cost of link N2-N3 reduces to 2(in both directions). After the next round of updates, what will be the new distance vector at node, N3.