SHARDA UNIVERSITY

Greater Noida, Uttar Pradesh, India

SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Course Description

CSE 252 COURSE NAME: COMPUTER NETWORKS

L T P C: 3003
Course Type: University Core
Semester Offered: Even Term
Academic Year: 2021-22

Timing 10:35-11:25(Mon), 09:40-10:30 (Wed), 10:35-11:25 (Thurs)

Class Room 106 Block I,

Faculty Details
Name Abha Kiran Rajpoot
Designation Assistant Professor
Web link ---
Cabin No 5(Room Number- 302- Block-III)
School School of Engineering& Technology
Department Computer Science & Engineering
Meeting Hours
Intercom No NA
Is this Course offered to more Yes
than one Batch?
If yes, please indicate the Dr. Amrita, Dr. Tarun, Dr. Bharat,Dr, Subrato, Mr. Murari, Mr.
name(s) of other faculty who Aman,
is/are sharing this Course

1
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE FILE CONTENTS

Sr. No TOPICS Page No
1. Vision and Mission of the University 4-5
2. Vision and Mission of the Department 6-7

3. Academic calendar of University and School 8

4. Timetable of the Faculty Member & Class 12

5. Course syllabus 14

6. POs, PSOs, PEOs & Cos 18

7. CO-PO-PSO Mapping 21

8. Detailed Lecture Plan 23

9. Teaching Learning Evaluation Scheme 29

10. List of students (Section Wise) 31

List of Slow and Fast Learners &

11.
Action Plan (Attach Proof) 36

12. Tutorial Sheets & Assignments with Sample Solutions 41

13. Question Bank 60

14. List of Topics for Presentation/Seminars/Projects 62

15. Content Beyond Syllabus 64

16. Study Material for Content Beyond Syllabus 65

17. Question Paper for Quizzes, MTE and ETE 75

18. Sample Evaluated Answer Scripts (Good/Average/Poor category) 76

19. Award Sheet of CA, MTE, ETE 81

20. Innovative Teaching/Learning Techniques/NPTEL/MOOC/SWAYAM 83

2
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
21. Extra Lecture/Mini Projects (if any) 84

22. Attendance Report 85

23. Sample Lecture Notes 86

24. File Closure (Final Attainments, Result Analysis, Feedback) 87

25. Course Exit Survey 88

Suggestion made by Course Committee/Instructor/Students for

26. Enhancement of Learning / Modification in Course Contents/Minutes 89
of the Meeting, if any

3
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

1. VISION & MISSION OF THE

OF UNIVERSITY

4
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

5
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

2. VISION & MISSION OF THE

OF DEPARTMENT

6
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

7
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

3. ACADEMIC CALENDAR OF
THE UNIVERSITY AND THE
SCHOOL

8
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

9
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

10
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

11
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

4. TIME TABLE OF THE

FACULTY MEMBER & CLASS

12
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Slot Based Time Table

12:25P
08:45 09:40A 10:35 11.30 M- 01.20P 2.15P 3:10P
Theory AM – M- AM - AM - 01:15P M- M- M-
Hours 09:35 10:30A 11.25A 12.20P M 2.10P 3.05P 4:00P
AM M M M M M M
Lunch
Theo
MO A1   C1          
ry
N
Lab             L23 L24
Theo
               
TUE ry
Lab             L27 L28
Theo
WE C1              
ry
D
Lab                
Theo
TH   A1 C1          
ry
U
Lab             L35 L36
Theo
    A1          
FRI ry
Lab             L39 L40

13
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

5. Course Syllabus

Course Syllabus
1. Name of the Faculty: Ms, Abha Kiran Rajpoot

2. Subject :Computer Networks Sub Code CSE 252

14
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
3. Branch : CSE

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

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

15
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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

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

16
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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
30% 20% 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

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

17
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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

CO - 2 -
2 - 2 2  3 - - - - 3 3
2

CO - - 2
3 2 - 2 - 2 - - - - 2 -
3

CO - - -
- 2 2 - - - - - - - 2 2
4

18
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

6. POs, PSOs, PEOs &

COs

20
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

21
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

22
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

7. CO-PO-PSO
Mapping

23
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

CO and PO Mapping

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

No. Outcomes (PSO)

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

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)
PSO1

PSO2

PSO3
PO10

PO11

PO12
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

24
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Project management and

Familiarity and practical

Understand, analyse and

The engineer and society
Engineering knowledge

Conduct investigations
Design/development of

Individual and team

Modern tool usage

Life-long learning
Environment and
Problem analysis

Communication:

Apply standard
C
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

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 1.5 1.3 1 1.3 0. 0.3 - 0.3 - - 1 1 0.3 2 0.6

uter 3 3 5 3 3 3 7
25
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Netwo
rks

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

8. DETAILED
LECTURE PLAN

26
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

1. Name of the Faculty: Ms. Abha Kiran Rajpoot

2. Subject : Computer Networks Sub Code CSE 252

3. Branch : CSE

Duratio Propo Co
Lec. n(in sed Mod Methodology/ Mappi blooms_l
No minute) Date Points To Covered e Activities ng evel

2021- Introduction to computer Onli Lecture with

1 55 07-01 networks, applications and uses, ne interaction CO1 L1

