WorksheetsCN-SurpriseTest-1
Total questions: 30
Worksheet time: 19mins
The protocol data unit(PDU) for the application layer in the Internet stack is
Segment
Datagram
Message
Frame
Which of the following transport layer protocolss is used to support electronic mail?
SMTP
ICMP
STMP
TCP
In the IPv4 addressing format, the number of networks allowed under Class C addresses is
2^14
2^18
2^24
2^21
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). L1 connects S to R1;L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of length 100km. Assume signals travel over each link at a speed of 10^8 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?
1005ms
1010ms
3000ms
3003ms
Packets of the same session may be routed through different paths in:
TCP, but not UDP
TCP and UDP
UDP, but not TCP
Neither TCP nor UDP
The address resolution protocol (ARP) is used for:
Finding the IP address from the DNS
Finding the IP address of the default gateway
Finding the IP address that corresponds to a MAC address
Finding the MAC address that corresponds to an IP address
The maximum window size for data transmission using the selective reject protocol with n-bit frame sequence numbers is:
2^n
2^(n-1)
2^n – 1
2^(n-2)
If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?
1022
1023
2046
2045
What is the maximum size of data that the application layer can pass on to the TCP layer below?
Any size
2^16 bytes-size of TCP header
2^16 bytes
1500 bytes
A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a socket(), a bind() and a listen() system call in that order, following which it is preempted. Subsequently, the client process P executes a socket() system call followed by connect() system call to connect to the server process S. The server process has not executed any accept() system call. Which one of the following events could take place?
connect () system call returns successfully
connect () system call blocks
connect () system call returns an error
connect () system call results in a core dump
Which one of the following uses UDP as the transport protocol?
DNS
HTTP
SMTP
IGMP
In Ethernet when Manchester encoding is used, the bit rate is:
Twice the baud rate.
Half the baud rate.
Same as the baud rate.
none of the above
Match The following
(P) SMTP ----------- (1) Application layer
(Q) BGP ----------- (2) Transport layer
(R) TCP ----------- (3) Data link layer
(S) PPP ----------- (4) Network layer
--------------------- (5) Physical layer
P – 2 Q – 1 R – 3 S – 5
P – 1 Q – 4 R – 2 S – 3
P – 1 Q – 4 R – 2 S – 5
P – 2 Q – 4 R – 1 S – 3
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use?
40
20
160
320
Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever get lost), then what is the number of packets that A will transmit for sending the message to B?
12
14
16
18
Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).
What is the minimum number of bits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
i=2
i=3
i=4
i=5
Consider the data of previous question. Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the previous question and acknowledgments are always piggybacked. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time.)
16ms
18ms
20ms
22ms
The bandwidth of the line is 1.5 Mbps with round trip time(RTT) as 45 milliseconds.If the size of each packet is 1 KB(kilobytes), then what is the efficiency in Stop and wait protocol?
20.3
10
10.8
11
Which of the following is not true about Subnetting?
It can be applied only for single network.
It is used to improve security.
Here, bits are borrowed from network ID portion.
Here, bits are borrowed from host ID portion.
Which device uses logical addressing system?
Hub
Switch
Router
Bridge
In which of the following protocol(s) it is possible for sender to receive acknowledgement for a packet that falls outside its current window?
Selective repeat protocol
Stop and wait protocol
Go back N protocol
All of the above
The data link layer takes the packets from _____ and encapsulates them into frames for transmission.
network layer
physical layer
transport layer
application layer
Which one of the following task is not done by data link layer?
framing
error control
flow control
channel coding
Which sublayer of the data link layer performs data link functions that depend upon the type of medium?
logical link control sublayer
media access control sublayer
network interface control sublayer
none of the mentioned
Header of a frame generally contains:
synchronization bytes
addresses
frame identifier
all of the mentioned
Automatic repeat request error management mechanism is provided by:
logical link control sublayer
media access control sublayer
network interface control sublayer
none of the mentioned
Which one of the following is a data link protocol?
ethernet
point to point protocol
HDLC
all of the mentioned
The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is called:
piggybacking
cyclic redundancy check
fletcher’s checksum
none of the mentioned
Which one of the following routing algorithm can be used for network layer design?
shortest path algorithm
distance vector routing
link state routing
all of the mentioned
Which one of the following is not a function of network layer?
routing
inter-networking
congestion control
none of the mentioned
