PESIT- Bangalore South Campus

Hosur Road (1km Before Electronic city)

Bangalore 560 100

Department of MCA
COURSE INFORMATION SHEET

COMPUTER NETWORKS
(13MCA31)

1. GENERAL INFORMATION
Academic Year: 2015
Semester(s):I I I

Title Code Duration

COMPUTER NETWORKS (hrs) 52 Hrs
Lecture
13MCA31 s
Total: 52 Hrs

2. FACULTY DETAILS

Details
Name SOMASHEKHARAREDDY
Department MCA
Room Number 503 5TH FLOOR
Phone No. 8861290291
E-mail address somashekharareddy@pes.edu
Contact Hours Office Hours
Consultation Time By Email

3. VENUE AND HOURS/WEEK

All lectures will normally be held in 603.
Lecture Hours/week: 4Hr
4. COURSE OBJECTIVE

A computer network is a collection of computers and devices connected to each other.

The network allows computers to communicate with each other and share resources and
information. The Advanced Research Projects Agency (ARPA) designed "Advanced
Research Projects Agency Network" (ARPANET) for the United States Department of
Defense. It was the first computer network in the world in late 1960s and early 1970s

5. COURSE OUTCOMES

Students will be able to:

1. Simulate the network using NS2 Simulator

2. Setting up the local area network with NS2 Simulator
3. Write a TSL Script to simulate the a file transfer with NS2
4. Measure the performance of the network
5. Design different protocols like TCP and UDP
6. Simulate the wired network and demonstrate the distance routing algorithm

6. MODULE SPECIFICATION:

% of portions
covered
Class
Chapter # Topics to be covered Referen
# Cumulati
ce
ve
Chapter
1 Networking Devices
Classification of Computer
CHAPTER 1:
2 Networks ,Network Protocol Stack
Introduction to
( TCP/IP and ISO-OSI), 5.7 5.7
Computer
Networks Network Standardization and
3 Examples of Networks

4 Data Transmission Concepts

CHAPTER 2: Analog and Digital Data
5 Physical Transmission
Layer Transmission Impairments 19.2 24.9
6
and Channel Capacity
7
Guided and Wireless transmission
8 communication media

Digital modulation techniques

9
FDMA,TDMA,CDMA
Digital modulation techniques
10
FDMA,TDMA,CDMA
mobile telephone systems
11 (1G,2G,3G and
4G).
mobile telephone systems
12 (1G,2G,3G and
4G).
mobile telephone systems
13 (1G,2G,3G and
4G).
14 Error Detection Correction
15 CodesData Link Protocols
CHAPTER 3:
16 Data Link Sliding window protocols 9.6 34.5
layer
17
Sliding window protocols
18

19 Multiple access protocols

Ethernet, Wireless LAN,
20
Broadband Wireless

21 CHAPTER 4: bluetooth,
7.6 42.1
MediumAccess
Sub Layer

22 Data Link Layer Switching

23
24
Network Layer Design issues
25
CHAPTER 5:
26
27 Congestion Control Algorithms,
26.9 72
28
Network
29
Layer Quality of Service,
30
31
32 Internetworking
33
 34
35
36
The Network Layer in the Internet

37
The Transport Service
38
39
Elements of Transport Protocols
30
41
Congestion Control,
41
43 CHAPTER 6: The Internet Transport Protocol: 23 95
44 The Transport
Layer UDP
45
46
47 The Internet Transport Protocols
48 TCP, Performance Issues

49 CHAPTER 7: DNS and Video

50 The Email,WWW
application
51 Layer Streaming audio 7.6 100
Streaming Video
52
and Content Delivery

7. RECOMMENDED BOOKS

A. PRESCRIBED TEXTBOOK
1. Computer Networks by Andrew S Tanenbaum, David J Wetheral, 5th Edition,
Pearson 2012
Chapter 1, 2.2, 2.3, 2.5, 2.7, 3.1, 3.2, 3.3, 3.4, 4.2, 4.3, 4.4, 4.5, 4.6, 4.8 Chapter
5, Chapter 6 (excluding 6.7)

2 Data and Computer Communications by William Stallings , Above 7th edition ,

2004

B. REFERENCE BOOKS

1. Computer Networks Principles,Technologies and Protocols for Network Design,

by
NATALA OLIFER and VICTOR OLIFER , 2010

