How To Exam?

a knowledge trading engine...


Shivaji University 2005 B.E Computer Science COMPUTER NETWORKS -university question paper

Sunday, 19 May 2013 12:30Web

H-160
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-2) EXAMINATION, 2005
SHIVAJI UNIVERSITY, KOLHAPUR
COMPUTER NETWORKS

Day and Date: Wednesday, 23-11-2005 Total Marks: 100
Time: 2.30p.m to 5.30p.m

Instructions: 1) Attempt any 3 ques. from every part.
2) Figures to right indicate full marks.


SECTION-1

Q.1 a) discuss ATM reference model in detaIL.[Marks 6]

b) What is pipelining? discuss its benefits and drawbacks.[Marks 4]

C) discuss the subsequent terms in brief:[Marks 8=2*4]

1) Window size

2) Flow Control

3) Frame Header

4) CRC code

Q.2 a) what is collision free protocol? discuss bit-map protocol in detail.[Marks 6]

b) discuss IEEE-802.3 standards in detail.[Marks 8]

C) Draw Manchester encoding for bit pattern”10011100”.[Marks 4]


Q.3 a) discuss link state routing in detail. [Marks 8]

b) What is congestion in network? List the reasons behind congestion.[Marks 3]

c) elaborate the policies used at data link layer to control congestion? How they congestion.[Marks 5]


Q.4 a) Write short notes on (any four)[Marks 16=4*4]

1) Fragmentation

2) Tunneling

3) ALOHA

4) Optimality principle

5) Binary exponential Backoff Algorithm




SECTION-2



Q5. a) What is silly window syndrome? How this issue is solved in TCP.[Marks 10]

b) discuss the structure of UDP data gram.[Marks 6]


Q.6 a) discuss the Internet control message protocol.[Marks 8]

b) discuss he different cell formats in ATM network.[Marks 8]


Q7) a) what is ARP? List the steps taken to resolve IP address to physical address in ARP? [Marks 8]

b) provide public key algorithm and discuss it with suitable example.[Marks 8]


Q8. Write short notes on (any three) [Marks 18=6*3]

a) BGP

b) DNS

c) SNMP

d) RARP











( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Shivaji University 2005 B.E Computer Science COMPUTER NETWORKS -university question paper