Cse252 2202

SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India

SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Course Description
COURSE NAME: COMPUTER NETWORKS

COURSE CODE: CSE252
L T P C: 3003
Course Type: University Core
Semester Offered: Even Term
Academic Year: 2022-23
Timing 02:05-02:55(Mon), 01:10-02:00 (Tue), 02:05-02:55 (Wed)
Class Room 117 (Block-1)
Faculty Details
Name Dr. Abha Kiran Rajpoot
Designation Assistant Professor
Web link https://www.sharda.ac.in/faculty/details/abha-kiran-rajpoot
Cabin No Cabin: 05, Room: 302, Block: 3
School Sharda School of Engineering & Technology
Department Computer Science & Engineering
Meeting Hours 10:00AM-12:00PM (Tue)
Intercom No NA
Is this Course offered to more Yes
than one Batch?
If yes, please indicate the Dr. Jabir Ali, Dr. Bharat, Dr. Jerald. Vishal, Dr. Vivek, Dr.
name(s) of other faculty who
Subrata, Dr. Sudeep, Dr. Tarun, Ms. Jyoti
is/are sharing this Course
1
SHARDA UNIVERSITY
COURSE FILE CONTENTS
Sr. No TOPICS Page No
1. Vision and Mission of the University

2. Vision and Mission of the Department
3. Academic calendar of University and School
4. Time Table of the Faculty Member & Class

5. Course syllabus
6. POs, PSOs, PEOs & Cos
7. CO-PO-PSO Mapping
8. Detailed Lecture Plan
9. Teaching Learning Evaluation Scheme

10. List of students (Section Wise)
11. List of Slow and Fast Learners & Action Plan (Attach Proof)
12. Tutorial Sheets & Assignments with Sample Solutions
13. Question Bank
14. List of Topics for Presentation/Seminars/Projects
15. Content Beyond Syllabus
16. Study Material for Content Beyond Syllabus

17. Question Paper for Quizzes, MTE and ETE
18. Sample Evaluated Answer Scripts (Good/Average/Poor category)
19. Award Sheet of CA, MTE, ETE
20. Innovative Teaching/Learning Techniques/NPTEL/MOOC/SWAYAM
21. Extra Lecture/Mini Projects (if any)
22. Attendance Report
23. Sample Lecture Notes
24. File Closure (Final Attainments, Result Analysis, Feedback)
25. Course Exit Survey
Suggestion made by Course Committee/Instructor/Students for Enhancement of
26.
Learning / Modification in Course Contents/Minutes of the Meeting, if any
2
SHARDA UNIVERSITY
1. VISION & MISSION OF THE

OF UNIVERSITY
3
SHARDA UNIVERSITY
4
SHARDA UNIVERSITY
2. VISION & MISSION OF THE

OF DEPARTMENT
5
SHARDA UNIVERSITY
6
SHARDA UNIVERSITY
3. ACADEMIC CALENDAR OF
THE UNIVERSITY AND THE
SCHOOL
7
SHARDA UNIVERSITY
8
SHARDA UNIVERSITY
9
SHARDA UNIVERSITY
10
SHARDA UNIVERSITY
11
SHARDA UNIVERSITY
4. TIME TABLE OF THE

FACULTY MEMBER & CLASS
12
SHARDA UNIVERSITY
13
SHARDA UNIVERSITY
5. Course Syllabus
14
SHARDA UNIVERSITY
Course Syllabus
Syllabus: CSE 252, Computer Networks
School: SET Batch: 2019 onwards
Program: B.Tech Current Academic Year: 2020-2021
Branch:CSE Semester: 4
1 Course Code CSE252 Course Name: B. Tech
2 Course Title Computer Networks
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Status Compulsory
5 Course Provide students with an overview of networking, insight into the issues,
Objective challenges and working at all level of reference models. Also practice on
applying protocols in network design.
6 Course Students will be able to:
Outcomes
CO1:Demonstrate and differentiate working of all layers of the OSI Reference
Model and TCP/IP model.
CO2:Investigate and explore fundamental issues driving network design

including error control.
CO3: Understand and building the skills of IP addressing, subnetting and

15
SHARDA UNIVERSITY
routing protocols.
CO4: Discuss the flow control, elements and protocols of transport layer
CO5: Describe the connection management and application layer protocols.
CO6: Outline the basic knowledge of the use of cryptography and network
security.
7 Course To familiarize with the basic taxonomy and terminology of computer

Description networking area.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Introduction to computer networks, applications and uses, CO1, CO2

classification of Networks based on topologies, geographical
distribution and communication techniques
B Reference models: OSI model, TCP/IP model , Overview of CO1, CO2

Connecting devices (Hub, Repeaters, Switches, Bridges, Routers,
Gateways)
C Transmission Media:wired , wireless, Multiplexing techniques- CO1, CO2

FDM, TDM
Unit 2 Data Link Layer
A Functions, Framing, Error Control-Error correction CO1, CO2

codes(Hamming code),Error Detection codes(Parity Bit, CRC)
B Flow Control- Stop and Wait Protocol, Sliding window –Goback CO1, CO2
N and Selective repeat(ARQ)
C MAC- Sub-layer Protocols: ALOHA, CSMA, CSMA/CD protocols, CO1, CO2

IEEE Standards 802.3, 802.4,802.5
Unit 3 Network Layer
A Design issues , IPV4addressing basics and Header format, CIDR, CO1,CO3

sub-netting and sub-masking
B Routing, optimality Principle Routing protocols-, Shortest path, CO1,CO3

16
SHARDA UNIVERSITY
flooding, distance vector routing , link state routing
C Congestion control-Leaky bucket , Token Bucket, jitter control CO1,CO3,CO4
Unit 4 Transport Layer
A Need of transport layer with its services, Quality of service, CO1,CO4

connection oriented and connection less
B Transmission Control Protocol: Segment structure and header CO1,CO4,CO5

format, TCP Connection Management, Flow Control
C TCP congestion control, Internet Congestion Control Algorithm, CO1,CO4,CO5

Overview of User Datagram Protocol (UDP)
Unit 5 Application Layer
A Domain Name System (DNS), HTTP, FTP, SMTP CO1,CO5
B Network Security services, cryptography, Symmetric versus CO1,CO5,CO6

Asymmetric cryptographic algorithms- DES, and RSA
C Application of Security in Networks: Digital signature CO1,CO5,CO6
Mode of Theory
examination
Weightage CA MTE ETE

Distribution
25% 25% 50%
Text book/s* 1. Tanenbaum, A.S.” Computer Networks”, 4 th

Edition, PHI
Other 1. Forouzan, B.., “Communication Networks”, TMH,
References Latest Edition
2. W. Stallings, “Data and Computer

Communication” Macmillan Press
CO and PO Mapping
S. Course Outcome Program Outcomes (PO) & Program Specific

