Department of Computer Science and

Engineering

Course Name : Computer Networks

Course Number : A55026

Course Designation : Core

Prerequisites : Computer Fundamentals,

Number Systems and Data
communication System.

III B Tech – I Semester

(2015-2016)

B. Ujwala
Asst professor
SYLLABUS
Introduction Reference Models: The OSI Reference Model, The TCP/IP Reference
Model, A Comparison of the OSI and TCP/IP Reference Models, A Critique of the OSI
Model and Protocols, A Critique of the TCP/IP Reference Model. Sliding Window
Unit – I
Protocols: One-Bit Sliding Window Protocol, A Protocol Using Go Back N, A Protocol
Using Selective Repeat.

The Channel Allocation problem: Static Channel Allocation in LANs and MANs,
Dynamic Channel Allocation in LANs and MANs.
Multiple Access Protocols: ALOHA, Carrier Sense Multiple Access Protocols,
Collision-Free Protocols, Limited-Contention Protocols, Wavelength Division Multiple
Unit – II Access Protocols, Wireless LAN Protocols.
Ethernet: Ethernet Cabling, Manchester Encoding, The Ethernet MAC Sublayer
Protocol, The Binary Exponential Backoff Algorithm, Ethernet Performance,
Switched Ethernet, Fast Ethernet, Gigabit Ethernet, IEEE 802.2: Logical Link
Control, Retrospective on Ethernet,
Network Layer Design Issues : Store-and-Forward Packet Switching, Service
Provided to the Transport Layer, Implementation of Connectionless Service,
Implementation of Connection-Oriented Service, Comparison of Virtual-Circuit and
Datagram Subnets,
Routing Algorithms : The Optimality Principle, Shortest Path Routing, Flooding,
Unit – III Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast
Routing, Multicast Routing, Routing for Mobile Hosts, Routing in Ad Hoc Networks,
Node Lookup in Peer-to-Peer Networks.
Congestion Control Algorithms: General Principles of Congestion Control,
Congestion Prevention Policies, Congestion Control in Virtual-Circuit Subnets,
Congestion Control in Datagram Subnets, Load Shedding, Jitter Control.
The Transport Service: Services Provided to the Upper Layers. Transport Service
Primitives. Berkeley Sockets, An Example of Socket Programming: An Internet File
Server.
Elements Of Transport Protocols: Addressing, Connection Establishment,
Connection Release, Flow Control and Buffering, Multiplexing, Crash Recovery.
A Simple Transport Protocol: The Example Service Primitives, The Example
Transport Entity, The Example as a Finite State Machine.
Unit – IV
The Internet Transport Protocols: UDP: Introduction to UDP, Remote Procedure Call,
The Real-Time Transport Protocol.
The Internet Transport Protocols: Introduction to TCP, The TCP Service Model,
The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP
Connection Release, Modeling TCP Connection Management, TCP Transmission
Policy, TCP Congestion Control, TCP Timer Management, Wireless TCP and UDP,
Transactional TCP.

2
 Cryptography: Introduction to Cryptography, Substitution Ciphers, Transposition
Ciphers, One-Time Pads, Two Fundamental Cryptographic Principles.
Symmetric-Key Algorithms: DES-The Data Encryption Standard, AES-The
Advanced Encryption Standard, Cipher Modes, Other Ciphers, Cryptanalysis.
Unit – V Public-Key Algorithms: RSA., Other Public-Key Algorithms.
Digital Signatures: Symmetric-Key Signatures, Public-Key Signatures, Message
Digests, The Birthday Attack.
Communication Security: IPsecurity, Firewalls, Virtual Private Networks,
Wireless Security,

TEXT BOOKS & OTHER REFERENCES

Text Books

1. Computer Networks Fifth Edition By Andrew S. Tanenbaum, Pearson Education

Suggested / Reference Books

1. Data communications and Networking, Behrouz A. Forouzan, 4th edition, TMH.
Computer Networking, A Top – Down approach featuring the internet, James F.
2. kurose, K .w.ross , 3rd edition, Pearson Education.

Websites References

1.
http://netgroup.polito.it/teaching/cn/Content

2. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-
829-computer-networks-fall-2002/download-course-materials/
3.
http://en.wikipedia.org/wiki/Computer_networks

4.
http://www.networking-forum.com/