2. http://www.ietf.org/rfc.html relevant RFC document could be used to get more

detailed
information about any of the concepts prescribed in the syllabus like RFC 2460 can
be referred
to get a detailed information about IPV6
8. ASSIGNMENT(S)

Assignment 1
Write a TCL script to simulate the network described below
Consider a small network with five nodes n0, n1, n2, n3, n4, forming a Bus topology.
Node n0 is a TCP source, which transmits packets to node n3 (a TCP sink) through the
node n4. Node n1 is another traffic source, and sends UDP packets to node n2 through
n4. The duration of the simulation time is 10 seconds.
Write a Tcl script (in the text area below) to simulate this scenario. Once you have
written your
simulation script, click on the "Run" button to execute it. You can verify your code by
clicking
on the "View Solution" button at the bottom of the page.

Assignment 2

Implement link state algorithm using ns2 by assuming suitable parameters

9.ASSESSMENT

A. WRITTEN EXAMINATION

Paper Structure
No. Of Questions 8 Main Questions No. of questions to be answered 5
Nov/Nov2014
Exams date Paper Duration 3 Hrs
(Tentative)
Total Marks 100 Pass Marks 40

B. CONTINUOUS ASSESSMENT
Weighting (%)
Assignment(s): 5 Marks (10%)
Seminar(s): 5 Marks (10%)
Class Test(s) 5 Marks (10%)
Class Interaction 5 Marks(10%)
Test(s): 30 Marks (60%)
Total Marks: 50 arks
10. QUESTION BANK

1. OSI reference model with neat diagram.

2. solve the problems on latency and bandwidth given at the end of chapter.
3. Problems on CRC and sliding window protocol.
4. What is peer-to-peer process?
5. What are the concerns of the physical layer in the internet model?
6. How do the layers of the internet model correlate to the layers of the OSI model?
7. Explain requirements in building a network.
8.What do you mean by Link.What are the different type of Link?
9.Define Multiplexing.Explain Frequency division multiplexing,Synchronous time division
Multiplexing?

1 . Consider a point to point link 2 m in length.At what bandwidth would prapogation

delay at a speed o 2 1 8 m/sec) equal transmit delay for 100 byte packets? What
about 512 byte packets.

11. Describe the spanning tree algorithm

12. Write the differences between datagram and virtual circuit.
13. With neat diagram explain different fields of IPV6 packet format
14. Briefly explain about CIDR and BGP
15. Solve the problems on sub netting which are at the end of the chapter.
16. Explain network architecture in detail.
17. Explain network software
18. What does the CRC generator append to the data unit
19. List the steps involved in creating a checksum.
20. How does the CRC checker know that received data unit is undamaged?
21. Explain physically connecting hosts.
22. Explain the time domain and frequency domain with an example

23. Explain WWW in detail.

24 .Explain e-mail(SMTP,MIME,IMAP)
25. What is DNS explain it in detail.
26. Write last year question paper.
27. What is relationship between a switch and a bridge?
28. Explain framing.
29. Explain reliable transmission.
30. Explain Ethernet.
31. Design Sender-site and Receiver-site algorithm for Stop and Wait ARQ.
32. Explain IPV6 protocol in Detail.
33. Explain Distance Vector Routing Algorithm in Detail.
34. Explain Open Shortest path Algoritm in Detail.
35. Write a note on Cost effective resource sharing
36. Explain the terms Links, nodes, clouds
37. What are different applications of computer networks
38. With a neat diagram explain the layered architecture
39. Explain the terms multiplexing and demultiplexing
40. Write about functionalities of all layers Briefly in OSI model
41. What ate sockets and explain them with an example
42. Describe Application Programming interface with an example
43. Explain the terms Bandwidth and latency
44. Why is it necessary to know the product of delay X bandwidth
45. Explain the terms switching and forwarding
46. What are data grams
47. Write about VC switching
48. Why are bridges useful?
49. Explain the spanning tree algorithm
50. Write different limitations of bridges
51. What is UDP protocol explain in detail
52. What is TCP protocol explain it in detail with header formats
53. How a connection is established and disconnected in TCP
54. Explain three way hand shake and why is it useful
55. Write about Adaptive retransmission
56. Explain TCP extensions
57. Describe the network model
58. Write different resource allocation mechanisms(Taxonomy)
59. What are different traditional application protocols