PROGRAMME STRUCTURE

SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Department of Computer Science & Applications

Bachelor of Technology

(Specialization in Information Technology)

Programme Code: SET0102

Batch: 2023-2027

CSA, SSET, SU
 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023-27 TERM: I
Teaching
Load Pre-Requisite/Co-
S. No. Course Code Course Credits
Requisite
L T P
THEORY SUBJECTS
1 CSE113 Programming for Problem-Solving 3 0 0 3
2 MTH142 Calculus and Abstract Algebra 3 1 0 4
3 PHY125 Engineering Physics-I 3 1 0 4
4 CVL103 Environmental Studies 2 0 0 0 Audit Course
Practical/Viva-Voce/Jury
5 ARP101 Communicative English-1 1 0 2 2
6 CSP113 Programming for Problem-Solving Lab 0 0 2 1
7 CSP101 Fundamental of Information Technology 0 0 2 1
MEP106 Computer Aided Design & Drafting 0 0 3
8 OR 1.5
MEP105 Mechanical Workshop 0 0 3
9 PHY162 Physics Lab 0 0 2 1
TOTAL CREDITS 17.5

CSA, SSET, SU Page 2

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023 -27 TERM: II
Teaching
S. Course Load
Course Credits Pre-Requisite/Co Requisite
No. Code
L T P
THEORY SUBJECTS
1 CSE114 Application based Programming in Python 3 0 0 3
2 MTH145 Probability and Statistics 3 1 0 4
3 EEE112 Principles of Electrical and Electronics Engineering 2 1 0 3
4 CSE242 Data Structures 3 0 0 3
5 HMM111 Human Value & Ethics 2 0 0 2
Practical/Viva-Voce/Jury
6 ARP102 Communicative English -2 1 0 2 2
7 CSP242 Data Structure Lab 0 0 2 1
8 CSP114 Application-based Programming in Python 0 0 2 1
9 CSP116 Design and Creativity Lab 1 0 2 2
MEP105 Mechanical Workshop 0 0 3
10 OR 1.5
MEP106 Computer-Aided Design & Drafting 0 0 3
11 EEP112 Principles of Electrical and Electronics Engineering 0 0 2 1
TOTAL CREDITS 23.5

CSA, SSET, SU Page 3

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023 -27 TERM: III
Teaching
S. Course Load Pre-Requisite/Co
Course Credits
No. Code Requisite
L T P
THEORY SUBJECTS
1 CSE252 Computer Networks 3 0 0 3
2 CSE245 Discrete Structures 3 1 0 4
3 CSE247 Computer Organization and Architecture 3 0 0 3
4 CSE253 Object Oriented Programming Using Java 2 0 0 2
5 CSE254 Principles of Operating System 2 0 0 2
6 IED001 Introduction of Entrepreneurship 2 0 0 2
Practical/Viva-Voce/Jury
7 ARP207 Logical Skills Building and Soft Skills 1 0 2 2
8 CSP242 Computer Network Lab 0 0 2 1
9 CSP243 Object Oriented Programming Using Java 0 0 2 1
10 CSP244 Principles of Operating System Lab 0 0 2 1
11 CSP254 Project Based Learning (PBL) -1 0 0 4 2
12 CSP292 Summer Internship-I - - - 2
TOTAL CREDITS 25

CSA, SSET, SU Page 4

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023 -27 TERM: IV
S. Teaching Load Pre-Requisite/Co
Course Code Course Credits
No. L T P Requisite
THEORY SUBJECTS
1 BTY223 Introduction to Biology for Engineers 2 0 0 2
2 CSE249 Database Management System 3 0 0 3
3 INT248 Human computer interaction 3 0 0 3 Discrete Structures
4 HMM305 Management for Engineers 3 0 0 3
PE-1 Program Elective-1
CSE011 Mathematical Techniques
5 3 0 0 3
CSE014/ CSP014 Advanced Java Programming
CSE012 Introduction to Graph Theory and its Applications
6 OE1 Open Elective – 1 2 0 0 2
Practical/Viva-Voce/Jury
7 ARP208 Quantitative and Qualitative Aptitude Skill Building 1 0 2 2
8 CSP249 Database Management System Lab 0 0 2 1
10 INP248 Human computer interaction Lab 0 0 2 1
11 CSP297 Project Based Learning (PBL) -2 0 0 4 2
TOTAL CREDITS 22

CSA, SSET, SU Page 5

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech - Information Technology
Batch: 2023 -27 TERM: V
Teaching
S. Load
Course Code Course Credits Pre-Requisite/Co Requisite
No.
L T P
THEORY SUBJECTS
1 CSE356 Design and Analysis of Algorithm 3 0 0 3 Data Structure
2 CSE355 Software Engineering and Testing Methodologies 2 0 0 2
3 BRM003 Research Methodology 0 1 2 2
PE2 Program Elective-2 Operating System(3)
Object Oriented Programming using
4 CSE021 Introduction to Cloud Computing 3
3 0 0 Java(Semester 3)
INT021 Ethical Hacking
CSE024/ CSP024 Web Technologies 2 0 2
5 OE-2 Open Elective – 2 2 0 0 2
Practical/Viva-Voce/Jury
6 ARP305 Personality Development and Decision making Skills 1 0 2 2
7 CSP350 Design and Analysis of Algorithm Lab 0 0 2 1
8 CSP354 Project Based Learning (PBL) -3 0 0 4 2
9 CSP355 Software Engineering and Testing Methodologies 0 0 2 1 Data Structure Lab
Operating system, Database
10 CSP391 Summer Internship-II - - - 2
Management system
11 CSP395 Technical Skill Enhancement Course-1 Simulation Lab 0 0 2 1 PBL-2
12 ECC301 Community Connect - - - 2 Summer Internship-I
TOTAL CREDITS 23

CSA, SSET, SU Page 6

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023 -27 TERM: VI
S. Teaching Load
Course Code Course Credits Pre-Requisite/Co Requisite
No. L T P
THEORY SUBJECTS
1 CSE022 Android Application Development 3 0 0 3
2 CSE472 Artificial Intelligence 3 0 0 3
PE3 Program Elective-3
3 CSE031 Digital Image Processing 3 0 0 3
CSE032 Cryptography and Network Security
PE4 Program Elective-4
4 CSE041 Software Project Management 3 0 0 3
CSE042 Software Testing
PE5 Program Elective-5
CSE051 Wireless Networks
5 3 0 0 3
CSE052 Risk Management
CSE053 Advanced Operating System
6 OE-3 Open Elective – 3 3 0 0 3
Practical/Viva-Voce/Jury
7 CSP472 Artificial Intelligence Lab 0 0 2 1
8 ARP306 Campus to Corporate 1 0 2 2
9 CSP022 Android Application Development Lab 0 0 2 1 Principles of Operating system Lab
10 CSP396 Technical Skill Enhancement Course-2(Application Development Lab) 0 0 2 1
11 CSP398 Project Based Learning (PBL) -4 0 0 4 2 PBL-3
TOTAL
25
CREDITS

CSA, SSET, SU Page 7

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023-27 TERM: VII
Teaching Load
S. No. Course Code Course Credits Pre-Requisite/Co Requisite
L T P
1. CSE473 Mobile Computing 3 0 0 3
2. CSE062 Quantum Computing
3. TERM:
CSE063 Program Elective-7 0 3
VI

4. CSE071 Introduction to Internet of Things

5. CSE072 Parallel Computing Algorithms
2 0 0 2
6. CSE073 3D Printing and Software Tools

7. Comprehensive Examination 0 0 0 0 Audit

8. OE4 Open Elective - 4 3 0 0 3
9. CSP473 Machine Learning Lab 0 0 2 1
10. CSP496 Summer Internship-III - - - 2 PBL-4
11. CSP497 Capstone - 1 - - - 2 Summer Internship-II
Total Credits 16

CSA, SSET, SU Page 8

 Programme Structure
SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Department: Computer Science & Applications
B.Tech (Information Technology)
Batch: 2023-27 TERM: VIII
Teaching Load
S. No. Course Code Course Credits Pre-Requisite/Co Requisite
L T P
Practical/Viva-Voce/Jury
1 CSP498 Capstone - 2 - - - 8 Major Project - 1
TOTAL CREDITS 8

Term L T P Credits TTH

1
TERM-I. 12 2 14 17.5 28

2 TERM-II. 12 2 14 23.5 28
3 TERM-III. 16 1 12 25 29
4 TERM-IV. 17 0 12 22 29
5 TERM-V. 15 0 14 23 29
6 TERM-VI. 19 0 10 25 29
7 TERM-VII. 13 0 2 16 15
8 TERM-VIII. - - - 8 0
TOTAL CREDITS 160

CSA, SSET, SU Page 9

 Course Modules

TERM-I

CSA, SSET, SU Page 10

Syallabus: Programming for problem solving
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code CSE113
2 Course Title Programming for problem solving
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status Core
5 Course Objective 1. Learn basic programming constructs - data types,
decision structures, control structures in C
2. learning logic aptitude programming in c language
3. Developing software in c programming
6 Course Outcomes Students will be able to:
CO1: demonstrate the algorithm, Pseudo-code and flow
chart for the given problem.
CO2: develop better understanding of basic concepts of
C programming.
CO3: create and implement logic using array and
function.
CO4: construct and implement the logic based on the
concept of strings and pointers.
CO5: apply user-defined data types and I/O operations
in file.
CO6: design and develop solutions to real world
problems using C.

7 Course Description Programming for problem solving gives the Understanding

of C programming and implement code from flowchart or
algorithm
8 Outline syllabus CO
Mapping
Unit 1 Logic Building
A Flowchart: Elements, Identifying and CO1
understanding input/ output, Branching and
iteration in flowchart
B Algorithm design: Problem solving approach(top CO1
down/bottom up approach)
C Pseudo Code : Representation of different CO1
construct, writing pseudo-code from algorithm
and flowchart
Unit 2 Introduction to C Programming
A Introduction to C programming language, Data CO2,
types, Variables, Constants, Identifiers and CO6
keywords, Storage classes

CSA, SSET, SU Page 11

 B Operators and expressions, Types of Statements: CO2,
Assignment, Control, jumping. CO6
C Control statements: Decisions, Loops, break, CO2,
continue CO6
Unit 3 Arrays and Functions
A Arrays: One dimensional and multi-dimensional CO3,
arrays: Declaration, Initialization and array CO6
manipulation (sorting, searching).
B Functions: Definition, Declaration/Prototyping CO3,
and Calling, Types of functions, Parameter CO6
passing: Call by value, Call by reference.
C Passing and Returning Arrays from Functions, CO3,
Recursive Functions. CO6
Unit 4 Pre-processors and Pointers
A Pre-processors: Types, Directives, Pre- CO4,
processors Operators (#,##,\) , Macros: Types, CO6
Use, predefined Macros
B Pointer: Introduction, declaration of pointer CO4,
variables, Operations on pointers: Pointer CO6
arithmetic, Arrays and pointers, Dynamic
memory allocation.
C String: Introduction, predefined string functions, CO4,
Manipulation of text data, Command Line CO6
Arguments.
Unit 5 User Defined Data Types and File Handling
A Structure and Unions: Introduction, Declaration, CO5,
Difference, Application, Nested structure, self- CO6
referential structure, Array of structures, Passing
structure in function.
B Files: Introduction, concept of record, I/O CO5,
Streaming and Buffering, Types of Files: Indexed CO6
file, sequential file and random file,
C Creating a data file, Opening and closing a data CO5,
file, Various I/O operations on data files: Storing CO6
data or records in file, adding records, Retrieving,
and updating Sequential file/random file.
Mode of examination Theory/Jury
Weightage Distribution CA MTE ETE
25% 25% 50%
Text book/s* Kernighan, Brian, and Dennis Ritchie. The C
Programming Language
Other References 1. B.S. Gottfried - Programming With C -
Schaum's Outline Series - Tata McGraw Hill
2nd Edition - 2004.
2. E. Balagurusamy - Programming in ANSI C -
Second Edition - Tata McGraw Hill- 1999

CSA, SSET, SU Page 12

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)

1. CO1: demonstrate the algorithm, Pseudo-code and flow PO1,PO2,PO3, PO9, PSO1,PSO2
chart for the given problem.

2. CO2: develop better understanding of basic concepts of C PO1,PO3, PO4, PO5, PO9,
programming. PO11,PSO1,PSO2
.
3. CO3: : create and implement logic using array and PO1,PO3,PO4, PO9, PSO2
function.

4. CO4: construct and implement the logic based on the PO1,PO3,PO4, PO9, PSO2
concept of strings and pointers.

5. CO5: apply user-defined data types and I/O operations in PO1,PO3,PSO2

file.

6 CO6: design and develop solutions to real world problems PO1,PO2,PO3,PO4,PO9, PO11,PSO1
using C. PSO2,PSO3

PO and PSO mapping with level of strength for Course Name Programming for problem
solving (Course Code CSE 113)

PO PO PO PO PO PO PO PO PO PO PO PO
PSO1 PSO2 PSO3
1 2 3 4 5 6 7 8 9 10 11 12

CO1 1 2 2 _ _ - _ _ 2 _ _ _ 1 2 _

CO2 2 _ 3 2 2 - _ _ 1 _ 1 _ 2 2 _

CO3 3 _ 2 1 _ _ _ _ 3 _ _ _ _ 2 _

CO4 1 _ 2 1 _ _ _ _ 1 _ _ _ _ 3 _

CO5 1 _ 1 _ _ _ _ _ _ _ _ _ _ 1 _

CO6 3 3 3 2 - - _ _ 2 _ 2 _ 2 3 1

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

Cours P P P P P
PSO
e Course Name PO 1 PO2 PO 3 PO 4 PO 5 O O O PO 9 O PO 11 O PSO 1 PSO 3
2
Code 6 7 8 10 12
Programmi
CSE11 ng for 1.8 2.5 2.1 1.5 2.0 1.8 1.5 1.6 2.1 1.0
3 problem 3 0 7 0 0 0 0 7 7 0
solving

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

CSA, SSET, SU Page 13

3. Addressed to Substantial (High=3) extent

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code MTH 142
2 Course Title Calculus and Abstract Algebra
3 Credits 4
4 Contact 3-1-0
Hours
(L-T-P)
Course Compulsory
Status
5 Course The objective of this course is to familiarize the prospective engineers
Objective with techniques in basic calculus and linear algebra. It aims to equip the
students with standard concepts and tools at an intermediate to
advanced level that will serve them well towards tackling more
advanced levels of mathematics and applications that they would find
useful in their disciplines.
6 Course CO1: Explain the concept of differential calculus, illustrate the
Outcomes curvature and Maxima, minima and saddle point. (K2, K3, K4)
CO2: Explain the basic concepts matrices and determinant, evaluate
system of linear equations by using rank and inverse method. (K2, K3,
K5)
CO3: Explain the basic concept of sets, relation, functions, groups
Rings and Field. (K2, K4)
CO4: Discuss the basic of Vector spaces. (K1, K3)
CO5: Describe and use the linear transformation and evaluate nullity
and kernel. (K1, K2, K3, K5)
CO6:Explain the concept of Eigen values and Eigen vectors; evaluate
the diagonalization of matrices, explain the basic introduction of Inner
product spaces.(K2, K3, K4, K5)
7 Course This course is an introduction to the fundamentals of Mathematics.
Description The primary objective of the course is to develop the basic
understanding of differential and integral calculus, linear Algebra and
Abstract Algebra.
8 Outline syllabus: Calculus and Abstract Algebra CO
Mapping
Unit 1 Calculus
A Differentiation, Taylor’s and Maclaurin theorems with CO1
remainders; indeterminate forms, L' Hospital's rule.

Maxima and minima, Partial derivatives, Euler’s CO1

B theorem.

CSA, SSET, SU Page 14

 C Total derivative. Evaluation of double integration. CO1
Applications of double integral (to calculate area).

Unit 2 Matrices
A Matrices, vectors: addition and scalar multiplication, CO2
matrix multiplication.
B Linear systems of equations, linear Independence, rank CO2
of a matrix, determinants, Cramer’s Rule
C Inverse of a matrix, Gauss elimination and Gauss- CO2
Jordan elimination.

Unit 3 Basic Algebra

A Sets, relations and functions. CO3
B Basics of groups, cyclic groups. CO3
C Subgroups, basics of Rings and Field. CO3
Unit 4 Vector spaces
A Vector Space, linear dependence of vectors, basis, CO4, CO5
dimension.
B Linear transformations (maps), range and kernel of a CO4, CO5
linear map, rank and nullity.
C Inverse of a linear transformation, Matrix associated CO4, CO5
with a linear map.
Unit 5 Vector spaces (Prerequisite Module 2 –Matrices &
Module-4 Vector spaces)
A Eigenvalues, Eigenvectors CO6
B Symmetric, skew-symmetric, and orthogonal Matrices, CO6
Diagonalization
C Basic introduction of Inner product spaces, Gram- CO6
Schmidt orthogonalization.
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. G.B. Thomas and R.L. Finney, Calculus and
Analytic geometry, 9th Edition, Pearson, Reprint, 2002.
2. Erwin Kreyszig, Advanced Engineering
Mathematics, 9th Edition, John Wiley & Sons, 2006.
Other 1. D. Poole, Linear Algebra: A Modern Introduction,
References 2nd Edition, Brooks/Cole, 2005.
2. Veerarajan T., Engineering Mathematics for first
year, Tata McGraw-Hill, New Delhi, 2008.
3. Ramana B.V., Higher Engineering Mathematics,
Tata McGraw Hill New Delhi, 11th Reprint, 2010.
4. V. Krishnamurthy, V.P. Mainra and J.L. Arora, An
introduction to Linear Algebra, Affiliated East–West
press, Reprint 2005.

\
CSA, SSET, SU Page 15
]COURSE OUTCOMES – PROGRAMME OUTCOMES MAPPING TABLE
PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO
CO1 3 3 2 2 3 1 - - - 1 1 1
CO2 3 3 3 2 2 2 - - - 1 1 2
CO3 3 3 2 2 2 1 - - - 1 1 1
CO4 3 3 2 2 2 1 - - - 1 1 1
CO5 3 3 2 2 2 1 - - - 1 1 2
CO6 3 3 2 3 2 2 - - - 1 1 2

CSA, SSET, SU Page 16

PHY125 Engineering Physics-I
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code PHY125
2 Course Title Engineering Physics-I
3 Credits 4
4 Contact 3-1-0
Hours (L-T-
P)
Course Status Compulsory
5 Course To make students proverbial with the fundamental concepts of
Objective Semiconductors materials and electromagnetism and their real-life
applications for configuring various electronics devices.
6 Course After the completion of this course,
Outcomes CO1: Students will learn the fundamental concepts of mobility,
conductivity, electrons and holes in an intrinsic semiconductors, Donor and
Acceptor impurities (n-type and p-type semiconductor), Fermi levels etc.
Students will gain knowledge about the formation of depletion region,
barrier potential, Zener diode, Characteristics of Zener diode etc.
CO2: Students will have a clear understanding of Coherent sources,
interaction of radiation with matter (spontaneous and stimulated emission),
Einstein’s relation, population inversion and pumping, Ruby LASER, He-
Ne Laser and semiconductor Laser.
CO3: Students will show that they have learned the basics of fiber optics,
Holography and its applications.
CO4: Students will be able to understand the significance and applications
of Maxwell’s equations.
CO5: Students will be able to know about the short comings of classical
physics and will learn various quantum mechanical principles.
CO6: Student will be familiar with the essential concepts of Semiconductors
materials technology and their applications in industries.

7 Course This course provides the basic foundation for understanding electronic
Description semiconductor devices and their applications and limitations. It has
introductory elements of various concept of material science. This course is
essential for students who desire to specialize their engineering in Computer
Sciences, Electronics, and Electronics and Electrical engineering.
8 Outline Syllabus CO
Mappi
ng
Unit 1 Semiconductor Physics
A Classification of Solids on the basis of energy band, electrons and CO1
holes concentration in intrinsic semiconductors, Fermi levels,
Mobility, conductivity,

CSA, SSET, SU Page 17

 B Donor and Acceptor impurities (n-type and p-type semiconductor), CO1
Drift and diffusion current, Hall effect,
C p-n junction, types of p-n junction (step-graded and Linearly-graded CO1,
junction), formation of depletion region, barrier potential, Zener CO6
diode, Avalanche and Zener breakdown.
Unit 2 Laser Physics and optoelectronic Sources
A Coherent sources, interaction of radiation with matter (spontaneous CO2
and stimulated emission), Einstein’s relation,
B population inversion and pumping, active components of laser, CO2,
optical amplification or gain, threshold condition for laser action, CO6
Ruby and He-Ne lasers.
C Optoelectronic sources: Light emitting diode (construction, basic CO2,
working principle), semiconductor laser (construction, basic working CO6
principle)
Unit 3 Fiber Optics and Holography
A Introduction, structure of optical fiber, Light guidance through optical CO3
fiber, Acceptance angle and Acceptance cone, Numerical aperture,
B Types of optical fibers, Attenuation and Dispersion in optical fiber, CO3,
Applications of optical fibers. CO6
C Basic principle of holography, Recording of holograms, CO3,
Reconstruction process, Applications of holography. CO6
Unit 4 Electromagnetism
A Gauss’s theorem and its applications, Electric potential, and potential CO4
difference, Biot-Savart law and its application to current carrying
circular loop
B Ampere’s law and its applications to infinitely long straight wire, and CO4
solenoids. Electromagnetic induction; Faraday’s law
C Maxwell’s equations in free space and dielectric media, CO4
Electromagnetic waves.
Unit 5 Quantum Mechanics
A Inadequacy of classical Physics, Wave particle duality, de-Broglie CO5
wavelength,
B CO5,
Davisson-Germer experiment, Schrodinger wave equation,
CO6
C CO5,
particle in a 1-dimensional box, harmonic oscillator problem,
CO6
Mode of Theory
Examinati
on
Weightag CA MTE ETE
e 25% 25% 50%
Distributi
on
Text Integrated Electronics- Millman - Halkias, Tata Mc Graw Hill
books
Other 1. Semiconductor Devices Physics and Technology- S M Sze,
Reference John Wiley & Sons
s 2. Semiconductor physics and devices: basic principles- Donald
A. Neamen.
CSA, SSET, SU Page 18
 3. Laser and non-linear optics by B.B. laud, New Age Int.
4. Semiconductor Devices- Kanaan Kano, Pearson Education.
5. Electronics devices and circuit theory by R.L. Boylestad,
Pearson.
6. Introduction to Electrodynamics, David J. Griffiths, Pearson
Cambridge University Press
7. Fundamentals of Electricity and Magnetism, D. N. Vasudeva,
S. Chand & Co. New Delhi
8. Fundamentals of Physics, Halliday, Resnick and Walker, John
Wiley.
9. Concepts of Modern Physics, Beiser Arthur, McGraw-Hill
Education

Mapping of CO vs. POs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 2 1 1 1 2 1 1 1
CO2 3 3 2 3 3 2 1 1 1 1 1 1
CO3 3 3 2 3 3 2 1 1 1 1 1 1
CO4 3 3 3 2 3 2 1 1 1 1 1 1
CO5 3 3 3 2 3 2 1 1 1 1 1 1
CO6 3 3 3 3 3 2 1 1 1 1 1 1

CSA, SSET, SU Page 19

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Department of Computer Science and pplications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code ARP101
2 Course Title Communicative English-1
3 Credits 2
Contact
4 Hours (L-T- 1-0-2
P)

To minimize the linguistic barriers that emerges in varied socio-

linguistic environments through the use of English. Help students to
Course understand different accents and standardise their existing English.
5
Objective Guide the students to hone the basic communication skills - listening,
speaking, reading and writing while also uplifting their perception of
themselves, giving them self-confidence and building positive
attitude.
After completion of this course, students will be able to:

CO1 Develop a better understanding of advanced grammar rules and

write grammatically correct sentences

CO2 Acquire wide vocabulary and punctuation rules and learn

strategies for error-free communication.

CO3 Interpret texts, pictures and improve both reading and writing
skills which would help them in their academic as well as professional
career
Course
6
Outcomes CO4 Comprehend language and improve speaking skills in
academic and social contexts

CO5 Develop, share and maximise new ideas with the concept of
brainstorming and the documentation of key critical thoughts
articulated towards preparing for a career based on their potentials
and availability of opportunities.

CO6 Function effectively in multi-disciplinary teams through the

knowledge of team work, Inter-personal relationships, conflict
management and leadership quality

The course is designed to equip students, who are at a very basic level of
language comprehension, to communicate and work with ease in varied
Course
7 workplace environment. The course begins with basic grammar structure
Description and pronunciation patterns, leading up to apprehension of oneself through
written and verbal expression as a first step towards greater employability.

CSA, SSET, SU Page 20

 8 Outline syllabus – ARP 101
CO
Unit A Sentence Structure
Mapping
Topic 1 Subject Verb Agreement
CO1
Topic 2 Parts of speech
Topic 3 Writing well-formed sentences

Unit B Vocabulary Building & Punctuation

CO1,
Topic 1 Homonyms/ homophones, Synonyms/Antonyms
CO2
CO1,
Topic 2 Punctuation/ Spellings (Prefixes-suffixes/Unjumbled Words)
CO2
CO1,
Topic 3 Conjunctions/Compound Sentences
CO2
Unit C Writing Skills
Topic 1 Picture Description – Student Group Activity CO3
Positive Thinking - Dead Poets Society-Full-length feature film - Paragraph
CO3,
Writing inculcating the positive attitude of a learner through the movie |
Topic 2 SWOT Analysis – Know yourself
CO2,
CO3
Story Completion Exercise –Building positive attitude - The Man from CO2,
Topic 3 CO3
Earth (Watching a Full length Feature Film )
Topic 4 Digital Literacy | Effective Use of Social Media CO3
Unit D Speaking Skill
Topic 1 Self-introduction/Greeting/Meeting people – Self branding CO4
Describing people and situations - To Sir With Love ( Watching a Full CO4
Topic 2
length Feature Film )
Topic 3 Dialogues/conversations (Situation based Role Plays) CO4
Unit E Professional Skills | Career Skills
CO4,
Topic 1 Exploring Career Opportunities
CO5
CO4,
Topic 2 Brainstorming Techniques & Models
CO5
CO4,
Topic 3 Social and Cultural Etiquettes CO5
CO4,
Topic 4 Internal Communication
CO5
Leadership and
Unit F
Management Skills
CO6
Topic 1 Managerial Skills

CO6
Topic 2 Entrepreneurial Skills
Class Assignments/Free Speech Exercises / JAM Group
9 Evaluations Presentations/Problem Solving Scenarios/GD/Simulations 25% CA 25% N/A
MTE and 50% ETE
Texts & • Blum, M. Rosen. How to Build Better Vocabulary. London: Bloomsbury
References Publication
10
| Library • Comfort, Jeremy (et.al). Speaking Effectively. Cambridge University Press
Links

CSA, SSET, SU Page 21

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 - - - - - - - - 1 3 2 - - -
CO2 - - - - - - - - 1 3 2 - - -
CO3 - - - - - - - - 1 3 2 - - -
CO4 - - - - - - - - 1 2 1 2 - - -
CO5 - - - - - - - - 1 2 1 2 - - -
CO6 - - - - - - - - 1 2 1 2 - - -

CSA, SSET, SU Page 22

1. Course : Environmental Science

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code CVL103
2 Course Title Environmental Science
3 Credits 0
4 Contact 2-0-0
Hours
(L-T-P)
Course Status Compulsory
5 Course 1. Enable students to learn the importance of environmental studies, population
Objective growth and sustainable development
2. Provide students an insight to different aspects related to water i.e. water
resources, pollution and its control
3. Provide knowledge about air resources i.e. atmosphere, atmospheric
pollution, control of air pollution and climate change
4. Provide detailed knowledge about land resources, pollution and
management of solid wastes
5. Provide and enrich the students about other natural resources i.e. energy,
mineral and food resources and biodiversity and its conservation
6 Course CO1. Understand the scope of environmental study and knowledge about
Outcomes population growth and its effects on environment and health and sustainable
development
CO2. Comprehend different aspects related to water i.e. water resources,
pollution and its control
CO3. Understand different aspects related to air resources i.e. atmosphere,
atmospheric pollution, control of air pollution and climate change
CO4. Appreciate and comprehend land resources, pollution and
management of solid wastes
CO5. Understand about other natural resources i.e. energy, mineral and food
resources and biodiversity and its conservation
CO6. Understand overall environmental issues and their ways of their
effective management
7 Course Environmental Studies emphasises on various aspects related to environment,
Description its degradation and control measures such as:
1. Population and Environment; Sustainable Development
2. Water: Resources, Pollution and Control
3. Air: Atmosphere, Pollution, Control and Climate Change
4. Land: Resources, Pollution and Management
Energy, Mineral and Food Resources and Biodiversity and its Conservation
8 Outline syllabus CO
Mapping
Unit 1 Introduction to the course, Population and Environment
and Sustainable Development
A Environmental Studies: Background; Definition; CO1, CO6
Objectives; Scope; Major environmental issues of concern;
Multidisciplinary nature of Environmental Studies

CSA, SSET, SU Page 23

 B Human Population and Environment: Population growth/ CO1, CO6
explosion and its effects on human health and environment
C Sustainable Development: Definition; Aim; Sustainability CO1, CO6
Development Goals (SDGs); Sustainability issues at
various levels; Examples/ sustainability initiatives; Pillars
of sustainable development; Desired outcomes
Unit 2 Water: Resources, Pollution and Control
A Water Resources: Water cycle; Total water on earth; CO2, CO6
Residence time of water in different compartments;
Classification of waters as per salt content; Stresses on
water resources/ water crises; Water conservation; Water
conflicts
B Water Pollution: Impurities in water; Water quality CO2, CO6
parameters; Standards; Major categories of water
pollutants and their sources and effects; Surface water
versus groundwater quality; Point and non-point sources;
Pollution of (i) fresh water streams (DO sag curve/ self-
purification), (ii) lakes, (iii) groundwater/ aquifers, and (iv)
oceans
C Water: Resources, Pollution and Control
Unit 3 Air: Atmosphere, Pollution, Control and Climate Change
A Atmosphere: Composition and structure; Classification of CO3, CO6
pollutants; Air pollution: sources and effects on humans,
plants and materials; AQI and how it is calculated, Plume
shapes
B Air Pollution Control: Laws; Modifications in fuels and CO3, CO6
engines; Ambient air quality control; Control equipment’s
(in vehicles and industry); Stack height
C Climate Change: Global warming and greenhouse effect; CO3, CO6
Ozone layer depletion and its consequences; Climate
Change and its impact on ecosystem; International
agreements
Unit 4 Land: Resources, Pollution and Management
A Land Resources: Importance; Soil and its formation; Soil CO4, CO6
profile; Land degradation: causes and effects; Soil
conservation through sustainable agriculture
B Soil/ Land Pollution: Major categories of soil pollutants: CO4, CO6
sources and effects
C Solid Waste Management: Classification of solid wastes; CO4, CO6
Engineering systems for management; Methods of
treatment; Bio-medical wastes; Non-degradable wastes;
Hazardous wastes; Electronic wastes; Plastic wastes etc.
Unit 5 Energy, Mineral and Food Resources and Biodiversity
and its Conservation
A Energy Resources: Conventional and non-conventional; CO5, CO6
Non-renewable and renewable; Fossil fuels: coal,
petroleum and natural gas; Solar and wind energy
B Mineral, Forest and Food Resources: (i) Minerals - CO5, CO6
Definition; Importance; Minerals in our diet, Metallic and
non-metallic minerals, (ii) Forest - Direct and indirect
benefits; Depletion of forest resources: causes and effects;
and, (iii) Food - Three main calorie providers; Green
revolution

CSA, SSET, SU Page 24

 C Biodiversity and its Conservation: Definition; Threats to CO5, CO6
biodiversity; Extinct, endangered and endemic species;
Conservation of biodiversity
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Joseph, Benny, “Environmental Studies”, Tata Mcgraw-
Hill.
2. .Howard S. Peavy, Donald R. Rowe, George
Tchobanoglous. Environmental engineering Mc Graw-
Hill, 1985
Other NA
References

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 2 1 - 1 1 1 - - -
CO2 1 2 2 1 - 1 2 - - 1 1 - - - -
CO3 1 2 2 1 - 2 2 - - 1 2 - - - -
CO4 1 2 2 1 - 2 2 - - 1 2 - - - -
CO5 1 2 2 1 1 2 1 2 - 1 2 - - - -
CO6 1 2 2 2 1 2 2 1 - 1 2 1 - - -

CSA, SSET, SU Page 25

Syllabus: CSP 113: Programming for problem solving Lab

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code CSP113
2 Course Title Programming for problem solving Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Status Compulsory
5 Course 1. Learn basic programming constructs –data types, decision
Objective structures, control structures in C
2. learning logic aptitude programming in c language
3. Developing software in c programming
6 Course Students will be able to:
Outcomes CO1: Implement core concept of c Programming
CO2: develop programs using Array and String
CO3: create Functions for any problem
CO4: Use Union and Structure to write any program
CO5: implement concept of Pointers
CO6: design a real world problem with the help of c
programming
7 Course Programming for problem solving gives the Understanding of C
Description programming and implement code from flowchart or algorithm.
8 Outline syllabus CO Mapping
Unit 1 Logic Building CO1, CO6
Draw flowchart for finding leap year
Write a c Program to Add Two Integers
Write a program to create a calculator
Unit 2 Introduction to C Programming CO2, CO6
Write a c program to convert length meter to cm
Write a c program to convert temp
Write a c program to swap two numbers
Unit 3 Arrays and Functions CO3, CO6
Write a c program to calculate the average using
arrays
Write a c program to find the largest element of the
array
Unit 4 Pre-processors and Pointers CO4, CO6
Write a c program to swap two values using pointers
Write a c program to find largest number from array
using pointers
Unit 5 User Defined Data Types and File Handling CO5, CO6

CSA, SSET, SU Page 26

 Write a c program to store information of a student
using structure
Write a c program to store information of a student
using union
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* Kernighan, Brian, and Dennis Ritchie. The C
Programming Language
Other 1. B.S. Gottfried - Programming With C - Schaum's
References Outline Series - Tata McGraw Hill 2nd Edition -
2004.
2. E. Balagurusamy - Programming in ANSI C - Second
Edition - Tata McGraw Hill- 1999

Course outline
This course implements array and pointer and Recursive applications. The course talks
primarily about Array, string, functions, structure & union and Pointers etc.

Course Evaluation
Attendance 75%
Any other CA judged on the practicals conducted in the lab , weightage may be specified
References
Text book Kernighan, Brian, and Dennis Ritchie. The C Programming Language
Other References 1. B.S. Gottfried - Programming With C - Schaum's Outline Series - Tata McGraw
Hill 2nd Edition - 2004.
2. E. Balagurusamy - Programming in ANSI C - Second Edition - Tata McGraw Hill-
1999
Softwares Turbo C

PO and PSO mapping with level of strength for Course Name Programming for problem
solving Lab (Course Code CSP113)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s 3
PO4 PSO2 PSO3
Course Name 1 2 5 6 7 8 9 10 11 12 1
CO1 2 - 3 2 2 - - - 2 - - - 3 2 2

CO2 3 - 3 2 2 - - - 3 - - - 3 3 1
CSP113_
Programming CO3 2 - 3 1 2 - - - 2 - - - 2 3 2
for problem CO4 1 - 2 1 1 - - - 2 - - - 2 2 -
solving Lab
CO5 2 - 3 2 2 - - - 3 - - - 3 2 2

CO6 3 - 3 3 1 - - - 2 - - - 2 3 2

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

P P P P P P
Cours PO
Course Name PO 1 PO 3 PO 4 PO 5 O O O PO 9 O O O PSO 1 PSO 2 PSO 3
e Code 2
6 7 8 10 11 12

CSP11 Programmin 2.1 2.8 1.8 1.6 2.3 2.5 2.5 1.8
3 g for
- - - - - -
7 3 3 7 3 0 0 0

CSA, SSET, SU Page 27

 problem
solving Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 28

Syllabus: CSP 101: Introduction to Computer Science and Applications

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code CSP101 Course Name: Introduction to Information Technology
2 Course Title Introduction to Information Technology
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course UG
Status
5 Course 1. To familiarize the students about the importance of
Objective Undergraduate course on Information Technology and
Application.
2. To discuss recent developments in hardware and software
environments.
3. To focus future application areas of information technology
4. To discuss various research and development options in
information technology
6 Course The student should be able to:
Outcomes CO1: Understand the technical aspects of Information Technology
Course.
CO2: Perceive some knowledge about programming in various
applications.
CO3: Acquire basic understanding about computer networking and
related technology.
CO4: Enhance some fundamental knowledge of DBMS including
application areas.
CO5: Understand the current trends in computing in discovering
wisdom/knowledge and future prediction.
7 Course This course focuses on application areas of information technology for
Description students admitted in undergraduate programs. The purpose of B. Tech. in
Information Technology is to be given through this course to students.
8 Outline syllabus CO Mapping
Unit 1 Hardware aspect of Information Technology
A History of Computing Systems, Computer Basics
and Computer Organization.
B Computer Architecture, Introduction to various CO1
connecting devices.
C Recent additions – IoT, Robotics and new
alternate architectures.
Unit 2 Programming Aspects

CSA, SSET, SU Page 29

 A Basics of Programming, Programming Paradigms,
System Software versus Application Software.
B Hard Computing versus Soft Computing, Data
CO2
Structures and Algorithms.
C Computer Graphics, Multimedia, Computer
Vision.
Unit 3 Computer Networking
A Introduction to Networking, Various
terminologies, Client Server Technology, Web
Technology.
B Introduction to data/network security and current CO3
trends.
C Concept of Cloud Computing and Virtualization,
Real life applications.
Unit 4 Database Management Systems
A Introduction to DBMS, DBMS versus File
System, Relational DBMS.
CO4
B Information Processing and Retrieval
C Big Data Analytics & Scientific Computing
Unit 5 Artificial Intelligence
A Basics of Artificial Intelligence
B Basics of Pattern Recognition CO5
C Basics of Machine Learning
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Introduction to Computer, Peter Norton, 7/e, 2017, Tata
McGraw Hill Publishing.
Other
References 1. Foundations of Computer Science, B A Forouzan & F Mosharraf,
2/e, 2008, Delmar Learning.

CO and PO Mapping
S. No. Course Outcome Programme
Outcomes (PO) &
Programme Specific
Outcomes (PSO)
1. CO1: Understand the technical aspects of Information PO1, PO2, PO12,
Technology Course. PSO3
2. CO2: Perceive some knowledge about programming in PO1, PO12, PSO1,
various applications. PSO3
3. CO3: Acquire basic understanding about computer PO1, PO2, PO12,
networking and related technology. PSO2, PSO3
4. CO4: Enhance some fundamental knowledge of DBMS PO1, PO12, PSO2,
including application areas. PSO3

CSA, SSET, SU Page 30

 5. CO5: Understand the current trends in computing in PO1, PO6, PO8,
discovering wisdom/knowledge and future prediction. PO12, PSO2, PSO3

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
3 2 - - - - - - - - - 3 3 - 3
1
CO
3 2 - - - - - - - - - 3 - 3 2
2
CO
3 2 - - - - - - - - - 3 - 2 3
3
CO
3 - - - - - - - - - - 3 - 3 2
4
CO
3 - - - - 2 - 2 - - - 3 - 3 3
5
CO
3 2 - - - - - - - - - 3 - 2 3
6

CSA, SSET, SU Page 31

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code MEP 106
2 Course Title Computer Aided Design & Drafting Laboratory
3 Credits 1.5
4 Contact Hours 0-0-3
(L-T-P)
Course Status Compulsory
5 Course Objective The objective of this introductory course is to make students familiar with
computer-aided drafting/ design, introduce them to the basic commands,
tools and dimension techniques for creation and presentation of various
engineering drawings by using AutoCAD software which helps in
visualization and problem solving in engineering disciplines.

6 Course Outcomes After successful completion of this course the student will be able to
CO1: Understand the fundamental features of AutoCAD workspace and
user interface.
CO2: Apply the fundamental tools such as draw, edit, and view for creating
two dimensional engineering drawings in AutoCAD.
CO3: Choose advanced features to present an engineering drawing in
AutoCAD.
CO4: Apply text and dimension features in the engineering drawing.
CO5: Create different orthographic projections from a pictorial view.
CO6: Analyze an engineering drawing and use the software packages for
drafting and modeling.
7 Course This introductory course is offered to students to make them proficient in
Description design, layout, product development, and other careers that require
technical drawing. Using the current version of the AutoCAD software,
students will learn a variety of drawing techniques and be able to replicate
specific drawings in multiple perspectives. The pinnacle of the class is to
empower and enable students to create using the software provided. Career
opportunities in 3D modeling, manufacturing, and engineering will also be
explored. No drafting or computer experience is necessary.
8 Outline syllabus CO Mapping
List of
Experiments
Experiment 1 Introduction to AutoCAD and its interface CO1
Experiment 2 Working with coordinates, Drawing offline, circle,
CO2
arc, polygon and creating sketches
Experiment 3 Editing of drawing by using editing Tools and Power
CO2
tools
Experiment 4 Creating of advanced feature like fillet, chamfer, hatch
CO3
and using of block
Experiment 5 Representing text and dimensioning in AutoCAD CO4
Experiment 6 Creating the drawings of mechanical components by
CO2, CO3
using AutoCAD features.
Experiment 7 Creating the electrical circuit drawings in AutoCAD. CO2
Experiment 8 Drawing plan and elevation of various buildings in
CO2, CO4
AutoCAD.

CSA, SSET, SU Page 32

 Experiment 9 Creating the drawing of renowned constructions such
CO3
as Taj Mahal in AutoCAD
Experiment 10 Creating of orthographic projections from a pictorial
CO5
views

Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Ibrahim Zaid,"CAD/CAM- Theory and Practice", McGraw Hill,
International Edition.
Software AutoCAD

1.3.5.1 COURSE ARTICULATION MATRIX

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO 2 2 2 - 3 - - - - - - 3 3 3
1
CO 2 2 2 - 3 - - - - - - 3 3 3
2
CO 2 2 2 - 3 - - - - - - 3 3 3
3
CO 2 2 2 2 3 - - - 2 2 - 3 3 3
4
CO 2 2 2 2 3 - - - 2 2 - 3 3 3
5
CO 2 2 2 2 3 - - - 2 2 - 3 3 3
6

CSA, SSET, SU Page 33

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code MEP 105
2 Course Title Mechanical Workshop
3 Credits 1.5
4 Contact Hours 0-0-3
(L-T-P)
Course Status Compulsory
5 Course The objective of this course is to make the students familiar with the modern
Objective day manufacturing processes, introduce them to various hand tools and
equipment, acclimatize with the measuring devices, and perform basic
machine tool operations in various machine tools.
6 Course After successful completion of this course, students will be able to
Outcomes CO1: Apply 5S (Seiri, Seiton, Seiso, Seiketsu and Shitsuke) methodology
at work.
CO2: Select the various hand tools used in the basic mechanical engineering
workshop sections-smithy, carpentry, assembling, welding etc.
CO3: Choose different measuring devices according to the job
CO4: Differentiate between various machine tools and their operation
CO5: Classify and select suitable tools for machining processes including
turning, facing, thread cutting and tapping, milling, drilling and shaping.
CO6: Apply the knowledge for advanced manufacturing experiments.
7 Course Black Smithy Shop: Simple exercises based on black smithy operations
Description such as upsetting, practice of S -Hook from circular bar using hand forging
operations.
Carpentry Shop : Study of different types of wood , Carpentry Tools,
Equipment and different joints, Practice of T joint, cross lap joint, Mortise
and Tenon T joint, Bridle T joint
Fitting Shop: Preparation of Square joint, V joint, half round joint, dovetail
joint as per the given specifications, which contains: Sawing, Filing,
Grinding, and Practice marking operations.
Sheet Metal Shop: Study of galvanized Iron (G.I.) Sheet material
properties, hand tools and sheet metal machines, and projective geometry,
demonstration of different sheet metal operations and practice of
development of Tray, cylinder, hopper, funnel etc.
Welding Shop: Introduction, Study of Tools and welding Equipment (Gas
and Arc welding), Selection of welding electrode and current, Bead practice
and Practice of Butt Joint, Lap Joint.
Machine Shop: Study of machine tools in particular Lathe machine
(different parts, different operations, study of cutting tools), Demonstration
of different operations on Lathe machine, Practice of Facing, Plane Turning,
step turning, taper turning, knurling and parting and Study of Quick return
mechanism of Shaper.
Foundry Shop: Introduction to foundry, Patterns, pattern allowances,
ingredients of moulding sand and melting furnaces. Foundry tools and their
purposes, Demo of mould preparation and Practice – Preparation of mould
by using split pattern.

8 Outline syllabus CO Mapping

CSA, SSET, SU Page 34

 List of
Experiments
Experiment 1 To make a S shaped hook from a given
CO4
circular rod using hand forging technique.
Experiment 2 To make a dovetail lap joint in Carpentry
CO2,CO3
shop.
Experiment 3 To make a cross-half lap joint in Carpentry
CO2,CO3
shop.
Experiment 4 To make a square fit from the given mild
CO3,CO5
steel pieces in fitting shop.
Experiment 5 To prepare a V-Fit from the given mild steel
CO3, CO5
pieces in fitting shop.
Experiment 6 To make a rectangular tray of specified
CO2, CO5
dimensions in sheet metal shop.
Experiment 7 To make a Lap joint, using the given mild
CO3, CO5
steel pieces using arc welding.
Experiment 8 To perform step turning and taper turning
CO5
operations on the given work piece
Experiment 9 To prepare a sand mold, using the given
CO2
single piece pattern
Experiment 10 To prepare a sand mold, using the given
CO2
Split-piece pattern.
Mode of Practical
examination
Weight- age CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Raghuwanshi B.S., Workshop Technology Vol. I & II, DhanpathRai&
Sons.
2. Kannaiah P. and Narayana K.L., Workshop Manual, 2nd Edn, Scitech
publishers.
3. John K.C., Mechanical Workshop Practice. 2nd Edn. PHI 2010.
4. JeyapoovanT.andPranitha S., Engineering Practices Lab Manual, 3rd
Edn. Vikas Pub.2008.

Programme Outcome Vs. Courses Mapping Table:

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
1 - - - - 2 - - - - - 2 - - -
1
CO
1 - - - 1 2 - - - - - 1 1 - 1
2
CO
2 - 1 - 1 2 - - - - - 2 1 - 1
3
CO
2 - 1 - 2 2 - - - - - 2 1 - 1
4
CO
2 - 1 - 2 2 - - - - - 2 2 - 1
5
CO
2 - 1 - 2 2 - - - - - 2 2 - 1
6
2 - 1 - 2 2 - - - - - 2 2 - 1
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

CSA, SSET, SU Page 35

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester 1
1 Course Code PHY 162
2 Course Title Physics Lab
3 Credits 1
4 Contact Hours (L-T-P) 0-0-2
Course Status Compulsory
5 Course Objective To gain practical knowledge by applying the experimental methods to
correlate with the Physics theory.
6 Course Outcomes On successful completion of the course the students will have:
CO1: Knowledge and study of basic physics experiments based on
Semiconductors, energy band gap, planck constant etc.
CO2: Use the concept of electricity and magnetism to find out variation
of magnetic field through a current carrying coil and hall effect
CO3: Understand and learn how to determine specific resistance
CO4: Understand and perform laser-based experiments.
CO5: Knowledge and study of various optical experiments.
CO6: Apply the mathematical concepts/equations to obtain quantitative
results and ability to conduct, analyze and interpret experiments
7 Outline Syllabus CO
Mapping
Unit 1
A 1. To determine the Energy band gap of a CO1
B semiconductor using the Four Probe method.
C 2. To determine the variation of magnetic field along
the axis of a current carrying coil and estimate the
radius of the coil. CO2,CO6
3. To study Hall effect and determine the Hall
coefficient, carrier density and the mobility of a
semiconductor material

Unit 2
A 4. To draw the hysteresis curve (B-H curve) of a
B specimen in the form of a transformer on a C.R.O. CO2,CO6
C And to determine its hysteresis loss
5. To determine Planck's constant by measuring
radiation in a fixed spectral range.
6. To determine the specific resistance of the
material of a given wire using Carey Foster’s
bridge.

Unit3
A 7. To determine the diameter of thin wire by CO3,CO6
B diffraction using a laser.
C 8. To determine the wavelength of laser light by CO4,CO6
diffraction at a single slit.
9. To determine slit width of single and double slit by
using Laser.

Unit 4

CSA, SSET, SU Page 36

 A 10. To determine the wavelength of prominent lines
B of mercury by plane diffraction grating. CO4,CO6
11. To determine the wavelength of monochromatic
C light by Newton’s Ring method.

Unit 5
A 12. To determine the focal length of the combination of
B two lenses separated by a distance with the help of CO5,CO6
C a nodal slide and to verify the formula.
13. To verify Stefan’s Law.
CO5,CO6

Mode of Examination Practical/Viva

Weightage Distribution CA MTE ETE
25% 25% 50%
Text books 1. B.Sc. Practical Physics- Harnam Singh, S. Chand Publishing.
2. B.Sc. Practical Physics- C L Arora, S. Chand Publishing.
Other References 1. Geeta Sanon, BSc Practical Physics, 1st Edn. (2007), R. Chand &
Co.
2. B. L. Worsnop and H. T. Flint, Advanced Practical Physics, Asia
Publishing House, New

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1

CO1 2 2 2 1 1 1 2 3 3 3 2 3 2

CO2 2 2 2 1 1 1 2 3 3 3 2 3 2

CO3 2 2 2 1 1 1 2 3 3 3 2 3 2

CO4 2 2 2 1 1 1 2 3 3 3 2 3 2

CO5 2 2 2 1 1 1 2 3 3 3 2 3 2

CO6 2 2 2 1 1 1 2 3 3 3 2 3 2

CSA, SSET, SU Page 37

 TERM-II

CSA, SSET, SU Page 38

Syllabus for Application Based Programming in Python

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code CSE114
2 Course Title Application Based Programming in Python
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core
Status
5 Course Emphasis is placed on procedural programming, algorithm design, and
Objective language constructs common to most high-level languages through
Python Programming.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1. Demonstrate program by using decision and repetition structures
CO2. Construct programs by using Python lists, tuples and
dictionaries
CO3. Apply methods and functions to improve readability of
programs.
CO4. Develop logical problem using object-oriented programming
methodology.
CO5. Analyze and implement various tools, modules and packages for
python.
CO6. Design efficient logical solution for any given real life problem
by using concise and efficient algorithms
7 Course Python is a language with a simple syntax, and a powerful set of
Description libraries. It is widely used in many scientific areas for data
exploration. This course is an introduction to the Python programming
language for students without prior programming experience. We
cover data types, control flow, object-oriented programming.
8 Outline syllabus CO
Mapping
Unit 1 Introduction CO1
A Python Environment, Variables, Data Types,
Operators.
B Conditional Statements: If, If- else, Nested if-else.
Looping: For, While, Nested loops.
C Control Statements: Break, Continue, And Pass.
Comments
Unit 2 List, Tuple and Dictionaries CO1, CO2
A Lists and Nested List: Introduction, Accessing list,
Operations, Working with lists, Library Function and
Methods with Lists

CSA, SSET, SU Page 39

 B Strings: Introduction, Accessing items of a string,
Operations, Working, Library Functions and Methods
with strings.
Tuple: Introduction, Accessing tuples, Operations,
Working, Library Functions and Methods with Tuples.
C Sets: Introduction, Operations, Working, functions with
sets. Difference between set and lists.
Dictionaries :Introduction, Accessing values in
dictionaries, Working with dictionaries, Library
Functions
Unit 3 Functions and Exception Handling CO3
A Functions: Defining a function, Calling a function,
Types of functions, Function Arguments
B Anonymous functions, Global and local variables
C Exception Handling: Definition, Except clause, Try,
finally clause, User Defined Exceptions
Unit 4 OOP and File Handling CO4
A OOPs concept : Class and object, Attributes,
Abstraction, Encapsulation, Polymorphism and
Inheritance
B Static and Final Keyword, Access Modifiers and
specifiers, scope of a class
C File Handling: Introduction, File Operations
Unit 5 Application based programming CO5,CO6
A Modules & packages :Importing module, Math
module, Random module, creating Modules
B Introduction to Numpy, pandas, Matplotlib
C Applications: Searching Linear Search, Binary Search.
Sorting: Bubble Sort
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* The Complete Reference Python, Martin C. Brown,
McGraw Hill
Other 1. Introduction to computing in problem solving
References using Python, E Balagurusamy, McGraw Hill
2. Introduction to programming using Python, Y.
Daniel Liang, Pearson
3. Mastering Python, Rick Van Hatten, Packet
Publishing House
4. Starting out with Python, Tony Gaddis, Pearson

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) & Programme
No. Specific Outcomes (PSO)

CSA, SSET, SU Page 40

1. CO1. Demonstrate program by PO1,PO2,PO3,PO8,PO12,PSO2
using decision and repetition
structures
2. CO2. Apply methods and functions PO1,PO2,PO3,PO4,PO8,PO12,PSO2,PSO3
to improve readability of programs.
3. CO3. Construct programs by using PO1,PO2,PO3,PO8,PO12,PSO1, PSO2,PSO3
Python lists, tuples and
dictionaries
4. CO4. Develop logical problem PO1,PO2,PO3, PO4,PO5,PO6,PO8,
using object-oriented programming PO12,PSO1,PSO2,PSO3
methodology.
5. CO5. Analyze and implement PO1,PO2,PO3, PO4,PO5,PO6, PO8,
various tools, modules and PO12,PSO1,PSO2,PSO3
packages for python
6. CO6. Create efficient logical PO1,PO2,PO3, PO4,PO5,PO6, PO8,
solution for any given real life PO12,PSO1,PSO2,PSO3
problem by using concise and
efficient algorithms.

PO and PSO mapping with level of strength for Course Name Application Based
Programming in Python (Course Code CSE 114)

P P P P P P P P P P PS
Course Code_ CO’
O PO O PO O O O O O O O O O PSO PSO
Course Name s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 1 1 2 2 1

CO2 2 2 2 1 2 2 2 1
CSE114_Applicati
CO3 2 2 1 2 2 1 2 1
on Based
programming in
CO4 2 2 2 2 1 2 2 2 1 2 2
Python
CO5 2 2 2 2 3 2 2 2 2 2 1

CO6 3 3 2 2 2 2 2 2 2 3 2

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

P P P P P P P P
Cours Course
PO PO PO PO O O O O O O O O PS PS PS
e Code Name
1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
Application
CSE11 Based 2. 1. 1.
2 1 1 - 2 - - - 2 1 2 1.1
4 programmin 1 7 2
g in Python

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 41

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code CSP116 Course Name: Design & Creativity Lab
2 Course Title Design & Creativity Lab (DCL)
3 Credits 2
4 Contact Hours 1-0-2
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To align student to think out of box and identify a
realistic problem or project
2.To understand the significance of problem and its scope
3.To develop skills to frame small project for the defined
problem
6 Course Outcomes Students will be able to:
CO1: Identify and formulate problem statement using
systematic approach for real world/proposed problem.
CO2: Develop teamwork and problem-solving skills, along
with the ability to communicate effectively with others.
CO3: Design the problem solution as per the problem
statement framed.
CO4: Classify and understand project solution and design
solution parameters.
CO5: Fabricate the solution by using C programming/other
known programming.
CO6: Develop future work areas from the project outcome.
7 Course Description In DCL, the students will learn the fundamentals of defining
the problem, formulating the problem statement, identifying
the required skills for developing the solution based on a
given problem identified based on the understanding of
programming language studied in the previous semester or
known.
8 Outline syllabus CO
Mapping
Unit 1 Problem Definition, Formation of Teamwork and problem CO1, CO2
solving and Project Assignment.
Unit 2 Develop ability to communicate effectively and identify CO2,CO3
proposed problem.
Unit 3 Design proposed solution for identified problem CO3
statement.
Unit 4 Develop solution set under the guidance of a faculty CO3, CO4
member and obtain the appropriate results for defined
parameters.
Unit 5 Demonstrate and execute Project with the team. CO4, CO5,
Determine future work based on final outcome. CO6

CSA, SSET, SU Page 42

 Report should include Abstract, Hardware / Software
Requirement, Problem Statement, Design/Algorithm,
Solution Detail. Reports.
References if any.
The presentation, report, work done during the term
supported by the documentation, forms the basis of
assessment.

Mode of Practical /Viva

examination
Weight age CA MTE ETE
Distribution 25% 25 50%

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Identify and formulate problem statement PO1, PO2, PO4, PO9, PO10,
using systematic approach for real world/proposed PO11,
problem. PO12,PSO1,PSO2,PSO3
2. CO2: Develop teamwork and problem-solving PO1, PO2, PO4, PO7, PO9,
skills, along with the ability to communicate PO10, PO11, PO12 ,PSO3
effectively with others.
3. CO3: Design the problem solution as per the PO1, PO2, PO5, PO9, PO10,
problem statement framed. PO11, PO12, PSO1,PSO2
4. CO4: Classify and understand project solution and PO1, PO2, PO6, PO9, PO10,
design solution parameters. PO11, PO12,PSO2
5. CO5: Fabricate the solution by using C PO1, PO2, PO3, PO4,PO5,
programming/other known programming. PO6, PO7, PO8, PO9, PO10,
PO11, PO12 PSO1,PSO2,
PSO3
6. CO6: Develop future work areas from the project PO1, PO2, PO4, PO9, PO10,
outcome. PO11, PO12,PSO3

PO and PSO mapping with level of strength for Course Name Design & Creativity Lab
(Course Code CSP116)
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 3 - - - - 3 3 2 3 2 2 1
CO2 3 2 - 3 - - 2 - 3 3 2 3 1
CO3 3 2 - - 2 - - - 3 3 2 3 2 2
CO4 3 3 - - - 2 - - 3 3 2 3 2
CO5 3 3 2 2 2 2 3 3 3 3 2 3 2 2
CO6 3 3 - 3 - - - - 3 3 2 3 1

CSA, SSET, SU Page 43

 AvgPO
0.3 1.8 0.6 0.6 0.8
attaine 3 2.7 0.5 3 3 2 3 1 1.4 0.5
4 4 7 7 4
d

CSA, SSET, SU Page 44

Syllabus: CSP 114: Application based programming in Python Lab
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code CSP114
2 Course Title Application Based Programming in Python Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Status Compulsory
5 Course Emphasis is placed on procedural programming, algorithm design, and
Objective language constructs common to most high level languages through Python
Programming.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1: Develop programs based on procedural statements like assignments,
conditional statements and loops.
CO2: Compare and implement different data types of python.
CO3: Create programs by using function and function calls.
CO4: Formulate clear and accurate logical solution by using OOPS
CO5: Apply different modules, packages available in python.
CO6: Design real life situational problems and think creatively about solutions
of them.
7 Course Python is a language with a simple syntax, and a powerful set of libraries. It is
Description widely used in many scientific areas for data exploration. This course is an
introduction to the Python programming language for students without prior
programming experience. We cover data types, control flow, object-oriented
programming.
8 Outline syllabus CO Mapping

Unit 1 Practical based on conditional

statements and control structures
1. Program to implement all conditional CO1,C06
statements
2. Program to implement different
control structures
Unit 2 Practical related to List, Tuples and
dictionaries
1. Program to implement operations on CO2,CO6
lists
2. Program to implement operations on
Dictionary
3. Program to implement operations on
Tuple
Unit 3 Practical related to Functions and
Exception Handling

CSA, SSET, SU Page 45

 1. Program to implement Exception CO3,CO6
Handling
2. Program to use different functions
Unit 4 Practical related to Object Oriented
Programming
1. Program to use object oriented concepts like CO4,CO6
inheritance, overloading polymorphism etc.
2.Program for file handling
Unit 5 Practical related to Modules and
Applications
1.Program to use modules and package CO5,CO6
2.Program to implement searching and sorting
Mode of Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s*1. 1. The Complete Reference Python, Martin C.
Brown, McGraw Hill
Other 1. 1. Introduction to computing in problem solving
References using Python, E Balagurusamy, McGraw Hill
2. 2. Introduction to programming using Python, Y.
Daniel Liang, Pearson
3. 3. Mastering Python, Rick Van Hatten, Packet
Publishing House
4. 4. Starting out with Python, Tony Gaddis, Pearson

CO and PO Mapping

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

No. Outcomes (PSO)
1. CO1: Develop programs based on PO1,PO2,PO3,PO4,PO8,PO12,PSO2
procedural statements like
assignments, conditional
statements and loops.
2. CO2: Compare and implement PO1,PO2,PO3,PO4,PO5,PO8,PO12,PSO2,PSO3
different data types of python.
3. CO3: Create programs by using PO1,PO2,PO3,PO4,PO5,PO6,PO8,PO12,
function and function calls. PSO1,PSO2,PSO3
4. CO4: Formulate clear and accurate PO1,PO2,PO3,PO4,PO5,PO6,PO8,PO12,
logical solution by using OOPS PSO1,PSO2,PSO3
5. CO5: Apply different modules, PO1,PO2,PO3,PO4,PO5,PO6,PO8,PO12,
packages available in python. PSO1,PSO2,PSO3
6. CO6: Design real life situational PO1,PO2,PO3,PO4,PO5,PO6,PO8,PO12,
problems and think creatively PSO1,PSO2,PSO3
about solutions to them.

P PS
Course Code_ CO’
O PO PO PO PO PO PO PO PO PO PO PO O PSO PSO
Course Name s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 1 1 1 1 2 2 1

CSA, SSET, SU Page 46

 CO2 2 2 1 1 2 2 2 1 1

CSP114_Applicatio CO3 2 2 1 1 1 1 2 2 1 2 1
n Based
CO4 2 2 2 2 1 1 2 2 2 2 1
programming in
Python Lab CO5 2 2 2 2 2 2 2 2 2 2 2

CO6 3 3 2 2 2 3 2 2 2 2 2

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

Course PO PO PO PO PO PO PO PO PO
Course Name
Code 1 PO2 PO 3 4 5 PO 6 7 8 9 10 11 12 PSO1 PSO2 PSO3
Application
Based
CSP114 2 2 1.5 1.5 1.3 1.2 - 2 - - - 2 1.2 1.7 1.2
programming
in Python Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 47

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code MTH 145
2 Course Title Probability and Statistics
3 Credits 4
4 Contact Hours 3-1-0
(L-T-P)
Course Status Compulsory
5 Course The objective of this course is to familiarize the students with
Objective statistical techniques. It aims to equip the students with standard
concepts and tools at an intermediate to advanced level that will serve
them well towards tackling various problems in the discipline.
6 Course CO1: Explain the concept of probability and Random Variable.
Outcomes (K2,K3, K4)
CO2: Explain the concept of distribution functions, densities and
probability distributions; illustrate discrete and continuous probability
distributions. (K1, K2, K3, K4)
CO3: Describe the concept of moments, skewness and Kurtosis;
evaluate correlation and regression – Rank correlation; discuss
bivariate distributions and their properties. (K1, K2, K5)
CO4: Discuss the basic of Curve fitting by the method of least squares;
evaluate straight lines, second degree parabolas and more general
curves. (K1, K2, K5)
CO5: Describe and use the concepts test of significance: Large sample
test for single proportion, difference of proportions; calculate single
mean, difference of means, and difference of standard deviations.
(K1,K2,K3)
CO6: Explain the basic concepts of tests of small samples- Student’s
T test, Chi-square test for goodness of fit, and evaluate the result.
(K2, K4, K5)
7 Course
This course is an introduction to the fundamental of Mathematics. The
Description primary objective of the course is to develop the basic understanding
of statistics including measures of central tendency, correlation and
regression, statistical methods of data sampling, probability and
random variables and various discrete and continuous probability
distributions and their properties.
8 Outline syllabus :Probability and Statistics CO
Mapping
Unit 1 Basic Probability
A Probability spaces, conditional probability, Bayes' rule. CO1
CO1
Discrete random variables, Independent random
B variables

CSA, SSET, SU Page 48

 C Expectation of Discrete Random Variables, CO1
Chebyshev's Inequality
Unit 2 Discrete and Continuous Probability Distributions
A Discrete Probability distributions: Binomial, Poisson. CO2
B Continuous random variables and their properties, CO2
distribution functions and densities.
C Normal, exponential and gamma distribution. CO2
Unit 3 Statistics
A Moments, skewness and Kurtosis. CO3
B Correlation and regression – Rank correlation. CO3
C Bivariate distributions and their properties. CO3
Unit 4 Applied Statistics
A Curve fitting by the method of least squares- fitting of CO4, CO5
straight lines, second degree parabolas and more
general curves.
B Test of significance: Large sample test for single CO4, CO5
proportion,
C Difference of proportions, single mean, difference of CO4, CO5
means, and difference of standard deviations.
Unit 5 Testing Hypothesis
A Test for single mean, difference of means CO6
B test for ratio of variances CO6
C Chi-square test for goodness of fit and independence CO6
of attributes
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Erwin Kreyszig, Advanced Engineering
Mathematics, 9th Edition, John Wiley & Sons,
2006.
2. P. G. Hoel, S. C. Port and C. J. Stone, Introduction
to Probability Theory, Universal Book Stall, 2003
(Reprint).
3. S. Ross, A First Course in Probability, 6th Ed.,
Pearson Education India, 2002.

Other 1. W. Feller, An Introduction to Probability Theory

References and its Applications, Vol. 1, 3rd Ed., Wiley, 1968.
2. B.S. Grewal, Higher Engineering Mathematics,
Khanna Publishers, 35th Edition, 2000. Veerarajan
T., Engineering Mathematics (for semester III),
Tata McGraw-Hill, New Delhi, 2010.

CSA, SSET, SU Page 49

COURSE OUTCOMES – PROGRAMME OUTCOMES MAPPING TABLE
PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO
CO1 3 3 2 2 3 1 - - - 1 1 1
CO2 3 2 3 2 2 2 - - - 1 1 2
CO3 3 3 2 2 2 1 - - - 1 1 1
CO4 3 2 2 2 2 1 - - - 1 1 1
CO5 3 3 2 2 2 1 - - - 1 1 2
CO6 3 3 2 3 2 2 - - - 1 1 2

CSA, SSET, SU Page 50

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code EEE112
2 Course Title Principles of Electrical and Electronics Engineering
3 Credits 3
4 Contact 2-1-0
Hours
(L-T-P)
Course Status Compulsory
5 Course To provide the students with an introductory concept in the field of
Objective electrical and electronics engineering to facilitate better understanding of
the devices, techniques and equipment used in engineering applications.
6 Course CO1: To analyze and solve basic electrical circuits
Outcomes CO3: To understand the working principle of the transformer and
identify its applications.
CO3: To understand the working principle of dc and ac motors and
identify the starting methods of single phase induction motor
CO4: To apply the basics of diode to describe the working of rectifier
circuits such as half and full wave rectifiers
CO5: To apply the concepts of basic electronic devices to design
various circuits
CO6: Apply the basic concepts in Electrical and Electronics
Engineering for multi-disciplinary tasks
7 Course This initial course introduces the concepts and fundamentals of electrical
Description and electronic circuits and devices. Topics include basic circuit analysis,
diode and transistor fundamentals and applications. This course also
introduces working principles and applications of dc/ac motors and
transformers.
8 Outline syllabus CO Mapping
Unit 1 DC & AC Circuits
A Electrical circuit elements (R, L and C), series and CO1,CO6
parallel circuits, concept of equivalent resistance,
Kirchhoff current and voltage laws, star-delta
conversion
B Analysis of simple circuits with dc excitation and CO1,CO6
Superposition Theorem, Representation of sinusoidal
waveforms, peak and rms values, real power, reactive
power, apparent power, power factor
C Introduction to three phase system, relationship between CO1,CO6
phase voltages and line voltages,
Unit 2 Transformer
A Working principle and construction of transformer, EMF CO2,CO6
equation

CSA, SSET, SU Page 51

 B Efficiency of transformer, Power and distribution CO2,CO6
transformer and difference between them
C Transformer applications in transmission and distribution CO2,CO6,
of electrical power
Unit 4 Electrical Motors
A Construction, working principle, torque-speed CO3,CO6
characteristic and applications of dc motor.
B Construction, working principle and applications of a CO3,CO6
three-phase induction motor, significance of torque-slip
characteristic
C Working principle starting methods and applications of CO3,CO6
single phase induction motor
Unit 4 Semiconductor Diode and Rectifier
A PN junction and its biasing CO4,CO6
B Semiconductor diode, ideal versus practical diode , VI CO4,CO6
characteristics of diode
C Half wave and full wave rectifiers with and without CO4,CO6
filters.
Unit 5 Transistors
A Bipolar Junction Transistor (BJT) – Construction, CO5,CO6
working principle and input-output characteristics
B BJT as CE amplifier and as a switch CO5,CO6
C Introduction to JFET CO5,CO6
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. D. P. Kothari and I. J. Nagrath, “Basic Electrical
Engineering”, Tata McGraw Hill, 2010.
2. S. K. Bhattacharya, “Basic Electrical and
Electronics Engineering”, Pearson Publication.
3. Robert L Boylestad, “Electronic Devices and Circuit
Theory” Pearson Education, 2009

Other 1. V. D. Toro, “Electrical Engineering Fundamentals”,

References Prentice Hall India, 1989.

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

COs
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
3 3 2 2 - - - - - - - - - - -
1
CO
1 1 2 - - - - - - - - - - - -
2
CO
2 2 1 - - - - - -- - - - - - -
3
CO
2 1 2 - - - - - - - 1 - - - -
4
CO
3 2 1 - - - - - - - 1 - - - -
5

CSA, SSET, SU Page 52

 CO
2 2 3 1 - - - - - - 1 - - - -
6

CSA, SSET, SU Page 53

Syllabus: CSE242, Data Structures

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code CSE242
2 Course Title Data Structures
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core
Status
5 Course 1. Learn the basic concepts of Data Structures and algorithms.
Objective 2. Design and Implementation of Various Basic and Advanced Data
Structures.
3. Learn the concepts of various searching, Sorting and Hashing
Techniques.
4. Choose the appropriate data structures and algorithm design method
for a specified application.

6 Course CO1: Select appropriate data structures as applied to specified problem

Outcomes definition.
CO2: Choose the suitable data structures like arrays, linked list, stacks
and queues to solve real world problems efficiently.
CO3 Represent and manipulate data using nonlinear data structures
like trees and graphs to design algorithms for various applications.
CO4: Compare various techniques for searching and sorting.
CO5: Design and implement an appropriate hashing function for an
application
CO6: Formulate new solutions for programing problems or improve
existing code using learned algorithms and data structures
7 Course This course starts with an introduction to data structures with its
Description classification, efficiency of different algorithms, array and pointer
based implementations and Recursive applications. As the course
progresses the study of Linear and Non-Linear data structures are
studied in details. The course talks primarily about Linked list, stacks,
queue, Tree structure, Graphs etc. This Course also deals with the
concept of searching, sorting and hashing methods.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
A Data Structure – Definition, Operations and Applications, CO1
Abstract Data Types, Algorithm – Definition, Introduction to
Complexity, Big OH notation, Time and Space tradeoffs.

CSA, SSET, SU Page 54

 B Dynamic Memory Allocation( Malloc, calloc, realloc, free), CO1
Recursion – Definition, Examples- Tower of Hanoi problem,
Tail Recursion
C Arrays: Implementation of One Dimensional Arrays, CO1
Multidimensional Arrays, Applications of Arrays, Address
Calculation, Matrix Operations, Sparse martices
Unit 2 Linked List
A Concept of Linked List, Garbage Collection, Overflow and CO2
Underflow, Array Implementation and Dynamic
Implementation of Singly Linked Lists
B Array Implementation and Dynamic Implementation of CO3
Doubly Linked List, Circularly Linked List
C Operations on a Linked List- Insertion, Deletion, CO2
Traversal, Polynomial Representation and Addition
Unit 3 Stack and Queue
A Stacks: Definitions, Primitive operations, Application of CO3
stacks – Conversion of Infix Expression to Postfix form,
Evaluation of Postfix Expressions
B Queues: Definition, Primitive Operations, Implementation CO3
of Circular Queues, Priority Queues
C Deques, Application of Queues. Implementation - Linked CO3
Stacks, Linked Queues.
Unit 4 Tree and Graphs
A Trees: Terminologies, Binary tree, Representation, CO4, CO6
Applications, Binary search Tree – Operations on Binary
Search Trees (Traversing, Insertion, deletion etc.), Binary
Search Algorithm, AVL Tree
B Graph: Terminology, Representation, Traversals- Depth CO4, CO6
First Search, Breadth First Search.
C Graph Applications – Minimum Spanning Trees – Prim’s CO4, CO6
and Kruskal’s Algorithms
Unit 5 Searching, Sorting and Hashing
A Implementation and Analysis - Linear search, Binary Search CO5, CO6
B Implementation and Analysis- Bubble Sort, Insertion Sort, CO5, CO6
Selection Sort, Tree sort
C Hashing: Concepts and Applications, Hash Functions, CO5, CO6
Collisions, Methods of Resolving Collisions
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Lipschutz, “Data Structures” Schaum’s Outline
Series, TMH
Other 1. Aaron M. Tenenbaum, Yedidyah Langsam and
References Moshe J. Augenstein “Data Structures Using C and
C++” , PHI
2. Horowitz and Sahani, “Fundamentals of Data
Structures”, Galgotia Publication
3. Jean Paul Trembley and Paul G. Sorenson, “An
Introduction to Data Structures with applications”,
McGraw Hill

CSA, SSET, SU Page 55

 4. R. Kruse etal, “Data Structures and Program
Design in C”, Pearson Education
5. G A V Pai, “Data Structures and Algorithms”, TMH
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. Select appropriate data structures as applied to PO1, PO3, PO9, PSO1, PSO2
specified problem definition.
2. Choose the suitable data structures like arrays, PO1, PO2, PO3, PO9, PSO1,
linked list, stacks and queues to solve real world PSO2, PSO3
problems efficiently.
3. Represent and manipulate data using nonlinear PO1, PO2, PO3, PO4, PO9, PSO1,
data structures like trees and graphs to design PSO2
algorithms for various applications.
4. Compare various techniques for searching and PO3, PO9, PO12, PSO1, PSO2
sorting.
5. Design and implement an appropriate hashing PO1, PO2, PO3, PO4, PO5, PO9,
function for an application PSO1, PSO2, PSO3
6. Formulate new solutions for programing PO1, PO3, PO4, PO5, PO9, PSO1,
problems or improve existing code using learned PSO2, PSO3
algorithms and data structures

PO and PSO mapping with level of strength for Course Name Data Structures (Course
Code CSE 242)

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3

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

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

CO - - 2 - - - - - 3 - - 1 2 2 -
4
CO 3 2 3 2 1 - - - 2 - -- - 3 2 2
5
CO 2 - 3 3 2 - - - 1 - - - 2 3 3
6

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

Cour Cours
P PO PO PO P P P P PO PO PO PO PS PS PS
se e
O1 2 3 4 O5 O6 O7 O8 9 10 11 12 O1 O2 O3
Code Name

CSA, SSET, SU Page 56

 Data 2.3 2.6 2.3 1. 1.8 2.3 2.1 2.3
CSE2
structu 2 - - - - - 1
42 res 3 7 3 5 3 3 7 3

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 57

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course No. HMM111
2 Course Title Human Value and Ethics
3 Credits 2
Contact Hours
4 (L-T-P) 2-0-0
To facilitate the development of a Holistic perspective among students towards
Course
5 life and profession as well as towards happiness and prosperity based on a
Objective
correct understanding of the Human reality and the rest of Existence
On a successful completion of this course students will be able to

1. Understand that the technical education without study of human values

can generate more problems than solutions.
2. Define the principles and ideals, which help in making the judgement of
what is more important.
3. See that ‘I’ and ‘Body’ are two realities, and most of their desires are
related to ‘I’ and not body, while their efforts are mostly centered on the
fulfillment of the needs of the body assuming that it will meet the needs
Course
6 of ‘I’ too.
Outcomes
4. Appreciate the importance of harmony in the self, family and the society
for mutual fulfillment.
5. Understand the importance of harmony among human beings, other
living beings and entire nature for universal equilibrium and mutual co-
existence.
6. Know and practice the ethical approach in profession for continuous
happiness and sustained prosperity.

7 Outline of syllabus:
7.01 Unit A The Need and Process for Value Education
7.02 Unit A Topic 1 The need, basic guidelines, content and process for Value Education
Concept of ‘Natural Acceptance’ and Experiential Validation- as the mechanism for
7.03 Unit A Topic 2 self-exploration; Continuous Happiness and Prosperity- A look at basic Human
Aspirations
Right understanding, Relationship and Physical Facilities- the basic requirements for
7.04 Unit A Topic 3
fulfillment of aspirations of every human being with their correct priority
7.05 Unit B Understanding Harmony in the Human Being - Harmony in Myself
7.06 Unit B Topic 1 Human being as a co-existence of the sentient ‘I’ and the material ‘Body’
The needs of Self (‘I’) and ‘Body’ ; Understanding the Body as an instrument of ‘I’ (I
7.07 Unit B Topic 2
being the doer, seer and enjoyer)
The characteristics and activities of ‘I’ and harmony in ‘I’ ; Understanding the
7.08 Unit B Topic 3 harmony of I with the Body: Correct appraisal of Physical needs, meaning of
Prosperity in detail
7.09 Unit C Harmony in the Family and Society
Values in human-human relationship; Trust and Respect as the foundational values
7.10 Unit C Topic 1
of relationship

CSA, SSET, SU Page 58

 Understanding the meaning of Trust; Difference between intention and
7.11 Unit C Topic 2 competence; The meaning of Respect; Difference between respect and
differentiation; the other salient values in relationship
Harmony in the society (society being an extension of family; Visualizing a universal
7.12 Unit C Topic 3
harmonious order in society - from family to world family
7.13 Unit D Harmony in the Nature and Existence
7.14 Unit D Topic 1 The harmony in the Nature
Interconnectedness and mutual fulfillment among the four orders of nature
7.15 Unit D Topic 2
recyclability and self-regulation in nature
Understanding Existence as Co-existence of mutually interacting units in all-
7.16 Unit D Topic 3
pervasive space
7.17 Unit E Competence in professional ethics
7.18 Unit E Topic 1 Ability to utilize the professional competence for augmenting universal human order
Ability to identify the scope and characteristics of people-friendly and eco-friendly
7.19 Unit E Topic 2
production systems,
Ability to identify and develop appropriate technologies and management patterns
7.20 Unit E Topic 3
for above production systems.
8 Course Evaluation
8.1 Course work: 25 marks
8.11 Attendance 75%
8.12 Homework 4 assignments, no weight
Quizzes/Class
8.13 Tests Two
8.14 Projects None
8.15 Presentations None
8.16 Any other None
8.2 MTE one, 25 marks
8.3 End-term examination: 50 marks
1. R.R Gaur, R Sangal, G P Bagaria, "A foundation course in Human Values and
9.1 Text books
professional Ethics", Excel books, New Delhi
1. B L Bajpai, 2004, Indian Ethos and Modern Management, New Royal Book Co.,
Other Lucknow.
9.2
references 2. A.N. Tripathy, 2003, Human Values, New Age International Publishers.
3. PL Dhar, RR Gaur, Science and Humanism, Commonwealth Purblishers.

Mapping of Outcomes vs. Topics

Course
Code_ PO PO PO PO PO PO PO PO PO PO PO PSO
CO’s 3
PO4 PSO2 PSO3
Course 1 2 5 6 7 8 9 10 11 12 1
Name
CO1 1 1 1 1 2 1 2 2 3 1 1 3

CO2 1 3 2 2 1 3 1 1 2 3 3 2 2 1

HMM CO3 2 2 2 2 2 1 1 1 3 2

111 CO4 1 1 2 3 2 3 2 1

CO5 3 1 2 3 2 1 2 2 1 3 1

CO6 2 1 1 1 1 2 3

CSA, SSET, SU Page 59

School SHARDA SCHOOL OF ENGINEERING &
TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code ARP102
2 Course Title Communicative English -2
3 Credits 2
4 Contact Hours (L-T-P) 1-0-2
To Develop LSRW skills through audio-visual language
acquirement, creative writing, advanced speech et al and MTI
5 Course Objective
Reduction with the aid of certain tools like texts, movies, long
and short essays.
After completion of this course, students will be able to:

CO1 Acquire Vision, Goals and Strategies through Audio-

visual Language Texts

CO2 Synthesize complex concepts and present them in

creative writing

CO3 Develop MTI Reduction/Neutral Accent through

Classroom Sessions & Practice
6 Course Outcomes
CO4 Determine their role in achieving team success through
defining strategies for effective communication with
different people

CO5 Realize their potentials as human beings and conduct

themselves properly in the ways of world.

CO6 Acquire satisfactory competency in use of Quantitative

aptitude and Logical Reasoning

The course takes the learnings from the previous semester to

an advanced level of language learning and self-
comprehension through the introduction of audio-visual aids
as language enablers. It also leads learners to an advanced
level of writing, reading, listening and speaking abilities, while
7 Course Description also reducing the usage of L1 to minimal in order to increase
the employability chances.

8 Outline syllabus – ARP 102

Acquiring Vision, Goals and Strategies through Audio-visual CO
Unit A Language Texts Mapping
Topic 1 Pursuit of Happiness / Goal Setting & Value Proposition in life CO1

CSA, SSET, SU Page 60

 Topic 2 12 Angry Men / Ethics & Principles
The King’s Speech / Mission statement in life | strategies & Action
Topic 3 Plans in Life

Unit B Creative Writing

Topic 1 Story Reconstruction - Positive Thinking
Topic 2 Theme based Story Writing - Positive attitude CO2
Topic 3 Learning Diary Learning Log – Self-introspection

Unit C Writing Skills 1

Topic 1 Precis
Topic 2 Paraphrasing CO2
Topic 3 Essays (Simple essays)

MTI Reduction/Neutral Accent through Classroom Sessions &

Unit D Practice
Vowel, Consonant, sound correction, speech sounds, Monothongs,
Topic 1 Dipthongs and Tripthongs
Vowel Sound drills , Consonant Sound drills, Affricates and Fricative
Topic 2 Sounds
CO3
Speech Sounds | Speech Music| Tone | Volume| Diction |Syntax
Topic 3 |Intonation | Syllable Stress |

Unit E Gauging MTI Reduction Effectiveness through Free Speech

Topic 1 Jam sessions
Topic 2 Extempore CO3
Topic 3 Situation-based Role Play
Unit F Leadership and Management Skills
Topic 1 Innovative Leadership and Design Thinking CO4
Topic 2 Ethics and Integrity CO4
Unit F Universal Human Values
Topic 1 Love & Compassion, Non-Violence & Truth CO5
Topic 2 Righteousness, Peace CO5
Topic 3 Service, Renunciation (Sacrifice) CO5
Unit G Introduction to Quantitative aptitude & Logical Reasoning
Topic 1 Analytical Reasoning & Puzzle Solving CO6
CO6
Topic 2 Number Systems and its Application in Solving Problems
Class Assignments/Free Speech Exercises / JAM Group
9 Evaluations Presentations/Problem Solving Scenarios/GD/Simulations ( N/A
25% CA and 25% MTE 50% ETE
• Wren, P.C.&Martin H. High English Grammar and
Composition, S.Chand& Company Ltd, New Delhi.
• Blum, M. Rosen. How to Build Better Vocabulary. London:
Texts & References | Bloomsbury Publication
10 • Comfort, Jeremy(et.al). Speaking Effectively. Cambridge
Library Links
University Press.
The Luncheon by W.Somerset Maugham -
http://mistera.co.nf/files/sm_luncheon.pdf

CSA, SSET, SU Page 61

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 - - - - - - - - 1 3 1 2 - - -
CO2 - - - - - - - - 1 3 1 2 - - -
CO3 - - - - - - - - 1 3 1 2 - - -
CO4 - - - - - - - - 1 2 1 2 - - -
CO5 - - - - - - - - 1 2 1 2 - - -
CO6 1 - - - - - - - 1 2 1 2 - - -

CSA, SSET, SU Page 62

Syllabus: CSP 242, Data Structure Lab

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester II
1 Course Code CSP242
2 Course Title Data Structure Lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory
5 Course 1. Learn the basic concepts of Data Structures and algorithms.
Objective 2. Design and Implementation of Various Basic and Advanced Data
Structures.
3. Learn the concepts of various searching, Sorting and Hashing
Techniques.
4. Choose the appropriate data structures and algorithm design method
for a specified application.

6 Course CO1: Implement operation like traversing, insertion, deletion, searching etc.
Outcomes on various data structures.
CO2 apply linear data structure(s) to solve various problems
CO3: develop the solution of any problem using non linear data
structure(s)
CO4: create a solution of any problem using searching and sorting
techniques
CO5: Design a hash function using any programming language
CO6: Choose the most appropriate data structure(s) for a given
problem

7 Course This course starts with an introduction to data structures with its
Description classification, efficiency of different algorithms, array and pointer
based implementations and Recursive applications. As the course
progresses the study of Linear and Non-Linear data structures are
studied in details. The course talks primarily about Linked list,
stacks, queue, Tree structure, Graphs etc. This Course also deals with
the concept of searching, sorting and hashing methods.

8 Outline syllabus CO
Mapping
Unit 1 Introduction CO1
Program to implement Operation on Array such as CO1
Traversing, Insertion & Deletion operation
Program based on Recursion such as Towers of CO1
Hanoi, Fibonacci series etc.
Unit 2 Linked List CO2
Program to implement different operation on the CO2
following linked list: Singly, Doubly and circular linked list.

CSA, SSET, SU Page 63

 Unit 3 Stack & Queue CO3
Program to Implement Stack operation using Array and CO3
Linked list
Program to convert infix expression to post fix expression CO3
Program on Evaluation of Post fix expression CO3
Program to implement queue operation using array and CO3
linked list
Program to implement circular queue and deque. CO3
Unit 4 Tree & Graph CO4, CO6
Program to implement binary tree and BST. CO4, CO6
Program to implement MST and shortest path algorithm. CO4, CO6
Unit 5 Searching, Sorting & Hashing CO5
Program on Searching and Hashing CO5
Program on Sorting. CO5
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Lipschutz, “Data Structures” Schaum’s Outline
Series, TMH
Other 1. Aaron M. Tenenbaum, Yedidyah Langsam and
References Moshe J. Augenstein “Data Structures Using C and
C++” , PHI
2. Horowitz and Sahani, “Fundamentals of Data
Structures”, Galgotia Publication
3. Jean Paul Trembley and Paul G. Sorenson, “An
Introduction to Data Structures with applications”,
McGraw Hill
4. R. Kruse etal, “Data Structures and Program
Design in C”, Pearson Education
5. G A V Pai, “Data Structures and Algorithms”, TMH

PO and PSO mapping with level of strength for Course Name Data Structures (Course
Code CSE 242)

PO PO PO PO PO PO PO PO PO PO PO PO
PSO1 PSO2 PSO3
1 2 3 4 5 6 7 8 9 10 11 12

CO1 2 2 3 _ _ - _ _ 3 _ _ 2 3 2 2

CO2 3 2 2 2 2 - _ _ 2 _ - _ 2 3 3

CO3 3 1 3 3 _ _ _ _ 3 _ _ 1 3 2 2

CO4 3 2 3 2 _ _ _ _ 2 _ _ 2 2 3 2

CO5 2 2 2 _ _ _ _ _ _ _ _ _ 1 2 2

CSA, SSET, SU Page 64

 CO6 3 3 2 3 - - _ _ 3 _ - _ 2 3 2

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

Cour Cours
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
se e
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
Code Name
Data
CSP structu 2.6 2. 2. 2. 2.1
2 2 - - - - - 1.7 2.5 2.2
242 res 7 5 5 6 7
Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 65

 TERM-III

CSA, SSET, SU Page 66

Syllabus: CSE 252, Computer Networks

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
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 Compulsory
Status
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
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 CO1, CO2
techniques-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

CSA, SSET, SU Page 67

 A Design issues , IPV4addressing basics and Header format, CO1,CO3
CIDR, 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
format, TCP Connection Management, Flow Control
C TCP congestion control, Internet Congestion Control CO1,CO4,CO5
Algorithm, 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”, 4th
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 Programme Outcomes (PO) & Programme
No. Specific 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 PO1,PO3,PO4,PO5,PO11PO12,PSO2
fundamental issues driving network
design including error control.
3. CO3: Understand and building the PO1,PO2,PO4,PO6,PSO1,PSO3
skills of IP addressing, subnetting and
routing protocols.
4. CO4: Discuss the flow control, PO2,PO3,PSO2,PSO3
elements 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 PO1, PO2, PO4,PO8 PO11, PSO2
the use of cryptography and network
security.
PO and PSO mapping with level of strength for Course Name Computer Networks
(Course Code CSE 252)

CSA, SSET, SU Page 68

 PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
C
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
Os
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).

Course P P P P P P P P
Code/Nam O PO O PO O PO O PO O O O O PS PS PS
e 1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3

Computer 1.3 1.3 0.3 0.3

1.5 1 0.5 - - - 1 1 0.33 2 0.67
Networks 3 3 3 3

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

(Medium=2) extent 3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 69

Syllabus: CSE 245, Discrete Structures

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSE245 Course Name: Discrete Structures
2 Course Title Discrete Structures
3 Credits 4
Contact 3-1-0
4
Hours(L-T-P)
Course Status
This course provides a mathematical foundation for subsequent study in
Course
5 Computer Science, as well as developing the skills necessary to solve
Objective
practical problems.
After the completion of this course, students will be able to:
CO-1. Apply the basic principles of sets and operations in sets.
CO-2. Classify logical notation and determine if the argument is or is not
Course valid.
Outcomes CO-3. Construct and prove models by using algebraic structures.
6 CO-4. Analyze basic principles of Boolean algebra with mathematical
(CO)
description.
CO-5. Construct Permutations and combinations in counting techniques
and applications of Graph Theory.
CO-6. Compose computer programs in a formal mathematical manner.
7 Prerequisite Concepts of algebra
CO-
8 Course Contents Mapping
Unit 1 Introduction to Set Theory, Relations and Functions.
Set Theory: Introduction, Combination of sets, Multi sets,
A CO1
ordered pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of
B relations, Composite Relations, Equality of relations, Order CO1
of relations.
Functions: Definition, Classification of functions, Operations
C CO1
on functions, Recursively defined functions.
Unit 2 Logics and Mathematical Induction
Propositional Logic: Proposition, well formed formula, Truth
A tables, Tautology, Satisfiability, Contradiction, Algebra of CO1,CO2
proposition, Theory of Inference, Natural Deduction.
Predicate Logic: First order predicate, well formed formula
B CO1,CO2
of predicate, quantifiers, Inference theory of predicate logic.
Natural Numbers: Introduction, Mathematical Induction,
C CO1,CO2
Variants of Induction, Induction with Nonzero Base cases.
Unit 3 Algebraic Structures
Definition, Groups, Subgroups and order, Cyclic Groups,
A CO3
Cosets, Lagrange's theorem, Normal Subgroups,

CSA, SSET, SU Page 70

 Homomorphism’s, Definition and elementary properties of
B CO3
Rings and Fields, Integers Modulo n.
Partial order sets: Definition, Partial order sets,
C CO3
Combination of partial order sets, Hasse diagram.
Unit 4 Lattices and Applications
Definition, Properties of lattices – Bounded, Complemented,
A CO4
Modular and Complete Lattice, Morphisms of lattices.
Boolean Algebra: Introduction, Axioms and Theorems of
Boolean algebra, Algebraic manipulation of Boolean
B expressions. Simplification of Boolean Functions, Karnaugh CO4
maps, Logic gates, Digital circuits and Boolean algebra.
Combinational and sequential Circuits.
Recurrence Relation & Generating function: Recursive
C definition of functions, Recursive algorithms, Method of CO4
solving recurrences.
Unit 5 Graph Theory and Applications.
Trees: Definition, Binary tree, Binary tree traversal, Binary
A CO4,CO5
search tree.
Graphs: Definition and terminology, Representation of
graphs, Multi graphs, Bipartite graphs, Planar graphs,
B CO4,CO5
Isomorphism and Homeomorphism of graphs, Euler and
Hamiltonian paths, Graph colouring.
Combinatory: Introduction, Counting Techniques,
C CO4,CO5
Pigeonhole Principle
Mode of Theory
examination
Weightage CA MTE ETE
Distribution
25% 25% 50%
1) 1. C. L. Liu, Elements of Discrete Mathematics, second
edition 1985, McGraw-Hill Book Company. Reprinted 2000.
2) Jean Paul Trembley, R Manohar, “Discrete Mathematical
Text book* Structures with Application to Computer Science”, McGraw-
Hill.
3) K. H. Rosen, Discrete Mathematics and applications, fifth
edition 2003, Tata McGraw Hill Publishing Company.
1) J .L. Mott, A. Kandel, T.P .Baker, Discrete Mathematics for
Computer Scientists and Mathematicians, second edition 1986,
other references Prentice Hall of India.
2) W.K. Grassmann and J.P.Trembnlay, Logic and Discrete
Mathematics, A Computer Science

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)
1. CO1: Apply the basic principles of sets and PO1,PO2,PO3,PO4,PO6,PO12,
operations in sets. PSO1,PSO2

2. CO2: Classify logical notation and determine if PO1,PO2,PO3,PO6,PO9,PO12

the argument is or is not valid. PSO1,PSO2

CSA, SSET, SU Page 71

3. CO3: Construct and prove models by using PO1,PO2,PO3,PO4,PO5,PO9,PSO2
algebraic structures. PSO3
4. CO4: Analyze basic principles of Boolean PO1,PO2,PO3,PO4,PO5,PO11,PO12
algebra with mathematical description. PSO1, PSO3
5. CO5: Construct Permutations and PO1,PO2,PO3,PO4,PO6,PO9,PO11,PO12,
combinations in counting techniques and PSO2,PSO3
applications of Graph Theory.
6 CO6: Compose computer programs in a formal PO1,PO2,PO3, PO4, PO5,PO9,PO11,
mathematical manner. PSO1,PSO2,PSO3

PO and PSO mapping with level of strength for Course Name Discrete Structures (Course Code
CSE245)

PO PO PO PO PO PO PO PO PO PO PO PO
PSO1 PSO2 PSO3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 3 3 1 _ 3 _ _ 3 _ _ 3 3 3 _

CO2 2 2 3 _ _ 2 _ _ _ _ _ 3 3 2 _

CO3 3 2 3 3 3 _ _ _ 2 _ _ _ _ 3 2

CO4 2 2 3 3 3 _ _ _ _ _ 3 3 3 _ 3

CO5 2 2 2 3 _ 3 _ _ 3 _ 3 3 _ 2 3

CO6 1 2 1 2 3 _ _ _ 3 _ 3 _ 3 3 2

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

Course Course PO PO PO PO PO PO PO PO PSO PSO

PO2 PO 3 PO 5 PO 6 PSO 3
Code Name 1 4 7 8 9 10 11 12 1 2
Discrete
CSE245 2 2.1 2.5 2 1.5 1.3 0 0 1.8 0 1.8 2 2 2.1 1.6
Structures

Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 72

Syllabus: CSE 247, Computer organization and architecture

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSE247 Course Name
2 Course Title Computer Organization and Architecture

3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status Compulsory
5 Course To impart an understanding of the internal organization and operations of a
Objective computer and to introduce the concepts of processor logic design and control
logic design.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1: Identify the basic structure and functional units of a digital computer
CO2:Study the architecture of Bus and registers
. CO3:Study the design of arithmetic and logic unit and implementation of
fixed point and floating-point arithmetic operations
CO4:Understand basic processing unit and organization of simple processor
including instruction sets, instruction formats and various addressing modes
CO5:Study the two types of control unit techniques
CO6: Describe hierarchical memory systems including cache memories and
select appropriate interfacing standards for I/O devices.
7 Course This course discusses the basic structure of a digital computer and used for
Description understanding the organization of various units such as control unit,
Arithmetic and Logical unit and Memory unit and I/O unit in a digital
computer.
8 Outline syllabus CO Mapping
Unit 1 Computer Organization and Design
A Functional units of digital system and their CO1
interconnections, buses, bus architecture, types of buses
and bus arbitration. Register bus and memory transfer
B Register transfer Language, Registertransfer, Bus & CO1
memory transfer, Logic micro operations, Shift micro
operation.
C Adder-Subtractor- Incrementor, Arithmetic unit, Logic CO1
unit.
Unit 2 Computer Arithmetic
A Representation of numbers in 1’s and 2’s complement, CO1, CO2
Addition and subtractionofsignednumbers.
B Binary Multiplier, Multiplication: Signed operand CO1, CO2
multiplication, Booth algorithm
C Floating point arithmetic representation: addition and CO1, CO2
subtraction.
Unit 3 Processor Organization
A General register organization, stack organization CO3

CSA, SSET, SU Page 73

 B Instruction set architecture of a CPU - registers, Instruction CO3
types, formats, instruction execution cycle
C Addressing modes, RISC/CISC CO3
Unit 4 Control Unit
A Introduction to CPU design, Instruction interpretation and CO3, CO4
execution, Micro-operation and their register transfer
language (RTL) specification
B Hardwired control CPU design CO3, CO4
C Microprogrammed control CPU design CO3, CO4
Unit 5 Memory and I/O
A RAM/ROM/Flash memory, Designing Memory System CO1, CO5
using RAM and ROM chips
B Cache memory: Memory hierarchy, performance CO1, CO5
Considerations, mapping techniques
C Input Output: Isolated vs. Memory mapped I/O, CO1, CO5
Programmed I/O, Interrupt driven I/O, Direct Memory
Access
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. M. Morris Mano, Computer System Architecture,
Pearson
Other
1. C. Hamacher, Z. Vranesic and S. Zaky, "Computer
References
Organization", McGrawHill, 2002.
2. W. Stallings, "Computer Organization and
Architecture - Designing for Performance",
Prentice Hall of India, 2002.
3. D. A. Patterson and J. L. Hennessy, "Computer
Organization and Design - The
Hardware/Software Interface", Morgan
Kaufmann,1998.
4. J.P. Hayes, "Computer Architecture and
Organization", McGraw-Hill, 1998.

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1. Identify the basic structure and functional PO1, PO2, PO3, PO6, PO12,
units of a digital computer. PSO3
2. CO2:Study the architecture of Bus and registers PO1, PO2, PO3, PO6, PO12,
PSO3
3. CO3. Study the design of arithmetic and logic unit PO1, PO2, PO3, PO6, PO12,
and implementation of fixedpoint and floating- PSO3
point arithmetic operations
4. CO4. Understand basic processing unit and PO1, PO2, PO3, PO6, PO12,
organization of simple processor including PSO3
instruction sets, instruction formats and various
addressing modes

CSA, SSET, SU Page 74

 5. CO5. Study the two types of control unit techniques PO1, PO2, PO3, PO4, PO6, PO12,
PSO2, PSO3
6. CO6. Describe hierarchical memory systems PO1, PO2, PO3, PO6, PO12,
including cache memories and select appropriate PSO2, PSO3
interfacing standards for I/O devices

PO and PSO mapping with level of strength for Course Name Computer Organization and
Architecture (Course Code CSE 247)
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
COs
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
3 1 1 - - 2 - - - - - 2 - 1 3
1
CO
3 3 3 - - 3 - - - - - 3 - 2 3
CSE24 2
7 CO
3 2 3 - - 2 - - - - - 3 - 2 3
3
CO
3 2 2 - - 1 - - - - - 3 - 3 2
4
CO
3 3 3 - - 2 - - - - - 3 - 2 2
5
CO
3 3 3 - - 2 - - - - - 3 - 1 2
6

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

CSA, SSET, SU Page 75

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
Branch: IT
1 Course Code CSP243
2 Course Title Object Oriented Programming Using Java Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Status Compulsory/Elective
5 Course To learn Java language syntax and semantics and concepts such as
Objective classes, objects, inheritance, polymorphism, packages and
multithreading.
6 Course CO1. Define Object oriented programming concepts by identifying
Outcomes classes, objects, members of a class and relationships among them
needed for a specific problem.
CO2: Illustrate different features of java.
CO3: Develop Java programs to solve problems of applications using
OOP principles such as abstraction, polymorphism and inheritance.
CO4:Categorize runtime errors thrown in the application software or
generated runtime by applying the methods of exception handling and
File I/O
CO5. Explain the concept of multithreading.
CO6. Design real life application using Java
7 Course Basic Object Oriented Programming (OOP) concepts including
Description objects, classes, methods, parameter passing, information hiding,
inheritance and polymorphism are discussed.

8 Outline syllabus CO Mapping

Unit 1 Introduction to Object Oriented Paradigm
Program related to garbage collection and OOPS CO1,CO2
Unit 2 Introduction to Java
Program to take input from user, decision making CO1,CO2
and branching
Unit 3 Polymorphism
Program related to string handling and CO1,CO2
polymorphism
Unit 4 Inheritance, package and Interface Inheritance
Implementation
Program related to inheritance and interfaces CO2,CO3,CO6
Unit 5 Exception and Multithreading
Program related to exception handling CO4,CO6
Mode of Jury/Practical/Viva
examination
CA MTE ETE

CSA, SSET, SU Page 76

 Weightage 25% 25% 50%
Distribution
Text book/s* 1.Schildt H, “The Complete Reference JAVA2”, TMH
Other 1. Balagurusamy E, “Programming in JAVA”, TMH
References Professional Java Programming: BrettSpell, WROX
Publication

PO and PSO mapping with level of strength for Course Name Object Oriented Programming
Using Java (Course Code CSP243)

Course
Code_ PO PO PO PO PO PO PO PO PO PO PO PSO
CO’s PO4 PSO2 PSO3
Course 1 2 3 5 6 7 8 9 10 11 12 1
Name
CO1 2 2
CSP243_ CO2 2
Object
Oriented CO3 2 3 3 2 3 2 2 3
Programming CO4 2
Using Java
Lab CO5 2
CO6 3 3 3 2 3 2 3 2 3 3 3 2

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

List of Experiments
Unit No S.No Name of the Practical
1.1 Write a Java program to print 'Hello' on screen and then print your
1 name on a separate line
1.2 Write a Java program to print the sum (addition), multiply, subtract,
divide and remainder of two numbers.
2 2.1 Write a Java program to accept a number and check the number is
even or not. Prints 1 if the number is even or 0 if the number is odd.
2.2 Write a Java program that accepts three integers from the user and
return true if the second number is greater than first number and third
number is greater than second number. If "abc" is true second
number does not need to be greater than first number.
3 3.1 Write a Java program to find the maximum occurring character in a
string
3.2 Write a Java program to find first non repeating character in a string.
3.3 Write a program in java to demonstrate method overloading
4 4.1 Write a program in java to demonstrate multilevel inheritance in
java.
4.2 Write a java program to create an abstract class named Shape that contains
two integers and an empty method named print Area (). Provide three
classes named Rectangle, Triangle and Circle such that each one of the

CSA, SSET, SU Page 77

 classes extends the class Shape. Each one of the classes contains only the
method print Area () that prints the area of the given shape.
5 5.1 Write a program that creates a user interface to perform integer division. The
user enters two numbers in the text fields, Num1 and Num2. The division of
Num1 and Num2 is displayed in the Result field when the Divide button is
clicked. If Num1 and Num2 were not integers, the program would throw a
Number Format Exception. If Num2 were zero, the program would throw an
Arithmetic Exception Display the exception in a message dialog box.
5.2 Write a java program that implements a multi-thread application that
has three threads. First hread generates random integer every 1
second and if the value is even, second thread computes the square of
the number and prints. If the value is odd, the third thread will print
the value of cube of the number

CSA, SSET, SU Page 78

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code ARP207
Logical Skills Building and Soft Skills
2 Course Title

3 Credits 2
Contact
4 Hours 1-0-2
(L-T-P)
Course
Active
Status

To enhance holistic development of students and improve their employability

skills. To provide a 360 degree exposure to learning elements of Business
English readiness program, behavioural traits, achieve softer communication
Course levels and a positive self-branding along with augmenting numerical and
5
Objective altitudinal abilities. To step up skill and upgrade students’ across varied
industry needs to enhance employability skills. By the end of this semester,
a student will have entered the threshold of his/her 1 st phase of employability
enhancement and skill building activity exercise.
After completion of this course, students will be able to:

CO1: Ascertain a competency level through Building Essential Language and

Life Skills

CO2: Build positive emotional competence in self and learn GOAL Setting and
SMART Goals techniques

CO3: Apply positive thinking, goal setting and success-focused attitudes, time
Management, which would help them in their academic as well as professional
Course
6 career
Outcomes
CO4: Acquire satisfactory competency in use of aptitude, logical and
analytical reasoning

CO5: Develop strategic thinking and diverse mathematical concepts through

building number puzzles

CO6: Demonstrate an ability to apply various quantitative aptitude tools for

making business decisions

This Level 1 blended training approach equips the students for Industry
Course employment readiness and combines elements of soft skills and numerical
Description abilities to achieve this purpose.
7

8 Outline syllabus – ARP 207

CO
Unit 1 BELLS ( Building Essential Language and Life Skills)
Mapping

CSA, SSET, SU Page 79

 Know Yourself: Core Competence. A very unique and interactive approach
through an engaging questionnaire to ascertain a student’s current skill
A level to design, architect and expose a student to the right syllabus as also CO1
to identify the correct TNI/TNA levels of the student.
Techniques of Self Awareness | Self Esteem & Effectiveness| Building
B Positive Attitude | Building Emotional Competence CO1, CO2
Positive Thinking & Attitude Building | Goal Setting and SMART Goals –
C Milestone Mapping | Enhancing L S R W G and P (Listening Speaking Reading CO1,
Writing Grammar and Pronunciation) | CO2,CO3
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
Syllogism | Letter Series | Coding, Decoding , Ranking & Their Comparison CO4
A Level-1
B Number Puzzles CO5
C Selection Based On Given Conditions CO5
Unit 3 Quantitative Aptitude
A Number Systems Level 1 | Vedic Maths Level-1 CO6
B Percentage ,Ratio & Proportion | Mensuration - Area & Volume |Algebra CO6
Unit 4 Verbal Abilities – 1
A Reading Comprehension CO1
B Spotting the Errors CO2
Unit 5 Time & Priority Management
A Steven Covey Time Management Matrix CO3
B Creating Self Time Management Tracker CO3
Weightage
Class Assignment/Free Speech Exercises / CA – 25% MTE-25%, ETE-50%
Distribution
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – Arihant Publications | Quicker
Text Maths- M. Tyra | Power of Positive Action (English, Paperback, Napoleon Hill) | Streets of
book/s* Attitude (English, Paperback, Cary Fagan, Elizabeth Wilson) The 6 Pillars of self-esteem and
awareness – Nathaniel Brandon | Goal Setting (English, Paperback, Wilson Dobson

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 - - - - 1 - - - 1 3 - 2 - - -
CO2 - - - - 1 - - - 1 3 - 2 - - -
CO3 - - - - 1 - - - 1 3 - 2 - - -
CO4 - - - - - - - - 1 2 1 2 - - -
CO5 1 - - - - - - - 1 2 1 2 - - -
CO6 - - - - 1 - - - 1 3 - 2 - - -

CSA, SSET, SU Page 80

Syllabus: CSP 244, Principles of Operating System Lab

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSP 244
2 Course Title Principles of operating System Lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status
5 Course Introduces different type operating systems, functions of operating
Objective systems, working in a Unix/Linux and Windows system, writing
programs on Process management and file management.
6 Course CO1: Working with single user multi task and multi-user multi-
Outcomes tasking environment.
CO2: Identify and use utilities of Windows & Unix operating
systems
CO3: Use the resources of operating system i.e. process
management and file management
CO4: Writing programs on Process creation, multiple process
creation, process synchronization
CO5: Writing program on basic file operations
CO6: Writing program on file buffering.
7 Course The course is designed to make the students research/industry
Description ready as operating systems are indispensable for the systems used
in industries/research organizations. New operating systems for
different gadgets are launched in last few years. So the students will
get the design principles operating system in this course.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
Illustration of Different types of operating system: CO1
Single user Multi task, Multi user Multi task
Basic Windows features & Unix commands. CO2
Unit 2 Processes
Process basics: Creating processes using fork( ), CO2, CO3,
the parent-child processes PID, PPID, process CO4
states: creating orphan, zombie processes.
Unit 3 Process Synchronization
Creating multiple processes, Process table, use the CO3, CO4
command ps with –el, Synchronization of processes
by using sleep( ) & wait( ), background process,
Unit 4 Files

CSA, SSET, SU Page 81

 Basic file operations, Programs for File operations, CO3,
sharing data between processes using files. CO4,CO5
Unit 5 File Buffering
File descriptor table, system file table, file pointer, CO3,
buffer accessing block wise, use the functions: CO4,CO6
fopen( ), fread( ), ftell( ), lseek( ), fflush( ) etc.
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Sumitabha Das, “Unix Concepts and
Applications”, Tata McGraw Hill.

Other 1. Unix: The complete Reference, Kenneth Rosen

References et.al., TMH
2. Unix ‘C’ Odessey, Meeta Gandhi et.al. BPB

Course outline
This course introduces the features of GUI i.e. Windows operating system as well as the CUI
i.e. the commands used in Unix, so that the students will be familiar with both GUI & CUI
environment of operating systems. As the course progresses the students will learn to write
programs for process management and file operations. Further the students can implement
the algorithms studied in theory by writing programs using the above principles and skills.

Course Evaluation
Attendance None
Any other CA judged on the practical conducted in the lab , weightage may be
specified
References
Text book 1. Sumitabha Das, “Unix Concepts and Applications”, Tata McGraw
Hill.

Other References 1. Unix: The complete Reference, Kenneth Rosen et.al., TMH
2. Unix ‘C’ Odessey, Meeta Gandhi et.al. BPB

Software Windows, Unix / Any Unix family OS i.e. Linux

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Working with single user multi task and PO1,PO2,PO3,PO4,PSO1
multi-user multi-tasking environment.
2. CO2: Identify and use utilities of Windows & PO1, PO3, PO4, PSO2
Unix operating systems
3. CO3: Use the resources of operating system i.e. PO1,PO2,PO3,PO4
process management and file management

CSA, SSET, SU Page 82

 4. CO4: Writing programs on Process creation, PO9, PO10,PO11, PSO3
multiple process creation, process
synchronization,
5. CO5: Writing program on basic file operations PO1,PO2,PO8,PO9,PO10,PSO1
6. CO6: Writing program on file buffering. PO1,PO2,PO10,PO11,PSO1,PSO2
PO and PSO mapping with level of strength for Course Name Principles of Operating
System (Course Code CSP 244)

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

COs
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2
1
CSE24 CO
3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2
4 2
CO
3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1
3
CO
2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2
4
CO
2 2 3 - - - - 3 3 1 2 - 3 - -
5
CO
3 2 - - - - - - - 2 3 - 2 2 -
6

CSA, SSET, SU Page 83

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSP254 Course Name: Project Based Learning -1
2 Course Title Project Based Learning -1
3 Credits 2
4 Contact Hours 0-0-4
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To align student’s skill and interests with a realistic
problem or project
2. To understand the significance of problem and its
scope
3. Students will make decisions within a framework
6 Course Outcomes Students will be able to:
CO1: Identify and formulate problem statement with
systematic approach.
CO2: Develop teamwork and problem-solving skills, along
with the ability to communicate effectively with others.
CO3: Design the problem solution as per the problem
statement framed.
CO4: Classify and understand techniques for software
verification and validation of project successfully.
CO5: Fabricate and implement the solution by using different
aspects of programming language.
CO6: Develop a glory of the need to engage in life-long
learning.
7 Course Description In PBL-1, the students will learn how to define the problem
for developing projects, identifying the skills required for
developing the project based on given a set of specifications
and all subjects of that Semester.
8 Outline syllabus CO
Mapping
Unit 1 Problem Definition, Team/Group formation and Project CO1, CO2
Assignment. Finalizing the problem statement, resource
requirement, if any.
Unit 2 Develop a work flow or block diagram for the proposed CO2,CO3
system / software.
Unit 3 Design algorithms for the proposed problem. CO3
Unit 4 Implementation of work under the guidance of a faculty CO3, CO4
member and obtain the appropriate results.
Unit 5 Demonstrate and execute Project with the team. Validate CO4, CO5,
and verify the project modules. CO6

CSA, SSET, SU Page 84

 Report should include Abstract, Hardware / Software
Requirement, Problem Statement, Design/Algorithm,
Implementation Detail. Validation Reports.
References if any.
The presentation, report, work done during the term
supported by the documentation, forms the basis of
assessment.

Mode of Practical /Viva

examination
Weight age CA MTE ETE
Distribution 25% 25 50%

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Identify and formulate problem statement PO1, PO2, PO4, PO9, PO10,
with systematic approach. PO11,
PO12,PSO1,PSO2,PSO3
2. CO2: Develop teamwork and problem-solving PO1, PO2, PO4, PO7, PO9,
skills, along with the ability to communicate PO10, PO11, PO12 ,PSO3
effectively with others.
3. CO3: Design the problem solution as per the PO1, PO2, PO5, PO9, PO10,
problem statement framed. PO11, PO12, PSO1,PSO2
4. CO4: Classify and understand techniques for PO1, PO2, PO6, PO9, PO10,
software verification and validation of project PO11, PO12,PSO2
successfully.
5. CO5: Fabricate and implement the solution by PO1, PO2, PO3, PO4,PO5,
using different aspects of programming language. PO6, PO7, PO8, PO9, PO10,
PO11, PO12 PSO1,PSO2,
PSO3
6. CO6: Develop a glory of the need to engage in life- PO1, PO2, PO4, PO9, PO10,
long learning. PO11, PO12,PSO3

PO and PSO mapping with level of strength for Course Name Project Based Learning -1 (Course
Code CSP254)
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 3 - - - - 3 3 2 3 2 2 1
CO2 3 2 - 3 - - 2 - 3 3 2 3 1
CO3 3 2 - - 2 - - - 3 3 2 3 2 2
CO4 3 3 - - - 2 - - 3 3 2 3 2
CO5 3 3 2 2 2 2 3 3 3 3 2 3 2 2
CO6 3 3 - 3 - - - - 3 3 2 3 1

CSA, SSET, SU Page 85

 Avg
PO 0.3 1.8 0.6 0.6 0.8
3 2.7 0.5 3 3 2 3 1 1.4 0.5
attain 4 4 7 7 4
ed

CSA, SSET, SU Page 86

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSP292 Course Name: Summer Internship-I
2 Course Title Summer Internship-I
3 Credits 2
4 Contact Hours 0-0-0
(L-T-P)
Course Status Compulsory
5 Course Objective This course will expose students to apply theories learned in
the classroom and provides current technological
developments relevant to the subject area of training.
Students will be able to identify the career preferences and
professional goals.
6 Course Outcomes Students will be able to:
CO1: Get familiarize with industry principles and practices.
CO2: Identify and analyze an appropriate problem.
CO3: Develop teamwork and apply prior acquired knowledge
in problem solving.
CO4: Demonstrate effective verbal and written
communication skills.
CO5: Practice engineer’s responsibilities, self-understanding,
self-discipline and ethical standards.
CO6: Identify the career preferences and professional goals.
7 Course Description The Internship aims to offer students the opportunity to apply
their prior acquired knowledge in problem solving. Students
will acquire skills important for time management, discipline,
self-learning, and effective communication and so on.
8 Outline syllabus CO
Mapping
Unit 1 Define objectives and conditions for the internship, CO1,CO6
ensuring students that it is related to the study path carried
out at the University
Unit 2 Problem Definition and identification, Team/Group CO2,CO6,
formation and Project Assignment. Finalizing the problem
statement, resource requirement, if any.
Unit 3 The internship work plan is drawn up by developing team CO3,CO6,
work and applies prior acquired knowledge in problem
solving.
Unit 4 Demonstrate and execute Project with the team. CO4,CO6
Submission of evaluation form and final report completed
by the intern.
Unit 5 Final evaluation form completed by the supervisor at the CO5,CO6
Host Organization and final presentation before
departmental committee.

CSA, SSET, SU Page 87

 Mode of Jury/Viva
examination
Weight age CA MTE ETE
Distribution
25% 25% 50%

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Get familiarize with industry principles and PO1
practices.
2. CO2: Identify and analyze an appropriate problem. PO2,PO3,PO5,PSO1,PSO2
3. CO3: Develop teamwork and apply prior acquired PO1,PO2, PO3,PO9,PSO1
knowledge in problem solving.
4. CO4: Demonstrate effective verbal and written PO10
communication skills.
5. CO5: Practice engineer’s responsibilities, self- PO6,PO8
understanding, self-discipline and ethical
standards.
6. CO6: Identify the career preferences and PO12,PSO1
professional goals.

PO and PSO mapping with level of strength for Course Name Summer Internship-I
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 2 - - - - - - - - - - - - - -
CO2 - 3 2 - 2 - - - - - - - 2 2 -
CO3 2 2 3 - - - - - 3 - - - 1 - -
CO4 - - - - - - - - - 3 - - - - -
CO5 - - - - - 2 - 3 - - - - - - -
CO6 - - - - - - - - - - - 2 1 - -
Avg
PO 0.8 0.8 0.3 0.3 0.6
1 0 0 0.5 0.5 0.5 0 0.34 0.34 0
attain 4 4 4 4 4
ed

CSA, SSET, SU Page 88

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
1 Course Code CSE253 Term-III
2 Course Title Object Oriented Programming Using Java
3 Credits 2
4 Contact 2-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course To learn Java language syntax and semantics and concepts such as
Objective classes, objects, inheritance, polymorphism and multithreading.
6 Course CO1. Define Object oriented programming concepts by identifying
Outcomes classes, objects, members of a class and relationships among them
needed for a specific problem.
CO2: Illustrate different features of java.
CO3: Develop Java programs to solve problems of applications using
OOP principles such as abstraction, polymorphism and inheritance.
CO4: Categorize runtime errors thrown in the application software or
generated runtime by applying the methods of exception handling.
CO5. Explain the concept of multithreading.
CO6. Design real life application using Java
7 Course Basic Object Oriented Programming (OOP) concepts including
Description objects, classes, methods, parameter passing, information hiding,
inheritance and polymorphism are discussed.
8 Outline syllabus CO Mapping
Unit 1 Introduction to Object Oriented Paradigm
A Introduction to OOP, Characteristics of OOP, Difference CO1, CO2
between OOP and procedural languages
B Byte Code, Architecture of JVM CO1, CO2
C Features of Java, Class Loader Execution Engine, CO1, CO2
Garbage collection.
Unit 2 Introduction to Java
A Classes, Objects ,Constructors, Methods CO1,CO2
B Constants, Variables, Data Types, Operators, Expressions, CO1, CO2
Decision Making Branching, Loops
C Arrays CO1, CO2
Unit 3 Polymorphism & String handling
A Polymorphism, method overloading CO3
B Constructors overloading , Wrapper class ,Type CO3
conversion & casting,
C Strings and String handling, CO3
Unit 4 Inheritance

CSA, SSET, SU Page 89

 A Inheritance, Types of inheritance, Overriding methods, CO3,CO6
use of this and super
B Constructor call in inheritance, Abstract class , Concept of CO3,CO6
multiple inheritance in Java
C Final class, method and variable, Interface, Access CO3,CO6
Modifiers
Unit 5 Exception and Multithreading
A Introduction to Exception Handling, Introduction to try, CO4,CO6
catch, Finally , throw and throws
B Checked and Unchecked exceptions, User define CO4,CO6
exception
C Introduction to Multithreading, Creating thread using CO5,CO6
Runnable interface and Thread class, Thread life cycle
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1.Schildt H, “The Complete Reference JAVA2”, TMH
Other
References 1. Balagurusamy E, “Programming in JAVA”, TMH
2. Professional Java Programming: BrettSpell, WROX
Publication
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) & Programme Specific Outcomes
No. (PSO)
1. Define Object PO5,PO12
oriented
programming
concepts by
identifying
classes, objects,
members of a class
and relationships
among them
needed for a
specific problem.
2. Illustrate different PO5
features of java.
3. Develop Java PO1,PO2,PO3,PO5,PO9,PO12,PSO1,PSO2
programs to solve
problems of
applications using
OOP principles
such as
abstraction,
polymorphism and
inheritance.
4. Categorize PO5
runtime errors
thrown in the

CSA, SSET, SU Page 90

 application
software or
generated runtime
by applying the
methods of
exception handling
and File I/O
5. Explain the PO5
concept of
multithreading.
6. Design real life PO1,PO2,PO3,PO5,PO6,PO7,PO9,PO11,PO12,PSO1,PSO2,PSO3
application using
Java.

PO and PSO mapping with level of strength for Course Name Object Oriented Programming
Using Java (Course Code CSE243)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s PO4 PSO2 PSO3
Course Name 1 2 3 5 6 7 8 9 10 11 12 1
CO1 2 2

CO2 2
CSE253_
Object CO3 2 3 3 2 3 2 2 3
Oriented
Programming CO4 2
Using Java CO5 2

CO6 3 3 3 2 3 2 3 2 3 3 3 2

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

PO2 PO 3 PO 6 PSO 3
Code Name 1 4 5 7 8 9 10 11 12 1 2
Object
Oriented
CSE 253 2.5 3 3 0 2 3 2 0 3 0 2 2.3 2.5 3 2
Programming
Using Java

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 91

Syllabus: CSE 244, Principles of Operating System
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSE Course Name: Principles of Operating System
244
2 Course Title Principles of Operating System
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Core
Status
5 Course 1. This course introduces the challenges for designing the operating
Objective systems.
2. Includes different design principles and algorithms.
3. Evaluation of algorithms proposed.
4. Implementation of algorithms and utilities.
6 Course Students will be able :
Outcomes CO1: To Understand the basic concept of Operating system.
CO2:Explore process management concepts including scheduling,
synchronization, deadlocks
CO3: To understand and implement algorithms in resource allocation and
utilization.
CO4: To integrate and interpret effectiveness, efficiency of algorithms used
for resource management of operating systems.
CO5: Analyze various memory management and virtual memory techniques
CO6: To Understand file and disk management and analyzing them
7 Course This course introduces the design principles of operating systems, resource
Description management, identifying challenges and applying respective algorithms.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Operating System Concepts and functions, CO1
Comparison of different Operating system
B Types of Operating Systems (Batch, CO1
Multiprogramming ,Multi-Tasking ,
Multiprocessing, Distributed and Real Time
Operating System)
C Operating System Structure(Monolithic, Layered CO1
and Microkernel ), Operating System Services
Unit 2 Process Synchronization
A Process Concepts (PCB, Process States , Process CO1, CO2
Operations, Inter process communication)
B Critical Section problem & their solutions, CO1, CO2
Introduction to Semaphores

CSA, SSET, SU Page 92

 C Classical Problems of Synchronization(Producer CO1, CO2
Consumer Problem, Readers Writer Problem,
Dining philosophers problem)
Unit 3 CPU Scheduling
A Concept , Types of schedulers( Short term, Long CO1,CO2
term, Middle term), Dispatcher, Performance
Criteria
B CPU Scheduling Algorithms( FCFS, SJF, Priority, CO1,CO2,CO3,CO4
Round Robin, Multilevel Queue, Multilevel
feedback Queue)
C Deadlock concepts & Handling CO1,CO2,CO3,CO4
Techniques(Avoidance, Prevention and Detection
& Recovery)
Unit 4 Memory Management
A Memory Hierarchy, Memory Management Unit CO1,CO2,CO3,CO5
B Paging, Segmentation CO1,CO2,CO3,CO5
C Virtual memory concept, demand paging, Page CO1,CO2,CO3,CO5
replacement algorithms(FCFS, Optimal, LRU)
Unit 5 INPUT-OUTPUT Management
A Input –Output interface, Modes of data CO1,CO2,CO3,CO6
transfer(Programmed, interrupt and DMA)
B Disk structure , Disk scheduling(FCFS,SSTF, SCAN, CO1,CO2,CO3,CO4,CO6
LOOK,C-SCAN, C-LOOK)
C File Concept ,File operations, File Directories, Case CO1,CO2,CO3,CO6
study of Windows Operating System
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text 1. Silberschatz G, Operating System Concepts,
book/s* Wiley

Other 1. W. Stalling, “Operating System”, Maxwell

References Macmillan
2. Tannenbaum A S, Operating System Design
and Implementation, Prentice Hall India
3. Milenkovic M, Operating System Concepts,
McGraw Hill

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: To identify the challenges and apply suitable PO1,PO2,PO3,PO4,PSO1
algorithms for them.
2. CO2: To assess the strengths and weaknesses of PO1, PO3, PO4, PSO2
the algorithms.

CSA, SSET, SU Page 93

 3. CO3: To understand and implement algorithms in PO1,PO2,PO3,PO4
resource allocation and utilization.
4. CO4: To integrate and interpret effectiveness, PO9, PO10,PO11, PSO3
efficiency of algorithms used for resource
management of operating systems.
5. CO5: Analyze various memory management and PO1,PO2,PO8,PO9,PO10,PSO1
virtual memory techniques.
6. CO6: To Understand file and disk management and PO1,PO2,PO10,PO11,PSO1,PSO2
analyzing them.

PO and PSO mapping with level of strength for Course Name Principles of Operating
System (Course Code CSE 244)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2

CSE244 CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2

CO5 2 2 3 - - - - 3 3 1 2 - 3 - -

CO6 3 2 - - - - - - - 2 3 - 2 2 -

CSA, SSET, SU Page 94

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester III
1 Course Code CSP-252
2 Course Title Computer Networks Lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory/Elective
5 Course The students will be introduced to the basic concepts and
Objective fundamentals of computer networks along with the study of individual
layers of reference model.
6 Course Students will be able to:
Outcomes CO1: Explain the basic concepts of computer network.
CO2: Illustrate and differentiate working of all layers of the OSI
Reference Model and TCP/IP model
CO3: Analyze fundamental issues driving network design including
error control, IP addressing, access control, flow and congestion
control
CO4: Compare working of various routing algorithms
CO5: Test various network security algorithms
CO6: Examine various cryptographic Algorithms
7 Course To familiarize with the basic taxonomy and terminology of computer
Description networking area.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Study of Data Communication and Networking. CO1, CO2
Identify five components of Data communication
system.
B Study of computer network topology and OSI model CO1, CO2
layered architecture.
C Study of basic networking commands: IPCONFIG, CO1, CO2
PING / Tracer and Net stat utilities to debug the
network issues.

Unit 2 Data Link Layer

A To connect the computers in Local Area Network CO1, CO2

B Write a C program to implement Character CO1, CO2
Stuffing and Destuffing
C Write a C program to Error Detection using Cyclic CO1, CO2
Redundancy Check Algorithms.
Unit 3 Network Layer
A Write a program to generate Hamming code. CO1,CO3

CSA, SSET, SU Page 95

 B Write a C program to determine if the IP address is CO1,CO3
in Class A, B, C, D, or E.
C Write a C program to translate dotted decimal IP CO1,CO3,CO4
address into 32 bit address.
Unit 4 Transport Layer
A Write a program for congestion control using CO1,CO4
Leaky bucket algorithm.
B Write a Program to simulate Distance vector CO1,CO4,CO5
routing.
C Creating a Network topology using CISCO packet CO1,CO4,CO5
tracer software

Unit 5 Application Layer

A Write a program to implement DES for encryption. CO1,CO5
B Using RSA algorithm encrypts a text data and CO1,CO5,CO6
decrypts the same.
C Open Ended Project CO1,CO5,CO6
Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* Tanenbaum, A.S.” Computer Networks”, 4th
Edition, PHI
Other 1. Forouzan, B.., “Communication Networks”,
References TMH, Latest Edition
2. W. Stallings, “Data and Computer
Communication” Macmillan Press

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)
1. CO1: Explain the basic concepts of computer PO2,PO11,PO12,PSO2
network.
2. CO2: Illustrate and differentiate working of PO1,PO3,PO4,PO5,PO11PO12,PSO2
all layers of the OSI Reference Model and
TCP/IP model
3. CO3: Analyze fundamental issues driving PO1,PO2,PO4,PO6,PSO1,PSO3
network design including error control, IP
addressing, access control, flow and
congestion control
4. CO4: Compare working of various routing PO2,PO3,PSO2,PSO3
algorithms
5. CO5: Test various network security PO1, PO2,PO3, PO4, PSO2
algorithms
6. CO6: Examine various cryptographic PO1, PO2, PO4,PO8 PO11, PSO2
Algorithms

CSA, SSET, SU Page 96

PO and PSO mapping with level of strength for Course Name Computer Networks Lab (Course
Code CSP252)

P P P P P P P P P
PO PO PO PS PS PS
O O O O O O O O O
10 11 12 O1 O2 O3
Comp 1 2 3 4 5 6 7 8 9
uter C
2 - - - - - - - - 2 3 - 3 -
Netw O1
orks C
2 - 2 2 3 - - - - - 2 3 3 -
Lab O2
(Cour C
3 2 - 2 - 2 - - - - - - 2 - 2
se O3
Code C
- 2 2 - - - - - - - - - - 2 2
CSP2 O4
52) C
2 2 2 2 - - - - - - - - - 2 -
O5
C
2 - - 2 - - - 2 - - 2 - - 2 -
O6

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

Course P P P P P P P P PS
Code/Na O PO O PO O PO O PO O O O O PS O PS
me 1 2 3 4 5 6 7 8 9 10 11 12 O1 2 O3

Computer
1. 1.3 1.3 0. 0.3 0.3 0.3 0.6
Networks 1 - - - 1 1 2
5 3 3 5 3 3 3 7
(CSP252)

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 97

 TERM-IV

CSA, SSET, SU Page 98

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
Course Name :
1 Course Code ARP208 Quantitative and Qualitative Aptitude Skill Building

Quantitative and Qualitative Aptitude Skill Building

2 Course Title

3 Credits 2
Contact
4 Hours 1-0-2
(L-T-P)
Course
Active
Status
To enhance holistic development of students and improve their
employability skills. Provide a 360 degree exposure to learning elements
of Business English readiness program, behavioural traits, achieve softer
communication levels and a positive self-branding along with
Course
5 augmenting numerical and altitudinal abilities. To up skill and upgrade
Objective students’ across varied industry needs to enhance employability skills.
By the end of this semester, a will have entered the threshold of his/her
2nd phase of employability enhancement and skill building activity
exercise.
After completion of this course, students will be able to:

CO1: Develop and deliver the effective presentations to interpret the

deeper meaning of life.

CO2: Improve listening skills so as to understand complex business

communication in a variety of global English accents through proper
pronunciation

CO3: Demonstrate a good understanding of effective business writing

Course
6 and telephone handling Skills
Outcomes
CO4: Acquire higher level competency in use of aptitude, logical and
analytical reasoning

CO5: Develop higher level strategic thinking and diverse mathematical

concepts through building number puzzles

CO6: Demonstrate higher level quantitative aptitude tools for making

business decisions

This course bundle allows students to build vision, mission and strategy
statements while exposing them to various models of communication
Course
7 along with MTI reduction and the 2nd level of quant, aptitude and
Description reasoning abilities

CO
8 Outline syllabus – ARP208
MAPPING
Unit 1 Communicate to Conquer

CSA, SSET, SU Page 99

 VMOSA (Vision, Mission, Values and Ethics)| Business Communication -
A Verbal Communication Skills | Barriers in communication | Basics of CO1
effective communication – PRIDE & STAR Model
Different styles of communication & style flexing (Based on the 4 social
styles-Analytical, Driving, Expressive, Amiable) | Importance of
B Listening & practice of Active Listening | The Art of Giving Feedbacks|
CO2
Feedback Skills | Asking fact finding questions- Probing Skills
Email Etiquette | Business Writing Skills| Telephone Etiquette Skills (
C Telephone Handling Skills ) | Non Verbal Communication-Kinesthetics, CO3
Proxemics, Paralanguage | MTI Reduction Program |
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
A Coding Decoding , Ranking & Their Comparison Level-2 CO4
B Series, Blood Relations & Number Puzzle CO5
Unit 3 Quantitative Aptitude
A Number System Level 2 CO5
B Vedic Maths Level-2 | Probability | Permutation & Combination CO6
Percentage, Profit & Loss ,Partnership, Simple Interest & Compound CO6
C Interest
Unit 4 Verbal Abilities – 2
A Paragraph Jumbles CO2
B Critical Reasoning CO2
Unit 5 Basics of GD and PI
A Understanding and Practicing Mock Group Discussions CO2
B Understanding and Practicing Mock Personal Interviews CO2
Weightage
( CA )Class Assignment-25% MTE-25% ETE-50%
Distribution
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – Arihant Publications |
Quicker Maths- M. Tyra | Power of Positive Action (English, Paperback, Napoleon Hill)
Text
| Streets of Attitude (English, Paperback, Cary Fagan, Elizabeth Wilson) The 6 Pillars of
book/s*
self-esteem and awareness – Nathaniel Brandon | Goal Setting (English, Paperback,
Wilson Dobson

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 - - - - - - - - 1 2 1 2 - - -
CO2 - - - - - - - - 1 2 1 2 - - -
CO3 - - - - - - - - 1 2 1 2 - - -
CO4 - - - - - - - - 1 2 1 2 - - -
CO5 1 - - - - - - - 1 2 1 2 - - -
CO6 1 - - - - - - - 1 2 1 2 - - -

CSA, SSET, SU Page 100

BTY 223 INTRODUCTION TO BIOLOGY FOR ENGINEERS
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
Course
BTY 223
1 number
2 Course Title Introduction to Biology for Engineers
3 Credits 2
Contact
2-0-0
4 Hours (L-T-P)
Students will be introduced to the functions and interactions of biological systems
Course from a quantitative perspective. To provide a foundation in biology with engineering
Objective of living systems and to apply various tools of traditional engineering fields. To harness
5 potential of living systems for the benefit of human mankind.
After successfully completion of this course students will be able to:
1. To understand the fundamentals of living things, their classification,
cell structure and biochemical constituents.
2. To apply the concept of plant, animal and microbial systems and
6 growth in real life situations.
Course
3. To comprehend genetics and the immune system.
Outcomes
4. To know the cause, symptoms, diagnosis and treatment of common
diseases.
5. To give a basic knowledge of the applications of biological systems in
relevant industries.
6. Understand importance of biological components in everyday life
7 Outline syllabus:
7.01 Unit A UNIT I: INTRODUCTION TO LIFE
7.02 Unit A Topic 1 Characteristics of living organisms
7.03 Unit A Topic 2 Cell theory
7.04 Unit A Topic 3 Structure of prokaryotic and eukaryotic cell
7.05 Unit B UNIT II: Biomolecules
General classification and important functions of carbohydrates
7.06 Unit B Topic 1 and lipids
7.07 Unit B Topic 2 General classification and important functions of proteins
7.08 Unit B Topic 3 General classification and important functions of DNA and RNA
7.09 Unit C UNIT III: Genetics and Immune system
7.10 Unit C Topic 1 Theories of Evolution
7.11 Unit C Topic 2 Mendel’s laws of inheritance
7.12 Unit C Topic 3 Immune system and Immunity
7.13 Unit D UNIT IV: Human Diseases
7.14 Unit D Topic 1 Genetic diseases and Infectious diseases
7.15 Unit D Topic 2 AIDS and Diabetes
7.16 Unit D Topic 3 Cancer and its causes
7.17 Unit E UNIT V: Biology and its industrial application
7.18 Unit E Topic 1 Vaccines and their types
7.19 Unit E Topic 2 Bioremediation and biofertilizers
7.20 Unit E Topic 3 Bioreactors

CSA, SSET, SU Page 101

 8 Course Evaluation
8.1 Course work: 25% marks
8.11 Attendance None
8.12 Assignments 5 marks
8.13 Quizzes 20 marks
8.14 Presentations 5 marks
8.15 Any other None
8.16 MTE 25 marks
8.18 End-term examination: 50 marks
8.19 References
1. Karp, G. Cell and Molecular Biology, 5th ed., John Wiley and Sons, Inc.
8.20 Text book
8.21 Other
1. Alberts, B. et al. Essential Cell Biology, Garland Publishing, Inc. (ISBN: 081533480X)
References
4.
2. Berger, S. et al. Introduction to Bioengineering, Oxford University Press (ISBN: 978‐
0‐19‐856515‐4)
Mapping of Outcomes vs. Topics

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
3 1 - - - 1 3 - - - - 3 - - -
1
CO
3 2 - - - 2 - - - - - 3 - - -
2
CO
3 3 3 1 1 3 3 2 1 3 - 3 1 1 -
3
CO
3 2 - - - 2 2 3 1 2 - 3 1 - -
4
CO
3 1 1 1 3 1 3 2 1 2 1 3 1 1 -
5
CO
3 3 1 1 2 3 5 1 1 1 - 3 1 - -
6

CSA, SSET, SU Page 102

Syllabus: CSE 011, Mathematical Techniques (Program Elective-1)

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code CSE 011
2 Course Title Mathematical Techniques
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status Program Elective-I
5 Course The objective of the course is to teach students the mathematical &
Objective statistical techniques that provide sound basis for research and application
development in Computer Science.
6 Course By the end of the course, students will be able to:
Outcomes CO1: Identify and analyze computational errors in numerical computation and
series approximation.
CO2: Make use of various Numerical techniques for interpolation.
CO3: Recall probability concepts and statistical terms to apply in various random
situations
CO4: Identify various distributions for suitable scenario
CO5: Make use of various techniques for hypothesis testing
CO6: Apply mathematical and statistical methods in their research and application
development
7 Course In this subject, the fundamental concepts and principles of Mathematical &
Description Statistical Techniques together with the challenging issues in Computer Science
software development will be introduced. Discussion on various topics related to
mathematics and Computer Science will also be conducted.
8 Outline syllabus CO
Mapping
Unit 1 Introduction, Computational Errors and their Analysis
A Accuracy of numbers, Errors and a general error formula, Errors CO1, CO6
in Numerical Computations.
B Errors in a Series Approximation. CO1, CO6
C Precisions CO1, CO6
Unit 2 Numerical Techniques
A LU decomposition for systems of linear equations; CO2, CO6
B numerical solutions of non-linear algebraic equations by CO2, CO6
Secant, Bisection and Newton-Raphson Methods;
C Numerical integration by trapezoidal and Simpson’s rules. CO2, CO6
Unit 3 Probability
A Probability: Conditional Probability; CO3,CO6
B Mean, Median, Mode and Standard Deviation;. CO3,CO6
C Random Variables; Distributions; CO3,CO6
Unit 4 Permutation
A uniform, normal, exponential CO4,CO6
B Poisson, Binomial distribution CO4,CO6
C Permutations; Combinations; Counting; Summation; CO4,CO6

CSA, SSET, SU Page 103

 Unit 5 Hypothesis testing
A Generating functions; recurrence relations; CO5,CO6
B Techniques for statistical quality control, CO5,CO6
C Testing of hypothesis. CO5,CO6
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* M. Goyal, “Computer Based Numerical & Statistical Techniques”,
Infinity Science Press, LLC, MA, USA.
Other 1. Matheus Grasselli and Dimitry Pelinovsky, “Numerical Mathematics”,
References Jones and Bartlet Publishers, USA.
2. Lars Elden, “Mattrix Methods in Data Mining and Pattern Recognition”,
SIAM (Society for Industrial and Applied Mathematics), USA.
3. Internet as a resource for references.

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Identify and analyze computational errors in PO1, PO2, PSO1
numerical computation and series approximation.
2. CO2: Make use of various Numerical techniques for PO1, PO2, PO3, PO7, PO10, PO11,
interpolation. PO12, PSO1, PSO2
3. CO3: Recall probability concepts and statistical terms PO1, PO2, PO3, PO4, PO7, PO10,
to apply in various random situations PO11, PO12, PSO1,PSO2
4. CO4: Identify various distributions for suitable PO1, PO2, PO3, PO4, PO5, PO7,
scenario PO10, PO11, PO12, PSO1, PSO2
5. CO5: Make use of various techniques for hypothesis PO1, PO2, PO3, PO4, PO5, PO7,
testing PO10, PO11, PO12, PSO1, PSO2
6. CO6: Apply mathematical and statistical methods in PO1, PO2, PO3, PO4, PO5, PO7,
their research and application development PO10, PO11, PO12, PSO1, PSO2

PO and PSO mapping with level of strength for Course Name Mathematical techniques
(Course Code CSE011)

P
PS
CO PO PO PO PO PO PO PO PO PO PO O PO PS PS
Course O
s 1 2 3 4 5 6 7 8 9 10 1 12 O2 O3
1
1
CO
3 2 - - - - - - - - - - 2 - -
1
Mathemat CO
ical 2 3 1 1 1 - 1 - - 1 2 1 1 1 -
2
technique CO
3 1 1 1 - - 1 - - 2 1 1 3 1 -
s 3
(CSE011 ) CO
2 3 2 1 1 - 1 - - 1 1 1 2 1 -
4
CO
1 1 1 2 2 - 1 - - 1 2 1 2 1 -
5

CSA, SSET, SU Page 104

 CO
3 1 3 1 2 - 2 - - 2 2 3 3 1 -
6

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

Course PO PO PO PO PO PO PO PO PO PSO PSO

Course Name
Code 1 PO2 PO 3 4 5 PO 6 7 8 9 10 11 12 1 2 PSO 3
Mathematical
CSE011 2.3 1.8 1.3 1 1 0 1 0 0 1.1 1.3 1.1 2.1 .8 0
techniques

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 105

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code HMM305
2 Course Title Management for Engineers
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status Compulsory
5 Course The objective of this course is to expose the students to understand
Objective the basics of Management Foundations. The students will be given a
detailed grounding for the theories and cases related to the general
management. The aim of the course is to orient the students in theories
and practices of Management so as to apply the acquired knowledge
in actual business practices. This is a gateway to the real world of
management and decision-making.
6 Course CO1: Define basic principles and concepts related to management
Outcomes in an organization including the functions, different theories
of management and roles they play in an organization.
CO2: Explain the primary function Planning with its process. Also,
how forecasting is done in organizations with various techniques
are used.
CO3: Use of organizing by studying different types of organization
and also using decentralization and span of control in organizations.
CO4: Analyse jobs, recruitment process, manpower planning, job
rotation, trainings and rewards in various organizations.
CO5: Measure motivation and management control concepts to
obtain effective controlling in management system in
organizations.
CO6: Develop proper system in an organization by using all the
functions of management.
7 Course This course gives an overview of engineering management and help
Description to understand the various functions of management used in an
organization. The focus of the course is the development of individual
skills and team work.

8 Outline syllabus CO Mapping

Unit 1 Introduction of Management & Organization CO1,CO6
A Management-Definition of Management & CO1,CO6
Organization
B Concept, Nature, Scope and Functions of CO1,CO6
Management, Levels of Management, Management
Theories - Taylors principle, Fayol’s Principles,
Hawthorne Studies, Systems Approach and
Contingency Approach to Management.

CSA, SSET, SU Page 106

 C Mintzberg’s Managerial Roles, Skills of Manager, CO1,CO6
Functions of management
Unit 2 Management Planning Process CO2,CO6
A Planning objectives and characteristics. CO2,CO6
B Hierarchies of planning. CO2, CO6
C The concept and techniques of forecasting. CO2,CO6
Unit 3 Organizing C03,C06
A Meaning, Importance and Principles C03,C06
B Departmentalization, Span of Control CO3,CO6
C Types of Organization, Authority, Delegation of CO3,CO6
Authority
Unit 4 Staffing CO4,C06
A Meaning, Job analysis CO4,C06
B Manpower planning, Recruitment, Transfers and CO4, CO6
Promotions
C Appraisals, Management Development, Job CO4, CO6
Rotation, Training, Rewards and Recognition,
Unit 5 Directing & Controlling CO5,CO6
A Motivation, Co-ordination, Communication, CO5,CO6
B Directing and Management Control, Decision CO5,CO6
Making,
C Management by objectives (MBO) the concept and CO5,CO6
relevance. Objectives and Process of Management
Control
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Principles & practice of Mgmt., L.M. Prasad
Other 1. Management Today, Burton & Thakur
References 2. Principles & Practices of Mgmt., C.B. Gupta
3. Understanding Management, Richard L.Daft
4. Management, Stoner, Freemand & Gilbert
5. Essential of Management, Koontz O' Donnel

1.3.5 Programme Outcome Vs Courses Mapping Table:

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO 2 1 2 2 2 2 - 2 1 3 - - 1 1 2
1
CO 1 1 2 2 1 2 1 - - 2 2 1 1 1 2
2
CO 3 1 1 2 3 2 - 2 - - 1 2 1 2 2
3

CSA, SSET, SU Page 107

 CO - 2 2 1 - 1 - 1 - 2 1 - 1 1 2
4
CO - 1 2 2 - 2 3 1 2 - - 1 2 2 1
5
CO 1 2 1 1 2 2 2 - 1 - - 1 2 2 2
6

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

CSA, SSET, SU Page 108

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code CSE012 Course Name: Introduction to Graph Theory and its
Application
2 Course Title Introduction to Graph Theory and its Application
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Status Program Elective-I
5 Course The objective of the course is to teach students the basic graph theory concepts and
Objective their applications in computer science.
6 Course After successful completion of the course students will be able to
Outcomes CO1: demonstrate some of the most important notions and types of
graph theory and develop their skill in solving basic applications
understanding societal needs.
CO2: interpret the fundamentals of graphs and trees and to apply these as
computer science applications such as to find a minimal spanning tree for
a given weighted graph etc.
CO3: Discover the advanced properties and concepts of graphs such as
cut-sets and circuits in graph, planarity of graphs etc in addition to their
application in real-world.
CO4: Examine a graph using matrices to communicate their application
in real world.
CO5: Develop efficient graph-theoretic algorithms (mathematically) to
explore the applications of coloring problem of graph theory.
CO6: Relating the concepts to prepare grounds for project work and
research interests.
7 Course This course is to teach students the basic graph theory concepts and their applications
Description in computer science.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Basic terminologies and concepts of Graph Theory, CO1
Fundamental types of graphs, Applications in various
areas
B Properties of graphs, theorems based on different types CO1,CO2
of graph and various operations on graphs
C Special types of graphs (Hamiltonian, Euler), Travelling CO1, CO6
salesman problem
Unit 2 TREES
A Fundamentals of trees and their types, Binary trees and CO2
their properties, importance of binary trees in data
structure (searching algorithms)
B fundamental circuits, spanning trees, algorithms to find CO2
spanning trees in a weighted graph (Kruskal& Prim)

CSA, SSET, SU Page 109

 C Applications: Representation of the algebraic CO2, CO6
expressions as ordered binary trees, Huffman procedure
for construction of an optimal tree for a given set of
weights.
Unit 3 CUT SETS
A a cut-set of a connected graph, the fundamental circuit CO1, CO3
,Properties of circuits & cut–sets, Concept of
connectivity and separability
B Concept of Planar graphs with introduction to CO3
Kuratowski’s non-planar graphs, Proof of Euler’s formula
C Detection of planarity , geometric duals of graph, CO3, CO6
thickness & Crossings, network flow
Unit 4 Coloring and Covering
A Concept of proper coloring of vertices of a graph, CO5, CO6
chromatic number , Chromatic partitioning
B Chromatic polynomial, finding chromatic polynomial of a CO5, CO6
given graph
C Matching, Covering, Five color problem and its proof CO5, CO6
Unit 5 Matrix Representation of Graphs& Applications
A Incidence matrix, sub matrices of A(G), circuit matrix, CO3, CO4
fundamental circuit matrix and Rank of B
B Cut set matrix , fundamental cut set matrix, path matrix, CO4
Adjacency matrix
C Finding Rank of different matrices, Relationship among CO3, CO4
A , B , andC
f f f

Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Deo, N, Graphtheory with applications to Engineering and Computer Science,
Prentice Hall India
Other 1. Wilson R J, Introduction to Graph Theory, PearsonEducation
References 2. Harary, F, Graph Theory, Narosa
3. Bondy& Murthy, Graph theory and application. Addison Wesley

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: : demonstrate some of the most important notions PO1, PO2, PO6, PO7, PO10,
and types of graph theory and develop their skill in solving PO11, PO12, PSO1
basic applications understanding societal needs.
2. CO2: interpret the fundamentals of graphs and trees and PO1, PO2, PO3, PO4, PO6, PO7,
to apply these as computer science applications such as to PO10, PO12, PSO1
find a minimal spanning tree for a given weighted graph
etc.
3. CO3: Discover the advanced properties and concepts of PO2, PO4, PO5,PO6, PO10, PO12,
graphs such as cut-sets and circuits in graph, planarity PSO2
of graphs etc in addition to their application in real-
world.
4. CO4: Examine a graph using matrices to communicate PO2, PO4, PO10,PSO1, PSO2,
their application in real world.

CSA, SSET, SU Page 110

5. CO5: Develop efficient graph-theoretic algorithms PO1, PO2, PO4, PO5, PO6, PO10,
(mathematically) to explore the applications of coloring PO12, PSO2
problem of graph theory.
6 CO6: Relating the concepts to prepare grounds PO4, PO6, PO12, PO10, PSO2,
for project work and research interests. PSO3.
PO and PSO mapping with level of strength for Course Name: Introduction to Graph
Theory and its Application (CSE 012)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 3 2 2 1 2 2 - - 2 1 2 3 1 -

CO2 3 3 3 2 - 1 1 - - 1 - 2 3 1 -

CO3 1 3 1 3 2 2 - - - 1 - 2 2 2 -

CO4 1 3 1 3 1 1 - - - 2 - 1 3 2 -

CO5 2 2 2 3 2 1 - - - 1 - 2 1 2 -

CO6 1 1 2 3 1 2 - - - 2 - 2 1 2 2

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

Code Name 1 PO2 PO 3 4 5 PO 6 7 8 9 10 11 12 1 2 PSO 3
Introduction
to Graph
CSE012 Theory and 1.83 2.83 1.83 2.67 1.17 1.5 0.5 - - 1.5 0.17 1.83 2.17 1.67 0.33
its
Application

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 111

Syllabus: CSE 249, Database management System
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code CSE249 Course Name

2 Course Title Database Management System

3 Credits 3

4 Contact Hours 3-0-0

(L-T-P)

Course Status core

5 Course 1.Develop the ability to design,

Objetcive
2. Implement and manipulate databases.
3. Introduce students to build data base management systems.
4. Apply DBMS concepts to various examples and real life applications.

6 Course Students will be able to:

Ootcome
CO1: Explain the basics concepts of data base.
CO2: Demonstrate the knowledge of databases to E-R modelling.
CO3: Ability to design entity relationship and convert entity relationship
diagrams into RDBMS and formulate SQL queries on the respective data.
CO4: Apply normalization techniques to reduce redundancy from the
database.
CO5: To appraise the basic issues of Transaction processing,
Serializability& concurrency control
CO6: Design & develop database for real life problems

7 Course This course introduces database design and creation using a DBMS product.
Description Emphasis is on, normalization, data integrity, data modeling, and creation of
simple tables, queries, reports, and forms. Upon completion, students should
be able to design and implement normalized database structures by creating
simple database tables, queries, reports, and forms.

8 Outline syllabus CO Mapping

Unit 1 Introduction to Databases:

A Introduction of DBMS, Characteristic of DBMS, Data

Models, Database languages, Database Administrator,
Database Users.

CSA, SSET, SU Page 112

 B Three Schema architecture of DBMS, Data
Models,Hierarchical, Network ,Data independence and
database language, DDL, DML, Data Modeling using
CO1,CO2,CO6
Entity Relationship Model

C Strong Entity, Weak entity, Specialization and

generalization, converting ER Model to relational tables.

Unit 2 Relational Database Language and Interfaces:

A Relational data model concepts ,Concept of keys,

Mapping Constraints

B Null Values, Domain Constraints, Referential Integrity CO3

Constraints

C Unary Relational Operations: SELECT and PROJECT

Relational Algebra Operations from Set Theory ,Binary
Relational Operations: JOIN and DIVISION ,SQL.

Unit 3 Normalization in Design of Databases:

A Functional Dependency, Different anomalies in

designing a Database, loss less join decompositions
CO1, CO4,
B Normalization : first second and third normal forms,
CO6
Boyce Codd normal form, dependency preservation,

C multi-valued dependencies , fourth normal forms,

Inclusion dependencies,

Unit 4 Transaction Management:

A Transaction processing system, schedule and

recoverability, Testing of serializability,

B Serializability of schedules, conflict & view serializable CO5

schedule

C Recovery from transaction failures, deadlock handling.

Unit 5 Concurrency Control

A Two-Phase Locking Techniques for Concurrency Control

, Concurrency Control Based on Timestamp Ordering

B Multiversion Concurrency Control Techniques ,Validation CO5

(Optimistic) Concurrency Control Techniques

C Granularity of Data Items and Multiple Granularity

Locking

CSA, SSET, SU Page 113

 Mode of Theory
examination

Weightage CA MTE ETE

Distribution
25% 25% 50%

Text book/s* 1. Korth , Silberschatz&Sudarshan, Data base

Concepts, Tata McGraw-Hill, Latest Edition

Other 1. Elmasri, Navathe, Fundamentals of Database

References Systems, Pearson Education Inc.
2. Thomas Connolly, Carolyn Begg, Database
Systems: A Practical Approach to design,
Implementation and Management, Pearson Education,
Third Edition.

CO and PO Mapping

S. Course Outcome Programme Outcomes (PO) &

No. Programme Specific Outcomes
(PSO)
1. Understand the basics concepts of data base. PO1, PO6, PO12, PSO1,PSO2

2. Acquire the knowledge of databases to E-R PO1 , PO5 , PO6 ,PO9, PO12,
modeling. PSO1 PSO2
3. Ability to design entity relationship and PO1, PO2, PO3, PO5, PO6, PO12
convert entity relationship diagrams into PSO1, PSO2
RDBMS and formulate SQL queries on the
respective data.
4 Learn the basic concept of normalization & PO1, PO2, PO3, PO4, PO6 ,PO8
apply them to reduce redundancy from the PO9 ,PO12 , PSO3
database.
5 To appraise the basic issues of Transaction PO1, PO2, PO3, PO5, PO6, PO8
processing ,Serializability& concurrency PO12 ,PSO2
control
6 Design & develop database for real life PO1, PO2, PO3, PO4, PO5, PO6
problems PO8 ,PO9 ,PO10 ,PO11, PO12
PSO3

CSA, SSET, SU Page 114

PO and PSO mapping with level of strength for Course Name Database Management
System(Course Code CSE 249)

PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
C
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
Os
CO - -
3 - - - - 2 - - - - 3 3 3
1
CO - - -
2 - - - 3 2 - - 2 3 3 3
2
CO - - -
3 3 3 - 3 2 - - - 2 2 3
3
CO - - -
3 3 3 3 - 2 - 2 3 2 - 3
4
CO - - - -
2 3 2 - 2 2 2 - 1 3 -
5
CO - -
3 3 3 3 3 3 3 3 3 2 3 - 3
6

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

Cours
e P P P P P P P P
Code/ PO PO PO O PO O O O O O O O PS PS PS
Name 1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
CSE
2.6 2.7 2.7
249/ 3 3 2.2 - 2.3 2.7 3 2 2.3 2.6 3 3
7 5 5
DBMS

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

Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 115

INP248: Human Computer Interaction Lab

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code INP248
2 Course Title Human computer interaction lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory/Elective
5 Course This course teaches students to design user interfaces based on the
Objective capabilities of computer technology and the needs of human factors.
6 Course CO1: Define the concept of software for user interface
Outcomes CO2: Build the user interface keeping design considerations in mind.
CO3: Construct user interface for student registration and displaying
picture.
CO4: Design user interface for calculator and menu based
applications
CO5: Build the user interface for any reservation system
CO6: Develop, implement and evaluate effective and usable
graphical computer interfaces.
7 Course Course readings will span practice in interface specification, design
Description and evaluation. This course gives experience as working in
interdisciplinary design teams. Students will learn principles and
guidelines for usability, quantitative and qualitative analysis methods,
and apply them through critiques of existing interfaces and
development of new ones.
8 Outline syllabus CO
Mapping
Unit 1
1) Introduction to tool and design an interface for CO1,CO6
welcome screen
2) Design an interface for multiplication and addition CO1,CO6
of any two numbers
Unit 2
3)Design an user interface for assigning a grade to CO2,CO6
students based on the subjects marks
4)Design an user interface for printing the numbers in CO2,CO6
a) Ascending order
b) descending order
Unit 3
5)Design an user interface for registration of students CO3,CO6
for admission
6)Design an user interface for displaying and CO3,CO6
changing of picture on the form

CSA, SSET, SU Page 116

 Unit 4
7)Design an user interface for menu based program CO4,CO6
8)Design an user interface for mathematical and CO4,CO6
scientific calculator
Unit 5
9)Design an user interface for reservation system e.g. CO5,CO6
bus/Flight/railways etc.
10)Design and implement modules of a given CO5,CO6
application or system.
Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* -
Other Internet as a resource
References

PO and PSO mapping with level of strength for Course Name INP248 (Course Code
Human Computer Interaction Lab)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s 3
PO4 PSO2 PSO3
Course Name 1 2 5 6 7 8 9 10 11 12 1
CO1 2 1 1 1 3 1 - - 1 3 3 3 2 2 1

CO2 2 1 2 2 3 1 - - 1 3 3 3 2 2 1

INP248_Human CO3 2 1 2 2 3 1 - - 1 3 3 3 2 2 1
computer
Interaction Lab CO4 2 1 2 2 3 1 - - 1 3 3 3 2 2 1

CO5 2 2 2 2 3 1 - - 2 3 3 3 2 2 1

CO6 3 2 3 3 3 2 - - 3 3 3 3 2 2 1

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

Code Name 1 PO2 PO 3 4 5 PO 6 7 8 9 10 11 12 1 2 PSO 3
Human
computer
INP 248 2 1.3 2 2 3 1.6 - - 1.5 3 3 3 2 2 1
interaction
Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 117

INT248: Human Computer interaction

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code INT248
2 Course Title Human Computer Interaction
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course The main objective is to make student think constructively and
Objective analytically about how to design and evaluate interactive technologies.
6 Course CO1: Define the capabilities of both humans and computers from the
Outcomes viewpoint of HCI.
CO2: Explain different types of User interfaces.
CO3: Describe and use HCI design principles, standards and guidelines.
CO4: Understand the fundamental aspects of designing and evaluating
interfaces.
CO5: Analyse and identify user models, user support, socio-
organizational issues, and stakeholder requirements of HCI systems.
CO6: Adapt methodologies to design, implement and evaluate a user
interface for a project
7 Course HCI is an interdisciplinary field that integrates theories and
Description methodologies from computer science, cognitive psychology, design,
and many other areas. This course is an introduction to the
fundamentals of human-computer interaction, user interface design,
and usability analysis. Students will learn principles and guidelines for
usability and apply them through critiques of existing interfaces and
development of new ones.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
A Introduction to HCI, CHI, MMI, Human System CO1
Interaction, Importance of User Interface, Importance
of Good Design, Benefits of Good Design, Principles
of User Interface Design
B Techniques and Tasks, Basic Interaction Tasks, CO1
Composite Interaction Task, Interaction Styles, Speech
Recognition, Natural Language Processing, Fields of
HCI
C The Contents of Human-Computer Interaction, Nature CO1
of Human-Computer Interaction, Applications , Goals
and Aspects , HCI Groups

CSA, SSET, SU Page 118

 , Unit 2 Interfaces
A Term Interface, Good and Bad Interfaces, Features of a CO2,CO6
Good Interface,
B User interface, Quality of User Interface, Types of User CO2,CO6
Interfaces, Command Line Interface, Advantages of
Command Line Interface, Graphical User Interface
C Document Interfaces and their types, Single Document CO2,CO6
Interface (SDI), Multiple Document Interface (MDI),
Tabbed Document Interface.
Unit 3 User Interface Design & GUI
A Understanding How User Interact With Computers, CO3,CO6
User Interface Models, Design Methodologies,
Designing an Interface, Process of Interaction Design.
B Human Interaction with Computers, Human Interaction CO3,CO6
Speeds, Human Characteristics in Design, Human
Consideration in Design, Eight golden rules user
interface design
C Popularity of Graphics, Characteristics of Graphical CO3,CO6
User Interface, Concepts of Direct Manipulation,
Graphical System Advantages and Disadvantages, Web
User Interface Characteristics and Popularity
Unit 4 Design Models and Ergonomics
A User interface models, User interface design CO4,CO6
methodologies, Efficacy of user interface design,
Dialogue box design, Development and evaluation of
user interface design, user centered design.
B Factors in user interface design, HCI design models, CO4,CO6
Process of interface analysis,
C User documentation, Ergonomics introduction, Human CO4,CO6
factors, Physical issues in ergonomics, cognitive issues
in ergonomic
Unit 5 Usability
A Usability introduction & its need, usability CO5,CO6
acceptability,
B What to measure in Usability, Usability Engineering, CO5,CO6
C Life cycle, how to achieve high usability, Usability CO5,CO6
evaluation and testing, Learnability, Flexibility.
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* Alan Dix, Janet Finlay, Gregory Abowd. Ruel Beale "Human
Computer Interaction",PHI.
Other 1. Kumar Rajendra, " Human Computer
References Interaction" Second Edition, Firewall Media New
Delhi.
2. Ben Shneiderman, "Design the User Interface:
Strategies for Effective Human-Computer Interaction"
Pearson Education.

CSA, SSET, SU Page 119

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) & Programme
No. Specific Outcomes (PSO)
1. CO1: Define the capabilities of both PO1,PO4,PO5,PO6,PO7,PO8,PO9,
humans and computers from the PO10,PO12,PSO1
viewpoint of HCI.
2. CO2: Explain different types of User PO1,PO2,PO4,PO5,PO6,PO7,PO8,PO9,
interfaces. PO10,PO12,PSO1
3. CO3: Describe and use HCI design PO1,PO2,PO4,PO5,PO6,PO7,PO8,PO9,
principles, standards and guidelines. PO10,PO12,PSO1
4. CO4: Understand the fundamental PO1,PO2,PO4,PO5,PO6,PO7,PO8,PO9,
aspects of designing and evaluating PO10,PO12,PSO1
interfaces.
5. CO5: Analyze and identify user PO1,PO2,PO3,PO4,PO5,PO6,PO7,PO8,PO9,
models, user support, socio- PO10,PO11,PO12,PSO1
organizational issues, and stakeholder
requirements of HCI systems.
6. CO6: Adapt methodologies to design, PO1,PO2,PO3,PO4,PO5,PO6,PO7,PO8,PO9,
implement and evaluate a user PO10,PO11,PO12,PSO1,PSO2
interface for a project

PO and PSO mapping with level of strength for Course Name Human Computer
Interaction (Course Code INT 248)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s 3
PO4 PSO2 PSO3
Course Name 1 2 5 6 7 8 9 10 11 12 1
CO1 1 - - 1 1 1 2 1 2 3 - 3 1 - -

CO2 1 1 - 1 1 1 2 2 2 3 - 3 1 - -
INT248_Human CO3 1 1 - 1 1 1 2 2 2 3 - 3 2 - -
Computer
Interaction CO4 1 2 - 1 1 1 2 2 2 3 - 3 1 - -

CO5 3 3 3 3 2 1 2 2 2 3 3 3 1 - -

CO6 2 3 3 3 2 2 3 2 2 3 3 3 3 2 -

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

Code Name 1 PO2 PO 3 4 5 PO 6 7 8 9 10 11 12 1 2 PSO 3
Human
INT248 Computer 1.5 1.6 1.3 1.1 2.1 1.8 2 3 3 3 1.5 2 -
Interaction

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 120

Syllabus: CSP 249, Database management System Lab
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code CSP249
2 Course Title Database Management System Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course ● To Develop efficient SQL programs to access Oracle databases
Objective ● Build database using Data Definition Language Statements
● Perform operations using Data Manipulation Language
statements like Insert, Update and Delete
6 Course By the end of this course you will be able to:
Outcomes
CO1: Understand the concept of SQL commands in DBMS
CO2: Create SQL SELECT statements that retrieve any required data
CO3: Perform operations using Data Manipulation Language
statements like Insert, Update and Delete
CO4: Manipulate your data to modify and summaries your results for
reporting
CO5: Apply Grouping Clauses on various tuples & relations of
database
CO6: Develop project based on various SQL commands.
7 Course An introduction to the design and creation of relational databases.
Description Create database-level applications and tuning robust business
applications. Lab sessions reinforce the learning objectives and provide
participants the opportunity to gain practical hands-on experience.
8 Outline syllabus CO
Mapping
Unit 1 Practical based Data types
Classification SQL, Data types of SQL/Oracle CO1,CO2
Unit 2 Practical based on DDL commands
Create table, Alter table and drop table CO2,CO3
Unit 3 DML commands and Aggregate functions
Introduction about the INSERT, SELECT, UPDATE & CO3,CO4
DELETE commands.
Unit 4 Practical based on Grouping Clauses GROUP BY
ORDER BY & GROUP BY HAVING
Briefly explain Group by, order by ,having clauses with CO5
examples. Aggregate function: sum, avg, count, max, min
Unit 5 Practical based on Sub- queries, JOINS
Related example of Sub- queries, Joins and related CO5,CO6
examples,Views,Trigger

CSA, SSET, SU Page 121

 Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* Korth ,Silberschatz& Sudarshan, Data base Concepts, Tata McGraw-Hill
Other 1. Elmasri, Navathe, Fundamentals of Database Systems, Pearson Education
References Inc.
2. Thomas Connolly, Carolyn Begg, Database Systems: A Practical Approach to
design, Implementation and Management, Pearson Education, Latest
Edition.
3. Jeffrey D. Ullman, Jennifer Windon, A first course in Database Systems,
Pearson Education.

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific
Outcomes (PSO)
1. CO1: Understand the concept of SQL commands in PO1,PO5, PSO1 ,PSO2
DBMS.
2. CO2: Create SQL SELECT statements that retrieve any PO2, PO3, PO4, PO5,
required data. PO9,PSO1, ,PSO3
3. CO3: Perform operations using Data Manipulation PO2, PO3, PO4, PO5,
Language statements like Insert, Update and Delete. PO9,PSO1, ,PSO3
4. CO4: Manipulate your data to modify and summaries your PO2, PO3, PO4, PO5,
results for reporting. PO9,PSO1, ,PSO3
5 CO5: Apply Grouping Clauses on various tuples & PO2, PO3, PO4, PO5,
relations of database PO9,PSO1, ,PSO3
6 CO6: Develop project based on various SQL commands. PO2, PO3, PO4, PO5, PO9,
PO12,PSO1, PSO2,PSO3

PO and PSO mapping with level of strength for Course Name Principles of Database Management System lab
(Course Code CSP 249)

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

CO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
s
CO - 2
3 - - - 2 - - - - - - 2 3
1
CO - 3
- 3 3 3 2 - - - 3 - - 2 3
2
CO - 3
- 2 2 2 2 - - - 3 - - 2 2
3
CO - 2
- 2 2 2 2 - - - 3 - - 2 3
4
CO - - - - 2
- 2 2 2 2 - 3 - 2 3
5
CO - 3
- 2 3 2 3 - - 3 - - 2 3 3
6

CSA, SSET, SU Page 122

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

Course
Code/ PO PO PO PO PO PO PO PO PO PO PO PSO PSO
Name 1 PO2 3 4 5 6 7 8 9 10 11 12 1 PSO2 3
CSP249/
DBMS 3 2.2 2.4 2.2 2.2 - - - 3 - - 2 2.2 2.5 2.8
lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 123

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester IV
1 Course Code CSP297 Course Name: Project Based Learning -2
2 Course Title Project Based Learning -2
3 Credits 2
4 Contact Hours 0-0-4
(L-T-P)
Course Status Compulsory
5 Course Objective 1.To align student’s skill and interests with a realistic
problem or project
2.To understand the significance of problem and its scope
3.Students will make decisions within a framework
6 Course Outcomes Students will be able to:
CO1: Identify and formulate problem statement with
systematic approach.
CO2: Develop teamwork and problem-solving skills, along
with the ability to communicate effectively with others.
CO3: Design the problem solution as per the problem
statement framed.
CO4: Explain the characteristics, architecture of database
approach, describe the components of the project.
CO5: Fabricate and implement the solution by using different
object oriented concepts like encapsulation, polymorphism
etc.
CO6: Develop a glory of the need to engage in life-long
learning.
7 Course Description In PBL-1, the students will learn how to define the problem
for developing projects, identifying the skills required for
developing the project based on given a set of specifications
and all subjects of that Semester.
8 Outline syllabus CO
Mapping
Unit 1 Problem Definition, Team/Group formation and Project CO1, CO2
Assignment. Finalizing the problem statement, resource
requirement, if any.
Unit 2 Develop a work flow or block diagram for the proposed CO2,CO3
system / software.
Unit 3 Design algorithms for the proposed problem. CO3
Unit 4 Implementation of work under the guidance of a faculty CO3, CO4
member and obtain the appropriate results.
Unit 5 Demonstrate and execute Project with the team. Validate CO4, CO5,
and verify the project modules. CO6

CSA, SSET, SU Page 124

 Report should include Abstract, Hardware / Software
Requirement, Problem Statement, Design/Algorithm,
Implementation Detail. Validation Reports.
References if any.
The presentation, report, work done during the term
supported by the documentation, forms the basis of
assessment.

Mode of Practical /Viva

examination
Weight age CA MTE ETE
Distribution 25% 25 50%

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Identify and formulate problem statement PO1, PO2, PO4, PO9, PO10,
with systematic approach. PO11,
PO12,PSO1,PSO2,PSO3
2. CO2: Develop teamwork and problem-solving PO1, PO2, PO4, PO7, PO9,
skills, along with the ability to communicate PO10, PO11, PO12 ,PSO3
effectively with others.
3. CO3: Design the problem solution as per the PO1, PO2, PO5, PO9, PO10,
problem statement framed. PO11, PO12, PSO1,PSO2
4. CO4: Explain the characteristics, architecture of PO1, PO2, PO6, PO9, PO10,
database approach, describe the components of the PO11, PO12,PSO2
project.
5. CO5: Fabricate and implement the solution by PO1, PO2, PO3, PO4,PO5,
using different object oriented concepts like PO6, PO7, PO8, PO9, PO10,
encapsulation, polymorphism etc. PO11, PO12 PSO1,PSO2,
PSO3
6. CO6: Develop a glory of the need to engage in life- PO1, PO2, PO4, PO9, PO10,
long learning. PO11, PO12,PSO3

CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 3 - - - - 3 3 2 3 2 2 1
CO2 3 2 - 3 - - 2 - 3 3 2 3 1
CO3 3 2 - - 2 - - - 3 3 2 3 2 2
CO4 3 3 - - - 2 - - 3 3 2 3 2
CO5 3 3 2 2 2 2 3 3 3 3 2 3 2 2
CO6 3 3 - 3 - - - - 3 3 2 3 1

CSA, SSET, SU Page 125

 Avg PO
attaint 3 2.7 0.3 1.8 0.7 0.7 0.8 0.5 3 3 2 3 1 1.3 0.5
ed

TERM-V

CSA, SSET, SU Page 126

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
Course Name :
1 Course Code ARP 305 Personality Development and Decision making Skills

Personality Development and Decision making Skills

2 Course Title

3 Credits 2
Contact
4 Hours 1-0-2
(L-T-P)
Course
Active
Status
To enhance holistic development of students and improve their
employability skills. Provide a 360 degree exposure to learning elements of
Business English readiness program, behavioural traits, achieve softer
communication levels and a positive self-branding along with augmenting
Course numerical and altitudinal abilities. To up skill and upgrade students’ across
5
Objective varied industry needs to enhance employability skills. By the end of this
semester, a will have entered the threshold of his/her 3 rd phase of
employability enhancement and skill building activity exercise.

After completion of this course, students will be able to:

CO1: Apply skills of personality development which will help a student

groom to meet the needed social strata for establishing themselves in the
society

CO2: Build a positive behavioural attitude and attributes developing

interpersonal skills for building positive and meaningful social and
professional relationships

Course CO3: Review and revise development plans to adapt to changing aspirations,
6
Outcomes circumstances and working environments

CO4: Acquire higher level competency in use of numbers and digits, logical
and analytical reasoning

CO5: Develop higher level strategic thinking and diverse mathematical

concepts through building cubes and cuboids.

CO6: Demonstrate higher level quantitative aptitude such as analytical and

statistical tools for making business decisions.

This bundles Training approach attempts to explore the personality,

Course character, and the natural style of the student. This helps to develop
7 character, personality, confidence and interpersonal abilities within the
Description
student along with level 3 readiness in quant, aptitude and reasoning skills
8 Outline syllabus – ARP305

CSA, SSET, SU Page 127

 CO
Unit 1 Impress to Impact
MAPPING
What is Personality?| Creating a positive impression – The 3 V’s of CO1
A Impression | Individual Differences and Personalities
Personality Development and Transformation | Building Self Confidence | CO2
B Behavioural and Interpersonal Skills
Avoiding Arguments | The Art of Assertiveness | Constructive Criticism | CO3
C The Personal Effectiveness Grid | Assessing our Strengths & Limitations
and Creating an Action Plan for Learning with the 4M Model
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
A Numbers & Digits , Mathematical Operations | Analytical Reasoning CO4
B Cubes & Cuboids | Statement & Assumptions CO5
C Strong & Weak Argument CO5
Unit 3 Quantitative Aptitude
A Work & Time ,Pipes & Cistern CO6
B Time ,Speed & Distance, Quadratic & Linear Equations, Logs & Inequalities CO6
Sequence & Series, Logarithms, Data Interpretation | Data sufficiency - CO6
C Level 1
Unit 4 Verbal Abilities-3
A Cloze Test CO3
B Sentence Rearrangement CO3
Unit 5 Charisma Building
A How to Build Charisma CO2
B Steps Towards Building a Charisma CO2
C
Weightage
CA-25% MTE-25% ETE-50%
Distribution
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – Arihant Publications | Quicker
Text Maths- M. Tyra | Power of Positive Action (English, Paperback, Napoleon Hill) | Streets of
book/s* Attitude (English, Paperback, Cary Fagan, Elizabeth Wilson) The 6 Pillars of self-esteem
and awareness – Nathaniel Brandon | Goal Setting (English, Paperback, Wilson Dobson

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 - - - - - 1 - - 1 2 1 2 - - -

CO2 - - - - - 1 - - 1 2 1 2 - - -

CO3 - - - - - - - - 1 2 1 2 - - -

CO4 1 - - - - - - - 1 2 1 2 - - -

CO5 1 - - - - - - - 1 2 1 2 - - -

CO6 1 - - - - - - - 1 2 1 2 - - -

CSA, SSET, SU Page 128

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27

Department Computer Science & Applications

Programme B.Tech, Academic Year: 2023-24

Semester V

1 Course Code CSE021

2 Course Title Introduction to Cloud Computing

3 Credits 3

4 Contact 3 0 0
Hours
(L-T-P)

Course Core
Status

5 Course This introductory course on Cloud computing will teach both the
Objective fundamental concepts of how and why Cloud systems works, as well as
Cloud technologies that manifest these concepts.

6 Course At the end of the course, students will have achieved the following
Outcomes learning objectives.
CO1. Define the basics of cloud and recall the computer Science
concepts which are helpful in understanding on demand service
architecture.
CO2. Classify and describe the architecture and taxonomy of parallel
and distributed computing, including shared and distributed
memory, and data and task parallel computing.
CO3. Apply the PAAS and SAAS to manage the workflow and use
of cloud in scientific application.
CO4. Categorize and Characterize between Infrastructure services,
deployment models, and governance in cloud computing.
Examine the design of task and data parallel distributed
algorithms for Clouds and use them to construct Cloud
applications.

CSA, SSET, SU Page 129

 CO5. Evaluate the importance of cloud using monitoring and
management of services for performance improvement of HPC
and to follow the Governance and Compliances.
CO6. Elaborate the design concept and formulate to build the solution
using cloud service providers as AWS, MS Azure, and Google
Cloud. Demonstrate the use of Map-Reduce, Vertex-Centric
and Continuous Dataflow programming models.

7 Course This course is an introductory course for cloud computing concepts and
Description helps in understanding the core functionalities, algorithms, models and
workflows in cloud environment. In this course Students will get
demonstrations of real-time cloud services for better exposure and
research understanding.

8 Outline syllabus CO Mapping

Unit 1 FOUNDATIONS

A Introduction to compute CO1

Types of Computing, Grid computing, distributed
computing, Client-server computing, Three Tier
Architecture, use of Sockets and Remote Procedure
Call, working of RMI and CORBA, Web services, Web
Sockets, Message Queues and Message Brokers.

B Introduction to Cloud Computing CO1

Cloud Computing definition, Roots of Cloud
Computing, Layers and Types of Clouds, Desired
Features of a Cloud, Cloud Infrastructure Management,
Infrastructure as a Service Providers, Platform as a
Service Providers, Challenges and Risks

C Migrating and Integrating into Cloud CO1

Broad Approaches to Migrating into the Cloud, The
Seven-Step Model of Migration into a Cloud,
Enriching the ‘Integration as a Service’ Paradigm for
the Cloud Era, Evolution and Challenges of SaaS
Paradigm, Integration Scenarios, The Integration
Methodologies

Unit 2 ENTERPRISE CLOUD COMPUTING AND IAAS

A The Enterprise Cloud Computing Paradigm CO1,CO2

Issues for Enterprise Applications on the Cloud,
Transition Challenges, Enterprise Cloud Technology
and Market Evolution, Business Drivers Toward a

CSA, SSET, SU Page 130

 Marketplace for Enterprise Cloud Computing, The
Cloud Supply Chain

B Virtual Machines Provisioning and Migration CO1,CO2

Services
Introduction to Virtual Machines, The Anatomy of
Cloud Infrastructures, VM Provisioning and
Manageability, Virtual Machine Migration Services,
Management of Virtual Machines for Cloud
Infrastructures,, Distributed Management of Virtual
Infrastructures, Scheduling Techniques

C Enhancing Cloud Computing Environments Using CO1,CO2

a Cluster as a Service
Introduction and Related Work, RVWS Design,
Cluster as a Service: The Logical Design, Secure
Distributed Data Storage in Cloud Computing, Cloud
Storage, Technologies for Data Security in Cloud
Computing

Unit 3 PLATFORM AND SOFTWARE AS A SERVICE

A Aneka and CometCloud CO1,CO3

Aneka—Integration of Private and Public Clouds,
Technologies and Tools for Cloud Computing, Aneka
Cloud Platform, CometCloud: An Autonomic Cloud
Engine, Introduction of CometCloud (Architecture,
Autonomic Behavior, Applications overview)

B Business Solutions and WorkFlow

Cloud-Based Solutions for Business Applications CO1,CO3,CO6
(Introduction of Enterprises Demand and Cloud
Computing, Dynamic ICT Services), Workflow
Engine for Clouds, Workflow Management Systems,
Architecture of Workflow Management Systems

C Scientific Applications and MapReduce Model

Scientific Application for Cloud Environments, CO1,CO3,CO6
Classification of Scientific Applications and Services
in the Cloud, SAGA-based Scientific Applications,
MapReduce Programming Model, MapReduce
Impacts and Research Directions

Unit 4 MONITORING, MANAGEMENT &

GOVERNANCE

A SLA Management in Cloud Computing CO1,CO4

Introduction of typical Use Cases, Model for Federated
Cloud Computing, Security Considerations, SLA

CSA, SSET, SU Page 131

 Management in Cloud Computing: A Service
Provider’s Perspective, Types of SLA, Life Cycle of
SLA, Automated Policy-based Management

B Performance Predictions for HPC on Clouds CO1,CO4

Introduction and Background of Grid and Cloud, HPC
in the Cloud: Performance-related Issues, Game
Hosting on Cloud Resources, Building Content
Delivery Networks Using Clouds, Resource Cloud
Mashups

C Security and Governance CO1,CO4

Basic Concept of Organizational Readiness, Drivers
for Changes: Common Change Management Models,
Security and Risk in the Cloud, Cloud Computing and
Identity, Content Level Security—Pros and Cons,
Legal Issues in Cloud Computing(PCI DSS), Data
Privacy and Security Issues

Unit 5 AWS, MS AZURE AND GOOGLE CLOUD

A AWS Services:EC2, IAM, S3, Lambda, EBS, CDN, CO1,

CloudWatch, CO5,CO6

B MS Azure Services:Azure VM , SQL Server on

Virtual Machines, Azure SQL Database,Azure Active CO1,CO5,Co6
Directory, Azure Backup

C Google Cloud: Compute Engine,Migrate for Compute

Engine, Cloud Functions, Gsuite Admin,Cloud Lab CO1,CO5,CO6
Balancing ,Cloud Storage

Mode of Theory/Jury/Practical/Viva
examination

Weightage CA MTE ETE

Distribution
25% 25% 50%

Text book/s* 1. CLOUD COMPUTING Principles and Paradigms,

Edited by Rajkumar Buyya, Jam
2. Cloud Computing: A Practical Approach, Anthony
T. Velte, Toby J. Velte, Robert Elsenpeter

Other NA
References

CSA, SSET, SU Page 132

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)

1. Define the basics of cloud and recall the PO1,PO2,PO3,PO4

computer Science concepts which are helpful
in understanding on demand service
architecture. Classify and describe the
architecture and taxonomy of parallel and
distributed computing, including shared and
distributed memory, and data and task parallel
computing.
2. Define the basics of cloud and recall the PO1,PO2,PO3,PO4
computer

3. Apply the PAAS and SAAS to manage the PO1,PO2,PO3,PO4,PSO2,PSO3

workflow and use of cloud in scientific
application.
4. Categorize and Characterize between PO1,PO2,PO3,PO4,PSO2,PSO3
Infrastructure services, deployment models,
and governance in cloud computing. Examine
the design of task and data parallel distributed
algorithms for Clouds and use them to construct
Cloud applications.
5. PO1,PO2,PO3,PO4,PSO2,PSO3
Evaluate the importance of cloud using
monitoring and management of services for
performance improvement of HPC and to
follow the Governance and Compliances

6. Elaborate the design concept and formulate to

build the solution using cloud service providers PO1,PO2,PO3,PO4,PSO1,PSO2,PSO3
as AWS, MS Azure, and Google Cloud.
Demonstrate the use of Map-Reduce, Vertex-
Centric and Continuous Dataflow
programming models.

PO and PSO mapping with level of strength for Course Name Introduction to Cloud
Computing (Course Code CSE021)

P P P P P P P P P P PS
Course CO PO PO PS PS
O O O O O O O O O O O
Code_ ’s 2 4 O2 O3
1 3 5 6 7 8 9 10 11 12 1

CSA, SSET, SU Page 133

 Course
Name

CO
2 3 1 2
1
CO
2 2 2 3
2
CSE021
Introduct CO
1 3 1 2 2 3
ion to 3
Cloud CO
Computi 3 1 2 2 3 2
4
ng
CO
2 2 3 1 2 2
5
CO
1 3 1 2 2 3 3
6

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

Cou P P P P P P
Cours P P P P P P P P P
rse O O O S S S
e O O O O O O O O O
Cod 1 1 1 O O O
Name 1 2 3 4 5 6 7 8 9
e 0 1 2 1 2 3
Introdu
ction
1. 1.
CSE to 2. .3 1. 1.
8 6 2
021 Cloud 33 3 66 67
3 6
Compu
ting

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 134

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code CSE 024
2 Course Title Web Technologies
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course The objective of this course is to provide a foundation of technologies
Objective and technical skills in web development. Based upon the development
of a web, this course provides an insight of computer and networking
technologies, and hands on experience in web programming.
6 Course CO1: Define the basic concept of HTML
Outcomes CO2: Illustrate the basics of PHP
CO3:Develop interactive web pages using HTML5 and CSS3
CO4: Design web pages/site having validation on user data access.
CO5:Compare relationship of HTML, Javascript and PHP
CO6:Develop web site for business and organization or for individual
7 Course The purpose of this course is to give students the basic understanding
Description of Web pages and technologies to be used for designing web sites.

8 Outline syllabus CO Mapping

Unit 1 HTML & HTML 5
A HTML basic tags, various links implementation, CO1
image, image map, table formatting, Lists, form
design.
B Page layout design using frame, div and span CO1
tag, iframe
C HTML5: New elements, canvas, offline CO1,CO3
webpage, HTML Media: video, audio
Unit 2 CSS &CSS3
A Introduction, syntax, selector: class and id, text CO3
formatting, margin, align, pseudo-class, pseudo-
element
B Positioning, background formatting, Navigation CO3
bar, and image gallery.
C CSS3: Introduction, colors, text formatting, CO3
fonts formatting, Background formatting, 2D
transform, animation
Unit 3 Java script
A Introduction, syntax, comment, statement, CO4,CO5
variable, operators

CSA, SSET, SU Page 135

 B Conditional statements, looping statements, CO4,CO5
Functions
C Object, events, Accessing form elements, CO4,CO5
validating form elements, popup windows.
Unit 4 PHP Basics
A Introduction to PHP, syntax, variables, operators CO2,CO5
B Conditional statement, iterative statements, CO2,CO5
Functions
C Array: single, multi-dimensional, numeric array, CO2,CO5
associative array
Unit 5 File Handling in PHP
A File Operation: Reading & writing data on web page CO5,CO6
from file, deleting file, renaming file
B Session Management: introduction, creation, CO5,CO6
destroying and login session management
C PHP Database Connectivity, Retrieving records, CO5,CO6
retrieving fields from record
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s*
1. Ivan Bayross,”HTML,DHTML, JavaScript, Perl
& CGI”, BPB Publication
2. Schildt H, “The Complete Reference JAVA2”,
TMH
3. Schildt H, “The Complete Reference J2EE”,
TMH
Other 1. Rick Delorme,” Programming in HTML5 with
References JavaScript and CSS3”, Microsoft

CO and PO Mapping
S. Programme Outcomes (PO) & Programme Specific Outcomes
Course Outcome
No. (PSO)

1. Define the basic PO5,PSO2

concept of HTML
Illustrate the
2. basics of PO5,PSO2,PO12
Extensible markup
language.
Develop
3. interactive web PO2,PO3,PO5,PO6,PO9,PSO1,PSO2,PSO3
pages using
HTML5 and CSS3

4. Design web PO2,PO3,PO5,PO6,PO9,PSO1,PSO2,PSO3

pages/site having

CSA, SSET, SU Page 136

 validation on user
data access.
Compare
5. relationship of PO5,PSO2
HTML,Javascript
and PHP
Develop web site
for business and PO1,
6.
organization or for PO2,PO3,PO4,PO5,PO6,PO7,PO9,PO11,PO12,PSO1,PSO2,PSO3
individual

PO and PSO mapping with level of strength for Course Name Web Technologies (Course
Code CSE352)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s 3
PO4 PSO2 PSO3
Course Name 1 2 5 6 7 8 9 10 11 12 1
CO1 1 1
CO2 3 1 1
CSE024_ CO3 1 3 2 1 2 1 2 2
Web CO4 1 3 1 1 2 1 2 2
Technologies
CO5 2 1
CO6 2 3 3 1 3 3 1 3 2 2 1 2 3

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

Course Course PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

PO2 3
Code Name 1 4 5 6 7 8 9 10 11 12 1 2 3
Web
CSE 024
Technologies
2 1.6 2.3 1 2 1.6 1 0 2.2 0 2.3 1.5 1 1.5 2.2

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 137

Syllabus: CSE350, Design and Analysis of Algorithms

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code CSE356 Course Name: Design and Analysis of Algorithms
2 Course Title Design and Analysis of Algorithms
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course UG
Status
5 Course Objective of this course is to
Objective 1. Reinforce basic design concepts (e.g., pseudo code,
specifications, top-down design)
2. Knowledge of algorithm design strategies
3. Familiarity with an assortment of important algorithms.
4. Enable students to analyze time and space complexity
6 Course Students will be able to:
Outcomes CO1: Analyze the asymptotic performance of algorithms
CO2: Describe the dynamic-programming and Greedy paradigm
and explain when an algorithmic design situation calls for it.
CO3: Demonstrate a familiarity with major algorithms and data
structures
CO4: Apply important algorithmic design paradigms and methods
of analysis
CO5: Discuss NP-complete problems and develop algorithms to
solve the problems.
CO6: Choose appropriate algorithm design techniques for solving
problems.
7 Course This course introduces concepts related to the design and analysis
Description of algorithms. Specifically, it discusses recurrence relations, and
illustrates their role in asymptotic and probabilistic analysis of
algorithms. It covers in detail greedy strategies divide and conquer
techniques, dynamic programming and max flow - min cut theory
for designing algorithms, and illustrates them using a number of
well-known problems and applications.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Introduction : Algorithms, Analyzing CO1, CO3
algorithms, Complexity of algorithms,
Growth of functions, Performance
measurements
B Asymptotic Notations and their properties – CO1, CO2, CO3
Mathematical analysis for Recursive and

CSA, SSET, SU Page 138

 Non-recursive algorithms, Recurrences
relations, Master Method
C Divide-and-conquer: Analysis and Structure CO1, CO2, CO4
of divide-and-conquer algorithms, Divide-
and-conquer examples-Quick sort, Merge
sort,
Sorting in Linear Time, Heap Sort
Unit 2 Dynamic Programming
A Overview, Difference between dynamic CO1,CO2,CO3,
programming and divide and conquer, All CO4
pair shortest path problems: Floyd-Warshall
Algorithm
B Applications and analysis: Matrix Chain CO1, CO2, CO3,
Multiplication, 0/1 Knapsack Problem CO4
C Applications and analysis: Longest Common
sub-sequence, Optimal Binary Search tree
Unit 3 Greedy Method CO1,CO2,CO3
A Overview of the Greedy paradigm, Analysis CO1,CO2,CO3
and example: task scheduling,
B Fractional Knapsack problem, Single source CO1,CO2,CO3
shortest paths problem: Dijkastra’s
Algorithm, Bellman-ford Algorithm,
C Overview and analysis of Backtracking &
Branch and Bound: N-Queens problem and
Sum of subsets
Unit 4 Selected Topics CO1,CO2,CO3,
A Introduction to NP Complete and NP Hard CO1,CO2,CO3,
Problems, Examples, Amortized Analysis
B Approximation Algorithms – Travelling CO1,CO2,CO3
Sales Person Problem and Vertex Cover
Problem, Randomized Algorithms,
Randomized Quick Sort Algorithm
C String Matching Algorithms – Naive String CO1,CO2,CO3,
Matching Algorithm, Rabin Karp Algorithm. CO4
Unit 5 Advanced Data Structures
A Red-Black Trees - Definition, Applications, CO1, CO2, CO3,
Insertion and deletion of elements in RB- CO4
Tree
B B-Trees - Definitions, Applications, Insertion CO1, CO2, CO4
and Deletion in B-Trees
C Data Structure for Disjoint Sets – Definition, CO1, CO2, CO3,
Binomial Heaps, Fibonacci Heaps. CO4
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Cormen et al., “Introduction of
Computer Algorithms”, Prentice Hall
India

CSA, SSET, SU Page 139

 Other 1. Sahni et al., “Fundamentals of Computer
Algorithms”, Galgotia Publications.
References
2. Hopcroft A, The Design And Analysis
Computer Algorithms, Addison Wesley
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) & Programme
No. Specific Outcomes (PSO)
1. CO1: Analyze the asymptotic PO1, PO2, PO3, PO4, PO9, PSO1, PSO2,
performance of algorithms PSO3

2. CO2: Describe the dynamic- PO1, PO2, PO3, PO4, PO9, PSO1, PSO2,
programming and Greedy paradigm PSO3
and explain when an algorithmic
design situation calls for it.
3. CO3: Demonstrate a familiarity with PO1, PO2, PO3, PO9, PSO1, PSO2
major algorithms and data structures

4. CO4: Apply important algorithmic PO1, PO2, PO3, PO4, PO9, PSO1, PSO2,
design paradigms and methods of PSO3
analysis
5. CO5: Discuss NP-complete problems PO1, PO2, PO3, PO4, PO9, PSO1, PSO2,
and develop algorithms to solve the PSO3
problems.
6. CO6: Choose appropriate algorithm PO1, PO2, PO3, PO4, PO5, PO9, PSO1,
design techniques for solving PSO2
problems.

PO and PSO mapping with level of strength for Course Name Design and Analysis of
Algorithms Course Code CSE 354)

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3

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

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

CO 1 2 2 3 - -- -- - 2 - - - 2 2 2
4
CO
3 3 1 3 - - - - 3 - - - 2 1 3
5
CO
2 2 3 2 2 - - -- 2 - - - 3 2 -
6

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

CSA, SSET, SU Page 140

 Cou
rse Course P P P P P P P P P PO PO PO PS PS PS
Cod Name O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
e

Design
and
CSE Analysi 2.1 1.8
2 2.4 2 - - - 2.2 - - - 2.5 2 2.3
350 s of 7 3
Algorit
hms

CSA, SSET, SU Page 141

Syllabus: Design and Analysis of Algorithm lab

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code CSP 356
2 Course Title Design and Analysis of Algorithm lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Status Compulsory/Elective
5 Course Objective of this course is to
Objective 1. Reinforce basic design concepts (e.g., pseudocode, specifications,
top-down design)
2. Knowledge of algorithm design strategies
3. Familiarity with an assortment of important algorithms.
4. Enable students to analyze time and space complexity
6 Course Students will be able to:
Outcomes CO1: calculate time complexity of searching algorithm
CO2: Write program based on dynamic programming.
(same as CO3: apply greedy algorithm to any problem
theory course) CO4: develop program based on advanced data structure
CO5: design a program based on different string matching algorithm
CO6: implement real world problem based on greedy and dynamic
algorithm
7 Course This course introduces concepts related to the design and analysis of
Description algorithms. Specifically, it discusses recurrence relations, and illustrates
their role in asymptotic and probabilistic analysis of algorithms. It covers in
detail greedy strategies divide and conquer techniques, dynamic
programming and max flow - min cut theory for designing algorithms, and
illustrates them using a number of well-known problems and applications.
8 Outline syllabus CO Mapping
Unit 1 Practical based on Searching and sorting
1. WAP to demonstrate the concept of Linear CO1
and Binary Search
2. WAP to implement Merge sort
3. WAP to implement Quick Sort

Unit 2 Practical based on Dynamic Programming

1. WAP to implement Matrix Chain CO2, CO6
Multiplication problem
2. WAP to demonstrate the concept of
Longest Common Subsequence(LCS)
3. WAP to demonstrate concept of 0 – 1
Knapsack Problem

Unit 3 Practical based on Greedy Programming

CSA, SSET, SU Page 142

 1. WAP to demonstrate concept of Minimum CO3, CO6
Spanning Tree(Prim’s Algorithm)
2. WAP to demonstrate concept of Fractional
Knapsack Problem
3. WAP to implement single source shortest
problem using Dijkastra’s Algorithm

Unit 4 Practical based on Advance concepts

WAP to demonstrate concept of Red Black Tree insertion CO4
and Deletion
Unit 5 Practical based on String Matching
1. WAP to demonstrate the concept of Naïve String CO5
matching algorithm.
2. WAP to demonstrate the concept of Robin Karp
Algorithm.

Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%

PO and PSO mapping with level of strength for Course Name Design and Analysis of
Algorithms Lab. Course Code CSP 350)

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3

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

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

CO 2 3 3 3 1 -- -- - 3 - - - 3 3 1
4
CO
3 2 2 3 2 - - - 2 - - - 2 3 2
5
CO
2 3 3 1 3 - - -- 1 - - - 3 2 3
6

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

Cou
rse Course P P P P P P P P P PO PO PO PS PS PS
Cod Name O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2 O3
e

CSA, SSET, SU Page 143

 Design
and
Analysi
CSP
s of 2.5 2.7 2.5 2.4 2 - - - 1.8 - - - 2.5 2.3 2.2
350 Algorit
hms
Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 144

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code CSP354 Course Name: Project Based Learning -3
2 Course Title Project Based Learning -3
3 Credits 2
4 Contact Hours 0-0-4
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To align student’s skill and interests with a realistic
problem or project.
2.To understand the significance of problem and its scope.
3.Students will make decisions within a framework.
6 Course Outcomes Students will be able to:
CO1: Identify and formulate problem statement.
CO2: Design relational database schema.
CO3: Develop the solution by using different aspects of
programming language.
CO4: Classify and understand various test techniques for
verification and validation of project.
CO5: Analyze and make use of modern for solving real word
problems.
CO6: Develop teamwork and need to engage in life-long
learning, along with the ability to communicate effectively with
others.
7 Course Description In PBL-3, the students will learn how to define the problem for
developing projects, and Design applicable solutions in one or
more application domains using software engineering
approaches that integrate ethical, social, legal and economic
concerns.
8 Outline syllabus CO Mapping
Unit 1 Problem Definition and identification, Team/Group CO1,CO4
formation and Project Assignment. Finalizing the
problem statement, resource requirement, if any.
Unit 2 Use of the relational algebra operations from CO2,CO6
mathematical set theory (union, intersection,
difference, and Cartesian product) and the relational
algebra operations developed specifically for
relational databases (select (restrict), project, join,
and division)..
Unit 3 Design; implement project work in any programming CO3
language.
Unit 4 Use of various test tools and techniques for software CO4,CO5
verification and validation of project
Unit 5 Demonstrate and execute Project with the team. CO6

CSA, SSET, SU Page 145

 Report should include Abstract, Hardware / Software
Requirement, Problem Statement,
Design/Algorithm, ER diagrams, Use Case Diagrams,
State Diagrams, Sequence Diagrams, Communication
Diagrams, and Activity Diagrams, Implementation
Detail. Validation Reports.
References, Test cases if any.
The presentation, report, work done during the term
supported by the documentation, forms the basis of
assessment.
Mode of Practical /Viva
examination
Weight age CA CE ETE
Distribution
25% 25% 50%

CO and PO Mapping

S. No. Course Outcome Programme Outcomes (PO)

PO1, PO2, PO4,PO6, PO8,PO9,
CO1: Identify and formulate problem
1. PO10, PO11,
statement.
PO12,PSO1,PSO2,PSO3
PO1, PO2, PO3,PO4,PO5, PO7,
2. CO2: Design relational database schema. PO8, PO9, PO11, PO12 ,
PSO1,PSO2,PSO3
PO1, PO2, PO3,PO4,PO5, PO6,
CO3: Develop the solution by using different
3. PO8, PO9, PO11, PO12,
aspects of programming language.
PSO1,PSO2
CO4: Classify and understand various test PO1, PO2, PO3,PO4,PO5,
4. techniques for verification and validation of PO8,PO9, PO10, PO11, PO12
project. ,PSO1,PSO2,PSO3
CO5: Analyze and make use of modern for PO1, PO2, PO5, PO6, PO7,
5.
solving real word problems. PO8, PO9, PO12 PSO1,PSO2
CO6: Develop teamwork and need to engage
PO2, PO4, PO8,PO9, PO10,
6. in life-long learning, along with the ability to
PO11, PO12,PSO1,PSO3
communicate effectively with others.

CSA, SSET, SU Page 146

 PO and PSO mapping with level of strength for Course Name Project Based Learning -3 (Course
Code CSP354)
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 2 - 1 - 1 2 - 2 1 2 2 3
CO2 3 2 2 2 2 - - 1 2 - 2 1 2 1 1
CO3 3 2 2 2 2 3 - 1 2 - 2 1 2 2 -
CO4 3 3 2 2 3 - - 1 2 - - 1 2 2 2
CO5 3 2 - - 3 - - 1 2 - - 1 2 2 -
CO6 1 - 1 - - - 2 2 3 3 3 1 - 1
Avg
PO
3 2.2 1 1.5 1.7 0.7 0 1.2 2 1 2 1 2 1.5 1.2
attain
ed

CSA, SSET, SU Page 147

Syllabus: CSP 391, Summer Internship-II
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code CSP391 Course Name: Summer Internship-II
2 Course Title Summer Internship-II
3 Credits 2
4 Contact 0-0-4
Hours
(L-T-P)
Course Status UG
5 Course 1. Experience the activities and functions of business professionals.
Objective 2. Develop and refine oral and written communication skills.
3. Identify areas for future knowledge and skill development.
6 Course ● Students will be able to:
Outcomes ● CO1. Integrate the concepts and strategies of academic study in a real time
environment.
● CO2. Identify, formulate and model problems and find engineering solution
based on a systems approach.
CO3. Develop teamwork and apply prior acquired knowledge in problem
solving.
● CO4. Develop communication, interpersonal and other critical skills required for
career growth.
● CO5. Practice engineer’s responsibilities, self-understanding, self-discipline and
ethical standards.
● CO6. Explore career alternatives prior to graduation.
7 Course An internship experience provides the student with an opportunity to explore
Description career interests while applying knowledge and skills learned in the classroom in
a work setting. The experience also helps students gain a clearer sense of what
they still need to learn and provides an opportunity to build professional
networks.
8 Outline syllabus CO Mapping
Unit 1 Define objectives and conditions for the internship, CO1,CO2
ensuring students that it is related to the study path
carried out at the University
Unit 2 Problem Definition and identification, CO2
Team/Group formation and Project Assignment.
Finalizing the problem statement, resource
requirement, if any.
Unit 3 The internship work plan is drawn up by developing CO3
team work and applies prior acquired knowledge in
problem solving.
Unit 4 Demonstrate and execute Project with the team. CO4
Submission of evaluation form and final report
completed by the intern.
Unit 5 Final evaluation form completed by the supervisor at CO5,CO6
the Host Organization and final presentation before
departmental committee.

CSA, SSET, SU Page 148

 Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%

CO and PO Mapping

S. Course Outcome Programme Outcomes (PO)

No.
1. CO1. Integrate the concepts and PO1,PO2,PO4,PO5,PO7,PO8,PO9,PSO1,PSO2,PSO3
strategies of academic study in
a real time environment.
2. CO2. Identify, formulate and PO1,PO2,PO3,PO4,PO5,PO7,PO8,PO9, PSO1,PSO2
model problems and find
engineering solution based on a
systems approach.
3. CO3. Develop teamwork and PO1,PO3,PO4,PO5, PO8,PO9,PO11,PO12,
apply prior acquired PSO1,PSO2,PSO3
knowledge in problem
solving.
4. CO4. Develop communication, PO8,PO10
interpersonal and other critical
skills required for career growth.
5. CO5. Practice engineer’s PO6,PO8
responsibilities, self-
understanding, self-discipline
and ethical standards.
6. CO6. Explore career PO12,PSO1,PSO2
alternatives prior to
graduation.

PO and PSO mapping with level of strength for Course Name Summer Internship-II
(CSP391)
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 2 2 - 3 2 - 1 1 1 - - - 1 2 2
CO2 1 2 1 2 2 - 1 1 1 - - - 1 2 -
CO3 2 - 2 2 2 - - 1 3 - 1 1 1 2 2
CO4 - - - - - - - 1 - 3 - - - - -
CO5 - - - - - 2 - 3 - - - - - - -
CO6 - - - - - - - - - - - 2 2 2 -
Avg
1 0.7 0.5 1.2 1 0.3 0.3 1.2 1 1 0 1 1 1.3 0.7
PO

CSA, SSET, SU Page 149

 attaine
d

CSA, SSET, SU Page 150

Technical Skill Enhancement Course-1 (Simulation Lab)

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code CSP 395 Technical Skill Enhancement Course-1 ( Simulation
Lab)
2 Course Title Simulation Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Lab
Status
5 Course The objective of this course is to provide the basic programming
Objective conceptsof MATLAB such as – functions, arrays, loops, conditional
statements, procedures.It alsoexpose students with visual
representations of a model and its results.
6 Course Students will be able to:
Outcomes CO1:Use basic fundamentals to write simple Matlab programs.
CO2: Plot graphs in Matlab and use procedural functions.
CO3: Writing Matlab programs with logic and flow control.
CO4:Manipulate and work with text files.
CO5:Make use of graphical user interfaces in MATLAB.
CO6: Apply MATLAB Programming to solve real life problem
7 Course This course introduces the concepts of MATLAB programming,
Description Modelling and simulation to identify the problems, and choose the
relevant models and algorithms to apply. Matlab is used for scientific
applications involving images, sound, and other signals.
8 Outline syllabus CO Mapping
UNIT-1 Introduction to MATLAB CO1,CO6
A Programming Environment: MATLAB Windows, A
First Program
B Expressions, Constants, Variables and assignment
statement
C Arrays
UNIT-2 Graph Plots, Procedures and Functions CO2,CO6
A Basic plotting, Built in functions, Generating
waveforms, Sound replay, load and save
B Procedures and Functions: Arguments and return
values, M-files
C Formatted console input-output, String handling
UNIT-3 Control Statements CO3,CO6
A Conditional statements: If, Else, Else-if
B Repetition statements: While
C Repetition statements: for loop

CSA, SSET, SU Page 151

 UNIT-4 Manipulating Text CO4,CO6
A Writing to a text file, Reading from a text file
B Randomising and sorting a list
C Searching a list
UNIT-5 GUI Interface CO5,CO6
A Attaching buttons to actions
B Getting Input, Setting Output
C Develop MATALB Application
Weightage CA CE ETE
Distribution 25% 25% 50%

CO and PO Mapping
Mapping between Cos and Pos, PSO’s
Sl. Course
No Outcomes Mapped Programme Outcomes and PSO’s
. (COs)
CO1: Use
basic
fundamentals
1 PO1,PO3,PO5,PO12,PSO1,PSO2,PSO3
to write simple
Matlab
programs.
CO2: Plot
graphs in
Matlab and use
2 procedural PO1,PO3,PO5,PO10,PO12,PSO1,PSO2,PSO3
functions.

CO3: Writing
Matlab
3 programs with PO1,PO2,PO3,PO5,PO12,PSO1,PSO2,PSO3
logic and flow
control.
CO4:Manipula
4 te and work PO1,PO3,PO5,PO12,PSO1,PSO2,PSO3
with text files.
CO5:Make use
of graphical
5 PO1,PO3,PO5,PO12,PSO1,PSO2,PSO3
user interfaces
in MATLAB.
CO6: Apply
MATLAB
PO1,PO2,PO3,PO4,PO5,PO6,PO7,PO8,PO9,PO10,PO11,PO12,PSO1,PSO
6 Programming 2,PSO3
to solve real
life problem

CSA, SSET, SU Page 152

PO and PSO mapping with level of strength for Course Name: Technical Skill Enhancement
Course-1 CSP 395)
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

COs
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 1 - 1 - 2 - - - - - - 1 1 2 1

CO2 1 - 1 - 2 - - - - 2 - 1 1 2 1

CO3 1 2 1 - 2 - - - - - - 1 1 2 1

CO4 1 - 1 - 2 - - - - - - 1 1 2 1

CO5 1 - 1 - 2 - - - - - - 1 1 2 1

CO6 2 2 3 3 2 2 1 - 2 3 2 2 2 3 1
Avg
PO
1 0.7 1.3 0.5 2 0.3 0.2 0 0 1 0 1 1 2.2 1
attaine
d

CSA, SSET, SU Page 153

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester V
1 Course Code INT021
2 Course Title Ethical Hacking
3 Credits 3
4 Contact
Hours 3-0-0
(L-T-P)
Course
OE
Status
5 Course To provide students about the Ethical hacking Concepts, importance of
Objective ethical hacking in IT and Working structure of hacking
6 Course On successful completion of this module students will be able to:
Outcomes CO1: Define the description of ethical Hacking
CO2: Illustrate Types of Ethical Hacking.
CO3: Explain about web and network hacking
CO4: Demonstrate report writing and Mitigation
CO5: Formulate the use of safe techniques on the World Wide Web
CO6: Analyze various digital forensic problems
7 Course This course introduces ethical hacking concept and application of
Description ethical hacking in network security.
8 Outline syllabus Outline
syllabus
Unit 1 Introduction to Ethical Hacking
A Security Fundamental, Security testing, Hacker and
CO1
Cracker, Descriptions
B Test Plans-keeping It legal, Ethical and Legality CO1, CO2
C The Attacker’s Process, The Ethical Hacker’s CO1,
Process, Security and the Stack CO2,CO4
Unit 2 Foot printing and Scanning
A Information Gathering, Determining the Network
CO1, CO2
Range, Identifying Active Machines
B Finding Open Ports and Access Points, OS
Fingerprinting Services, Mapping the Network CO1, CO2
Attack Surface
C CO1,
Enumeration, System Hacking
CO2,CO5,CO6
Unit 3 Malware Threats

CSA, SSET, SU Page 154

 A Viruses and Worms, Trojans, Covert
CO1,CO2,CO3
Communication
B Keystroke Logging and Spyware, Malware Counter
CO1,CO2,CO3
measures
C Sniffers, Session Hijacking, Denial of Service and
CO1,CO2,CO3
Distributed, Denial of Service
Unit 4 Web Server Hacking
A Web Server Hacking, Web Application Hacking CO2,CO3,CO4
B Database Hacking CO3,CO4
C Wireless Technologies, Mobile Device Operation CO2,
and Security, Wireless LANs CO4,CO5
Unit 5 IDS, Firewalls and Honeypots
A Intrusion Detection Systems, Firewalls, Honeypots CO2,CO5,
B Physical Security, Social Engineering CO3,CO5,CO6
C Case Studies CO4,CO5,CO6
Mode of
Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1.Ec-Council, “Ethical Hacking and
Countermeasures: Attack Phases”, Delmar
Cengage Learning, 2009.
2. Michael T. Simpson, Kent Backman, James
E. Corley, “Hands-On Ethical Hacking and
Network Defense”, Cengage Learning, 2012

Other 3. Patrick Engebretson, “The Basics of

References Hacking and Penetration Testing – Ethical
Hacking and Penetration Testing Made Easy”,
Syngress Media, Second Revised Edition,
2013.
4. Jon Erickson, “Hacking: The Art of
Exploitation”, No Starch Press, Second
Edition, 2008.

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Define the description of ethical Hacking PO1,PO2, PO5, PO8,PO12,PSO3
2. CO2: Illustrate Types of Ethical Hacking. PO1, PO2, PO3, PSO3

CSA, SSET, SU Page 155

 3. CO3: Explain about web and network hacking PO1, PO2, PO3, PO5, PO9, PO12,
PSO1
4. CO4: Demonstrate report writing and PO1, PO2, PO4, PO5, PO6, PO8,
Mitigation PSO2
5. CO5: Formulate the use of safe techniques on PO1, PO2, PO3,PO8,PO9,PSO2,
the World Wide Web
6. CO6: Analyze various digital forensic PO1, PO2, PO4, PO5,
problems PO6,PO7,PO10,PO11,PSO1

PO and PSO mapping with level of strength for Course Name Ethical Hacking (Course
Code INT 021)

Course Code_ PO PO PO PO PO PO PO PO PO PO PSO

CO’s PO1 PO4 PSO2 PSO3
Course Name 2 3 5 6 7 8 9 10 11 12 1
CO1 3 3 - - 2 - - 3 - - - 3 - - 3
Ethical CO2 3 3 2 - - - - - - - - - - - 3
Hacking
(Course CO3 3 3 2 - 2 - - - 2 - - 2 3 - -
Code INT CO4 3 3 - 3 2 3 - 2 - - - - - 3 -
021)
CO5 3 2 3 - - - - 3 3 - - - - 3 -
CO6 3 3 - 3 3 3 3 - - 3 3 - 3 - -

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

Course Course PO PO PO PO PO PO PO PO PO PO
Code Name PO1 PO2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2 PSO3
Ethical
INT 021 3 2.7 2.3 3 2.25 3 3 2.6 2.5 3 3 2.5 3 3 3
Hacking

Strength of Correlation

1. Addressed toSlight (Low=1)extent 2. Addressed toModerate (Medium=2) extent

3. Addressed toSubstantial (High=3) extent

CSA, SSET, SU Page 156

 TERM-VI

CSA, SSET, SU Page 157

 School SHARDA SCHOOL OF ENGINEERING &
TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
Course Name :
1 Course Code ARP 306 Campus to Corporate

Campus to Corporate
2 Course Title
3 Credits 2
Contact Hours
4 1-0-2
(L-T-P)
Course Status Active
To enhance holistic development of students and improve
their employability skills. Provide a 360 degree exposure
to learning elements of Business English readiness
program, behavioral traits, achieve softer communication
levels and a positive self-branding along with augmenting
5 Course Objective numerical and altitudinal abilities. To up skill and upgrade
students’ across varied industry needs to enhance
employability skills. By the end of this semester, a will
have entered the threshold of his/her 4 th phase of
employability enhancement and skill building activity
exercise.
After completion of this course, students will be able to:

CO1: Develop a creative resumes, cover letters, interpret

job descriptions and interpret KRA and KPI statements and
art of conflict management.

CO2: Build negotiation skills to get maximum benefits from

deals in practical life scenarios.

CO3: to Develop skills of personal branding to create a

brand image and self-branding
6 Course Outcomes CO4: Acquire higher level competency in use of logical and
analytical reasoning such as direction sense, strong and
weak arguments

CO5: Develop higher level strategic thinking and diverse

mathematical concepts through building analogies, odd one
out

CO6: Demonstrate higher level quantitative aptitude such

as average, ratio & proportions, mixtures & allegation for
making business decisions.

This penultimate stage introduces the student to the

Course basics of Human Resources. Allows the student to
7
Description understand and interpret KRA | KPI and understand Job
descriptions. A student also understands how to manage

CSA, SSET, SU Page 158

 conflicts, brand himself/herself, understand relations and
empathize others with level-4 of quant, aptitude and
logical reasoning

8 Outline syllabus – ARP 306

CO
Unit 1 Ace the Interview
MAPPING
HR Sensitization ( Role Clarity | KRA | KPI | Understanding JD ) | CO1
A Conflict Management
CO3,
B Negotiation Skills | Personal Branding
CO4
Uploading & Curating Resumes in Job Portals, getting Your CO1,
C Resumes Noticed | Writing Cover Letters | Relationship CO3
Management | Verbal Abilities-4
Introduction to APTITUDE TRAINING- Reasoning- Logical/
Unit 2 Analytical
Sitting Arrangement & Venn Diagrams | Puzzles | Distribution | CO4
A Selection
Direction Sense | Statement & Conclusion | Strong & Weak CO4
B Arguments
C Analogies, Odd One out | Cause & Effect CO5
Unit 3 Quantitative Aptitude
A Average , Ratio & Proportions, Mixtures & Allegation CO6
B Geometry-Lines, Angles & Triangles CO6
C Problem of Ages | Data Sufficiency - L2 CO6
Weightage
CA-25%, MTE-25% ETE-50%
Distribution
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – Arihant Publications |
Quicker Maths- M. Tyra | Power of Positive Action (English, Paperback,
Text
Napoleon Hill) | Streets of Attitude (English, Paperback, Cary Fagan, Elizabeth
book/s*
Wilson) The 6 Pillars of self-esteem and awareness – Nathaniel Brandon | Goal
Setting (English, Paperback, Wilson Dobson

CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

s 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO - - - - - - - - 1 2 1 2 - - -
1
CO - - - - - - - - 1 2 1 2 - - -
2
CO - - - - - - - - 1 2 1 2 - - -
3
CO 1 - - - - - - - 1 2 1 2 - - -
4
CO 1 - - - - - - - 1 2 1 2 - - -
5
CO 1 - - - - - - - 1 2 1 2 - - -
6

CSA, SSET, SU Page 159

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE031 Course Name: Digital Image Processing
2 Course Title Digital Image Processing
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Program Elective 3
Status
5 Course The objective of this course is to introduce the students to the fundamental techniques and
Objective algorithms used for acquiring, processing and extracting useful information from digital
images. Particular emphasis will be placed on covering methods used for image sampling
and quantization, image transforms, image enhancement and restoration, image encoding,
image analysis and pattern recognition. In addition, the students will learn how to apply
the methods to solve real-world problems in several areas including medical, remote
sensing and surveillance and develop the insight necessary to use the tools of digital image
processing (DIP) to solve any new problem
6 Course The Successful Completion of the Course Enables the Students to achieve the following
Outcomes learning Objectives:
(CO’s) CO1: Define the fundamental concepts of a digital image processing system.
CO2: Classify images in the frequency domain using various transformations.
CO3: Apply various operations for image enhancement and image restoration.
CO4: Analyse image segmentation and various representation techniques.
CO5: Choose various morphological operations for Digital Image processing.
CO6: Discuss and Build various image processing techniques for real life applications.
7 Course Images and Visual information are integral parts of our daily lives. Digital image
Description processing plays an important role in various practical applications including television,
medical imaging modalities such as X-ray or ultrasound, photography, security, astronomy
and remote sensing.
This subject will introduce the fundamentals of image processing and manipulation, while
image applications will be used for illustrations etc. The subject emphasizes general
principles of image processing rather than specific applications and also to know and
understand how computers can process digital images and some of the fundamental
operations in image processing.
8 Syllabus Outline CO Mapping
Unit 1 Introduction
A Fundamental of digital image processing, Elements of CO1
Visual Perception system, Applications of Digital
Image Progressing
B Image Sampling and Quantization, Relationships CO1
between pixels , Image Sensing and Acquisition
C Color image fundamentals – RGB, HSI models, Two- CO1
dimensional mathematical preliminaries, 2D transforms
– DFT, DCT, DWT.
Unit 2 Image Enhancement in Spatial and Frequency
Domain
A Spatial Domain: Gray level Transformations, CO2
Histogram Processing , Basics of Spatial Filtering,
Smoothing and Sharpening Spatial Filtering

CSA, SSET, SU Page 160

 B Frequency Domain: Introduction to Fourier CO2
Transform– Low-pass filter in frequency domain
C High-pass filters in frequency domain CO2
Unit 3 Image Restoration and Compression
A Restoration Process model, Noise models , Mean CO3
Filters, Order Statistics, Adaptive filters
B Frequency Domain Filtering: Band reject Filters, CO3
Band pass Filters , Notch Filters, Optimum Notch
Filtering, Inverse Filtering, Wiener filtering
C Encoder-Decoder model, Types of redundancies, CO3
Brief Overview of Lossy and Lossless
Compression Techniques
Unit 4 Image Segmentation
A Boundary detection based techniques, Point, line CO4,CO6
detection, Edge detection, Edge linking, local
processing, regional processing, Hough transform
B Thresholding, Global Thresholding, adaptive CO4,CO6
thresholding, Iterative thresholding, Otsu's
method, Moving averages, Multivariable
thresholding
C Region based segmentation, Watershed algorithm, CO4,CO6
Use of motion in segmentation
Unit 5 Morphological Image Processing
A Basics, Erosion, Dilation, Opening, Closing, Hit- CO5 ,CO6
or-Miss Transform
B Morphological Algorithms: Boundary Detection, CO5,CO6
Hole filling, Connected components, convex hull,
thinning, thickening, skeletons, pruning
C Geodesic Dilation, Erosion, Reconstruction by CO5,CO6
dilation and erosion. Applications of
Morphological Image Processing
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text Books 1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard
E. Woods. Published by: Pearson Education.

Reference 1. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John
Books Wiley and Sons, NY.
2. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall,
Upper Saddle River, NJ.
3. Image Processing, Analysis and Machine Vision , by Milan Sonka ,Vaclav Hlavac ,
Roger Boyle Cengage Learning 3rd Edition
4. Digital Image Processing, by S Jayaraman, S Esakkirajan, T Veerakumar TMH
Publication
Online 1. https://nptel.ac.in/courses/106105032/
Materials 2. http://users.rowan.edu/~polikar/WTtutorial.html

CSA, SSET, SU Page 161

CO and PO Mapping
S. Course Outcome (CO) Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)
1 Define the fundamental concepts of a digital image PO1,PO2,PO3,PO5,PO8,PSO1,PSO2
processing system.
2 Classify images in the frequency domain using various PO1,PO2,PO3,PO4,PO5,PO6,PO8,
transformations. PO9,PO10,PSO1,PSO2
3 Apply various operations for image enhancement and PO1,PO2,PO3,PO4,PO5,PO6,PO8,
image restoration. PO9,PO10,PO12,PSO1,PSO2
4 Analyse image segmentation and various PO1,PO2,PO3,PO4,PO5,PO6,PO8,
representation techniques. PO9,PO10,PO12,PSO1,PSO2
5 Choose various morphological operations for Digital PO1,PO2,PO3,PO4,PO5,PO6,PO8,
Image processing. PO9,PO10,PO12,PSO1,PSO2
6 Discuss and Build various image processing PO1,PO2,PO3,PO4,PO5,PO6,PO8,
techniques for real life applications. PO9,PO10,PO12,PSO1,PSO2

CO-PO and PSO Mappings of Digital Image Processing CSE031

Subject PO’s PS PS PS
P P P P P P P P P P P P
/ O O O
O O O O O O O O O O O O
PSO’ 1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
s
Digital CO1 3 3 3 3 1 1 1 1 1 2 1 3 2 3 1
Image CO2 3 3 3 3 2 1 1 1 1 2 1 3 2 3 2
Processin 1 1 3 3 2
CO3 3 3 3 3 2 1 1 1 2 3
g
CO4 3 3 3 3 2 2 1 1 1 2 1 3 3 3 2
CSE031
CO5 3 3 3 3 2 2 1 1 1 2 1 3 3 3 2
CO6 3 3 3 3 2 3 3 1 3 2 1 3 3 3 3

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

Course PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Course Name
Code 1 PO2 PO 3 4 5 6 7 8 9 10 11 12 1 2 3
Digital Image
CSE031
Processing 3.00 3.00 3.00 3.00 1.83 1.67 1.33 1.00 1.33 2.00 1.00 3.00 2.67 3.00 2.00

Total- 32.83
Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 162

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE032

2 Course Title Cryptography and Network Security

3 Credits 3

4 Contact 3-0-0
Hours
(L-T-P)

Course Core
Status

5 Course The objective of this course is to provide an intention to explain basic

Objective concepts and algorithms of symmetric &asymmetric key cryptography,
including encryption/decryption and key exchange with the application
of cryptography and technique.
6 Course On successful completion of this module students will be able to:
Outcomes
CO1: Identify the basic concepts of computer security, algorithms of
symmetric Key cryptography, including encryption/decryption.
CO2: Apply the tools and methodologies used to perform mathematic
concepts behind the cryptographic algorithms..
CO3: Explain the tools and methodologies used to perform Security
analysis.
CO4: Interpret use of cryptographic data integrity algorithms and user
authentication protocols
CO5: Examine security at application layer, transport layer and network
layer.
CO6: Compare various algorithm of cryptography used for Network
Security.
7 Course This course will provide a deterministic approach of both the
Description principles and practice of cryptography & network security. It covers
the basic issues to be addressed by a network security capability, and
explored by providing a tutorial and survey of cryptography and
network security technology.

8 Outline syllabus CO
Mapping

Unit 1 Introduction& symmetric Key Cryptography

A Computer Security Concepts- OSI security Architecture, Security CO1

attacks, Services, mechanism, model of network security

CSA, SSET, SU Page 163

 B Classical encryption techniques- Substitution Cipher(Mono- CO1
alphabetic, Poly-alphabetic), Transposition cipher, Steganography
C Block Cipher- Encryption Principles, DES and its variants, strength CO1
of DES
Unit 2 Mathematics of Cryptography

A Eucledian, Extended Eucledian Algorithm, EuilersTotient Function CO2

, Ferment little Theorem, Eulers theorem
B Primality Testing-Miller Rabin test, Chinese Remainder Theorem CO2, CO6

C Exponential- square and multiply method, Discrete Logarithm CO2, CO6

Unit 3 Asymmetric Cryptography & Key Exchange

A Public Key cryptography-RSA, Cryptanalysis of RSA CO3

B Elgamal cryptography, Elliptic Curve cryptography CO3, CO6

C Key Management and distribution : KDC, Diffie Hellman Key CO3, CO6
Exchange
Unit 4 Digital signatures

A User Authentication protocol- Kerberos CO4

B Digital Signature –RSA, Elgamal, DSS CO4

C Data integrity algorithms-Hash Functions, MD5, SHA-512 CO4

Unit 5 Security

A Security at Application layer-Email Architecture, S/MIME, PGP- CO5

Scenarios, key rings
B Security at Transport layer-SSL( Services, Protocols) CO5

C Security at Network layer-IPSec(Modes, Security Protocols-AH, CO6

ESP, Services provided by IPSEC)
Mode of Theory/Jury/Practical/Viva
examination

Weightage CA MTE ETE

Distribution
25% 25% 50%

Text book/s* 1. Atul Kahate , "Network Security ", Wiley India Pvt Ltd, 2010.
2. Michael T. Simpson, "Hands-on Cryptography & Network
Security & Network Defense", Course Technology, 2010.
3. Rajat Khare, "Network Seuciryt and Cryptography & Network
Security ", Luniver Press, 2006.

Other 1. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons

References Inc, 2001.
2. Behrouz A. Forouzan, “Cryptography And Network
Security”- McGraw Hill
3. Internet as a resource for reference.

CSA, SSET, SU Page 164

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)
1. CO1: Identifybasic concepts of computer security, PO1, PO2, PSO1. PSO2
algorithms of symmetric Key cryptography, including
encryption/decryption.
2. CO2: Apply the tools and methodologies used to perform PO1,PO2,PO3, PO4, PSO1,PSO2
mathematic concepts behind the cryptographic algorithms..

3. CO3: Explain the tools and methodologies used to perform PO1, PO3, PO5, PSO1, PSO2
Security analysis.

4. CO4: Analyze and use cryptographic data integrity PO1, PO4, PO6, PO7, PSO1,PSO2
algorithms and user authentication protocols
5. CO5. Examine security at application layer, transport layer PO5,PO7, PO8, PO9, PSO1,PSO2
and network layer.
6. CO6: Compare various algorithm of cryptography used for PO10,PO11,PO12,PSO1,PSO3
Network Security.

PO and PSO mapping with level of strength for Course Name Cryptography and Network
Security (Course Code CSE032)
Code_ Course Name CO P PO2 PO PO PO PO PO PO PO PO10 PO11 PO12 PSO1 PSO2 PSO3
’s O 3 4 5 6 7 8 9
1

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

CO
2 3 2 1 - - - - - - - - 2 3 -
2
CSE032_Cryptog CO
2 - 2 - 3 - - - - - - - 2 2 1
raphy and 3
Network Security CO 2
2 - - 2 - 2 2 - - - - - 2
4
CO
- - - - 2 - 2 2 2 - - 1 - -
5
CO
- - - - - - - - - 2 2 2 2 - 2
6

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

P P
Course PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
Course Name O O
Code 1 2 3 5 6 7 8 9 0 1 2 1 2 3
4

Cryptograph
y and
CSE03
2 Network 2.5 2.5 2 1.5 2.5 2 2 2 2 2 2 2 2 2 1.5
Security y
and Network
Security

Strength of Correlation

1. Addressed toSlight (Low=1) extent 2. Addressed toModerate (Medium=2) extent

3. Addressed toSubstantial (High=3) extent

CSA, SSET, SU Page 165

Syllabus: CSE041 SOFTWARE PROJECT MANAGEMENT
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE041
2 Course Title SOFTWARE PROJECT MANAGEMENT
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course To provide fundamental skills of software Project management emphasizing on
Objective issues & hurdles associated with delivering successful projects. Apply project
management concepts through working in a group as team leader or active team
member on an IT project.
6 Course After successful completion of this course students should be able to:
Outcomes CO1: Define the Project Management principles while developing software.
(6) CO2: Explain different project scheduling techniques.
CO3: Apply various project monitoring, control and review techniques
CO4: Categorize various activities and estimate the risks involved in various
project activities.
CO5: Assess project quality and issues related to contract management.
CO6: Discuss the impact of project planning on the performance of the
organizations
7 Course This course is aimed at introducing the primary important concepts of project
Description management related to managing software development projects. Students will
also get familiar with the different activities involved in Software Project
Management. Further, they will also come to know how to successfully plan and
implement a software project management activity, and to complete a specific
project in time with the available budget.
8 Outline syllabus CO
Mapping
Unit 1 Introduction to Software Project Planning
A Fundamentals of Software Project Management (SPM), Need CO1
Identification, Vision and Scope Document, Project Management
Cycle, SPM Objectives
B SPM Framework, Software Project Planning, Planning Objectives, CO1
Project Plan, Types of Project Plan, Structure of a Software Project
Management Plan
C Software Project Estimation, Estimation Methods, Estimation CO1
Models, Decision Process
Unit 2 Project Organization and Scheduling Project Elements
A Work Breakdown Structure (WBS), Types of WBS, Functions, CO2
Activities and Tasks, Project Life Cycle and Product Life Cycle
B Ways to Organize Personnel, Project Schedule, Scheduling CO2
Objectives, Building the Project Schedule, Scheduling Terminology
and Techniques

CSA, SSET, SU Page 166

 C Network Diagrams: PERT, CPM, Bar Charts: Milestone Charts, CO2
Gantt Charts
Unit 3 Project Monitoring and Control
A Dimensions of Project Monitoring & Control, Earned Value Analysis CO3,
CO6
B Earned Value Indicators: Budgeted Cost for Work Scheduled CO3
(BCWS), Cost Variance (CV), Schedule Variance (SV), Cost
Performance Index (CPI), Schedule Performance Index (SPI)
C Software Reviews, Types of Review: Inspections, Deskchecks, CO3
Walkthroughs, Code Reviews
Unit 4 Project Management Tools
A Software Configuration Items and Tasks, Baselines, Plan for Change, CO4
Change Control, Change Requests Management, Version Control
B Risk Management: Risks and Risk Types, Risk Breakdown Structure CO4,
(RBS), Risk Management Process: Risk Identification, Risk Analysis, CO6
Risk Planning, Risk Monitoring
C Cost Benefit Analysis, Software Project Management Tools: CASE CO4,
Tools, MS-Project CO6
Unit 5 Software Quality and Staffing in Project Management
A Concept of Software Quality, Software Quality Attributes, Software CO5,
Quality Metrics and Indicators, The SEI Capability Maturity Model CO6
(CMM)
B SQA Activities, Formal SQA Approaches: Proof of Correctness, CO5
Statistical Quality Assurance, Product versus process
quality management,
C Introduction, types of contract, stages in contract, placement, typical CO5,
terms of a contract, contract management, acceptance CO6
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Cottrell M. and Hughes B., "Software Project Management", 5th
Edition, The McGraw-Hill Companies.
2. Walker Royce: ―Software Project Management- Addison-Wesley,
1998
Other 1. Pankaj Jalote, “Software Project Management in practice”, 1st Edition,
References Pearson Education, 2005.
2. Kathy Schwalbe, “Information Technology Project Management”
International Student Ed. THOMSON Course Technology

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Define the Project Management principles while PO1,PO3,PO5,PO9,PO10,
developing software. PO11,PO12,PSO3
2. CO2: Explain different project scheduling techniques. PO1,PO3,PO5,PO9,PO10,
PO11,PO12,PSO3
3. CO3: Apply various project monitoring, control and PO1,PO3,PO5,PO8,PO9,
review techniques PO10,PO11,PO12,PSO3

CSA, SSET, SU Page 167

 4. CO4: Categorize various activities and estimate the PO1,PO3,PO5,PO8,PO9,
risks involved in various project activities. PO10,PO11,PO12,PSO3
5. CO5: Assess project quality and issues related to PO1,PO3,PO5,PO6,PO8,PO9,
contract management. PO10,PO11,PO12,PSO3
6. CO6: Discuss the impact of project planning on the PO1,PO3,PO4,PO5,PO6,PO8,PO9,
performance of the organizations PO10,PO11,PO12,PSO3
PO and PSO mapping with level of strength for Software Project management (Course
code CSE 041)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

Course Name
CO’s 1 2 3 PO4
5 6 7 8 9 10 11 12 1
PSO2 PSO3

CO1 3 - 1 - 1 - - - 3 2 3 2 - - 2

CO2 2 - 2 - 2 - - - 3 3 3 3 - - 2
CSE041_
Software CO3 2 - 3 - 2 - - 1 3 2 3 3 - - 3
Project CO4 2 - 2 - 2 - - 1 3 2 3 3 - - 3
Management
CO5 1 - 3 - 2 3 - 1 3 3 3 3 - - 3

CO6 2 - 3 3 2 2 - 1 3 3 3 2 - - 2

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

Course PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Course Name PO
Code 1 PO2 3 4 5 6 7 8 9 10 11 12 1 2 3
Software
CSE041 Project 2 - 2.3 3 1.8 2.5 - 1 3 2.5 3 2.6 - - 2.5
Management

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 168

CSE042 SOFTWARE TESTING

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE042
2 Course Title SOFTWARE TESTING
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective (Drop Down)
Status
5 Course The primary objective of this course is to introduce and instruct
Objective software testing and Quality assurance concepts, strategies, and
techniques in order to develop a total understanding of the testing
process and how it impacts the software project.
6 Course On successful completion of this module students will be able to
Outcomes CO1: Define Basic concepts of Testing and Debugging
(5-6) CO2: Make use of Control flow graph to perform white box testing
CO3: Apply Data flow and integration testing to develop feasible
software
CO4: Classify techniques of Functional testing and design test cases
CO5: Evaluate the software quality using Reviews, maturity models
and ISO standards.
CO6: Adapt software testing methods and modern software testing
tools for their testing projects.
7 Course This course will examine fundamental software testing and related
Description program analysis techniques. In particular, the important phases of
testing will be reviewed, emphasizing the significance of each phase
when testing different types of software. The course will also include
concepts such as test generation, test oracles, test coverage,
regression testing, mutation testing, program analysis (e.g., program-
flow and data-flow analysis), and test prioritization.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
A Human and errors, Testing Objectives, Principles of CO1
Testing, Behavior and Correctness, verification and
validation, Debugging and its techniques
B Software metrics, Software Testing Life Cycle, Testing CO1
activities , Test Levels,
C Testing exit criteria, Bug defect life cycle, White Box and CO1
Black Box Testing, test planning and design
Unit 2 Unit and Control Flow Testing
A Concept of Unit Testing, Static Unit Testing, Defect CO2,CO6
Prevention, Dynamic Unit Testing, Mutation Testing

CSA, SSET, SU Page 169

 B Control Flow Testing: Overview of Control Flow Testing, CO2,CO6
Control Flow Graph, Paths in a Control Flow Graph
C Cyclomatic complexity, Path Selection Criteria, Generating CO2,CO6
test input
Unit 3 Data Flow & Performance testing
A Data Flow Anomaly, Overview of Dynamic Data Flow CO3,CO6
Testing, Data Flow Graph, Data Flow Terms
B Data Flow Testing Criteria, Comparison of Data Flow Test CO3,CO6
Selection Criteria, Feasible Paths and Test Selection
Criteria
C Integration Testing: Introduction, Integration Techniques, CO3,CO6
Regression testing, Performance testing: Stress, Load,
Volume, Soak and Spike, Overview of performance tools:
Jmeter, Loadrunner, WebLoad
Unit 4 Functional Testing
A Equivalence Class Partitioning, Boundary Value Analysis, CO4,CO6
Decision Tables, Random Testing: Monkeys & Gorillas,
Error Guessing
B Test case designing – Test cases, Test case format, Test CO4,CO6
case designing, Acceptance testing and criteria
C Automation testing: Need for automation, categorization of CO4,CO6
Testing tools, Selection of testing tools, Guidelines for
automated testing, Overview of commercial testing tools
Unit 5 Reviews and Quality Control
A Testing maturity model, Test metrics and measurements – CO5,CO6
project, progress and productivity metrics – Status
Meetings – Reports and Control Issues – Criteria for Test
Completion
B Types of reviews – Developing a review program – CO5,CO6
Components of Review Plans– Reporting Review Results
C Five Views of Software Quality, McCall’s Quality Factors CO5,CO6
and Criteria, ISO 9000:2000 Software Quality Standard,
evaluating software quality
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Sagar Naik & Piyu Tripathy, “Software Testing and
Quality Assurance: Theory and Practice”, Wiley.

Other 1. Naresh Chauhan, “Software Testing : Principles and

References practices”, Oxford university press
2. Boris Beizer, “Software Testing Techniques”,
Dreamtech Press
3. K.K. Aggrawal and Yogesh Singh, “ Software
Engineering” New Age International Publication

CSA, SSET, SU Page 170

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)
1. CO1: Define Basic concepts of Testing PO1,PO2,PO10,PO12,PSO3
and Debugging
2. CO2: Make use of Control flow graph to PO1,PO2,PO3,PO4,PO5,PO6,
perform white box testing PO8,PO9,PO10,PO12,PSO1,PSO3
3. CO3: Apply Data flow and integration PO1,PO2,PO3,PO4,PO5,PO6,
testing to develop feasible software PO8,PO9,PO10,PO12,PSO1,PSO3
4. CO4: Classify techniques of Functional PO1,PO2,PO3,PO4,PO5,PO6,
testing and design test cases PO8,PO9,PO10,PO12,PSO1,PSO3
5. CO5: Evaluate the software quality using PO1,PO2,PO3,PO4,PO5,PO6,
Reviews, maturity models and ISO PO8,PO9,PO10,PO12,PSO1,PSO3
standards.
6. CO6: Adapt software testing methods and PO1,PO2,PO3,PO4,PO5,PO6,PO7,
modern software testing tools for their PO8,PO9,PO10,PO11,PO12,PSO1,PSO3
testing projects.

PO and PSO mapping with level of strength for Software Testing (CSE 042)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s
Course Name 1 2 3 PO4 5 6 7 8 9 10 11 12 1 PSO2 PSO3
CO1 2 1 - - - - - - - 3 - 2 - - 3
CO2 3 3 3 2 3 1 - 1 2 3 - 2 2 - 3
CSE042_ CO3 3 3 3 2 2 2 - 1 2 3 - 2 2 - 3
Software
Testing CO4 3 3 3 2 3 1 - 1 2 3 - 2 2 - 3
CO5 3 3 2 2 2 2 - 1 2 3 - 2 2 - 3
CO6 3 3 3 2 3 2 3 2 3 3 3 3 2 - 3

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

Code Name 1 PO2 PO 3 4 5 PO 6 7 8 9 10 11 12 1 2 PSO 3
Software 2.8 2.6 2.8 2 2.6 1.6 3 1.2 2.2 3 3 2.1 2 - 3
CSE042
Testing

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 171

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course
Code CSE051
2 Course Wireless Networks
Title
3 Credits 3
4 Contact 3-0-0
Hours
5 Course The objective of this course is to provide fundamental knowledge about Wireless
Objective networks, protocol stack and standards, understand and analyze the network layer
solutions for Wireless networks, and make student aware of 4G Services.
6 After successful completion of this course students should be able to:

CO1. Enumerate, identify the foundation, and describe properties and capabilities of
commonly used wireless technologies
CO2. Identify and describe the infrastructure and requirements of Mobile IP and
Course Mobile IPv6
Outcomes CO3.Illustrate the issues and solutions of various layers of mobile networks, namely
MAC layer, Network Layer & Transport Layer
CO4. Demonstrate the typical mobile networking infrastructure through a popular
GSM protocol
CO5. Identify and describe the structure of current 4G cellular networks.
CO6.Compare applications of 4G technologies.
7 Course The course will describe concepts, technology and applications of wireless
Description networking as used in current and next-generation wireless networks. In
addition, the course addresses the fundamentals of wireless
communications and provides an overview of existing and emerging wireless
communication networks.
8 Course Contents
8.01 Unit A WIRELESS LAN CO
Mapping
8.02 Unit A Introduction-WLAN technologies: Infrared, UHF narrowband, spread CO1
Topic 1 spectrum -IEEE802.11: System architecture, protocol architecture,
8.03 Unit A Physical layer, MAC layer, 802.11b, 802.11a – Hiper LAN: WATM, CO1
Topic 2 BRAN, HiperLAN2
8.04 Unit A Bluetooth: Architecture, Radio Layer, Baseband layer, Link manager CO1
Topic 3 Protocol, security - IEEE802.16-WIMAX: Physical layer, MAC,
Spectrum allocation for WIMAX

8.05 Unit B MOBILE NETWORK LAYER

8.06 Unit B Introduction - Mobile IP: IP packet delivery, Agent discovery, tunneling CO1,
Topic 1 and encapsulation, CO2
8.07 Unit B IPV6-Network layer in the internet Mobile IP session initiation protocol CO1,
Topic 2 CO2
8.08 Unit B Mobile ad-hoc network: Routing Destination Sequence distance vector, CO1,
Topic 3 Dynamic source routing. CO2
8.09 Unit C MOBILE TRANSPORT LAYER

CSA, SSET, SU Page 172

8.10 Unit C TCP enhancements for wireless protocols - Traditional TCP: CO3
Topic 1 Congestion control, fast retransmit/fast recovery, Implications of
mobility
8.11 Unit C Classical TCP improvements: Indirect TCP, Snooping TCP, Mobile CO3
Topic 2 TCP, Time out freezing
8.12 Unit C Selective retransmission, Transaction oriented TCP - TCP over 3G CO3
Topic 3 wireless networks.
8.13 Unit D WIRELESS WIDE AREA NETWORK
8.14 Unit D Overview of UTMS Terrestrial Radio access network-UMTS Core CO3,
Topic 1 network Architecture CO4
8.15 Unit D 3G-MSC, 3G-SGSN, 3G-GGSN, SMS-GMSC/SMS-IWMSC, Firewall, CO3,
Topic 2 CO4
8.16 Unit D DNS/DHCP-High speed Downlink packet access (HSDPA)- LTE CO3,
Topic 3 network architecture and protocol. CO4
8.17 Unit E 4G NETWORKS
8.18 Unit E Introduction – 4G vision – 4G features and challenges - Applications of CO5,
Topic 1 4G – 4G Technologies CO6
8.19 Unit E Multicarrier Modulation, Smart antenna techniques, OFDM-MIMO CO5,
Topic 2 systems, CO6
8.20 Unit E Adaptive Modulation and coding with time slot scheduler, Cognitive CO5,
Topic 3 Radio. CO6
9 Reading Content
9.1 Text book* 1. Jochen Schiller, Mobile Communications, Second Edition, Pearson Education
2012.(Unit I,II,III)
9.2 Other 1. Erik Dahlman, Stefan Parkvall, Johan Skold and Per Beming, “3G Evolution
references HSPA and LTE for Mobile Broadband”, Second Edition, Academic Press, 2008.
2.Anurag Kumar, D.Manjunath, Joy kuri, “Wireless Networking”, First Edition,
Elsevier 2011.
3.Simon Haykin , Michael Moher, David Koilpillai, “Modern Wireless
Communications”, First Edition, Pearson Education 2013

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Enumerate, identify the foundation, and describe PO1,PO3,PO8 PSO3
properties and capabilities of commonly used wireless
technologies
2. CO2. Identify and describe the infrastructure and PO1,PO2,PO3,PO8 PSO3
requirements of Mobile IP and Mobile IPv6
3. CO3.Illustrate the issues and solutions of various layers PO1,PO2,PO3,PO8 PSO3
of mobile networks, namely MAC layer, Network Layer
& Transport Layer
4. CO4. Demonstrate the typical mobile networking PO1,PO2,PO3,PO8 PSO3
infrastructure through a popular GSM protocol
5 CO5. Identify and describe the structure of current 4G PO1,PO2,PO3,PO4,PO5,PO8
cellular networks. PSO3
6. CO6.Compare applications of 4G technologies. PO1,PO2,PO3,PO4,PO5,PO8
PSO3

CSA, SSET, SU Page 173

 CO PO PO PO PO PO PO PO PO PO P P P PSO PSO PSO
s 1 2 3 4 5 6 7 8 9 O O O 1 2 3
10 11 12
3 - 3 - - - - 1 - - - - - - 2
CO
1
3 2 3 - - - - 1 - - - - - - 2
CO
2
3 2 3 - - - - 1 - - - - - - 2
CO
3
CO 3 2 3 - - - - 1 - - - - - - 2
4
CO 3 2 3 2 2 - - 1 - - - - - - 3
5
CO 3 2 3 2 2 - - 1 - - - - - - 3
6
Av 3 1.6 3 0.6 0.6 - - 1 - - - - - - 2.3
g.

PO and PSO mapping with level of strength for Course Name Wireless Networks (CSE051)

CSA, SSET, SU Page 174

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE052
2 Course Title Risk Management
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course The objective of this course is to provide an insight to fundamentals of
Objective risk management in which business and society make an assessment of,
control, regulation of risk management and transfer risk.

6 Course On successful completion of this module students will be able to:

Outcomes
CO1: define the basic concept of risk, types, uncertainty, managing,
evaluation and prediction of risk.
CO2: illustrate the key stages, component, framework, standards,
architecture, strategy policies, and protocols process of the risk
management.
CO3: identify various risk, score them, control and opportunity risk
CO4: apply approach/technique of risk assessment for strategy,
projects and operations, and make use of risk matrix
CO5: analyze uncertainty and risk in projects and apply measurement
CO6: Explain, compare and apply risk management concept and
techniques in projects to the success of the organization.

7 Course This course is to provide students with the concepts and fundamentals
Description of risk management, a study of risk assessment and management
techniques, methods, and models used in industry to minimize, control
and communicate risks.

8 Outline syllabus CO
Mapping
Unit 1 Introduction
A The Concept of Risk, Risk and Uncertainty: CO1, CO6
Distinction, Classification of Risks
B Managing Risk, Sources and Measurement of Risk CO1, CO6
C Risk Evaluation and Prediction, Types of Risk CO1, CO6
Unit 2 Principles and aims of risk management
A Principles of risk management, Importance of risk CO2, CO6
management, Risk management activities, Perspectives
of risk management
B Scope of risk management standards:- Risk CO2, CO6
management process, Risk management framework

CSA, SSET, SU Page 175

 C Risk architecture, strategy Policies and protocols CO2, CO6
Unit 3 Risk classification Systems
A Shor, Medium and long term Risk CO3, CO6
B FIRM risk scorecard, PESTLE risk classification CO3, CO6
system
C Hazard, control and opportunity risk CO3, CO6
Unit 4 Risk Assessment
A Importance of risk assessment, Approaches to risk CO4, CO6
assessment, risk assessment techniques
B Risk Matrix, Risk Perception, Risk appetite CO4, CO6
C Application of risk matrix, inherent and current level of CO4, CO6
risk, 4T’s of risk response
Unit 5 Risk Management
A Importance of risk appetite – Risk tolerance, treatment, CO5, CO6
termination
B Introduction to Project Risk Management, uncertainty CO5, CO6
in projects , project lifecycle, Project risk analysis and
management
C Operational risk management- definition, CO5, CO6
measurement, difficulties of measurement
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Paul Hopkin,”Fundamental of Risk Management-
Understanding evaluating and implementing
effective risk management”, KoganPage London
Philadelphia New Delhi.
Other 1. Internet
References

CO and PO Mapping

Programme Outcomes
S.
Course Outcome (PO) & Programme
No.
Specific Outcomes (PSO)
CO1: define the basic concept of risk, types, uncertainty, PO1, PO2, PO7, P12,
1.
managing, evaluation and prediction of risk. PSO1
PO1, PO4, PO5, PO8, PO9,
CO2: illustrate the key stages, component, framework,
PO10, PO11, PO12
2. standards, architecture, strategy policies, and protocols
PSO3
process of the risk management.
CO3: identify various risk, score them, control and PO1, PO2, PO4, PO9,
3.
opportunity risk P12, PSO1
CO4: apply approach/technique of risk assessment for
PO1, PO3, PO5, PO6, PO9,
4. strategy, projects and operations, and make use of risk
P11, PSO3
matrix

CSA, SSET, SU Page 176

 CO5: analyze uncertainty and risk in projects and apply PO1, PO2, PO4, PO5, PO7,
5.
measurement PO9, PSO3
CO6: explain, compare and apply risk management
PO1, PO3, PO5, PO7, PO9,
6. concept and techniques in projects to the success of the
P11, P12, PSO2
organization.

PO and PSO mapping with level of strength for Course Name Risk Management (Course
Code CSE052)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 - - - - - 1 - - - - 1 2 - -

CO2 2 2 - 3 2 - - 1 2 1 1 1 - - 2
CSE052 _
Risk
CO3 2 - - - - - - - 2 - - 1 1 - -
Managemen
t
CO4 1 - 2 - 3 - - - 2 2 2 - - - 1

CO5 2 2 - 2 1 - 1 - 2 1 1 - - - 1

CO6 2 2 2 - - - 1 - 2 1 1 1 - 1 -

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

Course Course PO PO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO12
Code Name 10 11 1 2 3
Risk
CSE052 Managemen 2 2 2 2.5 2 - 1 1 2 1.25 1.25 1 1.5 1 1.33
t

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 177

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE022
2 Course Title Android Application Development
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course 1. Basics of Android OS
Objective 2. Develop Basic and advance Android Apps
3. Publishing and Monetizing the app
6 Course CO1: Demonstrate and understanding anatomy of an android
Outcomes application.
CO2: Develop various android applications related to layouts and rich
uses interactive interfaces.
CO3:Apply essential android programming concept
CO4: Distinguish and compare different components of Android
CO5: Access and work with databases under an android operating
system.
CO6: Develop Basic and advance android app development for
android devices.

7 Course This android development course will help students to Understand the
Description basis of Android Platform and its lifecycle. This will help them to
implement simple GUI applications, use built-in components and
work with database to store the data.
8 Outline syllabus CO
Mapping
Unit 1 Introduction and Architecture of Android
A History of Android, Features of Android, Android CO1
Devices, Open Handset Alliance (OHA) , Advantages of
Android, Comparing Android with other platform
B Android Directory Structure, Android Development CO1
Tools, Architecture of Android.
C Structure of Manifest files, Activities, Activity life CO1
cycle
Unit 2 User Interfaces
A Layouts-Linear layout, Relative layout, Constraint CO1,CO2
layout
B Input Controls – Text input, Checkboxes, Radio CO1,CO2
buttons, Spinner, Toggle buttons and switches
C Menus- Popup, Dialog, Context, date picker, style CO1,CO2
Unit 3 Components of Android
A Intents, types of intents, Intent Filter CO3

CSA, SSET, SU Page 178

 B Starting a new activity, Sending and Receiving of data, CO3
Notifications
C Services, service life cycle, Broadcast receivers CO3
Unit 4 Working with SQL Lite
A Introduction to SQLite database, Steps for connecting CO4,CO5
application with database.
B Fetch and update data in database from application, CO4,CO5
C Cursor and content value, opening and closing database CO4,CO5
Unit 5 Sensors and Animation
A Sensor Manager, Sensor Framework, Types of Sensors CO6
Accelerometer, Gyroscope, Proximity Sensor,
Orientation, Light Sensor
B Detect availability of sensor, Fetch data from sensors CO6
on frequent basis, Development of compass application
with help of gyroscope sensor
C SMS , Graphics and Animation CO6
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Anubhav Pradhan and Anil V. Deshpande , Composing Mobile
Apps: Learn, Explore, Apply Using Android , 1st Edition,Wiley
India.
Other 1. Wei-Meng Lee , Beginning Android 4 Application
References Development.
2. Neil Smyth ,Android Studio Development essentials-Android 6

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) & Programme Specific Outcomes
No. (PSO)
1. CO1: PO5,PO9,PO12,PSO3
Demonstrate and
understanding
anatomy of an
android
application.
2. CO2: Develop PO5,PO9,PO12,PSO3
various android
applications
related to layouts
and rich uses
interactive
interfaces.
3. CO3:Apply PO3,PO5,PO9,PO12,PSO1,PSO3
essential android
programming
concept
4. CO4: Distinguish PO5,PO9,PO11,PO12,PSO3
and compare

CSA, SSET, SU Page 179

 different
components of
Android
5. CO5: Access and PO3,PO4,PO5,PO7,PO9,PO11,PO12,PSO3
work with
databases under
an android
operating system.
6. CO6: Develop PO1,PO2,PO3,PO4,PO5,PO7,PO9,PO11,PO12,PSO1,PSO2,PSO3
Basic and
advance android
app development
for android
devices

PO and PSO mapping with level of strength for Course Name Android Application
Development (Course Code CSE022)

Course P P P P P P P P P P PS
Code_ CO’ PO PO PSO PSO
O O O O O O O O O O O
Course s 2 4 2 3
1 3 5 6 7 8 9 10 11 12 1
Name
CO1 3 2 1 2
CSE022_ CO2 3 2 1 2
Android CO3 2 3 2 1 2 2
Application
Developmen CO4 3 2 2 1 2
t CO5 2 3 3 2 2 2 1 2
CO6 1 2 3 3 3 3 3 3 3 1 3 3 3

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

PO2 PO 3 PO 6 PSO 3
Code Name 1 4 5 7 8 9 10 11 12 1 2
Android
CSE022 Application 1 2 2.3 3 3 3 2.5 0 2.2 0 2.3 1 2.5 3 2.2
Development

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 180

 TERM-VII

CSA, SSET, SU Page 181

School: SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
and technology
Department Computer Science & Applications
Session 2023-27
Academic year 2023-24
Semester 6th
Program: B.Tech
Branch: IT
1 Course Code CSP022
2 Course Title Android Application Development Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Core /Elective/Open Elective
Status
5 Course 4. Basics of Android OS
Objective 5. Develop Basic and advance Android Apps
6. Publishing and Monetizing the app
6 Course CO1: Demonstrate and understanding anatomy of an android
Outcomes application.
CO2: Develop various android applications related to layouts and rich
uses interactive interfaces.
CO3:Apply essential android programming concept
CO4: Distinguish and compare different components of Android
CO5: Access and work with databases under an android operating
system.
CO6: Develop Basic and advance android app development for
android devices.

7 Course This android development course will help students to Understand the
Description basis of Android Platform and its lifecycle. This will help them to
implement simple GUI applications, use built-in components and
work with database to store the data.
8 Outline syllabus CO
Mapping
Unit 1 Introduction and Architecture of Android
A Basic program to study the directory structure of CO1
android
Unit 2 User Interfaces
A Programs to develop UI for android app CO1,CO2
Unit 3 Components of Android
A Program using different component of android CO3
Unit 4 Working with SQL Lite
A Program used to store and retrieve data from database CO4,CO5
Unit 5 Sensors and Animation
A Program based on sensor and animation CO6

CSA, SSET, SU Page 182

 Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Anubhav Pradhan and Anil V. Deshpande , Composing Mobile
Apps: Learn, Explore, Apply Using Android , 1st Edition,Wiley
India.
Other 1. Wei-Meng Lee , Beginning Android 4 Application
References Development.
2. Neil Smyth ,Android Studio Development essentials-Android 6

PO and PSO mapping with level of strength for Course Name Android Application
Development (Course Code CSP022)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s 3
PO4 PSO2 PSO3
Course Name 1 2 5 6 7 8 9 10 11 12 1
CO1 3 2 1 2

CO2 3 2 1 2
CSP022_
Android CO3 2 3 2 1 2 2

Application CO4 3 2 2 1 2

Development CO5 2 3 3 2 2 2 1 2

CO6 1 2 3 3 3 3 3 3 3 1 3 3 3

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

Course Course PO PO PO PO PO PO PO PO PO PSO PSO

PO2 PO 3 PO 6 PSO 3
Code Name 1 4 5 7 8 9 10 11 12 1 2
Android
Application
CSP022 1 2 2.3 3 3 3 2.5 0 2.2 0 2.3 1 2.5 3 2.2
Development
Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 183

 School: SSET Batch : 2023-2026
Program: Current Academic Year: 2023-2024
Branch: CSE Semester: VI
Course Name :
1 Course Code ARP 306 Campus to Corporate

Campus to Corporate
2 Course Title

3 Credits 2
Contact Hours
4 1-0-2
(L-T-P)
Course Status Active
To enhance holistic development of students and improve their
employability skills. Provide a 360 degree exposure to learning
elements of Business English readiness program, behavioural
traits, achieve softer communication levels and a positive self-
5 Course Objective branding along with augmenting numerical and altitudinal
abilities. To up skill and upgrade students’ across varied industry
needs to enhance employability skills. By the end of this
semester, a will have entered the threshold of his/her 4 th phase
of employability enhancement and skill building activity exercise.
After completion of this course, students will be able to:

CO1: Develop a creative resumes, cover letters, interpret job

descriptions and interpret KRA and KPI statements and art of
conflict management.

CO2: Build negotiation skills to get maximum benefits from deals

in practical life scenarios.

CO3: Develop skills of personal branding to create a brand image

and self-branding
6 Course Outcomes
CO4: Acquire higher level competency in use of logical and
analytical reasoning such as direction sense, strong and weak
arguments

CO5: Develop higher level strategic thinking and diverse

mathematical concepts through building analogies, odd one out

CO6: Demonstrate higher level quantitative aptitude such as

average, ratio & proportions, mixtures & allegation for making
business decisions.

This penultimate stage introduces the student to the basics of

Human Resources. Allows the student to understand and interpret
KRA | KPI and understand Job descriptions. A student also
7 Course Description understands how to manage conflicts, brand himself/herself,
understand relations and empathise others with level-4 of quant,
aptitude and logical reasoning

8 Outline syllabus – ARP 306

CSA, SSET, SU Page 184

 CO
Unit 1 Ace the Interview
MAPPING
HR Sensitization ( Role Clarity | KRA | KPI | Understanding JD ) | Conflict CO1
A Management
B Negotiation Skills | Personal Branding CO3, CO4
Uploading & Curating Resumes in Job Portals, getting Your Resumes CO1, CO3
C Noticed | Writing Cover Letters | Relationship Management
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
A Sitting Arrangement & Venn Diagrams | Puzzles | Distribution | Selection CO4
B Direction Sense | Statement & Conclusion | Strong & Weak Arguments CO4
C Analogies, Odd One out | Cause & Effect CO5
Unit 3 Quantitative Aptitude
A Average , Ratio & Proportions, Mixtures & Allegation CO6
B Geometry-Lines, Angles & Triangles CO6
C Problem of Ages | Data Sufficiency - L2 CO6
Unit 4 Verbal Abilities-4
A • Antonyms and Synonyms CO1
B Idioms and Phrases CO2
Unit 5 Problem Solving and Case Studies
A Real time Case Study Solving Exercises CO4
B Intra student Mock Situation Handling Exercises CO4
Evaluation
CA-25% , MTE-25% ETE-50%
Weightage
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – Arihant Publications | Quicker
Text Maths- M. Tyra | Power of Positive Action (English, Paperback, Napoleon Hill) | Streets of
book/s* Attitude (English, Paperback, Cary Fagan, Elizabeth Wilson) The 6 Pillars of self-esteem and
awareness – Nathaniel Brandon | Goal Setting (English, Paperback, Wilson Dobson

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 - - - - - - - - 1 2 1 2 - - -

CO1 - - - - - - - - 1 2 1 2 - - -

CO1 - - - - - - - - 1 2 1 2 - - -

CO1 1 - - - - - - - 1 2 1 2 - - -

CO1 1 - - - - - - - 1 2 1 2 - - -

CO1 1 - - - - - - - 1 2 1 2 - - -

CSA, SSET, SU Page 185

Syllabus: CSP 396, Technical Skill Enhancement Course-2(Application
Development Lab)

School: SSET Batch: 2023-2027

Department CSA
Program: B.Tech Current Academic Year: 2023-2024
Branch: IT Semester:6
1 Course Code CSP396
2 Course Title Technical Skill Enhancement Course-2(Application Development
Lab)
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory/Elective
5 Course Describe the components and structure of a mobile development
Objective frameworks (Android SDK and Eclipse Android Development Tools
(ADT)) and learn how and when to apply the different components to
develop a working system.
6 Course On successful completion of the course, the student will be able to:
Outcomes CO1: Explain the fundamentals of Android App Development.
CO2: Make use of UI components to create Android applications.
CO3: Examine the services and notifications in android to perform event
driven programming.
CO4: Develop database SQLite based Android applications.
CO5: Analyze the usage of commonly available device sensors while
building Android App.
CO6: Develop application using Android software development tools.
7 Course The course will introduce concepts of the Android platform, Android
Description application components, Activities and their lifecycle, UI design. It will
also help students to build applications according to their problem
statements.
8 Outline syllabus CO Mapping
Unit 1 Introduction to Android
Configuration of android SDK and test run of application on CO1,CO6
device, Create “Hello World” application, develop an Android
Application to implement Activity life cycle.
Unit 2 Android UI Components
Create a layout of Calculator using Grid layout, develop an CO1,CO2,
Android Application to implement event listener on above
layout, develop an Android Application to implement implicit
,CO6
intent.
Unit 3 Services and Notification
Develop an Android Application to implement Service life CO3, ,CO6
cycle, Develop an Android Application to implement status
bar notification, Create a menu with 5 options and selected
option should appear in text box
Unit 4 Working with SQL Lite
Create and Login application for above mentioned problems, CO4, ,CO6

CSA, SSET, SU Page 186

 Create an application to implement Create, Insert and update
operation on the database, Create an application to perform
Delete and retrieve operation on the database.
Unit 5 Sensor Device
Develop an Android Application to detect availability of all CO5, ,CO6
sensors, Develop an Android Application to Fetch data from
sensors, Develop an Android Application for development of
compass application with help of Orientation sensor
Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Anubhav Pradhan and Anil V. Deshpande, Composing Mobile Apps: Learn,
Explore, Apply Using Android , 1st Edition, Wiley India.
Other 1. Wei-Meng Lee, Beginning Android 4 Application Development.
2. Neil Smyth ,Android Studio Development essentials-Android 6
References

CO and PO Mapping
Mapping between Cos and Pos, PSO’s
Course
Sl.
Outcomes Mapped Programme Outcomes and PSO’s
No.
(COs)
CO1: Explain
the
fundamentals
1 PO1,PO3,PO5,PO12,PSO1,PSO2,PSO3
of Android
App
Development.
CO2: Make
use of UI
components
2 PO1,PO3,PO5,PO10,PO12,PSO1,PSO2,PSO3
to create
Android
applications.
CO3:
Examine the
services and
notifications
3 PO1,PO2,PO3,PO5,PO12,PSO1,PSO2,PSO3
in android to
perform event
driven
programming.
CO4:
Develop
database
4 PO1,PO3,PO5,PO12,PSO1,PSO2,PSO3
SQLite based
Android
applications.
CO5:
Analyze the
5 PO1,PO3,PO5,PO12,PSO1,PSO2,PSO3
usage of
commonly

CSA, SSET, SU Page 187

 available
device
sensors while
building
Android App.
CO6:
Develop
application
using PO1,PO2,PO3,PO4,PO5,PO6,PO7,PO9,PO10,PO11,PO12,PSO1,PSO2,PSO
6
Android 3
software
development
tools.

PO and PSO mapping with level of strength for Course Name Technical Skill
Enhancement Course-2 (Course Code CSP 396)
COs PO PO PO PO PO PO PO7 PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 8 9 0 1 2 1 2 3
CO1 1 - 1 - 2 - - - - - - 1 1 2 1

CO2 1 - 1 - 2 - - - - 2 - 1 1 2 1

CO3 1 2 1 - 2 - - - - - - 1 1 2 1

CO4 1 - 2 - 2 - - - - - - 1 1 2 1

CO5 2 - 1 - 2 - - - - - - 1 1 2 1

CO6 2 2 3 2 2 2 1 - 2 3 2 2 2 3 1

Avg
PO
attaine
d 1 0.7 1.5 0.3 2 0.3 0.2 0 0 1 0 1 1 2.2 1

Branch: IT Semester: 6th

1 Course Code CSP398 Course Name: Project Based Learning -4
2 Course Title Project Based Learning -4
3 Credits 2
4 Contact Hours 0-0-4
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To align student’s skill and interests with a realistic
problem or project.
2.To understand the significance of problem and its scope.
3.Students will make decisions within a framework.
6 Course Outcomes Students will be able to:
CO1: Identify and formulate problem statement.
CO2: Design relational database schema.
CO3: Develop the solution by using different aspects of
programming language.

CSA, SSET, SU Page 188

 CO4: Classify and understand various test techniques for
verification and validation of project.
CO5: Analyze and make use of modern for solving real word
problems.
CO6: Develop teamwork and need to engage in life-long
learning, along with the ability to communicate effectively
with others.
7 Course Description In PBL-4, the students will learn how to define the problem
for developing projects, and Design applicable solutions in
one or more application domains using software engineering
approaches that integrate ethical, social, legal and economic
concerns.
8 Outline syllabus CO Mapping
Unit 1 Problem Definition and identification, Team/Group CO1,CO4
formation and Project Assignment. Finalizing the problem
statement, resource requirement, if any.
Unit 2 Use of the relational algebra operations from CO2,CO6
mathematical set theory (union, intersection, difference,
and Cartesian product) and the relational algebra
operations developed specifically for relational
databases (select (restrict), project, join, and division)..
Unit 3 Design; implement project work in any programming CO3
language.
Unit 4 Use of various test tools and techniques for software CO4,CO5
verification and validation of project
Unit 5 Demonstrate and execute Project with the team. CO6
Report should include Abstract, Hardware / Software
Requirement, Problem Statement, Design/Algorithm, ER
diagrams, Use Case Diagrams, State Diagrams, Sequence
Diagrams, Communication Diagrams, and Activity
Diagrams, Implementation Detail. Validation Reports.
References, Test cases if any.
The presentation, report, work done during the term
supported by the documentation, forms the basis of
assessment.
Mode of Practical /Viva
examinatio
n
Weight age CA CE ETE
Distributio
n
25% 25% 50%

CO and PO Mapping
S. No. Course Outcome Programme Outcomes (PO)

CSA, SSET, SU Page 189

 1. CO1: Identify and formulate problem PO1, PO2, PO4,PO6, PO8,PO9,
statement. PO10, PO11,
PO12,PSO1,PSO2,PSO3
2. CO2: Design relational database schema. PO1, PO2, PO3,PO4,PO5, PO7,
PO8, PO9, PO11, PO12 ,
PSO1,PSO2,PSO3
3. CO3: Develop the solution by using different PO1, PO2, PO3,PO4,PO5, PO6,
aspects of programming language. PO8, PO9, PO11, PO12,
PSO1,PSO2
4. CO4: Classify and understand various test PO1, PO2, PO3,PO4,PO5,
techniques for verification and validation of PO8,PO9, PO10, PO11, PO12
project. ,PSO1,PSO2,PSO3
5. CO5: Analyze and make use of modern for PO1, PO2, PO5, PO6, PO7, PO8,
solving real word problems. PO9, PO12 PSO1,PSO2
6. CO6: Develop teamwork and need to PO2, PO4, PO8,PO9, PO10,
engage in life-long learning, along with the PO11, PO12,PSO1,PSO3
ability to communicate effectively with
others.

PO and PSO mapping with level of strength for Course Name Project Based Learning – 4 (Course
Code CSP398)
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
Programme Outcomes(POs)
COs PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 2 - 1 - 1 2 - 2 1 2 2 3
CO2 3 2 2 2 2 - - 1 2 - 2 1 2 1 1
CO3 3 2 2 2 2 3 - 1 2 - 2 1 2 2 -
CO4 3 3 2 2 3 - - 1 2 - - 1 2 2 2
CO5 3 2 - - 3 - - 1 2 - - 1 2 2 -
CO6 - 1 - 1 - - - 2 2 3 3 3 1 - 1
Avg
PO
3 2.2 1 1.5 1.7 0.7 0 1.2 2 1 2 1 2 1.5 1.2
attain
ed

CSA, SSET, SU Page 190

Syllabus: CSE 053, Advanced Operating System
School: SSET Batch : 2023-27
Program: Current Academic Year: 2023-24
B.Tech
Branch: IT Semester: VI
1 Course Code CSE Course Name: Advanced Operating System
053
2 Course Title Advanced Operating System
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core
Status
5 Course 1. This course introduces the challenges for designing the operating
Objective systems.
2. Includes different design principles and algorithms.
3. Evaluation of algorithms proposed.
4. Implementation of algorithms and utilities.
6 Course Students will be able :
Outcomes CO1 Discuss the various synchronization, scheduling and memory
management issues
CO2 Demonstrate the Mutual exclusion, Deadlock detection and agreement
protocols of
Distributed operating system
CO3 Discuss the various resource management techniques for distributed
systems
CO4 Identify the different features of real time and mobile operating
systems
CO5 Install and use available open source kernel
CO6 Modify existing open source kernels in terms of functionality or
features used
7 Course This course covers general issues of design and
Description implementation of advanced modern operating systems.
The focus is on issues that are critical to the applications of
distributed systems and computer networks, which include
inter process communication, distributed processing,
sharing and replication of data and files.
8 Outline syllabus CO Mapping
Unit 1 FUNDAMENTALS OF OPERATING
SYSTEMS
A Overview – Synchronization Mechanisms – CO1
Processes and Threads - Process Scheduling
B Deadlocks: Detection, Prevention and CO1
Recovery
C Models of Resources – Memory CO1
Management Techniques.
Unit 2 DISTRIBUTED OPERATING SYSTEMS
A Issues in Distributed Operating System – CO1, CO2
Architecture – Communication Primitives –

CSA, SSET, SU Page 191

 B Lamport’s Logical clocks – Causal Ordering CO1, CO2
of Messages
C Distributed Mutual Exclusion CO1, CO2
Algorithms – Centralized and Distributed
Deadlock Detection Algorithms – Agreement
Protocols.
Unit 3 DISTRIBUTED RESOURCE MANAGEMENT
A Distributed File Systems – Design Issues - CO1,CO2
Distributed Shared Memory – Algorithms for –
Implementing Distributed Shared memory
B Issues in Load Distributing – Scheduling CO1,CO2,CO3,CO4
Algorithms – Synchronous and Asynchronous
Check Pointing and Recovery
C Fault Tolerance – Two-Phase Commit CO1,CO2,CO3,CO4
Protocol – Non-blocking Commit Protocol –
Security and Protection.
Unit 4 REAL TIME AND MOBILE OPERATING
SYSTEMS
A Basic Model of Real Time Systems - CO1,CO2,CO3,CO5
Characteristics- Applications of Real Time
Systems
B Real Time Task Scheduling - Handling CO1,CO2,CO3,CO5
Resource Sharing
C Mobile Operating Systems –Micro Kernel CO1,CO2,CO3,CO5
Design - Client Server Resource Access –
Processes and Threads - Memory
Management - File system.
Unit 5 CASE STUDIES
A linux System: Design Principles - Kernel CO1,CO2,CO3,CO6
Modules - Process Management
Scheduling -
B Memory Management - Input-Output CO1,CO2,CO3,CO4,CO6
Management - File System
C Inter-process Communication. iOS and CO1,CO2,CO3,CO6
Android: Architecture and SDK Framework -
Media Layer -
Services Layer - Core OS Layer - File System.
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Abraham Silberschatz; Peter Baer Galvin;
Greg Gagne, “Operating System Concepts”,
Seventh Edition, John Wiley & Sons, 2004.
Other 1. Mukesh Singhal and Niranjan G.
References Shivaratri, “Advanced Concepts in
Operating Systems
2. Distributed, Database, and
Multiprocessor Operating Systems”, Tata
McGraw-Hill,
2001.
3. Daniel P Bovet and Marco Cesati,
“Understanding the Linux kernel”, 3rd
edition, O’Reilly, 2005.

CSA, SSET, SU Page 192

 4. Rajib Mall, “Real-Time Systems:
Theory and Practice”, Pearson Education
India, 2006.

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1 Discuss the various synchronization, PO1,PO2,PO3,PO4,PSO1
scheduling and memory management issues

2. CO2 Demonstrate the Mutual exclusion, PO1, PO3, PO4, PSO2

Deadlock detection and agreement protocols of
Distributed operating system

3. CO3 Discuss the various resource management PO1,PO2,PO3,PO4

techniques for distributed systems

4. CO4 Identify the different features of real time PO9, PO10,PO11, PSO3
and mobile operating systems

5. CO5 Install and use available open source kernel PO1,PO2,PO8,PO9,PO10,PSO1

6. CO6 Modify existing open source kernels in terms PO1,PO2,PO10,PO11,PSO1,PSO2
of functionality or features used

PO and PSO mapping with level of strength for Course Name Principles of Operating
System (Course Code CSE 053)

CSE053 COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2
CO1
Principles
of 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2
Operating CO2
Systems 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1
CO3
CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2

CO5 2 2 3 - - - - 3 3 1 2 - 3 - -

CO6 3 2 - - - - - - - 2 3 - 2 2 -

CSA, SSET, SU Page 193

 TERM-VII

CSA, SSET, SU Page 194

Syllabus: CSE062 MOBILE COMPUTING

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VII
Branch: IT
1 Course Code CSE062
2 Course Title MOBILE COMPUTING
3 Credits 3
4 Contact 3 0 0
Hours
(L-T-P)
Course Core /Elective
Status
5 Course The objective of the course is to impart knowledge of mobile and
Objective wireless computing systems and techniques
6 Course On successful completion of this module students will be able to
Outcomes CO1: synthesize the basic concepts and principles in mobile computing.
(5-6) CO2: analyze the concept of wireless& telecommunication networks.
CO3: synthesize the concepts of IEEE802.11, Bluetooth and
HYPERLAN.
CO4: Understand the concept of mobile IP & various Routing Protocols
CO5: synthesize the concepts of Mobile Transport Layer & WAP
CO6: Comparison of all the protocols
7 Course This course will cover various topics of mobile computing,
Description networking, and systems, including but not limited to: applications of
smart phones, cellular networks, embedded sensor systems,
localization systems, energy efficiency of mobile devices, wearable
and vehicular mobile systems, mobile security etc.
8 Outline syllabus CO
Mapping
Unit 1 INTRODUCTION
A Wireless transmission , Frequencies for radio transmission CO1
B Signals , Antennas , Signal Propagation , Multiplexing, CO1
Modulations
C Spread spectrum, MAC, SDMA , FDMA , TDMA , CDMA CO1
, Cellular Wireless Networks
Unit 2 TELECOMMUNICATION NETWORKS
A GSM: Mobile services, System architecture, Radio interface, CO2
Protocols
B Localization and calling, Handover, Security CO2
C General Packet Radio Service (GPRS): GPRS Architecture, CO2
GPRS network nodes,
Unit 3 WIRELESS LANS
A Introduction to IEEE 802.11b/g/n CO3
B Bluetooth technologies and architecture. CO3
C HIPERLAN, WML programming CO3

CSA, SSET, SU Page 195

 Unit 4 MOBILE NETWORK LAYER
A Mobile IP Goals, Entities, IP packet Delivery Agent CO4
Advertisement and Discovery, Registration.
B Hidden and exposed terminal problems ,Routing protocols CO4
classification,
C DSDV, DSR, AODV ,Security CO4
Unit 5 Mobile Transport Layer & Wireless Application
Protocol
A Traditional TCP, Indirect TCP, CO5
B Snooping TCP, Mobile TCP CO5,CO6
C WAP: Protocols, Architecture CO5,CO6
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. JochenSchiller : Mobile Communication, Pearson Education.
2. U. Hansman and L. Merck : Principles of Mobile Computing”, 2nd
Ed., Springer
Other 1. A. S. Tanenbaum. : Computer Networks, 4th Ed., Pearson Education.
References 2. D. Milojicic, F. Douglis. : Mobility Processes, Computers and
Agents”,Addison Wesley
3. D.B. Lange and M. Oshima : Programming and Deploying Java
Mobile Agents with Aglets, Addison Wesley.
CO and PO Mapping
S. Course Outcome Programme Outcomes
No. (PO) & Programme
Specific Outcomes
(PSO)
1. CO1: synthesize the basic concepts and principles in PO1, PO2, PO4, PO5,
mobile computing. PO10, PSO1, PSO2
2. CO2: analyze the concept of wireless& PO1, PO2, PO4, PO5,
telecommunication networks. PO10, PSO1, PSO2
3. CO3: synthesize the concepts of IEEE802.11, Bluetooth PO1, PO2, PO4, PO5,
and HYPERLAN. PO10, PSO1, PSO2
4. CO4: Understand the concept of mobile IP & various PO1, PO2, PO4, PO5,
Routing Protocols PO10, PSO1, PSO2
5. CO5: synthesize the concepts of Mobile Transport Layer & PO1, PO2, PO4, PO5,
WAP PO10, PSO1, PSO2
6. CO6: Comparison of all the protocols PO1, PO2, PO4, PO5,
PO10, PSO1, PSO2

PO and PSO mapping with level of strength for Mobile Computing (CSE 062)
Course Code_ PO PO PO PO PO PO PO PO PO PO PSO
CO’s
Course Name PO1 2 3 PO4 5 6 7 8 9 10 11 12 1 PSO2 PSO3
3 3 - 2 3 - - - - 2 - - 3 2 -
CO1
3 3 - 2 3 - - - - 2 - - 3 2 -
CO2
CSE062_
MOBILE 3 3 - 2 3 - - - - 2 - - 2 3 -
CO3
COMPUTING - - - - - - - 3 2 -
CO4 3 3 2 3 2
3 3 - 2 3 - - - - 2 - - 2 2 -
CO5

CSA, SSET, SU Page 196

 3 3 - 2 3 - - - - 2 - - 2 2 -
CO6
- - - - - - - 2 2 -
Avg. 3 3 2 3 2

CSA, SSET, SU Page 197

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VII
1 Course Code CSE063
2 Course Title Quantum Computing

3 Credits 3
4 Contact Hours 3-0-2
(L-T-P)
Course Status Core /Elective/Open Elective
5 Course Fundamentals of quantum information processing, including quantum computation,
Objective quantum cryptography, and quantum information theory. Topics include: the
quantum circuit model, qubits, unitary operators, measurement, entanglement,
quantum algorithms for factoring and search, quantum cryptographic key
distribution, error-correction and fault-tolerance, information capacity of quantum
channels, complexity of quantum computation.
6 Course CO1: Analyze the behavior of basic quantum algorithms
Outcomes
CO2: Demonstrate simple quantum algorithms

CO3: Simulate a simple quantum error-correcting code

CO4: Prove basic facts about quantum information channels

CO5: Explain quantum computing and quantum protocols

CO6: Illustrate information channels in the quantum circuit model.

7 Course This course teaches the fundamentals of quantum information processing, including
Description quantum computation, quantum cryptography, and quantum information theory.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Computers and the Strong Church–Turing Thesis, Circuit Model CO1
of Computation
B A Linear Algebra Formulation of the Circuit Model, Reversible CO1
Computation
C Quantum Physics and Computation CO1, CO2
Unit 2 LINEAR ALGEBRA AND THE DIRAC NOTATION CO1,
CO2,CO4
A The Dirac Notation and Hilbert Spaces, Dual Vectors, Operators
B The Spectral Theorem, Functions of Operators
C Tensor Products, The Schmidt Decomposition Theorem CO1, CO2
Unit 3 A QUANTUM MODEL OF COMPUTATION CO1, CO2
A The Quantum Circuit Model, Quantum Gates CO1,
CO2,CO5,CO6
B Universal Sets of Quantum Gates, Efficiency of Approximating
Unitary Transformations
C Implementing Measurements with Quantum Circuits
Unit 4 INTRODUCTORY QUANTUM ALGORITHMS CO1,CO2,CO3
A Probabilistic Versus Quantum Algorithms, Phase Kick-Back CO1,CO2,CO3
B The Deutsch Algorithm, The Deutsch–Jozsa Algorithm CO1,CO2,CO3
C Simon’s Algorithm
Unit 5
A Tools for Analysing Probabilistic Algorithms CO2,CO3,CO4

CSA, SSET, SU Page 198

 B Solving the Discrete Logarithm Problem When the Order of a Is CO3,CO4
Composite
C Computing Schmidt Decompositions CO2,
CO4,CO5
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. “An Introduction to Quantum Computing”, Phillip Kaye
Raymond Laflamme, Michele Mosca
Other NA
References

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific
Outcomes (PSO)
1. CO1: Analyze the behavior of basic quantum algorithms
2. CO2: Demonstrate simple quantum algorithms PO1, PO2, PO5, PO8, PO12,
PSO3
3. CO3: Simulate a simple quantum error-correcting code PO1, PO2, PO3, PSO3
4. CO4: Prove basic facts about quantum information channels PO1, PO2, PO3, PO5, PO9,
PO12, PSO1
5. CO5: Explain quantum computing and quantum protocols PO1, PO2, PO4, PO5, PO6,
PO8, PSO2
6. CO6: Illustrate information channels in the quantum circuit model PO1, PO2, PO3, PO8, PO9,
PSO2,

PO and PSO mapping with level of strength for Course Name Quantum Computing (Course Code CSE063)

Course
P P P P P P P P P P PS
Code_ CO’ PO PO PSO PSO
O O O O O O O O O O O
Course s 2 4 2 3
1 3 5 6 7 8 9 10 11 12 1
Name
CO1 3 3 - - 2 - - 3 - - - 3 - - 3
CO2 3 3 2 - - - - - - - - - - - 3
Quantum CO3 3 3 2 - 2 - - - 2 - - 2 3 - -
Computin
g CO4 3 3 - 3 2 3 - 2 - - - - - 3 -
CO5 3 2 3 - - - - 3 3 - - - - 3 -
CO6 3 3 - 3 3 3 3 - - 3 3 - 3 - -

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

P P P P P P P P P P
Course Course PO PO PS PSO PS
O O O O O O O O O O
Code Name 1 2 O1 2 O3
3 4 5 6 7 8 9 10 11 12
Quantum
CSE06 1. 1. 1.
Computi 3 2.7 1 1 .5 .8 .5 .5 .8 1 1 1
3 1 5 3
ng

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 199

 School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VI
1 Course Code CSE071
2 Course Title Introduction to Internet of Things
3 Credits 2
4 Contact 2-0-0
Hours
(L-T-P)
Course Elective
Status
5 Course In this course, student will explore various concepts of Internet of things
Objective such as things, enabling technologies, M2M to IoT and IoT architecture.
This course also discusses the security challenges and then provides
answers on how to successfully manage IoT security and build a safe
infrastructure for smart devices. In the end they will also be able to
identify the challenges in IoT and its various areas of application.
6 Course CO1: Define the general concepts of Internet of Things.
Outcomes CO2: Recognize the basic M2M Ecosystem and change from M2M to
IoT.
CO3: Outline the concepts of IoT platform.
CO4: Explain IoT security and vulnerability threats.
CO5: Examine the challenges in IoT specific application.
CO6: Discuss the various domains where IOT can be applied
successfully.
7 Course This course introduces the concepts for internet of things and how we
Description can embed it into our daily lives for the development of life style. It
will also help students to understand the applications according to their
problem statements.
8 Outline syllabus CO Mapping
Unit 1 Introduction to IoT
A Defining IoT, History of IoT, Importance of IoT , IoT CO1
Basic Characteristics, Enabling Technologies of IoT
B About the Internet in IoT, IoT Advantages and CO1
Disadvantages, M2M Overview, M2M Features
C M2M Ecosystem, Comparison of the Main CO1
Characteristics of M2M and IoT, M2M Applications
Unit 2 IoT Architecture
A Basic Building blocks of IoT system: Sensors, CO1, CO2
Processors, gateways, Applications
B Physical design of IoT: Things in IOT, IoT Protocols, CO1, CO2
Logical design of IoT: IoT Functional Blocks, IoT
Communication Models. IoT Communication API’s
C IoT Service Oriented Architecture (SOA), API CO1, CO2
Oriented Architecture.
Unit 3 Introduction to IoT Platform

CSA, SSET, SU Page 200

 A IoT Working, Introduction to Arduino and Raspberry CO1, CO3
Pi
B The SENSEnut Platform, Peripheral Hardware CO1, CO3
Specific Calls: DIO Functions, I2C Functions
C MAC functions: General Functions, Coordinator CO1, CO3
Functions, genMac Functions
Unit 4 Vulnerabilities, Attacks, and Countermeasures
A Cyber security versus IoT security and cyber-physical CO1, CO4,
systems, Need to secure IoT CO5
B Primer on threats, vulnerability, and risks (TVR) CO1, CO4,
CO5
C Common IoT attacks, Today's IoT attacks , Threat CO1, CO4,
modeling for an IoT system CO5
Unit 5 Domain specific applications of IoT
A Home automation concept and case study CO1, CO3,
CO6
B Industry applications concept and case study CO1, CO3,
CO6
C Surveillance applications concept and case study, Other CO1, CO3,
IoT applications CO6
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. The Internet of Things: Connecting Objects to the
Web edited by Hakima Chaouchi, Reference for
Unit-1.
2. Introduction to Internet of Things, Prof. Sudip
Misra, NPTEL Lectures Notes, Computer Science
& Applications, Indian Institute of Technology
Kharagpur, Reference for Unit 2, 3 (c), 4.
3. Internet of Things, Rajkumar Buyya, Reference for
Unit 3 (c)
4. Arshdeep Bahga and Vijay Madisetti, “Internet of
Things – A Hand-on Approach”, Universities
press, 2015, Reference for Unit 3 (B)
5. API REFERENCE GUIDE: SENSEnuts WSN
sensation
6. Practical Internet of Things Security, Brian
Russell, Drew Van DurenCopyright © 2016 Packt
Publishing
Other 1. Charalampos Doukas , "Building Internet of
References Things with the Arduino", Create space, April
2002
2. Dr. Ovidiu Vermesan and Dr. Peter Friess,
“Internet of Things: From research and innovation
to market deployment”, River Publishers 2014.
3. Contiki : The open source for IOT, www.contiki-
os.org

CSA, SSET, SU Page 201

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes (PSO)
1. CO1: Define the general concepts of PO1, PO2, PO3, PO6, PO7, PO12,
Internet of Things. PSO1
2. CO2: Recognize the basic M2M PO1, PO2, PO3, PO6, PO7, PO12,
Ecosystem and change from M2M to IoT. PSO1
3. CO3: Outline the concepts of IoT PO1, PO2, PO3, PO4, PO6, PO7,
platform. PO12, PSO1
4. CO4: Explain IoT security and PO1, PO2, PO3, PO4, PO5, PO6, PO8,
vulnerability threats. PO9, PO10, P011, PO12, PSO1, PSO2,
PSO3
5. CO5: Examine the challenges in IoT PO1, PO2, PO3, PO4, PO5, PO6, PO7,
specific application. PO12, PSO1
6. CO6: Discuss the various domains where PO1, PO2, PO3, PO4, PO5, PO6, PO7,
IOT can be applied successfully. PO12, PSO1

PO and PSO mapping with level of strength for Course Name Introduction to Internet of
Things (CSE071)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO2

CO’s PO4 PSO1 PSO3
Course Name 1 2 3 5 6 7 8 9 10 11 12

CO1 3 1 1 - - 2 1 - - - - 3 3 - -

CO2 2 2 1 - - 1 3 - - - - 3 3 - -
_ CSE071
Introduction CO3 3 1 1 2 - 2 1 - - - - 3 3 - -
to Internet of
CO4 3 3 3 3 2 2 - 3 3 3 3 3 2 2 3
Things
CO5 3 3 3 3 3 2 3 - - - - 3 3 - -

CO6 2 2 2 2 3 2 3 - - - - 3 3 - -

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

Course PO PO PO PO PO PO PO PO PO PO PO PSO PSO

Course Name PO2 3
PSO2
Code 1 4 5 6 7 8 9 10 11 12 1 2
Introduction
CSE071 to Internet of 2.7 2.0 1.8 2.5 2.7 1.8 2.2 3.0 3.0 3.0 3.0 3.0 2.8 2.0 3.0
Things

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 202

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VII
1 Course Code CSE072
2 Course Title Parallel Computing Algorithms

3 Credits 2
4 Contact Hours 2-0-0
(L-T-P)
Course Status Core /Elective/Open Elective
5 Course Design and analysis of parallel algorithms on various parallel network model, with
Objective emphasis on time complexities after implementation, a comparative study of
various architecture with respect to time complexity. Understanding the
fundamental of parallel algorithms.
6 Course CO1: Acquire the skill to design and develop parallel algorithms with efficient time
Outcomes complexity.
CO2: Explain various terminology of parallel processing which is required to design
and understand the future processor architectures.
CO3: Demonstrate the skill to choose the technology to use, based on the
requirements and functionality of multi-processor architecture based on the design
parameters of the parallel architectures.
CO4: Explain how large‐scale parallel systems are architecture and how massive
parallelism are implemented in accelerator architectures
CO5: Design efficient parallel algorithms and applications
CO6: Analyse performance and modeling of parallel programs
7 Course This course introduces critical methods and techniques related to parallel
Description computing. Particularly, the course focuses on hardware, algorithm, and
programming of parallel systems, providing students a complete picture to
understand pervasive parallel computing.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Introduction to Parallel Processing Approach
B Difference between Parallel Processing and Serial Processing, CO1
Background, Flynn’s Taxonomy for serial and parallel computer
architecture
C Parallel Algorithms, Performance of Parallel Algorithm. CO1, CO2
Unit 2 Basic Techniques and Different Network Architecture CO1,
CO2,CO4
A Criteria to evaluate processor organization
B Mesh Networks, Binary Tree Networks, Hypertree Networks,
Pyramid Networks, Butterfly Networks, Hypercube (Cube-
Connected) Networks,
C Cube-Connected Cycle Networks, Shuffle-Exchange Networks, CO1, CO2
Case Studies Based on the Parallel Network Architecture.
Unit 3 Parallel Architectures CO1, CO2
A Multiprocessors, Uniform Memory Access (UMA) CO1,
Multiprocessors and Non-Uniform Memory Access, Mesh of CO2,CO5,CO6
Trees Architecture,
B Applications based on MoT, Advantages/Disadvantages of MoT
based on parallel parameters, Multi-Mesh Architecture,
C Applications based on MM, Advantages/Disadvantages of MM
based on parallel parameters Multi-Mesh of Trees Architecture,
Advantages of MMT over MM and MoT
Unit 4 Parallel Algorithms on Different Architectures CO1,CO2,CO3

CSA, SSET, SU Page 203

 A One to One Communication Algorithm on Multi-Mesh CO1,CO2,CO3
Architecture and Multi-Mesh of Trees Architecture,
B All-to-All Algorithm Communication Algorithm on Multi-Mesh CO1,CO2,CO3
Architecture and Multi-Mesh of Trees Architecture,
C Sorting Algorithms on MMT, Case Studies based on MMT
Architecture
Unit 5 Parallel computing Application
A Performance measurement and analysis of parallel programs CO2,CO3,CO4
B Problem solving on clusters using MapReduce CO3,CO4
C Warehouse-scale computing CO2,
CO4,CO5
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. “Introduction to Parallel Computing”, 2nd Ed, Ananth Grama,
Anshul Gupta, George Karypis, Vipin Kumar
Other 1. “Using MPI: Portable Parallel Programming with the Message-Passing
References Interface”, 3rd Ed - William Gropp, Ewing Lusk, Anthony Skjellum
2. “Programming Massively Parallel Processors: A Hands-on Approach”,
3rd Ed. - David B. Kirk, Wen-mei W. Hwu

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Acquire the skill to design and develop parallel
algorithms with efficient time complexity.
2. CO2: Explain various terminology of parallel processing which PO1, PO2, PO5, PO8, PO12, PSO3
is required to design and understand the future processor
architectures.
3. CO3: Demonstrate the skill to choose the technology to use, PO1, PO2, PO3, PSO3
based on the requirements and functionality of multi-processor
architecture based on the design parameters of the parallel
architectures.
4. CO4: Explain how large‐scale parallel systems are architecture PO1, PO2, PO3, PO5, PO9, PO12,
and how massive parallelism are implemented in accelerator PSO1
architectures
5. CO5: Design efficient parallel algorithms and applications PO1, PO2, PO4, PO5, PO6, PO8,
PSO2
6. CO6: Analyse performance and modeling of parallel programs PO1, PO2, PO3, PO8, PO9, PSO2,

PO and PSO mapping with level of strength for Course Name Parallel Computing (Course Code CSE072)

Course
P P P P P P P P P P PS
Code_ CO’ PO PO PSO PSO
O O O O O O O O O O O
Course s 2 4 2 3
1 3 5 6 7 8 9 10 11 12 1
Name
CO1 3 3 - - 2 - - 3 - - - 3 - - 3
CO2 3 3 2 - - - - - - - - - - - 3
CSE072
Parallel CO3 3 3 2 - 2 - - - 2 - - 2 3 - -
Computin CO4 3 3 - 3 2 3 - 2 - - - - - 3 -
g
CO5 3 2 3 - - - - 3 3 - - - - 3 -
CO6 3 3 - 3 3 3 3 - - 3 3 - 3 - -

CSA, SSET, SU Page 204

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

P P P P P P P P P P
Course Course
PO PO O O O O O O O O O O PS PSO PS
Code Name
1 2 3 4 5 6 7 8 9 10 11 12 O1 2 O3
Parallel
CSE07 1. 1. 1.
Computin 3 2.7 1 1 .5 .8 .5 .5 .8 1 1 1
2 1 5 3
g

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 205

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VII
1 Course code CSE073
2 Course title 3D Printing and Software Tools

3 Credits 2
4 Contact 2-0-0
hours
(L-T-P)
Course status Core /elective/open elective
5 Course This course will help understand the technical principles and work
objective flows of polymers, metals, and composites.
6 Course CO1: apply the unique advantages of 3d printing to their designs.
outcomes CO2: compare additive manufacturing to traditional technologies and
choose the best technology for a given application.
CO3: distinguish between various 3d printing technologies and
materials and select appropriately for a given application.
CO4: discuss the economic implications of 3d printing including its
impact on startup businesses and supply chains
CO5: evaluate real-life scenarios and recommend the appropriate use
of 3d printing technology
CO6: explain current and emerging 3d printing applications in a
variety of industries
7 Course In this course students will gain broad understanding of the advances
description that led to today’s manufacturing environment. They will understand
how humans, machines and code work together to make things.
8 Outline syllabus CO mapping
Unit 1 Introduction to 3d printing
A Cutting, subtractive manufacturing

B Forming CO1
C Additive manufacturing CO1, CO2

Unit 2 Mesh CO1, CO2,CO4

A Review of geometry terms CO2

B Things to consider when preparing a mesh file CO3

C Making process (a reminder), making by sharing CO1, CO2

Unit 3 Introduction to computer numerical control (cnc) CO1, CO2

A Numerical control, functions of a machine tool, CO1,
concept of numerical control, historical CO2,CO5,CO6
development, definition

CSA, SSET, SU Page 206

 B Advantages of cnc machine tools, evolution of cnc, CO3
advantages of cnc, limitations of cnc, features of
cnc
C The machine control unit (mcu) for cnc, CO4
classification of cnc machine tools, cnc machining
centers
Unit 4 Blue print reading CO1,CO2,CO3
A Reading the machining sketches, different CO1,CO2,CO3
geometrical tolerance symbols,
B Reading dimensional tolerances, understanding the CO1,CO2,CO3
views,
C Concept of first angle & third angle projection CO3
Unit 5 Cnc milling CO4
A Fundamentals of cnc milling, familiarization of CO2,CO3,CO4,
control panel CO6
B Fundamentals of cnc programming, part CO3,CO6
programming techniques
C Machining practice on cnc milling, practice session CO2,
at industry CO4,CO5, CO6
Mode of Theory/jury/practical/viva
examination
Weightage CA MTE ETE
distribution 25% 25% 50%
Text book/s* Liza Wallach Kloski, Nick Kloski – “Getting
Started with 3D Printing_ A Hands-on Guide to the
Hardware, Software, and Services Behind the New
Manufacturing Revolution”-Maker Media, Inc
(2016)
Other Internet
references

CO and PO mapping
S. Course outcome Programme Outcomes
No. (po) & Programme
Specific Outcomes (pso)
1. CO1: apply the unique advantages of 3d printing to their
designs.
2. CO2: compare additive manufacturing to traditional PO1, PO2, PO5, PO8,
technologies and choose the best technology for a given PO12, PSO3
application.
3. CO3: distinguish between various 3d printing PO1, PO2, PO3, PSO3
technologies and materials and select appropriately for a
given application.
4. CO4: discuss the economic implications of 3d printing PO1, PO2, PO3, PO5,
including its impact on startup businesses and supply PO9, PO12, PSO1
chains
5. CO5: evaluate real-life scenarios and recommend the PO1, PO2, PO4, PO5,
appropriate use of 3d printing technology PO6, PO8, PSO2

CSA, SSET, SU Page 207

 6. CO6: explain current and emerging 3d printing PO1, PO2, PO3, PO8,
applications in a variety of industries PO9, PSO2,

PO and PSO mapping with level of strength for course name 3d printing and software tools
(course code CSE073)

Cours
e
CO
code_ P P P P P P P P P P PS
’s
course O PO O PO O O O O O O O O O PSO PSO
name 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO 3 3 - - 2 - - 3 - - - 3 - - 3
1
CO 3 3 2 - - - - - - - - - - - 3
2
CSE0 CO 3 3 2 - 2 - - - 2 - - 2 3 - -
73 3
3d CO 3 3 - 3 2 3 - 2 - - - - - 3 -
printin 4
g and CO 3 2 3 - - - - 3 3 - - - - 3 -
softwa 5
re CO 3 3 - 3 3 3 3 - - 3 3 - 3 - -
tools 6

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

P P P
Cours
Cours P P P P P P P O O O PS PS
e
e code PO PO O O O O O O O 1 1 1 O PSO O
name
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
3d
printi
ng
CSE0 1. 1. 1.
and 3 2.7 1 1 .5 .8 .5 .5 .8 1 1 1
73 1 5 3
softw
are
tools

Strength of correlation

1. Addressed to slight (low=1) extent 2. Addressed to moderate (medium=2) extent

3. Addressed to substantial (high=3) extent

CSA, SSET, SU Page 208

CSE472: Artificial Intelligence
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VII
1 Course Code CSE472 Course Name: Artificial Intelligence
2 Course Title Artificial Intelligence
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status CORE
5 Course Objective The objective of the course is to introduce basic fundamental concepts in
Artificial Intelligence (AI), with a practical approach in understanding
them. To visualize the scope of AI and its role in futuristic development.
6 Course Outcomes After the completion of this course, students will be able to:
CO-1. Relate the goals of Artificial Intelligence and AI and non-
AI solution.
CO-2. Analyze and various AI uninformed and informed search
algorithms.
CO-3. Extend knowledge representation, reasoning, and theorem
proving techniques to real-world problems
CO-4. Make use of: Machine learning algorithms in various
application domains of AI.
CO-5. Select Artificial Intelligent based applications.
CO-6. Develop independent (or in a small group) research and
communicate it effectively.
7 Course Description In this course students will learn basic introduction of Artificial
Intelligence, problem solving agents, reasoning, learning and applications
of artificial intelligence.
8 Outline syllabus CO Mapping
Unit 1 INTRODUCTION TO AI
A Foundation of AI, Goals of AI, History and AI course CO1
line
B Introduction to Intelligent Agents; Environment; CO1
Structure of Agent
C AI Solutions Vs Conventional Solutions; a CO1, CO2
philosophical approach; a practical approach
Unit 2 PROBLEM SOLVING AGENTS
A Problem solving using Search Techniques; Problems; CO1, CO2
Solutions; Optimality
B Informed Search Strategies; Greedy Best-First; A* CO1, CO2
Search; Heuristic Functions
C Uninformed Search Strategies; BFS; DFS; DLS; UCS; CO1, CO2
IDFS; BDS
Unit 3 KNOWLEDGE & REASONING
A Knowledge-Based Agents; Logic; First-Order Logic; CO3
Syntax-Semantics in FOL; Simple usage;
B Inference Procedure; Inference in FOL; Reduction; CO3
Inference Rules;
C Forward Chaining; Backward Chaining; Resolution CO3
Unit 4 LEARNING

CSA, SSET, SU Page 209

 A Common Sense Vs Learning; Components; CO1, CO2,
Representations; Feedback CO3,CO4
B Learning Types: Supervised; Unsupervised; CO1, CO2,
Reinforcement Learnings CO3,CO4
C Artificial Neural Networks: Introduction, types of CO1, CO2,
networks; Single Layer and Multi-Layer n/w. CO3,CO4
Unit 5 APPLICATIONS
A AI Present & Future; application case studies on NLP, CO3, CO4,
Image Processing; CO5, CO6
B Robotics – Hardware; Vision; Navigation based case CO3, CO4,
studies; CO5, CO6
C Ambient Intelligence case studies; CO3, CO4,
CO5, CO6
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Rich E& Knight K, Artificial Intelligence, Tata
McGraw Hill, Edition 3.
Reference Books 1. Russell S &Norvig P, Artificial Intelligence: A
Modern Approach, Prentice Hall.
2. Dan W. Patterson, Artificial Intelligence & Expert
Systems, Pearson Education with Prentice Hall
India. Indian Edition.

Course Outcomes:

Sl. No. Course Outcome (CO)

CO1 Relate the goals of Artificial Intelligence and AI PO3, PO4, PO5, PO10, PSO1,
and non-AI solution. PSO2, PSO3
CO2 Analyze and various AI uninformed and PO1, PO2, PO3, PO4, PO5,
informed search algorithms. PO10, PSO1, PSO2, PSO3
CO3 Extend knowledge representation, reasoning, PO1, PO2, PO3, PO4, PO5,
and theorem proving techniques to real-world PO12, PSO1, PSO2, PSO3
problems
CO4 Make use of: Machine learning algorithms in PO1, PO2, PO3, PO4, PO5,
various application domains of AI. PO12, PSO1, PSO2, PSO3
CO5 Select Artificial Intelligent based applications. PO1, PO2, PO3, PO4, PO5,
PO9, PO10 PO12, PSO1,
PSO2, PSO3
CO6 Develop independent (or in a small group) PO1, PO2, PO3, PO4, PO5,
research and communicate it effectively. PO9, PO10 PO12, PSO1,
PSO2, PSO3

Mapping of POs & COs: CO-PO and CO-PSO Mapping with level of strength

Course
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
Objectiv 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
es
CO1 1 2 3 2 2 2 2 3 2 2
CO2 2 3 3 2 3 2 2 3 3 2

CSA, SSET, SU Page 210

 CO3 3 3 3 3 2 1 1 1 2 3 3 2 3
CO4 3 3 3 3 2 2 1 2 1 3 3 2 3
CO5 2 3 3 3 3 2 2 2 3 2 2 2 3 3 2
CO6 2 3 3 3 3 2 2 2 3 2 2 2 3 3 2

CSA, SSET, SU Page 211

CSP472: Artificial Intelligence Lab

School: SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

and technology
Batch 2023-27 Academic Year 20223-24
Department Computer Science & Applications
Program: B. TECH
Branch: IT
1 Course Code CSP472
2 Course Title Artificial Intelligence Lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory
5 Course The objective of the course is to introduce basic fundamental concepts in
Objective Artificial Intelligence (AI), with a practical approach in understanding them.
To visualize the scope of AI and its role in futuristic development.
● To develop a sense of appreciation for traditional AI
Programming
● To use classical AI problems to understand cognitive process.
● To have an overview of the various processes involved in
Machine Learning
● To develop a working model of real life problem base on
Artificial Agent.
6 Course After the completion of this course, students will be able to:
Outcomes CO-1. Relate the goals of Artificial Intelligence and AI and
non-AI solution.
CO-2. Analyze and various AI uninformed and informed search
algorithms.
CO-3. Extend knowledge representation, reasoning, and theorem
proving techniques to real-world problems
CO-4. Make use of: Machine learning algorithms in various application
domains of AI.
CO-5. Select Artificial Intelligent based applications.
CO-6. Develop independent (or in a small group) research and
communicate it effectively.
7 Course In this course students will learn basic introduction of Artificial
Description Intelligence, problem solving agents, reasoning, learning and applications
of artificial intelligence.
8 Outline syllabus CO
Mapping
Unit 1 Practical based on goal based problems
Sub unit - a, b and c detailed in Instructional Plan
Unit 2 Practical related to uninformed search algorithm.
Sub unit - a, b and c detailed in Instructional Plan
Unit 3 Practical related to informed search algorithm.
Sub unit - a, b and c detailed in Instructional Plan
Unit 4 Practical related to knowledge representations and
logical reasoning

CSA, SSET, SU Page 212

 Sub unit - a, b and c detailed in Instructional Plan
Unit 5 Practical related to machine learning algorithms
Sub unit - a, b and c detailed in Instructional Plan
Mode of Practical/Viva
examination
Weightage CA CE ETE
Distribution 25% 25% 50%
Text book/s* 2. Rich E& Knight K, Artificial Intelligence, Tata
McGraw Hill, Edition 3.
Other 3. Russell S &Norvig P, Artificial Intelligence: A Modern
References Approach, Prentice Hall.
4. Dan W. Patterson, Artificial Intelligence & Expert
Systems, Pearson Education with Prentice Hall India.
Indian Edition.

Course Outcomes:
Sl. No. Course Outcome (CO)
CO-1: Relate the goals of Artificial Intelligence and AI PO3, PO4, PO5, PO10, PSO1,
and non-AI solution. PSO2, PSO3
CO-2: Analyze and various AI uninformed and PO1, PO2, PO3, PO4, PO5,
informed search algorithms. PO10, PSO1, PSO2, PSO3
CO-3: Extend knowledge representation, reasoning, PO1, PO2, PO3, PO4, PO5,
and theorem proving techniques to real-world PO12, PSO1, PSO2, PSO3
problems
CO-4: Make use of: Machine learning algorithms in PO1, PO2, PO3, PO4, PO5,
various application domains of AI. PO12, PSO1, PSO2, PSO3
CO-5: Select Artificial Intelligent based applications. PO1, PO2, PO3, PO4, PO5,
PO9, PO10 PO12, PSO1,
PSO2, PSO3
CO-6: Develop independent (or in a small group) PO1, PO2, PO3, PO4, PO5,
research and communicate it effectively. PO9, PO10 PO12, PSO1,
PSO2, PSO3

PO and PSO mapping with level of strength for Course Name Artificial Intelligence Lab
(Course Code CSP472)

Course Code_ PO PO PO PO PO PO PO PO PO PO PO PSO

CO’s 3
PO4 PSO2 PSO3
Course Name 1 2 5 6 7 8 9 10 11 12 1
CO1 1 2 3 2 2 2 2 3 2 2
CSP472:
CO2 2 3 3 2 3 2 2 3 3 2
Artificial CO3 3 3 3 3 2 1 1 1 2 3 3 2 3
Intelligence CO4 3 3 3 3 2 2 1 2 1 3 3 2 3
Lab CO5 2 3 3 3 3 2 2 2 3 2 2 2 3 3 2
CO6 2 3 3 3 3 2 2 2 3 2 2 2 3 3 2

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent

3. Addressed to Substantial (High=3) extent

CSA, SSET, SU Page 213

List of Practical’s:
Unit Practical based on goal based problems
1
Week a Lab Implementation of Water Jug Problem.
1 expt.1
Week b Lab Introduction to Lisp, and basic programming in Lisp like following:
2, 3 expt.2 i. Write a LISP function to compute sum of squares.
ii.
Write a LISP function to compute difference of squares. (if x
> y return x2 – y2, Otherwise y2 – x2).
iii. Write a Recursive LISP function which takes one argument
as a list and return last element of the list. (Do not use last
predicate.)
iv. Write a Recursive LISP function which takes one argument
as a list and return list except last element of the list. (Do not
use butlast.)
v. Write a Recursive LISP function which takes one argument
as a list and return reverse of the list. (Do not use reverse
predicate).
vi. Write a Recursive LISP function which takes two arguments
first an atom second a list returns a list after removing first
occurrence of that atom within the list.
vii. Write a Recursive LISP function which appends two lists
together.
viii. Write a recursive LISP function which takes 2 lists as
arguments and returns a list containing alternate elements
from each list.
Week c Lab Advance programming in Lisp like following:
4 expt.3 i. Write a function that compute the factorial of a
number.(factorial of 0 is 1, and factorial of n is n*(n-
1)*...1.Factorial is defined only for integers greater than or
equal to 0.)
ii. Write a function that evaluate a fully parenthesized infix
arithmetic expression. For examples, (infix (1+ (2*3)))
should return 7.
iii. Write a function that performs a depth first traversal of binary
tree. The function should return a list containing the tree
nodes in the order they were visited.
iv. Write a LISP program for water jug problem.
v. Write a LISP program that determines whether an integer is
prime.
Unit Practical related to uninformed search algorithm.
2
Week a, b, Lab Refer following figure as map with distance details, Write a program
5 expt.4 in your preferred language to generate path from ARAD to
BUCHREST, analyze result obtained by
a) Depth First Search

CSA, SSET, SU Page 214

 b) Breadth First Search
c) Uniform Cost Search

Week c Lab Write a program in your preferred language to generate steps to solve
6 expt.5 Tower of Hanoi problem.
Unit Practical related to informed search algorithm.
3
Week Mid term
7
Week a,b,c Lab Write a program in your preferred language to solve the 8 puzzle
8 expt.6 Problem-using A* algorithm.
Unit Practical related to knowledge representations and logical reasoning
4
Week A Lab Write PROLOG program to Program to categorize animal
9 expt.7 characteristics.
Week B Lab Write PROLOG program to solver for the linear equation A*X + B =
10 expt.8 0. Let the predicate linear (A, B, X) return the root X of the equation.
Week c Lab Write a PROLOG program that answers questions about family
11 expt.9 members and relationships includes predicates and rules which define
sister, brother, father, mother, grandchild, grandfather and uncle. The
program should be able to answer queries such as the following:
father(x, Amit)
grandson(x, y)
uncle (sumit, puneet)
mother (anita, x)
Unit Practical related to machine learning algorithms
5
Week a, Project Project Work Evaluation-0: Problem Statement
12
Week b Project Project Work Evaluation-1: Design Specification
13

CSA, SSET, SU Page 215

 Week c Project Project Work Evaluation-2: Development
14

CSA, SSET, SU Page 216

Syllabus: CSP 497, Capstone - 1
School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY
Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VII
1 Course Code CSP497 Course Name: Capstone - 1
2 Course Title Major Project -1
3 Credits 2
4 Contact 0-0-0
Hours
(L-T-P)
Course Status Compulsory
5 Course Project being the student’s last activity at the institution, it fulfills a purpose of synthesis of
Objective all the knowledge they have acquired throughout the different years. In addition, this
knowledge must be used in a particular way, in order to solve a specific problem, which lets
student demonstrate their aptitude by applying this knowledge.
6 Course Students will be able to:
Outcomes CO1: Identify problem statement in engineering and technology in selected field of interest.
CO2: Analyze the gathered information required to develop a project.
CO3: Apply prior knowledge of mathematics, Computer Science and Applications.
CO4: Participate in different teams and to focus on getting a working project done on time
with each student being held accountable for their part of the project.
CO5: Prepare the designs requirements, functional and conceptual design.
CO6: Initiate the actual implementation of the project work to produce the deliverables and
explain the work in written and oral forms.
7 Course The object of Major Project-I is to enable the student to take up investigative study in the
Description broad field of Information Technology, either fully theoretical/practical or involving both
theoretical and practical work to be assigned by the Department on an individual basis or
two/three students in a group, under the guidance of a Supervisor.
8 Outline syllabus CO Mapping
Unit 1 Problem identification, Literature survey/Gather & CO1, CO2,CO4,
analyze information from multiple sources
Unit 2 Formulate solution/ Problem Description: Project CO1, CO2, CO3
Planning, Time and Cost Estimation and budgeting, Risk
Management, Project scheduling and Planning Tools:
Work Breakdown structure/ LRC/ Gantt
charts/CPM/PERT Networks.
Creating System Requirement Specifications (Functional
& Non Functional)
Unit 3 Preparing Design: Data Flow Diagrams & Flow Charts, CO3, CO4
Use of appropriate tools and techniques for project design
Unit 4 Identify and Implement Project Modules. CO4, CO5
Unit 5 Use of appropriate tools/technologies for coding the CO2, CO5, CO6
modules
Report on final problem statement, specifications, project
schedule, final concept design and project schedule
Report and Presentation - Project Modules development
Mode of Practical
examination
Weight age CA CE ETE
Distribution 25%% 25% 50%

CSA, SSET, SU Page 217

CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Identify problem statement in engineering and PO1, PO2, PO3, PO4, PO5,PO6,PO7,
technology in selected field of interest. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
2. CO2: Analyze the gathered information required to PO1, PO2, PO3, PO4, PO5,PO6,PO7,
develop a project. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
3. CO3: Apply prior knowledge of mathematics, PO1, PO2, PO3, PO4, PO5,PO6,PO7,
Computer Science and Applications. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
4. CO4: Participate in different teams and to focus on PO1, PO2, PO3, PO4, PO5,PO6,PO7,
getting a working project done on time with each PO8, PO9, PO10, PO11,
student being held accountable for their part of the
project.
PO12,PSO1,PSO2,PSO3
5. CO5: Prepare the designs requirements, functional PO1, PO2, PO3, PO4, PO5,PO6,PO7,
and conceptual design. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
6. CO6: Initiate the actual implementation of the PO1, PO2, PO3, PO4, PO5, PO8, PO9,
project work to produce the deliverables and explain PO10, PO11, PO12,PSO1,PSO2,PSO3
the work in written and oral forms.

PO and PSO mapping with level of strength for Course Name Major Project -1 (Course Code
CSP497)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 3 3 2 2 2 2 1 2 1 1 2 2 3 3

CO2 3 3 3 3 2 1 1 1 2 1 1 2 3 3 3

CO3 3 1 3 3 2 1 1 1 2 1 1 2 3 3 3

CO4 1 1 2 1 2 3 3 1 2 3 1 2 1 2 3

CO5 1 2 2 1 2 1 1 1 2 2 1 2 1 2 3

CO6 2 1 2 1 3 - - 1 2 3 1 2 3 3 3

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

CSA, SSET, SU Page 218

 TERM-VIII

CSA, SSET, SU Page 219

Syllabus: CSP498 Capstone -2

School SHARDA SCHOOL OF ENGINEERING & TECHNOLOGY

Batch 2023-27
Department Computer Science & Applications
Programme B.Tech, Academic Year: 2023-24
Semester VIII
1 Course Code CSP498 Course Name: Major Project -2
2 Course Title CSP498_Capstone - 2
3 Credits 8
4 Contact Hours 0-0-0
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To understand the concept of project design after the
completion of project planning
2. Students making decisions within a framework
3. Continuous evaluation of the project
4. A final product to be evaluated for quality
6 Course Outcomes Students will be able to:
CO1: Demonstrate the implementation of the project.
CO2: Identify the test procedure for each implemented module.
CO3: Deploy and evaluate the modules to verify the required need
of the project.
CO4: Use different tools for communication, testing and report
writing.
CO5: Develop the attitude and ethics of a professional engineer.
CO6: Demonstrate an ability to present and defend their project
work to a panel of experts.
7 Course Description The objective of Major Project-II is to enable the student to extend
further the development of project till testing and deployment
under the guidance of a Supervisor.
8 Outline syllabus CO
Mapping
Unit 1 Complete the implementation of the project. Testing of the CO1, CO2
modules, Use of appropriate tools/techniques for testing
Unit 2 Deploy & demonstrate developed modules of the project CO2, CO3
Unit 3 Preparing a Project Report in the standard format for being CO4, CO5
evaluated by the Supervisor
Unit 4 Submission of Project and Report to Departmental CO4,
Committee CO5, CO6
Unit 5 Final Presentation before Departmental Committee CO6
Mode of Practical
examination
CA CE ETE
Weight age 25% 25% 50%
Distribution

CSA, SSET, SU Page 220

CO and PO Mapping
S. No. Course Outcome Programme Outcomes (PO)

1. CO1: Demonstrate the PO1, PO2, PO3, PO4, PO5,PO6,PO7,

implementation of the project. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
2. CO2: Identify the test procedure for PO1, PO2, PO3, PO4, PO5,PO6,PO7,
each implemented module. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
3. CO3: Deploy and evaluate the PO1, PO2, PO3, PO4, PO5,PO6,PO7,
modules to verify the required need PO8, PO9, PO10, PO11,
of the project. PO12,PSO1,PSO2,PSO3
4. CO4: Use different tools for PO1, PO2, PO3, PO4, PO5,PO6,PO7,
communication, testing and report PO8, PO9, PO10, PO11,
writing. PO12,PSO1,PSO2,PSO3
5. CO5: Develop the attitude and ethics PO1, PO2, PO3, PO4, PO5,PO6,PO7,
of a professional engineer. PO8, PO9, PO10, PO11,
PO12,PSO1,PSO2,PSO3
6. CO6: Demonstrate an ability to PO1, PO2, PO3, PO4, PO5,PO6,PO7,
present and defend their project PO8, PO9, PO10, PO11,
work to a panel of experts. PO12,PSO1,PSO2,PSO3

PO and PSO mapping with level of strength for Course Name Major Project -2 (Course
Code CSP498)
CO PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
s 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
2 1 2 2 3 2 2 2 2 2 2 2 3 3 3
CO
1
2 2 3 2 3 2 2 2 2 2 2 2 11 3 3
CO
2
3 3 3 3 3 2 2 2 2 2 2 1 1 3 3
CO
3
CO 2 2 2 2 3 2 2 2 2 3 2 1 1 2 2
4
CO 1 2 2 1 3 2 2 2 2 3 2 1 1 2 2
5
CO 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2
6

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

CSA, SSET, SU Page 221