3
Time Table
Room No: W.E.F: 22-06-2015
Hour/ 1 2 3 4 5 6 7

Time 9:00 - 9:50 9.50 –10:40 10:40 –11:30 11:30 – 12: 20 1:10 –21:00 2:00 – 2:50 2:50 – 3:40

III-I
MON
CSE-D

LUNCH BREAK 12:20 – 1:00

III-I
TUE
CSE-D

III-I
WED
CSE-D

THU

III-I
FRI
CSE-D

III-I
SAT
CSE-D

4
PROGRAM EDUCATIONAL OBJECTIVES (PEO’s)

PEO1 The Graduates are employable as software professionals in reputed

industries.

PEO2 The Graduates analyze problems by applying the principles of

computer science, mathematics and scientific investigation to
design and implement industry accepted solutions using latest
technologies.

PEO3 The Graduates work productively in supportive and leadership roles

on multidisciplinary teams with effective communication and team
work skills with high regard to legal and ethical responsibilities.

PEO4 The Graduates embrace lifelong learning to meet ever changing

developments in computer science and Engineering.

PROGRAM OUTCOMES (PO’s)

PO1 An ability to communicate effectively and work on multidisciplinary

teams

PO2 An ability to identify, formulate and solve computer system problems

with professional and ethical responsibility.

PO3 A recognition of the need for, and an ability to engage in life-long

learning to use the latest techniques, skills and modern engineering
tools

PO4 The broad education necessary to understand the impact of

engineering solutions in a global, economic, environmental and social
context

PO5 An ability to apply knowledge of mathematics, science, and

computing to analyze, design and implement solutions to the realistic

5
 problems.

PO6 An ability to apply suitable process with the understanding of

software development practice.

Course Outcomes:

By the completion of this course the student will be able to:

1. Analyze TCP/IP and OSI models and various protocols.

2. Identify suitable multiple access protocol for different networks.
3. Analyze various routing algorithms.
4. Choose suitable protocol (UDP/TCP) of transport layer based on the type of
the application.
5. Compare and contrast various security algorithms

MAPPING OF COURSE OBJECTIVES & COURSE OUT COMES WITH

PO’s & PEO’s

Course Outcomes PO’s PEO’s

1 5 2
2 5 2
3 5 2
4 2 2
5 5 2

6
COURSE SCHEDULE

Distribution of Hours Unit – Wise

Chapters
Unit Topic Total No. of Hours
Book1

Introduction Reference Models,

I Ch-1,2,3 11
Sliding Window Protocols

II Data link layer Ch-4 10

III Network Layer Ch-5 12

IV The Transport layer Ch-6 10

V Cryptography Ch-8 12

Contact classes for Syllabus coverage 55

Tutorial Classes : Online Quiz :

Descriptive Tests : 02 (Before Mid Examination)

Number of Hours / lectures available in this Semester / Year 55

The number of topics in every unit is not the same – because of the variation, all
the units have an unequal distribution of hours

Lecture Plan

Date of
S No. Topic
Completion
Unit-1
1 Introduction to Reference Models
2 The OSI Reference Model
3 The TCP/IP Reference Model,
4 A Comparison of the OSI and TCP/IP Reference Mode

7
 A Critique of the OSI Model and Protocols, A Critique of the
5
TCP/IP Reference Model.
6 Sliding Window Protocols : One-Bit Sliding Window Protocol
7 A Protocol Using Go Back N,
8 A Protocol Using Selective Repeat
Unit-2
Static Channel Allocation in LANs and MANs, Dynamic
1
Channel Allocation in LANs and MANs
2 Access Protocols : ALOHA,
Carrier Sense Multiple Access Protocols Collision-Free
3
Protocols, Limited-Contention Protocols,
Wavelength Division Multiple Access Protocols, Wireless
4
LAN Protocols.
5 Ethernet : Ethernet Cabling
6 Manchester Encoding, The Ethernet MAC Sublayer Protocol
The Binary Exponential Backoff Algorithm, Ethernet
7
Performance, Switched Ethernet
8 Fast Ethernet, Gigabit Ethernet
9 IEEE 802.2: Logical Link Control, Retrospective on Ethernet
Unit-3
Network Layer Design Issues : Store-and-Forward Packet
1
Switching, Service Provided to the Transport Layer,
Implementation of Connectionless Service
2
Comparison of Virtual-Circuit and Datagram Subnets
Routing Algorithms : The Optimality Principle, Shortest Path
3
Routing
4 Flooding, Distance Vector Routing,
5 Link State Routing
6 Hierarchical Routing, Broadcast Routing,
Multicast Routing
7
Routing for Mobile Hosts, Routing in Ad Hoc Networks,
8 Node Lookup in Peer-to-Peer Networks.
Congestion Control Algorithms : General Principles of
9
Congestion Control
Unit-4
The Transport Service: Services Provided to the Upper
1
Layers. Transport Service Primitives.
Berkeley Sockets, An Example of Socket Programming: An
2
Internet File Server.
3 Elements Of Transport Protocols : Addressing
4 Connection Establishment
Connection Release, Flow Control and Buffering,
5
Multiplexing, Crash Recovery
6 A Simple Transport Protocol : The Example Service
Primitives, The Example Transport Entity, The Example as a

