A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

31. Consider a 128×10 3 bits/second satellite communication link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is ___________
a. 2
b. 4
c. 6
d. 8
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).4

32. 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?
a. 10,000 bytes
b. 12,000 bytes
c. 15,000 bytes
d. 27,000 bytes
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).12,000 bytes

33. A 1Mbps satellite link connects two ground stations. The altitude of the satellite is 36,504 km and speed of the signal is 3 × 10^8 m/s. What should be the packet size for a channel utilization of 25% for a satellite link using go-back-127 sliding window protocol? Assume that the acknowledgment packets are negligible in size and that there are no errors during communication.
a. 120 bytes
b. 60 bytes
c. 240 bytes
d. 90 bytes
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).120 bytes

34. The minimum frame size required for a CSMA/CD based computer network running at 1 Gbps on a 200m cable with a link speed of 2 × 10^8m/s is
a. 125 bytes
b. 250 bytes
c. 500 bytes
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).250 bytes

35. In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are
a. Last fragment, 2400 and 2789
b. First fragment, 2400 and 2759
c. Last fragment, 2400 and 2759
d. Middle fragment, 300 and 689
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Last fragment, 2400 and 2759

36. Consider a source computer(S) transmitting a file of size 106 bits to a destination computer(D)over a network of two routers (R1 and R2) and three links(L1, L2, and L3). L1connects S to R1; L2 connects R1 to R2; and L3 connects R2 to D.Let each link be of length 100 km. Assume signals travel over each link at a speed of 108 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?
a. 1005 ms
b. 1010 ms
c. 3000 ms
d. 3003 ms
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).1005 ms

37. One of the header fields in an IP datagram is the Time to Live(TTL)field.Which of the following statements best explains the need for this field?
a. It can be used to prioritize packets
b. It can be used to reduce delays
c. It can be used to optimize throughput
d. It can be used to prevent packet looping
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).It can be used to prevent packet looping

38. For which one of the following reasons does Internet Protocol (IP) use the time-to- live (TTL) field in the IP datagram header
a. Ensure packets reach destination within that time
b. Discard packets that reach later than that time
c. Prevent packets from looping indefinitely
d. Limit the time for which a packet gets queued in intermediate routers
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Prevent packets from looping indefinitely

39. Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.

[S1] The computational overhead in link state protocols
is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon)
avoids persistent routing loops, but not a link
state protocol.
[S3] After a topology change, a link state protocol
will converge faster than a distance vector
protocol.

Which one of the following is correct about S1, S2, and S3 ?
a. S1, S2, and S3 are all true
b. S1, S2, and S3 are all false
c. S1 and S2 are true, but S3 is false
d. S1 and S3 are true, but S2 is false
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).S1 and S3 are true, but S2 is false

40. Which one of the following is TRUE about interior Gateway routing protocols - Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
a. RIP uses distance vector routing and OSPF uses link state routing
b. OSPF uses distance vector routing and RIP uses link state routing
c. Both RIP and OSPF use link state routing
d. Both RIP and OSPF use distance vector routing
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).RIP uses distance vector routing and OSPF uses link state routing

Page 4 of 13