Archive

Archive for the ‘CS-09 - Data Communication & Network’ Category

June 2002

Comments off

Question Paper of CS-09 – Data Communication & Network of June 2002 from IGNOU

1 (i) A digital signalling system is required to operate at 9600 bps. If a signal element en codes 16 bit word, what is the minimum bandwidth required for this channel?

(ii) Describe the various issues related to measuring network performances.

(iii) Using Dijkstra�s routing algorithm, find out a least cost route to all other nodes for nodes 1 through 6 for the following network.

Do the same for Bellman-Ford algorithm. Read more…

December 2001

Comments off

Question Paper of CS-09 – Data Communication & Network of December 2001 from IGNOU

Time: 3 hours
Maximum Marks: 75

Note: Question 1 is compulsory. Attempt any 3 from the remaining.

1 (a). Describe the salient features of mobile IP.3

(b). Describe the various issues related to measuring network performances.6

(c).Identify the range of IP v4 addresses spanned by Class A, Class B and Class C.3 Read more…

June 2001

Comments off

Question Paper of CS-09 – Data Communication & Network of June 2001 from IGNOU

Time: 2 hours
Max. Marks: 75

Note: Question No 1 is compulsory. Attempt three more questions from questions numbered as 2 to 6.

1.
i. Suppose transmission channels become virtually error free. Is the data link layer still necessary? 3 marks
ii. Explain how the notion of multiplexing can be applied at the data link layer, network layer and transport layer 3 marks
iii. Give two features that the data link layer and transport layer have in common. Give two features in which they differ. 4 marks Read more…

June 2001

Comments off

Question Paper of CS-09 – Data Communication & Network of June 2001 from IGNOU

Time: 2 hours
Max. Marks: 75

Note: Question No 1 is compulsory. Attempt three more questions from questions numbered as 2 to 6.

1.
i. Suppose transmission channels become virtually error free. Is the data link layer still necessary? 3 marks
ii. Explain how the notion of multiplexing can be applied at the data link layer, network layer and transport layer 3 marks
iii. Give two features that the data link layer and transport layer have in common. Give two features in which they differ. 4 marks
iv. Explain the following Sliding Window Protocol GO BACK n with example 5 marks Read more…

Jan 2001

Comments off

Question Paper of CS-09 – Data Communication & Network of Jan 2001 from IGNOU

1 (i) Suppose that the Aloha Protocol is used to share a 56 Kbps satellite channel. Suppose that packets are 1000 bits long. Find the maximum throughput of the system in packets/second.

(ii) Does Ethernet provide connection oriented or connectionless service? How is the transfer of frames in Ethernet similar to the transfer of frames in a packet switching network? How is it different?

(iii) What difference does it make to the network layer if the underlying data link layer provides a connection oriented service versus a connectionless service?
Read more…

Dec 2000

Comments off

Question Paper of CS-09 – Data Communication & Network of Dec 2000 from IGNOU

1 (i) A television screen is composed of a grid of 525 lines by 700 columns (total of 367.500 pixels). A pixel can be black or white (1 or 0). Thirty complete screens (frames) are scanned in one second. What is the theoretical bandwidh required?

(ii) Given a 10 bit sequence 1010011110 and a divisor 1011. Find the CRC.

(iii) Given a remainder of 111, a data unit of 10110011 and a divisior of 1001, is there an error in the data unit? Read more…

June 2000

Comments off

Question Paper of CS-09 – Data Communication & Network of June 2000 from IGNOU

1 (a) Using the Nyquist theorem, calculate the sampling rate for the following analog signals:

� An analog signal with bandwidth 2000 Hz
� An analog signal with frequencies from 2000 to 6000 Hz

(b) What is the minimum number of samples for PCM encoding if the frequency ranges from 1000 to4000Hz? Read more…

Dec 1999

Comments off

Question Paper of CS-09 – Data Communication & Network of Dec 1999 from IGNOU

1 (a) For the bit stream 100010100 sketch the waveform for Manchester and Differential Manchester Coding and also discuss the advantages of the coding schemes.

(b) The waveform of the following figure belongs to a Manchester coded binary data stream. Determine the beginning and end of bit periods (i.e. extract clock information) and give the data sequence.

(c) Why should PCM be preferable to DM for encoding analog signals that represent digital data? Read more…

June 1999

Comments off

Question Paper of CS-09 – Data Communication & Network of June 1999 from IGNOU

1 Consider a half-duplex point to point link using a stop and wait scheme.

(i) What is the effect on line utilization of increasing the message size so that fewer messages will be required? Other factors remain constant.

(ii) What is the effect on line utilization of increasing the number of frames for a constant message size? Read more…

Dec 1998

Comments off

Question Paper of CS-09 – Data Communication & Network of Dec 1998 from IGNOU

1 (a) Is the Nyquist theorem true for all types of communication channels?

(b) A cable TV system has a number of commercial channels, all of them showing programs and advertisement alternatively. What type of multiplexing is it? Justify your answer.

(c) Write a C-program fragment to calculate CRC (cyclic redundancy code) for any message using polynomial generator x4+x3+x+1 using modulo �2 arithmetic.
Read more…

Pages: 1 2 Next