No. Outcomes (PSO)
1. CO1:Demonstrate and differentiate PO2,PO11,PO12,PSO2
17
SHARDA UNIVERSITY
working of all layers of the OSI Reference
Model and TCP/IP model.
2. CO2:Investigate and explore fundamental PO1,PO3,PO4,PO5,PO11PO12,PSO2

issues driving network design including
error control.
3. CO3: Understand and building the skills of PO1,PO2,PO4,PO6,PSO1,PSO3

IP addressing, subnetting and routing
protocols.
4. CO4: Discuss the flow control, elements PO2,PO3,PSO2,PSO3

and protocols of transport layer
5. CO5: Describe the connection PO1, PO2,PO3, PO4, PSO2

management and application layer
protocols.
6. CO6: Outline the basic knowledge of the PO1, PO2, PO4,PO8 PO11, PSO2
use of cryptography and network
security.
PO and PSO mapping with level of strength for Course Name Computer Networks (Course
Code CSE 252)
Familiarity and practical PSO1
Understand, analyse and PSO2
PSO3
PO10
Project management and PO11
PO12
Engineering knowledge PO1
PO2
PO3
PO4
PO5
The engineer and society PO6
PO7
PO8
PO9
Conduct investigations
Design/development of
Individual and team

Modern tool usage
C
Life-long learning
Environment and
Problem analysis
Communication:
Apply standard
Os
Ethics
CO - -
2 - - - - - - - 2 3 - 3
1
18
SHARDA UNIVERSITY
CO - 2 -
2 - 2 2 3 - - - - 3 3
2
CO - - 2
3 2 - 2 - 2 - - - - 2 -
3
CO - - -
- 2 2 - - - - - - - 2 2
4
CO - - - -
2 2 2 2 - - - - - 2 -
5
CO - -
2 - - 2 - - 2 - - 2 - 2 -
6
Average of non-zeros entry in following table (should be auto calculated).
Cours
e P P P P P P P P P P P PS
Code/ O O O O O PO O O O O O O PS O PS
Name 1 2 3 4 5 6 7 8 9 10 11 12 O1 2 O3
Comp
uter 1.3 1.3 0. 0.3 0.3 0.3 0.6
1.5 1 - - - 1 1 2
Netwo 3 3 5 3 3 3 7
rks
Strength of Correlation:1. Addressed to Slight (Low=1) extent 2. Addressed

to Moderate (Medium=2) extent 3. Addressed to Substantial (High=3) extent
19
SHARDA UNIVERSITY
6. POs, PSOs, PEOs &

COs
20
SHARDA UNIVERSITY
21
SHARDA UNIVERSITY
CO1: Demonstrate and differentiate working of all layers of the OSI Reference Model and TCP/IP model.
CO2: Investigate and explore fundamental issues driving network design including error control.
CO3: Understand and building the skills of IP addressing, subnetting and routing protocols.
CO4: Discuss the flow control, elements, and protocols of transport layer
CO5: Describe the connection management and application layer protocols.
CO6: Outline the basic knowledge of the use of cryptography and network security.
22
SHARDA UNIVERSITY
7. CO-PO-PSO
Mapping
23
SHARDA UNIVERSITY
CO and PO Mapping
PO and PSO mapping with level of strength for Course Name Computer Networks (Course
Code CSE 252)
Familiarity and practical PSO1
Understand, analyse and PSO2
PSO3
PO10
Project management and PO11
PO12
Engineering knowledge PO1
PO2
PO3
PO4
PO5
The engineer and society PO6
PO7
PO8
PO9
Conduct investigations
Design/development of
Individual and team

Modern tool usage
Life-long learning
Environment and
Problem analysis
Communication:
Apply standard
Os
Ethics
CO - -
2 - - - - - - - 2 3 - 3
1
CO - 2 -
2 - 2 2 3 - - - - 3 3
2
CO - - 2
3 2 - 2 - 2 - - - - 2 -
3
CO - - -
- 2 2 - - - - - - - 2 2
4
CO - - - -
2 2 2 2 - - - - - 2 -
5
CO - -
2 - - 2 - - 2 - - 2 - 2 -
6
24
SHARDA UNIVERSITY
Average of non-zeros entry in following table (should be auto calculated).
Cours
e P P P P P P P P P P P PS
Code/ O O O O O PO O O O O O O PS O PS
Name 1 2 3 4 5 6 7 8 9 10 11 12 O1 2 O3
Comp
uter 1.3 1.3 0. 0.3 0.3 0.3 0.6
1.5 1 - - - 1 1 2
Netwo 3 3 5 3 3 3 7
rks
Strength of Correlation:1. Addressed to Slight (Low=1) extent 2. Addressed

