1. which of the following is not a type of packet switching
- A. Circuit Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- D. Both B and C
Points to be remember about Packet Switching before going to examination hall
Packet Switching have two types
- Virtual Circuit Switching
- Datagram Switching
| Virtual Circuit Switching | Datagram Switching |
| It is works on Data link layer | It is works on Network Layer |
| It is connection oriented. A physical dedicated path is involve between sender and receiver. | It is connection Less and for sending data signal there is no need of physical path data can go from any path |
| There are three phases in data transfer. First is Connection Establishment, Second is Data Transfer and last one is Connection Termination. | Only one phase is involve and that is Data Transfer. |
| Only First Data packet is responsible to reserve all resources at the time of connection establishment. Subsequent packet follow that path to reach at receiver end. | Resources are not reserve at the time of data sending. All the data packets are free to go from any path. For this reason data packet can be loss. |
| Packets will be reach in order to receiver host. Virtual Circuit Switching is using pipe lining concept and data is sending in the form of packets. | Packets can be reach in out of order to the receiver host. In datagram switching routing algorithms are using in every routers. For this reason some times packets will be lost or drop. |
| It is more reliable | less reliable as packets are drop by router. |
| Efficiency of Virtual circuit switching is low | Efficiency of Virtual circuit switching is high |
| Mainly used in ATM and X.25 protocol. | We can used in internet and other servers. |
| In Virtual Circuit Switching addressing is involve in both connection establishment and data transfer phase. | in Datagram Switching Addressing is involve only in data transfer phase. |
2. in which of the following switching resource allocation is not possible
- A. Circuit Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- B. Datagram Switching
3. Packets will be lost in
- A. Circuit Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- B. Datagram Switching
4. in which of the following switching resource allocation is possible in connection establishment phase
- A. Circuit Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both A and C
- None of the above
Ans- D. Both A and C
5. Point to Point Dedicated connection is involve in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- C. Virtual Circuit Switching
6. Local and Global Addressing is involve in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- C. Virtual Circuit Switching
7. out of packet receive in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- B. Datagram Switching
8. Routing algorithm is involves in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- B. Datagram Switching
9. Router drops packets in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- B. Datagram Switching
10. Datagram switching is works on
- A. Physical layer
- B. Data link Layer
- C. Network Layer
- D. Transport Layer
- None of the above
Ans- C. Network Layer
11. Which one of the following is reliable in packet switching
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- C. Virtual Circuit Switching
12. Virtual Circuit switching is works on
- A. Physical layer
- B. Data link Layer
- C. Network Layer
- D. Transport Layer
- None of the above
Ans- B. Data link Layer
13. Store and forward technique is used in ……………………………… switching.
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- D. Both B and C
14. Congestion Problem occurs in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- B. Datagram Switching
15. Pipeline concept is used in
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Message Switching
- None of the above
Ans- C. Virtual Circuit Switching
16. Not wastage of bandwidth in or bandwidth is fixed..
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- C. Virtual Circuit Switching
17. In which switching Data is packetized
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- D. Both B and C
18. In which switching characteristics of both datagram switching and virtual circuit switching present..
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- C. Virtual Circuit Switching
19. Dynamic bandwidth present in which switching…
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- B. Datagram Switching
20. Dynamic bandwidth present in which switching…
- A. Time Switching
- B. Datagram Switching
- C. Virtual Circuit Switching
- D. Both B and C
- None of the above
Ans- B. Datagram Switching
Numerical/Problem solving formula for Virtual Circuit Switching and Datagram Switching
Total delay in Virtual Circuit Switching having n routers=Connection establishment time + Data Transfer + Connection Termination time
Total delay=CET+(n+1)(TT+TP)+CT
Total delay in Datagram Switching having n routers=Connection establishment time + Data Transfer + Connection Termination time
Total delay=CET+(n+1)(TT+TP)+n(Queuing time of Packet + Processing time of Packet) + CT