8
 Finite State Machine
The Internet Transport Protocols: Introduction to TCP, The
7
TCP Service Model
The TCP Protocol, The TCP Segment Header, TCP
8 Connection Establishment
Unit-5
1 Cryptography : Introduction to Cryptography
2 Substitution Ciphers, Transposition Ciphers,,
3 One-Time Pads, Two Fundamental Cryptographic Principles
Symmetric-Key Algorithms : DES-The Data Encryption
4
Standard
5 AES-The Advanced Encryption Standard,
6 Cipher Modes, Other Ciphers, Cryptanalysis
Public-Key Algorithms : RSA., Other Public-Key
7
Algorithms
Digital Signatures: Symmetric-Key Signatures, Public-Key
8 Signatures, Message Digests, The Birthday Attack.

Date of Unit Completion & Remarks

Unit – 1

Date : __ / __ / __

Remarks:
________________________________________________________________________

Unit – 2

Date : __ / __ / __

Remarks:

________________________________________________________________________

Unit – 3

Date : __ / __ / __

Remarks:

9
 ________________________________________________________________________

Unit – 4

Date : __ / __ / __

Remarks:

________________________________________________________________________

Unit – 5

Date : __ / __ / __

Remarks:

________________________________________________________________________

Unit Wise Assignments (With different Levels of thinking

(Blooms Taxonomy))
Note: For every question please mention the level of Blooms taxonomy

Unit – 1

Go to IETF’s Web site, www.ietf.org, to see what they are doing. Pick a project you
1.
like and write a half-page report on the problem and the proposed solution. L3
A connection oriented connection provides better quality of service. Justify the
2.
statement. L3
The Internet is made up of a large number of networks. Their arrangement determines
the topology of the Internet. A considerable amount of information about the Internet
3.
topology is available on line. Use a search engine to find out more about the Internet
topology and write a short report summarizing your findings. L3
A client-server system uses a satellite network, with the satellite at a height of 40,000
4.
km. What is the best-case delay in response to a request? L3
Compare and contrast the sliding window protocol, go back-N protocol. Why selective
5
repeat is better than the go back - N protocol. L4

Unit – 2

1. Consider five wireless stations, A, B, C, D, and E. Station A can communicate with all
other stations. B can communicate with A, C and E. C can communicate with A, B and
D. D can communicate with A, C and E. E can communicate A, D and B.

10
 (a) When A is sending to B, what other communications are possible?
(b) When B is sending to A, what other communications are possible?
(c) When B is sending to C, what other communications are possible?
L3

Two CSMA/CD stations are each trying to transmit long (multiframe) files. After each
frame is sent, they contend for the channel, using the binary exponential backoff
2. algorithm. What is the probability that the contention ends on round k, and what is
the
mean number of rounds per contention period?L3

3. Give two reasons why networks might use an error-correcting code instead of error.
L3
Distinguish different types of cabling supported by Ethernet standard? Why do you
4. require a limit on the minimum size of Ethernet frame? L4

An 802.16 network has a channel width of 20 MHz. How many bits/sec can be sent to
5 a subscriber station? L3

Unit – 3

Assuming that all routers and hosts are working properly and that all software in
both
1. is free of all errors, is there any chance, however small, that a packet will be
delivered
to the wrong destination? L3
A router has the following (CIDR) entries in its routing table:
Address/mask Next hop
135.46.56.0/22 Interface 0
135.46.60.0/22 Interface 1
192.53.40.0/23 Router 1
default Router 2
2. For each of the following IP addresses, what does the router do if a packet with that
address arrives?
(a) 135.46.63.10
(b) 135.46.57.14
(c) 135.46.52.2
(d) 192.53.40.7
(e) 192.53.56.7