to Moderate (Medium=2) extent 3. Addressed to Substantial (High=3) extent
25
SHARDA UNIVERSITY
8. DETAILED
LECTURE PLAN
26
SHARDA UNIVERSITY
Duratio Propo Co
Lec. n(in sed Mo Methodology/ Mappi blooms_l
No minute) Date Points To Covered de Activities ng evel
Fac
e to
2023- Introduction to computer Fac Lecture with
1 55 07-01 networks, applications and uses, e interaction CO1 L1
Fac
e to
2023- classification of Networks based on Fac Lecture with
2 55 07-01 topologies e interaction CO1 L1
Fac
e to
2023- geographical distribution and Fac Lecture with
3 55 07-01 communication techniques e interaction CO1 L1
Fac
e to
2023- Fac Lecture with
4 55 07-01 Reference models: OSI model e interaction CO1 L1
Fac
e to
5 55 07-01 Reference models: TCP/IP model , e interaction CO1 L1
Fac
Overview of Connecting devices e to
2023- (Hub, Repeaters, Switches, Fac Lecture with
6 55 07-01 Bridges, Routers, Gateways) e interaction CO1 L1
Fac
e to
2023- Transmission Media:wired , Fac Lecture with
7 55 07-01 wireless e interaction CO2 L2
Fac
e to
2023- Multiplexing techniques-FDM, Fac Lecture with
8 55 07-01 TDM e interaction CO2 L2
9 55 2023- Functions, Framing, Fac Lecture with CO2 L2
27
SHARDA UNIVERSITY
e to
Fac
07-01 e interaction
Fac
Error Control-Error correction e to
2023- codes(Hamming code) Fac Lecture with
10 55 07-01 e interaction CO2 L2
Fac
e to
2023- Error Detection codes(Parity Bit, Fac Lecture with
11 55 07-01 CRC) e interaction CO2 L2
Fac
Flow Control- Stop and Wait e to
2023- Protocol, Fac Lecture with
Fac
e to
2023- Sliding window –Goback N and Fac Lecture with
13 55 07-01 Selective repeat(ARQ) e interaction CO2 L2
Fac
e to
14 55 07-01 CSMA, e interaction CO3 L2
Fac
e to
15 55 07-01 CSMA/CD protocols, e interaction CO3 L4
Fac
e to
2023- MAC- Sub-layer Protocols: Fac Lecture with
16 55 07-01 ALOHA, e interaction CO3 L4
Fac
e to
17 55 07-01 IEEE Standards 802.3, e interaction CO3 L4
Fac
IEEE Standards 802.4,802.5 e to
Fac
2023- Design issues , IPV4addressing e to Lecture with
19 55 07-01 basics and Header format, Fac interaction CO3 L4
28
SHARDA UNIVERSITY
e
Fac
e to
2023- CIDR, sub-netting and sub- Fac Lecture with
20 55 07-01 masking e interaction CO3 L4
Fac
Routing, optimality Principle e to
2023- Routing protocols-, Fac Lecture with
Fac
Shortest path, e to
Fac
e to
2023- flooding, distance vector Fac Lecture with
23 55 07-01 routing , link state routing e interaction CO3 L4
Fac
e to
2023- Congestion control-Leaky bucket Fac Lecture with
24 55 07-01 , e interaction CO4 L4
Fac
e to
25 55 07-01 Token Bucket, e interaction CO4 L4
Fac
jitter control e to
Fac
e to
2023- Need of transport layer with its Fac Lecture with
27 55 07-01 services, Quality of service, e interaction CO4 L4
Fac
e to
2023- connection oriented and Fac Lecture with
28 55 07-01 connection less e interaction CO4 L4
Fac
Transmission Control Protocol: e to
2023- Segment structure and header Fac Lecture with
29 55 07-01 format, e interaction CO4 L4
30 55 2023- Overview of User Datagram Fac Lecture with CO4 L4
29
SHARDA UNIVERSITY
e to
Fac
07-01 Protocol (UDP) e interaction
Fac
e to
2023- TCP Connection Management, Fac Lecture with
31 55 07-01 Flow Control e interaction CO4 L4
Fac
e to
32 55 07-01 TCP congestion control, e interaction CO5 L5
Fac
e to
2023- Internet Congestion Control Fac Lecture with
33 55 07-01 Algorithm, e interaction CO5 L5
Fac
e to
2023- Overview of User Datagram Fac Lecture with
34 55 07-01 Protocol (UDP) e interaction CO5 L5
Fac
e to
35 55 07-01 HTTP, FTP, SMTP e interaction CO5 L5
Fac
e to
36 55 07-01 Domain Name System (DNS), e interaction CO5 L5
Fac
e to
2023- Network Security services, Fac Lecture with
37 55 07-01 cryptography, e interaction CO5 L5
Fac
e to
38 55 07-01 DES, and RSA e interaction CO6 L6
Fac
e to
2023- Symmetric versus Asymmetric Fac Lecture with
39 55 07-01 cryptographic algorithms- e interaction CO6 L6
Application of Security in Networks:

Fac
2023- Digital signature e to Lecture with
40 55 07-01 Fac interaction CO6 L6
30
SHARDA UNIVERSITY
e
31
SHARDA UNIVERSITY
9. Teaching Learning
Evaluation Plan
32
SHARDA UNIVERSITY
1. Name of the Faculty: Dr. Abha Kiran Rajpoot
2. Subject : Computer Networks Subject Code: CSE252
3. Section :B
Course Evaluation Plan
Continuous
S.No. Assessment Mid-Term Examination End-Term Examination
1 Attendance Mandatory Mandatory 75%
Assignment/
MOOC/NPTEL
05 -- --
Courses/ Swayam
2 Courses
3 Quizzes 10 -- --
4 Projects -- -- --
Case Study/ Field

10 -- --
5 Study/Presentations
6 Exam -- Yes Yes
7 Total Marks 25 25 50
33
SHARDA UNIVERSITY
10. List of students

(Section Wise)
34
SHARDA UNIVERSITY
1. Name of the Faculty: Dr. Abha Kiran Rajpoot
2. Subject : Computer Networks

Subject Code : CSE252
3. Section :B
ID Roll No. Name Section Group

Bommireddipalli Tejaswi
2021322848 210101148 CS-B G1
Bharadwaj
2021478383 210101178 Divyanshi Kalkhundiya CS-B G1
2021001501 210101187 Farman Naim CS-B G1
2021391221 210101198 Girish Kumar CS-B G1
2021374318 210101200 Harsh Chauhan CS-B G1
2021002447 210101217 Himanshu Jha CS-B G1
2021333431 210101218 Hridey Dalal CS-B G1
2021333188 210101235 Kanika Naugain CS-B G1
2021001271 210101250 Km Jyoti Harbola CS-B G1
2021000523 210101257 Krishna Singh CS-B G1
2021001021 210101300 Mohit Saraswat CS-B G1
2021821464 210101308 Mintu Kumar Sah Kalwar CS-B G1
2021459955 210101340 Nishant Kumar CS-B G1
2021307833 210101341 Nishita Singhal CS-B G1
2021474871 210101354 Pawan Kumar Gupta CS-B G1
2021381168 210101361 Pranav Mishra CS-B G1
2021003113 210101363 Pranjal Tripathi CS-B G1
2021381047 210101374 Priyanshu Ray CS-B G1
2021451903 210101383 Rajat Kaushik CS-B G1
2021448136 210101409 Roshan Kumar CS-B G1
2021808383 210101410 Roshish Dahal CS-B G1
2021370663 210101428 Sanjeev Shankar CS-B G1
2021003580 210101464 Shivashish Nimesh CS-B G1
2021001936 210101470 Shraddha Sharma CS-B G1
2021414419 210101487 Shubham Sharma CS-B G1
2021520736 210101497 Siddhinath Sahu CS-B G1
2021397815 210101504 Soshal Yadav CS-B G1
2021374326 210101515 Sukham Kaur CS-B G1
2021528457 210101517 Sundaram Kumar CS-B G1
2021380252 210101528 Tarun Gosain CS-B G1
2021430477 Zaid Ahmad CS-B G1
2021333976 210101533 Tripti . CS-B G2
35
SHARDA UNIVERSITY
2021478331 210101536 Ujjawal Prakhar CS-B G2
2021002060 210101550 Vidit Biswas CS-B G2
2021446986 210101562 Vishnu Sharma CS-B G2
2021405876 210101564 Yajas Arora CS-B G2
2021338973 210101568 Yashank Singh CS-B G2
2021507825 210101588 Kushagra Singh CS-B G2
2021530174 210101589 Ankesh Kumar CS-B G2
2021530612 210101590 Ashwani Agrawal CS-B G2
2021828544 210101592 Samadesh Poudel CS-B G2
2021003153 210101006 Aarif . CS-B G2
2021463428 210101017 Abhinandan Raj CS-B G2
2021003154 210101022 Abhinav Verma CS-B G2
2021404482 210101023 Abhishek . CS-B G2
2021826004 210101027 Abhishek Kandel CS-B G2
2021492318 210101038 Aditya Dwivedi CS-B G2
2021003178 210101041 Aditya Ojha CS-B G2
2021000446 210101042 Aditya Raj Lodhi CS-B G2
2021511796 210101082 Ankit Kumar CS-B G2
2021332786 210101095 Anuj Kumar Sony CS-B G2
2021003685 210101106 Aqib Khan CS-B G2
2021000444 210101160 Deepak Yadav CS-B G2
2021303194 210101164 Dev Singh CS-B G2
2021000823 210101194 Gaurav Kumar Singh CS-B G2
2021003482 210101204 Harsh Kumar Singh CS-B G2
2021002166 210101207 Harsh Shukla CS-B G2
2021428759 210101225 Janvi Sharma CS-B G2
2021818639 210101242 Keshav Raj Thakur CS-B G2
2021430498 Gufran Ali Siddique CS-B G2
2021479329 210101129 Astha Sah CS-B G2
36
SHARDA UNIVERSITY
11. List of Slow and Fast