2021- classification of Networks based on Onli Lecture with

2 55 07-01 topologies ne interaction CO1 L1

2021- geographical distribution and Onli Lecture with

3 55 07-01 communication techniques ne interaction CO1 L1

2021- Onli Lecture with

4 55 07-01 Reference models: OSI model ne interaction CO1 L1

2021- Onli Lecture with

5 55 07-01 Reference models: TCP/IP model , ne interaction CO1 L1

Overview of Connecting devices

2021- (Hub, Repeaters, Switches, Onli Lecture with
6 55 07-01 Bridges, Routers, Gateways) ne interaction CO1 L1

2021- Transmission Media:wired , Onli Lecture with

7 55 07-01 wireless ne interaction CO2 L2

2021- Multiplexing techniques-FDM, Onli Lecture with

8 55 07-01 TDM ne interaction CO2 L2
27
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Functions, Framing,
2021- Onli Lecture with
9 55 07-01 ne interaction CO2 L2

Error Control-Error correction

2021- codes(Hamming code) Onli Lecture with
10 55 07-01 ne interaction CO2 L2

2021- Error Detection codes(Parity Bit, Onli Lecture with

11 55 07-01 CRC) ne interaction CO2 L2

Flow Control- Stop and Wait

2021- Protocol, Onli Lecture with
12 55 07-01 ne interaction CO2 L2

2021- Sliding window –Goback N and Onli Lecture with

13 55 07-01 Selective repeat(ARQ) ne interaction CO2 L2

2021- Onli Lecture with

14 55 07-01 CSMA, ne interaction CO3 L2

2021- Onli Lecture with

15 55 07-01 CSMA/CD protocols, ne interaction CO3 L4

2021- MAC- Sub-layer Protocols: Onli Lecture with

16 55 07-01 ALOHA, ne interaction CO3 L4

2021- Onli Lecture with

17 55 07-01 IEEE Standards 802.3, ne interaction CO3 L4

IEEE Standards 802.4,802.5

2021- Onli Lecture with
18 55 07-01 ne interaction CO3 L4

28
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

2021- Design issues , IPV4addressing Onli Lecture with

19 55 07-01 basics and Header format, ne interaction CO3 L4

2021- CIDR, sub-netting and sub- Onli Lecture with

20 55 07-01 masking ne interaction CO3 L4

Routing, optimality Principle

2021- Routing protocols-, Onli Lecture with
21 55 07-01 ne interaction CO3 L4

Shortest path,
2021- Onli Lecture with
22 55 07-01 ne interaction CO3 L4

2021- flooding, distance vector routing Onli Lecture with

23 55 07-01 , link state routing ne interaction CO3 L4

2021- Congestion control-Leaky bucket Onli Lecture with

24 55 07-01 , ne interaction CO4 L4

2021- Onli Lecture with

25 55 07-01 Token Bucket, ne interaction CO4 L4

jitter control
2021- Onli Lecture with
26 55 07-01 ne interaction CO4 L4

2021- Need of transport layer with its Onli Lecture with

27 55 07-01 services, Quality of service, ne interaction CO4 L4

2021- connection oriented and Onli Lecture with

28 55 07-01 connection less ne interaction CO4 L4
2021- Transmission Control Protocol: Onli Lecture with
29 55 07-01 Segment structure and header ne interaction CO4 L4
29
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

format,

2021- Overview of User Datagram Onli Lecture with

30 55 07-01 Protocol (UDP) ne interaction CO4 L4

2021- TCP Connection Management, Onli Lecture with

31 55 07-01 Flow Control ne interaction CO4 L4

2021- Onli Lecture with

32 55 07-01 TCP congestion control, ne interaction CO5 L5

2021- Internet Congestion Control Onli Lecture with

33 55 07-01 Algorithm, ne interaction CO5 L5

2021- Overview of User Datagram Onli Lecture with

34 55 07-01 Protocol (UDP) ne interaction CO5 L5

2021- Onli Lecture with

35 55 07-01 HTTP, FTP, SMTP ne interaction CO5 L5

2021- Onli Lecture with

36 55 07-01 Domain Name System (DNS), ne interaction CO5 L5

2021- Network Security services, Onli Lecture with

37 55 07-01 cryptography, ne interaction CO5 L5

2021- Onli Lecture with

38 55 07-01 DES, and RSA ne interaction CO6 L6

2021- Symmetric versus Asymmetric Onli Lecture with

39 55 07-01 cryptographic algorithms- ne interaction CO6 L6
30
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Application of Security in
2021- Networks: Digital signature Onli Lecture with
40 55 07-01 ne interaction CO6 L6

31
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

I Cloud Teaching Plan in Annexure I

32
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

9. Teaching Learning
Evaluation Plan

1. Name of the Faculty: AMIT KUMAR

2. Subject : PROGRAMMING FOR PROBLEM SOLVING Subject Code: CSE113

3. Section : CSE-BT&H
Course Evaluation Plan

S.No. Continuous Mid-Term Examination End-Term Examination

Assessment
33
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
1 Attendance Mandatory Mandatory 75%

Assignment/
MOOC/NPTEL
05 -- --
Courses/ Swayam
2 Courses

3 Quizzes 15 -- --

4 Projects -- -- --

