m
 
   Colleges and Courses  |  College Admissions  |  Campus Life  |  Academic Projects  |  Exam Notifications  |  Jobs Abroad  |  Discussions  |  Home
  IGNOU QUESTION PAPERS:


Google
 
MCA Semester 1 CS-09
Data Communications and Networking - June 1995


Submitted by: Siju Cherian            1  | 2 | 3 | 4 | 5 Submit your Code

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

(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. [5]

(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. [10]

(d) A satellite channel of capacity of 1 Mbps uses 7-bit sliding window protocol. It uses 1000 bit frame which includes 30 header bits. The two-way propagation delay is 540 ms. Find out the bandwidth utilization of the channel. [10]

2 Discuss in detail the following approaches in the context of high speed modems:
(a) Quadratum Amplitude Modulation. [4]
(b) Trellis Coding [4]
(c) 32 & V.34 bits [4]
(d) MNP5. [3]

3 Discuss the following in the context of ATM switches:
(a) Input and output queueing at an ATM switch
(b) Functioning of the combined Batcher-Banyan 4 cell switch. [15]

4 (a) Describe the channel utilization versus load for various random access protocols? Where is the maximum? Explain your answer. [6]
(b) Discuss technologies (different types of wiring and hubs) in Fast Ethernet. [6]
(c) Why is the Manchester encoding not done in Fast Ethernet? [3]

5 (a) Where is the multicasting routing used? Describe its advantages and disadvantages. [4]
(b) Compute a multicast tree for router C in the subnet below for a group with members at routers A, C, D, E, F, I & K. [5]

(c) Describe a suitable congestion control algorithm with an example used for multicasting routing .

6 (a) How does window management take place in TCP? List a potential advantage when Nagle’s algorithm is used on a badly congested network. [6]

(b) Why is timer management much more difficult in the Internet’s transport layer? Discuss the algorithm proposed by Jacobson generally used in TCP for timer management. [9]


Assignments
C Programming
SAD
C Programing
Compu Networks
Compu Architecture
Question Papers
Intro to Software
June 1995
Dec 1995
June 1995
Dec 1996
Dec 1997
Dec 1999
June 2000
Dec 2000
June 2001
Jan 2001
Dec 2002
Database Management
June 1995
Computer Architecture
June 1997
Dec 1997
June 1998
Dec 1998
June 1999
Dec 1999
June 2000
Dec 2000
Jan 2001
June 1995
Dec 2001
June 2002
Computer Architecture
June 1996
Dec 1996
June 1997
Dec 1997
June 1999
June 1998
Networking
June 1995
Dec 1999
June 2000
Dec 2000
Jan 2000
June 2001
Dec 2001
June 2002
Finance & Accounting
Dec 1996
June 1997
Dec 1997
June 1998
Dec 1998
June 1999
Dec 1999
June 2000
Dec 2000
June 2003
Numerical & Programming
June 2001
Dec 2001
Operations Research
June 1995
June 2002
June 2001
Software Engineering
Dec 2001
Dec 2002
 
TOP