Learners &
Action Plan (Attach Proof)
37
SHARDA UNIVERSITY
ACTION PLAN FOR WEAK STUDENTS
Understanding the Level of learning pace of each individual student in a class is essential for a
teacher to implement differentiated approach of teaching for better learning outcomes from the
students. Thus a teacher is to divide a class of students into three categories; slow learners, average
learners and fast learners. Appropriate performance metrics of students shall be used to categorize
students correctly. A faculty member shall take extra care for slow learners to improve their
performance and he/she also devise extra materials/assignment for fast Learners to enhance their
depth of knowledge in the course. This document presents the process of outlines the extra
measurements for slow learner.
Extra Measures for Weak Students

1. Extra classes to give more coaching
2. Extra notes to build solid back ground of course
3. Extra counseling to motivate students and guide students for better preparation
4. Extra peer tutoring to explain topics
5. Extra assignment to enhance basic knowledge
6. Extra tests to evaluate improvement
7. Others
8. Special Assignment-1
Read the ideal/best solution of MTE and rewrite the solution for questions asked in
CAT-1 in a neat and clean manner.
Read the ideal/best solution of MTE and rewrite the solution for questions asked in
MTE in a neat and clean manner.
Read Assignment-1, Assignment-2 and assignmen-3 which have been graded as A++.
38
SHARDA UNIVERSITY
Activity Sheet for Slow Learner

B.Tech-6th Sem.
Activity 1:
Three assignments were given to the students.
Activity 2:
Flip classes: Classes have been conducted by the fast learner to the slow learner once
in a month.
Activity 3:
Extra classes were taken.
Activity 4: Motivated all students for peer learning to improve logic building and
problem solving.
39
SHARDA UNIVERSITY
12. TUTORIAL SHEETS &

ASSIGNMENTS WITH
SAMPLE SOLUTIONS
40
SHARDA UNIVERSITY
ASSIGNMENT NO.- 1
Q1 What is the difference between Linear Block Codes and Cyclic Codes. Explain
with the help of examples.
Q 2 A sender has two data items to send: Ox4567 and OxBA98. What is the value of
the checksum?
Q 3 An 8-bit byte with binary value 10101111 is to be encoded using an even-parity

Hamming code. What is the binary value after encoding?
Q 4 Compare and contrast the Go-Back-N ARQ Protocol with Selective-Repeat ARQ.
Q 5 Define piggybacking and its usefulness.
Q 6 Using 5-bit sequence numbers, what is the maximum size of the send and receive
windows for each of the following protocols?
a. Stop-and-Wait ARQ
b. Go-Back-N ARQ
c. Selective-Repeat ARQ
Q 7 In a CDMAlCD network with a data rate of 10 Mbps, the maximum distance

between any station pair is found to be 2500 m for the correct operation of the
collision detection process. What should be the maximum distance if we increase the
data rate to 100 Mbps? To 1 Gbps? To 10 Gbps?
Q 8 Explain why collision is an issue in a random access protocol but not in controlled
access or channelizing protocols.
41
SHARDA UNIVERSITY
ASSIGNMENT NO.- 2
Q1 What are the basic set of differences between IPv4 and IPv6.
Q2 In a block of addresses, we know the IP address of one host is 25.34.12.56/16.

What are the first address (network address) and the last address and the number of
addresses in this block?
Q3 Explain the concept of connection management i.e. how a connection is