Case Study/ Field

10 -- --
5 Study/Presentations

6 Exam -- Yes Yes

7 Total Marks 30 20 50

34
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

10. List of students

(Section Wise)

1. Name of the Faculty: Abha Kiran Rajpoot

2. Subject : Computer Networks Subject Code: CSE252

3. Section : CSE-C

Student ID Roll No. Name

2020002205 200101056 Angad Singh
2020002134 200101075 Avanindra Pratap Singh

35
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
2020002089 200101093 Bhavya Sharma
2020574430 200101145 Kakarlapudi Saketh Varma
2020002216 200101154 Kumari Shruti
2020582236 200101156 Lakshay Sharma
2020466328 200101172 Md Fahad
2020002229 200101174 Md Mohtashim Meeran
2020002152 200101179 Mir Ubaid Raza
2020002062 200101190 Mohd. Suhail
2020582605 200101274 Sachin Kumar Sinha
2020581995 200101292 Shatakshi Shukla
2020581459 200101303 Shivani Singh
2020002019 200101317 Soumya Kabdal
2020571015 200101341 Ujjwal Raghav
2020547844 200101349 Vaibhav Sharma
2020002115 200101362 Yogendra Singh
2020587675 200101367 Apoorv Mishra
2020002312 200101368 Mohammad Mihal
2020583252 200101369 Shekhar Mishra
2020002105 200101371 Siddharth Pandey
2020002130 200101372 Areeb Hasan
2020487183 200101374 Abhishek Kumar
2020496205 200101375 Ankit Saini
2020585611 200101378 Rishu Kumar
2020002294 200101379 Shruti Singh
2020587457 200101380 Swayam Govil
2020587759 200101381 Ankit Kumar
2020588187 200101383 Sonali Kumari Singh
2020542633 200101011 Abhinav Panwar
2020544329 200101165 Manish Kumar
2020465531 200101239 Quamar Ziya
2020001904 200101248 Raj Sahu
2020000998 200101255 Risabh Kumar Singh
2020576153 200101257 Rishabh Goel
2020516457 200101289 Shashank Shekhar
2020001595 200101299 Shivam Kumar
2020490277 200101344 Umang Sharma
2020583104 200101376 Kajal Kumari
2020830729 200101384 Subarna Acharya
2020830389 200101385 Aditi Kumari Gupta
2020830792 200101386 Nabin Pathak
2020830853 200101387 Drishti Malik

36
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
2020549089 200102001 Abhimanyu Kumar
2020002047 200102002 Agrim Jain
2020548981 200102003 Akash Kumar
2020541535 200102004 Anupam Kumar
2020522565 200102005 Kartikeya Sehrawat
2020567570 200102006 Mohd Azam
2020542920 200102007 Sankalp Kumar
2020571245 200102008 Vansh Chaudhary
2020578045 200102009 Vidhi Mourya
2020001974 200102010 Zishan Siddique
Felix Ezechinyere
2020830766 200102011 Nwokekeh
2020585245 200102012 Prince Raj
2020587775 200102013 Harsil Kumar
2020537200 2001124001 Akshaidha D
2020525889 2001134006 Maneesh Chauhan
2020587717 2020587717 Zunaira Waseem

37
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

11. List of Slow and Fast

Learners &
Action Plan (Attach Proof)

38
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Record of Week Students
Prog. Name : B. Tech.
Course Name: Computer Networks
Course Code: CSE252

Slow Learners
2020002019 Soumya Kabdal
2020583252 Shekhar Mishra
2020002105 Siddharth Pandey
2020587675 Apoorv Mishra
2020587759 Ankit Kumar
2020466328 Md Fahad
2020574430 Kakarlapudi Saketh Varma

39
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SHARDA UNIVERSITY
UTTAR PRADESH
Record of Top Students
Prog. Name : B. Tech.
Course Name: Computer Networks
Course Code: CSE252

2020587457 Swayam Govil

2020588187 Sonali Kumari Singh

2020581459 Shivani Singh

2020581995 Shatakshi Shukla

2020002089 Bhavya Sharma

2020002115 Yogendra Singh

2020002130 Areeb Hasan

2020585611 Rishu Kumar

2020002152 Mir Ubaid Raza

2020002205 Angad Singh

2020002229 Md Mohtashim Meeran

2020002294 Shruti Singh

2020002312 Mohammad Mihal

2020547844 Vaibhav Sharma

2020571015 Ujjwal Raghav

40
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SHARDA UNIVERSITY
UTTAR PRADESH
Record of Weak Students
Prog. Name : B. Tech.
Course Name: Programming for problem solving
Course Code: CSE113
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 learningOutcomes 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
41
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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.
9. Special Assignment-2
Read the ideal/best solution of MTE and rewrite the solution for questions asked in
MTE in a neat and clean manner.
10. Special Assignment-3
Read Assignment-1, Assignment-2 and assignmen-3 which have been graded as A++.

SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Activity Sheet for Slow Learner

CSE113 (Application Based Programming in Python)
B.Tech-II Sem.

Activity 1:

Three assignments were given to the students.

Activity 2:

42
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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.

43
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

12. TUTORIAL SHEETS &

ASSIGNMENTS WITH
SAMPLE SOLUTIONS