An IP datagram using the Strict source routing option has to be fragmented. Do you
3.
think the option is copied into each fragment, or is it sufficient to just put it in the first
fragment? Explain your answer. L3
4. Convert the IP address whose hexadecimal representation is C22F1582 to dotted
decimal notation. L3

Unit – 4

Datagram fragmentation and reassembly are handled by IP and are invisible to TCP.
Does this mean that TCP does not have to worry about data arriving in the wrong
1.
order?. L3

11
 Both UDP and TCP use port numbers to identify the destination entity when delivering
a message. Give two reasons why these protocols invented a new abstract ID (port
2.
numbers), instead of using process IDs, which already existed when these protocols
were designed. L3

3. Compare and contrast between Wireless TCP and UDP. L3

Consider the effect of using slow start on a line with a 10-msec round-trip time and
4. no congestion. The receive window is 24 KB and the maximum segment size is 2 KB.
How long does it take before the first full window can be sent? L3

Unit – 5

Differentiate between block ciphers with transposition cipher.

1. How does DNS perform name resolution? Explain with example . L2

Generate the public key and secret key for the following prime numbers using RSA
algorithm: P=3, Q=11, and take E=5.
2.
And Discuss the DNS message format for query and reply messages . L3

Break the following mono alphabetic substitution cipher. The plaintext, consisting of
letters only, is an excerpt from a poem by Lewis Carroll.
mvyy bek mnyx n yvjjyr snijrh invq n muvjvdt je n idnvy
jurhri n fehfevir pyeir oruvdq ki ndq uri jhrnqvdt ed zb jnvy
3.
Irr uem rntrhyb jur yeoijrhi ndq jur jkhjyri nyy nqlndpr
Jurb nhr mnvjvdt ed jur iuvdtyr mvyy bek pezr ndq wevd jur qndpr
mvyy bek, medj bek, mvyy bek, medj bek, mvyy bek wevd jur qndpr
mvyy bek, medj bek, mvyy bek, medj bek, medj bek wevd jur qnd L3
Design an attack on DES based on the knowledge that the plaintext consists
4. exclusively of uppercase ASCII letters, plus space, comma, period, semicolon,
carriage return, and line feed. Nothing is known about the plaintext parity bits. L3

Unit Wise Case Studies (With different Levels of thinking

(Blooms Taxonomy))
Note: For every Case Study please mention the level of Blooms taxonomy

Case Studies (With Higher Levels of thinking (Blooms

Taxonomy))
Note: For every Case Study please mention the level of Blooms taxonomy

1(Covering Syllabus Up to Mid-1)

Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up
reassembly buffers forever. Suppose that a datagram is fragmented into four fragments.
The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off
and the three fragments in the receiver’s memory are discarded. Al ittle later, the last
fragment stumbles in. What should be done with it?

12
2(Covering Entire Syllabus)

Alice was a heavy user of a type 1 anonymous remailer. She would post many messages to
her favorite newsgroup, alt.fanclub.alice, and everyone would know they all came from Alice
because they all bore the same pseudonym. Assuming that the remailer worked correctly,
Trudy could not impersonate Alice. After type 1 remailers were all shut down, Alice switched
to a cypherpunk remailer and started a new thread in her newsgroup. Devise a way for her
to prevent Trudy from posting new messages to the newsgroup, impersonating Alice.

Unit Wise Important Questions (With different Levels of

thinking (Blooms Taxonomy))
Note: For every question please mention the level of Blooms taxonomy

Unit – 1

Discuss the ISO - OSI layered model, bringing out the functionalities of each
1.
layer
Draw a CRC encoder and decoder for CRC code with C (7, 4). Also explain how
2.
this CRC design works, with an example
Differentiate between OSI reference model and TCP/IP model with neat
3. diagrams.

4. Explain in detail Sliding window protocol

Unit – 2

Consider a 100 Mb/s version of Ethernet using CSMA/CD. If the maximum

separation between two nodes is 5 km, how efficient is the network if all
1.
packets have the minimum length? What if they have the maximum length?

a) Discuss in brief MAC frame structure for IEEE 802.3?