established and released at the transport layer?
Q4 Give an overview of DNS? Why it if required?
Q5 What do you mean by FTP? Explain the transfer modes.
Q6 The value of HLEN in an IPv4 datagram is 7. How many option bytes are present?
Q7 Are both UDP and IP unreliable to the same degree? Why or why not?
Q8 Why there is need of UDP if it is a connectionless non reliable protocol?
Q9 What is WWW ? Explain in short.
42
SHARDA UNIVERSITY
Tutorial Sheet
No Tutorial for this Subject
43
SHARDA UNIVERSITY
13. Question Bank
44
SHARDA UNIVERSITY
1. An analog signal has a bandwidth of 40 KHz. If we sample this signal and send it through a 50Kbps channel.
What is the SNR?
2. Assume five devices are arranges in a mesh topology. How many cables are needed? How many ports are
needed for each device?
3. Compare a PICONET and a SCATTERNET.
4. Compare and contrast a random access protocol with a channelizing protocol.
5. Compare and contrast Flow Control and Error Control.
6. Compare Checksum and CRC.
7. Compare NRZ-I, Manchester and Differential Manchester with the help of an example. Discuss merits and
demerits of these techniques.
8. Compare Stop-and-Wait ARQ protocol to the Go-Back-N ARQ Protocol.
9. Compare TCP/IP model with ISO/OSI Model of computer networks.
10. Compare the layers of OSI Model and TCP/IP Model. Explain the responsibility of each layer.
11. Compare UDP and TCP.
12. Define piggybacking and its usefulness.
13. Describe IPv4 packet and explain its various fields.
14. Describe the count-to-infinity problem.
15. Describe the following terms that are used in the Domain Name System.
16. Describe the three HDLC station type.
17. Difference between access protocol and channelizing protocol?
18. Difference between Bandwidth and Throughput.
19. Difference between CSMA, CSMA/CD and CSMA/CA.
20. Difference between Distance Vector routing and Link State routing algorithms.
21. Difference between fixed size framing and variable size framing.
22. Difference between Flow Control and Error Control.
23. Difference between guided and unguided media with the help of an example.
24. Difference between IPv4 and IPv6.
25. Difference between Leaky Bucket and Token bucket algorithms.
26. Difference between MTA and MAA server in Email Architecture?
27. Difference between Open-Loop and Closed-Loop congestion control.
28. Difference between Parabolic Antenna and Horn Antenna?
29. Difference between Private and Public key algorithm.
30. Difference between UDP and TCP protocol.
31. Differentiate between classful addressing and classless addressing. Give examples?
32. Differentiate between periodic signals and Non periodic signals.
33. Differentiate between Static Routing and Dynamic Routing algorithm with examples?
34. Discuss the use of Access Point in BSS and ESS.
35. Distinguish between data rate and signal rate.
45
SHARDA UNIVERSITY
36. Distinguish between FSK, PSK and ASK? Discuss Pulse code modulation.
37. Double errors can easily be trapped in the CRC method. Explain.
38. Draw a hybrid topology with a start backbone and four rings networks.
39. Explain the architecture of Bluetooth. Compare a PICONET and a
40. Explain HDLC configuration and transfer modes.
41. Explain Ipv4. What are the different fields in the protocols? Explain its use for Network Layer.
42. Explain IPv6 Extension Header.
43. Explain IPv6 Extension Header. What are the various techniques for transition from IPv4 to IPv6?
44. Explain Leaky Bucket Algorithm and Token Leaky Bucket Algorithm with the help of an example.
45. Explain Mobile Telephone System.
46. Explain Pulse Code Modulation.
47. Explain state transition diagram of TCP.
48. Explain the architecture of Optical Fiber? What are the different types of propagation modes in optical fiber?
49. Explain the concept of Bit Stuffing in HDLC.
50. Explain the difference between encoding and modulation.
51. Explain the difference between node-to-node delivery and source-to-destination delivery?
52. Explain the different architecture of E-Mail.
53. Explain the header of IPv4.
54. Explain the header of IPv6.
55. Explain the layers of Internet model which are the network support layers.
56. Explain the reason for moving from the Stop-and-Wait ARQ protocol to the Go-Back-N ARQ Protocol.
57. Explain the various methods of resolution in DNS.
58. Explain the working of Hamming Code?
59. Find out the capacity of a telephone line that transmits frequencies from 300Hz with a signal to noise ratio of
35dB.
60. Generate a Hamming Coded Message for the Data frame 11001.How this Hamming Code will help in Error
Detection & Correction? Briefly explain.
61. Give the names of various layers in OSI model. State the role of network layer in it.
62. Give the NRZ-I, Manchester, Differential Manchester, and Bipolar encoding of the digital data:
1101100101.What are the different factors to measure the performance of a network?
63. Given a 10 bit sequence 11011011100 and a divisor is 1101, find the CRC.
64. How does recursive resolution differ from iterative resolution?
65. How does Signal to Noise ratio affect channel capacity? Explain with the help of Shannon capacity formula.
66. How does streaming live audio/video differ from streaming stored audio/video?
67. How E-Mail works?
68. How HDLC performs framing? What are the different types of frames supported by HDLC? What are the
different fields in frames?
69. How Huffman coding works? Explain with the help of an example.
70. How is CRC superior to checksum?
71. How is HTTP similar to SMTP?
72. How is the preamble field different from the SFD field?
73. How is the simple parity check related to the two-dimensional parity check? Explain with the help of an
example.
46
SHARDA UNIVERSITY
47
SHARDA UNIVERSITY
14. List of Topics for

Presentation/ Project
48
SHARDA UNIVERSITY
1. Benefits of artificial intelligence for networking systems
2. Cybercrime and computer networks: opportunities and threats
3. Networking systems: advantages and disadvantages
4. Developments in networking for the last 5 years: key issues
5. Classification of networking software vendors
6. Perspectives of the Open Systems Interconnection networking model
7. Most perspective Wireless Communication Technologies
8. Machine learning algorithms for network data analysis
9. Network security methods
10. Tools for network simulation
11. What are sensor networks?
12. What includes social networking?
13. Blade servers: strengths and weaknesses
14. How does the brain-computer interface work?
15. Secured networks and capturing packets
49
SHARDA UNIVERSITY
16. Bankruptcy prediction: computational methods and their perspective
17. Private networks: types and functionality
18. Types of smart sensor networks
19. Integrated circuits: how to apply the embryonic approach
Networking technologies for industrial automation
50
SHARDA UNIVERSITY
15. CONTENT
BEYOND SYLLABUS
51
SHARDA UNIVERSITY
CCNA course will help you to improve yourself about networking basics, switching & routing
technologies, IPv4 and IPv6. If you are a beginner for networking technologies, our CCNA
certification program is great for you! You will get the certification easily with this CCNA course
and begin your career in networking industry.
Networkel’s CCNA course , which is prepared by a Cisco Networking Academy Instructor , covers
ALL topics that you need to prepare for the 200-301 (New CCNA) certification exam. You can see
the full list of the topics at the curriculum. Six main sections of the training are :
 Network Fundamentals
 Routing And Switching Essentials
 Scaling Networks
 Connecting Networks
 Security Fundamentals
 Network Automation and Programmability
WHAT ARE THE REQUIREMENTS FOR CCNA COURSE ?

You don’t need to know anything about networking, Networkel’s training will teach you every topic
from zero. For lab sections, you need to install Packet Tracer or GNS3 to your computer.
WHAT I WILL GET FROM THIS COURSE ?

You will learn about networking basics , IPv4, IPv6, switching and routing and that means you will
be ready for certification exam ! CCNA certification is an excellent step to start a career in
networking industry.
WHO IS THE TARGET GROUP ?

 Everybody who wants to prepare for CCNA 200-301 (New CCNA) exam
 Anyone who needs to build a cereer in networking industry
 Students that currently in college or university
Who this course is for:

Everybody who wants to prepare for CCNA 200-301 (New CCNA) exam
52
SHARDA UNIVERSITY
Anyone who needs to build a cereer in networking industry
Students that currently in college or university
53
SHARDA UNIVERSITY
54
SHARDA UNIVERSITY
16. Study Material for Content

Beyond Syllabus
55
SHARDA UNIVERSITY
56
SHARDA UNIVERSITY
17. Question Paper for

Quizzes, MTE and
ETE
57
SHARDA UNIVERSITY
58
SHARDA UNIVERSITY
59
SHARDA UNIVERSITY
60
SHARDA UNIVERSITY
18. Sample Evaluated Answer

Scripts (Good/Average/Poor
category)
Awardsheet: Theory
School of Engineering and Technology

Department: Compputer Science and Engineering
Program: B.Tech Branch: CSE
Term: 2002 Class No. : CSE252-CSB1 (2425)
Status- Regular
Subject Code: CSE252 Name of Subject: Computer Networks