Sharda University – School of Engineering and Technology

Department of Computer Science and Engineering
B.Tech- CSE
CSE252: computer Networks
QUIZ I
M.M -10
Name : System Id:

QUIZ – 1

COMPUTER NETWORKS

Time : 10 Min Max Marks : 10

44
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Q 1 The term byte stuffing refers to:

(i) data stuffing used with character oriented hardware.

(ii) data stuffing used with bit oriented hardware.
(iii) data stuffing used with both (A) & (B)
(iv) None

Q 2 ARQ stands for _______.

( i) Automatic repeat quantization (ii) Automatic repeat request

(iii)Automatic retransmission request (iv) Acknowledge repeat request

Q3 In Go-Back-N ARQ, if 5 is the number of bits for the sequence number, then the maximum size
of the send window must be _____

Q4  In Go-Back-N ARQ, if frames 4, 5, and 6 are received successfully, the receiver may send an
ACK _______ to the sender.
i)    5 ii)   6 iii)   7 iv)   any of the above

Q5   High-level Data Link Control (HDLC) is a _______ protocol for communication over point-

to-point and multipoint links.
i)  bit-oriented ii) byte-oriented iii)  character-oriented iv)   none of the above

Q6  In ________ each station sends a frame whenever it has a frame to send.
i)     pure ALOHA ii)           slotted ALOHA iii)           both (a) and (b)
iv  neither (a) nor (b)

Q7 The vulnerable time for CSMA/CD is the ________propagation time.

i)           the same as ii)           two times iii)           three times iv)   none of
the above

Q8  An IPv4 address consists of _______ bits.

i)    4 ii)     8 iii)            32 iv)      64

Q9  Identify the class of the following IPv4 address: 4.5.6.7.

i)     A ii)            B iii)            C iv)           none of the above

Q10 What is the first address of a block of classless addresses if one of the addresses is
12.2.2.76/10?
i)           12.0.0.0 ii)            12.2.0.0
iii)          12.2.2.2 iv)           none of the above

45
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

46
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Sharda University – School of Engineering and Technology

Department of Computer Science and Engineering
B.Tech- CSE CSE252: Computer Networks
QUIZ – 2

COMPUTER NETWORKS

Time : 10 Min Max Marks : 10

Q1 …………………………………….. is the special 8 bit pattern which is used as the delimiter to

define the beginning and the end of the frame.

Q2  In the _________Protocol, if no acknowledgment for a frame has arrived, we resend all
previous frames.
i)  Stop-and-Wait ARQ ii) Go-Back-N ARQ iii)  Selective-Repeat ARQ iv) none of the above

Q3   In Selective Repeat ARQ, if 5 is the number of bits for the sequence number, then the
maximum size of the send window must be _____

Q4   The _______Protocol has flow control, but not error control.

i)    Stop-and-Wait ii)           Simplest iii)           Go-Back-N ARQ iv)          
Selective-Repeat ARQ

 Q5  In _________, the configuration is balanced. The link is point-to-point, and each station can
function as a primary and a secondary.
i)           ABM ii)           NRM iii)           ARM iv)           NBM

Q6 In slotted ALOHA, the vulnerable time is ______ the frame transmission time.
i)           the same as ii)           two times iii)           three times iv)           none of the
above

Q7  In _______, the sequences are generated using orthogonal codes such the Walsh tables.
i)           FDMA ii)           TDMA iii)           CDMA iv)           none of the
above

 Q8 Find the number of addresses in a block of classless addresses if one of the addresses is
12.2.2.7/30.
i)          2 ii)            4 iii)            8 iv)           none of the above

Q9 _______ deals with the issues of creating and maintaining routing tables.
i) Forwarding ii) routing iii) Directing iv) None of the above

47
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Q10 Every incoming packet is sent on every outgoing line in

i)Distance Vector routing

ii)link state routing
iii)Flodding
iv)None

Sharda University – School of Engineering and Technology

QUIZ – 3

COMPUTER NETWORKS

Time : 10 Min Max Marks : 10

Q1 ………………………………………… sublayer is responsible for flow control and error

control.

Q2  In the _____ Protocol, the sender sends its frames one after another with no regard to the
receiver.
i)    Stop-and-Wait ii)   Simplest iii)   Go-Back-N ARQ iv)  Selective-Repeat ARQ

Q3  In Go-Back-N ARQ, if 5 is the number of bits for the sequence number, then the maximum size
of the send window must be _____

 Q4    In the _________ protocol we avoid unnecessary transmission by sending only frames that are
corrupted.
i)    Stop-and-Wait ARQ ii)   Go-Back-N ARQ iii)  Selective-Repeat ARQ iv)          
none of the above

Q5   HDLC is an acronym for _______.

i) High-duplex line communication ii)           High-level data link control
iii) Half-duplex digital link combination iv)           Host double-level circuit

Q6  In pure ALOHA, the vulnerable time is ______ the frame transmission time.
i)           the same as ii)           two times iii)           three times iv)          none of
the above

48
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Q7  In ___________ methods, no station is superior to another station and none is assigned the
control over another.
i)           random access ii)           controlled access
iii)           channelization iv)           none of the above