2.
b) Explain the following CSMA schemes
a) Describe the stop and wait flow control technique.
3. Explain the term sliding window. Also illustrate and explain the
operation of selective repeat.

a) An ALOHA network user 19.2 kbps channel for sending message packets of
4. 100 bit long size. Calculate the maximum throughput for pure ALOHA network
5 Two neighboring nodes A and B use sliding window protocol with 3-bit
sequence number. As the ARQ mechanism Go Back N is used with window
size of 4. Assume A is transmitting and B is receiving , show window position
for the following events:
i) before A send any frame
ii) After A send frame 0, 1, 2 and receive ACK from B for 0 and 1.

13
 a) Discuss in brief MAC frame structure for IEEE 802.3?
Explain the followi g CSMA schemes: (i)Non-persistet
(ii) 1-ersistent
(iii)p-persistent

Unit – 3

Which of the following IP addresses are “matched” by the address prefix

123.234.99.10/20?
1.
123.235.31.10 123.234.95.23 123.234.102.10 123.456.140.10

Explain in detail the ATM cell format.

2.

Explain Distance Vector routing in detail.

3.

4. Differentiate ARP And RARP

Unit – 4

1. With neat architecture, explain UDP in detail.

2. Explain TCP Congestion control techniques in detail.

Explain how QoS is provided through Differentiated Services.

3.

4. Explain the Congestion Avoidance techniques in detail.

Unit – 5
a) Generate the public key and secret key for the following prime numbers
1. using RSA algorithm: P=3, Q=11, and take E=5.
b)Discuss the DNS message format for query and reply messages. L3
a) Explain the message authentication operation used in RSA technique.
2. b) If a DNS domain name is XXX.YYY.edu, how many labels are involved in
here? What is the lowest level domain and what is the highest level domain
in this example? Explain. L2
a) Differentiate between block ciphers with transposition cipher.
3.
b) How does DNS perform name resolution? Explain with example. L3
a) What is Electronic mail? Explain the two scenarios of architecture of E-Mail.
4. b)What is a name server? List and explain the characteristic features of
various name servers.

14
Unit Wise Multiple Choice Questions

Unit – I
1. Routers operate at which layer of the OSI Model?
A) Physical B) Network C) Transport D) MAC sublayer of the Data Link layer
2. Bits are packaged into frames at what layer of the OSI Model?
A) Data Link B) Physical C) Transport D) Application E) Presentation
3. Which of the following are benifits of using a layered network model?
A) It facilitates troubleshooting
B) It breaks the comples process of netorking into more managable chuncks
C) It allows layers developed by different vendors to interoperate.
D) All of the above
4. The layer of the OSI Model, from the top down are:
A) Application, Presentation, Session, Transport, Network, Data Link, Physical
B) Physical, Data Link,Network, Transport, Session, Presentation, Application
C) Session, Presentation, Data Transport, MAC, Network, Physical
D) Application, Encryption, Network, Transport, Logical Link Control, Physical
5. Which of the following operates at the Presentation layer?
A) FTP & HTTP B) UDP C) SMTP D) MIDI & JPEG E) All of the above
6. Which of the following are Transport layer protocols?
A) TCP & UDP B) CISC C) ATM D) HTTP & FTP
7. Which of the following are considered to be the upper layer protocols?
A) Presentation & Session B) Application, Presentation, & Session
C) Application & Presentation D) Application
E) Application, Presentation, Session, & Transport
8. Flow control takes place at what layer?
A) Physical B) Transport C) Network D) Application E) Data Link
9. Encryption takes place at which layer?
A) Physical B) Application
C) Presentation D) Data Link E) Session
10. The Network layer uses physical addresses to route the data to destination hosts.
A) True B) Who Knows C) False
False B/C its the logical address
11. Error detection & recovery takes place at what layer?
A) Transport B) Data Link C) Presentation D) Application
E) Network

