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.
|
Download Model question papers & previous years question papers
|
Posted Date: 29 Jul 2008 Posted By: sachin Member Level: Gold
|
2007 Adikavi Nannaya University B.E Computer Science CS339 - COMPUTER NETWORKS Question paper
CS339 - COMPUTER NETWORKS
VI SEMESTER
B.E. COMPUTER SCIENCE AND ENGINEERING
Time: Three Hours Maximum: 100 Marks
Answer All The Questions
PART – A (10 x 2 = 20 Marks)
1. Why network software is organized as a series of layer?
2. What are the two kinds of light sources used in fiber cables?
3. Reliability of CRC is better than that of simple parity and LRC. Justify this statement.
4. What is meant by bit stuffing?
5. Write short notes on virtual circuit organization of the subnet.
6. Differentiate between adaptive and non-adaptive routing algorithms.
7. What is meant by upward and downward multiplexing.
8. Mention some applications where UDP is preferred over TCP?
9. Mention the layer in which email gateway function. Also mention some of its applications
10. Define encryption
PART – B (5 x 16 = 80 Marks)
11.i) Compare OSI and TCP / IP reference models on form of their merits and demerits. (10)
ii) Differentiate between broadcast networks and point to point networks. (6)
12.a)i) Explain the CSMA/CD protocol with binary exponential back off algorithm used internet. (10)
ii) Assume that a network can cover a distance of 5000 meters and the RTT is 100 µ sec of the network operates at a speed of 20Mbps. What should be the minimum frame size to employ CSMA / CD? (6)
(OR)
12.b)i) Explain the sliding window protocol and compare its performance against the simple stop and wait protocol. (10)
ii) Given message is M(X) = X5 + X4+ X + 1 and the generator is G(X) = X4+X3+1 Compute CRC. (6)
13.a)i) Explain the distance vector routing algorithm. (8 )
ii) Find the shortest path from node A to node D in the following network using the Bell mark kord routing algorithm. (Cool
(OR)
13.b)i) Given three IP addresses are 32.46.7.3, 200.132.110.35 and 140.75.8.92. Find their classes, network addresses, broadcast address and their subnet marks. (6)
ii) Explain the token breket algorithm and compare its performance against the leaky bueket algorithm (10)
14.a)i) Explain the Bres-way handshak protocol used to establish the connection in the transport layer. Also explain the protocol used to release the connection. (6)
ii) Explain the transport service access point and the various schemers used by the transport layer to find the TSAP at a server. (8 )
(OR)
14.b)i) Explain the various fields of TCP header. (8 )
ii) Write short notes about the pseudo header included in the TCP checkroom. (4)
iii) Draw the UDP header and explain its fields (4)
15.a) Explain the DNS in terms of name space, resource record and name server. (16)
(OR)
15.b) Explain the architecture of WWW as on client / server application (16)
Return to question paper search
|
|
|
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.
|
Advertise Here
|