Q8 What is the first address of a block of classless addresses if one of the addresses is
12.2.2.127/28?
i)          12.2.2.0 ii)            12.2.2.96 iii)            12.2.2.112 iv)   none of the above

Q9 The logical addresses in the Internet are called _______ addresses.

i)       port ii)       IP iii)       Email iv)      none of the above

Q10  _______ routing table is updated periodically using one of the dynamic routing protocols.

i) Static ii) Dynamic iii)hierarchal iv)None of the above

49
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
ASSIGNMENT NO.- 1
CSE252 (Computer Networks)

Q1 For 10 devices in a network, what is the number of cable links required for a
mesh and ring topology?

Q2 Draw a hybrid topology with a ring backbone and two bus networks.

Q3 What is protocol? Why are protocols needed?

Q4 . If the unit exchanged at the data link level is called a frame and the unit exchanged at the
network level is called a packet, do frames encapsulate packets or do packets encapsulate frames?
Explain your answer.

Q5 A system has an n-layer protocol hierarchy. Applications generate messages of length M bytes.
At each of the layers, an h-byte header is added. What fraction of the network bandwidth is filled
with headers?

Q6 A device is sending out data at the rate of 1000 bps. How long does it take to send out a single
character (8 bits)?

ASSIGNMENT NO.- 2
CSE252 (Computer Networks)

Q 1 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 2 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

50
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
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 3 Explain why collision is an issue in a random access protocol but not in controlled
access or channelizing protocols.

51
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Tutorial Sheet

No Tutorial for this Subject

52
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

13. Question Bank

53
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

QUESTION BANK
Prog. Name : B. Tech.
Course Name: Computer Networks
Course Code: CSE252

Explain different types and component of network with suitable block diagram.Discuss also the uses of computer network
What is the use of network topologies ? Explain various topologies in detail.
Star Toplology is better then Bus Topology.Justify this statement with example.
Discuss all the physical componenets of networks.
Explain in detail about types of transmission technology.
Discuss about types of connecting devices with the help of suitable block diagram.
How you can diffrentiate between networking and internetworking devices.
Diffrentiate between hub and switches with examples.
Explain about all the transmission mode with the help of examples.
Define Multiplexing.Explain various multiplexing technique with suitable exapmle.
What is the meaning of modem? Write the types of modems.
Write the role of transmission media in computer networks.
Explain OSI reference model with the help of layered architechture.
How TCP/IP model is different from OSI model.Discuss.
Discuss about each OSI layer functionality with their advantages.
Diffrentiate between repeaters ,hub and switches.
TCP/IP mpdel id different from OSI Model.Justify this statement.
Diffrentiate between OSI and TCP/IP Protocol.
What is the working principles of each layer in TCP/IP.Explain with block diagram.
Differentiate Shielded and Unshielded Twisted pair cable.
Explain about all the types of networks with the suitable diagram.
Diffrentiate between LAN ,WAN and MAN with examples.
Define peer to peer natworks with the help of real time example.
What are the line configuartion.Define different types of line configartion with example.
Give reasons why networks might use an error correcting code instead of error detection and retransmission.
Compare and contrast byte oriented and bit oriented protocols.
Write the short note on CRC.
Define Framing and the reason for its need.
Explain the reason for moving from the stop and wait ARQ protocol to the Go Back –N ARQ protocol.
Compare and contrast Flow control and Error control.
Where stop and Wait protocol Is used.
Write the note on Go-Back-ARQ
What is CSMA? Where it is used. Explain in detail.
54
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Differentiate IEEE Standards 802.3 and 802.4.
What is the difference between single bit and Burst error.
Compare and contrast CSMA and ALOha.
A large number of consecutive IP addresses are available starting at 198.16.0.0. Suppose that four organizations, A, B, C, a
notation.
How can be distinguish a multicast address in IPV4 addressing? How can be do so in IPV4 addressing.
Find the class of the following IPv4 addresses., (a) 229.20.20.20, (b) 85.36.52.0, (c) 145.250.201.23, (d) 195.2.89.65, (e) 17
What is address space? How many address spaces are there in IPV4.
Transport layer Maintain the integrity of the data. Justify the statement.
List and explain the duties of transport layer.
How Process to Process delivery is different from node to node delivery.
How Process to Process delivery is different from node to node delivery.
Draw the header format of a TCP packet and explain functions of each field in detail
Explain the various ports used for the UDP and the Role of Checksum in detail.
How congestion is controlled in transport layer? Explain.
Name and explain any two techniques for congestion control at transport layer
How TCP congestion control is different than UDP congestion control. Explain with help of some practical applications.
Write the different Domain Name System with description.
If a DNS domain name is voyager.fhda.edu, How many levels are involved here.
What is DNS namespace.
Describe the Role of SMTP in Mail system.
Compare different scinerio of Email system.
Disscuss various component used in Email services.
What is User agent.
Explain the concept of Digital signature. Where we can use this concept.
How Symmetric cryptography is different from , Asymmetric Cryptography? Explain.
What is role of Message digest in security.
What is Private and Public Key.

55
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

14. List of Topics for

Presentation/ Project

56
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Students have to present the topics in groups. They have to present their presentation

at least of 15 Minutes. Some of the topics are given as follows:

 Transmission Control Protocol: Segment structure and header format, TCP