15
12. What layer establishes, maintains, & termenates communitions between applications
located on different devices?
A) Application B) Transport C) Session D) Data Link E) Network
13. IP is implemented at which OSI Model layer?
A) Transport B) Data Link C) Network D) Session E) Presentation
14. Which layer handles the formatting of application data so that it will be readable by the
destination system?
A) Application B) Transport C) Presentation D) Data Link E) Network
15. Packets are found at which layer of the OSI Model?
A) Data Link B) Network C) Transport D) Session E) Presentation
16. Which layer translates between the physical (MAC) & logical address?
A) Network B) Transport C) Data Link D) Application E) Presentation
17. What does OSI stand for?
A) Organization Standards International B) Operating Standard Information
C) Open Systems Interconnect D) Open System Interface
E) Operatin System Interconnection
18. Repeaters & hubs operate at whaich layer?
A) Network B) Transport C) Physical D) Presentation E) Data Link
19. Bit synchronization is handled at which layer of the OSI Model?
A) Physical B) Network C) Session D) Presentation E) Data Link
20. Most logical addresses are present in network interface cards at the factory?
A) True B) No one knows C) False
False B/C its the physical address
21. Bridges operate at which layer of the OSI Model?
A) Physical B) Network C) Data Link D) Presentation E) Transport
22. What are the sublayers of the Data Link layer?
A) MAC & IPX B) MAC & LLC C) hardware & frame D) Mac address E) WAN & LAN
23. Which layer translates between physical & logical addresses?
A) the MAC sublayer of the Data Link layer B) Physical
C) Transport D) Presentation E) Network
24. Which layer is responsible for packet sequencing, acknowledgements, & requests for
retransmission?
A) Network B) Transport C) Session D) Presentation E) Data Link
25. The physical layer concerns with
a) bit-by-bit delivery b) process to process delivery
c) application to application delivery d) none of the mentioned

16
26. Which transmission media has the highest transmission speed in a network?
a) coaxial cable b) twisted pair cable c) optical fiber d) electrical cable
27. Bits can be send over guided and unguided media as analog signal by
a) digital modulation b) amplitude modulation c) frequency modulation
d) phase modulation
28. The portion of physical layer that interfaces with the media access control sublayer is
called
a) physical signaling sublayer b) physical data sublayer
c) physical address sublayer d) none of the mentioned
29. In asynchronous serial communication the physical layer provides
a) start and stop signaling b) flow control
c) both (a) and (b) d) none of the mentioned
30. The physical layer is responsible for
a) line coding b) channel coding c) modulation d) all of the mentioned

Unit – II

1. The data link layer takes the packets from _____ and encapsulates them into frames
for transmission.
a) network layer b) physical layer c) transport layer d) application layer
2. Which one of the following task is not done by data link layer?
a) framing b) error control c) flow control d) channel coding
3. Which sublayer of the data link layer performs data link functions that depend upon
the type of medium?
a) logical link control sublayer b) media access control sublayer
c) network interface control sublayer d) none
4. Header of a frame generally contains
a) synchronization bytes b) addresses c) frame identifier d) all of the mentioned
5. Automatic repeat request error management mechanism is provided by
a) logical link control sublayer b) media access control sublayer
c) network interface control sublayer d) none of the mentioned
6. When 2 or more bits in a data unit has been changed during the transmission, the
error is called
a) random error b) burst error c) inverted error d) none of the mentioned
7. CRC stands for
a) cyclic redundancy check b) code repeat check c) code redundancy check
d) cyclic repeat check

17
 8. Which one of the following is a data link protocol?
a) ethernet b) point to point protocol c) HDLC d) all of the mentioned
9. Which one of the following is the multiple access protocol for channel access control?
a) CSMA/CD b) CSMA/CA c) both (a) and (b) d) none of the mentioned
10. The technique of temporarily delaying outgoing outgoing acknowledgements so
that they can be hooked onto the next outgoing data frame is called
a) piggybacking b) cyclic redundancy check c) fletcher’s checksum
d) none of the mentioned

Unit – III
1. The network layer concerns with
a) bits b) frames c) packets d) none of the mentioned
2. Which one of the following is not a function of network layer?
a) routing b) inter-networking c) congestion control d) none
3. The 4 byte IP address consists of
a) network address b) host address c) both (a) and (b) d) none
4. In virtual circuit network each packet contains
a) full source and destination address b) a short VC number
c) both (a) and (b) d) none
5. Which one of the following routing algorithm can be used for network layer design?
a) shortest path algorithm b) distance vector routing
c) link state routing d) all of the mentioned
6. Multidestination routing
a) is same as broadcast routing b) contains the list of all destinations
c) data is not sent by packets d) none
7. A subset of a network that includes all the routers but contains no loops is called
a) spanning tree b) spider structure c) spider tree d) none
8. Which one of the following algorithm is not used for congestion control?
a) traffic aware routing b) admission control c) load shedding d) none
9. The network layer protocol of internet is
a) Ethernet b) internet protocol c) hypertext transfer protocol d) none
10. ICMP is primarily used for
a) error and diagnostic functions b) addressing c) forwarding d) none

