Q$1.$ A routing table in a datagram network can have two entries with the same destination address.

A$.$ True

B$.$ False

Q$2.$ In a packet$-$switched network, data flow is somehow a continuation of bits that travel the same channel during the data transfer phase.

A$.$ True

B$.$ False

Q$3.$ We need a three$-$stage time$-$space$-$time switch with N $=100.$ We use $10$ TSIs at the first and third stages and $6$ crossbars at the middle stage. Total number of memory locations we need for the TSIs

A$.800$

B$.400$

C$.100$

D$.200$

Q$4.$ The address field defines the end$-$to$-$end $($source to destination$)$ addressing in a packet traveling through a datagram network

A$.$ True

B$.$ False