This document contains instructions for a term test on computer communication and telecom networks. It is divided into three sections. Question 1 is compulsory and requires comparing virtual circuit and datagram networks, and explaining demultiplexing and multiplexing operations of the transport layer. Students must also answer one other question, which can be drawing and explaining the TCP header in detail, or applying Dijkstra's algorithm to find shortest paths between nodes in a network graph. The test is out of 20 marks and takes place on April 15, 2015. Best wishes are provided at the end.
This document contains instructions for a term test on computer communication and telecom networks. It is divided into three sections. Question 1 is compulsory and requires comparing virtual circuit and datagram networks, and explaining demultiplexing and multiplexing operations of the transport layer. Students must also answer one other question, which can be drawing and explaining the TCP header in detail, or applying Dijkstra's algorithm to find shortest paths between nodes in a network graph. The test is out of 20 marks and takes place on April 15, 2015. Best wishes are provided at the end.
This document contains instructions for a term test on computer communication and telecom networks. It is divided into three sections. Question 1 is compulsory and requires comparing virtual circuit and datagram networks, and explaining demultiplexing and multiplexing operations of the transport layer. Students must also answer one other question, which can be drawing and explaining the TCP header in detail, or applying Dijkstra's algorithm to find shortest paths between nodes in a network graph. The test is out of 20 marks and takes place on April 15, 2015. Best wishes are provided at the end.
Marks:20 Term Test-II ( Computer Communication & Telecom Networks ) -T.E Date: 15 /04/2015 (1) Question Number 1 is compulsory. (2) Solve any 1questions out of remaining questions.
Q1 (a) Compare Virtual Circuit and Datagram Network 5M
(b) Explain Demultiplexing and Multiplexing operation provided by transport layer 5M Q2 Draw and explain TCP header in detail. 10M Q3 Using below figure, apply Dijkstra’s algorithm to find shortest paths from the source node (assume node 1 ) to all other nodes. 10M
***********************************************************************ALL THE BEST
Department of Electronics & Telecommunication Marks:20 Term Test-II ( Computer Communication & Telecom Networks ) -T.E Date: 15/04/2015 (1) Question Number 1 is compulsory. (2) Solve any 1questions out of remaining questions.
Q1 (a) Compare Virtual Circuit and Datagram Network 5M
(b) Explain Demultiplexing and Multiplexing operation provided by transport layer 5M Q2 Draw and explain TCP header in detail. 10M Q3 Using below figure, apply Dijkstra’s algorithm to find shortest paths from the source node (assume node 1 ) to all other nodes. 10M
***********************************************************************ALL THE BEST
Department of Electronics & Telecommunication Marks:20 Term Test-II ( Computer Communication & Telecom Networks ) -T.E Date: 15/04/2015 (1) Question Number 1 is compulsory. (2) Solve any 1questions out of remaining questions.
Q1 (a) Compare Virtual Circuit and Datagram Network 5M
(b) Explain Demultiplexing and Multiplexing operation provided by transport layer 5M Q2 Draw and explain TCP header in detail. 10M Q3 Using below figure, apply Dijkstra’s algorithm to find shortest paths from the source node (assume node 1 ) to all other nodes. 10M
***********************************************************************ALL THE BEST