Connection Management, Flow Control
 Routing, optimality Principle Routing protocols-, Shortest path, flooding,
distance vector routing , link state routing
 Network Security services, cryptography, Symmetric versus Asymmetric
cryptographic algorithms- DES, and RSA

57
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

15. CONTENT
BEYOND SYLLABUS

58
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Students were told about the advance topics in computer networks.. Some of the topics are as follows:

 Function
 Pointer
 Structure
 Array and Array with Pointer
 Loops

59
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

16. Study Material for Content

Beyond Syllabus

60
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

17. Question Paper for

Quizzes, MTE and
ETE

61
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Question Option1
Which of the following is not a characteristics of good algorothm? Precise
struct {char name[10], int
typ
Which of the following is a User-defined data type? age};
What will be the value of d (assume d to be a float) after the operation d = 2 / 7.0 ? 0.2857
A box that can represent more than one different conditions. Rectangle
Symbols do not get
connected together in a With das
In a flowchart how are symbols connected? flowchart
Simple programming
language, which is linked Complicate
Definition of pseudocode might be.. to a specific language
If the correct software is
If the corre
What should be considered when designing an algorithm? being used
Which of the following is not a characteristics of good algorothm? Precise
Letters a-z, A-Z in Basic
character set.
Und
Unicode alphabet
An Identifier may contain.? characters other languages
Number of Keywords present in C Language are .? 32
What is the output of the following C code: int main()
{
float x = 'a'; a
printf("%f", x);
return 0;
}

What is the output of this C code?

void main()
{ 09
int k = 8;
int x = 0 == 1 && k++;
printf("%d %d\n", x, k);
}

What is the output of this C code?

int main()
{
0
int x = 2, y = 0;
int z = (y++) ? y == 1 && x : 0;
printf("%d\n", z);
return 0;
}

62
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Comment on the following code below?

void main()

{
It will display hello It w
int x = 5;

if (true);

printf("hello");

What is the output of this C code?

void main()

int i = 0;

for (i = 0;i < 5; i++) Hello is printed 5 times Hello

if (i < 4)

printf("Hello");

break;

}
What is the output of the below code?
#include<stdio.h>
main()
{ Prints “Sharda” once.
for(1;2;3)
printf("Sharda");
}
String is an
String is a new Data Type
null charac
in C
What is a String in C Language.?

63
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
for
Which loop is faster in C Language, for, while or Do While.?

What is the output of C Program.?

int main()
{
while(true) RABBIT is
{ RABBIT
printf("RABBIT");
break;
}

return 0;
}
What would be the output of the following program?
int main()
{
int main = 99; Depends on the compiler
printf("%d", main);
return 0;
}

What would be the output of the following program?

#include "stdio.h"
int main()
{
Compiler E
int x = 10; A12 12B
int y = 15;
printf("A%d",(x+1),(y=x+2));
printf(" %dB",y);
return 0;
}

What is the output of C Program with functions.?

void show();
int show();
int main()
{
printf("ANT\n");
return 0;
}
ANT
void show()
{
printf("Integer") ;
}
int show()
{
printf("Void");
}

64
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
What is the output of C Program.?
int main()
{
int a=25;

while(a <= 27)

{ 25 25 25
printf("%d ", a);
a++;
}

return 0;
}

What is the output of C Program.?

int main()
{
int k, j;

for(k=1, j=10; k <= 5; k++) compiler error 1

{
printf("%d ", (k+j));
}

return 0;
}

What is the output of C Program.?

int main()
{
int k;

for(k=1; k <= 5; k++); 12345

{
printf("%d ", k);
}

return 0;
}

65
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

What is the output of C Program.?

int main()
{
int a=32;

do 32
{
printf("%d ", a);
a++;
}while(a <= 30);

return 0;
}

What is the output of C Program with switch statement or block.?

int main()
{
int a;

switch(a) APACHE HEROHONDA H

{
printf("APACHE ");
}

printf("HEROHONDA");
}

What is the output of C Program.?

int main()
{
int a=25;

while(a <= 27) 25 25 25

{
printf("%d ", a);
a++;
}

return 0;
}

66
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

What is the output of C Program.?

int main()
{
int a=32;

do
{ No Output
printf("%d ", a);
a++;
if(a > 35)
break;
}while(1);

return 0;
}
Choose a correct C Statement.
A) a++ is (a=a+1) POST INCREMENT Operator
B) a-- is (a=a-1) POST DECREMENT Opeartor A
--a is (a=a-1) PRE DECREMENT Opeator
C) ++a is (a=a+1) PRE INCRMENT Operator
D) All the above.

What is the output of C program with arrays and pointers.?

int main()
{
int size=4;
86
int a[size];
a[0]=5;a[1]=6;
a[2]=7;a[3]=8;
printf("%d %d", *(a+2), a[1]);
}
What is the output of C program with arrays.?
int main()
{ 20
int ary(3)=[20,30,40];
printf("%d", a(1));
}

67
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

What is the output of C Program with functions.?

void show();

int main()
{
show();
printf("ARGENTINA "); ARGENTINA AFRICA AFR
return 0;
}

void show()
{
printf("AFRICA ");
}

What is the output of C program with strings.?