MTE CA ETE
S. No. Name Student ID Roll Number
20 30 100
1 Chandan Sahu 2019005880 190101095 27 19 89
2 Chukka Ravi Teja 2019648956 190101098 22 17 79
3 D L Kavya Reddy 2019573564 190101099 28 18 78
4 Daksh Nauni 2019635734 190101100 17 19 85
5 Dendukuri Sanjay Raju 2019008447 190101102 15 17 70
6 Divakar Kumar 2019635384 190101104 25 17 76
7 Durgam Radha Sayi Soumya 2019533226 190101106 24 18 74
8 Faraz Ali Khan 2019006479 190101110 23 17 67
9 Frankly Chauhan 2019527810 190101111 27 17 92
10 Gaddam Prathik Kumar 2019004968 190101112 27 19 92
11 Garvit Ghai 2019592974 190101114 18 19 83
12 Gautam Suri 2019628143 190101116 19 19 84
13 Gautami Singh 2019007261 190101117 24 19 88
14 Giral Faurel Ondzongo 2019003027 190101118 20 19 78
15 Govind Sharma 2019008012 190101119 24 17 85
61
SHARDA UNIVERSITY
16 Gunpreet Singh Walia 2019539411 190101120 15 19 81
17 Gyanesh . 2019530784 190101121 23 18 77
18 Harsh Kumar 2019536469 190101123 20 17 73
19 Harshit Mahajan 2019008443 190101127 27 18 84
20 Harshit Suri 2019508105 190101129 22 19 84
21 Huzaif Mushtaq Naikoo 2019005737 190101135 15 17 74
22 Jai Sanger 2019628545 190101138 22 18 80
23 Jatin Kumar 2019007440 190101139 22 16 76
24 Kanishka Negi 2019600654 190101142 28 19 86
25 Kartik Kumar Chauhan 2019002004 190101143 22 20 81
62
SHARDA UNIVERSITY
19. Award Sheet of CA,

MTE, ETE

Department: Compputer Science and Engineering
Term: 2002 Class No. : CSE252-CSB1 (2426)
Status- Regular
Subject Code: CSE252 Name of Subject: Computer Networks

S. Roll MTE CA ETE
Name Student ID
No. Number 20 30 100
1 Kartik Tripathi 2019554678 190101144 24 18 86
2 Krishna K.C 2019001516 190101151 28 19 85
3 Krishna Kumar Sah 2019000816 190101152 3 16 67
4 Kriti Singh 2019606216 190101153 26 19 90
5 Kumar Kanishk Pandey 2019001923 190101154 23 18 83
6 Kunal Bhardwaj 2019622715 190101156 23 19 87
7 Lakhan Kumar 2019002744 190101158 23 18 82
8 Lalit Rajput 2019610448 190101159 22 15 84
9 Laxman Kohar Verma 2019003701 190101160 27 15 76
10 Mahrush Fatima 2019570606 190101161 23 14 72
11 Maitri Shree 2019003755 190101162 28 18 85
12 Manish . 2019002296 190101165 28 17 86
13 Manish Rai 2019003752 190101166 27 18 83
14 Manuraj Tomar 2019552246 190101167 27 17 79
15 Mayuri Kumari 2019579058 190101169 25 16 75
16 Md Raja . 2019004970 190101171 1 14 44
17 Md Shadik 2019007473 190101172 28 19 85
63
SHARDA UNIVERSITY
18 Md Zunad Alam 2019001796 190101173 23 16 72
19 Md. Masoom Anwar 2019003930 190101174 25 18 69
20 Merajul Aarfeen 2019548741 190101177 15 19 68
21 Mohd. Anas 2019007621 190101184 25 18 87
22 Mousam Panthi 2019002292 190101186 27 19 82
23 Muqtada Hasan 2019003489 190101188 27 19 87
24 Nalin Kashyap 2019005417 190101191 28 17 78
25 Nikita Sinha 2019610336 190101195 28 19 85
26 Nitesh Kumar Singh 2019003147 190101198 26 17 80
27 Nitesh Mishra 2019006598 190101199 25 18 81
28 Nitin Thakur 2019004840 190101200 22 17 80
64
SHARDA UNIVERSITY

Department: Computer Science and Engineering
Term: 2002 Class No. : CMP CSP252 - CSB1 (2496)
Status- Regular
Subject Code: CSP252 Name of Subject: Computer Networks Lab.

CA ETE
S. No. Name Student ID Roll Number
60 40
1 Chandan Sahu 2019005880 190101095 32 28
2 Chukka Ravi Teja 2019648956 190101098 33 28
3 D L Kavya Reddy 2019573564 190101099 32 28
4 Daksh Nauni 2019635734 190101100 30 27
5 Dendukuri Sanjay Raju 2019008447 190101102 33 28
6 Divakar Kumar 2019635384 190101104 36 30
7 Durgam Radha Sayi Soumya 2019533226 190101106 36 30
8 Faraz Ali Khan 2019006479 190101110 35 29
9 Frankly Chauhan 2019527810 190101111 51 36
10 Gaddam Prathik Kumar 2019004968 190101112 52 36
11 Garvit Ghai 2019592974 190101114 38 30
12 Gautam Suri 2019628143 190101116 39 31
13 Gautami Singh 2019007261 190101117 39 31
14 Giral Faurel Ondzongo 2019003027 190101118 42 32
15 Govind Sharma 2019008012 190101119 45 33
16 Gunpreet Singh Walia 2019539411 190101120 45 33
17 Gyanesh . 2019530784 190101121 49 35
18 Harsh Kumar 2019536469 190101123 47 34
19 Harshit Mahajan 2019008443 190101127 48 34
20 Harshit Suri 2019508105 190101129 43 32
21 Huzaif Mushtaq Naikoo 2019005737 190101135 42 32
22 Jai Sanger 2019628545 190101138 45 33
23 Jatin Kumar 2019007440 190101139 48 34
24 Kanishka Negi 2019600654 190101142 45 33
25 Kartik Kumar Chauhan 2019002004 190101143 47 34
65
SHARDA UNIVERSITY

Department: Computer Science and Engineering
Term: 2002 Class No. : CMP CSP252 - CSB1 (2497)
Status- Regular
Subject Code: CSP252 Name of Subject: Computer Networks Lab.

