Accounting and Financial Management (3) Analog and Digital Communication (2) Artificial Intelligence (2) BE(Civil) (2) BE(CSE) (83) BE(ECE) (11) BE(Mech) (10) Business Processes (3) C# and .NET Framework (2) Communication Skills (1) Compiler Design (1) COMPONENT BASED TECHNOLOGY (1) COMPUTER ARCHITECTURE (1) COMPUTER GRAPHICS and MULTIMEDIA SYSTEMS (6) COMPUTER INTEGRATED MANUFACTURING (1) Computer Networks (9) Computer Organization (2) Computer Programming (1) Consumer Behaviour (1) Control Systems (1) Cryptography and Network Security (3) Datastructures and Algorithms (10) Datawarehousing and Mining (1) DBMS (5) DESIGN AND ANALYSIS OF ALGORITHMS (9) DESIGN OF MACHINE ELEMENTS (1) DIGITAL PRINCIPLES AND SYSTEMS DESIGN (3) Discrete Mathematics (1) DISTRIBUTED COMPUTING (2) DSP (8) DYNAMICS OF MACHINERY (2) Economic Foundations (1) ELECTRICAL ENGINEERING (1) ELECTRICAL ENGINEERING AND CONTROL SYSTEMS (1) Electromagnetic Fields (3) ELECTRONIC CIRCUITS (1) ELECTRONIC COMMERCE (4) ELECTRONIC DEVICES AND CIRCUITS (1) EMBEDDED SYSTEMS (1) FUNDAMENTALS OF COMPUTING (2) Graphics and Multimedia (3) HEAT AND MASS TRANSFER (1) HUMAN RESOURCE MANAGEMENT (1) Internet Programming (9) INTRODUCTION TO FINITE ELEMENT ANALYSIS (1) Legal Aspects of Business (1) MANAGEMENT INFORMATION SYSTEMS (1) Marketing Management (1) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (4) MATHEMATICS - I (1) MBA (9) MCA (83) MCA QUESTION BANK (2) MECHATRONICS (1) MicroProcessor and Controllers (4) MICROPROCESSORS AND APPLICATIONS (5) MIDDLE WARE TECHNOLOGIES (3) MOBILE COMPUTING (5) NETWORK PROGRAMMING (1) NUMERICAL METHODS (1) OBJECT ORIENTED ANALYSIS AND DESIGN (5) Object Oriented Programming (18) Operating System (2) OPERATING SYSTEMS (9) Organizational Behaviour (2) POWER ELECTRONICS (1) Principles of Management (8) PROBABILITY AND QUEUEING THEORY (2) Probability and Statistics (1) PROBLEM SOLVING AND PROGRAMMING (2) PROCESS PLANNING AND COST ESTIMATION (1) PROFESSIONAL ETHICS AND HUMAN VALUES (1) RANDOM PROCESSES (1) RESOURCE MANAGEMENT TECHNIQUES (2) ROBOTICS (1) Security analysis (1) Service Marketing (1) SIGNALS AND SYSTEMS (1) Software Engineering (8) SOFTWARE PROJECT MANAGEMENT (4) SOFTWARE QUALITY MANAGEMENT (2) System Software (2) TCP/IP PROTOCOL SUITE (3) Theory of Computation (4) Total Quality Management (2) UNIX AND NETWORK PROGRAMMING (4) Visual Programming (2) WEB GRAPHICS (2) WEB TECHNOLOGY (2) XML AND WEB SERVICES (4)

Friday, July 4, 2008

COMPUTER NETWORKS 2006 - B.E CSE

CS339 - COMPUTER NETWORKS

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. (8)

(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. (8)

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) 

 

No comments:

Post a Comment