int main()
{
char var='b';
printf("%d ", sizeof("a")); 1111
printf("%d ", sizeof('b'));
printf("%d ", sizeof(10));
printf("%d ", sizeof(var));
}
//int size is 2 bytes

What is the output of C program.?

int main()
{
char str1[]="JAMES,";
JAMES BOND,JAMES J
char str2[15]="BOND ";
strcat(str2,str1);
printf("%s",str2);
printf("%s",str1);
}
Choose a correct statement about C String.
A) A string is a group of characters enclosed by double quotes.
B) If a string is defined with double quotes, NULL is automatically added at the end. A
C) Size of a string is without counting NULL character at the end
D) All the above
Every C Program should contain which function.? printf()
What is the maximum number of statements that can present in a C function.? 64

68
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

What is the output of C program with Structure pointer in TurboC.?

int main()
{
struct books{
int pages; 2
char str[4];
}*ptr;
printf("%d",sizeof(ptr));
return 0;
}

What is the output of C Program with functions.?

int show();

void main()
{
int a;
printf("PISTA COUNT="); PISTA COUNT= PI
a=show();
printf("%d", a);
}

int show()
{
return 10;
}
What is the keyword used to declare a C file pointer.? file

What is the output of C program.?

int main()
{
int a=123; *123*
printf("*%06d*",a);
return 0;
}

Choose a correct statement about C file operation program.?