18
 Unit – IV
1. Transport layer aggregates data from different applications into a single stream
before passing it to
a) network layer b) data link layer c) application layer d) physical layer
2. Which one of the following is a transport layer protocol used in internet?
a) TCP b) UDP c) both (a) and (b) d) none of the mentioned
3. 3. User datagram protocol is called connectionless because
a) all UDP packets are treated independently by transport layer
b) it sends data as a stream of related packets
c) both (a) and (b)
d) none of the mentioned
4. 4. Transmission control protocol is
a) connection oriented protocol
b) uses a three way handshake to establish a connection
c) recievs data from application as a single stream
d) all of the mentioned
5. An endpoint of an inter-process communication flow across a computer network is
called
a) socket b) pipe c) port d) none of the mentioned
6. Socket-style API for windows is called
a) wsock b) winsock c) wins d) none of the mentioned
7. Which one of the following is a version of UDP with congestion control?
a) datagram congestion control protocol
b) stream control transmission protocol
c) structured stream transport
d) none of the mentioned
8. A _____ is a TCP name for a transport service access point.
a) port b) pipe c) node d) none of the mentioned
9. Transport layer protocols deals with
a) application to application communication
b) process to process communication
c) node to node communication
d) none of the mentioned
10. Which one of the following is a transport layer protocol?
a) stream control transmission protocol
b) internet control message protocol

19
 c) neighbor discovery protocol
d) dynamic host configuration protocol

Unit – V
1. In cryptography, what is cipher?
a) algorithm for performing encryption and decryption
b) encrypted message
c) both (a) and (b)
d) none of the mentioned
2. In asymmetric key cryptography, the private key is kept by
a) sender b) receiver c) sender and receiver
d) all the connected devices to the network
3. Which one of the following algorithm is not used in asymmetric-key cryptography?
a) RSA algorithm b) diffie-hellman algorithm c) electronic code book algorithm
d) none of the mentioned
4. In cryptography, the order of the letters in a message is rearranged by
a) transpositional ciphers b) substitution ciphers
c) both (a) and (b) d) none of the mentioned
5. What is data encryption standard (DES)?
a) block cipher b) stream cipher c) bit cipher d) none of the mentioned
6. Cryptanalysis is used
a) to find some insecurity in a cryptographic scheme
b) to increase the speed
c) to encrypt the data
d) none
7. Which one of the following is a cryptographic protocol used to secure HTTP
connection?
a) stream control transmission protocol (SCTP)
b) transport layer security (TSL)
c) explicit congestion notification (ECN)
d) resource reservation protocol
8. Voice privacy in GSM cellular telephone protocol is provided by
a) A5/2 cipher b) b5/4 cipher c) b5/6 cipher d) b5/8 cipher
9. ElGamal encryption system is
a) symmetric key encryption algorithm
b) asymmetric key encryption algorithm

20
 c) not an encryption algorithm
d) none
10. Cryptographic hash function takes an arbitrary block of data and returns
a) fixed size bit string
b) variable size bit string
c) both (a) and (b)
d) none

University Question Papers

****Should be attached

Tutorial Sheet

Date: Topics Revised:

Date: Topics Revised:

Date: Topics Revised:

Date: Topics Revised:

Date: Topics Revised:

21
TOPICS DISCUSSED BEYOND THE SYLLABUS

S.No. Topic

3.

4.

5.

6.

ASSESMENT OF LEARNING OBJECTIVES AND OUT COMES: DIRECT

Blooms Taxonomy:
LEVEL 1 REMEMBERING Exhibit memory of previously learned
material by recalling facts, terms, basic
concepts, and answers
LEVEL 2 UNDERSTANDING Demonstrate understanding of facts and
ideas by organizing, comparing, translating,
interpreting, giving descriptions, and stating
main ideas.
LEVEL 3 APPLYING Solve problems to new situations by applying
acquired knowledge, facts, techniques and
rules in a different way
LEVEL 4 ANALYZING Examine and break information into parts by
identifying motives or causes. Make
inferences and find evidence to support
generalizations.
LEVEL 5 EVALUATING Present and defend opinions by making
judgments about information, validity of
ideas, or quality of work based on a set of
criteria.
LEVEL 6 CREATING Compile information together in a different
way by combining elements in a new pattern
or proposing alternative solutions.
*Attach course assessment sheet

