CN Practical Exam - Sem V- Nov 2012

Some Practical exam questions will not be directly from the journal...there will be very small modifications, and all such modifications will be as per discussed in the practicals.

There can be changes based on:

• packet tracer topologies
• socket programming(capitalization of string)
• Hamming Code(Take input data from user(in 1's and 0's) and generate its hamming code)
• NO CHANGES IN NS2(but n/w topologies may/may not change)

Rest of the list remains the same..

Practical Schedule:

06/11/2012  Seat No: 301-340  Time: 9am sharp  followed by viva

07/11/2012  Seat No: 341-380  Time: 9am sharp  followed by viva

*********************ALL THE BEST*****************

CN Submissions Sem V October 2012

CN Submissions: 23/10/2012 and 25/10/2012
CN Viva and Practical Exam: 6/11/2012 & 7/11/2012

All The Best!!

Assignment-2 CN - SEM V - CMPN

1.       Write Short notes on:
a) Features of IPv6
b) Token Bucket algorithm
c) Adhoc Networking
d) QoS of internetworking

2.       Explain the structure of IPv4 header

3.       Explain classful IP addressing

4.       What is count to infinity problem in distance vector routing

5.       Explain CIDR in detail

6.       Explain the three protocol scenarios for establishing a connection using 3-way handshake in TCP

Last Date: 20/10/2012  

Experiment List – Computer Networks – Sem V(CMPN)

1.  Study of Networking Devices

2.  A) Design of College network having 2 Departments using Packet Tracer

B) Design of College network having 4 Departments using Packet Tracer

3. Stop and Wait protocol using NS2

4. Slow Start Protocol for Congestion Control using NS2

5. Sliding Window Protocol using NS2

    6. A) Monitor Traffic in a given network using NS2 (4 nodes)

        B) Monitor Traffic in a given network using NS2 (6 nodes)

    7. Design of an infrastructure wireless network for a small company using Packet Tracer

    8. TCP Socket programming (2-way communication between TCPClient and TCPServer)

    9. Implement Shortest Path using Dijkstra’s Algorithm

   10. Bellman Ford Algorithm

   11. Case Study on any Advance Topic in Networking/Distributed Domain (groupwise – 4 students per group)

Practical Exam will be conducted based on above topics, with/without some modifications.

Subject Incharge: Prof. Akshay Rele

QUESTION BANK – COMPUTER NETWORKS – SEM V – SEPT 2012

QUESTION BANK – COMPUTER NETWORKS – SEM V – SEPT 2012

1.       Explain FDMA, TDMA, CDMA

2.       Draw the layered structure and compare the 2 network reference models-OSI & TCP/IP

3.       An 8 bit byte with binary value 10101111 is to be encoded with even parity Hamming code. What is the binary value after encoding?

4.       Explain sliding window using Go-back N technique

5.       Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one is less? Explain.

6.       Explain working of following network components and state in which layer they work. Repeaters, Hubs, Bridges, Routers and Switches and Gateways.

7.       Explain the working of Switched Ethernet

8.       Explain Design issues for the layers

9.       Explain the principles of CONS and CLNS. Also mention advantage and disadvantage of both.

10.   Write Short note on:
1. Ethernet Frame Format
2. ADSL
3. Framing Methods
4. Difference between ADSL and Cable for use in Cable Television
5. SS7