int main()
{
FILE *fp;
FOPEN opens a file named EOF is End
char ch;
readme.txt in Read Mode for end of fi
fp=fopen("readme.txt","r");
("r).
while((ch=fgetc(fp)) != EOF)
{
printf("%c",ch);
}
}
$ symbol (DOLLAR) @ sy
Processor Directive in C language starts with.?
How do you separate a multiline macro in C language.? Using \ operator U
69
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
An escape sequence is a An escape s
combination of two a string to
characters starting with New Lin
What is an Escape Sequence in C language.? Back Slash always. D
What is the worst case time complexity in linear search? O (1)

What is the output of C program with #define.?

#define CVV 156
int main()
{ 0
int a=10;
a = a*CVV;
printf("CVV=%d",a);
return 0;
fclose(fp) closes a file to
Closing a f
release the memory used in
from
What is the need for closing a file in C language.? opening a file.
Choose a C unformatted input output function below. gets(), puts() ge

70
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

18. Sample Evaluated Answer

Scripts (Good/Average/Poor
category)

71
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

19. Award Sheet of CA,

MTE, ETE

72
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Roll
Name Student ID Number CA MST
Angad Singh 2020002205 200101056 28 20
Avanindra Pratap Singh 2020002134 200101075 23 17
Bhavya Sharma 2020002089 200101093 21 20
Kakarlapudi Saketh
Varma 2020574430 200101145 16 10
Kumari Shruti 2020002216 200101154 23 13
Lakshay Sharma 2020582236 200101156 21 11
Md Fahad 2020466328 200101172 21 10
Md Mohtashim Meeran 2020002229 200101174 28 13
Mir Ubaid Raza 2020002152 200101179 18 5
Mohd. Suhail 2020002062 200101190 20 14
Sachin Kumar Sinha 2020582605 200101274 22 20
Shatakshi Shukla 2020581995 200101292 27 20
Shivani Singh 2020581459 200101303 29 20
Soumya Kabdal 2020002019 200101317 22 17
Ujjwal Raghav 2020571015 200101341 28 20
Vaibhav Sharma 2020547844 200101349 22 15
Yogendra Singh 2020002115 200101362 29 19
Apoorv Mishra 2020587675 200101367 11 6
Mohammad Mihal 2020002312 200101368 24 16
Shekhar Mishra 2020583252 200101369 22 8
Siddharth Pandey 2020002105 200101371 13 14
Areeb Hasan 2020002130 200101372 25 14
Abhishek Kumar 2020487183 200101374 26 19
Ankit Saini 2020496205 200101375 20 15
Rishu Kumar 2020585611 200101378 27 14
Shruti Singh 2020002294 200101379 28 17
Swayam Govil 2020587457 200101380 21 15
Ankit Kumar 2020587759 200101381 28 12
Sonali Kumari Singh 2020588187 200101383 27 19
Abhinav Panwar 2020542633 200101011 26 19
Manish Kumar 2020544329 200101165 22 16
Quamar Ziya 2020465531 200101239 21 13
Raj Sahu 2020001904 200101248 21 10

73
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Risabh Kumar Singh 2020000998 200101255 26 19
Rishabh Goel 2020576153 200101257 13 11
Shashank Shekhar 2020516457 200101289 23 16
Shivam Kumar 2020001595 200101299 22 11
Umang Sharma 2020490277 200101344 25 20
Kajal Kumari 2020583104 200101376 20 10
Subarna Acharya 2020830729 200101384 29 18
Aditi Kumari Gupta 2020830389 200101385 26 18
Nabin Pathak 2020830792 200101386 28 12
Drishti Malik 2020830853 200101387 24 19
Zunaira Waseem 2020587717 200101399 25 18
Abhimanyu Kumar 2020549089 200102001 23 10
Agrim Jain 2020002047 200102002 28 19
Akash Kumar 2020548981 200102003 25 20
Anupam Kumar 2020541535 200102004 27 14
Kartikeya Sehrawat 2020522565 200102005 23 19
Mohd Azam 2020567570 200102006 23 12
Sankalp Kumar 2020542920 200102007 22 15
Vansh Chaudhary 2020571245 200102008 27 19
Vidhi Mourya 2020578045 200102009 10 0
Zishan Siddique 2020001974 200102010 20 13
Felix Ezechinyere
Nwokekeh 2020830766 200102011 27 10
Prince Raj 2020585245 200102012 21 13
Harsil Kumar 2020587775 200102013 22 6
Akshaidha D 2020537200 2001124001 22 20
Maneesh Chauhan 2020525889 2001134006 25 19

74
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

20. Innovative Teaching/Learning

Techniques/NPTEL/MOOC/SWAYAM

75
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

1. Students guided for MOOC course

2. Online lecture materials through LMS,
Lecture materials of IIT and NIT provided
3. Open book Test
4. Every student have to solve and submit at
least 10-15 questions based on competitive
programming

76
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

21. Extra Lecture/Mini Projects (if any)

NIL

77
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

22. Attendance Report

(ICLOUD Report Portal)

78
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

23. SAMPLE LECTURE

NOTES

79
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

24. File Closure (Final

Attainments, Result Analysis,
Feedback)
80
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Annexure II

25. Course Exit

Survey
81
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

26. Suggestion made by Course

Committee/Instructor/Students for
Enhancement of Learning /

82
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Modification in Course
Contents/Minutes of the Meeting, if any

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Minutes of the Meeting
Date: Jan 18, 2022 Time: 11.00 AM

A meeting among all instructors of the course Computer Networks (CSE252) was held.

Course Coordinator presided over the meeting.

Agenda for the meeting:

83
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
To plan and execute important routine works regarding the course Computer Networks
(CSE252)Following members were present in the meeting:

1. Dr. Amrita
2. Dr. Subrato

3.Dr. Bharat Bhusan

4. Mr. Murari Kumar Singh

5. Mr. Aman Anand

People who missed the meeting:

None

Following points were discussed during the meeting:

1. It always takes time to start a new course and develop interest of students in that course. For the
same reason it was discussed to synchronize the syllabus in all the batches.

2.Course Handout, Course contents & Lecture Plan/Instruction Plan:

We discussed about the course handout and lecture plan/instruction plan, and the same document
will be prepared by Dr. Amrita and Dr. Tarun. This will be the common document for every
faculty (change of dates as per each faculty timetable ) and to be uploaded by everyone on iCloud.

3. Assignments, Question Bank & Quiz:

The folder is maintained separately for each faculty so as to maintain the repository of the
assignment’s and quizzes to be floated

i. To give proper Assignments on time in all the batches as per academic calendar.

ii. To conduct Quizzes on time in all the batches as per academic calendar.

84
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
iii. Question bank can be appended in previous questions as mentioned in Course file 2002. Tasks
have been assigned along with deadlines.

4. Mode of evaluations (CA):

The components of the CA are as follows:

S.No. CA Components Marks Remarks

1 Quiz 15 Best 3 Quizzes out of 5

Any one component of CA can be used.

Projects/
2 Presentation/Case 10 But, this must be part of Evaluation Scheme in
Study syllabus so it will be known to all including students
from the beginning.

Four Evaluations per student uniformly distributed

over the Semester as per Academic Calendar

Classroom
3 Participation/ 5 Oral Questioning on understanding in lecture, Group
MOOC/ Assignment Participation on topic, Demonstration/problem
solving on white board, Peer Reviews

Total CA Marks 30

5. Lab/Platform and experiments finalizations & Value added experiments for the
students:

The list of experiments along with 4 to 5 value added experiments is to be included in the
experiment lab file. Platform for the lab experiment decided is GDB compiler. This task has to be
compiled by Dr. Amrita

6. Planning to achieve the Course Outcome:

Recurring meeting for achieving the COs.

85
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

7. Maintain the record of Attendance:

To be maintained by each faculty in excel, regular absentees to be tracked and same to be uploaded
when asked on iCloud.

Maintaining call log if student is absent for consecutively three days.

8. Planning for slow and fast learners:

To be identified by each faculty at the end of the first week from the start of the class (based on
previous result).

Activities for the same to be planned and discussed in next meeting. Mr. Sunil will coordinate this
task.     

9. Introductory PPT during the first lecture:

Ms. Abha Kiran Rajpoot will compile the introductory ppt and share with the rest team members.
The faculties will be needed to only attach their respective students list and about themselves.

10. A folder will be shared by your name where you have to upload the content, quiz, assignments
etc.

11. There will be two meetings for each unit.

13. Timely responding to the e-mails and meeting the deadlines for assigned tasks are to be taken
care by all the faculty members.

14. Suggestions made during meeting: The following suggestions have given by the committee:

i. Prime focus on Problem solving.

ii. Competitive programming

iii. Interaction on industry based questions.

iv. Discussion on GATE questions.

86
 SHARDA UNIVERSITY
Greater Noida, Uttar Pradesh, India
SCHOOL OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Meeting ended with vote of thanks.

Thanks and Regards

-----------------------------

Course Coordinator

87