ASSESMENT OF COURSE OUTCOMES: INDIRECT

SNo Criteria LEVEL(Level 5:Excellent Level 4:Very Good Level 3:Good Level 2:Satisfactory Level 1:Poor)
1 5 Student speaks in phase with the given topic confidently using Audio-Visual aids. Vocabulary is exceptional
4 Student speaking with proper planning, fair usage of Audio-Visual aids. Vocabulary is good
3 Student speaking without proper planning, fair usage of Audio-Visual aids. Vocabulary is not good

22
 Oral Communication
2 Student speaks in phase but no synchronization among the talk and Visual Aids.

1 Student speaks vaguely not in phase with the given topic.

Proper structuring of the document with relevant subtitles, readability of document is high with correct use
5
of grammar. Work is genuine and not published anywhere else.
Writing Skills

Information gathered is relevant to the given task. Sentences were framed properly with correct use of
4
grammar.
2 Information gathered is relevant to the given task. sentences were framed properly with inappropriate use
3
of grammar
Information is gathered without continuity of topic, sentences were not framed properly. Few topics are
2
copied from other documents
1 Information gathered was not relevant to the given task. Content is copied from other documents
Student identifies most potential ethical or societal issues and provides solutions for them discussing with
Social and Ethical

5
peers
Awareness

Student identifies most potential ethical or societal issues and provides partial solutions for them
4
discussing with peers
3 Student identifies the societal and ethical issues but tries to provide solutions for them discussing with
3
peers
2 Student identifies the societal and ethical issues but fails to provide any solutions discussing with peers
1 Student makes no attempt in identifying the societal and ethical issues
5 Student uses appropriate methods, techniques to model and solve the problem accurately
Knowledge
Content

4 Student uses appropriate methods, techniques to model and solve the problem partially.

4 3 Student uses appropriate methods to model the problem but attempts to solve the problem
2 Student tries to model the problem and fails to solve the problem
1 Student fails to model the problem and also fails to solve the problem
Participation

5 Listens carefully to the class and answer the questions confidently

Student

4 Listens carefully to the class and tries to answer questions confidently.

5 3 Listens carefully to the lecture and attempts to answer the questions
2 Student listens to the class but doesn’t attempts to answer the questions
1 Student neither listens to the class nor attempts to answer the questions
The program structure is well organized with appropriate use of technologies and methodology. Code is easy
Practical Technical and analytical

5
to read and well documented. Student is able to implement the algorithm producing accurate results
Program structure is well organized with appropriate use of technologies and methodology. Code is easy to
4
read and not properly documented. Student is able to implement the algorithm providing accurate results.
Program structure is well organized with appropriate use of technologies and methodology. Code is quite
Skills

6 3 difficult to read and not properly documented. Student is able to implement the algorithm providing
accurate results.
Program structure is well organized with usage of appropriate technologies and methodology. Code is
2
difficult to read and not documented properly and not able to execute the program
Program structure is not well organized with mistakes in usage of appropriate technologies and
1
methodology. Code is difficult to read and student is not able to execute the program
Knowledge

5 Independently able to write programs for any given context to strengthen the concepts covered in theory

4 Independently able to write programs to strengthen the concepts covered in theory

7 3 Independently able to write programs and able to strengthen the concepts learned in theory
2 Not able to write programs but able to strengthen the concepts learned in theory.
1 Not able to write programs and not able to strengthen the concepts learned in theory
8 Student uses appropriate methods, techniques to model and solve the problem accurately in the context of
5
multidisciplinary projects
4 Student tries to model the problem and solve the problem in the context of multidisciplinary projects
3 Student tries to model the problem and attempts to solve the problem in the context
of multidisciplinary projects.

23
 Student tries to model the problem but fails to solve the problem in the context

Understanding of Engineering
2
of multidisciplinary projects.
Student fails to model the problem and also fails to solve the problem in the context
of multidisciplinary projects

core

*Attach course assessment sheet

Add-on Programmes:
1

Guest Lectures:

1.
2.
3.
4.

Unit Wise PPT’s:

Unit Wise lecture Notes:

24