Members BookmarksPolls Fresher Jobs Funny Photos B.Tech Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

Advertisements


website counter




Download Model question papers & previous years question papers

Posted By: S.Yamini       Member Level: Diamond       Posted Date: 02 Jun 2008

2005 Indira Gandhi National Open University (IGNOU) M.C.A Data communications and networking Question paper



Course: M.C.A   University: Indira Gandhi National Open University (IGNOU)





Test Papers / Previous Question Papers of IGNOU CS09 Data Communications and Networking December 2005
ADCA / MCA (II Yr)
Term-End Examination

December, 2005

CS09 (S): Data Communications and Networking

Time: 3 hours
Maximum Marks: 75

Note : Question No. 1 is compulsory. Answer any three questions from the rest.
1. (a) Explain the three general principles of congestion control. (3)

(b) List the various services offered by BISDN. (3)

(c) A binary signal is sent over a 3 kHz channel whose signal to noise ratio is 20 dB. What is the maximum achievable data rate ? (3)

(d) Discuss 802-3 frame format. Explain its various fields. (4)

(e) Dfferentiate datagrams and virtual circuits. (5)

(f) Make the timing diagram of Manchester coding of bit stream : 1010000111 and mention its advantages over other coding schemes. (3)

(g) Television channels are 6 MHz wide. How many bits/sec can be sent, if eight level digital signals are used ? Assume the channel is noiseless. (4)

(h) Explain the RSA algorithm used in cryptography. (5)

2. (a) Derive the throughput expression for Aloha and Slotted Aloha. (6)

(b) What is the advantage of differential pulse code modulation over pulse code modulation ? How is digital transmission done through PCM ? Discuss. (6)

(c) What is 'bit stuffing' ? Why is it used ? Illustrate through an example. (3)

3. (a) The data b(t) consists of the bit stream : 001010011010. Assume that the bit rate fb is equal to the canier frequency fo and sketch VBPSK(t). (3)

(b) What is a Subnet ? How do you implement subnetting ? Explain through an example. (6)

(c) What is count infinity problem ? How does it happen in distance vector routing algorithm ? Illustrate through an example. (6)

4. (a) Make a comparison ol channel utilization vs. load for various random access protocols. llustrate through a diagram. (7)

(b) A 4 mbps token ring has a token holding time value of 10 m sec. What is the longest frame that can be sent on this ring ? (5)

(c) List three differences between IPv4 and IPv6. (3)

5. (a) Briefly describe the token bucket algorithm through a proper illustration. How is it different from leaky bucket algorithm ? (10)

(b) In a network that has a maximum TPDU size of 128 k bytes. a maxrmurn TPDU lifetime of 30 sec, and an 8 bit sequence number, what is the maximum data rate per connection ? (5)

6. Write short notes on any three: (15)

(a) SNMP protocol
(b) Electronic mail
(c) Network news transfer protocol
(d) Hyper text transfer protocol






Return to question paper search

Next Question Paper: Data communications and networking

Previous Question Paper: Data communications and networking

Related Question Papers:


  • MRDE-104 Entrepreneurship and Rural Development


  • Laboratory Course in (Advanced Internet Technologies & Computer Graphics and Multimedia) Set 1


  • MS6 : MARKETING FOR MANAGERS


  • Numerical and statistical computing


  • CST303 Information System Security June 2007


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.


    Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.