[Link] | [Link] | [Link].
in
R-20 Syllabus for CSE-CS, JNTUK w. e. f. 2020 – 21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
DEPARTMENT OF CSE – CYBER SECURITY
REFERENCE BOOKS:
1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT
Press,2009.
2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice
Hall,1998.
3. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009.
4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the
ISOStandard”, Fifth Edition, Springer,2003
L T P C
III Year – I Semester
0 0 3 1.5
NETWORK PROGRAMMING LAB
Course Objectives:
Understand and apply different network commands
Analyze different networking functions and features for implementing
optimal solutions Apply different networking concepts for implementing
network solution
Implement different network protocols
Course Outcomes:
Apply the basics of Physical layer in real time applications
[Link] | [Link] | [Link]
[Link] | [Link] | [Link]
R-20 Syllabus for CSE-CS, JNTUK w. e. f. 2020 – 21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
DEPARTMENT OF CSE – CYBER SECURITY
Apply data link layer concepts, design issues, and protocols
Apply Network layer routing protocols and IP addressing
Implement the functions of Application layer and Presentation layer
paradigms and Protocols
Experiments:
1) Implement the data link layer framing methods such as character
stuffing and bit stuffing.
2) Write a C program to develop a DNS client server to resolve the given hostname.
3) Implement on a data set of characters the three CRC polynomials – CRC-
12, CRC-16andCRC-CCIP.
4) Implement Dijkstra’s algorithm to compute the shortest path in a graph.
5) Take an example subnet graph with weights indicating delay between
nodes. Now obtain Routing table art each node using distance vector
routing algorithm
6) Take an example sub net of hosts. Obtain broadcast tree for it.
7) Write a client-server application for chat using UDP
8) Implement programs using raw sockets (like packet capturing and filtering)
9) Write a C program to perform sliding window protocol.
10) Get the MAC or Physical address of the system using Address Resolution
Protocol.
11) Simulate the Implementing Routing Protocols using border gateway protocol
(BGP)
12) Simulate the OPEN SHORTEST PATH FIRS Trouting protocol based on the cost
assigned to the path.
[Link] | [Link] | [Link]