Computer Networks-PPT

Contains
MK-PPT_Chapter_6-congestion_v3.ppt
MK-PPT Chapter 5-end-to-end protocols v2.ppt
SMTP HTTP FTP protocols.ppt 
nw-security 

http://www.mediafire.com/?gbs7gbxpjxrqxgu 

NS2-Exps

Direct Printouts[Alligned]
http://www.mediafire.com/?cck7mmzce4wd52y

Java REC

Java Experiments
http://www.mediafire.com/?f5sf5imre9aw0t5

SS-LAB(INDEX)

Contains Index for both the batches
http://www.mediafire.com/?ng6q4fr478pqe4p

Department of Computer Science and Engineering
Common to CSE & IT
B.E/B.Tech Degree Cycle Test – II, September 2011

Branch: CSE Year/Semester: III / V
Subject Name: Computer Networks Max Marks: 50

Part – A (09 x 02 = 18)

1. Justify why packet switching is more suitable to data transmission
2. List the two forms in which virtual circuit packet switching is implemented
3. Is 3.54.81.76 a class A, B, C, or D IP address? What are the network ID and host
ID in decimal notation? Assume that the subnets are not used.
4. What field in the IP datagram header is used to avoid forwarding datagram's endlessly
through routing loops? How is the header used to accomplish that?
5. What is the need of ARP ?
6. Give some examples of error messages provided by ICMP?
7. What are the three methods that support IP address allocation in DHCP?
8. Name the two queuing algorithms used in routers. Differentiate their working principle
9. State which layers of the ISO OSI model does the following
Interconnecting devices operate.
(1) Repeaters (2) Bridges (3) Routers (4) Gateways

Part-B (02 x 16 =32)

10 (a) i. Explain in detail about the different queuing disciplines (8)
ii. Briefly explain about ARP, DHCP (8)
(Or)
(b) i. Give the format of IPv4 packet and explain the function of each field (8)
ii. Explain Spanning tree algorithm with an example (8)

11. (a) i. Differentiate DVR and LSR techniques. (8)
ii. An organization is granted a site address 130.56.0.0 & Company needs 1024
Subnets. (8)
a) Find subnet mark.
b) Find the no. of address in each subnet
c) Find 1st and last address in subnet 1
d) Find 1st and last subnet 1024
(Or)
(b) i. Given the network topology below, use a link-state algorithm to
Compute the shortest path from A to all other nodes. Make sure to show the results
of the computation at each step. (12)

ii. Describe collision avoidance mechanism used in 802.11 wireless LAN. In particular
how such a mechanism solves the hidden terminal problem (4)


Prepared by Approved by

Dr K.Komathy
Dr S.Chitrakala(HOD /CSE)

REC Printouts

SS[1-12]
Network[1-9] and
Java[1-6]
Includes Network Introduction

http://www.mediafire.com/?ybvaxvjva5b435a

Java-5,6,7

http://www.mediafire.com/?wbn3535dbv3add4

PP-Inp Questions

PP questions
http://www.mediafire.com/?po90h862qovxfvc

TOC-Problems

TOC theorms

http://www.mediafire.com/?uwoucgkbdq99y9w

CN-2marks

SS-2 marks

SE-Unit 2

SE Unit 2
http://www.mediafire.com/?naxl0ceenkoedg0

SE-Local Author

Contains UID,Real Time Executives,Data Process,Data Design Principles
http://www.mediafire.com/?2u8rvg8yzzp3wa2

SE-Assignment 2

SE-Assignment 2
http://www.mediafire.com/?9i7u3ll2p6u1aru

Lab Exp(SS,SE,CN)

Exp for printouts
http://www.mediafire.com/?drb2sh69hczmxg9

SE(Answer for tomo test)

TOC(Tutorial 2.3-Minimization

CN-Notes(CIDR_Classless_Interdomain_Rou)

http://www.2shared.com/file/F05UBcMM/CIDR_Classless_Interdomain_Rou.html