Roll
S. No. Name Student ID CA ETE
Number
1. Kartik Tripathi 2019554678 190101144 48 34
2. Krishna K.C 2019001516 190101151 55 37
3. Krishna Kumar Sah 2019000816 190101152 51 36
4. Kriti Singh 2019606216 190101153 48 34
5. Kumar Kanishk Pandey 2019001923 190101154 48 34
6. Kunal Bhardwaj 2019622715 190101156 47 34
7. Lakhan Kumar 2019002744 190101158 54 37
8. Lalit Rajput 2019610448 190101159 53 36
9. Laxman Kohar Verma 2019003701 190101160 52 36
10. Mahrush Fatima 2019570606 190101161 51 36
11. Maitri Shree 2019003755 190101162 52 36
12. Manish . 2019002296 190101165 53 36
13. Manish Rai 2019003752 190101166 45 33
14. Manuraj Tomar 2019552246 190101167 42 32
15. Mayuri Kumari 2019579058 190101169 36 30
16. Md Raja . 2019004970 190101171 31 0
17. Md Shadik 2019007473 190101172 30 35
18. Md Zunad Alam 2019001796 190101173 30 28
19. Md. Masoom Anwar 2019003930 190101174 32 28
20. Merajul Aarfeen 2019548741 190101177 36 26
21. Mohd. Anas 2019007621 190101184 36 34
22. Mousam Panthi 2019002292 190101186 31 24
23. Muqtada Hasan 2019003489 190101188 54 33
24. Nalin Kashyap 2019005417 190101191 51 32
25. Nikita Sinha 2019610336 190101195 34 35
26. Nitesh Kumar Singh 2019003147 190101198 33 30
27. Nitesh Mishra 2019006598 190101199 36 32
28. Nitin Thakur 2019004840 190101200 32 30
66
SHARDA UNIVERSITY
20. Innovative Teaching/Learning

Techniques/NPTEL/MOOC/SWAYAM
67
SHARDA UNIVERSITY
Innovative Teaching Methods followed in the class:
1. Technology
Technology in education is a vast topic with a lot of possibilities and opportunities. It is the
education technology that has made it possible for teachers to make classes more fun and
interesting. We know that things are better done than said. Suppose I say that triangle is a figure
with three sides, for someone who doesn’t know what a triangle is, they will only get a vague idea.
At the same time, when I draw it on the board, the understanding is better. With technology, this
triangle can be animated, its 3D figure,i.e., the pyramid can be shown and the understanding will
certainly be better. With the use of technology in education such as online teaching tools,
animations, etc, teachers can make their classes interactive and make sure that students stay
engaged. It helps students to understand the concepts better. The different types of educational
technology have made this possible. These types of innovative teaching methods are required to
make classes lively.
2. Puzzles and games

The importance of innovative teaching goes beyond words. As mentioned, one of the major issues
that teachers face is low engagement from students. Lack of attention and lack of interest brings
down the efficiency in learning. Game-based learning is one of the different teaching methods that
teachers use to cultivate interest among the students. As the name suggests, it is a teaching method
that involves games to teach a particular concept or lesson. With the advancement in technology
and the numerous online teaching tools available, it is easy to gamify the classroom and lessons.
You can include quizzes, buzzer games, and more to ensure that learning is effective. We have
discussed in detail mobile applications that are useful for teachers,
3. Interactive sessions
The biggest mistake a teacher can make is not making their classes interactive. Some teachers find
it difficult to interact while taking classes. If you feel that your focus is getting distracted, you can
keep aside a different day just for interaction. You can incorporate some interactive activities. You
can use brainstorming sessions, group discussions, debates, peer evaluations, or other activities for
students to increase the interaction in your classroom. As a teacher, you have to understand the
pulse of your students and how they respond to different scenarios and situations. Only then, you
can alter your teaching strategies accordingly to cater to each individual student in your classroom.
4. Creative pedagogy
Creative pedagogy is nothing but using creative methods to teach. There are five different
approaches to creative pedagogy and they are:
68
SHARDA UNIVERSITY
Constructivist pedagogy in teaching is when students construct their understanding of the lesson
based on previous knowledge and wisdom along with the teachings that they get from their
teacher.
Collaborative pedagogy stresses the notion that students will better engage with writing, critical
thinking, and understanding the concepts if they engage and collaborate with others.
Integrative pedagogy is where the theoretical knowledge, practical skills, and self-regulation of
the students come together and are merged.
Inquiry-Based Learning urges students to ask questions, inquire, research, and learn by

themselves while the teachers guide them, direct them, and give the necessary push and guidelines
whenever it is necessary.
5. Storytelling
Stories have a way of penetrating the students’ minds and staying with them for longer durations.
No matter what grade you teach, incorporating the storytelling method into teaching will show a
marked increase in understanding the concepts better. They will be able to connect with the
lessons and relate to it. A complex mathematics problem can be made easy if you build a story
around it and as discussed, you can make use of technology and various online teaching tools to
animate and visualize your lessons.
69
SHARDA UNIVERSITY
21. Extra Lecture/Mini Projects (if any)
NIL
70
SHARDA UNIVERSITY
22. Attendance Report
71
SHARDA UNIVERSITY
23. SAMPLE LECTURE

NOTES
72
SHARDA UNIVERSITY
24. File Closure (Final

Attainments, Result Analysis,
Feedback)
73
SHARDA UNIVERSITY
74
SHARDA UNIVERSITY
25. Course Exit

