COMPUTER NETWORKS JNTU previous years question papers

COMPUTER NETWORKS JNTU previous years question papers

Time: 3 hours Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

1. (a) Give a detailed description of the Novell Netware reference model.
(b) With suitable examples explain simplex, half-duplex & full-duplex communication. [10+6]

2. (a) Discuss various channels supported by ISDN bit pipe?
(b) Differentiate between virtual circuits and circuit switching? [8+8]

3. (a) To provide more reliability than a single parity bit can give, an error-detecting coding scheme uses one parity bit for checking all the odd numbered bits and a second parity bit for all the even numbered bits. What is the Hamming distance of this code?
(b) Discuss the functioning of SLIP? [8+8]

4. (a) What is the prime difference between a token bus and a token ring?
(b) A large population of ALOHA users manages to generate 50 requests/sec, including both originals and retransmissions. Time is slotted in the units of 40 msec.
i. What is the chance of success on the first attempt?
ii. What is the probability of exactly k collisions and then a success?
iii. What is the expected number of transmission attempts needed? [4+12]

5. What is the effect of link failures in Virtual circuit subnet. Congestion can be easily controlled in Virtual circuit subnet. Explain. Why use of Virtual circuits, increases initial delay. [16]

6. (a) What is Fair queuing in the context of congestion control? What is the main problem with fair queuing? How it is solved?
(b) Explain hop-by-hop choke packets method for congestion control. [8+8]

7. (a) What is multiplexing? Why multiplexing is required? What is the difference between upward multiplexing and downward multiplexing?
(b) How to recover from host crashes and router crashes? [8+8]

8. (a) When external viewers are needed? How does a browser know which one to use?
(b) What is the difference in transferring compressed and uncompressed video?

FEEL USEFUL PLEASE GIVE +1