A. Network layer
B. Physical layer
C. Application layer
D. Transport layer
Explanation: Datagram switching is normally done at network layer. In datagram switching, the datagram stream need not be in order as each datagram can take different routes to the destination.
A. Switches
B. Segments
C. Datagrams
D. Data-packets
Explanation: As the name suggests, in datagram switching packets are called as datagram. Each datagram/packet is treated as an individual entity and routed independently through the network.
A. Connection oriented networks
B. Connection less networks
C. Telephone networks
D. Internetwork
Explanation: The switch does not keep the information about the connection state, hence it is connection less. There is no need for establishing a handshake to begin the transmission in such networks.
A. Switch table
B. Segments table
C. Datagram table
D. Routing table
Explanation: Routing table is used to route the packets to their destinations. The packet/datagram header contains the destination header for the whole journey to source to the destination through the routers.
A. Source and destination address
B. Destination address and output port
C. Source address and output port
D. Input port and output port
Explanation: Routing table contains destination address and output port to route the packets to their destinations. The port address specifies the particular application that the packet has to be forwarded to after it has reached the destination.
A. Destination address
B. Source address
C. Checksum
D. Padding
Explanation: Destination address remains same in the header during the entire journey of the packet. There is no pre-decided route for the packets so each datagram/packet is treated as an individual entity and routed independently through the network.
A. Delay is greater than in a virtual circuit network
B. Each packet may experience a wait at a switch
C. Delay is not uniform for the packets of a message
D. All of the mentioned
Explanation: The delay of each packet in a datagram network is different as each packet might take a different route to the destination. The delay includes the propagation delay and the processing delay that is induced at each stop/switch that the packet encounters in its journey.
A. Stack
B. Queue
C. Hash
D. Routing table
Explanation: When there are too many packets to be transmitted and the transmission line gets blocked while transmitting some packets, the remaining packets are stored in queue during delay and are served as first in first out. The delay is called as queuing delay.
A. Remains same
B. Decreases
C. Increases
D. Is not proportional
Explanation: Probability of the error in a transmitted block increases with the length of the block. Hence, the blocks should be as short as possible for ideal transmission with low possibility of an error.
A. Number of flows of packets are not limited
B. Packets may not be in order at the destination
C. Path is not reserved
D. Delay is the same for all packets in a flow
Explanation: The delay of each packet in a datagram network is different as each packet might take a different route to the destination. This happens because there is no pre-decided route for the packets.