Survey
Admissio Student Name Roll CO1 CO2 CO3 CO4 CO5 CO6
n No No
2019005 Chandan Sahu 19010 5- 5- 4-Very 3-Good 4-Very 5-
880 1095 Excellen Excelle Good Good Excellen
t nt t
2019648 Chukka Ravi Teja 19010 4-Very 3-Good 4-Very 5- 5- 5-
956 1098 Good Good Excellen Excellen Excellen
t t t
2019573 D L Kavya Reddy 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019635 Daksh Nauni 19010 4-Very 3-Good 4-Very 5- 5- 4-Very
734 1100 Good Good Excellen Excellen Good
75
SHARDA UNIVERSITY
n No No
t t
2019008 Dendukuri Sanjay 19010 5- 5- 4-Very 3-Good 4-Very 5-
447 Raju 1102 Excellen Excelle Good Good Excellen
t nt t
2019635 Divakar Kumar 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019533 Durgam Radha 19010 5- 5- 4-Very 3-Good 4-Very 5-
226 Sayi Soumya 1106 Excellen Excelle Good Good Excellen
t nt t
2019006 Faraz Ali Khan 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019527 Frankly Chauhan 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019004 Gaddam Prathik 19010 4-Very 3-Good 4-Very 4-Very 5- 3-Good
968 Kumar 1112 Good Good Good Excellen
t
2019592 Garvit Ghai 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019628 Gautam Suri 19010 4-Very 3-Good 3-Good 5- 5- 5-
143 1116 Good Excellen Excellen Excellen
t t t
2019007 Gautami Singh 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019003 Giral Faurel 19010 4-Very 3-Good 4-Very 5- 5- 5-
027 Ondzongo 1118 Good Good Excellen Excellen Excellen
t t t
2019008 Govind Sharma 19010 5- 5- 4-Very 3-Good 4-Very 2-
012 1119 Excellen Excelle Good Good Average
t nt
2019539 Gunpreet Singh 19010 4-Very 3-Good 4-Very 5- 5- 5-
411 Walia 1120 Good Good Excellen Excellen Excellen
t t t
2019530 Gyanesh . 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019536 Harsh Kumar 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019008 Harshit Mahajan 19010 5- 5- 4-Very 3-Good 4-Very 5-
76
SHARDA UNIVERSITY
n No No
t nt t
2019508 Harshit Suri 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019005 Huzaif Mushtaq 19010 5- 5- 4-Very 3-Good 4-Very 5-
737 Naikoo 1135 Excellen Excelle Good Good Excellen
t nt t
2019628 Jai Sanger 19010 4-Very 3-Good 4-Very 5- 5- 4-Very
545 1138 Good Good Excellen Excellen Good
t t
2019007 Jatin Kumar 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019600 Kanishka Negi 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019002 Kartik Kumar 19010 5- 5- 4-Very 3-Good 4-Very 5-
004 Chauhan 1143 Excellen Excelle Good Good Excellen
t nt t
2019554 Kartik Tripathi 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019001 Krishna K.C 19010 5- 5- 4-Very 3-Good 4-Very 4-Very
516 1151 Excellen Excelle Good Good Good
t nt
2019000 Krishna Kumar 19010 4-Very 3-Good 4-Very 5- 5- 5-
816 Sah 1152 Good Good Excellen Excellen Excellen
t t t
2019606 Kriti Singh 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019001 Kumar Kanishk 19010 4-Very 3-Good 4-Very 5- 5- 3-Good
923 Pandey 1154 Good Good Excellen Excellen
t t
2019622 Kunal Bhardwaj 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019002 Lakhan Kumar 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019610 Lalit Rajput 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019003 Laxman Kohar 19010 4-Very 3-Good 4-Very 5- 5- 5-
701 Verma 1160 Good Good Excellen Excellen Excellen
77
SHARDA UNIVERSITY
n No No
t t t
2019570 Mahrush Fatima 19010 5- 5- 4-Very 3-Good 4-Very 3-Good
606 1161 Excellen Excelle Good Good
t nt
2019003 Maitri Shree 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019002 Manish . 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019003 Manish Rai 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019552 Manuraj Tomar 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019579 Mayuri kumari 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019004 Md Raja . 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019007 Md Shadik 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019001 Md Zunad Alam 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019003 Md. Masoom 19010 4-Very 3-Good 4-Very 5- 5- 2-
930 Anwar 1174 Good Good Excellen Excellen Average
t t
2019548 Merajul Aarfeen 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019007 Mohd. Anas 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019002 Mousam Panthi 19010 5- 5- 4-Very 3-Good 4-Very 5-
t nt t
2019003 Muqtada Hasan 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019005 Nalin Kashyap 19010 5- 5- 4-Very 3-Good 4-Very 5-
78
SHARDA UNIVERSITY
n No No
t nt t
2019610 Nikita Sinha 19010 4-Very 3-Good 4-Very 5- 5- 3-Good
336 1195 Good Good Excellen Excellen
t t
2019003 Nitesh Kumar 19010 5- 5- 4-Very 3-Good 4-Very 5-
147 Singh 1198 Excellen Excelle Good Good Excellen
t nt t
2019006 Nitesh Mishra 19010 4-Very 3-Good 4-Very 5- 5- 5-
t t t
2019004 Nitin Thakur 19010 5- 5- 4-Very 3-Good 4-Very 3-Good
840 1200 Excellen Excelle Good Good
t nt
79
SHARDA UNIVERSITY
26. Suggestion made by Course

Committee/Instructor/Students for
Enhancement of Learning /
Modification in Course
Contents/Minutes of the Meeting, if any
80

Cse252 2202

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cse252 2202

Uploaded by

Copyright:

Available Formats

SHARDA UNIVERSITY

Greater Noida, Uttar Pradesh, India

COURSE NAME: COMPUTER NETWORKS

1. Vision and Mission of the University

4. Time Table of the Faculty Member & Class

9. Teaching Learning Evaluation Scheme

15. Content Beyond Syllabus

16. Study Material for Content Beyond Syllabus

1. VISION & MISSION OF THE

2. VISION & MISSION OF THE

4. TIME TABLE OF THE

Syllabus: CSE 252, Computer Networks

School: SET Batch: 2019 onwards

Program: B.Tech Current Academic Year: 2020-2021

1 Course Code CSE252 Course Name: B. Tech

2 Course Title Computer Networks

Course Status Compulsory

CO2:Investigate and explore fundamental issues driving network design

CO3: Understand and building the skills of IP addressing, subnetting and

CO5: Describe the connection management and application layer protocols.

7 Course To familiarize with the basic taxonomy and terminology of computer

8 Outline syllabus CO Mapping

A Introduction to computer networks, applications and uses, CO1, CO2

B Reference models: OSI model, TCP/IP model , Overview of CO1, CO2

C Transmission Media:wired , wireless, Multiplexing techniques- CO1, CO2

Unit 2 Data Link Layer

A Functions, Framing, Error Control-Error correction CO1, CO2

C MAC- Sub-layer Protocols: ALOHA, CSMA, CSMA/CD protocols, CO1, CO2

Unit 3 Network Layer

A Design issues , IPV4addressing basics and Header format, CIDR, CO1,CO3

B Routing, optimality Principle Routing protocols-, Shortest path, CO1,CO3

C Congestion control-Leaky bucket , Token Bucket, jitter control CO1,CO3,CO4

Unit 4 Transport Layer

A Need of transport layer with its services, Quality of service, CO1,CO4

B Transmission Control Protocol: Segment structure and header CO1,CO4,CO5

C TCP congestion control, Internet Congestion Control Algorithm, CO1,CO4,CO5

Unit 5 Application Layer

A Domain Name System (DNS), HTTP, FTP, SMTP CO1,CO5

B Network Security services, cryptography, Symmetric versus CO1,CO5,CO6

C Application of Security in Networks: Digital signature CO1,CO5,CO6

Weightage CA MTE ETE

Text book/s* 1. Tanenbaum, A.S.” Computer Networks”, 4 th

2. W. Stallings, “Data and Computer

S. Course Outcome Program Outcomes (PO) & Program Specific

1. CO1:Demonstrate and differentiate PO2,PO11,PO12,PSO2

2. CO2:Investigate and explore fundamental PO1,PO3,PO4,PO5,PO11PO12,PSO2

3. CO3: Understand and building the skills of PO1,PO2,PO4,PO6,PSO1,PSO3

4. CO4: Discuss the flow control, elements PO2,PO3,PSO2,PSO3

5. CO5: Describe the connection PO1, PO2,PO3, PO4, PSO2

Familiarity and practical PSO1

Understand, analyse and PSO2

Project management and PO11

The engineer and society PO6

Individual and team

Average of non-zeros entry in following table (should be auto calculated).

Strength of Correlation:1. Addressed to Slight (Low=1) extent 2. Addressed

6. POs, PSOs, PEOs &

CO5: Describe the connection management and application layer protocols.

Familiarity and practical PSO1

Understand, analyse and PSO2

Project management and PO11

The engineer and society PO6

Individual and team