Curriculum and Syllabi: University Institute of Engineering

Curriculum and Syllabi
Bachelor of Engineering
Computer Science & Engineering
Batch 2021
Year 2021
Version 1.0
BE, Computer Science & Engineering
University Institute of Engineering
NH-95, Chandigarh-Ludhiana Highway, Gharuan, Mohali, Punjab
(India) 140413
Bachelor of Engineering (CSE) CS-201 Page 1

TABLE OF CONTENTS
S. No. Content Page No.

1 Section 1: Program Educational Objectives, Program Specific Outcomes and 3
Program Outcomes
2 Section 2: Curriculum / Scheme – Annexure-1 & 2 5
3 Section 3: Semester wise Syllabi– Annexure 3 & 4 25

SECTION 1
Program Educational Objectives,

Program Outcomes and
Program Specific Outcomes
The PEOs are broad statements that describe the career and professional accomplishments that
programs are preparing graduates to attain within a few years of graduation.
PEO 1:- To produce computer science graduate engineers with an ability to comprehend,
understand and analyze real life problems for providing sustainable solutions teams in
the light of disruptive technologies.
PEO 2:- To inculcate life-long learning skills in graduates preparing them for work in changing
environments and multidisciplinary teams in order to enhance their capability being
globally employable.
PEO 3:- To instill leadership qualities in graduates with a sense of confidence, professionalism
and ethical attitude to produce professional leaders for serving the society.
PEO 4:- To make the graduates adaptable to changing career opportunities who have the potential
to excel in industry/ public sector/ higher studies or entrepreneurship exhibiting global
competitiveness.
Program Outcomes (POs) are attributes of the graduates that incorporate many areas of inter-related
knowledge and skills developed over the duration of the program through a wide range of courses and
experiences. They represent the big picture, describe broad aspects of behavior, and encompass multiple learning
experiences. CU has been designed to fully meet all t he 12 Program Outcomes:
PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals and an engineering specialization to the solution of complex engineering
problems.
PO 2: Problem analysis: Identify, formulate, review research literature and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences and engineering sciences.
PO 3: Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of data
and synthesis of the information to provide valid conclusions.
PO 4: Modern tool usage: Create, select, and apply appropriate techniques, resources and
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
PO 5: The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
PO 6: Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
PO 7: Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.
PO 8: Individual and teamwork: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.

PO 9: Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context to technological
change.
PO 10: Design/development of solutions: Design solutions for complex engineering problems
and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety and the cultural, societal, and
environmental considerations.
PO 11: Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.
PO 12: Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
Program Specific Objectives (PSOs) are specific statements PSOs are statements that describe what
the graduates of a specific engineering program should be able to do program are as follows:
PSO 1:- To acquire proficiency in developing and implementing efficient solutions using
emerging technologies, platforms and Free and Open-Source Software (FOSS).
PSO 2:- To gain critical understanding of hardware and software tools catering to the
contemporary needs of IT industry.

SECTION 2
Annexure -1
Scheme for BE Computer Science & Engineering (CS-201) Batch 2021
BREAK-DOWN OF CREDITS
NUMBER OF PERCENTAGE
S. No. CATEGORY
CREDITS WEIGHTAGE
1 University Core Courses (UC) 10 5.325

2 Program Core Courses (PC) 83 47.93
3 Program Elective (PE) 15 8.88
4 Basic Sciences (BS) 23 13.61
5 Engineering Sciences (ES) 15 8.88
6 Humanities and Social Sciences Courses (HSS) 6 3.55
7 University Open Elective (UOE) 6 3.55
Project/Research Project (PR/RPR) / Thesis/Dissertation (TD)/
8 14
Seminar (SM) 8.284
9 Summer/Institutional/Industrial Training (TR) 6 (MNG)
172 (EXCLUDING
TOTAL CREDITS MNG)

Semester-1
Pre- Co- Anti -

S Course Evaluation requisite requisite requisite
Code Course Name L T P S C CH
N Type
Internal External Total (with Course Code)
1 21SMT- Computational CR 0 4 0 0 4 4 40 60 100 - 21SPT-141 21SMT-
125 Mathematics 175
2 21SPT- Quantum and DE 3 0 0 0 3 3 40 60 100 - 21SMT-125 -

141 Semi Conductor
Physics
3 21ELT- Basic Electrical DE 3 0 0 0 3 3 40 60 100 - 21SPT-141, 21ECT-155,

111 and Electronics 21SMT-125, 21ECP-158
Engineering 21ELP-112
4 21CST- Problem Solving CR 0 2 0 0 2 2 40 60 100 - 21SPT-141, 21CST-151,

111 with Programming 21SMT-125, 21CSP-152
21ELP-112
5 21UCT- Communication UCR 0 2 0 0 2 2 40 60 100 - 21SPT-141, 21PCT-154,
141 Skills 21SMT-125, 21PCP-158
21ELP-112
6 21MEP- Computer CR 0 1 2 0 2 3 60 40 100 - 21SPT-141, 21MEP-
114 Graphics using 21SMT-125, 156
CAD Lab 21ELP-112
7 21SPP- Quantum and DE 0 0 2 0 1 2 60 40 100 - 21SPT-141, 21SZT-188

142 Semi Conductor 21SMT-125,
Physics Lab 21ELP-112
8 21ELP- Basic Electrical DE 0 0 2 0 1 2 60 40 100 - 21SPT-141, 21ECT-155,

112 and Electronics 21SMT-125 21ECP-158
Engineering Lab
9 21CSP- Problem Solving CR 0 0 4 0 2 4 60 40 100 - 21SPT-141, 21CST-151,

112 with Programming 21SMT-125, 21CSP-152
Lab 21ELP-112,
21CST-111
10 21UCP- Communication UCR 0 0 2 0 1 2 60 40 100 - 21SPT-141, 21PCP-158
142 Skills Lab 21SMT-125,
21ELP-112
11 21ECP- Foundations of CR 0 0 2 0 1 2 60 40 100 - 21SPT-141, 21CSP-358
114 Internet of Things 21SMT-125,
Lab 21ELP-112
12 21UCY- Life Skills and MNG 0 1 0 0 1 1 0 0 0 - 21SPT-141, 21UCY-196

146 Mentoring-1 MNG 21SMT-125,
21ELP-112
13 21UCH- Design Thinking UC 1 0 0 0 1 1 40 60 100 - 21SPT-141, -
243 and Creativity for 21SMT-125,
Innovation 21ELP-112
14 21CSV- Coding Boot Camp 2

113
7 9 14 0 25 31
TOTAL

Semester-2
Pre- Co- Anti -

N Type
1 21SMT- Calculus and Vector CR 0 4 0 0 4 4 40 60 100 21SMT- 21SZT- 21SMT-
175 Spaces 125 188,21ECT- 216
155,21CST-
151
2 21SZT- Biology For Engineers DE 3 0 0 0 3 3 40 60 100 - 1ECT- -
188 155,21CST-
151,21SMT-
175
3 21ECT- Digital Electronics DE 3 0 0 0 3 3 40 60 100 - 21SZT- 21ELT-111
155 188,21CST-
151,21SMT-
175
4 21CST- Introduction to CR 0 2 0 0 2 2 40 60 100 21CST- 21SZT- 21CST-
151 Programming 111 188,21ECT- 218
155, 21CSP-
152
5 21PCT- Professional CR 0 2 0 0 2 2 40 60 100 21UCT- 21ECT- 21TDP-
154 Communication Skills 141 155,21CST- 251
151,21SMT-
175
6 21ECP- Applied Digital DE 0 1 2 0 2 3 60 40 100 21ELP- 21ECT- 21CST-
158 Electronics Lab 112 155,21CST- 212
151,21SMT-
175
7 21CSP- Introduction to CR 0 0 2 0 1 2 60 40 100 21CSP- 21ECT- 21CSP-
152 Programming Lab 112 155,21CST- 219
151,21SMT-
175
8 21PCP- Professional CR 0 0 2 0 1 2 60 40 100 21UCP- 21ECT- 21TDP-
158 Communication Skills 142 155,21CST- 251
Lab 151,21SMT-
175
9 21MEP- Workshop CR 0 0 4 0 2 4 60 40 100 - 21ECT- 21ECP-
156 Practice Trades (CSE, 155,21CST- 114
ECE, EE) 151,21SMT-
175
10 21ECP- Foundations CR 0 0 2 0 1 2 60 40 100 21ECP- 21ECT- 21CSP-
118 of AI 114 155,21CST- 437
Applications 151,21SMT-
175
Lab
11 21UCY- Life Skills and MNG 0 0 2 0 1 2 0 0 0 21UCY- 21ECT- 21UCY-

196 Mentoring-2 MNG 146 155,21CST- 222
151,21SMT-
175
12 21UCH- Academic Research UC 1 0 0 0 1 1 40 60 100 - 21ECT- 21UCY-
297 Paper Writing and 155,21CST- 222
IPR 151,21SMT-
175
7 9 12 0 22 30
TOTAL

Semester-3
S Code Course Name Course L T P S C CH Evaluation Pre- Co-requisite Anti -

N Type requisite requisite

1 21CST- Data Structures CR 3 0 0 0 3 3 40 60 100 21CST-151 21CST-212,21CST- 21CST-311
211 214, 21SMT-216,
21CST-218,21CSP-
215
2 21CST- Computer Organization CR 3 0 0 0 3 3 40 60 100 21ELT-111 21CST-211,21CST- 21CST-252
212 & Architecture 214, 21SMT-216,
21CST-218,21CSP-
215
3 21CST- Database Management CR 3 0 0 0 3 3 40 60 100 21CST-151 21CST-211 , 21CST-311
214 System 21SMT-216,
21CST-218,21CSP-
215
4 21SMT- Numerical & CR 3 1 0 0 4 4 40 60 100 21SMT-175 21CST-211 , 21SMT-
216 Optimization Techniques 21CST-218,21CSP- 257
215
5 21TDT- Aptitude CR 0 2 0 0 2 2 40 60 100 21CST-111 21CST-211,21CST- 21TDY-302
202 214, 21SMT-216,
21CST-218,21CSP-
215
6 21CST- Object Oriented CR 2 0 0 0 2 2 40 60 100 21CST- 21CST-211,21CST- 21CST-254
218 Programming using Java 111,21CST- 214, 21SMT-
151 216,21CSP-215
7 21CSP- Data Structures Lab CR 0 0 4 0 2 4 60 40 100 21CSP- 21CST-211,21CST- 21CSP-255
212 112,21CSP- 214, 21SMT-
152 216,21CSP-215
8 21CSP- Database Management CR 0 0 2 0 1 2 60 40 100 21CSP-152 21CST-211,21CST- 21CSP-255
215 System Lab 214, 21SMT-216
9 21CSP- Object Oriented CR 0 0 2 0 1 2 60 40 100 21CSP-112 21CST-211,21CST- 21CSP-255

219 Programming using Java 214, 21SMT-
Lab 216,21CSP-215
10 21UCT- Introduction to UC 2 0 0 0 2 2 40 60 100 21PCT-154 21CST-211,21CST- 21CSY-BBB

221 Management and 214, 21SMT-
Leadership 216,21CSP-215
11 21UCY- Life Skills and Mentoring MNG 0 1 0 0 1 1 40 60 100 21UCY-196 21CST-211,21CST- 21UCY-265
246 : MNG 214, 21SMT-
216,21CSP-215
12 21UCH- Entrepreneurship UC 1 0 0 0 1 0 60 0 60 21PCP-154 21CST-211,21CST- 21CSY-BBB
249 214, 21SMT-
216,21CSP-215
13 21CSY- Institutional/Summer SSMNG 0 0 0 4 2 0 60 40 100 - - -
225 Training: MNG
TOTAL 17 3 8 4 24 29

Semester-4
Pre-requisite Co- Anti -
S Course Evaluation requisite requisite
N Type
1 21TDP- Soft Skills 0 0 2 0 1 2 40 60 100 21UCT-141 21CST- 21TDY-301
251 254,21CST-
CR 256,21CST-
258,21CSP-
259,21UCT-
213
2 21CST- Microprocessor 3 0 0 0 3 3 40 60 100 21CST-212 21CST- 21CST-315
252 & Interfacing 254,21CST-
CR 256,21CST-
258,21CSP-
259,21UCT-
213
3 21CST- Software 3 0 0 0 3 3 40 60 100 21CST-214 21CST- 21CST-313
254 Engineering CR 256,21CST-
258,21CSP-
259,21UCT-
213
4 21CST- Computer 3 0 0 0 3 3 40 60 100 21ECP-114 21CST- 21CST-
256 Networks CR 254,21CST- 352,21CST-
258,21CSP- 352
259,21UCT-
213
5 21CST- Principles of 3 0 0 0 3 3 40 60 100 21ECP-118 21CST- 21CST-316
258 Artificial CR 254,21CST-
Intelligence 256,21CSP-
259,21UCT-
213
6 21CSP- Programming in 0 0 4 0 2 4 60 40 100 21CST-218 21CST- 21CST-319
259 Python Lab CR 254,21CST-
256,21CST-
258 ,21UCT-
213
7 21CSR- Project-I 0 0 1 3 2 4 60 40 100 - - -
PR
264
8 21SMT- Probability and 3 1 0 0 4 4 40 60 100 21SMT-216 21CST- 21SMT-125

257 Statistics 254,21CST-
CR 256,21CST-
258,21CSP-
259,21UCT-
213
9 21CSP- Microprocessor 0 0 2 0 1 2 60 40 100 21CST- 21CST- 21CST-315
253 & Interfacing Lab 212 254,21CST-
CR 256,21CST-
258,21CSP-
259,21UCT-
213
10 21CSP- Software 0 0 2 0 1 2 60 40 100 21CSP-219 21CST- 21CSP-321
255 Engineering Lab 254,21CST-
CR 256,21CST-
258,21CSP-
259,21UCT-
213
11 21CSP- Computer 0 0 2 0 1 2 60 40 100 21CST-214 21CST- 21CSP-356
257 Networks Lab 254,21CST-
CR 256,21CST-
258,21CSP-
259,21UCT-
213
12 21CSY- EMPLOYABILITY 1 0 0 0 1 1 40 60 100 21CSP-152 21CSP-259 -
BBB ENHANCEMENT MNG
COURSES - MNG
13 21UCY- Life Skills and MNG 0 1 0 0 1 1 40 60 100 21UCY-246 21CST- -

296 Mentoring : 254,21CST-
MNG 256,21CST-
258,21CSP-
259,21UCT-
213
14 21UCY- Ethics and UC-MNG 1 0 0 0 1 1 40 60 100 - - -
295 Gender Equality
TOTAL 16 1 13 3 25 34

Semester-5
Pre- Co- Anti -

N Type
1 21CST- Design and 3 0 0 0 3 3 40 60 100 21CST- 21CST- 21CSP-
311 Analysis of 211 313,21CSP- 356
Algorithms 314,21CST-
CR
315,21CST-
316,21CST-
319,21CSP-
321
2 21CST- Operating Systems 3 0 0 0 3 3 40 60 100 21CST- 21CSP- 21CST-
313 252 314,21CST- 463
CR 315,21CST-
316,21CST-
319,21CSP-
321
3 21CSP- Competitive 0 0 2 0 1 2 60 40 100 21CSP- 21CST-313 21CSP-
314 Coding - I 259 ,21CST- 356
CR 315,21CST-
316,21CST-
319,21CSP-
321
4 21CST- System 3 0 0 0 3 3 40 60 100 21CST- 21CST- 21CST-
315 Programming 252 313,21CSP- 353
CR 314, 21CST-
316,21CST-
319,21CSP-
321
5 21CST- Machine Learning 3 0 0 0 3 3 60 40 100 21ECP- 21CST- 21CST-
316 118 313,21CSP- 472
CR 314,21CST-
315 ,21CST-
319,21CSP-
321
6 21CST- Professional 2 0 0 0 2 2 40 60 100 - - -
DE
3** Elective-I
7 21CSR- Project-II 0 0 1 5 3 6 60 40 100 - - -

PR
318
8 21CST- Project Based 2 0 0 0 2 2 40 60 100 21CST- 21CST- 21CSP-

319 Learning in Java 218 313,21CSP- 356
CR 314,21CST-
315,21CST-
316 ,21CSP-
321
9 21CSP- Design and 0 0 2 0 1 2 60 40 100 21CSP- 21CST- 21CST-
312 Analysis of 212 313,21CSP- 461
Algorithms Lab 314,21CST-
CR
315,21CST-
316,21CST-
319,21CSP-
321
10 21CSP- Machine Learning 0 0 2 0 1 2 60 40 100 21ECP- 21CST- 21CST-
317 Lab 118 313,21CSP- 462
314,21CST-
CR
315,21CST-
316,21CST-
319,21CSP-
321
11 21CSP- Professional 0 0 2 0 1 2 60 40 100 - - -
DE
3** Elective-I Lab
12 21CSP- Project Based 0 0 4 0 2 4 60 40 100 21CST- 21CST- 21CST-

321 Learning in Java 218 313,21CSP- 355
Lab CR 314,21CST-
315,21CST-
316,21CST-
319

13 21CSX- Institute/Industrial 0 0 0 4 2 4 60 40 100 - - -
SSMNG
322 Summer Training :
MNG
14 21TDY- Soft Skills :MNG 0 0 2 0 1 2 60 40 100 21TDP- 21CST- 21TDY-
301 TPP 251 313,21CSP- 351
314,21CST-
MNG
315,21CST-
316,21CST-
319,21CSP-
321
15 21TDY- Aptitude: MNG 0 2 0 0 2 2 40 60 100 21TDP- 21CST- 21TDY-
302 TPP 251 313,21CSP- 352
314,21CST-
MNG
315,21CST-
316,21CST-
319,21CSP-
321
16 21CSY- Fundamentals of MNG 3 0 0 0 3 3 40 60 100 - - -
313 Image Processing
17 21UCY- Life Skills and MNG 0 1 0 0 1 1 40 60 100 - - -
346 Mentoring : MNG
TOTAL 16 0 13 9 25 34

Semester-6
Pre- Co-requisite Anti -

S Course Evaluation requisite requisite
N Type
1 21CSP- Competitive CR 0 0 2 0 1 2 60 40 100 21CSP- 21CST- 21CST-
351 Coding – II 314 352,21CST- 475
353,21CST-
354,21CST-
355,21CST-
357,21CST-
371,21CSP-356
2 21CST- Network CR 3 0 0 0 3 3 40 60 100 21CST- 21CST- 21CST-
352 Operating 313 353,21CST- 432
System 354,21CST-
355,21CST-
357,21CST-
371,21CSP-356
3 21CST- Theory of CR 3 0 0 0 3 3 40 60 100 21CST- 21CST-352, 21CST-
353 Computation 315 21CST- 462
354,21CST-
355,21CST-
357,21CST-
371,21CSP-356
4 21CST- Information CR 3 0 0 0 3 3 40 60 100 21CST- 21CST- 21CST-
354 Security and 256 352,21CST-353, 463
Cryptography 21CST-
355,21CST-
357,21CST-
371,21CSP-356
5 21CST- Mobile CR 2 0 0 0 2 2 40 60 100 21CST- 21CST- 21CST-
355 Application 319 352,21CST- 475
Development 353,21CST-354
,21CST-
357,21CST-
371,21CSP-356
6 21CST- Internet of CR 3 0 0 0 3 3 40 60 100 21ECP- 21CST- 21CST-
357 Things 114 352,21CST- 464
353,21CST-
354,21CST-355
,21CST-
371,21CSP-356
7 21CST- Professional DE 2 0 0 0 2 2 60 40 100 - - -
3** Elective-II
8 21CSR- Project-III PR 0 0 1 5 3 6 60 40 100 - - -

359
9 21CSP- Mobile CR 0 0 2 0 1 2 60 40 100 21CSP- 21CST- 21CST-

356 Application 255 352,21CST- 475
Development 353,21CST-
Lab 354,21CST-
355,21CST-
357,21CST-371
10 21CSP- Internet of CR 0 0 2 0 1 2 60 40 100 21ECP- 21CST- 21CST-
358 Things Lab 114 352,21CST- 464
353,21CST-
354,21CST-
355,21CST-
357,21CST-
371,21CSP-356
11 21CSP- Professional DE 0 0 2 0 1 2 0 0 0 - - -
3** Elective-II
Lab
12 21TDY- Soft Skills : MNG 0 0 2 0 1 2 40 60 100 21TDY- 21CST- 21CST-

351 MNG TPP 301 352,21CST- 431
353,21CST-
354,21CST-
355,21CST-
357,21CST-
371,21CSP-356

13 21TDY- Aptitude : MNG 0 2 0 0 2 2 40 60 100 21TDY- 21CST- -
352 MNG TPP 302 353,21CST-
354,21CST-
355,21CST-
357,21CST-
371,21CSP-356
14 21CSY- Software MNG 3 0 0 0 3 3 21CST- 21CST- 21CST-
360 Project 254 352,21CST- 463
Management : 353,21CST-
MNG NTPP 354,21CST-
355,21CST-
357,21CST-
371,21CSP-356
15 21UCY- Life Skills and MNG 0 1 0 0 1 1 40 60 100 - - -
396 Mentoring :
MNG
TOTAL 16 0 9 13 23 30

Semester-7
Pre- Co- Anti -

N Type
1 21CST- Professional Elective- 40 60 100 - - -
DE 2 0 0 0 2
4** III 2
2 40 60 100 21ECP- 21CST- 21CST-

114 433,21CST- 461
434 ,21CSP-
21CST-
Cloud Computing CR 3 0 0 0 3 436,21CSP-
411 3
437,21CSP-
438,21CST-
412
3 21**- 40 60 100 - - -
Open Elective-I OE 3 0 0 0 3
O4** 3
4 40 60 100 21CST- 21CST- 21CST-

258 433,21CST- 475
434,21CST-
21CST- BLOCKCHAIN
CR 3 0 0 0 3 411,21CSP-
412 Technology 3
436,21CSP-
437,21CSP-
438
5 21CSR- 60 40 100 - - -
Project-IV PR 0 0 1 5 3
414 6
6 21CSP- Professional Elective- 60 40 100 - - -

DE 0 0 2 0 1
4** III 2
7 21CSI- Industrial Summer 60 40 100 - - -

MNG 0 0 0 4
415 Training: (MNG) 2 4
8 60 40 100 - 21CST-433 -
,21CST-
Environmental Waste 411,21CSP-
21UCY-
and Disaster UCR 2 0 0 0 436,21CSP-
401 2 2
Management 437,21CSP-
438,21CST-
412
TOTAL 13 0 3 9 17 16

Semester-8
S Code Course Name Course L T P S C CH Evaluation Pre- Co- Anti -

N Type requisite requisite requisite

4** Elective-IV

4** Elective-V
3 21**O- University Open OE 3 0 0 0 3 3 40 60 100 - - -

4** Elective
4 21CSR- Project-V PR 0 0 1 5 3 6 60 40 100 - - -

451
TOTAL 7 0 5 5 12 12

List of University Core Courses (UC)
S. No. Code Title Semester L T P S C CH
1 21UCT-141 Communication Skills 1 0 2 0 0 2 2
2 21UCP-142 Communication Skills Lab 1 0 0 2 0 1 2
3 21UCT-221 Introduction to Management and 3 2 0 0 0 2 2

Leadership
4 21UCY-295 Ethics and Gender Equality 4 1 0 0 0 1 1
5 21UCY-401 Environmental Waste and Disaster 7 2 0 0 0 2 2

Management
6 21UCH-243 Design Thinking and Creativity for 1 1 0 0 0 1 1

Innovation
7 21UCH-297 Academic Research Paper Writing and 2 1 0 0 0 1 1

IPR
8 21UCH-249 Entrepreneurship 3 1 0 0 0 1 1
List of Program Core Courses (PC)
SN Code Title Semester L T P S C CH
1 21CST-111 Problem Solving with Programming 1 0 2 0 0 2 2
2 21CSP-112 Problem Solving with Programming 0 0 4 0 2 4

1
Lab
3 21CST-151 Introduction to Programming 2 0 2 0 0 2 2
4 21CSP-152 Introduction to Programming Lab 2 0 0 2 0 1 2
5 21CST-211 Data Structures 3 3 0 0 0 3 3
6 21CST-212 Computer Organization & 3 0 0 0 3 3

3
Architecture
7 21CST-214 Database Management System 3 3 0 0 0 3 3
8 21CST-218 Object Oriented Programming using 2 0 0 0 2 2

3
Java
9 21CSP-212 Data Structures Lab 3 0 0 4 0 2 4
10 21CSP-215 Database Management System Lab 3 0 0 2 0 1 2
11 21CSP-219 Object Oriented Programming using 0 0 2 0 1 2

3
Java Lab
12 21CST-252 Microprocessor & Interfacing 4 3 0 0 0 3 3
13 21CST-254 Software Engineering 4 3 0 0 0 3 3
14 21CST-256 Computer Networks 4 3 0 0 0 3 3
15 21CST-258 Principles of Artificial Intelligence 4 3 0 0 0 3 3

16 21CSP-259 Programming in Python Lab 4 0 0 4 2
0 4
17 21CSR-264 Project-I 4 0 0 1 2
3 4
18 21CSP-253 Microprocessor & Interfacing Lab 4 0 0 2 1

0 2
19 21CSP-255 Software Engineering Lab 4 0 0 2 1

0 2
20 21CSP-257 Computer Networks Lab 4 0 0 2 1

0 2
21 21CST-311 Design and Analysis of Algorithms 5 3 0 0 0 3

3
22 21CST-313 Operating Systems 5 3 0 0 0 3

3
23 21CSP-314 Competitive Coding - I 5 0 0 2 0 1

2
24 21CST-315 System Programming 5 3 0 0 0 3

3
25 21CST-316 Machine Learning 5 3 0 0 0 3

3
26 21CSR-318 Project-II 5 0 0 1 5 3
6
27 21CST-319 Project Based Learning in Java 5 2 0 0 0 2

2
28 21CSP-312 Design and Analysis of Algorithms

5 0 0 2 0 1
Lab 2
29 21CSP-317 Machine Learning Lab 5 0 0 2 0 1

2
30 21CSP-321 Project Based Learning in Java Lab 5 0 0 4 0 2

4
31 21CSP-351 Competitive Coding – II 6 0 0 2 0 1

2
32 21CST-352 Network Operating System 6 3 0 0 0 3

3
33 21CST-353 Theory of Computation 6 3 0 0 0 3

3
34 21CST-354 Information Security and

6 3 0 0 0 3
Cryptography 3
35 21CST-355 Mobile Application Development 6 2 0 0 0 2

2
36 21CST-357 Internet of Things 6 3 0 0 0 3

3
37 21CSR-359 Project-III 6 0 0 1 5 3
6
38 21CSP-356 Mobile Application Development Lab 6 0 0 2 0 1

2
39 21CSP-358 Internet of Things Lab 6 0 0 2 0 1

2
40 21CST-411 Cloud Computing 7 3 0 0 0 3

3
41 21CST-412 BLOCKCHAIN Technology 7 3 0 0 0 3

3
42 21CSR-414 Project-IV 7 0 0 1 5 3
6
43 21CSR-451 Project-V 8 0 0 1 5 3
6
TOTAL 57 4 45 23 95 -

List of Program Elective (PE)

STATISTICAL INFERENCE
21CST-331/21CSP-336
USING R
21CST-332/21CSP-337 SOFT COMPUTING
1 5 2 0 2 0 3 4
21CST-333/21CSP-338 WEB AND MOBILE SECURITY
MULTIMEDIA
21CST-334/21CSP-339
TECHNOLOGIES
21CST-371/21CSP-376 DATA MINING
21CST-372/21CSP-377 DEEP LEARNING
2 6 2 0 2 0 3 4
21CST-373/21CSP-378 WEB TECHNOLOGIES
21CST-374/21CSP-379 UI/UX DESIGN
21CST-431/21CSP-436 BUSINESS INTELLIGENCE
21CST-432/21CSP-437 COMPUTER VISION
3 Software Testing and 7 2 0 2 0 3 4
21CST-433/21CSP-438
Quality Assurance
21CST-434/21CSP-439 Digital Image Processing
21CST-461/21CSP-461 DATA VISUALIZATION
NATURAL LANGUAGE
21CST-462/21CSP-462
PROCESSING
4 SEARCH ENGINE 8 2 0 2 0 3 4
21CST-463/21CSP-463
OPTIMIZATION
WIRE FRAMING AND UI
21CST-464/21CSP-464
PROTOTYPING
21CST-471/21CSP-471 BIG DATA ANALYTICS
ROBOTIC PROCESS
21CST-472/21CSP-472
AUTOMATION
5 8 2 0 2 0 3 4
21CST-473/21CSP-473 AR/VR SIMULATION
21CST-474/21CSP-474 COMPUTER GRAPHICS
21CST-475/21CSP-475 DEV-OPS
Total 10 0 10 0 15 20
List of Basic Science (BS)
1 21SMT-125 Computational Mathematics 1 0 4 0 0 4 4
2 21SPT-141 Quantum and Semi Conductor Physics 1 3 0 0 0 3 3
3 21SPP-142 Quantum and Semi Conductor Physics Lab 1 0 0 2 0 1 2
4 21SMT-175 Calculus and Vector Spaces 2 0 4 0 0 4 4
5 21SZT-188 Biology for Engineers 2 3 0 0 0 3 3
6 21SMT-216 Numerical and Optimization Techniques 3 3 1 0 0 4 4
7 21SMT-257 Probability and Statistics 4 3 1 0 0 4 4
Total 12 10 2 0 23 24

List of Engineering Science (ES)
1 21ELT-111 Basic Electrical and Electronics Engineering 1 3 0 0 0 3 3

2 21MEP-114 Computer Graphics using CAD Lab 1 0 1 2 0 2 3
3 21ELP-112 Basic Electrical and Electronics Engineering Lab 1 0 0 2 0 1 2
4. 21ECP-114 Foundations of Internet of Things Lab 1 0 0 2 0 1 2
5 21ECT-155 Digital Electronics 2 3 0 0 0 3 3
6 21ECP-158 Applied Digital Electronics Lab 2 0 1 2 0 2 3
Workshop Practice Trades (CSE, ECE,EE)(Fitting 2
7 21MEP-156 0 0 4 0 2 4
Shop, Electrical Shop, Electronics Shop)
8 21ECP-118 Foundations of AI Applications Lab 2 0 0 2 0 1 2
Total 6 2 14 0 15
List of Humanities and Social Sciences Courses (HSS)
1 21PCT-154 Professional Communication Skills 2 0 2 0 0 2 2

2. 21PCP-158 Professional Communication Skills Lab 2 0 0 2 0 1 2
3 21TDT-202 Aptitude 3 0 2 0 0 2 2
4 21TDP-251 Soft Skills 4 0 0 2 0 1 2
Total 0 4 4 0 6
List of University Open Elective (UOE)
1 21**-O4** Open Elective-1 7 3 0 0 0 3 3
2 21**-O4** University Open Elective 8 3 0 0 0 3 3
Total 6 0 0 0 6
The students of other department will be selecting open electives from the list provided above
List of MOOCs (MC)
NOT APPLICABLE

List of Mandatory Non-Graded (MNG)
1 21UCY-146 Life Skills and Mentoring-1 MNG 1 0 1 0 0 1 1

2 21UCY-196 Life Skills and Mentoring-2 MNG 2 0 0 2 0 1 2
3 21UCY-246 Life Skills and Mentoring 3 0 1 0 0 1 1
4. 21UCY-296 Life Skills and Mentoring 4 0 1 0 0 1 1
7 21CSY-BBB Employability Enhancement Courses 4 1 0 0 0 1 1
8 21TDY-301 Soft Skills: MNG TPP 5 0 0 2 0 1 2
9 21TDY-302 Aptitude: MNG TPP 5 0 2 0 0 2 2
10 21CSY-313 Fundamentals of Image Processing: MNG NTPP 5 3 0 0 0 3 3
11 21TDY-351 Soft Skills: MNG TPP 6 0 0 2 0 1 2
12 21TDY-352 Aptitude: MNG TPP 6 0 2 0 0 2 2
13 21CSY-360 Software Project management : MNG NTTP 6 3 0 0 0 3 3
List of Self-Study MNG (SSMNG)
1 21CSY-225 Institutional/Summer Training MNG 3 0 0 0 4 2 0
2. 21CSX-322 Institute/Industrial Summer Training MNG 5 0 0 0 4 2 4
3 7
21CSI-415 Industrial Summer Training (MNG) 0 0 0 4 2 4
List of courses in the curriculum, catering to the following diversity (As per NAAC criteria one and two)
a. Value-Added courses
b. Employability enhancement courses
c. Skill development and entrepreneurship courses
a. Gender equality / sensitization
b. Human values
c. Environment & sustainability
Department of Computer Science & Engineering
VALUE ADDED COURSES DETAIL
S. No. Department* Name of the Value Added Contact Proposed Organized by

Course* Hours* Semester
Even / Odd Internal/Intra/ External
1 Non CSE Programming in C & Data 45 Even Intra

Structures
2 Non CSE Object Oriented Programming 45 Odd Intra
Using C++
3 Non CSE Programming with Java 45 Odd Intra
4 Non CSE Python Programming 45 Even Intra
5 CSE CCNA 45 Even External
6 CSE SAP/ERP Certification 45 Odd External
7 CSE RHCE 45 Even External
Odd External
45
Microsoft Certified: Azure Fundamentals
8 CSE Microsoft Certification Microsoft Certified: DevOps Engineer Expert
Microsoft 365 Fundamentals
Microsoft Power Platform Fundamentals

Annexure -2
S. Course Name of the

Rationale behind introducing the course Assessment Pattern
No. Code New Course
21CST- Enhancing Employability Amongst

1 DEV-OPS
475 Students

INDEX
Sr. No. Description Page No.
1 Syllabus Semester-1 25

UNIVERSITY INSTITUTE OF ENGINEERING
CHANDIGARH UNIVERSITY
SYLLABUS
Bachelor of Engineering
(Computer Science & Engineering)
(BATCH: 2021)

SECTION 3
Semester wise Syllabi
SEMESTER-I
Evaluation
Course
SN Code Course Name L T P S C CH
Type
Internal External Total
1 21SMT- Computational Mathematics CR 0 4 0 0 4 4 40 60 100

125
2 21SPT- Quantum and Semi Conductor DE 3 0 0 0 3 3 40 60 100

141 Physics
3 21ELT- Basic Electrical and Electronics DE 3 0 0 0 3 3 40 60 100

111 Engineering
4 21CST- Problem Solving with CR 0 2 0 0 2 2 40 60 100

111 Programming
5 21UCT- Communication Skills UCR 0 2 0 0 2 2 40 60 100

141
6 21MEP- Computer Graphics using CAD CR 0 1 2 0 2 3 60 40 100

114 Lab
7 21SPP- Quantum and Semi Conductor DE 0 0 2 0 1 2 60 40 100

142 Physics Lab
8 21ELP- Basic Electrical and Electronics DE 0 0 2 0 1 2 60 40 100

112 Engineering Lab
9 21CSP- Problem Solving with CR 0 0 4 0 2 4 60 40 100

112 Programming Lab
10 21UCP- Communication Skills Lab UCR 0 0 2 0 1 2 60 40 100

142
11 21ECP- Foundations of Internet of CR 0 0 2 0 1 2 60 40 100

114 Things Lab
12 21UCY- Life Skills and Mentoring-1 MNG 0 1 0 0 1 1 0 0 0

146 MNG
13 21UCH- Design Thinking and Creativity UC 1 0 0 0 1 1 40 60 100

243 for Innovation
14 21CSV- Coding Boot Camp 2

113
7 9 14 0
TOTAL 25 31

SN CODES TITLE L T P S C CH Course Type
1 Computational Mathematics 0 4 0 0 4 4 CR
21SMT-125 21SMT-125
PRE-REQUISITE -
CO-REQUISITE 21SPT-141
ANTI-REQUISITE 21SMT-175
a. Course Description: The course begins with the introduction of set theory which is widely utilized in all engineering applications. The
students are then introduced to Matrix algebra and its appli8cations in real life. The course further emphasizes on the conce pt of basic
counting principle, graph theory and trees. Then the students are introduced optimization technique with the help of game theory.
b. Course Objectives: The Course aims to Impart analytical ability in solving mathematical problems as applied to the respective branch of
Engineering.
c. Course Outcomes
CO1 Apply the fundamental mathematical concepts and terminology related to various types of sets, relations and functions.
CO2 Evaluate the rank of matrix and apply this concept in real life problems. Write original short compositions, in the form of
paragraph writing, business correspondence, blogs etc. through logical support and argument.
CO3 Apply and analyze recursive relations and generating functions.

CO4 Evaluate the problems relating permutation and combination.
CO5 Analyze the different types of graphs as well as the tree & paths and difference between them such as binary/spanning/minimal
spanning/ traversal trees.
CO6 Apply the strategies of optimization in game theory
d. Syllabus
Unit-1 Basic Structure Contact Hours: 20
Introduction to set theory Set operations, Algebra of sets, Combination of sets, Duality, Finite and Infinite sets, Cardinality of sets Classes
of sets ,Power sets ,Min sets &Max sets ,Cartesian product, Principles of inclusion & exclusion.
Relations and functions Binary relations, types of relations, equivalence relations and partitions, partial order relations, functions and
its types, composition of function and relations, inverse of relations and functions.
Matrix Algebra Introduction, Types of Matrices, Rank of matrix, Solution of linear equations-Gauss elimination, Jacobi and
Gauss Seidal, Eigen values and Eigen vectors.
Unit-2 Basics of Computing Contact Hours: 20
The Foundations: Logic Basic operations: AND (˄)OR (˅), NOT(-) Truth value of a compound statements, propositions, tautologies,
and Proofs contradictions, Applications of Propositional, Propositional equivalences, Predicates and quantifiers, Rules
of Inference.
Counting Techniques Recursive definitions, Recurrence relations with constant coefficients, homogeneous and particular
solutions, solutions of recurrence relation using generating functions. Fibonacci Series, Divide-and-
Conquer Algorithms.
Permutations and Linear permutation and circular permutation, Combination.

combinations
Unit-3 Advanced Theories Contact Hours:20
Lattices Introduction, Properties of Lattices, Sub-Lattices, Homomorphism and isomorphism, Hasse diagram.
Graph Theory Introduction to graphs, directed and undirected graphs, homomorphic and isomorphic graphs, sub graphs
multi graphs and weighted graphs, paths and circuits, shortest path in weighted graphs, Eulerian paths
and circuits, Hamiltonian paths and circuits, planer graphs Euler's formula.

Trees Introduction to trees, difference between graphs and a tree rooted trees, path length in trees, spanning
trees & cut-sets, minimum spanning trees, binary trees and its traversal.
Game Theory Pay of Matrix, Mini-Max criteria, Saddle points, Optimal Strategy, Mixed Strategy, Value of game.
TEXT BOOKS:
T1 C.L. Liu “Elements of Discrete Mathematics". McGraw Hill, 3rd Edition.
T2 Santha," Discrete Mathematics with Graph Theory, Cengage Learning, 1st Edition.
T3 G. Ronald, Knuth, Donald and Patashik, Oren, " concrete Mathematics: A Foundation for Computer Science ", Addison-Wesley.
REFERENCE BOOKS:
R1 B. Kolaman, and R.C. Busby,“Discrete Mathematical Structures”, PHI, 1stEdition.
R2 Gersting, L. Judith“ MathematicalStructuresfor computer Science” ,Computer Science Press.
R3 DoerrandLevasseur, “Applied DiscerteStructurefor Computer Science”.
R4 Tembley&Manohar, “Discrete Mathematical Structures with Applications to Computers” ,McGrawHill.
R5 K.H. Rosen, “Discrete Mathematics and its applications”Mc-Grew hill.
R6 NChSNLyengar.V.M.Chandrasekaran, “Discrete Mathematics”.
e. Assessment Pattern - Internal and External
The performance of students is evaluated as follows:

Theory
Components Continuous Internal Semester End
Assessment (CAE) Examination (SEE)
Marks 40 60
Total Marks 100
f. Internal Evaluation Component

S.No. Type of Weightage of actual Frequency of Final Weightage in Internal Remarks
Assessment conduct Task Assessment (Graded/Non-
Graded)
1 Assignment 10 marks of each One Per Unit 10 marks
assignment
2 Exam 12 marks for One per Unit 4 marks
each test
3 Quiz/Test 4 marks of each 2 per Unit 4 marks
As applicable to
quiz
4 Homework NA One per lecture Non-Graded: course types
topic (of 2 Engagement Task depicted above.
questions)
5 Case study NA NA NA
6 Discussion Forum NA One per Non Graded:
Chapter Engagement Task

7 Presentation NA NA Non Graded:
Engagement Task

g. CO-PO Mapping
Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
Outcome
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 2 2 1 2 2
CO4 3 3 3 3 3 3
CO5 2 3 3 3 3 1 3 2
CO6 2 3 3 3 3 1 3 2

SN CODES Quantum & Semiconductor Physics L T P S C CH Course Type*
2 3 0 0 0 3 3 DE
21SPT-141 21SPT-141
PRE-REQUISITE --
CO-REQUISITE 21SMT-125
ANTI-REQUISITE --
a. Course Description
The course begins with the study of basic crystal structure of solids and then extended to semiconductors. The students will learn to apply the principles
in design of various semiconducting components. The students are then introduced to the applications of laser and fiber optics which are the pillars of
communication system. Then the students are introduced to the concepts of quantum mechanics and its application in quantum computing and
nanotechnology.
b. Course Objectives
1. The course is designed to make the students industry ready to contribute in the growing demand of the industry at local, national and international
level.
2. It will make the students competent to understand basic concepts and applications of advanced engineering physics and apply its principles in their
respective fields at global platform.
3. It will enhance the skill level of the students and shall make them preferred choice for getting employment in industry and research labs.
4. It will give thorough knowledge of the discipline to enable students to disseminate knowledge in pursuing excellence in academic areas.
c. Course Outcomes
CO1 The basic concepts of semiconductor physics, illustrate the working of various semiconductor components and use its principles in
design of devices and its applications.
CO2 To identify various components of laser and optical fibers and justify their importance and applications in different fields of computer
science and technology
CO3 To explain the basic concepts of quantum mechanics, use its principles in solving quantum mechanical problems and recommend its
applications in quantum computing and nanotechnology.
d. Syllabus
Unit-1 Basics of Semiconductor Physics Contact Hours: 15
CRYSTALLOGRAPHY Basic terms, types of crystal systems, Bravais lattices, Miller Indices, d-spacing, atomic packing factor for SC, BCC,
FCC and HCP structures.
SEMICONDUCTOR PHYSICS Basics of Semiconductor-Physics, Classical free electron theory and quantum free electron theory, Formation of
& DEVICES energy bands in metals, semiconductors & insulators, Direct & Indirect Band Gap Materials, Fermi-Dirac Function,
Position of Fermi level in intrinsic and extrinsic semiconductors, Conductivity, Mobility, Current density (drift &
diffusion) in semiconductors (n-type and p-type), Generation and recombination of charges, Fermi Level diagram
for p-n junction (unbiased, forward bias, reverse bias), formation of p-n junction diode, Zener-diode, Hall effect
and Hall voltage, LED, Organic LED, Applications of semiconductor devices.
Unit-2 Lasers and Fibre Optics Contact Hours:15
LASERS Introduction, Spontaneous and Stimulated emission of radiation, Relation b/w Einstein’s A and B coefficients,
Population inversion & types of pumping, Main components of a Laser, Construction & working of Ruby Laser and
its applications, Construction & working of Helium-Neon laser and its applications. Holography: Elementary idea of
holography and constructive and reconstructive of holography.
FIBRE OPTICS Fundamental ideas about optical fibre, Types of fibres, Acceptance angle and cone, Numerical aperture,
Propagation mechanism and communication in optical fibres, Attenuation and losses
Unit-3 Quantum Mechanics Contact Hours:15
QUANTUM MECHANICS Introduction of quantum physics- Planck’s radiation theory, Wien displacement law, Rayleigh Jean law, Compton
effect, Heisenberg’s uncertainty principle, Wave particle duality, de Broglie wavelength, properties of matter
waves, wave packet, phase velocity and group velocity, wave function, physical significance of wave function,
Schrödinger’s wave equation (Time Independent And Dependent), Motion of free particle, Particle in a box.
INTRODUCTION TO Introduction to Nanotechnology, applications of nanotechnology, History of Computing, Quantum wire, Quantum
QUANTUM COMPUTING well, Quantum dot,, Sol-Gel technique, Quantum Computers, Nano computing Technologies, Nano Information
Processing, Prospects and Challenges

TEXTBOOKS:
T1. Malik H.K, Singh A.K. (2011) Engineering Physics, TMH, New Delhi. ISBN: 9780070671539
T2. Beiser A. (2002) Concepts of Modern Physics, McGraw Hill Education. ISBN: 9780070495531
T3. Sadiku M.N.O. (2007) Elements of Electromagnetics, Oxford University Press. ISBN: 0195300483
T4. C. T. Bhunia (2010) Introduction to Quantum Computing, New Age International Publishers ISBN 978-8122430752
T5. Sze S.M., K. Ng Kwok., Physics of Semiconductor Devices, Edition 3rd , (2011), Wiley India. Kasap S.O., Principles of Electronic and materials
and devices, Edition 1st, (2007), Tata McGraw-Hill, Noida.
REFERENCE BOOKS:
R1. Griffith D.J. (2012) Introduction to Electromagnetics, PHI Learning, 4th edition, ISBN: 9780138053260.
R2. Ghatak A. (2012) Optics, McGraw Hill Education. ISBN: 978-1259004346.
R3. Sahni V., Goswami D. (2008) Nano Computing, McGraw Hill Education Asia Ltd., ISBN: 978007024892Beiser A., Ghatak A, Garg S.C., Applied
Physics, Edition 1st, (2013), Tata McGraw-Hill, Noida.

Theory

Marks 60 40
Total Marks 100

S. No. Type of Weightage of actual Frequency of Final Weightage in Internal Remarks
Assessment conduct Task Assessment
(Graded/Non-
Graded)
assignment

As applicable to
each test
Quiz course types
4 Homework NA One per lecture Non-Graded:
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 3 3 2
CO2 3 3 1 2 3
CO3 3 2 3 3 2 3 2

SN 21ELT-111 Basic Electrical and Electronics Engineering (BEEE) L T P S C CH Course Type
3 3 0 0 0 3 3 DE
21ELT-111
PRE-REQUISITE --
CO-REQUISITE 21SPT-141, 21SMT-125, 21ELP-112
ANTI-REQUISITE 21ECT-155, 21ECP-158-
The course starts with an insight to DC & AC circuits, from understanding basic laws to design and analysis of electrical circuits (including magnetic
circuits like transformers). Students are then introduced to transducers & DC motors from the perspective of use in real world. The course further
emphasizes upon the design and analysis of digital electronic circuits.
1. Understand Electrical & Electronics Engineering Fundamentals.
2. Acquire specific knowledge and skills so as to comprehend how electric, magnetic and electronic circuits are applied in practice.
c. Course Outcomes
CO1 Describe the performance of an electric circuit as well as solving both single phase and three-phase AC circuits in sinusoidal steady
state.
CO2 Predict about electrical safety and implementation of electric wiring.
CO3 Illustrate various rotating electric machines, with application of motors in particular, transducers and electric batteries
CO4 Identify and explain various components of electronics and digital systems.
CO5 Justify operation of logic gates.
CO6 Construct interfacing of A/D and D/A converter.
d. Syllabus
Unit-1 Electrical Circuits and Safety Contact Hours:15
DC & AC Circuits Introduction to DC and AC circuits, Active and passive two terminal elements, Ohms law, Voltage-Current
relations for resistor, inductor, capacitor, Kirchhoff’s laws, Ideal sources –equivalent resistor, current division,
voltage division, Sinusoids, Generation of AC, Average and RMS values, Form and peak factors, Analysis of R-L,
R-C circuits.
Magnetic Circuits and Magnetic effects of electric current, Law of Electromagnetic Induction, Self-Inductance, Mutual Inductance,
Transformers Single Phase Transformer: Construction, Working principle, Efficiency.
Electrical safety and Safety measures in electrical system, types of wiring, Difference between grounding and earthing, Basic
wiring principles of earthing, components of earthing system.
Unit-2 Motors, transducers & batteries Contact Hours:15
Rotating Electrical Operating characteristics of DC motor, working principle, construction and applications of Induction motor,
Machines Brushed DC motor, Geared DC motor, Brushless DC motors, Servo Motors, Stepper motors, Linear DC motor.
Transducers Principle of sensing, Basic requirements of transducers, classification of transducers, passive transducers:
capacitive, inductive, LVDT, potentiometric, strain gauge, thermistor, Hall-Effect, Active transducers:
piezoelectric, photoelectric and thermocouple, Tri-axial Sensors: Gyroscopes, Accelerometers, Magnetometers.
Batteries Selecting Battery: Basic Battery Specifications, common parameters of battery/applications, Different types of
Batteries used in different applications, Power Supplies: Linear and SMPS.
Unit-3 Electronic Devices & Circuits Contact Hours:15
Semiconductor Devices Review of Electronic Devices and applications: PN Junction Diode, Rectifiers, Zener Diode, Bipolar Junction
Transistor, MOSFET. Analog and Digital signals, Sampling and Quantization, Amplifier characteristics, Feedback
concept, positive and negative feedback, Oscillators, D/A and A/D converters.
Digital Electronics Number systems –Binary, decimal, binary arithmetic, logic gates, implementation of Boolean expressions using
logic gates, Digitization and its advantages, basic introduction of flip-flops, counters , multiplexers,
demultiplexers, encoders, decoders and their applications, Data Acquisition System.
TEXT BOOKS:
1. Basic Electrical Engineering, Nagrath, 2001, McGraw-Hill Education (India) Pvt Limited
2. Basic Electrical and Electronics Engineering, Bhattacharya, S.K., 2011, Pearson
3. Electronic Devices and Circuit Theory, Boylestad, 2009, Pearson
4. Op-Amps and Linear Integrated Circuits, Ramakant A. Gayakwad ,2000, PHI
5. A course in Electrical & Electronics Measurement and Instrumentation, A K Sawhney, 2014, Dhanpat Rai.
6. Battery Reference book, Thomas Crompton, Newnes, 3rdedition,2000.
REFERENCE BOOKS:
1. Electric Circuits, Charles K. Alexander & Matthew N. O. Sadiku, 4th edition, McGraw-Hill Publication
2. Electrical Engineering Fundamentals, Vincent Del Toro, 2nd edition, Prentice Hall of India
3. Electronic Principles, Albert Paul Malvino , (6th edition),T.M.H., 1993

4. Digital Design, M. M. Mano, Pearson Publications, 2007
5. Electric Machines, Ashfaq Hussain, 3rdEdition, DhanpatRai

Theory
Marks 40 60
Total Marks 100

S. No. Type of Weightage of Frequency of Task Final Weightage in Internal Remarks
Assessment actual conduct Assessment (Graded/Non-
Graded)
assignment
each test
3 Quiz/Test 4 marks of each 2 per Unit 4 marks As applicable to
quiz
topic (of 2 Engagement Task
questions) depicted above.
Engagement Task
Chapter
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2
CO2 3 2 3 2
CO3 2 3 3 2
CO4 3 3 2 2
Co5 3 3 3 1 2
Co6 2 3 3 1 3 2

SN 21CST-111 Problem Solving with Programming L T P S C CH Course Type*
4 0 2 0 0 2 2 CR
21CST-111
PRE-REQUISITE --
ANTI-REQUISITE 21CST-151, 21CSP-152
The course begins with the introduction to Basic concepts of programming and its applications in numerous fields. After covering
fundamentals, students will learn how to apply the more complex concepts including loops and arrays in order to solve the com plex real
world problems.
1. The course aims to provide exposure to problem-solving through programming.
2. The course aims to raise the programming skills of students via logic building capability.
3. With knowledge of C programming language, students would be able to model real world problems.
c. Course Outcomes
CO1 Identify situations where computational methods would be useful.
CO2 Approach the programming tasks using techniques learnt and write pseudo-code
CO3 Choose the right data representation formats based on the requirements of the problem.
CO4 Use the comparisons and limitations of the various programming constructs and choose the right
one for the task.
d. Syllabus
Unit-1 Introduction to basic building blocks to programming Contact Hours:10
Introduction Flow charts and Algorithms, Memory layout of a C program.
Fundamentals of C Features & Applications of C language, structure of writing a C Program, I/O functions in C, Indentation,
Comments, Header Files, Data Types, Constants and Variables, Operators, Expressions, Evaluation of
expressions, Type Conversion, Precedence and Associatively.
Decision Control Decision making statements (if, if-else, if-else-if, switch), nesting of decision control structures.
structure in C
Unit-2 Dealing with real-world problems Contact Hours:10
Loop Control structure in C Looping statements (for, while, do-while), nested loop, use of jumping statements (go to, break, continue).
Array & String Concepts of array, one and two dimensional arrays, declaration and initialization of arrays, searching and sorting,
string handling, string storage.
Functions Concepts of library functions, Built-in-string functions, user defined functions, prototypes, definition of function,
parameters types, parameter passing, calling a function, recursive function, Macros.
Unit-3 Handling heterogeneous data and memory management Contact Hours:10
Pointers Basics of pointers, double pointer, smart pointers, pointer and array, pointer to array, array of pointers,
functions returning a pointer, storage classes.
Structure Basics of structure, structure members, structure vs. union, accessing structure members, nested structures,
array of structures, structure and functions, structures and pointers
Dynamic memory Introduction to Dynamic memory allocation, malloc, calloc, realloc.

allocation
TEXT BOOKS:

T1 Programming in ANSI C by E. Balaguruswamy, Tata McGraw Hill.
T2 Programming in C Ansi standard, by YashwantKanetkar, BPB Publications.
REFERENCE BOOKS:
R1 Programming with C (Schaum's Outline Series) by Byron Gottfried JitenderChhabra, Tata McGraw Hill.
R2 C Programming Language by Brian W. Kernighan, Dennis Ritchie, Pearson education.
R3 C How to program by Harvey Deital, 8th edition

Theory

Marks 40 60
Total Marks 100
S. No. Type of Weightage of Frequency of Task Final Weightage in Internal Remarks

Assessment actual conduct Assessment (Graded/Non-
Graded)
assignment
each test
quiz
questions) depicted above.
Engagement Task
Chapter
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3 3 2 2 2 3
CO2 3 3 3 3 1 3 3 2 3 3 3 3 2 3
CO3 3 3 3 3 3 3 3 3 3 3 3 2 3
CO4 3 3 2 3 3 1 3 3 2 3 3 2 3

SN 21UCT-141 Communication Skills L T P S C CH Course Type
5 0 2 0 0 2 2 UCR
21UCT-141
PRE-REQUISITE --
ANTI-REQUISITE 21PCT-154, 21PCP-158
The course provides a strong foundation in English grammar and equips the students with the fundamentals of the language in
LSRW skills. English proficiency is achieved by focusing on socio-linguistic usage. The course introduces basic business
communication with special emphasis on effective business correspondence and digital content writing.
The Course aims to:

1. Augment students overall communication and interpersonal skills by making them realize the importance of good oral and written
English Language in professional life.
2. Enrich their reading capability with special emphasis on expanding vocabulary and grammatical formations.
3. Build exceptional reading and writing skills by correcting grammatical errors and pronunciation through practice.
c. Course Outcomes
CO1 Produce correct contextual written text and speech in a wide range of communication situations.
CO2 Write original short compositions, in the form of paragraph writing, business correspondence, blogs etc. through logical
support and argument.
CO3 Demonstrate linguistic competence through accuracy in grammar, pronunciation and vocabulary.
d. Syllabus
Unit-1 Business Communication Contact Hours: 10
Business Communication Meaning, importance, process, models and types, barriers to effective communication, verbal and non-
verbal communication, Techniques for building LSRW Skills and Case Study
Reading Skills Reading Comprehension
Writing Paragraph writing, note making and note taking
Vocabulary Word formation - Prefixes, suffixes and compounds, homonyms, homophones, homographs
Grammar Parts of Speech, articles, modal verbs
Unit-2 Business Correspondence Contact Hours:10
Ethics in Communication Significance, Factors, Dilemmas in Ethical Communication, Case Study
Writing Précis writing, leave application, permission letter, business letters - sales, request, order, inquiry,
acknowledgement, complaint and collection letters, memorandum writing, office order, circular, various
types of notice writing.
Grammar Tenses, concord (subject-verb agreement), punctuation
Vocabulary One-word substitutes, synonyms, antonyms – contextual usage.
Unit-3 Digital Content Writing Contact Hours:10

Cross-Cultural Significance, elements, cultural context and barriers to Cross Cultural Communication, Case Study
Communication
Writing Summarizing, creative writing, email writing, digital content writing (blogs and websites), proofreading
Grammar Narration, voice, transformation and correction of sentences
Vocabulary Collocations, idioms
TEXT BOOKS:
T1 Raman, M. and Sharma, S; Technical Communication - Principles and Practice, Oxford University Press (2018), New Delhi.
REFERENCE BOOKS

R1 Lesikar R.V., Petit J.D., Business Communication, Tata McGraw (2016), New Delhi.
R2 Chaturvedi, P.D. and Chaturvedi, Business Communication, Pearson Education (2017), New Delhi
R3 Murphy, R., Elementary Grammar, Cambridge University Press (2017), UK
R4 Murphy, R., Essential Grammar in Use, 5th Edition Cambridge University Press (2018), UK
R5 Hewing, Martin, English Grammar (Intermediate Level), Cambridge University Press (2017), UK

Theory
Marks 40 60
Total Marks 100

Sr. Type of Weightage of actual conduct Frequency of Final Weightage in Internal Remarks
No. Assessment Task Assessment
1 Conduct 10 Marks per Practical 1 per practical 60 Marks per course
2 Report 10 Marks per Practical 1 per practical
3 Viva- Voce 20 Marks per Course 1 per Course
g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3

SN 21MEP-114 COMPUTER GRAPHICS USING CAD LAB L T P S C CH Course Type
6 0 1 2 0 2 3 CR
21MEP-114
PRE-REQUISITE --
ANTI-REQUISITE 21MEP-156
This course is based on the subject Engineering Drawing employed for 1st year students. In this subject, the students will learn the basics of
technical drawing. All the figures are to drawn on AutoCAD software. In this figure, the students will draw the orthographic projections of
basic computer components on the software.
To introduce the students to engineering drawing, the universal language and tools of
communication of engineers.
c. Course Outcomes
CO1 Sketch the different conventions and representations of engineering graphics on AutoCAD software. Explain the use of engineering
drawing, compare and predict the geometrical details of common engineering objects.
CO2 Classify, examine and draw the dimensioned figures expressing information about the shape and size of physical objects.
CO3 Identify and express the geometrical features of a product on AutoCAD software. Draw orthographic views of computer
components.
d. Syllabus
Unit-1 Fundamentals of Engineering Drawing Contact Hours:18
Fundamentals of Scope and Importance of Engineering Drawing, Conventions for lines, Introduction to general principles of
Engineering Drawing dimensioning, Scales, R.F, full size, reduced and enlarged scales, Introduction to basics of CAD software’s like
AutoCAD and various draw, modify, dimensioning and layer commands; model and layout view; plotting of
sheet.
Projection of points Introduction to projection, their principals & various types of projection systems; Orthographic Projection;
Introduction to planes of projection (reference planes) and auxiliary planes, Orthographic Projection of point
in all the four quadrants 2-D drawing of points in AutoCAD software.
Unit-2 Projection of lines Contact Hours:15
Projection of lines Projection of lines in different quadrants according to its orientation/position with horizontal, vertical plane;
true and apparent lengths, Projection of lines parallel to both HP and VP, inclined to one plane and parallel to
the other. 2-D drawing of lines in AutoCAD software
Projection of Planes Projections of plane surfaces-triangle, square, rectangle, pentagon, hexagon and circular planes in different
positions when plane is parallel to one of the reference planes, inclined to one of the reference planes and
perpendicular to other only. 2-D drawing of planes in AutoCAD software
Unit-3 Isometric Projection Contact Hours:15
Isometric Projection Introduction, isometric scale, isometric projection of simple plane figures, isometric projection of cube, square
block, pyramid, cylinder & cones
Orthographic Projection of Orthographic projections of simple solids from the given 3D/isometric view, orthographic projections of
Computer Components computer components such as USB storage device, 4 port switch hdmi 2.0 splitter, wireless router, single
cellular mobile router, etc.
TEXT BOOKS:
T1 Rhodes R.S, Cook L.B; Basic Engineering Drawing, 1st Edition, Pitman Publishers.
T2 Rana and Shah; Engineering Drawing, 2nd Edition, Pearson Education India Publishers,(2009).
T3 Jolhe D.A; Engineering Drawing: With an Introduction to AutoCAD, 2nd Edition, Tata McGraw Hill (2007)

REFERENCE BOOKS:
R1 Ostrowsky.O; Engineering Drawing with CAD application 2nd Edition, Routledge Publishers 2007.
R2 Aggarwal B; Engineering Drawing, 1st Edition, Tata McGraw Hill Publications,2008.
R3 Gill P.S; Engineering Drawing ,5th Edition, S.K. Kataria and Sons Publications, 2011.
R4 Dhawan R. K; Engineering Drawing, 7thEdition ,S. Chand and Sons Publishers.
R5 Bhatt N.D; Engineering Drawing,50th Edition, Charotar Publication,2011.

Theory
Marks 40 60
Total Marks 100

Assessment
No. Task Assessment

g. CO-PO Mapping
Course
Outcome
CO1 3 2 2
CO2 3 2 2
CO3 3 2 2

SN Code Quantum & Semiconductor Physics Lab L T P S C CH Course Type*
7 0 0 2 0 1 2 DE
21SPP-142 21SPP-142
PRE-REQUISITE --
ANTI-REQUISITE 21SZT-188
The course deals with the practical training of physics experiments related to optics, electrical and electronics.
b. Course Objectives :
1 To train engineering students in basis of measurements and the instruments.
2. To give practical training on basic of Physics experiments which are useful to engineers.
3. To equip the students with practical knowledge in electronics and optics.
c. Course Outcomes
CO1 It will provide the modest experience that allows students to develop and improve their experimental skills and develop ability to
analyze data.
CO2 Ability to demonstrate the practical skill on measurements and instrumentation techniques of some Physics experiments. Students will
develop the ability to use appropriate physical concepts to obtain quantitative solutions to problems in physics.
CO3 Students will demonstrate basic experimental skills by setting up laboratory equipment safely and
efficiently, plan and carry out experimental procedures, and report verbally and in written language the results of the experiment.
d. Syllabus
Unit-1 (Name of the Unit) Contact Hours:8
<Experiment No 1> To find the divergence of LASER beam.
< Experiment No 2> To determine the diffraction using LASER beam and find the grating element of diffraction grating.
< Experiment No 3> To determine the numerical aperture of optical Fibre.
< Experiment No 4> Determine the attenuation and propagation losses in optical Fibre.
< Experiment No 1> To find the resistivity and energy band gap of the semiconductor material using four probe method.
< Experiment No 2> To draw the reverse characteristics of Zener diode.
< Experiment No 3> To Determine Hall Voltage And Hall Coefficient Using Hall Effect.
< Experiment No 1> To study ferroelectric behavior of any material.
< Experiment No 2> To find the thermal conductivity of nanofluids.
< Experiment No 3> To study magneto resistance of a material.
< Experiment No 4> To determine the impedance of AC Circuit.
< Experiment No 5> Mini Project – Concept based Demonstration.
TEXT BOOKS:
T1. Sharma Saroj,“Physics Experiments for engineers”, EditionIst, (2009), Oscar publications, New Delhi.
T2. Shukla R. K., and SrivastavaAnchal, “Practical Physics”, Edition1st,(2006), New Age International (P) Ltd, New Delhi.

T3. Arora C.L.,” B.Sc. Practical Physics”, Revise Edition, (2007), S. Chand & Company Limited.
REFERENCE BOOKS:
R1. Souires G. L., “Practical Physics”, Edition 4th,(2001), Cambridge University, UK.
R2. Chattopadhyay D., Rakshit P. C., and Saha B., “An Advanced Course in Practical Physics”, Edition 2nd, 1990), Books & Allied Ltd., Calcutta.

Theory

Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3 3 3 3
CO2 3 3 3 3 3 3 3
CO3 3 3 3 3 3 3 3

SN CODE BASIC ELECTRICAL AND ELECTRONICS ENGINEERING LAB L T P S C CH Course Type*
8 0 0 2 0 1 2 DE
21ELP-112 21ELP-112
PRE-REQUISITE --
ANTI-REQUISITE 21ECT-155, 21ECP-158
The course starts with an insight to DC & AC circuits. Students are then introduced to transducers & DC motors from the perspective of use in real world
with Open source embedded platforms. The course further emphasizes upon the design and analysis of op-amp based circuits.
The purpose of this course is to :
1. Make students understand Electrical & Electronics Engineering Fundamentals.

2. Impart specific knowledge and skills so as to enable students to comprehend how electric,
magnetic and electronic circuits are applied in practice.
c. Course Outcomes
CO1 Construct and predict the characteristics of PN junction diode.
CO2 Implement and use logic operation of gates
CO3 Establish relationship between voltage and current in series R-L circuit.
CO4 Implement staircase and corridor wiring.
CO5 Assess power of three phase ac circuit.
CO6 construct interfacing of A/D and D/A converter
d. Syllabus
<Experiment No 1> To study the characteristics of a P-N junction diode and design rectifier.
< Experiment No 2> To verify logical expressions using logic gates.
< Experiment No 3> To study voltage-current relationship in an R-L series circuit and to determine the power factor of the circuit.
< Experiment No 1> To measure the power of 3 phase AC Circuits using wattmeter method.
< Experiment No 2> To verify and demonstrate the working of LVDT.
< Experiment No 3> To implement stair case and corridor wiring.

< Experiment No 1> To interface Analog-to-Digital (ADC) converter with Op-Amp.
< Experiment No 2> To interface Analog-to-Digital (ADC) converter with Op-Amp.
< Experiment No 3> Study frequency response of an RC coupled amplifier.
< Experiment No4> To control speed of DC motor with analog input and a transistor.
Textbooks:
• Basic Electrical Engineering, Nagrath, 2001, McGraw-Hill Education (India) Pvt Limited
• Basic Electrical and Electronics Engineering, Bhattacharya, S.K., 2011, Pearson
• Electronic Devices and Circuit Theory, Boylestad, 2009, Pearson
• Op-Amps and Linear Integrated Circuits, Ramakant A. Gayakwad ,2000, PHI
• A course in Electrical & Electronics Measurement and Instrumentation, A K Sawhney, 2014, Dhanpat Rai.
• Battery Reference book, Thomas Crompton, Newnes, 3rdedition,2000.
REFERENCE BOOKS:
• Electric Circuits, Charles K. Alexander & Matthew N. O. Sadiku, 4th edition, McGraw-Hill.
• Electrical Engineering Fundamentals, Vincent Del Toro, 2nd edition, Prentice Hall of India
• Electronic Principles, Albert Paul Malvino , (6th edition),T.M.H., 1993
• Digital Design, M. M. Mano, Pearson Publications, 2007
• Electric Machines, AshfaqHussain, 3rdEdition, DhanpatRai

Theory

Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2
CO2 3 3 2
CO3 3 3 3 2

CO4 3 3 3 2
CO5 3 3 3 3 2
CO6 3 3 3 3 2

SN 21CSP-112 Problem Solving with Programming Lab L T P S C CH Course Type*
9 0 0 4 0 2 4 CR
21CSP-112
PRE-REQUISITE --
CO-REQUISITE 21SPT-141, 21SMT-125, 21ELP-112, 21CST-111
a. Course Description: The course begins with the introduction to Basic concepts of programming and its applications in numerous fields.
After covering fundamentals, students will learn how to apply the more complex concepts including loops and arrays in order to solve
the complex real world problems.
b. Course Objectives:
1. The course aims to provide exposure to problem-solving through programming.
2. The course aims to raise the programming skills of students via logic building capability.
3. With knowledge of C programming language, students would be able to model real world problems.
c .Course Outcomes
CO1 Identify situations where computational methods would be useful.
CO2 Approach the programming tasks using techniques learnt and write pseudo-code
CO3 Choose the right data representation formats based on the requirements of the problem.
CO4 Use the comparisons and limitations of the various programming constructs and choose the right one for the task.
d. Syllabus
<Experiment No 1> Practical 1.1Write a program to input following details of a under-graduate student
i Name (string)
ii Age (integer)
iii Contact number (long long integer)
iv Percentage in metric class (float / double)
Your program should generate output as follows:
**************STUDENT DATABASE*******************
Enter name in capital letters: xyzpqr
Enter age : 18
Enter contact number : 9876543210
Enter percentage in metric : 86.84
Thank you. Your data has been saved in our system
************************************************************
Practical 1.2: A cube having a side of 6 cm is painted red on all the faces and then cut into smaller cubes of 1
cm each. Write a program to find the total number of smaller cubes so obtained.
Practical 1.3: A train can travel 50% faster than a car. Both start from point A at the same time and reach
point B 75 kms away from A at the same time. On the way, however, the train lost about 12.5 minutes while
stopping at the stations. Write a C program to compute the speed of car.
Practical 1.4: Sonu ranked mth from the top and nth from the bottom in a class. How many students are there
in the class?
Practical 1.5: A can do a piece of work in 8 days. B can do the same work in 14 days. Write a program to

calculate and print the number of days to be taken to complete the work if A and B work together.
< Experiment No 2> Practical 2.1: Ram , Mohan and Sohan took loan of Rs. x, y and z on rate of interest r %,p %,q % for time t1,t2
and t3 years respectively . Calculate simple interest they will pay and findwho will pay the most using ternary
operator ?
Practical 2.2: Inside the CPU, mathematical operations like addition, subtraction, multiplication and division
are done in bit-level. To perform bit-level operations in C programming, bitwise operators are used. Apply
the knowledge you gained while learning bitwise operators.
Write a program to input two integers from user by using single scanf. Compute and display the value for
a& b, a| b, a b.
Practical 2.3: Write a C program to find out year in which Mr. kavi was born from the following
information :
a) Kavi is m years younger than his mother.

b) Kavi’s brother who born in year y(1900<=y<=2019) is n years younger to his mother
c) If kavi’s brother is reading in class r then On the basis of your common sense also predict
In which class Kavi is reading?
Practical 2.4:If last day of mth month of the year is Friday then find out nth day(1<=n<=31) of the same
month .
Practical 2.5: In a class of N students where girls and boys ratio is p:q Savita ranked rth from the top. If
there are m (m<r) boys ahead of Savita, how many girls are after her rank ?Also find whether she is among
top 10 students of the class or not ?
< Experiment No 3> Practical 3.1: In a class of n students the boys to girls ratio is p:q. Find no. boys and girls in the class and
print :
1) If boys are more than or equal to 70% in the class then print gender partiality in education
2) If difference of boys are girls is diff and in range -5<=diff<=5 then print equal opportunities of
education for both
3) If girls are more than equal to 70% then print girls dominating in education.
4) For all others cases print no conclusion drawn
Practical 3.2: Write a menu driven program that allow the user to perform any one of the following
operations based on the input given by user
i Check number is even or odd

ii Check number is positive or negative
iii Printing square of the number
iv Printing square root of the number (use math.h)
Use switch statement for a menu driven program. Also, use validation checks wherever necessary.
Practical 3.3: AmbaAambika and Ambalikahave money in the ratio x:y:z. All go to market and spend money in
ratio p:q:r .total money they have initially is Rs. N .After spending money in the market who has maximum
amount left with ?
Practical 3.4:While travelling in a train, you observe some college students pulling the alarm chain simply to
get down at their desired point.Out of n students m<=n times students pull the chain .You have to print
according to the following:
1) If m is >=80 % of n then print strict action is required to restrict this event

2) If m is between 50 to 80 % then print guidelines should be issued
3) If between 10 to 50% then print request to restrict the event
4) If less than 10% then print No action required

< Experiment No 1> Practical 4.1: A salesman has n things to sale .The cost price of all n things is different out of which p things he is
selling on m% profit and n-p things he is going to sell on x% loss . Find his net profit or loss
Practical 4.2: Find m greatest 6-digit and n smallest 7-digit numbers which are divisible by number p. Print these
numbers on the screen.
Practical 4.3: There are n customer of bank who took loan of different amounts(Entered by User) and for different
time periods but same rate of interest. The interest is compounded annually find the total interest earned by bank
from all n customers.
Practical 4.4:On reaching the railway station, you find that the train you wanted to catch is just to start and there
is hardly any time for purchasing the ticket. The same situation faced by many people in our country. You have to
do data analysis task for which you will record responses from N people and then print your report
accordingly.User enter option a for “Rush to train to catch it and inform T.T at next stop, b for” Catch the train
and perform journey without ticket”, c for “purchase the ticket first otherwise wait for next train”, and d for
“Miss the train and take ticket for next train “.On the basis of responses print in your report about the habit of
our countrymen. If responses of any two options are equal then print it in either or form. If more than two
responses are equal or having difference <=1 then print no conclusion drawn.
Practical 4.5:You are given task to write numbers from m to n, during this task how many times do you write digit
d. e.g. if m=10 and n=25 and d=1you write from 10 to 20 on screenand count how many times you write 1. In this
case count for d=1 is 11 as from 10 to 19 you write 1,10 times and once in 21 so total count is 11?
< Experiment No 2> Practical 5.1: There are n persons each have 25 paise coins , 50 paise coins and Rs1 coins in the ratio p:q:r but have
different amounts stored in a single list . Find and print no. of 25 paise coins, 50 paise coins and 1 Rs coins each
person have.
Practical 5.2: Write a program to perform various matrix operations Addition, Subtraction, Multiplication,
Transpose using switch-case statement
Practical 5.3: In a list there is cost price of n goods. On the most expensive thing there is a loss of x% and on the
cheapest thing there is a gain of y% and on rest of things there is a gain of p%. Find loss or gain on whole
transaction in Rupees.
Practical 5.4: Suppose you have a device which when fed with the input numbers, rearranges them in a particular
order using some rules. The following is a step-by-step process of rearrangement for the given input of numbers.
Input :- 1 2 3 4 9 10 8 6
Step I :- 4 1 2 3 9 10 8 6
Step II :- 9 4 1 2 3 10 8 6
Step III :- 10 9 4 1 2 3 8 6
Step IV :- 8 10 9 4 1 2 3 6
Step V:- 6 8 10 9 4 1 2 3
In first step you select 5th last element and places it as first and append rest of the list,in second step you select 4th
last element and place it as first element and append the remaining list and so on. Take the input and print output
as specified by 5thstep
Practical 5.5: N students of your class ride their vehicles to reach University,the distances from their homes and
time taken to reach are recorded .University issued the guidelines mentioned speed limit of m Kmph for safe
driving. On the basis of your class data you have to print whether your class is following university guidelines or
not.
< Experiment No 3> Practical 6.1: Sonali joined a social networking site to stay in touch with her friends. The signup page required her
to input a name and a password. However, the password must be strong. The website considers a password to be
strong if it satisfies the following criteria:

Its length is at least 6.
It contains at least one digit.
It contains at least one lowercase English character.
It contains at least one uppercase English character.
It contains at least one special character. The special characters are: !@#$%^&*()-+
She typed a random string of length n in the password field but wasn't sure if it was strong. Given the string she
typed, can you find the minimum number of characters she must add to make her password strong?
Practical 6.2: A string of length N contains (N*(N+1))/ 2 substrings. Write a program to input string and print its
multiple substrings.
Example: String “abc” will have {a, b, c, ab, bc, abc} set of substrings.
Practical 6.3: You store name of your friends in string array. You are given task to print name of your friend whose
name start with particular character and after you find first name in the list you have stop searching and print name
you search the list .
<\Experiment 4> Practical 7.1: A function is provided with zero or more arguments, and it executes the statements on it. Based on
the return type, it either returns nothing (void) or something. Develop a program to find greatest of four numbers
using function intmax_of_four(int a, int b, int c, int d) which reads four arguments and returns the greatest of
them.
Practical 7.2: Write a recursive function for computing factorial of a number. Write main to test its functioning.
Practical 7.3: Write a program to create functions for following
i Input details of employee using input_data() (name, employee id, number of working days, date of
joining, initial salary, contact number, designation, department)
ii Calculate monthly salary using calc_salary()
iii Display the monthly salary with deductions if any using display()
Practical 7.4: Store age of all students of your class in an array. Pass this array as an argument and find average
height of the class and return it to calling function.
< Experiment No 1> Practical 8.1: WAP to read an array of elements and print the same in the reverse order along with their
addresses using pointer.
Practical 8.2: Write a function code that is returning pointer to the larger value out of two passed values.
Practical 8.3:The bank balance of N persons of a city are recorded. Due to COVID-19 government has decided
to credit accounts with Rs. 1000 of all those persons whose balance is nill , Write a function Update_balace()
by passing pointer to an array as argument and print the updated bank balance list in calling function.
Practical 8.4:The CGPA of 5 semesters of N students has stored in NX5 array and names of corresponding
students are stored in separate string array The student who got average CGPA >=8 is eligible for placements
.Pass pointers to both array to function not_eligible() and print list of non eligible students
< Experiment No 2> Practical 9.1: Create a structure hospital and include the following data members:
i Name of patient
ii Patient id (as static)
iii Blood group
iv Contact number (long long)
v Name of disease

vi Date of admission
Including the functions to input and print the data for N number of patients.
Practical 9.2: What will the difference if above program is going to be implemented through union.
Implement the same program through union and differentiate the output as well as memory allocation.
Practical 9.3:You are given task to store records of mothers and fathers of all students of your class in two
separate structures mother and father. Each record will contain name, age, work_status, and height.On the
basis of these records you have to print the following.
1) How many mothers are working? If more than 70 % of women are working then print women are
job oriented.
2) If difference in heights of mother and father is >=10 inches you have to print like Rama Mismatches
Sham where Rama and Sham are names of mother and father
3) You also have to find average difference in the ages of mother and father.
Practical 9.4: Store N student records including fields name, First MST marks .Second MST marks ,lecture
attended ,Lecture delivered , If student got average marks of two MST >=80 ,He/She will be eligible for taking
exams without taking care of attendance otherwise attendance should be >=75%.Print name of all those
students who are detained from final exams .
< Experiment No3> Practical 10.2: At the start of your class lecture , n students were present .You declare array dynamically to
store roll numbers of these students after 5 Mins m more students join the class now you will reallocate
memory space to store n+m roll numbers .Write a program by using functions malloc(), realloc()and free() .
Practical 10.3:Sort the list of N elements where memory is allocated dynamically using pointers
Practical 10.4: Marks of group A having m students and group B having n students have stored in two
dynamically allocated arrays. Find the average aggregate marks of the whole class.
TEXT BOOKS:
T1 Programming in ANSI C by E. BalaguruSwamy, Tata McGraw Hill.

T2 Programming in C AnsI standard, by YashwantKanetkar, BPB Publications.
REFERENCE BOOKS:
R1 Programming with C (Schaum's Outline Series) by Byron Gottfried JitenderChhabra, Tata McGraw Hill.
R2 C Programming Language by Brian W. Kernighan, Dennis Ritchie, Pearson education.
R3 C How to program by Harvey Deital, 8th edition

Theory

Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3 3 3 3 3 3
CO2 3 3 3 3 3 3 3 3 3 3 3 3 3 3
CO3 3 3 3 3 3 3 3 3 3 3 3 3 3
CO4 3 3 3 3 3 3 3 3 3 3 3 3 3

SN 21UCP-142 Communication Skills Lab L T P S C CH Course Type*
10 0 0 2 0 1 2 UCR
21UCP-142
PRE-REQUISITE --
ANTI-REQUISITE 21PCP-158
The course focuses on the enhancement of listening comprehension and speaking fluency in everyday situations by focusing on some
essential grammar, vocabulary, and pronunciation. It will help students to cultivate soft skills like time management, stress management
and enhance self awareness through SWOC analysis shaping them to become better team players.
The Course aims to:
1. Equip students with listening, reading and speaking skills important in academic, professional and cultural situations.
2. Foster self awareness, confidence and a positive attitude in students’ ability to communicate effectively in English.
3. Monitor, remediate and strengthen comprehensible pronunciation, intonation and accent.
4. Enhance soft skills of students for preparation to the corporate world.
c. Course Outcomes
CO1 Display confidence in listening and speaking skills necessary for interaction in academic, professional and cultural
situations
CO2 Exhibit language effectively for group discussions and public speaking
CO3 Use non-verbal skills and soft skills effectively in the social and professional environment.
CO4 Use correct intonation, stress, pronunciation and neutral accent to communicate in English.
d. Syllabus
Soft Skills Self Awareness- Personal attributes, SWOC Analysis
Verbal Skills Art of Public Speaking- just a minute, extempore, news discussion
Non-Verbal Skills Positive body language, posture, gestures, symbols and signs
Reading Skills Reading Comprehension -1 & 2, vocabulary building -1 & 2
Listening Skills Listening exercises for word stress and pronunciation -1 & 2
Phonetics Classification of Speech Sounds, Vowel sounds, Introduction to phonetic symbols
Soft Skills Goal Setting, Time Management
Verbal Skills Art of self introduction, extempore, cross talk, news discussion
Non-Verbal Skills Personal appearance and grooming
Reading Skills Reading Comprehension -3 & 4, vocabulary building- 3 & 4
Phonetics Vowel Sounds, Consonant Sounds.

Soft Skills Stress Management, Team Building
Verbal Skills Greetings, Complementing and Inviting, Making Requests
Reading Skills Reading Comprehension -5 & 6, vocabulary building-5 & 6
Speaking Skills Group discussion
Phonetics Diphthongs Sounds, Stress & Intonation rules and practice
TEXT BOOKS:
T1 Globarena EL- Client Software for Communication Skills, Hyderabad
REFERENCE BOOKS:
R1 Sethi, J., Dhamija, P.V., A Practice Course in English Pronunciation, Prentice Hall of India, New Delhi.
R2 Roach P., English Phonetics and Phonology: A Practical Course (English),Cambridge University Press, 4th Edition, UK
R3 O’Connor, J. D. Better English Pronunciation, 2nd Edition, Cambridge University Press, (2012), UK
R4 Hornby, A.S. Oxford Advanced Learners Dictionary of Current English, 7th Edition, Oxford University Press, UK.

Theory

Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3

SN 21ECP-114 Foundation of Internet of Things Lab L T P S C CH Course Type*
11 0 0 4 0 2 4 CR
21ECP-114
PRE-REQUISITE -
ANTI-REQUISITE 21CSP-358
Foundation of Internet of Things practical course enable the students to control different devices from remote locations and then analyze the
information collected by these devises to make several conclusions or verifications.
The course will expose students to learn to specify, design and program modern IoT based platforms to capture real-world data and control end devices.
c. Course Outcomes
CO1 Establish an interface between embedded IoT system and the physical world through sensors, to read the state of the world, and
actuators, to change the state of the world
CO2 Establish connectivity of IoT modules with cloud for sensor data collection and management.
CO3 Design an appcessory with Bluetooth/Wi-Fi connectivity using standard mobile application development tools.
d. Syllabus
Unit-1 Introduction session Contact Hours:
<Experiment No 1> Hands-on session on Breadboard, Digital Multimeter, and Simulation Software.
< Experiment No 2> Introduction to IoT Platform SoC built around 32-bit Microprocessor, to be utilized as the core of all below-
mentioned tasks/ projects.
< Experiment No 3> Introduction to an open-source app development platform for open-ended Linux based OS primarily for touch
screen based smart devices.
Unit-2 List of Tasks/ Micro-Projects Contact Hours:
< Experiment No 1> 1. Introduction to open-source IoT Platform and basic interfacing Hands-on.
2. Design a Cloud based weather monitoring system using IoT platform and relevant sensors.
3. Design an air quality monitoring system using an IoT analytics platform service.
4. Develop a smart phone application for smart home voice-assistant.
5. Develop a smart phone application for close range wireless robot motion control.
6. Design an IoT based real-time video surveillance system.
7. Design a wireless network signal strength logging system for IoT devices.
8. Develop an IoT based intruder detection and alert system.
9. Develop a human vitals monitoring and alert system using IoT analytics platform.
10. Develop an engineered solution to socially relevant problem(s) with technical report.
11.
Textbook:
1. Mentoring Programme Handbook, Chandigarh University, 2019
Reference Books:
1. Goals! How to get everything you want –Faster than you ever thought possible. By Brian Tracy
2. Daniel Goleman (2012). Working with Emotional Intelligence. Bloomsbury Publishing India Private Limited

Web Resources:
1. http://www.skillsyouneed.com/ips/improving-communication.
2. https://www.mindtools.com/
3. www.psychologytoday.com

Theory

Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

SN 21UCY-146 Life Skills and Mentoring-1 L T P S C CH Course Type*
12 0 1 0 0 0 1.0 MNG
21UCY-146
PRE-REQUISITE -
ANTI-REQUISITE 21UCY-196
To develop interpersonal skills and adopt good leadership behavior for empowerment of self and others
• To enhance one’s ability to be fully self aware by helping oneself to overcome all fears and in securities and to grow fully from inside out and
outside in.
• To increase one’s knowledge and awareness of emotional competency and emotional intelligence at place of study/work.
c. Course Outcomes
CO1 Gain Self Competency and Confidence
CO2 Practice Emotional Competency
CO3 Gain Intellectual Competency
CO4 Gain an edge through Professional Competency
d. Syllabus
Self Awareness Definition of self awareness, Recognizing one’s own attitude, feelings, motives, strengths, The areas of self
awareness, How to develop self awareness
Goal Setting Effective Planning, Differentiating short term and long term goals, enhancing perseverance
Self Esteem Definition of self esteem, Assessing one’s own worth, How to develop self esteem
Self Confidence Understanding self confidence, benefits self-confidence, characteristics of self-

confidence, how to build self- confidenc
Stress management Understanding stress and stressors, its effect on brain, how to cope with it
Say no to Drugs Types of drugs, causes of addiction, sign of troubles, behavioral signs of drug abuse, Prevention
Interpersonal Understanding Relationships, What are examples of good interpersonal skills, Good interpersonal skills, How Do
Relationships You Show Good Interpersonal Skills
Values and ethics Understanding values, classification of values, importance of values, Core values
Empathy Understanding empathy, how to develop empathy, assessing your empathy
Harmony in the relations Family is a natural laboratory, Values in human to human relationships, Respect
Is right evaluation.

Textbooks / Reference Books: Text Books:

Reference Books:
1. Goals! How to get everything you want –Faster than you ever thought possible. By Brian Tracy
2. Daniel Goleman (2012). Working with Emotional Intelligence. Bloomsbury Publishing India Private mited
Web Resources:

Theory

Marks 40 60
Total Marks 100

S. No. Type of Weightage of actual Frequency of Task Final Weightage in Internal Remarks
Assessment conduct Assessment

assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)
6 Discussion NA One per Non Graded:

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3
CO2 3 2 3
CO3 2 3
CO4 3

SN Course Code L T P S C CH Course Type*
13 Coding Boot Camp 2
21CSV-113 21CSV-113
PRE-REQUISITE -
This boot-camp aims in providing students with a right information about programming fundamentals and technical prerequisites, Chandigarh
University is launching a short-term certification program to update students with programming fundamentals. This two-week online certification
program will provide useful insights for them about various aspects of coding along with some simple assessment exercises. This will be an enabler
for the students to learn the essential programming fundamentals thereby initiating them into the world of Computer Science before they join
their formal education.
• This certificate program will also assist the university in selecting students with good coding skill sets for some specialized programs.
• The course content for the certification will focus on building basic logical and mathematical skills along with providing students with a
glimpse of competitive coding that is today considered as the most important requirement for a Computer Science and Engineering
graduate.
• Improve basic programming skills in pre-engineering students

• Provide exposure of competitive coding to school students
• Assist in admission process for Computer Science & Engineering
c. Course Outcomes
CO1 Learn Programming concepts from Engineering perspective.
CO2 Understanding important Mathematical fundamentals that are relevant for Computer Science Graduates .
CO3 Learn how to analyze and test written codes using standard testing procedures .
CO4 Exposure to importance of Optimized Code in IT industry.
CO5 Implement the gathered knowledge to develop Industry ready projects.
Syllabus
Course Schedule of the Bootcamp
Serial Days Topic to be Covered (1.5 Hour per Day) Additional Video Content for Self-Study( 30 Handouts
mins per Day )
1 Day 1 INTRODUCTION TO CODING and VISUALIZATION OF CODE

practice problems quiz/ project
on competitive platforms discus-
sion
2 Day 2 ALGORITHMIC ANALYSIS and LOGIC BUILDING FOR PROB- LEMS
practice problems
on competitive platforms
3 Day 3 UNDERSTANDING PROGRAM FLOW CONTROL and

PROGRAMMING LANUGES & CODING practice problems
4 Day 4 PROGRAMMING FUNDAMENTALS -1 and CONTROL STRUCTURE

practice problems
5 Day 5 PROGRAMMING FUNDAMENTALS -2 and PROGRAMMING TIPS

FOR COMPETITIVE CODING practice problems
6 Day 6
CODE-O-MANIA
7 Day 7
CERTIFICATION TEST AND VALEDICTORY
Textbooks / Reference Books: Text Books:

Reference Books:
Web Resources:

Theory

Marks
Total Marks
g. CO-PO Mapping

Semester-2
S Course Evaluation
N Type Internal External Total
1 21SMT-175 Calculus and Vector Spaces CR 0 4 0 0 4 4 40 60 100
2 21SZT-188 Biology For Engineers DE 3 0 0 0 3 3 40 60 100
3 21ECT-155 Digital Electronics DE 3 0 0 0 3 3 40 60 100
4 21CST-151 Introduction to CR 0 2 0 0 2 2 40 60 100

Programming
5 21PCT-154 Professional Communication CR 0 2 0 0 2 2 40 60 100

Skills
6 21ECP-158 Applied Digital Electronics Lab DE 0 1 2 0 2 3 60 40 100
7 21CSP-152 Introduction to CR 0 0 2 0 1 2 60 40 100

Programming Lab
8 21PCP-158 Professional Communication CR 0 0 2 0 1 2 60 40 100

Skills Lab
9 21MEP-156 Workshop CR 0 0 4 0 2 4 60 40 100

Practice Trades (CSE, ECE, EE)
10 21ECP-118 Foundations of AI CR 0 0 2 0 1 2 60 40 100

Applications Lab
11 21UCY-196 Life Skills and Mentoring-2 MNG 0 0 2 0 1 2 0 0 0

MNG
12 21UCH-297 Academic Research Paper UC 1 0 0 0 1 1 40 60 100

Writing and IPR
TOTAL 7 9 12 0 22 30

SN 21SMT-175 CALCULUS & VECTOR SPACES L T P S C CH Course Type
1 0 4 0 0 4 4 CR
21SMT-175
PRE-REQUISITE 21SMT-125
CO-REQUISITE 21SZT-188,21ECT-155,21CST-151
The course provides a strong foundation in Calculus and Vector Spaces and equips the students with the fundamentals of mathematical
tools for solving basic mathematics problems. This is achieved by focusing on concept understanding and appropriate applicati on of that.
The course introduces basic calculus topics and introduces the students to vector spaces with discussion of their applications in various
engineering fields.
1. Familiarize the prospective engineers with techniques in calculus, multivariate analysis and linear algebra.
2. Equip the students with standard concepts and tools at an intermediate to advanced level that will serve them well towards solving
more advanced level of mathematics and applications that they would find useful in their respective disciplines.
c. Course Outcomes
CO1 Understand and apply the concept of partial derivatives to solve mathematical problems and understand its application in
real life situations.
CO2 Analyze the concept of Group theory and its application of analysis to Engineering problems.
CO3 Demonstrate the concept of vector spaces in a comprehensive manner.
d. Syllabus
Unit-1 Calculus Contact Hours:15
Calculus Partial Differentiation, Euler’s Theorem, Composite functions, Jacobian. Taylor’s and Maclaurin’s Series
for one and two variables. Multiple Integrals, change of order and Change of Variable. Area and volume
using double and triple integrals.
Unit-2 Calculus and Algebraic Structures Contact Hours:15
Calculus Indeterminate forms and L Hospital’s rule
Algebraic structures Definition, elementary properties of algebraic structures, semigroupmonoid, group, homomorphism,
isomorphism and automorphism, congruence relations, subgroups, normal subgroups, cosets, Lagrange's
theorem, cyclic groups.
Unit-3 Vector Spaces Contact Hours:15
Vector Spaces
Vector Space, linear dependence of vectors, Basis, dimension; Linear transformations (maps), range
and kernel of a linear map, rank and nullity, Inverse of a linear transformation, rank- nullity theorem
(Without Proof) , composition of linear maps, Matrix associated with a linear map. Inner product
spaces, Gram-Schmidt orthogonalization
TEXT BOOKS:
T1 E. Kreyszig, Advanced Engineering Mathematics, John Wiley,10th Ed.2011., New Delhi

T2 H.K. Dass., Higher Engineering Mathematics, S Chand Publishers, 3rd revised edition, 2014.
T3 B.S.Grewal, Higher Engineering Mathematics, Khanna Publishers, 42th ed.2013, New Delhi.
REFERENCE BOOKS:
R1 R.K. Jain and S.R.K. Iyengar, Advanced Engineering Mathematics, 3rd Edition, Narosa Publishing House, 2004, New Delhi.
R2 B.V. Ramana Advanced Engineering Mathematics, McGraw Hill, July 2006, New Delhi.
R3 B. Thomas andR.L. Finney, Calculus and Analytic Geometry, Pearson Education, 11th Edition.
R4 N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2008.

Theory
Marks 40 60

Total Marks 100

assignment
each test
As applicable to
quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3

SN 21SZT-188 Biology For Engineers L T P S C CH Course Type
2 3 0 0 0 3 3 DE
21SZT-188
PRE-REQUISITE -
CO-REQUISITE 21ECT-155,21CST-151,21SMT-175
ANTI-REQUISITE -
The course begins with the theoretical study of cell biology which is widely utilized in medical sciences .The students are then introduced
to medical instrumentation. The course further emphasizes on the use of software.
This subject is designed to impart fundamental knowledge on emerging fields of sciences like bioinformatics. It is designed to impart knowledge that
how to apply different softwares in research.
c. Course Outcomes
CO1
To apply knowledge of cell biology to identify, formulate, and solve problems.
CO2
To excel in career as researcher in both traditional and emerging fields of science .
CO3
To apply knowledge of molecular biology, biosensors and immunology to excel in areas such as entrepreneurship, medicine,
government, and education.
CO4
To think critically and creatively, especially about the use knowledge about biology of cancer and new areas of biology to address
local and global problems.
d. Syllabus
Unit-1 Basic Cell Biology Contact Hours:15
Introduction: Living Organisms, Cells and Cell theory, Cell Structure and Function, Genetic information, protein synthesis, and
protein structure, Cell growth, Cell Division, and differentiation. aging, apoptosis, stem cell Biology and Tissue
engineering .
Unit-2 Uses of Biology in Engineering Contact Hours:15
Medical Instrumentation Electrocardiogram (ECG), Electroencephalogram (EEG), Electro Myogram (EMG), Magnetic Resonance Imaging-
principles of MRI,X-ray.
and Techniques
Biosensors Chemoreceptors, hot and cold receptors, baro receptors, sensors for smell, sound, vision, osmolality and taste.
Transducers
Recombinant DNA Vectors, Types of Vectors, BAC, YAC, DNA Fingerprinting ,PCR Electrophoresis Blotting Technique,
Technology Chromatography.
Immunology Innate, Adaptive, Lymphiod Organs, types of cell
Unit-3 Uses of Softwares Contact Hours:15
Enzymes and Industrial Enzymes: Biologicalcatalysts, Proteases, Carbonicanhydrase, Restriction enzymes and Nucleoside
Application monophosphate kinases-Photosynthesis
Nervous System Neuron, structure, PNS, CNS, Action potential
Bioinformatics Introductory Bioinformatics, BLAST, FASTA, Data mining
Disease HIV, CoronaVirus, Diabetes, Cancer
TEXT BOOKS:
T1. C.B.Powar, 2010.Cell Biology.5thEd,Himalyan Publishing House.

T2. Leshie Cromwell, Fred.J. Weibell and Erich.A.Pfeiffer. 2003. Biomedical instrumentation and measurements. 2nd edition, PHI.
T3. John G. Webster 1998. Medical Instrumentation: Applications and Design, 3rd edition, Jon Wiley and Sons, New York.
T4. Fundamental concepts of bioinformatics. Dan E. Krane, Michael L. Raymer
T5. Bioinformatics Methods and applications. S.C Rastogi P Rastogi
REFERENCE BOOKS:
R1. Jeremy M. Berg, John L. Tymoczko and LubertStryer. 2006. “Biochemistry,” 6th Ed. W.H. Freeman and Co. Ltd.
R2. Robert Weaver. 2012 “Molecular Biology,” 5th Edition, MCGraw-Hill.
R3. Jon Cooper, , 2004. “Biosensors A Practical Approach” Bellwether Books.
R4. Martin Alexander, 1994 “Biodegradation and Bioremediation,” Academic Press.

R5. Kenneth Murphy, 2011. “Janeway'sImmunobiology,” 8th edition, Garland Science.
R6. Eric R. Kandel, James H. Schwartz, Thomas M. J. 2012. “Principles of Neural Science, 5th Edition, McGraw-Hill.
R7. S. ThyagaRajan, N. Selvamurugan, M. P. Rajesh, R. A. Nazeer, Richard W. Thilagaraj, S. Barathi, and M. K. Jaganathan. 2012 “Biology for
Engineers,” Tata McGraw-Hill, New Delhi.

Theory
Marks 40 60
Total Marks 100

assignment
each test
quiz As applicable to
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3
CO2 3 3 3
CO3 3 3 3
CO4 3 3 3

SN 21ECT-155 Digital Electronics L T P S C CH Course Type
3 3 0 0 0 3 3 DE
21ECT-155
PRE-REQUISITE -
CO-REQUISITE 21SZT-188,21CST-151,21SMT-175
ANTI-REQUISITE 21ELT-111
The Course begins with the basis concepts of Digital and analog Systems along with the basis application to day to day life. The students are trained how
to implement these basis concept of conversions and combinational and sequential circuits to daily needs application and designing of circuits.
• To understand Merits of digitization.
• To enable you to understand common forms of number representation in digital electronic circuits and to be able to convert between
different representations.
• To Impart Knowledge about various digital circuits and designing of systems
c. Course Outcomes
CO1 Merits of digital systems, various number systems and their applications.
CO2 Combinational and Sequential Digital Designing and solution to basic digital problems.
CO3 Designing of sequential circuits and introduction to memory logic design
d. Syllabus
Basics Introduction to digital electronics, Need of digital, Merits and Demerits, Difference between Analog and
Digital Electronics.
Number System Introduction, Binary, Octal and Hexadecimal number system. Signed and unsigned number; Binary operations:
Addition, Subtraction, Multiplication and division; Subtractions using 1's and 2's compliment, BCD code and
gray code.
Logic gates and Introduction to basic gates : OR, AND, NOT, NOR, NAND, EX-OR, Basic theorem of Boolean Algebra, sum of
Minimization products and product of sums, canonical form, Simplifications using K-map (4 variable)

Combinational Circuits Introduction to Combinational circuit design, half adder, full adder, BCD Adder, Half Subtractor, Full
Subtractor, Multiplexer, Demultiplexer, encoder, decoder and magnitude comparator.
Sequential Circuits Introduction to sequential circuits, latch & flip flop (SR, JK, D and T), race around condition, conversion of
various flip flops.
Unit-3 Designing of Sequential Circuits: Contact Hours:15
Basic introduction to synchronous and asynchronous counters and designing.

Counters
Basic introduction to synchronous and asynchronous counters and designing.
Counters
Shift Registers Types, Circuit Diagram, Timing waveforms.

Semiconductor Memories Introduction, Classification: RAM, ROM, PROM, EPROM, EEPROM
TEXTBOOKS:
T1: Mano,Morris, Digital Design, Prentice Hall of India.

T2: Malvino, Digital principle and applications, Tata McGrawHill .
T3: Floyd & Jain, Digital Fundamentals, Pearson.

REFERENCE BOOKS:
R1: Fletcher, AnEngg. Approach to digital design,Prentice Hall of India.
R2: C.H. Roth , Fundamentals of logic Design , CL Engg.
R3: SubrataGhoshal, Digital Electronics ,Cengage.

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3
CO2 3 3 3
CO3 3 3 3

SN 21CST-151 Introduction to Programming L T P S C CH Course Type
4 0 2 0 0 2 2 CR
21CST-151
PRE-REQUISITE 21CST-111
CO-REQUISITE 21SZT-188,21ECT-155, 21CSP-152
ANTI-REQUISITE 21CST-218
The course begins with the introduction to features of object-oriented programming and its applications in numerous fields. After
covering fundamentals, students will learn how to apply the more complex concepts including Inheritance, Polymorphism and File
Handling in order to solve the complex real-world problems.
1. To enable the students to understand various stages and constructs of C++ programming language and relate them to engineering
programming problems.
2. To improve their ability to analyze and address variety of problems in programming domains.
c. Course Outcomes
CO1 Provide the environment that allows students to understand object-oriented programming Concepts. Basics of Probability
distribution.
CO2 Demonstrate basic experimental skills for differentiating between object-oriented and procedural programming paradigms and the
advantages of object-oriented programs. Classification of Stochastic processes
CO3 Demonstrate their coding skill on complex programming concepts and use it for generating solutions for engineering and
mathematical problems. Discrete parameter Markov Chains.
CO4 Develop skills to understand the application of classes, objects, constructors, destructors, inheritance, operator overloading and
polymorphism, pointers, virtual functions, templates, exception handling, file operations and handling. Continuous parameter Markov
Chains.
d. Syllabus
Unit-1 Fundamentals of C++ Contact Hours:10
Fundamentals of C++ Features of object-oriented programming, Difference between object oriented and procedure-oriented
programming, Difference between structure and class, Data types. Input and output streams (cin, cout),
introduction to namespace.
Classes and Objects Specifying a class, creating objects, accessing class members, defining a member function inside and outside
class, access specifiers, inline function, static data members & member functions. Objects as function
arguments, friend function, returning objects to functions.
Constructors and Need for constructors, types of constructors: default, parameterized, copy constructor, order of execution of
constructors, destructors and their need.
Destructors
Unit-2 Inheritance, Polymorphism & Exception Handling Contact Hours:10

Inheritance Defining derived class, modes of inheritance, types of inheritance, ambiguity in inheritance, virtual base class,
Function overriding, Member Classes: Nesting of Classes.
Polymorphism Introduction & types of polymorphism, Function overloading, operator overloading, rules for overloading
operators, overloading of unary & binary operators, Constructor Overloading.
Exception Handling Try, Throw, Catch, Throwing an Exception, Catching an Exception
Unit-3 Pointers, Virtual Functions, DMA & Files Contact Hours:10
Pointers, Virtual Functions Declaring & initializing pointers, pointer to objects, this pointer, pointer to derived classes, static and dynamic
binding.
Dynamic memory Dynamic memory allocation using new and delete operator.
allocation
Files Introduction to File streams, Hierarchy of file stream classes, File operations, File I/O, File opening Modes,
Reading/Writing of files, Random-access to files.

TEXT BOOKS:
T1 E Balagurusamy., “Object Oriented Programming in C++”, Tata McGraw-Hill.

T2 Robert Lafore, “Object Oriented Programming in C++”, Waite Group.
REFERENCE BOOKS:
R1 Herbert Schildt , “C++- The Complete Reference”, Tata McGraw-Hill 2003, New Delhi.
R2 BjarneStroustrup: “The C++ Programming Language” (4th Edition). Addison-Wesley.
R3 Ravichandran , “Programming with C++”,Tata McGraw-Hill Education.
R4 Joyce M. Farrell,” Object Oriented Programming Using C++”, Learning.
R5 Programming Languages: Design and Implementation (4th Edition), by Terrence W. Pratt, Marvin V. Zelkowitz, Pearson.
R6 Programming Language Pragmatics, Third Edition, by Michael L. Scott, Morgan Kaufmann.

Theory
Marks 40 60
Total Marks 100


assignment
each test
As applicable to
quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3 2
CO2 3 3 3 3 3 3 3 3 2
CO3 3 3 3 3 3 3 3 3 3 3 2
CO4 3 3 3 3 3 3 3 3 3 3 3 2

SN 21PCT-154 Professional Communication Skills L T P S C CH Course Type
5 0 2 0 0 2 2 CR
21PCT-154
PRE-REQUISITE 21UCT-141
ANTI-REQUISITE 21TDP-251
The intermediate level course develops succinct written expression for modern business communication with special emphasis on report
writing and creating communication material. Concepts of morality, diversity sensitization for teams are also introduced. Students are
initiated to the placement process through interview skills and resume writing.
The Course aims to:

1. Stress on students awareness of interpersonal communication skills and appropriate usage of verbal and non-verbal expression in
social and professional environment.
2. Prepare the student for discourse in English, using a number of communication strategies.
3. Introduce them to key concepts of Morality, Diversity & Inclusion
4. Provide foundations for the placement process of the student.
c. Course Outcomes
CO1 Research and write short official, technical or social research report.
CO2 Create communication material for an organization dedicated to a social cause and use electronic/social media to share concepts and
ideas.
CO3 Present and summarize information, ideas and opinions in a business environment using grammatically correct English.
CO4 Perform effectively in the placement process.
d. Syllabus
Reading Skills Technical Reading
Writing Introduction to proposals, features of writing a good report, purpose of report writing; difference
between business report and engineering report, types of reports-official reports and technical report
writing, E-magazine on a Social Cause.
Grammar Tenses, subject –verb agreement, punctuation
Vocabulary Contextual Usage - Synonyms, Antonyms, homophones
Identity of Organization Creating Communication material (Vision, Mission, Values, Branding)
Writing Media Writing - Press note, business letters, agenda and minutes of meeting, modern forms of
communication: e-mails, memorandum, video conference and conference calls.
Grammar Sentence correction and sentence completion
Vocabulary Idioms, collocations
Unit-3 Introduce key concepts of Morality, Diversity & Inclusion, Case Study Contact Hours:10
Writing Paragraph writing, summarizing, describing objects and processes, proofreading.

Interview Skills Types of Interviews, cover letter and resume writing.
Grammar Para completion, sentence rearrangement, close test.
Vocabulary Analogy
TEXT BOOKS:
T1 Raman, M. and Sharma, S; Technical Communication - Principles and Practice, Oxford University Press (2018), New Delhi
T2 Professional Communication Skills Workbook, 2021.
REFERENCE BOOKS:
R1 Murphy, R, English Grammar in Use (Advanced Level – CEFR-B1, B2), 5th Edition, Cambridge University Press (2019), UK
R2 Hewing, Martin, Advanced Grammar in Use, 4th Edition, Cambridge University Press (2016), UK.

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3
CO4 3

SN Applied Digital Electronics Lab L T P S C CH Course Type*
21ECP-158
6 0 0 2 0 1 2 DE
21ECP-158
PRE-REQUISITE 21ELP-112
To conceive, analyze, design and build combinational and sequential digital logic solutions for everyday problems.
To conceive, analyze, design and build combinational and sequential digital logic solutions for everyday problems.
c. Course Outcomes
CO1 Identify relevant information to the supplement the digital system design.
CO2 Analyze the elements of digital system abstractions such as digital representations of information, digital logic and Boolean algebra.
CO3 Design digital systems based on concepts that enable autonomous behavior.
CO4 Prepare professional quality textual and graphical presentations.
CO5 Work in a team that can propose, design, implement and report on digital systems’ project.
d. Syllabus
Unit-1 (Name of the Unit) Contact Hours:
<Experiment No 1> Validation of truth tables of logic gates(7400,7402,7404,7408,7432,and 7486).
< Experiment No 2> Design a burglar alarm(AND).
(b) Design a single door bell ringer for both front and backdoors(OR).
(c) Design an automatic fan controller (NOT).

< Experiment No 3> Design a two-way switch for room light (XOR).
Design an LED Flasher (NAND).
Design a multiplayer game trigger mechanism(NOR).
< Experiment No 1> Design a light based object counter with 7-segment display.
< Experiment No 2> Design a pulse width modulated signals generator using 555.
< Experiment No 3> Design a traffic light system using D Flip-Flop.
< Experiment No4> Design a home appliance control system with3-to-8 decoder.
< Experiment No 1> Design a stress measuring game using decade counter.
< Experiment No 2> Design a multiple sensor data acquisition system using multiplexer.
< Experiment No 3> Design a rollingLEDdisplayusingMAX7219shiftregister.
< Experiment No4> Project with technical report.

Textbooks / Reference Books
T1: Mano,Morris, Digital Design, Prentice Hall of India.
T2: Malvino, Digital principle and applications, Tata McGrawHill .
T3: Floyd & Jain, Digital Fundamentals, Pearson.
REFERENCE BOOKS:
R1: Fletcher, AnEngg. Approach to digital design,Prentice Hall of India.

R2: C.H. Roth , Fundamentals of logic Design , CL Engg.
R3: SubrataGhoshal, Digital Electronics ,Cengage.
Theory

Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3 3 2
CO2 3 3 3 3 3 3 3 3 3 3 2
CO3 3 3 3 3 3 3 3 3 3 2
CO4 3 3 3 3 3 3 3 3 3 3 3 3 2
CO5 3 3 3 3 3 3 3 3 3 3 3 3 2

SN 21CSP- Introduction to Programming Lab L T P S C CH Course Type*
7 152 0 0 4 0 2 4 CR
21CSP-152
PRE-REQUISITE 21CSP-112
The course begins with the introduction to features of object-oriented programming and its applications in numerous fields. After covering
fundamentals, students will learn how to apply the more complex concepts including Inheritance, Polymorphism and File Handling in order
to solve the complex real-world problems.
1. To enable the students to understand various stages and constructs of C++ programming language and relate them to engineering
programming problems.
2. To improve their ability to analyze and address variety of problems in programming domains.
c. Course Outcomes
CO1 Provide the environment that allows students to understand object-oriented programming Concepts. Basics of Probability
distributions
CO2 Demonstrate basic experimental skills for differentiating between object-oriented and procedural programming paradigms and the
advantages of object-oriented programs. Classification of Stochastic processes
CO3 Demonstrate their coding skill on complex programming concepts and use it for generating solutions for engineering and mathematical
problems. Discrete parameter Markov Chains
CO4 Develop skills to understand the application of classes, objects, constructors, destructors, inheritance, operator overloading and
polymorphism, pointers, virtual functions, templates, exception handling, file operations and handling. Continuous parameter Markov
Chains
d. Syllabus
Unit-1 Fundamentals of C++ Contact Hours:10
<Experiment No 1> Practical 1.1:WAP to find the area of a triangle using Heron’s Formula when three sides of the triangle are input by
user.
Practical 1.2:A person walks x km toward east and turns to the right. Then he moves y km. WAP to find the
distance between starting and final point. Values of x and y are input by user.
< Experiment No 2> Practical 2.1:Programto generate the Fibonacci series up to user specified limit. Write all the missing terms (e.g. 4,
6, 7, 9, 10, 11, 12, 14, 15…) also at the end.
Practical 2.2:WAP to input a matrix of dimension 4x4. If base address is 1000. Find the address of given element of
the matrix.
< Experiment No 3> Practical 3.1:Create a class called employee that contains a name (an object of class string) and an employee
number (type long). Include a member function called getdata() to get data from the user, and another function
called putdata() to display the data. Assume the name has no embedded blanks. Write a main() program to
exercise this class. It should create an array of type employee, and then invite the user to input data for up to 100
employees. Finally, it should print out the data for all the employees.
Practical 3.2:WAP to add two complex numbers using class and objects.
< Experiment No 4> Practical 4.1:WAP to add two objects of type time using constructor and destructor in the format 11:59:59.
Practical 4.2:WAP to find area of rectangle using parametrized constructor.
Unit-2 Inheritance, Polymorphism & Exception Handling Contact Hours:10
< Experiment No 5> Practical 5.1:WAP to explain all Inheritance types.

Practical 5.2:WAP to illustrate ambiguity in multiple Inheritance and resolve using scope resolution operator.
Practical 5.3:WAP to resolve the diamond ambiguity using virtual base class.
< Experiment No 6> Practical 6.1:WAP to calculate and display cube of an integer and decimal number using function overloading.
Practical 6.2:Program to demonstrate the unary operator overloading for operator ++. Make a class test. Create a
default constructor to initialize the variable. Make a member function for operator ++ with definition to decrement
the value of variable.
Practical 6.3:Create a class that imitates part of the functionality of the basic data type int. Call the class Int(note
different spelling). The only data in this class is an int variable. Include member functions to initialize an Int to 0, to
initialize it to an int value, to display it (it looks just like an int), and use operator overloading to add two Int values.
Write a program that exercises this class by creating two initialized and one uninitialized Int values, adding these
two initialized values and placing the response in the uninitialized value, and then displaying this result.
< Experiment No 7> Practical 7.1:WAP to perform exception handling for Divide by zero Exception.
Practical 7.2:WAP to handle various exception handlings.
Unit-3 Pointers, Virtual Functions, DMA & Files Contact Hours:10

< Experiment No 8> Practical 8.1: Write a program that reads a group of numbers from the user and places them in an array of type
float. Once the numbers are stored in the array, the program should average them and print the result. Use
pointer notation wherever possible.
Practical 8.2: WAP to implement function overriding using virtual functions.
< Experiment No 9> Practical 9.1: Program to understand the concept of new and delete operator.
Practical 9.2: Write a program to store the information of about 5 students in a file and read the contents and
print them on screen.
< Experiment No 10> WAP to demonstrate tellg() and tellp() functions.
TEXT BOOKS:
T1 E Balagurusamy., “Object Oriented Programming in C++”, Tata McGraw-Hill.
T2 Robert Lafore, “Object Oriented Programming in C++”, Waite Group.
REFERENCE BOOKS:
R1 Herbert Schildt , “C++- The Complete Reference”, Tata McGraw-Hill 2003, New Delhi.
R2 BjarneStroustrup: “The C++ Programming Language” (4th Edition). Addison-Wesley.
R3 Ravichandran , “Programming with C++”,Tata McGraw-Hill Education.
R4 Joyce M. Farrell,” Object Oriented Programming Using C++”, Learning.
R5 Programming Languages: Design and Implementation (4th Edition), by Terrence W. Pratt, Marvin V. Zelkowitz, Pearson.
R6 Programming Language Pragmatics, Third Edition, by Michael L. Scott, Morgan Kaufmann.'

Theory

Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3 2
CO2 3 3 3 3 3 3 3 3 2
CO3 3 3 3 3 3 3 3 3 3 3 2
CO4 3 3 3 3 3 3 3 3 3 3 3 2

SN CODE TITLE L T P S C CH Course Type*
8 0 0 4 0 2 4 CR
21PCP-158 Professional Communication Skills Lab 21PCP-158
PRE-REQUISITE 21UCP-142
ANTI-REQUISITE 21TDP-251
The course aims to make students use information to practice strategic discourse. It will prepare them for the transition from academia to
industry.
1. Prepare students for their careers through proficient use of English in professional and interpersonal communication in the globalized
context.
2. Inculcate soft skills and a professional attitude in the student.
3. Impart expertise for effective presentation skills.
c. Course Outcomes
CO1 Give presentations in English confidently using appropriate tools.
CO2 Illustrate effective soft skills while negotiating ethically in professional situations.
CO3
Use neutral accent in English with correct pronunciation.
d. Syllabus
Soft Skills Critical Thinking Skills, Creativity Skills
Presentation Skills Elements & structure of effective presentation, preparation of presentation
Speaking Skills Presentation on a given topic, extempore, cross talk, paper reading
Reading Skills Technical Reading – inferring meaning, critical reading: exercise 7-8
El Client Software Parts of Speech, subject–verb agreement, tenses – contextual usage exercises
Phonetics Vowel sounds practice with speaking on software
Soft Skills Problem Solving Skills, Professional Ethics & Values
Speaking Skills Group discussion, poster making and presentation, news discussion.
Phonetics Consonant Sounds practice with speaking on software
El Client Software Correction of Sentences, Common Errors in English exercises
Soft Skills Negotiation Skills, Telephone Etiquette, Interview Skills- Interview Skills
Vocabulary building one-word substitutes, analogy
Phonetics Diphthongs sounds practice
TEXT BOOKS:
T1 Globarena EL- Client Software for Communication Skills, Hyderabad

Theory

Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3

SN 21MEP-156 Workshop Practice L T P S C CH Course Type*
Trades
(CSE, ECE, EE)
(Fitting Shop, Electrical Shop, Electronics Shop)
9 0 0 4 0 2 4 CR
21MEP-156
PRE-REQUISITE --
ANTI-REQUISITE 21ECP-114
The course begins with the introduction to various tools and operation in manufacturing likeFitting Shop, Electrical Shop, Electronics Shop andits
application in numerous fields. After experiments students will learn how to apply the more complex real-world problems.
To familiarize the students with various tools and operation in manufacturing like Fitting, Electrical and electronics.
c. Course Outcomes
CO1 Familiarize the students with various tools & safety precautions as per the floor shops
CO2 To impart practical knowledge to perform basic operations & prepare an accurate job
CO3 Learn the applications of tools & processes in daily life routine tasks.
d. Syllabus
Unit-1 Fitting Shop Contact Hours:10
Fitting shop Students to learn the use of Fitting Hand Tools, Marking Tools, Measuring Tools and
Gauges etc.Exercises: Involving Jobs made out of MS Flats, to make a Square Fitting
Job & a Triangular Fitting job Involving operations like Hacksawing, Marking, Filing,
Drilling, Tapping and Radiusing etc.
Unit-2 Electrical and Electronic Shop Contact Hours:10

Electrical & Electronics Introduction to tools and electrical accessories. Exercises: Including preparation of
Shop Stair Case wiring and Full Wave Centre Tap Rectifier, Involving the assembling of
electronic components on PCB's using soldering.
Unit-3 Computer and its accessories shop Contact Hours:10
Computer and its Introduction to PC, Motherboard and other components, accessories. Includes
accessories shop assembling and disassembling of Personal Computer.
LIST OF EXPERIMENTS
<Experiment No 1> 1. To make a 'T' part of Square Fitting Job involving different operations like
< Experiment No 2> 2. To make a U part of Square Fitting Job involving different operations like
< Experiment No 3> 3. Identification of electrical and electronics components: Resistors
< Experiment No 4> 4. Drawing of electronic circuit diagrams using BIS/IEEE symbols and introduction to EDA tools (Open Source
Tools such as Dia or XCircuit)
< Experiment No 5> 5. Inter-connection methods and soldering practice:Bread board
< Experiment No 6> 6. Operation of Protective & Safety devices: Fuse
< Experiment No7> 7. Troubleshooting of domestic devices: Dismantling
< Experiment No 8> 8. Motor: Demo model of Motor Principle
< Experiment No 9> 9. Introduction to PC Hardware: Types of Memories- Static RAM and Dynamic RAM
< Experiment No 10> 10. Assembling, Disassembling of PC: Assembling and Disassembling of Personal Computer.
Text Books:

1. Singh Swarn, Workshop Practice by S. Chand and Sons.
Reference Books:
1. ChaudhuryHazra ,Workshop Technology, vol I, Media Promoters & Publication

2. Raghuvanshi B. S Workshop Technology, vol I, Dhanpatrai and Sons

Theory

Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

SN 21ECP-118 Foundations of ARTIFICIAL INTELLIGENCE LAB L T P S C CH Course Type*
10 0 0 2 0 1 2 CR
21ECP-118
PRE-REQUISITE 21ECP-114
Basic understanding of the building blocks of AI as presented in terms of intelligent agents: search, knowledge representation, inference, logic, and
learning.
To develop a basic understanding of the building blocks of AI as presented in terms of intelligent agents: search, knowledge representation, inference,
logic, and learning.
c. Course Outcomes
CO1 Identify problems where artificial intelligence techniques are applicable.
CO2 Apply artificial intelligence techniques in applications which involve perception, reasoning and learning.
CO3 Develop simple intelligent system using available tools and techniques of AI to analyze and interpret domain knowledge.
d. Syllabus
Introduction session Contact Hours:
Introduction Session
1. Introduction to ARM v8 64-bit SoC with open-source Linux-based OS, to be utilized as the core of all below-mentioned tasks/ projects.
2. Introduction to an open-source AI hardware platform for vision, speech and text analysis.
List of experiments
<Experiment No 1> Understand program flow control in Python.

< Experiment No 2> Explore functions, list, tuples & ranges in Python.
< Experiment No 3> Derive insights from images in the cloud using pre-trained Vision API models to detect emotion and understand
text.
< Experiment No 4> Perform Speech-to-text conversion using pre trained machine learning API models for short-form or long-form
audio.
< Experiment No 5> Derive insights from unstructured text using machine learning custom models to classify, extract, and detect
sentiments.
< Experiment No 6> Create an artificial intelligence powered ChatBot to mimic human interactions for e-commerce.
< Experiment No7> Create a service ChatBot that responds with relevant data in a conversation for Educational institutions.
< Experiment No 8> Explore, visualise, transform and summarise input datasets for building classification models.
< Experiment No 9> Predict whether or not it will rain tomorrow by training a binary classification model.
< Experiment No 10> Predict outcome of individual items located in groups to classify iris species.
Textbooks / Reference Books:
https://www.edureka.co/blog/artificial-intelligence-applications


Theory

Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

SN CODE Life Skills and Mentoring-II MNG L T P S C CH Course Type*
11 0 0 2 0 1 2 MNG
21UCY-196 21UCY-196
PRE-REQUISITE 21UCY-146
The course will build the capability to help in developing self-awareness and sensitivity, feeling of equality, compassion and oneness.
To identify specific needs of student-Academic, Personal, Adjustment related and provide counseling. To help students build strength of character, ethics
and values. Counseling students and provide confidence to improve their quality of life. To enable the parents to know about the performance and
regularity
c. Course Outcomes
CO1 Develop relationship around mentee's specific learning goals
CO2 Provide objective feedback – focus on concrete actions and Behavior in order to support mentee growth and development.
CO3 Share personal experience – openly disclose past and current experiences, successes, challenges, and lessons learned.
d. Syllabus
Positive Attitude Understanding positive attitude; List of positive attitudes; Characteristics and Traits of a Positive Mindset;
Outcomes of a positive Attitude; Tips on How to Have & Keep a Positive Mindset in Life and at Work; Assessment
of Positive Attitude
Anger Management Understanding Anger Management; Unhelpful Angry Behavior; Techniques To Manage Your Feelings.
Healthy Relationships Understanding Healthy Relationships; Keys of Healthy Relations; Building Healthy Relationships
Character Strength Understanding Character Strength; What are major virtues by which we judge a person’s actions and character?
Focusing on your strengths; Use strength to boost happiness
Human Aspirations Understanding basic human aspirations
Social Responsibility Understanding Social Responsibilities; Contributing and connecting with the society
Assertiveness Understanding assertiveness; Benefits of assertiveness; Learning when to Be Assertive
Happiness and Gratitude Understanding happiness and Gratitude; factors that affect our happiness; Interesting Facts and Findings about
happiness; Useful tips for happiness; Benefits of gratitude; Modern Psychological Perspectives on Gratitude;
how Happiness and Gratitude is related to well being
Human Dignity Understanding Human Dignity; Fundamental rights of a person
Earth, Our Home Our Role and Relationship with Nature
Text Books:

Reference Books:
1. Daniel Goleman (2012). Working with Emotional Intelligence. Bloomsbury Publishing India Private Limited
Web Resources:


Theory

Marks 40 60
Total Marks 100

assignment
each test
As applicable to
quiz
course types
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

Semester-3
SN Code Course Name Course L T P S C CH Evaluation

Type
1 21CST- Data Structures CR 3 0 0 0 3 3 40 60 100
211
2 21CST- Computer Organization & CR 3 0 0 0 3 3 40 60 100

212 Architecture
3 21CST- Database Management CR 3 0 0 0 3 3 40 60 100

214 System
4 21SMT- Numerical & Optimization CR 3 1 0 0 4 4 40 60 100

216 Techniques
5 21TDT- Aptitude CR 0 2 0 0 2 2 40 60 100

202
6 21CST- Object Oriented Programming CR 2 0 0 0 2 2 40 60 100

218 using Java
7 21CSP- Data Structures Lab CR 0 0 4 0 2 4 60 40 100

212
8 21CSP- Database Management CR 0 0 2 0 1 2 60 40 100

215 System Lab
9 21CSP- Object Oriented Programming CR 0 0 2 0 1 2 60 40 100

219 using Java Lab
10 21UCT- Introduction to Management UC 2 0 0 0 2 2 40 60 100

221 and Leadership
11 21UCY- Life Skills and Mentoring : MNG 0 1 0 0 1 1 40 60 100

246 MNG
12 21UCH- Entrepreneurship UC 1 0 0 0 1 0 60 0 60
249
13 21CSY- Institutional/Summer SSMNG 0 0 0 4 2 0 60 40 100

225 Training: MNG
TOTAL 17 3 8 4 24 29

SN Course Code TITLE OF THE COURSE L T P S C CH Course Type
1 Data Structures 3 0 0 0 3 3 CR
21CST-211/ 21CST-211/ 21ITT-211
21ITT-211
CO-REQUISITE 21CST-212,21CST-214, 21SMT-216, 21CST-218,21CSP-215
The course will give the knowledge about the different data structures like Array , Linked List, Stack, Queue, Tree, Graph etc, to the students with the
algorithmic understanding of the various possible operations.
• To understand the concept of the data structures and operations on them.
• To apply different data structures for modeling real world problems.
• To provide basic data structure concepts in an object-oriented setting for design, implementation, testing and maintenance of software
systems.
c. Course Outcomes
CO1 Students will be able to do implementation of data structures like array, stack, queue, link list etc.
CO2 Students will be able to analyze time and space complexities.
CO3 Student will be able to write efficient codes in programming languages and implement same in the software systems.
d. Syllabus
Unit-1 UNIT-I Contact Hours:15h
Introduction Concept of data and information, Introduction to Data Structures, Types of data structure: Linear and non-
linear data structures, operations on Data Structures, Algorithm complexity, Time-space trade-off, asymptotic
notations.
Arrays Basic terminology, Linear arrays and their representation, Traversing Linear Array, Insertion & Deletion in
arrays, searching – linear search, binary search, sorting – insertion sort , selection sort , bubble sort , merging
arrays & merge sort , complexity analysis of each algorithm, Multi-dimensional arrays and their
representation, Pointers; Pointer Arrays, Records; Record structure, representation of records in Memory,
Parallel Arrays, sparse matrices and their storage.
Linked List Linear linked list, Representation of Linked Lists in Memory, Traversing a linked list, searching a linked list,
insertion in and deletion from linked list, Header Linked List, doubly linked list, Operations on doubly linked
list, complexity analysis of each algorithm, Application of linked lists.
Unit-2 UNIT-II Contact Hours:15h
Stacks Basic terminology, Sequential and linked representations, Operations on stacks: PUSH & POP, Application of
stacks: Parenthesis matching, evaluation of postfix expressions, conversion from infix to postfix
representation, Quick Sort and its complexity analysis.
Queues Linear queue, Sequential and linked representation of Linear queue, Circular queue, Operations on queues,
Dequeues, Priority queue.
Graphs Graph Theory terminology, sequential representation of graphs using adjacency matrix and Path Matrix,
Traversing a graph using BFS and DFS, Operations on Graph, Minimum Spanning Tree
Unit-3 UNIT-III Contact Hours:15h
Trees Basic terminology, Binary Trees, Representation of Binary Trees in Memory, traversing Binary Trees, Traversal
Algorithms using stacks, Header Nodes; Threads, Binary Search trees, Searching, Inserting & Deleting in Binary
Search Trees, AVL Search trees, B/B+ Trees, Heap & Heap Sort.
Hashing Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.
File Organization Concepts of files, Organization of records into Blocks, File organization: Sequential, Relative, Index Sequential,
Inverted File.

1. Lipschutz, Seymour, “Data Structures”, Schaum's Outline Series, Tata McGraw Hill.
2. Gilberg/Forouzan, “Data Structure with C” ,Cengage Learning.
3. Augenstein,Moshe J , Tanenbaum, Aaron M, “Data Structures using C and C++”, Prentice Hall of India.

Theory
Marks 40 60
Total Marks 100


assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 1 3 2 3
CO2 3 3 2 2 3 1 3
CO3 3 2 3 3 3 3 3 2

2 Computer Organization & Architecture 3 0 0 0 3 3 CR
21CST—212/ 21CST—212/21ITT-212
21ITT-212
PRE-REQUISITE 21ELT-111
The course will give the knowledge about the different hardware components of computer systems and the internal working of these hardware
components.
• To get familiarized with the architecture of a processor.
• To get a good understanding of various functional units of computer.
• To understand the design of a basic computer system.
c. Course Outcomes
CO1 Students will be able to understand the operation of electronic logic elements.
CO2 Students will be able to understand the organization of a computer system in terms of its main components
CO3 Students will be able to understand different processor architectures
CO4 Students will be able to understand input/output mechanisms
CO5 Students will be able to understand the various parts of a system memory hierarchy
CO6 Students will have practical experience of prototyping digital circuits
CO7 Students will be able to interface digital circuits to microprocessor systems
d. Syllabus
Basic concepts Digital computer with its block diagram, CPU, memory, input-output subsystems, control unit, System bus
organization, Machine language program execution – instruction cycles, machine cycles and bus cycles;
Overview of memory and I/O addressing. computer hardware components - ALU, registers, memory, system
bus structure-data, address and control bus.
Instruction Set Levels of programming Languages, Assembly Language Instructions: instruction cycle, instruction
Architecture types, addressing modes, Operations in the instruction set; Arithmetic and Logical, Data Transfer,
Control Flow; Instruction set formats.
Computer Organization CPU organization, Memory Subsystem Organization: Types of memory, Internal Chip Organization.
Design of control Unit Hardwired control unit, Micro-Programmed control unit and comparative study.
Memory Organization Memory hierarchy, Cache Memory, Associative Memory, cache size vs block size, mapping functions,
replacement algorithms, write policy, basic optimization techniques in cache memory, Cache memory with
associative memory, Virtual Memory: Paging, Segmentation
Input / Output Asynchronous Data transfer: Source Initiated, Destination Initiated, Handshaking, Programmed I/O, Interrupts
Organization DMA, and IOP.

Introduction to parallel Parallelism in uni-processor system, Flynn’s Classification, concept of pipelining, pipeline hazards, Instruction
processing Pipeline, Amdahl’s Law, Throughput and Speedup, Comparison of CISC vs RISC architectures.
Microprocessors Characteristics of multiprocessors, Uniform and non-uniform memory access multi processors, various
interconnection networks, Tiled chip multicore processors.
Textbooks:
1. Carpinelli J.D,” Computer systems organization &Architecture”, Fourth Edition, Addison Wesley.
2. Patterson and Hennessy, “Computer Architecture”, Fifth Edition MorgaonKauffman.
REFERENCE BOOKS:

1. J.P. Hayes, “Computer Architecture and Organization”, ThirdEdition.
2. Mano, M., “Computer System Architecture”, Third Edition, PrenticeHall.
3. Stallings, W., “Computer Organization and Architecture”, Eighth Edition, Pearson Education.

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
Quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 2 3 3 2 3
CO2 3 2 3 3 2 3
CO3 3 2 3 3 2 3
CO4 3 1 2 2 2 1 2
CO5 3 1 2 2 2 1 2
CO6 3 1 2 2 2 1 2
CO7 3 1 2 2 2 1 2

3 Database Management Systems 3 0 0 0 3 3 CR
21CST-214/ 21CST-214/21ITT-214
21ITT-214
CO-REQUISITE 21CST-211 , 21SMT-216, 21CST-218,21CSP-215
In this background the course examines data structures, file organizations, concepts and principles of DBMS's, data
analysis, database design, data modeling, database management, data & query optimization, and database implementation.
• To have good understanding of database system concepts and design databases for different applications.
• To learn how to use a DBMS and RDBMS.
• To implement and understand different types of DDL, DML and DCL statements.
• To understand transaction concepts related to databases and recovery/backup techniques required for the proper storage of data.
c. Course Outcomes
CO1 Be familiar with a commercial relational database system (Oracle) by writing SQL using the system.
CO2 Be familiar with the relational database theory, and be able to write relational algebra expressions for queries
CO3 Be familiar with basic database storage structures and access techniques: file and page organizations, indexing methods including
B‐tree, and hashing.
CO4 Be familiar with the basic issues of transaction processing and concurrency control.
d. Syllabus
Unit-1 UNIT-1 Contact Hours:
Overview of Databases Database concepts, DBMS, Data Base System Architecture (Three Level
ANSI-SPARC Architecture), Advantages and Disadvantages of DBMS, Data Independence, DBA and
Responsibilities of DBA, Relational Data Structure, Keys, Relations, Attributes, Schema and Instances,
Referential integrity, Entity integrity.
Data Models Relational Model, Network Model, Hierarchical Model, ER Model: Design, issues, Mapping constraints, ER
diagram, Comparison of Models.
Relational Algebra & Introduction, Syntax, Semantics, Additional operators, Grouping and Ungrouping, Relational comparisons,
Relational Calculus Tuple Calculus, Domain Calculus, Calculus Vs Algebra, Computational capabilities.
Unit-2 UNIT-II Contact Hours:
Functional dependencies Functional dependencies, Decomposition, Full Functional Dependency (FFD), Transitive Dependency (TD), Join
and Normalization Dependency (JD), Multi- valued Dependency (MVD), Normal Forms (1NF, 2NF, 3NF, BCNF), De-normalization.
Database Security Introduction, Threats, Counter Measures.
Control Structures Introduction to conditional control, Iterative control and sequential control statements, Cursors, Views.
Unit-3 UNIT-III Contact Hours:
Package, Procedures and Parts of procedures, Parameter modes, Advantages of procedures, Syntax for creating triggers, Types of
Triggers triggers, package specification and package body, developing a package, Bodiless package, Advantages of
packages.
Transaction Management Introduction to Transaction Processing, Properties of Transactions, Serializability and Recoverability, Need for
and Concurrency Control Concurrency Control, Locking Techniques, Time Stamping Methods, Optimistic Techniques and Granularity of
Data items.
Database Recovery of Introduction, Need for Recovery, Types of errors, Recovery Techniques.
database
Textbooks:
1. RamezElmasri and Shamkant B. Navathe, “Fundamentals of Database System”, The Benjamin Cummings Publishing Co.
2. Korth and Silberschatz Abraham, “Database System Concepts”, McGraw Hall.

3. Pratt,” DBMS”, Cengage Learning.
Reference Books:
1. C. J. Date, “An Introduction to Database Systems”, Addison Wesley.

2. Thomas M. Connolly, Carolyn & E. Begg, “Database Systems: A Practical Approach to Design, Implementation and Management”, 5/E,
University of Paisley, Addison-Wesley.
3. Rob,” Database Principal Fundamental Design, Cengage Learning.

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 2
CO2 3 3 3 3 3 2
CO3 3 2 3 2 2 3 3 2
CO4 3 2 3 2 2 3 3 2

4 Numerical & Optimization Techniques 3 1 0 0 4 4 CR
21SMT-216 21SMT-216
PRE-REQUISITE Basic Knowledge of Mathematics and Statistics
CO-REQUISITE
ANTI-REQUISITE
The subject will give the strength to the student to analyze the data and mine the hidden information in the form of various facts.
• Understand and able to solve the problems related to Optimization Techniques and their applications.
• Solve the problems related to Dual LPP, transportation and assignment problems, and Non-linear Programs and their applications.
• Solve the problem related to Dynamic Programming, Integer and Stochastic Programming.
c. Course Outcomes
CO1 Students will be able to design a new, better, more efficient and less expensive systems in engineering is an optimization problem.
CO2 Students will be able to develop more efficient and robust algorithms for solving optimization problems in different areas of
Engineering, Sciences, Management.
CO3 Students will be able to make decisions in this complex world in every sphere of real-life situations.
d. Syllabus
Unit-1 UNIT-I Contact Hours:
Introduction to Engineering application of optimization, statement and classification of optimization problems, optimization
Optimization and techniques. Single variable optimization, multi variable optimization with no constraint’s multivariable
Techniques optimization with equality and inequality constraints.
Linear Programming Introduction and formulation of models, Convexity, Simplex method, Big-M method, Two-phase method,
Degeneracy and unbounded solutions.
Dual Linear Programming Duality in LPP, dual simplex method, transportation and assignment problems, traveling salesman problem
Non-linear Programming Introduction, unimodes function, elimination methods, unrestricted search, quadratic and cubic interpolation
methods, Direct root method, Direct and Random Search method, The simplex method, Steepest Descent
method, Conjugate gradients method and Gauss-newton method.
Dynamic Programming Stage space, recursive optimization, Principle of optimality.
Integer and Stochastic Introduction to Integer linear programming, Knapsack problem, linear 0-1 problem, Methods for solving
Programming integer linear programming problems, stochastic linear programming, Quadratic programming separable
programming
1. Bazaraa, M.S., Sherali, H.D., Shetty, C.M., Nonlinear Programming: Theoryandalgorithms, 3rd Edition, John Wiley and Sons.
2. N.S. Kamboo, „Mathematical Programming Techniques, 4thEdition, McgrawHill
3. Bazaraa, M.S., Jarvis, J.J., and Sherali, H.D ‘Linear Programming and Network flows’ 2nd Edition, John Wiley and Sons.
4. Grewal, B.S ‘Numerical Methods with programs in C and C++’ Ist Edition, Khanna Publishers.
5. Sinha, S.M. ‘Mathematical Programming Theory and Methods’ Ist Edition, Elsevier.

Theory
Marks 40 60

Total Marks 100

assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 1 1 3 2 3
CO2 3 3 3 1 1 3 2 3
CO3 3 3 3 1 1 3 2 3

5 Aptitude 0 2 0 0 2 2 <UC/PE/PC/MNG>
21TDT-202 21TDT-202
ANTI-REQUISITE 21TDY-302
1. To speed up mathematical calculations.
2. Enhancing number system in details with application.
3. Concept building up of arithmetic with percentages.
4. Analytical and logical thinking and the habit of drawing conclusions based on quantitative information.
5. Understand the basic rules of logic, including critical thinking
6. Data analyzing techniques
7. Apply mathematical methodologies to open-ended real-world problems
8. mathematical analysis, and formulate mathematical models of such problems
To generate problem solving skills, counting techniques, ability to analyze the situation, demonstrate various principles involved in solving
mathematical problems and thereby reducing the time taken for performing job functions with logical thinking and applying decision making in
all national and international projects.
c. Course Outcomes
CO1 To build up basic knowledge of Numbers, building base of arithmetic via percentage and its applications.
CO2 To build the approach for logical reasoning.
CO3 To improve arithmetic concepts of work, time and efficiency, speed and distance & use of proportionality in work problems, to
improve counting techniques with concepts of permutations-combinations.
d. Syllabus
Unit-1 Unit-I Contact Hours:
Vedic Math and Number • Mental Calculations
System • How to find squares and square root.
• Approximations
• How to solve tough calculations
• Number Chart: Real numbers, Imaginary numbers, Rational numbers, Irrational numbers, Integers,
Whole numbers & Natural numbers, Prime and composite numbers.
• Divisibility Rules (2 to 13)
Percentages and Profit & • Concept of percentages
Loss • Concept of percentage increase and percentage decrease
• Concept of successive percentages
• Concepts of cost price, selling price and marked price
• Fundamentals of profit, loss and discounts
• Fundamental problems based on above concepts.
• Complex problems based on above concepts
Simple & Compound • Concept of simple & compound interest
• Fundamental problems on it.
Interest
Unit-2 Unit –II Contact Hours:
Syllogism and Coding- • Concept of Venn Diagram
Decoding • How to draw conclusions using the available information.
• Basic problems on above mentioned concepts.
• Concept of EJOTY to learn alphabet.
• Letter Coding
• Number Coding
• Substitution Coding
• Mixed Letter and Number Coding
• How to solve abstract problems.
Direction Sense • Concept of left & right turn (direction).

• Clock & anticlockwise movement with East, West, North and South direction.
• Basic problems based on above concepts.
• Complex problems based on above concepts.
Data Interpretation Analyze data in:
• Tabular Representation
• Line Graph

• Bar Graph
• Miscellaneous
Unit-3 Unit – III Contact Hours
Average and Time & Work • Concept of Mean.
• Different type of mean – Arithmetic, Geometric and Harmonic
• Application of means while taking averages in different types of questions.
• Concept of time and work
• Basic problems based on above using LCM method.
• Basic work problems based on efficiency of manpower.
Time, Speed & Distance • Basic concept and relationship between time, speed and distance
• Questions based on average speed, relative speed.
and Permutations &
• Concept of arrangement & selection
Combinations • Concept of AND vs. OR
• Basic problems based on the above.
Probability • Concept of sample space and favorable outcomes.
• Finding probability of independent and dependent events.
• Basic problems on probability of coins, dice, cards and balls

T1 CU-DCDP Aptitude Book- Engineering 2nd year
R1 Aptitude by R. S. Aggarwal
R2 Verbal & Non-Verbal Reasoning by Dr. R. S. Aggarwal
R3 Quantum CAT by Arihant Publications

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 2 2 2 3 2 3
CO2 3 3 2 2 2 2 3 2 3
CO3 3 3 2 2 2 2 3 2 3

6 Object Oriented Programming using Java 2 0 0 0 2 2 CR
21CST-218/ 21ITT- 21CST-218/ 21ITT-218
218
PRE-REQUISITE 21CST-111,21CST-151
CO-REQUISITE 21CST-211,21CST-214, 21SMT-216,21CSP-215
The subject is providing understanding to the students to learn and use the concepts of object oriented programming such as classes, objects,
inheritance, polymorphism etc.
• To understand the concepts of object oriented, event driven and concurrent programming paradigms and develop these skills using java.
• To be able to work on projects using java database connectivity.
c. Course Outcomes
CO1 Students will be able to implements the concepts of Object Oriented Programming Language.
CO2 Students will learn to implement the concept of Exception Handling and Multi-Threading.
CO3 Students were able to work on GUI and database connectivity.
d. Syllabus
Java Fundamentals Features of Java, OOPs concepts, Java virtual machine, Reflection byte codes, Byte code interpretation, Data
types, variable, arrays, expressions, operators, and control structures, Objects and classes.
Java Classes Abstract classes, Static classes, Inner classes, Packages, Wrapper classes, Interfaces, This, Super, Access
control.
Exception Handling Exception as objects, Exception Hierarchy, try catch finally, throw, throws.
IO package Input streams, Output streams, Object serialization, De-serialization, Sample programs on IO files, Filter and
pipe streams.
Multi-threading Thread Life cycle, Multi-threading advantages and issues, Simple thread program, Thread synchronization.
<Chapter Name 3>
GUI Introduction to AWT programming, Layout and component managers, Event handling, Applet class, Applet
life-cycle, Passing parameters embedding in HTML, Swing components – JApplet, JButton, JFrame, etc.,
Sample swing programs.
Database Connectivity JDBC architecture, establishing connectivity and working with connection interface, working with statements.
<Chapter Name 3>

1. Balaguruswamy, Java.
2. A Primer, E.Balaguruswamy, Programming with Java, Tata McGraw Hill Companies
3. John P. Flynt Thomson, Java Programming.
4. Ken Arnold Pearson, Java Programming Language.
5. Herbert schildt. TMH, The complete reference JAVA2.
6. Cay Horstmann 2nd edition, Big Java, Wiley India Edition.
7. Dietel and Dietel, Core Java.
8. Ivan Bayross SPD, Java server programming.

Theory
Marks 40 60
Total Marks 100


assignment
each test
As applicable to
quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 2 1 3 3 3 2
CO2 3 3 3 2 2 1 3 3 3 2
CO3 3 3 3 2 2 1 3 3 3 2

SN Course TITLE OF THE COURSE L T P S C CH Course Type*
7 Code Data Structures Lab 0 0 4 0 2 4 CR
21CSP-212/ 21CSP-212/ 21ITP-212
21ITP-212
PRE-REQUISITE 21CSP-112,21CSP-152
Subject provides the practical knowledge of the different data structures by implementing the code for different operations
• To implement various data structure and operations on them using C++.
• To implement various sorting and searching algorithms using C++.
• To code and debug the errors in the code.
c. Course Outcomes
CO1 Students will be able to design and apply appropriate data structure using simple algorithms for modeling and solving given
computing problems.
CO2 Students will be able to understand and implement the both array based and linked-list based data structures, including singly,
doubly, and circular linked-lists.
CO3 Students will be able to understand and implement the stack data structure and stack operations.
d. Syllabus
Experiment-1 Write a menu driven program that implement following operations (using separate functions) on a linear array:
a) Insert a new element at end as well as at a given position.
b) Delete an element from a given whose value is given or whose position is given.
c) To find the location of a given element.
d) To display the elements of the linear array.
Experiment-2 Write a program to demonstrate the use of linear and binary search to find a given element in an array.
Experiment-3 Write a menu driven program that maintains a linear linked list whose elements are stored in on ascending order
and implements the following operations (using separate functions):
a) Insert a new element
b) Delete an existing element
c) Search an element
d) Display all the elements
Experiment-4 Write a program to sort an array of integers in ascending/descending order using
a) Bubble Sort.
b) Quick Sort
Experiment-5 Write a program to sort an array of integers in ascending/descending order using
a) Merge Sort.
b) Insertion Sort.
Experiment-6 Write a program to demonstrate the use of stack (Implemented using linear array) in converting arithmetic
expression from infix notation to postfix notation.
Experiment-7 Write a program to demonstrate the implementation of various operations on a linear queue and circular
represented using a linear array.
< Experiment No4>

Experiment-8 Write a program to demonstrate the implementation of various operations on a queue represented using a linear
linked list (linked queue).
Experiment-9 Write a program to illustrate the implementation of different operations on a binary search tree.
Experiment-10 Write a program to illustrate the traversal of graph using
a) Breadth-first search.
b) Depth-first search.

4. Lipschutz, Seymour, “Data Structures”, Schaum's Outline Series, Tata McGraw Hill.
5. Gilberg/Forouzan, “Data Structure with C” ,Cengage Learning.
6. Augenstein,Moshe J , Tanenbaum, Aaron M, “Data Structures using C and C++”, Prentice Hall of India.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 2 3 2 3 2 3 2
CO2 3 2 3 2 3 2 3 2
CO3 3 2 3 2 3 2 3 2

8 Code Database Management Systems Lab 0 0 2 0 1 2 CR
21CSP-215 21CSP-215 /21ITP-215
/21ITP-215
CO-REQUISITE 21CST-211,21CST-214, 21SMT-216
Student will be able to run the different kind of database queries to retrieve the desired information.
• To enable students to retrieve and update data from relational databases.
• To implement programs using procedural language structure.

• To have good understanding of implementation and use of cursors, procedures, packages, triggers etc.
c. Course Outcomes
CO1 Brief knowledge about SQL Fundamentals.
CO2 Unary & Binary table operations.
CO3 Able to handle with different Data Base languages.
CO4 Table View, Log & Triggers.
d. Syllabus
Experiment-1 To implement different types of DDL, DML, DCL queries.

Experiment-2 To explore “SELECT” clause using where, order by, between, like, group by, having etc.
Experiment-3 Introduction and implementation of programs usingBlock Structure and Variables.
Experiment-4 To write programs using control structures ofIf-else statements.
Experiment-5 To write programs using loops like

i. For
ii. Do-while
iii. While
iv. Curser
v. views
Experiment-6 Introduction and implementation of programs of

a. Procedures
b. Packages
c. Triggers
Text Books:
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database System”, The Benjamin / Cummings Publishing Co.
2. Korth and Silberschatz Abraham, “Database System Concepts”, McGraw Hall.
3. Pratt,” DBMS”, Cengage Learning.
Reference Books:
1. C.J.Date, “An Introduction to Database Systems”, Addison Wesley.
2. Thomas M. Connolly, Carolyn & E. Begg, “Database Systems: A Practical Approach to Design, Implementation and Management”,
5/E, University of Paisley, Addison-Wesley.
3. Rob,” Database Principal Fundamental Design, Cengage Learning.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 2
CO2 3 3 3 2 2
CO3 3 3 3 2 2
CO4 3 3 3 2 2

9 Code Object Oriented Programming Using Java Lab 0 0 2 0 1 2 CR
21CSP-219 21CSP-219 /21ITP-219
/21ITP-219
Subject will clear the various concerns like Operator overloading , Inheritance etc.
• To implement programs in java.
• To enable students to retrieve and update data from relational databases using JDBC.
c. Course Outcomes
CO1 The students will learn to write, compiling & execute basic java program.
CO2 The student will learn the use of data types & variables, decision control structures: if, nested if etc.
CO3 The student will learn the use loop control structures: do, while, for etc.
CO4 The student will be able to create classes and objects and use them in their program.
d. Syllabus
Experiment-1 Write a program to study different types of constructors in java.
Experiment-2 Write a program to create classes and use of different types of methods.
Experiment-3 Program to learn different types of inheritance in java.
Experiment-4 Write program to study access modifiers in java using packages.

Experiment-5 Write program to differentiate between method overloading and method overriding.
Experiment-6 Create an interface and design a class to implement an interface.
Experiment-7 Write a program to read and write data to a file

Experiment-8 Write a program to read and write an object to file.
Experiment-9 Write a program to handle an exception using try, catch and throw.
Experiment-10 Write a program to insert values in a table at run time using JDBC.
Text books:
1. Herbert Schildt, Java : The Complete Reference, 9th Edition, Oracle Press.
2. Gary Cornell, Core Java Volume II Advanced Features, 8th Edition, Pearson Education.
3. Jim Keogh, J2ee : Complete Reference, 1st Edition, Tata McGraw Hill.
Reference books:
1. James Gosling, Ken Arnold and David Holmes, Java Programming Language, 5th Edition, Pearson Education.
2. Gary Cornell, Core Java Volume I, 3rd Edition, Pearson Education.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 2 2 1 3 2 3
CO2 3 2 2 1 3 2 3
CO3 3 2 2 1 3 2 3
CO4 3 2 2 1 3 2 3

10 Code Introduction to Management and Leadership 2 0 0 0 2 2 UC
21UCT-221 21UCT-221
PRE-REQUISITE 21PCT-154
ANTI-REQUISITE 21CSY-BBB
Subject will clear the various concerns about management and leadership skills in the students and present different scenarios in front of students
to take managerial level decisions.
• To learn the basics of management and study its principles and functions.
• To study concept of operational aspects of management and management ethics.
• To understand concept of Leadership and its theories.
c. Course Outcomes
CO1
Student will be able to appreciate & implement the concept of management in their personal & professional life.
CO2
Student will learn about operational aspects of management and management ethics.
CO3
Students will study the concept of leadership and its theories and apply the concepts in their professions.
d. Syllabus
Introduction to Nature of Management, Importance of Management, Concepts of Management, The history and streams of
Management management, the general and technical environment in management and the business strategy
Strategic Management Introduction to strategic management: The strategies, process, vision, mission and goal setting. External and
Internal analysis.

Leadership Foundations Introduction to Leadership styles, Great Man theory, Trait theory, Behavioral Theory, Contingency,
and Theories Transformational and Transactional leadership theory.
Group Dynamics and Leadership in Complex group and Organization: Being in Communities, Renewing group organization and
Teams communities, Understanding the change and strategies for change.
MBTI Myers Brigg Type Indicator.

Organizing People, Project Leading Teams, Managing Human Resource Systems, Managing Individual and Diverse Systems
and Process
Control Function of control, Cycle of Control and Control in the process of organizing
TEXT BOOKS:
1. Management Theory and Practice: Gerald A Cole, Cengage Learning EMEA Higher Education
2. Management Theory and Practice, Chandan, J.S, Vikas Publications, 1987
REFERENCE BOOKS:
1. Management Theory, Sheldrake John, Published Intl Thomson Business Pre 1966
2. Introduction to Leadership: Concepts and Practise, Northouse. G. Peter, SagePublications.
3. Reframing Organizations: Artistry, Choice and Leadership, Bolman. G. Lee.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 3 2 1 3 1 2
CO2 2 3 2 1 3 1 2
CO3 2 3 2 1 3 1 2

11 Life Skills and Mentoring: MNG 0 1 0 0 1 1 CR
21UCY-246 21UCY-246
The course will help students to enhance the skills for positive self-concepts and maximize students' full potential and personal
development by: teaching a variety of practical skills required for everyday living; improving social skills; strengthening community
connections and knowledge.
• Personal Self-Management Skills – Enabling Student to Learn and demonstrate a set of practical skills such as time management, self-
management, handling conflicts. Students to develop skills of effective decision making. Develop and nurture a deep understanding of
personal motivation
• General Social Skills: Students understand the consequences and the influences of the media.
• Value Inculcation: Understanding and developing value education towards nation and global. Realize their potential as human beings
and count themselves properly in the ways of the world.
c. Course Outcomes
CO1 Acquisition and application of life skills can influence the way as individual feels about others
CO2 Living life fully and productively requires acquiring and mastering life skills
CO3 It helps students to know and understand themselves better, to live life more consciously and deliberately, attain personal
satisfaction, fulfillment and growth
CO4 It will enhance productivity, efficiency, self-esteem and self confidence
CO5 It improve inter personal relations, helps solve problems, face challenges and tackle unforeseen contingencies with equanimity and
presence of mind
CO6 It Helps maintain good physical and mental health and capacity for happy living and putting leisure time to good use
CO7 It lessens violent behavior, increase self-control and sociability, improves classroom behavior, better handling of interpersonal
problems and coping with anxiety
CO8 It equips adolescents with using head, hand and heart
CO9 It promotes adaptability and adjustability among adolescents
d. Syllabus
Unit-1 UNIT-1 Contact Hours: 4h
Self-Motivation Definition of self-Motivation, Steps to motivate yourself, helping students to bolster their own motivation.
Resilience-Mental Understanding of resilience, Characteristics of a resilient person, How to become more resilient, Benefits of
Toughness resiliency
Decision making Understanding of decision making, Effective decision making, Process of decision making.
Unit-2 UNIT-II Contact Hours: 4h
The media and health Content Analysis of media techniques, comparing media messages to previous Knowledge, oral presentations
and project.
Conflict Management Understanding Conflict Management, Strategies to avoid Conflicts, Tips for Managing Conflict.
Giving Talk about your feelings when you give, how you feel when you make charitable contributions or buy things
for those in need. Do you feel proud, helpful, kind, or generous? Does it make you feel good that you can
make a difference in other people’s lives?
Humility Understanding Humility, importance of humility, why does humility matters, developing and cultivating
humility.
Unit-3 UNIT-III Contact Hours: 4h
Problem solving Problem solving: nature and scope, process of developing problem solving skill, development of interventions.
Time Management Understanding Time Management, Awareness of time wasters, Tips for Time Management, Benefits of Time
Management.

Value Education towards Constitutional or national values - Democracy, socialism, secularism, equality, justice, liberty, freedom and
nation and global fraternity. Social Values, Professional Values, Religious Values, Aesthetic values.
development
Textbooks
1 Mentoring Programme Handbook, Chandigarh University, 2019
REFERENCE BOOKS
1 Daniel Goleman (2012). Working with Emotional Intelligence. Bloomsbury Publishing India Private Limited
WEB RESOURCES

Theory
Marks 40 60
Total Marks 100

assignment
each test
Quiz As applicable to
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 3 2 3 2 1
CO2 2 3 2 3 2 1
CO3 2 3 2 3 2 1
CO4 2 3 2 3 2 1
CO5 2 3 2 3 2 1
CO6 2 3 2 3 2 1
CO7 2 3 2 3 2 1
CO8 2 3 2 3 2 1
CO9 2 3 2 3 2 1

12 Entrepreneurship 0 0 0 2 1 0 UC
21UCH-249 21UCH-249
PRE-REQUISITE 21PCP-154
ANTI-REQUISITE 21CSY-BBB
The course attempts to create understanding about the various aspects of the Entrepreneurial challenges and start-up basic elements. Tasks will help
students to build the practical approach towards the entrepreneurial world. This course will make students able to create the business ideas will also help
to set up their own startups.
• Introduce the students to the defining characteristics of an entrepreneur.
• Familiarize students with the Regulatory provisions essential for an entrepreneur.
• Introduce the students to concepts related to Strategy, Finance and Planning essential for an entrepreneur to take into consideration for
conceiving and launching an enterprise.
• Impart knowledge about Institutional Support available for financing an enterprise.
c. Course Outcomes
CO1 Understanding the concept of Entrepreneur and process models.
CO2 Understanding of different regulations related to an Entrepreneur.
CO3 Broad understanding of Institutional support available to an Entrepreneur.
d. Syllabus
Unit-1 UNIT-1: Introduction and planning stage Contact Hours:
Introduction Entrepreneurship, Role of Entrepreneurship, Scope and Importance of Entrepreneurship, Introduction to new
Venture, Opportunities and challenges.
IDEA GENERATION SWOT analysis, New and Existing Product and Services, Franchising and its benefits.
Unit-2 UNIT-II: Implementation stage Contact Hours:
BUSINESS PLAN Value Propositions, Customer segments, Channels, Customer relation, Revenue streams, Key resources,
DEVELOPMENT Partners, Activities, Costs
SOURCES FOR START-UP Financial Analysis/Project estimation cost, Financial institution, loans etc.
REGISTRATION PROCESS: Government policies and prospects.
Unit-3 UNIT-III: Sustainability and growth Contact Hours:
Selling plan, Vendor Management, Branding and Advertising, Business Growth, Social effect of business and
its eco-friendliness.
Textbooks
1. Dr. K.C. Sharma,(2012) Entrepreneurship Development, JAIN PUBLICATIONS.
REFERENCE BOOKS
1. Entrepreneurial Development and Small Business Management” by Dr P T Vijayashree& M Alagammai
2. “Entrepreneurial Development” by Khanka S S.
3. “Dynamics of Entrepreneurial Development and Management” by V Desai
4. Entrepreneurship Development by G.P.Prasain(2015), McGraw Hill Publications.
5. Entrepreneurship Development and Management by Dr. A K Singh (2006), Modern Publishers

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 3 3 2
CO2 2 3 3 2
CO3 2 3 3 2

13 Institutional/Summer Training: MNG 0 2 0 0 2 2 <MNG>
21CSY-225 21CSY-225
PRE-REQUISITE 21CST-111, 21CSP-112,21ECP-114, 21ECP-118
CO-REQUISITE 21CSP-212, 21CSP-215, 21CSP-219
f. Course Description: Conducted in a university campus setting with involvement in real projects for a minimum of four weeks (20 working days).
Application of knowledge and skills to solve engineering problems related to computer systems in the real-world. Familiarization with professional
and ethical responsibility while working in multidisciplinary teams. Understanding the impact of engineering solutions in a global, economic,
environmental and societal context. Learning to find relevant resources to access information. Observation of the use of contemporary tools,
techniques, standards and methods. Preparing technical documentation.
g. Course Objectives: Upon successful completion, students will have the knowledge and skills to:
1) To provide comprehensive learning platform to students where they can enhance their programming skills.
2) To enhance students’ knowledge in basic programming/technology.
3) To Increase self-confidence of students and helps in finding their own proficiency
4) To cultivate student’s leadership ability and responsibility to perform or execute the given task.
5) To provide learners hands on practice to find solution to real world engineering problem.
h. Course Outcomes
CO1 Capability to acquire and apply fundamental principles of engineering.
CO2 Get exposure of various specialized technologies.

CO3 Ability to identify, formulate and model problems and find engineering solution based on a systems approach.
i. Textbooks / Reference Books :

a. Let Us C: authentic guide to C programming language, 17th Edition, BPB publications.
b. Object-Oriented programming with E. Balagurusamy, 8th Edition, Mc Graw Hill Education.
c. Java - The Complete Reference, by Herbert Schildt, 10th Edition, Mc Graw Hill Education.
d. HTML & CSS: The Complete Reference, Thomas A. Powell, 5th Edition, Mc Graw Hill Education.

Theory
Marks 60 40
Total Marks 100
Internal Evaluation Component

S. No. Type of Assessment Weightage of actual Frequency of Final Weightage in Internal Remarks
conduct Task Assessment (Graded/Non-
Graded)
1 Assignment/Worksheet 20 3 20 Graded
2 Presentation /viva voce 20 1 20 Graded
3 Quiz/Test 10 1 10 Graded
4 Report 10 1 10 Graded
f. CO-PO Mapping
Course
Outcome
CO1 3 2 3 3 - - - 2 2 3 - 3 3 3

CO2 3 2 3 3 - - - 2 2 3 - 3 3 3
CO3 3 2 3 3 - - - 2 2 3 - 3 3 3

Semester-4

Type
1 21TDP-251 Soft Skills CR 0 0 2 0 1 2 40 60 100
2 21CST-252 Microprocessor & 3 0 0 0 3 3 40 60 100

CR
Interfacing
3 21CST-254 Software Engineering CR 3 0 0 0 3 3 40 60 100
4 21CST-256 Computer Networks CR 3 0 0 0 3 3 40 60 100
5 21CST-258 Principles of Artificial 3 0 0 0 3 3 40 60 100

CR
Intelligence
6 21CSP-259 Programming in Python 0 0 4 0 2 4 60 40 100

CR
Lab
7 21CSR-264 Project-I PR 0 0 1 3 2 4 60 40 100
8 21SMT-257 Probability and Statistics CR 3 1 0 0 4 4 40 60 100
9 21CSP-253 Microprocessor & 0 0 2 0 1 2 60 40 100

CR
Interfacing Lab
10 21CSP-255 Software Engineering Lab CR 0 0 2 0 1 2 60 40 100
11 21CSP-257 Computer Networks Lab CR 0 0 2 0 1 2 60 40 100
12 21CSY-BBB EMPLOYABILITY 1 0 0 0 1 1 40 60 100

ENHANCEMENT COURSES - MNG
MNG
13 21UCY-296 Life Skills and Mentoring : MNG 0 1 0 0 1 1 40 60 100

MNG
14 21UCY-295 Ethics and Gender Equality UC-MNG 1 0 0 0 1 1 40 60 100
TOTAL 16 1 13 3 25 34
EMPLOYABILITY ENHANCEMENT COURSES

Credits to be Earned: 01
Pre- Co-
SN Code Title L T P S C CH
requisite requisites
1 0 0 0
1 21CSY-261 Object Oriented Programming 1 1
1 0 0 0
2 21CSY-262 Data Structures & Algorithm Analysis 1 1
Data Base Management Systems & 1 0 0 0

3 21CSY-263 1 1
Computer Networks
Total 1 0 0 0 1 1

SN Course TITLE OF THE COURSE L T P S C CH Course Type
1 Code Soft Skills 0 0 2 0 1 2 CR
21TDP-251 21TDP-251
PRE-REQUISITE
CO-REQUISITE
ANTI-REQUISITE
a. COURSE DESCRIPTION:
The course focuses on the building and enhancing the basic soft skills required by the students to become employable and augm ent their
chances of securing a job while sharpening their communication skills. The course will focus on sharpening the spontaneity in the students
and build their confidence by effectively handling various situations related to individual and team performances. Various activities planned
in the course will also focus on augmenting fluency and listening skills of the students while deliberating on essential grammar, vocabulary,
and pronunciation.
b. COURSE OBJECTIVES:
The Course aims to:

1. impart soft skills practical knowledge to enable students enhance their communication skills and employability.
2. Work upon the students’ accent, pronunciation and MTI.
c. COURSE OUTCOMES:
CO1 To enhance the Creative Thinking and effective Presentation Skills of the students.
CO2 To build a learning attitude among students and enhance their general awareness about various categories to become
globally smart and be proficient in performing in group discussions.
CO3 To make students self-aware and interview ready.
d. Syllabus
Unit-1 (Name of the Unit) Contact Hours: 8.33
Hours
<Chapter Name 1> • Goal Setting
• Idea Generation Skills
• Group Discussions
• Strengthening Grammar
• Accent Neutralization
<Chapter Name 2>

<Chapter Name 3>
Hours
<Chapter Name 1> • Self Perlustration
• Abstract Topic Based Mock GDs
• Presentation Skills
• Effective Writing
• Verbal Wrangle
<Chapter Name 2>

<Chapter Name 3>
<Chapter Name 1> • Presentation Duo
• Personal Interview Basics
• Video Analysis
• LinkedIn Profiling and Blog Writing
• The Anchor Show
<Chapter Name 2>

<Chapter Name 3>
e. TEXT BOOKS:
T1 CU-DCDP Verbal Ability Book- Comprehending Verbal Ability for Success.
REFERENCE BOOKS:

R1 Edward de. Bono., Serious Creativity, Paperback
R2 James Webb Young, A Technique for Producing Ideas, Mc. Graw Hill
R3 Rashmi Bansal, Connecting the Dots, Westland Limited
f. Mode of Evaluation: The performance of students is evaluated as follows:
Practical
Components Continuous Internal Assessment (CAE) Semester End Examination (SEE)
Marks 60 40
Total Marks 100

2 Microprocessors and Interfacing 3 0 0 0 3 3 CR
21CST-252/ 21CST-252/21ITT-252
21ITT-252
CO-REQUISITE 21CST-254,21CST-256,21CST-258,21CSP-259,21UCT-213
This course provides an introduction to microprocessors, Study of microprocessor and its basic support components, including CPU architecture,
memory interfaces and management, coprocessor interfaces, bus concepts, serial I/O devices, and interrupt control devices.
• To understand the architecture, components, flags and instruction set of 8085 and8086.
• To design interfacing circuits using 8085 and8086.
• To gain familiarity with 8255(PPI), 8253(Programmable interval timer), 8259 (PIC), 8237(DMA) and advanced microprocessor chips.
c. Course Outcomes
CO1 Identify the basic element and functions of microprocessor.
CO2 Describe the architecture of microprocessor and its peripheral devices.
CO3 Demonstrate fundamental understanding on the operation between the microprocessor and its interfacing devices.
CO4 Apply the programming techniques in developing the assembly language program for microprocessor application.
d. Syllabus
Unit-1 Unit-I Contact Hours: 15h
Introduction Review of Hardwired Logic v/s Flexible Logic, Tri State Logic. Introduction to microprocessor, Difference
between microprocessor and microcomputer, Basic components of a microprocessor, system bus: address,
data and control buses.
8085 microprocessor Architecture, pin diagram, flags, addressing modes, instruction set and assembly language programming,
timing diagrams, interrupt structure of 8085.
Memory Interfacing Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.
Unit-2 Unit-II Contact Hours: 15h

Interfacing devices Architecture, Block Diagram, Control words, Modes and working of 8255. Architecture, Block Diagram and
working of 8251
8253 microprocessor Architecture, Block Diagram and working of 8253 Architecture, Block Diagram and working of 8259
Architecture
8237 microprocessor Block Diagram and working of 8237.
Unit-3 (Name of the Unit) Contact Hours: 15h
8086 Microprocessor Architecture, block diagram and pin diagram of 8086, operating modes of 8086, details of sub-blocks such as
EU, BIU; memory segmentation and physical address computations, program relocation, addressing modes.
Advanced Introduction to 80186, 80286, 80386, 80486, Pentium microprocessors.
microprocessors
<Chapter Name 3>
Textbooks:
1. Gaonkar, Ramesh S., “Microprocessor Architecture, Programming & Applications with 8085”, Wiley EasternLtd.
2. Ayala, “The 8086 Microprocessor: Programming & Interfacing the PC” , Cengage Learning.
3. Bhurchandi, K.M, Ray, A.K, “Advanced microprocessors and peripherals”,TMH.
4. Brey, “The Intel Microprocessors 8086- Pentium processor”, PHI.
5. Triebeland Singh, Avtar, “The 8088 & 8086 Microprocessors-Programming, interfacing, Hardware &Applications”,PHI
6. Liu, Yu-Chang &Gibson, Glenn A, “Microcomputer systems: The 8086/8088 Family: architecture, Programming & Design”, PHI.
7. Antonakos, James L., “The Pentium processor”, Pearson.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 2 3 3 2 3
CO2 3 2 3 3 2 3
CO3 3 2 3 3 2 3
CO4 3 2 3 3 2 3

3 Software Engineering 3 0 0 0 3 3 CR
21CST-254/ 21CST-254/ 21ITT-254
21ITT-254
CO-REQUISITE 21CST-256,21CST-258,21CSP-259,21UCT-213
This course is dealing with engineering principles and programming languages as they apply to software development. These principles include analyzing
user requirements and then designing, building, and testing software to satisfy those requirements.
• To study the concepts and methods required for the construction of large software intensive systems and to develop a broad understanding of the
discipline of software engineering.
• To learn basics of software design and interface designs.
• To learn concepts of software testing and maintenance.
c. Course Outcomes
CO1 Students will be able to learn how to apply the software engineering lifecycle by demonstrating competence in
communication, planning, analysis, design, construction, and deployment.
CO2 Students will be able to knowledge of software design and UI design.
CO3 Students will be able to implement the concepts of software project management.
CO4 Students will be able to apply testing guidelines.
CO5 Students will be able to apply the concepts of maintenance and quality requirements.
d. Syllabus
Unit-1 UNIT-I Contact Hours: 15h
Introduction Definition of software and Software engineering, Need of Software engineering, Difference between Program
and Product, Software development life cycle, Different life cycle models (waterfall, Iterative waterfall,
Prototype, Evolutionary and Spiral model), Agile software development and Their characteristics, V-Model.
Software requirements Requirement Analysis, Analysis principle, Software prototyping Specification, Characteristics and components
of SRS, Data modeling, Functional modeling and information flow, behavioral modeling, Mechanics of
structural modeling, Data dictionary.
Function and Object Structured analysis, Data flow diagrams, Basic object orientation concepts, Unified modeling language, Use
oriented design case model, Class diagrams, Interaction diagrams, Activity diagrams, State chart diagrams.
Software design Design process and concepts, Effective Modular design, the design model, Design documentation, Approaches
to Software design.
Software Project Software project planning, Project estimation techniques, COCOMO Model, Project scheduling, Risk analysis
management and management, Software quality and management, software configuration management.
User interface Design Characteristics of good user interface design, Command language user interface, Menu based, Direct
manipulation interfaces, Fundamentals of command based user interface.
Software Testing Software Testing Fundamentals, Strategic Approach to Software Testing, Validation Testing, System Testing,
Black-Box Testing, White-Box Testing and their type, Basis Path Testing,
Quality management Software quality, Software reliability, Software reviews, Formal technical reviews, Statistical SQA, Software
reliability, The ISO 9000 coding standards, SQA plan, SEICMM.
Software Maintenance Definition, Types of maintenance, Software reverse engineering, Different Maintenance models, Basic issue in
and Reuse any reuse program, Reuse approach

1. Pressman Rogers, “Software Engineering: A Practitioner's Approach”, Sixth edition.
2. Somerville Ian, “Software Engineering”, Addison Wesley, 8thEdition.
3. James FPeters and Pedryez Witold, “Software Engineering – An Engineering Approach”, Wiley Student Edition.
4. Kassem ,” Software Engineering”, Cengage Learning.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 2 2 3 2 2 3 3 3 3
CO2 3 2 2 3 2 2 3 3 3 3
CO3 3 2 2 3 2 2 3 3 3 3
CO4 3 2 2 3 2 2 3 3 3 3
CO5 3 2 2 3 2 2 3 3 3 3

4 Computer Networks 3 0 0 0 3 3 CR
21CST-256/ 21CST-256/ 21ITT-256
21ITT-256
ANTI-REQUISITE 21CST-352,21CST-352
The course include learning about computer network organization and implementation, obtaining a theoretical understanding of data communication
and computer networks, and gaining practical experience in installation, monitoring, and troubleshooting of current LAN systems.
• To understand Data Communication ,it’s components & network types

• To understand and Compare models, signals, multiplexing, switching & transmission media.
c. Course Outcomes
CO1 Successfully participate in higher level Data Communication and Networking classes
CO2 Troubleshoot simple Data Communication problems
CO3 Design moderately complex networks using appropriate network architectures and hardware.
CO4 To understand various network terminologies.
d. Syllabus
Introduction Introduction to network, types of transmission technologies, Network Categories: LAN, MAN, WAN (Wireless
/Wired), Network Software: Concept of Layers, Protocols, interfaces and services. Reference Models: OSI,
TCP/IP and comparison.
Physical Layer Bit rate, Baud rate, Bandwidth, Transmission Impairments: Attenuation, Distortion, Noise; Data rate limits:
Nyquist formula, Shannon Formula, Modulation & modems; Transmission Modes, Multiplexing: Frequency
Division, Time Division, Wavelength Division; Concept of Topologies, Transmission Media: Twisted pair,
coaxial, fiber optics, Wireless Transmission (radio, microwave & infrared);Message switching, Circuit Switching
& Packet Switching.
Data Link Layer Design issues, Error Detection & Correction; Flow control & Error Control; Sliding Window Protocols, ARQ:
Stop &Wait , Go Back n, Selective Repeat ; Examples of DLL protocols – HDLC, PPP; Medium Access Sub layer:
Channel Allocation; Random Access: ALOHA, CSMA protocols; Controlled Access: Polling, Reservation, Token
Passing; Examples of IEEE 802.2,802.3,802.4, 802.5,802.11standards.
Network Layer Design issues, Logical Addressing: IPv4 & IPv6; Packet Formats & their comparison IPv4 & IPv6; Routing
Algorithms: Distance Vector, Link State, Hierarchical, Super netting and sub Netting; Congestion Control:
Principles of congestion control; Congestion prevention policies, Leaky bucket & Token Bucket Algorithms.
Transport Layer Services provided to upper layers, Elements of Transport protocols. Addressing, Flow Control & buffering;
Example Transport protocols: TCP, SCTCP & UDP.
Application Layer Network security, Domain Name System, Simple Network Management Protocol, Electronic Mail, World Wide
Web.

a. Forouzan, Behrouz A.: “Data Communications & networking”, 4th edition Tata Mcgraw Hill.
b. Tanenbaum, Andrew S: “Computer networks”, 4th Edition, Pearson education.
c. Stallings, William : “Data and computer communications”, 8thedition, Pearson Education.
d. Ross, Kurose, “Computer Networking: A top downApproach”, 2nd edition, Pearson Education.
e. Coomer,Douglas E.: “Internet working with TCP/IP” , 2nd edition, Pearson Education
f. Dave ,” Computer Networks, Cengage Learning.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 1 3 2 3
CO2 3 3 2 1 3 2 3
CO3 3 3 2 1 3 2 3
CO4 3 3 2 1 3 2 3

5 Principles of Artificial Intelligence 3 0 0 0 3 3 CR
21CST-258/ 21CST-258/ 21ITT-258
21ITT-258
This course gives training on the skills required to become a successful AI Engineer. Throughout this exclusive Artificial Intelligence certification
online course, student will learn Deep Learning, Machine Learning, and the programming languages required to excel in this domain and kick-start
the career in Artificial Intelligence.
• To study the concepts of Artificial Intelligence
• Methods of solving problems using Artificial Intelligence
• Introduce the concepts of Expert Systems and machine learning.
d. Course Outcomes
CO1 History and knowledge about intelligence
CO2 To represent knowledge representation methods
CO3 Comprehend learning problems and various types of intelligent systems.
e. Syllabus
Introduction and Introduction, Importance of AI and Applications of AI.
Overview
Problem Solving Problem state spaces, problem characteristics, production system, Search space control: Uninformed search-
Techniques Depth first search, Breadth first search, Depth first search with iterative deepening, Heuristic search –Simple
Hill Climbing, Steepest ascent Hill Climbing, A* algorithm, AO* algorithm, Minimax search procedure for game
playing, Alpha beta cutoffs.
Knowledge Propositional and predicate logic, resolution in predicate logic, question answering, theorem proving.
Representation Semantic networks, Frames and scripts, conceptual graphs, conceptual dependencies.
Knowledge acquisition Types of learning, General learning models, learning Automata, Intelligent Editors, Learning by Induction
Introduction to Expert Systems, Pattern recognition, Natural Language Processing, Evolutionary algorithm, Fuzzy logic, Neural
Networks
Languages for AI Problem Introduction to Prolog- syntax and data structures, representing objects and relationships, built in predicates.
Solving Introduction to LISP- basic and intermediate LISP programming.
Machine Learning Strategic explanations —Why, Why not and how explanations. Learning—Machine learning, adaptive
learning. - Typical expert systems —MYCIN, PIP, INTERNIST, DART, XOON, Expert systems shells.
1. Rich E., Artificial Intelligence, Tata McGraw Hills.

2. George F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem Solving, Pearson Education Asia.
3. D.W. Patterson, Introduction to AI and Expert Systems, PHI.
4. N.J. Nilsson, Principles of Artificial Intelligence, Kaufmann, 1980.
5. Saroj Kaushik, Logic and Prolog Programming, NewAge International Publications.
6. PH. Winston, Artificial Intelligence, Addison Wesley

Theory
Marks 40 60
Total Marks 100


assignment
each test
As applicable to
quiz
course types

depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 3 3 3 3
CO2 3 3 3 2 3 3 3 3
CO3 3 3 3 2 3 3 3 3

6 Code Programming in Python Lab 0 0 4 0 2 4 CR
21CSP-259/ 21CSP-259/ 21ITP-259
21ITP-259
CO-REQUISITE 21CST-254,21CST-256,21CST-258 ,21UCT-213
Covers all the basics of programming in Python, as well as general computer programming concepts and techniques. The course also familiarizes the
student with object-oriented approach.
• To understand the concepts of object oriented and develop these skills using Python Programming.
• To be able to work on projects using File Handling.
c. Course Outcomes
CO1 Knowledge of the structure and model of the Python programming language
CO2 Use the Java programming language for various programming technologies
CO3 Develop software in the Java programming language, (application)
d. Syllabus
Unit-1 UNIT I Contact Hours:
<Experiment No 1> Writing python programs in various modes and printing and assigning values assigned to the variables.
< Experiment No 2> Program to demonstrate the use of if, if-else, while, for, break and continue
< Experiment No 3> Program to demonstrate the use o functions and passing different types of arguments to functions.
Unit-2 UNIT II Contact Hours:
< Experiment No 1> Program to demonstrate the various kind of operations that can be applied to the string.
< Experiment No 2> Program to demonstrate creation and accessing of lists and apply different kinds of operations on them.
< Experiment No 3> Program to demonstrate the use o functions and passing different types of arguments to functions.
< Experiment No4> Program to demonstrate creation and accessing of dictionary and apply different kinds of operations on them.
< Experiment No5> Program to implement various kinds of searching and sorting algorithms.
Unit-3 UNIT III Contact Hours:
< Experiment No 1> Program to implement concepts of Object Oriented Programming such as classes, inheritance and polymorphism.
< Experiment No 2> Program to demonstrate read and write data to the file in various modes.

Theory

Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 2 2 2 3 3
CO2 2 2 2 3 3
CO3 2 2 2 3 3

SN Code Project-I L T P S C CH Practical
7 0 0 1 3 2 4 PR
21CSR-264 21CSR-264
PRE-REQUISITE 21CSP-112, 21ECP-114, 21CST-151, 21CSP-152, 21CST-218, 21CSP-215,
21CSP-219
CO-REQUISITE 21CSP-259, 21CST-256, 21CST-254
ANTI-REQUISITE 21CST-258, 21CST-252, 21SMT-257
f. Course Description
Application of classroom knowledge and skills in computer science to solve real-world problems and to develop research and development skills.
g. Course Objectives
The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimized code preparation, systematic
documentation and other associated aspects of Software Development. The assessment would be through the project demonstration and the Project
Report, which should portray Programming Style, Structured Design, Minimum Coupling, High Cohesion, Good documentation of the code to ensure
readability and ease of maintenance.
1. Develop openness to new ideas in computer science, develop the ability to draw reasonable inferences from observations and learn to
formulate and solve new computer science problems using analytical and problem-solving skills;
2. Develop the ability to synthesize and integrate information and ideas, develop the ability to think creatively, develop the ability to think
holistically and develop the ability to distinguish between facts and opinion;
3. Develop the ability to work individually and as part of a team, develop a commitment to accurate work, develop management skills, improve
speaking and writing skills, improve the ability to follow directions, instructions and plans, and improve the ability to organize and use time
effectively;
4. Develop a commitment to personal achievement, the ability to work skilfully, informed understanding of the role of science and technology, a
lifelong love of learning, and cultivate a sense of responsibility for one's own behaviour and improve self-esteem/self-confidence.
h. Course Outcomes: Upon successful completion of this course students will be able to
CO1 Work on a project of latest topic / research area / industrial applications preferably using the tool or language learned in
previous or current semester.
CO2 Learn the standard procedures of project management and team management for the outcome based products.
CO3 Modeling of the solution for a real-time problem
CO4 Communicate efforts by developing manuals and other related project documents.
CO5 Create the product or idea as a solution for society as an outcome of the project.

Readings and references are project-specific, and will be determined by project groups, with approval of the instructor.

Practical
Marks 60 40
Total Marks 100

Sl No. Type of Assessment Weightage of actual Frequency of Final Weightage in Internal Remarks
Graded)
1 Project Proposal 5 1 5 Graded
Submission
2 Synopsis Submission 8 1 8 Graded
3 Project Design and 10 1 10 Graded
Modeling
4 Project Implementation 12 3 12 Graded
5 IEEE Paper/ Patent/ 5 2 5 Graded
H/w Product
6 Final Project 20 1 20 Graded
Assessment + viva
j. CO-PO Mapping
Course Outcome PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 3
CO2 3 3 2
CO3 2 3 3
CO4 2 3 2 3
CO5 3 3

8 PROBABILITY & STATISTICS 3 1 0 0 4 4 CR
21SMT-257 21SMT-257
PRE-REQUISITE 21SMT-216
In the Probability and Statistics course the unit is a classical treatment of probability and includes basic probability principles,
conditional probability, discrete random variables (including the Binomial distribution) and continuous random variables (with emphasis on the
normal distribution).
The objective of this course is to familiarize the students with 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.
c. Course Outcomes
CO1 Students will be able to understand
CO2 The ideas of probability and random variables and various discrete and continuous probability distributions and their properties.
CO3 The basic ideas of statistics including measures of central tendency, correlation and regression.
CO4 The statistical methods of studying data samples
d. Syllabus
Unit-1 Unit-I Contact Hours: 15h
Basic Statistics Measures of Central tendency: Moments, skewness and Kurtosis – Random Variable : Discrete and
Continuous. Probability distributions: Binomial, Poisson and Normal - evaluation of statistical parameters for
these three distributions.
Unit-2 Unit-II Contact Hours:
Applied Statistics Curve fitting by the method of least squares- fitting of straight lines, second degree Parabola and more
general curves. Test of significance: Large sample test for single proportion, difference of proportions, single
mean, difference of means, and difference of standard deviations.
Unit-3 Unit-III Contact Hours: 15h
Bivariate Distributions Bivariate distributions and their properties, distribution of sums and quotients, conditional densities, Bayes'
rule. Correlation and regression – Rank correlation.
Small samples Test for single mean, difference of means and correlation coefficients, test for ratio of variances - Chi- square
test for goodness of fit and independence of attributes.

1. H.K Dass., Higher Engineering Mathematics, S. Chand Publishers, 3rd revised edition.2014.
2. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 42th ed.2013, New Delhi.
3. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2008.
4. R.K. Jain, and S.R.K. lyengar, Advanced Engineering Mathematics, 3rd Edition Narosa Publishing House, 2004, New Delhi.
5. B.V. Ramana Advanced Engineering Mathematics, McGraw Hill, July 2006, New Delhi.
6. S.P. Gupta, Statistical Methods, S. Chand & Sons, 2017, New Delhi, ISBN9789351610281

Theory
Marks 40 60
Total Marks 100

assignment
each test
Quiz course types
4 Homework NA One per lecture Non-Graded: depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 2
CO2 3 3 2 2
CO3 3 3 2 2
CO4 3 3 2 2

9 Code Microprocessor & Interfacing Lab 0 0 2 0 1 2 CR
21ITP-253/ 21ITP-253/ 21CSP-253
21CSP-253
It gives a practical training of interfacing the peripheral devices with the 8086 microprocessor. The course objective is to introduce the basic concepts
of microprocessor and to develop in students the assembly language programming skills and real time applications of Microprocessor as well
as microcontroller.
• To get familiarization with 8085 kit and simulator.
• To implement basic programs using 8085kit/simulator.
c. Course Outcomes
CO1 learn how the hardware and software components of a microprocessor- based system work together to implement system-level
features
CO2 learn both hardware and software aspects of integrating digital devices (such as memory and I/O interfaces) into microprocessor-
based systems
CO3 learn the operating principles of, and gain hands-on experience with, common microprocessor peripherals such as UARTs, timers, and
analog- to-digital and digital-to-analog converters
CO4 Get practical experience in applied digital logic design and assembly- language programming
d. Syllabus
Unit-1 UNIT-I Contact Hours: 8
<Experiment No 1> To study 8085-microprocessor trainer kit.
< Experiment No 2> Addition of two 8-bit numbers; sum 8bits
< Experiment No 3> Addition of two 16 bit number; sum 16-bits.
< Experiment No4> Subtraction of two 8-bit numbers; result 8bits.
< Experiment No5> Subtraction of two-16 bit numbers; sum 16bits
Unit-2 UNIT-II Contact Hours: 8
< Experiment No 1> Find one’s complement of an 8-bit number
< Experiment No 2> Find one’s complement of a 16-bit number.
< Experiment No 3> Find two’s complement of an 8-bit number.

< Experiment No4> Find two’s complement of a 16- bit number.
< Experiment No5> Shift an 8 -bit number to left by 1-bit.
< Experiment No6> Shift an 8-bit number to left by2-bits.
< Experiment No7> Shift a 16 -bit number to left by 1-bit
< Experiment No8> Shift a 16-bit number to left by 2-bits
Unit-3 UNIT-III Contact Hours: 8
< Experiment No 1> Mask of least significant 4 bits of an 8-bitnumber.
< Experiment No 2> Mask of most significant 4 bits of an 8-bitnumber.
< Experiment No 3> Find the smaller out of two numbers.
< Experiment No4> Find the smaller number in a data array
< Experiment No5> Find the larger out of two numbers.
< Experiment No6> Find the largest number from data array.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 3 2 3
CO2 3 3 2 3 2 3
CO3 3 3 2 3 2 3
CO4 3 3 2 3 2 3

10 Code Software Engineering Lab 0 0 2 0 1 2 CR
21CSP-255/ 21CSP-255/
21ITP-255 21ITP-255
This course introduces concepts and techniques relevant to the production of large software systems. Students are taught a programming
method based on the recognition and description of useful abstractions. Topics include modularity, specification, data abstraction, object
modeling, design patterns, and testing.
• To understand the various documents developed during software development.
• To learn to draw various UML diagrams.
• To understand and draw the project management charts.
c. Course Outcomes
CO1 Students will be able design project plan and SRS.
CO2 Students will be able to draw different UML Diagrams.
CO3 Students will be able to draw project management charts and prepare design document.
d. Syllabus
Unit-1 UNIT-I Contact Hours: 8
Experiment-1 Draft a project plan for the any of the project student submitted in previous semester.
Experiment-2 Development of SRS document
Experiment-3 To draw different levels of DFD.
Experiment-4 To draw an ER diagram.
Experiment-5 To draw a use case diagram.
Experiment-6 To draw a sequence diagram and collaboration diagrams.
Experiment-7 To draw a class diagram.
Experiment-8 To draw a Gantt chart and network diagram.
Experiment-9 To draw a structured chart.
Experiment-10 Development of design Document.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 2 3 3 3 3 3
CO2 3 2 3 3 3 3 3
CO3 3 2 3 3 3 3 3

11 Code Computer Networks Lab 0 0 2 0 1 2 CR
21CSP-257/ 21CSP-257/
21ITP-257 21ITP-257
In this course, students are going to experiment in a real test-bed networking environment, and learn about network design and troubleshooting topics
and tools such as: network addressing, Address Resolution Protocol (ARP), basic troubleshooting tools (e.g. ping, ICMP), IP routing (e,g, RIP), route
discovery.
To understand Computer Hardware and networking.
c. Course Outcomes
CO1 Understand the structure and organization of computer networks; including the
division into network layers
CO2 Understand the basic concepts of application layer protocol design; including
client/server models
CO3 Understand the basic concepts of link layer properties; including error-detection
and correction techniques
CO4 Understand the basic concepts of network security concepts; including authentication
d. Syllabus
Unit-1 UNIT I Contact Hours: 8
<Experiment No 1> Familiarization with Computer Hardware & write specifications of latest desktops and laptops.
< Experiment No 2> Installation Process of various operating systems.
< Experiment No 3> Study of LAN Components
< Experiment No 1> Preparing straight and cross cables.
< Experiment No 2> Familiarization with transmission media viz. coaxial cable, twisted pairs, optical fibre
networking, wireless networking, connectors etc.
< Experiment No 3> Creation of different topologies.
Unit-3 UNIT III Contact Hours: 8
< Experiment No 1> Sharing of resources with two connected nodes.
< Experiment No 2> Configuration of TCP/IP Protocols.
< Experiment No 3> Network troubleshooting

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 2
CO2 3 2
CO3 3 2
CO4 3 2

(Employability Enhancement course)
Object Oriented Programming/ /Data Structures and Algorithm Analysis/Relational Databases Management System & Computer Networks
(MNG)
SN Course Object Oriented Programming L T P S C CH Course Type

Code
12 1 0 0 0 1 1 MNG
21CSY-261 21CSY-261
CO-REQUISITE 21CSP-259
ANTI-REQUISITE NA
COURSE OUTCOMES:
On completion of this course, the students are expected to have learnt about the following:
• Student will learn all core subjects of respective engineering background.
• Student will enhance the Employability skills to make student well versed with core subjects of his domain
• Student will be able to clear all placement & Govt. job exams.
COURSE OBJECTIVES:
CO1 To make student learn all core subjects of respective engineering background.
CO2 To enhance the Employability skills to make student well versed with core subjects of his domain.
CO3 To make student clear all placement & Govt. job exams.
Syllabus
Unit-1 Programming in C++ Contact Hours: 5 HOURS
<Chapter Name 1> Introduction to OOP and its basic features, Data types, Expression and control statements
Iteration statements in C++, Introduction to Arrays, Multidimensional Arrays, Strings and String related Library
Functions.
<Chapter Name 2> Functions , Creating classes and Abstraction: Classes objects, data members, member functions, this Pointer,
Friends, Friend Functions, Friend Classes, Friend Scope, and Static Functions.
<Chapter Name 3> Constructors and Destructors, Static variables and Functions in class, Operator Overloading in C++,Inheritance
in C++, Virtual Functions, Polymorphism, Abstract classes.
Unit-2 Programming in Java Contact Hours: 5 HOURS
<Chapter Name 1> Basics of Java, OOPS Concepts, String Class, Scanner Class, Wrapper Classes, Exception Handling , Inheritance ,
Interfaces , Multi threading, AWT and Event Handling, Applets, JDBC, File Handling
<Chapter Name 2>
<Chapter Name 3>
Unit-3 (Name of the Unit) Contact Hours: 5 HOURS
<Chapter Name 1> Servlet API, Servlet Interface, GenericServlet, HttpServlet, Servlet Life Cycle, Working with Apache Tomcat
Server
Steps to create a servlet in Tomcat, servlet in Netbeans.
<Chapter Name 2> Cookies, URL Rewriting, HttpSession, Basics of JSP, Scripting elements, Implicit Objects, Action Elements
<Chapter Name 3>
REFERENCE BOOKS:
R1 Robert Lafore, “Object Oriented Programming in Turbo C++”, Galgotia Publishers.
R2 “Object Oriented Programming in Turbo C++”, by Pearson.
R3 Ashok Namdev Kamthane, Programming and Problem Solving with Python, McGraw Hill Education Publication, ISBN (13):978-93-87067-57-8.
Mode of Evaluation: The performance of students is evaluated as follows:

Theory

Marks 40 60
Total Marks 100
CO-PO Mapping

Course
Outcome
CO1 3 2
CO2 3 2
CO3 3 2
CO4 3 2

SN Course Data Structures & Algorithm Analysis L T P S C CH Course Type
Code
12 1 0 0 0 1 1 MNG
21CSY-262 21CSY-262
ANTI-REQUISITE NA
COURSE OUTCOMES:
COURSE OBJECTIVES:
CO1 To make student learn all core subjects of respective engineering background
CO2 To enhance the Employability skills to make student well versed with core subjects of his domain
CO3 To make student clear all placement & Govt. job exams
Syllabus
Unit-1 Data Structures Contact Hours: 5 HOURS
<Chapter Name 1> Need for Data Structures, Arrays, Link List, Stacks, queues Algorithm for various operations on basic Data
Structures, Recursion.
Algorithm: Time & Space Complexity, Asymptotic Notation, Master Theorem, Recurrence Relation
<Chapter Name 2> Time & space complexity Analysis of various Sorting techniques (Bubble Sort, Selection Sort, Insertion Sort,
Counting Sort, Radix Sort, Heap Sort, Quick Sort.
<Chapter Name 3>
Unit-2 Trees & Graphs Contact Hours: 5 HOURS
<Chapter Name 1> Binary Search tree, Searching in BST, Insertion in BST, Deletion in BST , height balanced AVL trees, Red black
trees, B trees, B+ trees.
<Chapter Name 2> Need for Graphs, Graph Traversals, Minimum Spanning Trees- Prim’s Algorithm & Kruskal Algorithm, Floyd
Warshall Algorithm, Single Source Shortest Paths - Dijkstra’s and Bellman Ford Algorithms.
<Chapter Name 3>
Unit-3 Problem Solving Approaches Contact Hours: 5 HOURS
<Chapter Name 1> Greedy Approach: Huffman Algorithm, Dijkastra Algorithm, Knapsack Problem.
<Chapter Name 2> Dynamic Approach &Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-
Queen Problem, Hamiltonian Cycles, Resource Allocation Problem, Longest Common Subsequence problem ,
Matrix Chain multiplication Problem.
<Chapter Name 3>
REFERENCE BOOKS
R1 Levitin, “Introduction to the design and analysis of algorithms”, 2nd edition, Pearson.
R2 Baase, Van Gerder, “Computer Algorithms: Introduction to Design Analysis”, 3rd edition, Pearson..
R3 Lipschutz, S., “Data Structures, Schaum's Outline Series”, 2nd edition (2014), Tata McGraw Hill.
R4 Cormen, Leiserson, Rivest, Stein, “Introduction to Algorithms”, 3rd edition, Prentice Hall of India.
R5 Horowitz, Sahni and Rajasekaran, “Fundamental of Computer, Algorithms”, University Press (India).
R6 Aho, Haperoft and Ullman, “The Design and analysis of Computer Algorithms”, 2nd edition, Pearson Education India.

Theory

Marks 40 60
Total Marks 100
CO-PO Mapping
Course
Outcome
CO1 3 2
CO2 3 2
CO3 3 2

CO4 3 2

SN Course Data Base Management System & Computer Networks L T P S C CH Course Type
Code
12 1 0 0 0 1 1 MNG
21CSY-263 21CSY-262
ANTI-REQUISITE NA
a. COURSE OUTCOMES:
b. COURSE OBJECTIVES:
CO1 To make student learn all core subjects of respective engineering background.
CO2 To enhance the Employability skills to make student well versed with core subjects of his domain.
CO3 To make student clear all placement & Govt. job exams.
c. Syllabus
Unit-1 Data Base Management Systems Contact Hours: 5 HOURS
Introduction Introduction and applications of DBMS, Purpose of data base, Data, Independence, Database System
architecture- levels.
Relational Model Structure of relational databases, Domains, Relations, Relational algebra – fundamental operators and syntax,
relational algebra queries, tuple relational calculus. Basic concepts, Design process, constraints, Keys, Design
issues, E-R diagrams, weak entity sets, extended E-R features – generalization, specialization, aggregation,
reduction to E-R database schema.
Relational Data Base Functional Dependency – definition, trivial and non-trivial FD, closure of FD set, closure of attributes,
Design irreducible set of FD, Normalization – 1Nf, 2NF, 3NF, Decomposition using FD- dependency preservation,
BCNF, Multi- valued dependency, 4NF, Join dependency and 5NF.
Unit-2 Contact Hours: 5 HOURS
SQL Concepts Basics of SQL, DDL,DML,DCL, structure – creation, alteration, defining constraints – Primary key, foreign key,
unique, not null, check, IN operator. Functions - aggregate functions, Built-in functions –numeric, date, string
functions, set operations, sub-queries, correlated sub-queries, Use of group by, having, order by, join and its
types, Exist, Any, All , view and its types. Transaction control commands – Commit, Rollback, Save point.
PL-SQL Concepts Cursors, Stored Procedures, Stored Function, Database Triggers.
<Chapter Name 3>
Unit-3 Introduction to computer networks Contact Hours: 5 HOURS
Application Layer Understanding of network and Internet, Understanding of Delay, Loss and Throughput in the packet-switching
network, protocols layers and their service model, History of the computer network
Principles of computer applications, Web and HTTP, E-mail, DNS, Socket programming with TCP and UDP
Transport Layer & Introduction and transport layer services, Multiplexing and Demultiplexing, Connection less transport (UDP),
Principles of reliable data transfer, Connection oriented transport (TCP), Congestion control.
Network Layer
Introduction, Virtual and Datagram networks, study of router, IP protocol and addressing in the Internet,
Routing algorithms, Broadcast and Multicast routing
The Link layer and Local Introduction and link layer services, error-detection and correction techniques, Multiple access protocols,
addressing, Ethernet, switches.
area networks:
d. Reference Books:
R1 Korth, H. F. and Silverschatz, A., Database System Concepts, Tata McGraw Hill (2013).
R2 Network Security Essentials, William Stallings, Prentice-Hall(2007), Fourth Edition
R3 Security Technologies for the World Wide Web, Rolf Oppliger, Artech House(2002),Second Edition
R4 Building Internet Firewalls, Brent Chapman and Elizabeth Zwicky, O’Reilly and Associates(200),Second Edition
e. Mode of Evaluation: The performance of students is evaluated as follows:

Theory

Marks 40 60
Total Marks 100
f. CO-PO Mapping

Course
Outcome
CO1 3 2
CO2 3 2
CO3 3 2
CO4 3 2

13 Life Skills and Mentoring: MNG 0 1 0 0 1 1 MNG
21UCY-296 21UCY-296
ANTI-REQUISITE --
The life skills topics encompass healthy living, reproductive health and sexuality, and making positive decisions. It provides discussion ideas and fun
learning activities that can be used in mentoring sessions, school settings, or in mentees' families.
• Guide and improve academic attainments, career prospectus,
• Motivate active participation in co-curricular and extra-curricular activities,
• Speedy solution of administrative problems
• Development of life skills to be a responsible citizen
• Developing preparation and presentation competency among students
• Promote qualities of a decent professional and good human being.
c. Course Outcomes
CO1 Goal Setting and Important national and multinational Corporate with a potential employment in the field of concern.
CO2 Primary and secondary skills required for employment.
CO3 Personnel Gap analysis academic attainments and corporate expectations.
CO4 Planning for extra academic certifications to provide edge in competition.
d. Syllabus
Unit-1 Unit-I Contact Hours: 5
Introduction On the first day 4 to 5 subgroups of the students will be formed. Each subgroup will be allocated one of the
topics mentioned above in case topic needs
Video Presentations Total time available for the entire given topic is 90 minutes. The subgroup should minutely plan the time
schedule for video presentations, discussions explanation, interactive activity and case study etc..
Group Activities It is important to note every member the subgroup has to present and conduct a part of the program so it
is advised that more number of videos with small duration i.e. not more than 5 minutes should be used in
the program.
Unit-2 Unit-II Contact Hours: 5
Case Studies It is supplemented by small exercises/case studies for depicting the salient points. Exercises/ case solution will
be done by all students other than the subgroup presenting the topic
Presentations Entire scheme of presenting the topic will be innovatively prepared and meticulously designed by the
members of subgroup in consultation with the mentor.
Unit-3 (Name of the Unit) Contact Hours: 5

Mentor Participation Mentor will act as a facilitator during the conduct of the program. He will also assess the performance of
the subgroup its members and all other members of the mentoring group.
Assessment Regular assessment of each student on the basis of active participation in each program will be done by
the mentor.

Theory
Marks 40 60
Total Marks 100

assignment
each test As applicable to
3 Quiz/Test 4 marks of each 2 per Unit 4 marks course types
quiz depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3
CO4 3

Semester-5
Course Evaluation
Type Internal External Total
1 21CST-311 Design and Analysis of 3 0 0 0 3 3 40 60 100
CR
Algorithms
2 21CST-313 Operating Systems CR 3 0 0 0 3 3 40 60 100
3 21CSP-314 Competitive Coding - I CR 0 0 2 0 1 2 60 40 100
4 21CST-315 System Programming CR 3 0 0 0 3 3 40 60 100
5 21CST-316 Machine Learning CR 3 0 0 0 3 3 60 40 100
6 21CST-3** Professional Elective-I DE 2 0 0 0 2 2 40 60 100
7 21CSR-318 Project-II PR 0 0 1 5 3 6 60 40 100
8 21CST-319 Project Based Learning in 2 0 0 0 2 2 40 60 100

CR
Java
9 21CSP-312 Design and Analysis of 0 0 2 0 1 2 60 40 100

CR
Algorithms Lab
10 21CSP-317 Machine Learning Lab CR 0 0 2 0 1 2 60 40 100
11 21CSP-3** Professional Elective-I 0 0 2 0 1 2 60 40 100

DE
Lab
12 21CSP-321 Project Based Learning in 0 0 4 0 2 4 60 40 100

CR
Java Lab
13 21CSX-322 Institute/Industrial SSMNG 0 0 0 4 2 4 60 40 100

Summer Training : MNG
14 21TDY-301 Soft Skills :MNG TPP MNG 0 0 2 0 1 2 60 40 100
15 21TDY-302 Aptitude: MNG TPP MNG 0 2 0 0 2 2 40 60 100
16 21CSY-313 Fundamentals of Image MNG 3 0 0 0 3 3 40 60 100

Processing: MNG NTPP
17 21UCY-346 Life Skills and Mentoring MNG 0 1 0 0 1 1 40 60 100
: MNG
16 0 13 5 25 34
TOTAL

SN Course Code Design and Analysis of Algorithms L T P S C CH Course Type
1 21CST-311/ 3 0 0 0 3 3 CR
21ITT-311
21CST-311/21ITT-311
CO-REQUISITE 21CST-313,21CSP-314,21CST-315,21CST-316,21CST-319,21CSP-321
Algorithms are the soul of computing. This course introduces basic methods for the design and analysis of efficient algorithms emphasizing methods
useful in practice. Different algorithms for a given computational task are presented and their relative merits evaluated based on performance
measures.
o To understand meaning and characteristics of algorithms
o To study different algorithm design techniques.
o To implement different algorithm design techniques for solving engineering and related problems.
c. Course Outcomes
CO1 Design algorithms for various computing problems &Analyze the time and space complexity of algorithms
CO2 Critically analyze the different algorithm design techniques for a given problem
CO3 Modify existing algorithms to improve efficiency
d. Syllabus
Unit-1 Understanding Fundamentals Contact Hours:15
Algorithms and Program Designing and analyzing algorithms, Time and Space complexity, Average and worst case Analysis, Asymptotic
Performance notations, recurrence equations and their solution: substitution method, recursion-tree method, master
method.
Review of Data Structures Arrays, Stacks, Queues, Pointers, Linked Lists (One –way, Two-way and circular Two-way), Hashing, Trees (BST,
B Tree, balanced trees (AVL, Red black trees)), Heaps, Graphs
Sorting algorithm Sorting in linear time: counting sort, radix sort, bucket sort
Unit-2 Design Methodologies Contact Hours:15
Divide and conquer &
Divide and conquer: The General method, Binary search, Finding maximum and minimum of a sequence of
Greedy algorithms
numbers, 2 way Merge sort, Quick sort, Selection sort, Strassen’s matrix multiplication.
Greedy algorithms: The general method, Fractional Knapsack problem, Minimum cost spanning tree: Prim’s
Algorithm, Kruskal Algorithm; Huffman coding, Optimal merge patterns
Dynamic programming The general method, 0/1 knapsack, Subset Sum problem, Change making problem, optimal binary search tree,
Matrix-chain Multiplication, Longest common Subsequence Problem, Travelling salesman problem.
Comparison of Divide & Conquer and Dynamic Programming techniques.
Backtracking &Branch and Backtracking: The general method, N-queen’s problem, sum-of-subsets, Hamiltonian cycles.
Bound Branch and Bound: Branch and Bound method, 0/1 Knapsack problem, Travelling salesperson problem.
Unit-3 Miscellaneous Contact Hours:15
Graph Algorithms Representation of Graphs, Depth First Search, Breadth First search, Topological sort, Single source shortest
path: Dijkstra Algorithm& Bellman Ford Algorithm. All-pair shortest paths: Floyd Warshall Algorithm, Minimum
Spanning Tree: Sollin’s algorithm.
Computational complexity Basic concepts, P and NP-classes, proof of NP-hard and NP-completeness.
Miscellaneous topics Euclid Algorithm for GCD of 2 numbers, modulo arithmetic, Chinese remainder theorem, string
manipulation/matching algorithms: Rabin Karp algorithm, KMP (Knuth-Morris-Pratt) algorithm, Boyer-Moore
algorithm; Convex Hull.
Text books
1. Cormen, Leiserson, Rivest, Stein, “Introduction to Algorithms”, Prentice Hall of India, 3rd edition 2012. problem, Graph coloring.
2. Horowitz, Sahni and Rajasekaran, “Fundamentals of Computer Algorithms”, University Press (India), 2nd edition.
Reference
1. Tanenbaum, Augenstein, &Langsam, “Data Structures using C and C++”, Prentice Hall of India.
2. Brassard, Bratley, “Fundamentals of Algorithms”, Prentice Hall of India.
3. Knuth “The Art of Computer Programming, Volume 1: Fundamental Algorithms” (Addison-Wesley, Third Edition).
4. Lipschutz, S., “Data Structures, Schaum's Outline Series”, Tata McGraw Hill.
5. Kruse, “Data Structures & Program Design”, Prentice Hall of India.
6. Aho, Haperoft and Ullman, ”The Design and analysis of Computer Algorithms”, Pearson Education India.

Theory
Marks 40 60

Total Marks 100

assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 3
CO2 3 3 3 2 3
CO3 3 3 3 2 3

SN Course Code Operating Systems L T P S C CH Course Type
2 21CST-313/ 3 0 0 0 3 3 CR
21ITT-313
Course Code(s)
21CST-313/ 21ITT-313
CO-REQUISITE 21CSP-314,21CST-315,21CST-316,21CST-319,21CSP-321
The subject Covers the classical internal algorithms and structures of operating systems, including CPU scheduling, memory management,
and device management. Covers topics including file systems, virtual memory, disk request scheduling, concurrent processes, deadlocks,
security, and integrity.
• To grasp a fundamental understanding of operating systems and its functionalities.
• To understand process management, various scheduling algorithms, concurrency and synchronization.
• To understand memory management and virtual memory concepts in modern Operating systems.
c. Course Outcomes
CO1 Describe the general architecture of computers
CO2 Describe, contrast and compare different structures for operating systems
CO3 understand and analyze theory and implementation of: processes, resource control (concurrency etc.), physical and virtual
memory, scheduling, I/O and files
CO4 Become familiar (if not already) with the C language, gcc compiler, and Makefiles.
d. Syllabus
Unit-1 INTRODUCTION Contact Hours:15
Introduction to the Introduction to Operating Systems, Operating System Structure, Main Functions and characteristics of
Operating System Operating Systems, Types of Operating Systems, System calls, Types of system calls, System programs.
Process Management Process Concept, Process Control Block, Process Scheduling, Threads, CPU Scheduling : Preemptive/ Non
Preemptive Scheduling, Scheduling Criteria, Scheduling Algorithms, inter-process communication, remote
procedure calls, Process Synchronization
Deadlocks Deadlock characterization and conditions for deadlock, deadlock prevention, Deadlock avoidance-safe state,
resource allocation graph algorithm, Banker’s algorithms-Safety algorithm, Deadlock detection, Recovery
from deadlock.
Unit-2 MEMORY AND DEVICE MANAGEMENT Contact Hours:15
Memory Management Address binding, logical versus physical address space, dynamic loading, Swapping, contiguous memory
allocation, Fragmentation, Paging, Segmentation, Segmentation with Paging, Virtual Memory Concept,
Demand Paging, Page Replacement, Page Replacement Algorithms
Device Management Disk Structure, Disk formatting, Disk Scheduling Algorithms, RAID structure-RAID levels, problems with RAID.
File Management File Concepts, Access Methods, Directory Structure, Allocation Methods, Free Space Management.
Unit-3 SECURITY AND TYPES OF OS Contact Hours:15
System Protection and Goals, principles and domain of protection, Access matrix, implementation of access matrix, the security
Security problem, program threats, system and network threats.
Distributed and Network Overview: Topology, connection strategy, network operating system types: Peer to Peer & Client server,
Operating Systems Distributed message passing.
Text Books:
1. Galvin, Peter B., Silberchatz, A., “Operating System Concepts”, Addison Wesley, 8th Edition.
2. Flynn, “Operating Systems”, Cengage Learning.
3. Dhamdhere, D.M., "Operating System: A Concept Based Approach", Tata Mc-Graw-Hill.
Reference Books:
1. Madnick , Stuart E., Donovan, John J. “ Operating System”, McGrawHill.
2. Stalling, William, “Operating Systems”, Pearson Education, Fifth Edition.

Theory
Marks 40 60
Total Marks 100


assignment
each test
As applicable to
Quiz
course types
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 3 2 2 3
CO2 2 3 2 2 3
CO3 2 3 2 2 3
CO4 2 3 2 2 3

SN Course Code Competitive Coding - I L T P S C CH Course Type*
3 21CSP-314/ 0 0 2 0 1 2 CR
21ITP-314
Course Code(s)
21CSP-314/21ITP—314
CO-REQUISITE 21CST-313 ,21CST-315,21CST-316,21CST-319,21CSP-321
During the course the student will learn everything needed to participate in real competitions. Along the way the students also also gain useful skills for
which competitive programmers are so highly valued by employers: ability to write efficient, reliable, and compact code, manage your time well when it’s
limited, apply basic algorithmic ideas to real problems, etc.
• To give students the ability to write reliable codes.
• To provide skills to the students to write compact and efficient code in a quick manner
• To provide logic building capability to the student.
c. Course Outcomes
CO1 To Provide real time problems to students for coding
CO2 To enhance the logic building capability of students
CO3 To give students a quick understanding of new codes
d. Syllabus
Unit-1 Data Structures Contact Hours:15
Arrays, Stacks & Queues https://www.hackerrank.com/challenges/arrays-ds/problem
https://www.hackerrank.com/challenges/2d-array/problem
https://www.hackerrank.com/challenges/dynamic-array/problem
https://www.hackerrank.com/challenges/array-left-rotation/problem
https://www.hackerearth.com/fr/practice/data-structures/arrays/multi-dimensional/practice-
problems/algorithm/add-alternate-elements-of-2-dimensional-array/
https://www.hackerrank.com/challenges/equal-stacks/problem
https://www.hackerrank.com/challenges/maximum-element/problem
https://www.hackerearth.com/fr/practice/data-structures/queues/basics-of-queues/practice-
problems/algorithm/disk-tower-b7cc7a50/
https://www.hackerrank.com/challenges/queue-using-two-stacks/problem
Linked List https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list/problem
https://www.hackerrank.com/challenges/insert-a-node-at-the-tail-of-a-linked-list/problem
https://www.hackerrank.com/challenges/compare-two-linked-lists/problem
https://www.hackerrank.com/challenges/reverse-a-linked-list/problem
https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list/problem
https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list/problem
Graphs https://www.hackerrank.com/challenges/insertionsort1/problem
https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-
problems/algorithm/monk-and-the-islands/
https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-
problems/algorithm/anupam-graph/
https://www.hackerrank.com/challenges/kruskalmstrsub/problem

https://www.hackerrank.com/challenges/primsmstsub/problem
https://www.hackerrank.com/challenges/dijkstrashortreach/problem
https://www.hackerrank.com/challenges/minimum-mst-graph/problem
https://www.hackerrank.com/challenges/clique/problem
https://www.hackerrank.com/challenges/crab-graphs/problem
https://www.hackerrank.com/challenges/the-quickest-way-up/problem
Trees https://www.hackerrank.com/challenges/tree-preorder-traversal/problem
https://www.hackerrank.com/challenges/tree-postorder-traversal/problem
https://www.hackerrank.com/challenges/tree-inorder-traversal/problem
https://www.hackerrank.com/challenges/tree-height-of-a-binary-tree/problem
https://www.hackerrank.com/challenges/tree-level-order-traversal/problem
https://www.hackerrank.com/challenges/binary-search-tree-insertion/problem
https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem
https://www.hackerrank.com/challenges/self-balancing-tree/problem
https://www.hackerrank.com/contests/hourrank-19/challenges/maximal-tree-diameter/problem
https://www.hackerrank.com/contests/101hack33/challenges/longest-path
Unit-2 Algorithms Contact Hours:15
String Algorithms https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/practice-

problems/algorithm/string-4-d1093b86/
https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/practice-
problems/algorithm/palindrome-string-22/
https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-
problems/algorithm/palindrome-124/
problems/algorithm/conversion-11/
problems/algorithm/print-first-occurence/
https://www.hackerrank.com/challenges/camelcase/problem
https://www.hackerrank.com/challenges/strong-password/problem
Dynamic Programming https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-

subsequence/problem
https://www.hackerrank.com/challenges/unbounded-knapsack/problem
https://www.hackerrank.com/challenges/longest-increasing-subsequent/problem
https://www.hackerrank.com/challenges/travel-around-the-world/problem
https://www.hackerrank.com/challenges/extremum-permutations/problem
https://www.hackerrank.com/challenges/coin-change/problem
https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-
programming-1/practice-problems/algorithm/win-the-game/
https://www.hackerrank.com/challenges/sherlock-and-cost/problem
Branch and Bound https://www.hackerrank.com/contests/srin-aadc03/challenges/classic-01-knapsack

https://www.hackerrank.com/contests/bitsg-ai-lab-2/challenges/travelling-salesman-problem
https://www.hackerrank.com/challenges/assignment/problem
Backtracking https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and-backtracking/practice-
problems/algorithm/n-queensrecursion-tutorial/
https://www.hackerrank.com/challenges/subset-sum/problem
https://www.hackerrank.com/challenges/queens-on-board/problem
https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and-backtracking/practice-
problems/algorithm/biggest-forest-700592dd/
problems/algorithm/simran-and-stairs/
problems/algorithm/a-tryst-with-chess/
problems/algorithm/hack-the-money/

Theory

Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3

4 SYSTEM PROGRAMMING 3 0 0 0 3 3 CR
21CST-315 Course Code(s)
21CST-315
CO-REQUISITE 21CST-313,21CSP-314, 21CST-316,21CST-319,21CSP-321
The course provide students with a basic understanding of the issues involved in writing system programs on a Linux or Unix system,
manipulating system processes, system io, system permissions, files, directories, signals, threads, sockets, terminal, etc.
b, Course Objectives
• Design, write, and test moderately complicated low-level programs using a systems programming language.
• Proficiently use a preprocessor to implement code that is portable between different computing platforms.
• Implement routines that read and write structured binary files such as word processing documents, index systems, or serialized hierarchical
data.
c. Course Outcomes
CO1 To understand the execution process of HLL programs.
CO2 To understand the working of scanners and parsers
CO3 To understand the basic design of various system software.
CO4 To implement various system software.
d. Syllabus
Editors Line editor, Full screen editor and multi window editor. Case study MS-Word, DOS Editor and vi editor.
Assemblers First pass and second pass of assembler and their algorithms. Assemblers for CISC Machines: case study x85 &
x86 machines
Compilers Introduction to various translators, Various phases of compiler, Introduction to Grammars and finite
automata, Bootstrapping for compilers, Lexical Analysis and syntax analysis, Intermediate Code Generation,
Code optimization techniques, Code generation, Case study :LEXX and YACC, Design of a compiler in C++ as
Prototype
Debuggers Introduction to various debugging techniques, Case Study: - Debugging in Turbo C++ IDE.
Linkers and Loaders Concept of linking, Case study of Linker in x86 machines, loading of various loading schemes.
Operating System Booting techniques and sub-routines, Design of kernel and various management for OS, Design of Shell and
other utilities
Text Books:
1. Donovan J.J., Systems Programming, New York, Mc-Graw Hill,1972.
2. Dhamdhere, D.M., Introduction to Systems Software, Tata Mc-Graw Hill1996.
Reference Books:
Aho A.V. and J.D. Ullman Principles of compiler Design Addison Wesley/Narosa

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task

g. CO-PO Mapping
Course
Outcome
CO1 2 3 3 3
CO2 2 3 3 3
CO3 2 3 3 3
CO4 2 3 3 3

5 MACHINE LEARNING 3 0 0 0 3 3 CR
21CST-316
CO-REQUISITE 21CST-313,21CSP-314,21CST-315 ,21CST-319,21CSP-321
Machine learning uses interdisciplinary techniques such as statistics, linear algebra, optimization, and computer science to create automated systems
that can sift through large volumes of data at high speed to make predictions or decisions without human intervention. Machine learning as a field is
now incredibly pervasive, with applications spanning from business intelligence to homeland security, from analyzing biochemical interactions to
structural monitoring of aging bridges.
• To formulate machine learning problems corresponding to different applications.
• To understand machine learning algorithms along with their strength and weaknesses.
• To understand the basic theory underlying machine learning.
• To apply machine learning algorithms to solve problems of moderate complexity.
c. Course Outcomes
CO1 Understand different techniques like task oriented studies, cognitive studies
CO2 Understand the contemporary techniques in machine learning
CO3 Understand machine learning algorithms to solve various problem
d. Syllabus
Unit-1 Introduction Contact Hours:15
Introduction Learning Input-Output Functions-Aspects of developing a learning system: training data, concept
representation, function approximation - Learning and Bias - Sample applications - Boolean Functions -
Representation - Classes of Boolean Functions - Introduction to Neural Networks.
Using Version Spaces for Version Spaces and Mistake Bounds - Version Graphs -Learning as Search of a Version Space - The Candidate
Learning Elimination Method - Learning conjunctive concepts. The importance of inductive bias
Neural Networks Neural Networks - Threshold Logic Units - Linear Machines - Networks of TLUs – Training Feed forward
Networks by Back propagation - Synergies Between Neural Network and Knowledge-Based Methods -
Statistical Learning - Using Statistical Decision Theory -Learning Belief Networks - Nearest-Neighbor Methods.
Unit-2 Decision Trees Contact Hours:15

Introduction Definitions - Supervised Learning of Univariate Decision Trees – Networks Equivalent to Decision Trees – Over
fitting and Evaluation - The Problem of Replicated Subtrees - The problem of Missing Attributes –
Comparisons.
Inductive Logic Notations and Definitions - A Generic ILP Algorithm - Inducing Recursive Programs - Choosing Literals to Add -
Programming Relationship Between ILP and Decision Tree Induction.
Computational Learning Notation and Assumptions for PAC Learning Theory - PAC Learning - The Vapnik-Chervonenkis Dimension - VC
Theory Dimension and PAC Learning.
Unit-3 Rule Learning Contact Hours:15

Propositional and First- Translating decision trees into rules. Heuristic rule induction using separate and conquer and information
Order gain. First-order Horn-clause induction (Inductive Logic Programming) and Foil. Learning recursive rules.
Inverse resolution. Classification problems in language: word-sense disambiguation, sequence labeling.
Hidden Markov models (HMM's). Veterbi algorithm for determining most-probable state sequences. Forward-
backward EM algorithm for training the parameters of HMM's. Use of HMM's for speech recognition, part-of-
speech tagging, and information extraction. Conditional random fields (CRF's). Probabilistic context-free
grammars (PCFG).
Unsupervised Learning Clustering Methods - Hierarchical Clustering Methods - Temporal- Difference Learning - Temporal
Patterns and Prediction Problems - Supervised and Temporal-Difference Methods - Incremental
computation of the (delta w)i - An experiment with TD Methods - Theoretical Results - Intra-Sequence
Weight Updating - Delayed.
Reinforcement Learning The General Problem - Temporal Discounting and Optimal Policies - Q-Learning - Discussion,
Limitations, and Extensions of Q-Learning - Explanation-Based Learning - Deductive Learning - Domain
Theories - Evaluable Predicates - More General Proofs - Utility of EBL – Applications
Text Books:
1. EthemAlpaydın, Introduction to Machine Learning (Adaptive Computation and Machine Learning), MIT Press, 2004.
2. Mitchell. T, Machine Learning, McGraw Hill, 1997.
Reference Material:
1. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.

2. Ryszard S. Michalski, Jaime G. Carbonell, Tom M. Mitchell, Machine Learning : An Artificial Intelligence Approach, Tioga Publishing
Company, 1983.

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3

SN CODES TITLE L T P S C CH Course Type*
6 STATISTICAL INFERENCE USING R 2 0 0 0 2 2 DE
21CST-331 21CST-331
This course provides an overview of modern statistical data analysis. Programming with data, will be an integral part of the course. Inferential topics will
include parameter estimation, hypothesis testing for proportions, means and medians, goodness of fit tests, and tests for independence. Standard and
computationally intensive regression techniques may also be covered.
• The student will be learning to perform statistical inferencing using the latest programming language ‘R’.
• The course is research oriented and will be helpful in conducting the analysis of statistical data.
• The student will learn various data interpretation skills.
c. Course Outcomes
CO1 Learn the basics of R programming
CO2 Understand Advance R concepts
CO3 To do predictive analysis
CO4 To do statistical analysis on data
CO5 Learn to create and present graphs
CO6 Learn the scope of inferential conclusions for numerous scenarios (experiments, observational studies, etc.).
d. Syllabus
Unit-1 Introduction to R Contact Hours:
Ch-1.1 Introduction to R programming, evolution of R, features of R, Understanding the importance of R in context
with inferential statistics, Comparative analysis of R and Python
Ch-1.2 Basic R syntax, Foundational R programming concepts: R data types, Manipulating R variables(variable
assignment, searching and deleting)
Ch-1.3 R operators(arithmetic, relational, logical, assignment, miscellaneous operators),R Decision making
statements, R-loops
Unit-2 Advancing R concepts Contact Hours:15
Ch-2.1 Creating and Using functions in R, Exploring various inbuilt statistical R functions, functions Statistical
inference, contingency tables, chi-square goodness of fit, regression, generalized linear models, advanced
modeling methods
Ch-2.2 Manipulating R strings, arrays, vector, lists, data frames, Exploring various R data interfaces, data visualization
using charts and graphs
Ch-2.3 Estimates and margins of errors of populations, parameters, estimates and standard errors in order to make
predictions about data Basics of Bayesian statistics and predictive modelling
Unit-3 Statistical concepts using R Contact Hours:15
Ch-3.1 Regression analysis using R(linear regression, multiple regression, logistic regression)
Ch-3.2 Normal and Binomial distribution using R
Ch-3.3 ANOVA, Hypothesis Testing using R

• Discovering Statistics Using R by Hadley
• R for Data Science: Import, Tidy, Transform, Visualize, and Model Data by andy field
e. Assessment Pattern- internal and External

Theory

Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 3 3 3 3
CO2 2 2 3 3 3 3 3
CO3 2 2 3 3 3 3 3
CO4 2 2 3 3 3 3 3
CO5 2 2 3 3 3 3 3
CO6 2 2 3 3 3 3 3

SN CODEs TITLE L T P S C CH Course Type*
6 SOFT COMPUTING 2 0 0 0 2 2 DE
21CST-332 21CST-332
This course will cover fundamental concepts used in Soft computing. The concepts of Fuzzy logic (FL) will be covered first, followed by Artificial Neural
Networks (ANNs) and optimization techniques using Genetic Algorithm (GA). Applications of Soft Computing techniques to solve a number of real life
problems will be covered to have hands on practices. In summary, this course will provide exposure to theory as well as practical systems and software
used in soft computing.
• To understand soft computing concepts , techniques and Fuzzy System

• To study the concepts of neural networks
• To understand GA and Particle Swarm Optimization Technique
c. Course Outcomes
CO1 Classify the fundamental terminologies and concepts of ANN.
CO2 Distinguish between supervised and unsupervised learning network
CO3 Analyze fuzzy logic along with applications.
CO4 Compare & Contrast traditional algorithms with genetic algorithms and recall various concepts.
CO5 Demonstrate real life applications of soft computing
CO6 Understand the concepts of GA
d. Syllabus
Unit-1 Introduction to Soft Computing Contact Hours:15
Ch-1.1 Introduction to Soft Computing – Soft Computing vs. Hard Computing – Characteristics of soft
Computing,Concept of computing system
Ch-1.2 Introduction to Fuzzy Logic – Fuzzy Sets and Membership functions – Operations on Fuzzy sets – Fuzzy
Relations, Rules,applications of Fuzzy logic
Ch-1.3 Propositions Implications and Inferences – Defuzzification Techniques: Lambda-cut method, Weighted
average method, Maxima method, Centroid method.
Unit-2 Artificial Neural Network and Associative Memory Networks Contact Hours:15
Ch-2.1 Artificial Neural Network Introduction – Fundamental concept – Biological neuron and its working-Evolution
of Neural Networks – Basic Models of Artificial Neural Networks – Important Terminologies of ANNs –
Activation Functions
Ch-2.2 Architecture: Single layer feed forward architecture, Multilayer feed forward architecture – McCulloch-Pitts
Neuron Supervised Learning vs. Unsupervised Learning–– Supervised Learning Networks: Back-Propagation
Network – Unsupervised Learning Networks: Hebb Network.
Ch-2.3 Associative Memory Networks: Training Algorithms for Pattern Association – Autoassociative Memory Network
– Heteroassociative Memory Network – Hopfield Networks – Iterative Autoassociative Memory Networks –
Temporal Associative Memory Network.
Unit-3 Genetic Algorithm and related case studies Contact Hours:15
Ch-3.1 Genetic Algorithm: Introduction –Terminologies in GAs – Traditional Algorithm vs. Genetic Algorithm – Simple
GA – General Genetic Algorithm – Basic GA framework.
Ch-3.2 different GA architectures – GA Operators: Encoding, Crossover, Selection, Mutation. Particle Swarm
optimization.
Ch-3.3 Case Study: To implement FIS Editor. Use Fuzzy toolbox to model tip value that is given after a dinner based on
quality answers.
Text Books:
1. S.N. Shivanandam, Principle of soft computing, Wiley. ISBN13: 9788126527410 (2011)
2. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft Computing”, PrenticeHall of India, 2003.
3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall, 1995.
ReferenceMaterial
1. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming Techniques”, Pearson Edn., 2003.
2. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
3. David E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison Wesley, 1997.

Theory

Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3
CO4 3 3 3 3 3 3
CO5 3 3 3 3 3 3
CO6 3 3 3 3 3 3

SN Course TITLE L T P S C CH Course Type*
6 Code WEB AND MOBILE SECURITY 2 0 0 0 2 2 DE
21CST-333 21CST-333
The course will take both offensive and defense methods to help student explore security tools and attacks in practice. It will focus on
attacks (e.g., buffer overflow, heap spray, kernel rootkits, and denial of service), hacking fundamentals (e.g., scanning and
reconnaissance), defenses (e.g., intrusion detection systems and firewalls). Students are expected to finish intensive lab assignments that
use real-world malware, exploits, and defenses.
This Subject is useful for Making own Web page and how to host own web site on internet. Along with that Students will also learn about the protocols
involve in internet technology.
c. Course Outcomes
CO1 Use network-based tools for network analysis
CO2 Use techniques for Network scanning
CO3 Identify network vulnerability
CO4 Use tools to simulate intrusion detection system
CO5 To understand and install a firewall
CO6 Identify the basic steps of ethical hacking and protecting real-life applications through the development of countermeasures
d. Syllabus
Unit-1 Introduction to Soft Computing Contact Hours: 15
Ch-1.1 Web Fundamentals – HTML, HTTP, Client-side scripting, Server-side scripting.
Ch-1.2 Web server architecture - Windows & Linux, IIS and LAMP servers, Network topologies and DMZ.
Ch-1.3 Mobile Security Fundamentals- Introduction to Mobile Security, Building Blocks – Basic security and
cryptographic techniques.
Unit-2 Artificial Neural Network and Associative Memory Networks Contact Hours: 15
Ch-2.1 Web applications: Introduction to web applications, Web application hacking, Overview of browsers, extensions, and
platforms.
Mobile applications and Models: Mobile Malware and App Security, Android Security Model , IOS Security
Model , Security Model of the Windows Phone
Ch-2.2 Web Security-Attacks, detection evasion techniques, and countermeasures for the most popular web platforms,
including IIS, Apache, PHP, and ASP.NET
Attacks and countermeasures for common web authentication mechanisms, including password-based, multifactor
(e.g., CAPTCHA), and online authentication services like Windows Live ID.
Ch-2.3 Mobile Security-Security of GSM Networks , Security of UMTS Networks, LTE Security, WiFi and Bluetooth
Security , SIM/UICC Security.
Unit-3 Genetic Algorithm and related case studies Contact Hours: 15
Ch-3.1 Advanced session analysis, hijacking, and fixation techniques, cross-site scripting, SQL
injection, classic categories of malicious input, Overlong input (like buffer overflows), canonicalization attacks (like
the infamous dot-dot-slash), and meta characters (including angle brackets, quotes, single quote, double dashes,
percent, asterisk, underscore, newline, ampersand, pipe, and semicolon), beginner-to-advanced SQL injection tools and
techniques, stealth-encodingtechniquesandinputvalidation/output-encodingcountermeasures.
Ch-3.2 Emerging Trends in Mobile Security-Mobile Geo-location and Mobile Web Security, Security of Mobile VoIP
Communications.
Ch-3.3 Web services vulnerabilities discovery and exploited through techniques including WSDL
disclosure, input injection, external entity injection, and XPath injection. Web application management attacks against
remote server management, web content management/authoring, admin misconfigurations, and developer-driven
mistakes. Web browser exploits.
• Hacking Exposed Web Applications, 3rd edition, JOEL SCAMBRAY, VINCENT LIU, CALEB SIMA
• The Web Application Hacker's Handbook Discovering and Exploiting Security Flaws By Dafydd Stuttard, Marcus Pinto
• Rich Bowen, Ken Coar, “Apache Cookbook”, O’Reilly
• Open Web Application Security Project. A Guide to Building Secure Web Applications and WebServices.
http://www.owasp.org/index.php/Category:OWASP_Guide_Project

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 2 2 3 3 3 3
CO2 3 2 2 3 3 3 3
CO3 3 2 2 3 3 3 3
CO4 3 2 2 3 3 3 3
CO5 3 2 2 3 3 3 3
CO6 3 2 2 3 3 3 3

6 Multimedia Technologies 2 0 0 0 2 2 DE
21CST-334
Multimedia Technologies is an indispensable part of modern computing environments. This course will explain the technologies underlying
digital images, videos and audio contents, including various compression techniques and standards, and the issues to deliver multimedia
content over the Internet.
1. The aim of the syllabus is to provide orientation as regard to uses of Multimedia.
2. This course will explain the technologies underlying digital images, videos and audio contents, including various compression techniques and
standards, and the issues to deliver multimedia content over the Internet.
c. Course Outcomes
CO1 To identify the essential features of graphics/image data types, file formats, and colour models in images and video.
CO2
To explain the technical details of multimedia data representations.
CO3
To perform a comparative analysis of the major methods and algorithms for multimedia data compression.
CO4
To explain the technical details of popular multimedia compression standards.
d. Syllabus
Introduction Contents: What is multimedia, Components of multimedia, Web and Internet multimedia applications,
Transition from conventional media to digital media.
Computer Fonts and Contents: Usage of text in Multimedia, Families and faces of fonts, outline fonts, bitmap fonts
Hypertext International character sets and hypertext, Digital fonts techniques.
Unit-2 Audio and Image fundamentals and representations Contact Hours:15

Audio fundamentals and Digitization of sound, frequency and bandwidth, decibel system, data rate, audio file format, Sound synthesis,
representations MIDI, wavetable, Compression and transmission of audio on Internet, Adding sound to your multimedia
project, Audio software and hardware.
Image fundamentals and Contents: ColourScience ,Colour, Colour Models, Colour palettes, Dithering, 2D Graphics, ImageCompression
representations and File Formats :GIF, JPEG, JPEG 2000, PNG, TIFF, EXIF, PS, PDF, BasicImage Processing [ Can Use Photoshop
], Use of image editing software, White balancecorrection, Dynamic range correction, Gamma correction,
Photo Retouching.
Unit-3 Video and Animation and Multimedia Authoring Contact Hours:15

Video and Animation Video Basics , How Video Works, Broadcast Video Standards, Analog video, Digital video,Video Recording and
Tape formats, Shooting and Editing Video (Use Adobe Premier forediting), Video Compression and File Formats.
Video compression based on motioncompensation, MPEG-1, MPEG-2, MPEG-4, MPEG-7, MPEG-21, Animation:
Cell.
Animation, Computer Animation, Morphing.
Multimedia Authoring Multimedia Authoring Basics, Some Authoring Tools, Macromedia Director & Flash.
TEXT BOOKS:
T1. Tay Vaughan, “Multimedia making it work”, Tata McGraw-Hill, 2008.
T2. Rajneesh Aggarwal & B. B Tiwari, “ Multimedia Systems”, Excel Publication, New Delhi, 2007.
T3. Li & Drew, “ Fundamentals of Multimedia” , Pearson Education, 2009.
REFERENCE BOOKS:
R1. Parekh Ranjan, “Principles of Multimedia”, Tata McGraw-Hill, 2007
R2. Anirban Mukhopadhyay and Arup Chattopadhyay, “Introduction to Computer Graphics and Multimedia”, Second Edition, Vikas Publishing
House.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 3 1 3 3 3 2 3
CO2 2 3 1 3 3 3 2 3
CO3 2 3 1 3 3 3 2 3
CO4 2 3 1 3 3 3 2 3

SN Code Course Title L T P S C CH Practical
7 Project-II 0 0 1 5 3 6 PR
21CSR-318 21CSR-318
PRE-REQUISITE 21CSP-112, 21ECP-114, 21CST-151, 21CSP-152, 21CST-218, 21CSP-215,
21CSP-219
CO-REQUISITE 21CST-313, 21CST-311, 21CST-316, 21CST-319, 21CSP-317, 21CSP-321
The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimized code preparation, systematic
documentation and other associated aspects of Software Development. The assessment would be through the project demonstration and the Project
Report, which should portray Programming Style, Structured Design, Minimum Coupling, High Cohesion, Good documentation of the code to ensure
readability and ease of maintenance.
1. Develop openness to new ideas in computer science, develop the ability to draw reasonable inferences from observations and learn to
formulate and solve new computer science problems using analytical and problem-solving skills;
2. Develop the ability to synthesize and integrate information and ideas, develop the ability to think creatively, develop the ability to think
holistically and develop the ability to distinguish between facts and opinion;
3. Develop the ability to work individually and as part of a team, develop a commitment to accurate work, develop management skills, improve
speaking and writing skills, improve the ability to follow directions, instructions and plans, and improve the ability to organize and use time
effectively;
4. Develop a commitment to personal achievement, the ability to work skilfully, informed understanding of the role of science and technology, a
lifelong love of learning, and cultivate a sense of responsibility for one's own behaviour and improve self-esteem/self-confidence.
c. Course Outcomes: Upon successful completion of this course students will be able to
CO1 Work on a project of latest topic / research area / industrial applications preferably using the tool or language learned in
previous or current semester.
d. Textbooks / Reference Books:


Practical
Marks 60 40
Total Marks 100
e. Internal Evaluation Component

Sl No. Type of Assessment Weightage of actual Frequency of Final Weightage in Internal Remarks
Graded)
1 Project Proposal 5 1 5 Graded
Submission
3 Project Design and 10 1 10 Graded
Modeling
5 IEEE Paper/ Patent/ 5 2 5 Graded
H/w Product
6 Final Project 20 1 20 Graded
Assessment + viva
f. CO-PO Mapping
CO1 3 2 3 3
CO2 3 3 2
CO3 2 3 3
CO4 2 3 2 3
CO5 3 3

8 Project Based Learning in Java 2 0 0 0 2 2 CR
21CST-319/ Course Code(s)
21ITT-319 21CST-319/ 21ITT-319
CO-REQUISITE 21CST-313,21CSP-314,21CST-315,21CST-316 ,21CSP-321
Nowadays Industry expects engineers to have skills like critical thinking, problem solving, ability to work in team, make presentation of the ideas and
technology developed etc. Project Based Learning is a novel teaching method, designed to address these requirements to make students ready for
Industry. It helps students to learn better and it motivates students to gain knowledge, and remember it longer.
• Programming in the Java programming language.
• Knowledge of object-oriented paradigm in the Java programming language.
• The use of Java in a variety of technologies and on different platforms.
• Understand the server side programming.
c. Course Outcomes
CO1 To gain knowledge of the structure and use the Java programming language for various technologies
CO2 Annotations and Databases usage in project Development
CO3 Web Based Java Application Development
d. Syllabus
Unit-1 INTRODUCTION Contact Hours: 10
Java Fundamentals Introduction to Java. Difference between C++ and Java. Keywords, Tokens, Data types. Use of public, private
and protected
OOPS using Java Use of class and method in Java. Inheritance, Abstraction, Polymorphism, Encapsulation and data privacy.
Difference between method overloading and method overriding
Exception Handing Introduction to Exceptions. Difference between error and exception. Use of try, catch and throw. Difference
between throw and throws. Types of Exceptions, Exception handling in Java
Unit-2 COLLECTIONS AND FRAMEWORK Contact Hours: 10
Collection Framework Use of Collections in Java. ArrayList, LinkedList, HashMap, TreeMap, HashSet in Java.. Multithreading in Java.
Thread Synchronization. Thread Priority, Thread LifeCycle.
Wrapper Classes, I/O Use of wrapper classes in Java- Integer, Character, Long, Boolean. Autoboxing and Unboxing. Byte stream,
Streams and Annotations Character stream, Object serialization, cloning. System defined annotations, Custom annotations, application
of annotations, Testing using JUnit.
JDBC Database connectivity, Types of Drivers for connection, Connection Example. CRUD operations using
Database, Configuring various types of drivers for Java Database Connectivity, MVC Model for project
development, Sequence, Dual table , Date type management in Java
Servlets and JSP Servlet Lifecycle, Generic Servlet, Http Servlet, Linking Servlet to HTML, HttpServlet Request and Response,
Servlet with JDBC, Configuring project using servlet, Servlet Config and Servlet Mapping JSP declaration, JSP
directives, JSP Scriptlets, JSP include tag, JSP page tag, JSTL.
XML and Web Services Structure of XML, Elements of XML 1.0, 2.0, DTDs, XML parser, DOM parser, Web services using REST and
HTTP, Creating web services for database access via remote servers
Text books:
1. Herbert Schildt, Java : The Complete Reference, 9th Edition, Oracle Press.
2. Gary Cornell, Core Java Volume II Advanced Features, 8th Edition, Pearson Education.
3. Jim Keogh, J2ee : Complete Reference, 1st Edition, Tata McGraw Hill.
Reference books:
3. James Gosling, Ken Arnold and David Holmes, Java Programming Language, 5th Edition, Pearson Education.
4. Gary Cornell, Core Java Volume I, 3rd Edition, Pearson Education

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3

9 Code Design and Analysis of Algorithms Lab 0 0 2 0 1 2 CR
21CSP-312/ Course Code(s)
21ITP-312 21CSP-312/21ITP-312
This course enables students to analyze worst-case running time of algorithms and understand fundamental algorithmic problems and to
understand how asymptotic notation is used to provide a rough classification of algorithms, how a number of algorithms for fundamental problems
in computer science and engineering work and compare with one another.
• To implement problems based on different algorithm design techniques.
• To implement algorithms based on graphs.
c. Course Outcomes
CO1 possess the knowledge of various existing algorithm.
CO2 analyze and compare the efficiency of algorithms
CO3 possess the ability to design efficient algorithms for solving computing problems
d. Syllabus
<Experiment No 1> Code and analyze to compute the greatest common divisor (GCD) of two numbers
< Experiment No 2> Code implement power function in O(logn) time complexity
< Experiment No 3> Code to find frequency of elements in a given array in O(n) time complexity
< Experiment No 4> (i) Code to Insert and Delete an element at the beginning and end in Code to Insert and Delete an element at the
beginning and at end in Doubly and Circular Linked List.
(ii) Code to push & pop and check Isempty, Isfull and Return top element in stacks using templates
< Experiment No 1> Code and analyze to find an optimal solution to matrix chain multiplication using dynamic programming
< Experiment No 2> To implement subset-sum problem using Dynamic Programming
< Experiment No 3> Code to implement 0-1 Knapsack using Dynamic Programming
< Experiment No 1> Code and analyze to do a depth-first search (DFS) on an undirected graph. Implementing an application of DFS
such as (i) to find the topological sort of a directed acyclic graph, OR (ii) to find a path from source to goal in a
maze
< Experiment No 2> Code and analyze to find shortest paths in a graph with positive edge weights using Dijkstra’s algorithm
< Experiment No 3> Code and analyze to find all occurrences of a pattern P in a given string S

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3

10 Machine Learning Lab 0 0 2 0 1 2 CR
21CSP-317 21CSP-317
Machine Learning lab is a key to develop intelligent systems and analyze data in science and engineering. It covers theoretical foundations as well as
essential algorithms for supervised and unsupervised learning. Classes on theoretical and algorithmic aspects are complemented by
practical lab sessions.
• To learn use of testing automation tool- Rational Functional Tester.
• To study difference between manual & automation testing.
• To implement test cases on classics Application.
c. Course Outcomes
CO1 Understand the implementation procedures for the machine learning algorithms
CO2 • Design Java/Python programs for various Learning algorithms.
CO3 • Apply appropriate data sets to the Machine Learning algorithms.
CO4 • Identify and apply Machine Learning algorithms to solve real world problems.
d. Syllabus
Unit-1 Unit-I Contact Hours:
Data Training Implement and demonstrate the FIND-S algorithm for finding the most specific hypothesis based on a
given set of training data samples. Read the training data from a .CSV file.
Candidate-Elimination For a given set of training data examples stored in a .CSV file, implement and demonstrate the Candidate-
Elimination algorithm to output a description of the set of all hypotheses consistent with the training
examples.
Decision Tree Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an appropriate
data set for building the decision tree and apply this knowledge to classify a new sample.
Unit-2 Unit-II Contact Hours:
Back Propagation Build an Artificial Neural Network by implementing the Backpropagation algorithm and test the same using
appropriate data sets.
Bayesian Classifier Write a program to implement the naïve Bayesian classifier for a sample training data set stored as a .CSV file.
Compute the accuracy of the classifier, considering few test data sets.
Naïve Bayesian Classifier Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier model to perform
this task. Built-in Java classes/API can be used to write the program. Calculate the accuracy, precision, and
recall for your data set.
Bayesian Network Write a program to construct a Bayesian network considering medical data. Use this model to demonstrate
the diagnosis of heart patients using standard Heart Disease Data Set. You can use Java/Python ML library
classes/API.
EM Algorithm Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set for clustering using k-
Means algorithm. Compare the results of these two algorithms and comment on the quality of clustering. You
can add Java/Python ML library classes/API in the program.
KNN Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print both correct
and wrong predictions. Java/Python ML library classes can be used for this problem
Locally weighted Implement the non-parametric Locally Weighted Regression algorithm in order to fit data points. Select
regression appropriate data set for your experiment and draw graphs.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3

SN Codes TITLE L T P S C CH Course Type*
11 STATISTICAL INFERENCE USING R LAB 0 0 2 0 1 2 DE
21CSP-336 21CSP-336
The course offers an overview of modern statistical data analysis.
• To learn the data analysis using R Programming
• To perform predictive and statistical Analysis.
c. Course Outcomes
CO1 Produce the solution using Matlab (Recent )
CO2 To analyze data using R programming
CO3 To visualize the data
CO4 To do predictive analysis
CO5 To do statistical analysis on data
CO6 To implement and analyze data
d. Syllabus
Unit-1 Contact Hours:15
Ex:1 Setting R in Local Environment: Installation from Comprehensive R Archieve Network(CRAN), R packages and
libraries.
Ex:2 To print messages in R command prompt, also demonstrating the use of single line and multi line comments
Ex:3 To create variable using different data types.
Ex:4 Create a dataframe of 15 tuples and apply at least 10 manipulations. (use data.frame() function)
Ex:5 To implement statistical in built functions in R(at least 10).
Ex:6 To import data and manipulate it using different data files like csv,xlsx,txt.
Ex:7 To plot data using pie chart, bar chart, box plot, histogram, linegraph and scatterplot.
Ex:8 To Find central tendency and variance (using housing data) in R.
Ex:9 Import a data file and implement Regression Analysis using R. Also apply ANOVA.
Ex:10 Create a data of 50 numbers which are normally as well as binomially distributed.

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping

Course
Outcome
CO1 3 3 2 3
CO2 3 3 2 3
CO3 3 3 2 3
CO4 3 3 2 3
CO5 3 3 2 3
CO6 3 3 2 3

SN CODES TITLE L T P S C CH Course Type*
11 SOFT COMPUTING LAB 0 0 2 0 1 2 DE
21CSP-337 21CSP-337
This course will cover fundamental concepts used in Soft computing. The course will provide exposure to theory as well as practical systems and
software used in soft computing.
• To formulate machine learning problems corresponding to different applications.
• To understand a range of machine learning algorithms along with their strengths and weaknesses.
• To understand the basic theory underlying machine learning.
• To apply machine learning algorithms to solve problems of moderate complexity.
c. Course Outcomes
CO1 Develop the solution using python and its latest libraries.
CO2 Generalize the solution for the problems through implementation.
CO3 Experiment different concepts related to fuzzy systems
CO4 Differentiate between different fuzzy properties through its application.
CO5 Different concepts related to ANN.
CO6 Understand different types of NNs.
d. Syllabus
Unit-1 Contact Hours:
Ex:1 To perform Union, Intersection and Complement operations.

Ex:2 To implement De-Morgan’s Law.
Ex:3 Generate ANDNOT function using McCulloch-Pitts neural net.
Unit-2 Contact Hours:
Ex:4 Generate XOR function using McCulloch-Pitts neural net.
Ex:5 Hebb Net to classify two dimensional input patterns in bipolar with given targets.
Ex:6 Perceptron net for an AND function with bipolar inputs and targets.
Ex:7 To calculate the weights for given patterns using hetero-associative neural net.
Unit-3
Ex:8 To store vector in an auto-associative net. Find weight matrix & test the net with input
Ex:9 To store the vector, find the weight matrix with no self-connection. Test this using a discrete Hopfield net.
Ex:10 To plot various membership functions.
Text Books:
1. S.N. Shivanandam, Principle of soft computing, Wiley. ISBN13: 9788126527410 (2011)
2. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, PrenticeHall of India, 2003.
3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall, 1995.
ReferenceMaterial:
1. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming Techniques”, Pearson Edn., 2003.
2. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
3. David E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison Wesley, 1997.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 2 2 3 3 3
CO2 2 2 2 3 3 3
CO3 2 2 2 3 3 3
CO4 2 2 2 3 3 3
CO5 2 2 2 3 3 3
CO6 2 2 2 3 3 3

11 Code WEB AND MOBILE SECURITY LAB 0 0 2 0 1 2 DE
21CSP-338 21CSP-338
This course provides hands-on experience in playing with security software and network systems in a live laboratory environment, with
the purpose of understating real-world threats. The course will take both offensive and defense methods to help student explore security
tools and attacks in practice. It will focus on attacks (e.g., buffer overflow, heap spray, kernel rootkits, and denial of service), hacking
fundamentals (e.g., scanning and reconnaissance), defenses (e.g., intrusion detection systems and firewalls). Students are expected to
finish intensive lab assignments that use real-world malware, exploits, and defenses.
o To cover the fundamentals and mathematical models in digital image and video processing.
o To develop time and frequency domain techniques for image enhancement.
o To expose the students to current technologies and issues in image and video processing.
o To develop image and video processing applications in practice.
c. Course Outcomes
CO1 Use network-based tools for network analysis
CO2 Use techniques for Network scanning
CO3 Identify network vulnerability
CO4 Use tools to simulate intrusion detection system
CO5 To understand and install a firewall
CO6 Identify the basic steps of ethical hacking and protecting real-life applications through the development of countermeasures
d. Syllabus
Unit-1 Unit-I Contact Hours:15
Experiment-1 Set up IPSEC under LINUX
Experiment-2 Install IDS (e.g. SNORT) and study the logs.
Unit-2 Unit-II Contact Hours:15
Experiment-3 Use of ip tables in linux to create firewalls
Experiment-4 Study of packet sniffer tools like wireshark, ethereal, tcpdump etc. Use the tools to do the following 1. Observer
performance in promiscuous as well as non-promiscous mode.
Show that packets can be traced based on different filters.
Unit-3 (Name of the Unit) Contact
Hours:15
Experiment-5 Use the Nessus tool to scan the network for vulnerabilities.
Experiment-6 Implement blind SQL injection on local host using SQL map
Experiment-7 Write a program to elucidates the procedure to implement business UDDI Registry entry in web service.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 2
CO2 3 3 2

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

11 Code Multimedia Technologies Lab 0 0 2 0 1 2 DE
21CSP-339 21CSP-339
a. Course Description:
The laboratory is to support research and education of Computer Science students in the fields of Multimedia Technology such as image editing, photo-
retouching, web design etc.
1. This course aims to introduce the fundamental elements of multimedia.
2. Software skills and hands on work on digital media will also be emphasized.
c. Course Outcomes:
CO1
To understand the technologies behind multimedia applications.
CO2
To master the skills for developing multimedia projects.
CO3
To Create quality multimedia software titles.
CO4
To explain the technical details of popular multimedia compression standards.
d. Syllabus
Unit-1 Unit-I Contact Hours:15

Experiment-1 Bit map and Vector Graphics
Experiment-2 Create an application in HTML using forms that lets the users to fill-in their personal information/resume
and submit the same.
Experiment-3 Prepare one image using Adobe Photoshop modifying a given image.
Unit-2 Unit-II Contact Hours:15
Experiment-4 Create an application in Flash using Text tool for creating and setting the type of text. Create a text
“COMPUTER” and also draw two buttons with the functionality to grow and shrink the created text size as the
user clicks the respective buttons.
Experiment-5 Prepare one image using Adobe Illustrator by scaling a given image in vector graphics format.
Experiment-6 Prepare a multimedia presentation (2-3) pages using Dreamweaver
Unit-3 (Name of the Unit) Contact
Hours:15
Experiment-7 Concepts and usage of Macromedia Director, a multimedia authoring tool.
Experiment-8 Using the Adobe Premiere program for editing and rendering digital video.
Experiment-9 Concepts and usage of HTML and Dreamweaver.
Experiment-10 Javascript with Dreamweaver.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 2
CO2 3 3 2
CO3 3 3 2
CO4 3 3 2
CO5 3 3 2
CO6 3 3 2

12 Code Project Based Learning in Java Lab 0 0 4 0 2 4 CR
21CSP-321/ Course Code(s)
21ITP-323 21CSP-321/ 21ITP-323
CO-REQUISITE 21CST-313,21CSP-314,21CST-315,21CST-316,21CST-319
The course will provide students, the knowledge about the current industry requirements and trends and give the power to find the solution of complex
programming implementations.
• To generate analytical and conceptual ability related to fundamentals of Java. To understand the concepts of Web
application development.
• To understand the concepts of Fundamentals of I/O , Database Connectivity
c. Course Outcomes
CO1 Ability to implement the concepts of Core Java
Implement of the OOPS concepts using Eclipse Environment
CO2 Able to implement the concepts of Collections and able to access database through
Java program, using Java Data Base Connectivity (JDBC)
CO3 Ability to create dynamic web pages, using Servlets and JSP
d. Syllabus
Unit-1 Core Java Contact Hours: 8
<Experiment No 1> Create a application to save the employee information using arrays.
< Experiment No 2> Design and implement a simple inventory control system for a small video rental store.
< Experiment No 3> Create a application to calculate interest for FDs, RDs based on certain conditions using inheritance.
Unit-2 J2EE Contact Hours: 8
< Experiment No 1> Create a program to set view of Keys from Java Hashtable.
< Experiment No 2> Create a program to show the usage of Sets of Collection interface.
< Experiment No 3> Write a Program to perform the basic operations like insert, delete, display and search inlist. List contains String
object items where these operations are to be performed.
< Experiment No4> Create a menu based Java application with the following options.1.Add an Employee2.Display All3.Exit If option 1
is selected, the application should gather details of the employee like employee name, employee id, designation
and salary and store it in afile. If option 2 is selected, the application should display all the employee details. If
option 3 is selected the application shouldexit.
Unit-3 WEB BASED APPLICATIONS Contact Hours: 8
< Experiment No 1> Create a palindrome creator application for making a longest possible palindrome out of given input string.
< Experiment No 2> Create a Servlet/ application with a facility to print any message on web browser.
< Experiment No 3> Create JSP application for addition, multiplication and division.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3
CO2 3 3
CO3 3 3

13 Code Institute/Industrial Summer Training 0 0 0 4 2 4 <UC/PE/PC/MNG>
21CSX-322/ Course Code(s)
21ITX-322 21CSX-322 / 21ITX-322
PRE-REQUISITE 21CSP-312, 21CSP-257, 21CSP-259, 21CST-258
CO-REQUISITE CST-353, CSP-358
ANTI-REQUISITE 21CSR-414
This course includes the practical implementation and applications of the all the core subjects of computer science which includes operating
system, database management system and various programming languages. It focuses on hands on session on various upcoming technologies
covering all the domains computer science.
To keep the students updated with recent technologies
To make them strong in programming language
To make them capable to work on various operating systems and databases
To make the student capable of making projects
c. Course Outcomes
CO1 Mapping of theoretical and practical knowledge
CO2 Graining practical knowledge as per the industrial standards
CO3 Strong foundation for carrier in industry
CO4 Increase in the placement rates.
CO5 Student become capable of making projects
CO6 The students would be updated with the recent technologies
d. Syllabus
Unit-1 Programming with advance data structures & Arduino Contact Hours:
<Experiment No 1> WAP to test various sensors(fire, motion, smoke ) in arduino environment
< Experiment No 2> If object is detected pin 13 will go high (onboard LED ON) and "object detected" message will be displayed in serial
monitor
< Experiment No 3> You are given a tree with N nodes. Each node can either be black or white. You need to find the longest path in
this tree that consists only of black nodes.
Nodes are numbered from 1 to N .
Unit-2 Databases and connectivity Contact Hours:
< Experiment No 1> Configure single node hadoop and implement word count program on centos.
< Experiment No 2> Write a ETL script to take the data from the excel and store in the my sql.
< Experiment No 3> Configure mango database on your systems and run queries on JSON
Unit-3 Network & Security Contact Hours:
< Experiment No 1> WAP to implement the TCP IP program to send the data from one node to another node.
< Experiment No 2> WAP to implement TCP sniffer in any language in linux OS(Prefer Ubuntu 20,16)
< Experiment No 3> WAP to demonstrate the attack of ARP spoofing.
e. Textbooks / Reference Books

• https://researchdesignlab.com/projects/Arduino%20experiments.pdf
• Mastering MongoDB 3.x
• MongoDB: The Definitive Guide, 3rd Edition
• Python penetration testing essentials-second Edition
MOOC course
• AI for Everyone: Master the Basics | edX

• https://onlinecourses.swayam2.ac.in/aic20_sp04/preview
• https://onlinecourses.swayam2.ac.in/nou21_cs01/preview
• https://onlinecourses.nptel.ac.in/noc21_cs04/preview
• Programming for the Web with JavaScript | edX
• Data Analysis for Decision-Making Professional Certificate | edX
f. Assessment Pattern - Internal and External

Theory
Marks 60 40
Total Marks 100
g. Internal Evaluation Component

Sr.No. Type of Weightage of actual Frequency of Final Weightage Remarks
Assessment conduct Task in Internal
Assessment
1 Conduct 20 1 20 All modules should be working
/Implementation without errors
2 Presentation 15 1 15 Good communication skills
3 Report 10 1 10 Report should be according to
the CU template. The report
should be plagiarism free.
4 Viva- Voce 15 1 15 NA
External Evaluation Component
Sr. No. Type of Weightage of actual Frequency of Final Remarks

Assessment conduct Task Weightage in
Internal
Assessment
1 Conduct 10 1 10 All modules should be working
/Implementation without errors
2 Presentation 10 1 10 Good communication skills
3 Report 10 1 10 Report should be according to the
CU template. The report should be
plagiarism free.
4 Attendance 5 1 5 As per the CU norms
5 Certificate 5 1 5 Genuine certificate
h. CO-PO Mapping
Course
Outcome
CO1 3 2 2 3 2
CO2 2 3 3 3
CO3 2 2 2
CO4 2 2
CO5 2 3 3 1 1
CO6 2 3 3 3

14 Soft Skills 0 0 2 0 1 2 MNG
21TDY-301 21TDY-301
PRE-REQUISITE 21TDP-251
COURSE OBJECTIVES:
The Course aims to:

3. impart soft skills practical knowledge to enable students enhance their communication skills and employability.
4. Work upon the students’ accent, pronunciation and MTI.
5. Make students confident and presentable.
COURSE OUTCOMES
On completion of this course, the students are expected-
1. Have enhanced Creative Thinking and effective Presentation Skills.
2. Have developed a learning attitude and enhanced general awareness about various categories to become globally smart and
proficient in performing in group discussions
3. become self-aware and interview ready.
COURSE DESCRIPTION
The course focuses on the building and enhancing the basic soft skills required by the students to become employable and augm ent
their chances of securing a job while sharpening their communication skills. The course will focus on sharpening the spontaneity in the
students and build their confidence by effectively handling various situations related to individual and team performances. Various
activities planned in the course will also focus on augmenting fluency and listening skills of the students while deliberating on essential
grammar, vocabulary, and pronunciation.
TEXT BOOKS:
REFERENCE BOOKS:
R3 Rashmi Bansal, Connecting the Dots, Westland Limited.
COURSE CONTENT:
Unit I: 8.3 Contact Hours

• Soft Skills Recast
• Contriving Lateral Thinking
• Grammar Recap
• Abstract Topic Based GD
• Prepositions, Conjunctions and Presentation Skills
Unit II: 8.3 Contact Hours

• Mastering Writex
• Presentation Skills Know How -1
• Presentation Skills Know How -2
• Resume Writing
• Interview Sneak Peek
Unit III: 8.1 Contact Hours

• Current Topic Based GD
• Reading Comprehension and Para jumbles
• Enhancing Political and Social Knowledge
• Pitching Right
• Building A Positive Perspective

Practical
Components Continuous Internal Assessment (CAE) Semester End Examination (SEE)
Marks 60 40
Total Marks 100
g. CO-PO Mapping
Course
Outcome
CO1 3 3
CO2 3 3
CO3 3 3

15 Aptitude 0 2 0 0 2 2 MNG
21TDY-302 21TDY-302
PRE-REQUISITE 21TDP-251
1. Time, work and efficiency relation with applications
2. Application of proportionality in time and work
3. Applications of speed time and distance in word problems using trains.
4. Relative speed using boats and stream
5. Algebraic manipulations with one and two degree equations.
8. Counting techniques and its real life based problems.
9. Finding the chances of event of occurrence in various different situations.
10. Properties of logarithms and their applications.
The Course aims to:

To generate problem solving skills, counting techniques, ability to analyze the situation, demonstrate various principles involved in solving mathematical
problems and thereby reducing the time taken for performing job functions with logical thinking and applying decision making in all national and
international projects.
c. Course Outcomes
CO1 To improve arithmetic concepts of work, time and efficiency, speed and distance & use of proportionality in work problems enhance
algebra skills, manipulations with algebraic formulas
CO2 To build the approach for logical reasoning, critical thinking, improve data interpretation skill of the student, demonstrate a basic
understanding of displays of data such as bar graphs, histograms, dot plots. able to read between the lines and understand various
language structures
CO3 To improve concept of analytical and verbal reasoning, understanding of discount in real life scenarios and geometry applications in
2D as well as 3D
d. Syllabus
Time & Work Basic problems based on above using LCM method.
Basic work problems based on efficiency of manpower
Chain Rule Solving problems by using concept of direct and indirect proportion
Pipes and Cistern Application of Time and work on Pipes and Cistern
Concept of negative work
Basic and complex problems on above
Time, Speed & Distance Questions based on average speed, relative speed
Linear & Circular Races Concept of races
Concept of meeting points
Concept of meeting at starting point & dead heat ends
Basic problems on above.
Problem on Trains Problems on trains running in opposite or same direction
Basic problems on trains crossing a pole, platform etc.
Boats & Rivers Concept of downstream & upstream.
Basic questions based on speed of boat w.r.t. speed of river
Algebra Polynomials & algebraic equations
Linear equations & quadratic equations
Pie and Tabular Charts Concept of Percentage, average, approximation and ratio
Percentage to degree and vice versa conversion in Pie charts
Detailed analysis of tabular data
Coding- Decoding Concept of EJOTY to learn alphabet.
How to solve abstract problems
Direction Sense Concept of left & right turn (direction).
Clock & anticlockwise movement with East, West, North and South direction.
Basic problems based on above concepts.
Complex problems based on above concepts.
Clocks & Calendars Concept of angles traversed by hour and minute hand
Fundamental problems on above concept.
To find day of week on a given date.
Syllogism Concept of venn diagram
Basic problems of syllogism using venn diagram
Data Sufficiency To check whether the given data is sufficient to uniquely answer the question.
Cubes & Dice Solving problems related to cube cutting painting
Basic problems related to dice faces in different shapes and sizes

Puzzle Solving the puzzles.
Arrangement problems of matrix
Permutation and Fundamental concept of counting: AND and OR
Combination Relation and difference between Permutation and Combination
Different properties of P and C
Applications of the same on different problems
Probability Introduction to different types of events
Concept of sample space and experiment
Application of these concepts on different problems related to coins, dice, cards and balls.
Addition theorem
Logarithm Properties of logs
Application of these properties in different problems
Sequence and Series Introduction to AP, GP and HP
Relationship between mean of AP, GP and HP
Sum and nth term of each
Applications of above mentioned concepts
Geometry and Area Area and perimeter of different 2-D figures
Different properties of 2-D figures
Problems based to above mentioned concepts
Surface Area and Volume Concept of curved and total surface area of different 3-D problems
Concept of volume of 3-D figures
Different properties of 3-D figures.
Problems based on above mentioned concepts
True Discount and
Banker's Discount
TEXT BOOKS:
T1 CU-DCDP – Aptitude Book- TDY-352
T2 CU-DCPD – Logical Reasoning Ability for Campus placements
T3 CU-DCPD – Interpreting Data for Success
T4 CU-DCPD – Data Sufficiency
REFERENCE BOOKS:
R1 Guha Abhijit Quantitative Aptitude for Competitive Examinations 2011 Tata McGraw Hill Publication, 7 West Patel Nagar, New Delhi 110008.
R2 Aggarwal R.S A Modern Approach to Verbal and Non Verbal Reasoning 2012 S.Chand Publishing Kuttab Road, New Delhi.

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3

16 Fundamentals of Image Processing 3 0 0 0 3 3 MNG
21CSY-313 21CSY-313
PRE-REQUISITE
ANTI-REQUISITE
This course covers the investigation, creation and manipulation of digital images by computer. The course consists of theoretical material introducing the
mathematics of images and imaging. Topics include representation of two-dimensional data, time and frequency domain representations, filtering and
enhancement, the Fourier transform, convolution, interpolation. The student will become familiar with Image Enhancement, Image Restoration, Image
Compression, Morphological Image Processing, Image Segmentation, Representation and Description, and Object Recognition.
• Develop a theoretical foundation of Digital Image Processing concepts.
• Provide mathematical foundations for digital manipulation of images.
• Gain experience and practical techniques to write programs for digital manipulation of images.
• Image acquisition; pre-processing; segmentation; Fourier domain processing; and compression.
c. Course Outcomes
CO1 Know and understand the basics and fundamentals of digital image processing, such as digitization, sampling, quantization, and 2D-
transforms.
CO2 Operate on images using the techniques of smoothing, sharpening and enhancement. Understand the restoration concepts and
filtering techniques.
CO3 Learn the basics of segmentation, features extraction, compression and recognition methods for color models.
d. Syllabus
Introduction Definition of digital image, pixels, representation of digital image in spatial domain as well as in matrix form.
Block diagram of fundamentals steps in digital image processing, application of digital image processing system,
Elements of Digital Image, Processing systems, Structure of the Human, Image Formation in the Eye, Brightness
Adaptation and Discrimination, Basic Concepts in Sampling and Quantization, Representing Digital Images,
Spatial and Gray- Level Resolution, Neighbours of a Pixel, Adjacency, Connectivity, Regions, and Boundaries,
Distance Measures between pixels
Image Enhancement and Point operations, Contrast stretching, clipping and thresholding, digital negative, intensity level slicing, log
Filter in Spatial Domain transformation, power log transformation, bit plane slicing, Unnormalized and Normalized Histogram,
Histogram Equalization, Use of Histogram Statistics for Image Enhancement,
Filtering Basics of Spatial Filtering, Linear filters, Spatial Low pass smoothing filters, Averaging, Weighted Averaging,
Non-Linear filters, Median filter, Maximum and Minimum filters, High pass sharpening filters, High boost
filter, high frequency emphasis filter, Gradient based filters, Robert Cross Gradient Operators, Prewitt filters,
Sobel filters, Second Derivative filters, Laplacian filters, Magnification by replication and interpolation
Introduction to Logic Operations involving binary images, Introduction to Morphological Image Processing, Definition of Fit
Morphological Image and Hit, Dilation and Erosion, Opening and Closing.
Processing
Image Segmentation Definition, Similarity and Discontinuity based techniques, Point Detection, Line Detection, Edge Detection using
Gradient and Laplacian Filters, Mexican Hat Filters, Edge Linking and Boundary Detection, Hough Transform,
Thresholding: Global, Local and Adaptive Region Based Segmentation: Region Growing Algorithm, Region Split
and Merge Algorithm.
Representations, Introduction to some descriptors: Chain codes, Signatures, Shape Numbers, Fourier Descriptors, Patterns and
Description and pattern classes, Decision-Theoretic Methods, Introduction to Neural Networks and Neural Network based
Recognition Image Recognition, Overview of Pattern Recognition with block diagram.
Image Compression Need for compression, redundancy, classification of image compression schemes, Huffman coding, arithmetic
coding, dictionary based compression, transform based compression.
Image compression JPEG& MPEG, vector quantization, wavelet based image compression
standards
Text Books:
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson Edition, Latest Edition.
Reference Books:
1. I. Pitas, "Digital Image Processing Algorithms", Prentice Hall, Latest Edition.
2. A. K. Jain, “Fundamental of Digital Image processing”, Prentice Hall of India Pvt. Ltd.,Latest Edition.
3. K. Castlemann, “Digital image processing”, Prentice Hall of India Pvt. Ltd., Latest Edition.
4. P. Monique and M. Dekker, “Fundamentals of Pattern recognition”, Latest Edition.

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3

21UCY-346 21UCY-346
PRE-REQUISITE -
CO-REQUISITE -
ANTI-REQUISITE --
c. Course Outcomes
d. Syllabus
the program.

the mentor.

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
course types
quiz
depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3
CO4 3

Semester-6
Course Evaluation
Type Internal External Total
1 21CSP-351 Competitive Coding – II CR 0 0 2 0 1 2 60 40 100
2 21CST-352 Network Operating System CR 3 0 0 0 3 3 40 60 100
3 21CST-353 Theory of Computation CR 3 0 0 0 3 3 40 60 100
4 21CST-354 Information Security and CR 3 0 0 0 3 3 40 60 100

Cryptography
5 21CST-355 Mobile Application Development CR 2 0 0 0 2 2 40 60 100
6 21CST-357 Internet of Things CR 3 0 0 0 3 3 40 60 100
7 21CST-3** Professional Elective-II DE 2 0 0 0 2 2 60 40 100
8 21CSR-359 Project-III PR 0 0 1 5 3 6 60 40 100
9 21CSP-356 Mobile Application Development CR 0 0 2 0 1 2 60 40 100

Lab
10 21CSP-358 Internet of Things Lab CR 0 0 2 0 1 2 60 40 100
11 21CSP-3** Professional Elective-II Lab DE 0 0 2 0 1 2 0 0 0
12 21TDY-351 Soft Skills : MNG TPP MNG 0 0 2 0 1 2 40 60 100
13 21TDY-352 Aptitude : MNG TPP MNG 0 2 0 0 2 2 40 60 100
14 21CSY-360 Software Project Management : MNG 3 0 0 0 3 3 40 60 100

MNG NTPP
15 21UCY-396 Life Skills and Mentoring : MNG 0 1 0 0 1 1 40 60 100
MNG
16 0 9 13 23 30
TOTAL

1 Code Competitive Coding-II 0 0 2 0 1 2 CR
21CSP-351 Course Code(s)
21CSP-351
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-355,21CST-357,21CST-371,21CSP-356
Competitive programming is the course in which students will learn how to apply algorithms in order to solve complex problems. The goal of
this course is to teach students how to apply familiar algorithms to non-intuitive problems.
Competitive programming is the course in which students will learn how to apply algorithms in order to solve complex problems.
The goal of this course is to teach students how to apply familiar algorithms to non-intuitive problems.
c. Course Outcomes
CO1 Describe how algorithmic problems are solved
CO2 Recognize the time and memory complexity of an algorithm or a structure
CO3 Explain the concrete algorithms and data structures
CO4 Analyze the given problem and recognize sub-problems
CO5 Apply the knowledge on a wider set of problems
CO6 Assemble the solutions of sub-problems to solve the whole problem
d. Syllabus
Unit-1 Data Structures Contact Hours:
Arrays, https://leetcode.com/problems/3sum/
Stacks, Queues and linked https://leetcode.com/problems/jump-game-ii/
list https://leetcode.com/problems/valid-parentheses/
https://leetcode.com/problems/simplify-path/
https://leetcode.com/problems/implement-queue-using-stacks/
https://leetcode.com/problems/queue-reconstruction-by-height/
https://leetcode.com/problems/merge-two-sorted-lists/
https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
https://leetcode.com/problems/reorder-list/
Divide and conquer https://leetcode.com/problems/count-and-say/
https://leetcode.com/problems/1-bit-and-2-bit-characters/
https://leetcode.com/problems/jewels-and-stones/
https://leetcode.com/problems/snakes-and-ladders/
https://leetcode.com/problems/water-and-jug-problem/
https://leetcode.com/problems/find-and-replace-in-string/
Heap https://leetcode.com/problems/kth-largest-element-in-a-stream/
https://leetcode.com/problems/last-stone-weight/
https://leetcode.com/problems/race-car/
https://leetcode.com/problems/cheapest-flights-within-k-stops/
https://leetcode.com/problems/k-closest-points-to-origin/
https://leetcode.com/problems/network-delay-time/
https://leetcode.com/problems/distant-barcodes/
https://leetcode.com/problems/furthest-building-you-can-reach/
https://leetcode.com/problems/swim-in-rising-water/
Greedy https://leetcode.com/problems/candy/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
https://leetcode.com/problems/remove-duplicate-letters/
https://leetcode.com/problems/can-place-flowers/
https://leetcode.com/problems/assign-cookies/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
https://leetcode.com/problems/lemonade-change/
https://leetcode.com/problems/boats-to-save-people/
https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
https://leetcode.com/problems/three-equal-parts/
Trees https://leetcode.com/problems/binary-tree-inorder-traversal/
https://leetcode.com/problems/same-tree/
https://leetcode.com/problems/symmetric-tree/
https://leetcode.com/problems/balanced-binary-tree/
https://leetcode.com/problems/path-sum/
https://leetcode.com/problems/count-complete-tree-nodes/
https://leetcode.com/problems/sum-of-left-leaves/
https://leetcode.com/problems/delete-node-in-a-bst/
https://leetcode.com/problems/diameter-of-binary-tree/
https://leetcode.com/problems/binary-tree-tilt/
Backtracking https://leetcode.com/problems/binary-watch/
https://leetcode.com/problems/stickers-to-spell-word/

https://leetcode.com/problems/all-paths-from-source-to-target/
https://leetcode.com/problems/word-ladder-ii/
https://leetcode.com/problems/subsets/
https://leetcode.com/problems/combinations/
https://leetcode.com/problems/palindrome-partitioning/
Graph https://leetcode.com/problems/is-graph-bipartite/
https://leetcode.com/problems/gray-code/
https://leetcode.com/problems/k-th-symbol-in-grammar/
https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/
https://leetcode.com/problems/the-skyline-problem/
https://leetcode.com/problems/find-the-difference/
https://leetcode.com/problems/predict-the-winner/
https://leetcode.com/problems/construct-the-rectangle/
Dynamic Programming https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
https://leetcode.com/problems/decode-ways/
https://leetcode.com/problems/scramble-string/
https://leetcode.com/problems/climbing-stairs/
https://leetcode.com/problems/unique-paths/
https://leetcode.com/problems/maximum-subarray/
https://leetcode.com/problems/longest-palindromic-substring/
https://leetcode.com/problems/house-robber-ii/
https://leetcode.com/problems/range-sum-query-immutable/
https://leetcode.com/problems/word-break/


Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 1 2 2 3
CO2 3 3 3 1 2 2 3
CO3 3 3 3 1 2 2 3
CO4 3 3 3 1 2 2 3
CO5 3 3 3 1 2 2 3
Co6 3 3 3 1 2 2 3

2 Network Operating System 3 0 0 0 3 3 CR
21CST-352
CO-REQUISITE 21CST-353,21CST-354,21CST-355,21CST-357,21CST-371,21CSP-356
This course develops the necessary skills for students to develop both GUI and command line skills for using and customizing a workstation. Upon
completion, students should be able to customize and use systems for command line requirements and desktop productivity roles.
• This course is indented for students to experience on the technologies included in the Network Operating System.
• Gain in depth knowledge of windows server 2008.
c. Course Outcomes
CO1 Familiarity with Windows server 2008 environment
CO2 Understanding with the concepts of operating system and Networking
CO3 Familiarity with the concept of Active Directory
d. Syllabus
Introduction of Computer Reference Model: OSI Reference Model, TCP/IP reference model, Core protocols of TCP/IP, IProuting,
Networks IProuters, Routing Tables
Introduction to DNS DNS Architecture, Understanding the DNS Domain Namespace, DNS domain name hierarchy, DNS and
Internet domains, DNS delegation
Introduction to DHCP Introduction to DHCP,DHCP Architecture, Benefits to DHCP,DHCP Terminologies and DHCP Server
Responsibility.
Introduction to Introduction to RPC, RPC Dependencies and Interaction, RPC
RPC Architecture, RPC Component and RPC Processes and Interaction.
Introduction to Microsoft Introduction to netmon tool, Installation and configuration of Netmon.
Network Monitoring Tool
Introduction to operating Introduction to operating system, Types ofoperating System: Mainframe, Desktop, Multiprocessor,
System Distributed, Clustered, Multiprogramming, Real time, Embedded and Time Sharing
Operating System Process Management Component, Memory Management component, I/O Management component, File
Components Management component, Protection System, and Networking management component. Comparison of
Microsoft OS(Desktop, Server and Client), Hardware Requirement for OS(Desktop, Server and client
),Workgroups and Domains.
Installing windows server Plan for a server roles and installing windows server core, configure server core, Add and configure server
2008 roles, add backup feature and migrate roles from previous versions of windows server.
Configuring Windows Windows server registry, Control Panel, Delegate administration, Add and removes feature in window server,
Server 2008 initial configuration tasks, server manager console, server manager wizards and windows power shell.
Hyper-V Introducing Hyper-V, Virtual Machines
Introducing to Active role of an AD DS Server, features in AD DS, Common Terminologies and Active Directory Concepts, Active
Directory Directory Schema, Active Directory Objects, Active Directory Concepts, Active Directory Data structure and
storage architecture, Active Directory Structure and storage components, DNS support for active directory,
active directory DNS support components
Install Active Directory Installing a new forest by using the graphical user interface (GUI), Understanding active directory domain.
Domains Services in Servicex functional Levels.
Windows 2008 R2
Active Directory Active Directory Users and Computers. Managing organizational units using Active Directory Users and
Administration Computers, Managing Trusts using Active directory domains and trusts and managing forest trusts using
active directory domains and trusts snap-in
Text Books:
1. Data communication &Networking, Frozen Tata McGraw Hill Publication computer.
2. Data & computer communications, stalling PHI new Delhi.
Reference Books:
1. Capture Network traffic--http://support.microsoft.com/kb/812953.
2. About Network Monitor--http://support.microsoft.com/kb/294818.
3. Traces-http://support.microsoft.com/kb/169292.

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 1 1 1 3 1 1 2 3
CO2 1 2 2 1 3 1 1 2 3
CO3 2 1 2 3 3 1 2 1 3

3 Theory of Computation 3 0 0 0 3 3 CR
21CST-353
CO-REQUISITE 21CST-352, 21CST-354,21CST-355,21CST-357,21CST-371,21CSP-356
This module introduces the theory of computation through a set of abstract machines that serve as models for computation - finite automata, pushdown
automata, and Turing machines - and examines the relationship between these automata and formal languages.
• To understand the concept of formal languages and their relation with finite automata.
• To study and design different finite automata.
• To study context free grammars and ambiguity related issues.
• To gain familiarization with Push- Down Automata and Turing Machines.
• To explore relationship between different classes of formal languages.
c. Course Outcomes
CO1 Classify machines by their power to recognize languages,
CO2 Employ finite state machines to solve problems in computing

CO3 Comprehend the hierarchy of problems arising in the computer sciences
d. Syllabus
Introduction Basic Terminology: Alphabet, Formal Language and operations on formal languages, Examples of formal
languages
Finite automata Concept of Basic Machines, Properties and Limitations of Finite State Machines, Deterministic Finite
Automata(DFA), Non-Deterministic Finite Automata(NFA), Equivalence of DFA and NDFA , Non-Deterministic
Finite automata with Λ-Transitions
Regular expression Regular Languages and Regular Expressions, Kleen’s Theorem. Arden’s Method
Properties of Regular sets The Pumping Lemma for Regular sets, Application of the Pumping Lemma, Closure Properties of Regular Sets,
Myhill- Nerode Theorem and Minimization of Finite Automata, Minimization Algorithm
Finite Automata with Moore and Mealy Machines. Equivalence of Moore and Mealy Machines
output
Context Free Grammars Examples and Definitions, Derivation trees and ambiguity, An Unambiguous CFG for Algebraic Expressions.
Regular Grammar, Simplified forms and Normal forms: Removal of useless symbols and unit production,
Removal of Λ-moves, Chomsky Normal Form (CNF), Griebach Normal Form (GNF)
Context sensitive Context sensitive Language and grammar, Relation between languages of classes
Language
Pushdown Automata Introduction and Definition of Push-Down Automaton, Applications of Push Down Automata
Turing Machines Definitions and Examples, Deterministic and Non- Deterministic Turing Machines, Unsolvable Problems: A
Non-recursive Language and an Unsolvable Problem, PCP Problem and MPCP Problem
More General Languages Recursively Enumerable and Recursive Languages, Unrestricted grammars, Chomsky hierarchies of grammars.
and Grammars
Text Books:
1. Martin J.C., “Introduction to Languages and Theory of Computation”, Tata McGraw-Hill Publising Company Limited, 3rd Edition.
2. Hopcroft J.E. and Ullman J.D., “Introduction to Automata Theory Languages and Computation”, Narosa Publications.
Reference Books:
1. Sipser,” Theory Of Computation, Cengage Learning.
2. Daniel I.A. Cohen, “Introduction to computer Theory”, John Wiley.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 1 - 1 1 2 - 1 1 1 2 1 1 2
CO2 2 2 2 1 1 1 2 1 1 1 1 3 2
CO3 3 1 3 2 1 1 2 1 2 1 1 3 2

4 Information Security and Cryptography 3 0 0 0 3 3 CR
21CST-354
CO-REQUISITE 21CST-352,21CST-353, 21CST-355,21CST-357,21CST-371,21CSP-356
This subject provides an explanation of basic contents of IT security. It focuses on the symmetric and public-key cryptography, cryptographic hash
functions, authentication protocols, digital signatures and certificates. The main goal of this subject is introduction to cryptography.
• To familiarize the students with the basic concepts of services, attacks with its models and concepts of encryption.
• To conceptualize digital signature and different encryption algorithm. To state the various authentication
protocols and their requirements.
• To elucidate an applications of security and their effects on security standards.
• To comprehend IP security and their methods.
c. Course Outcomes
CO1 Conceptualize the various forms of attacks, execute cipher models, and solve the problem based on different security models and
encryption. Also, the students will be able to apply number theory and encryption algorithms.
CO2 Apply authentication protocols that are used to develop digital signatures and perform authentication for software security
standards.
CO3 Implement IP security with SSL and TLS.
d. Syllabus
Introduction & Number Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption
Theory techniques (Symmetric cipher model, substitution techniques, transposition techniques,
steganography).FINITE FIELDS AND NUMBER THEORY: Groups, Rings, Fields-Modular arithmetic-Euclid‟s
algorithm-Finite fields- Polynomial Arithmetic –Prime numbers- Fermat‟s and Euler‟s theorem-Testing for
primality -The Chinese remainder theorem- Discrete algorithms
Block Ciphers Data Encryption Standard-Block cipher principles-block cipher modes of operation- Advanced Encryption
Standard (AES)-Triple DES-Blowfish-RC5 algorithm
Public key cryptography Principles of public key cryptosystems-The RSA algorithm-Key management – Diffie Hellman Key exchange
Hash Functions And Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and
Digital Signatures MAC – MD5–SHA512–HMAC – CMAC – Digital signature and authentication protocols – DSS – EI Gamal –
Schnorr.
Security Practice & Authentication applications – Kerberos – Authentication services – Internet Firewalls for Trusted System:
System Security Roles of Firewalls – Firewall related terminology- Types of Firewalls – Firewall designs –Intruder – Intrusion
detection system – Virus and related threats
E-mail Security Security Services for E-mail-attacks possible through E-mail – establishing keys privacy- authentication of the
source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME
IP Security and Web Overview of IPsec – IP and IPv6-Authentication Header-Encapsulation Security Payload (ESP)- SSL Architecture
Security and its layers
Text Books:
1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March 2013.
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall of India, 2002.
Reference Books:
1. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata McGrawHill.
2. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”, Wiley Publications.
3. Charles Pfleeger, “Security in Computing”, 4th Edition, Prentice Hall ofIndia.
4. Ulysess Black, “Internet Security Protocols”, Pearson EducationAsia.
5. Charlie Kaufman and Radia Perlman, Mike Speciner, “Network Security, Second Edition, Private Communication in Public World”,PHI.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
G. CO-PO Mapping
Course
Outcome
CO1 2 2 3 3 3
CO2 2 2 3 3 3
CO3 2 2 3 3 3

5 MOBILE APPLICATION DEVELOPMENT 2 0 0 0 2 2 CR
21CST-355
CO-REQUISITE 21CST-352,21CST-353,21CST-354 ,21CST-357,21CST-371,21CSP-356
This course introduces students to programming technologies, design and development related to mobile applications. Topics include accessing device
capabilities, industry standards, operating systems, and programming for mobile applications using an OS Software Development Kit (SDK).
• Install and configure Android application development tools.
• Design and develop user Interfaces for the Android platform.
• Save state information across important operating system events.
• Apply Java programming concepts to Android application development.
c. Course Outcomes
CO1 Design and develop User Interfaces for the Android platform.
CO2 Ability to apply general programming knowledge in the field of developing mobile applications.
CO3 Understanding of the specific requirements, possibilities and challenges when developing for a mobile context.
CO4 Understanding of the interactions between user interface and underlying application infrastructure.
CO5 At the end of this course student will Apply essential Android Programming concepts.
CO6 At the end of this course student will Develop various Android applications
d. Syllabus
Introduction: Cost of Mobile Application Development, Importance of Mobile Strategies, Challenges, Myths, Third-Party
Frameworks, Mobile Web Presence, ApplicationsFactors in Developing Mobile Applications :Mobile Software
Engineering ,Frameworks and Tools, Generic UI Development ,Android User
Introduction to Mobility: Mobility Landscape, Mobile Platforms, Mobile apps development, Overview of Android Platform, Setting up the
mobile apps development environment with emulator.Telephony :a. Deciding Scope of an App b. Wireless
Connectivity and Mobile Apps
c. Android Telephony.
Building block of Mobile App user Interface Designing, Layout, User Interface elements, Draw-able, Menu, Activity states and lifecycle,
apps: Interaction among activities.
App functionality based user interface:Threads, Asynchronous task, Services-states and lifecycle,
Notifications, Broadcast receivers, Telephony and SMS API.
Naïve Data Handling: On Device File I/O, Shared preferences, Mobile Databases such as SQLite and enterprise data access.
Sprucing up Mobile Graphics and animation-custom views, canvas, animation API multimedia-audio/video playback and record,
Apps: location aware.
Testing Mobile apps: Debugging Apps, White and Black Box Testing and test automation of apps.
Creating Consumable Web : What is a Web Service, Web Services Languages (Formats), Creating an Example Web Service, Debugging
Services for Mobile Web Services
Devices
Mobile User Interface Effective Use of Screen Real Estate, Understanding Mobile Information Design, Understanding Mobile
Design: Application Users, Understanding Mobile Platforms, Using the Tools of Mobile Interface Design.
Mobile Websites: Choosing a Mobile Web Option, Adaptive Mobile Websites, Dedicated Mobile Websites Mobile Web Apps
with HTML5
Android: Android as Competition to itself, Connecting to the Google Play, Android Development Practices,
Building an App in Android.
Operating Systems iOS: IOS Project, Debugging iOS Apps, Objective-C Basics, Building the Derby App in IOS
Windows Phone 7: Windows Phone 7 Project, Building an App in Windows Phone 7, Distribution.
Text Books:
1. Jeff Mcwherter, Scott Gowell, Professional Mobile Application Development, Wrox Publisher (2012), 1st Ed.
Reference Books:
1. Lauren Darcy, Shane Conder, Sams Teach Yourself Android Application Development in 24 Hrs, 1st ed.
2. Himanshu Dwivedi, Chris Clark, David Thiel, Mobile Application Security, Tata McGraw Hill (2010), 1st Edition.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 2 3 1 3 3 2
CO2 3 2 3 1 3 3 2
CO3 3 2 3 1 3 3 2
CO4 3 2 3 1 3 3 2
CO5 3 2 3 1 3 3 2
CO6 3 2 3 1 3 3 2

6 Internet of Things 3 0 0 0 3 3 CR
21CST-357
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-355 ,21CST-371,21CSP-356
The Internet of Things (IoT) is everywhere. It provides advanced data collection, connectivity, and analysis of information collected by computers
everywhere taking the concepts of Machine-to-Machine communication farther than ever before.
• To study Origins, Drivers and Applications of Internet of Things.
• To study Internet of Things Communications Models.
• To learn what issues are raised by the Internet of Things.
c. Course Outcomes
CO1 With the learning of applications of internet of things, students will be able to know how daily use objects will communicate in future.
CO2 Learning of communication models of IOT will help students to know how different objects can be connected & how communication
will take place.
CO3 Learning of security issues will help students to understand what major problems can arise with IOT like security, privacy,
communication standard & some other legal issues.
CO4 Learning of communication models of IOT will help students to learn basic protocols required for communication & packet size
required for each application.
d. Syllabus
Introduction What is the Internet of Things, Components of IOT, Applications, Different Definitions, Similar Concepts,
Sensing, Actuation, Smart Objects, Smart applications.
IOT Applications for Value Creation and Challenges. IoT Today, IoT as a Network of Networks, Why Is IoT Important, IoT: Critical for
Industry Human Progression, Challenges and Barriers to IoT.
Internet of Things Device-to-Device Communications, Device-to-Cloud Communications, Device-to-Gateway
Communication Models Model, Back-End Data-SharingModel.
Issues Raised by Internet Security Issues, TheIoT Security Challenge, A Spectrum of Security Considerations, Unique Security
of Things Challenges of IoT Devices and Privacy,
Considerations: Internet of Things Privacy Background, Unique Privacy Aspects of Internet of Things,
Interoperability.
Standard Issues IoT Interoperability / Standards Background, Key Considerations and Challenges in IoT Interoperability /
Standards, Regulatory, Legal, and Rights Issues: Data Protection and Crossborder Data Flows, IoT Data
Discrimination, IoT Devices as Aids to Law Enforcement and Public Safety, IoT Device Liability
Proliferation of IOT Used in Legal Actions, Regulatory, Legal, and Rights Issues Summary, Emerging Economy and Development
Devices Issues: Ensuring IoT Opportunities are Global, Economic and Development Opportunities
Case Study Case study on smart homes using internet of things
Text Books:
1. Ovidiu Vermesan, Peter Friess,“Internet of Things-Converging Technologies for Smart Environments & integrated Ecosystem”, River Publications
Netherlands.
2. Internet Society, “An overview of Internet ofThings”.
Reference Books:
1. Pfister, Cuno,” Getting started with the Internet of Things: connecting sensors and microcontrollers to the cloud" ,O'Reilly Media, Inc.",2011.
2. Greenfield, Adam,” Everyware: The dawning age of ubiquitous computing”, New Riders, 2010.

Theory
Marks 40 60
Total Marks 100
1 Assignment 10 marks of each One Per Unit 10 marks As applicable to

assignment course types

2 Exam 12 marks for One per Unit 4 marks depicted above.
each test
Quiz
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3

SN CODES Syllabus L T P S C CH Course Type*
7 Data Mining 2 0 0 0 2 2 DE
21CST-371 21CST-371
PREREQUISITE
21CST-214
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-355,21CST-357 ,21CSP-356
This course is an introductory course on data mining. It introduces the basic concepts, principles, methods, implementation techniques, and applications
of data mining, with a focus on two major data mining functions: (1) pattern discovery and (2) cluster analysis.
1. To understand the data analysis techniques
2. To understand the concepts behind machine learning
c. Course Outcomes
CO1 Understating with various mining techniques for data
CO2 Understanding with clustering techniques
CO3 Understanding with the research field of Big Data
d. Syllabus
Unit-1 Basic Data Analysis Contact Hours:15
Chapter-1: What is Data Mining, Data Mining Goals, Stages of Data Mining Process, Basic of Related technologies -
Introduction To Data Machine Learning, DBMS, OLAP, Statistics.
Mining:
Chapter 2- Review of Types of data, Data quality, Data pre-processing.
Statistical methods and
Data:
Chapter-3: Supervised and Unsupervised Learning concepts, exploratory data analysis, Regression and Classification
Machine learning and EDA techniques, Clustering, Association .
Unit-2 Methods for Data mining Contact Hours:15
Chapter-4: Regression: Ordinary Least Squares, Ridge Regression, Lasso Regression, ANOVA(Analysis of Variance): Bias-
Regression & ANOVA: Variance Dichotomy Model Validation Approaches
Chapter-5: K -Nearest Neighbors, Regression and Classification Trees, Support Vector Machines, Dimensionality
Supervised and Predictive Reduction
Analysis:
Unit-3 Big data mining Contact Hours:15
Chapter-6: Clustering-K-means, Associative Rule and market basket analysis-Apriori, recommendation systems.
Unsupervised Learning:
Chapter-7: Introduction, Characteristics and challenges, Big data vs data science vs data analytics vs Big data analytics,
Big data and Data Map reduce.
Analysis:
Text books:
1. EMC Education Services, Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Presenting Data. John Wiley & Sons, 2015.
2. Jaiwei Han, Micheline Kamber, “Data Mining Concepts and Techniques”, Elsevier, 2006.
3. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.
Reference Book:
1. Cathy O’Neil and Rachel Schutt. Doing Data Science, Straight Talk From The Frontline. O’Reilly. 2014
2. Introduction to Data Mining by Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, 2005.
3. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques (Second Edition), Morgan Kaufmann, 2005.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
G. CO-PO Mapping
Course
Outcome
CO1 3 3 2 2 3
CO2 3 3 2 2 3
CO3 3 3 2 2 3

7 Deep Learning 2 0 0 0 2 2 DE
21CST-372 21CST-372
PREREQUISITE
21CST-316
Deep Learning is one of the most highly sought after skills in AI. In this course, student will learn the foundations of Deep Learning, understand how to
build neural networks, and learn how to lead successful machine learning projects.
1. This subject is designed to impart fundamental knowledge on emerging fields of sciences like Machine Learning.
2. It is designed to impart knowledge on how to apply knowledge in application and research field.
c. Course Outcomes:
CO1 Understanding with the concepts of neural network and machine learning
CO2 Understanding with various supervised and unsupervised learning techniques
CO3 Understanding with the concept of deep learning
d. Syllabus:
Unit-1 Basic Machine Learning Contact Hours:15
Chapter-1: Introduction: Machine Learning Algorithms, Training, Validation, Testing, Types of learning. Supervised, Unsupervised
learning, Over-fitting, Under-fitting, Cross validation, Regularization
Chapter-2: Artificial and biological neural networks, Neural Networks Characteristics, Introduction to Deep Learning,
Neural Network: Challenges motivating deep learning, artificial neural net terminology, model of neuron, application areas
Unit-2 Deep Neural Network and Optimization Contact Hours:15
Chapter-3: Hyper-parameters and validation sets, Types of Neural Networks, Multilayer Perceptron, Feed Forward
Deep Networks Modern Neural Networks, Backpropagation, Convolutional Neural Nets (CNN), Self Organizing Maps (SOMs), Deep
Practices: Belief Networks (DBNs).
Chapter-4: Performance Metrics, Hyper-parameters Optimization, Ensemble Neural Network, Bagging, Boosting,
Optimization of Training Bootstrapping, Performance Comparison of Deep Learning Neural Network with standard state-of-the-art
Deep Models: classifiers.
Unit-3 Deep Learning Research Contact Hours:15
Chapter-5: Feature Selection, Linear Factor Models, large scale deep learning. Overview of Keras and Tensor Flow.
Deep Learning Research:
Chapter-6: Application of NN in pattern recognition, Computer Vision and decision making.
Practical Methodology:
TEXT BOOKS:
T1. Goodfellow, Bengio, and Courville’s, “Deep Learning” MIT press book.
T2. Yegna Narayanan, “Artificial Neural Networks”. 8th Printing. PHI (2003)
REFERENCE BOOKS:
R1. Patterson Dan W, “Introduction to artificial Intelligence and Expert systems”, 3rd Ed., PHI
R2. Jacek M Zaurada, “Introduction to artificial neural Networks Jaico Publishing Home, Fouth Impression.
R3. Neural Networks and Deep Learning by Michael Nielsen
R4. Deep Learning by Microsoft Research
R5. Deep Learning Tutorial by LISA lab, University of Montreal
R6. Simon Haykin, “Neural Networks” Pearson Education.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 3 2 3
CO2 3 3 3 2 3 2 3
CO3 3 3 3 2 3 2 3

7 Code WEB TECHNOLOGIES 2 0 0 0 2 2 DE
21CST-373 21CST-373
The focus in this course is on the World Wide Web as a platform for interactive applications, content publishing and social services. The
development of web-based applications requires knowledge about the underlying technology and the formats and standards the web is
based upon. In this course you will learn about the HTTP communication protocol, the markup languages HTML, XHTM L and XML, the CSS
and XSLT standards for formatting and transforming web content, interactive graphics and multimedia content on the web, client-side
programming using Javascript.
This Subject is useful for Making own Web page and how to host own web site on internet. Along with that Students will also learn about the
protocols involv in internet technology.
c. Course Outcomes
CO1 History and development of the World Wide Web and associated technologies.
CO2 The client-server architecture of the World Wide Web and its communication protocol HTTP/HTTPS.
CO3 Formats and languages used in modern web-pages: HTML, XHTML, CSS, XML, XSLT, Javascript, DOM
CO4 Programming web pages with Javascript/DOM (client)
CO5 Good design, universal design, multi platform web applications
d. Syllabus
Chapter-1: Introduction to WWW : Protocols and programs, secure connections, application and development tools, the
Introduction: web browser, What is server, choices, setting up UNIX and Linux web servers, Logging users, dynamic IP
Web Design: Web site design principles, planning the site and navigation
Chapter-2: Introduction to HTML : The development process, Html tags and simple HTML forms, web site structure
Introduction to HTML Introduction to XHTML : XML, Move to XHTML, Meta tags, Character entities, frames and frame sets,
insidebrowser.
Unit-2 Style Sheets & Java Script Contact Hours:15
Chapter-3: Need for CSS, introduction to CSS, basic syntax and structure, using CSS, background images, colors and
Style Sheets properties, manipulating texts, using fonts, borders and boxes, margins, padding lists, positioning using CSS,
CSS2
Chapter-4: Javascript : Client side scripting, What is Javascript, How to develop Javascript, simple Javascript, variables,
Java Script functions, conditions, loops and repetition
Advance script, Javascript and objects, Javascript own objects, the DOM and web browser environments,
forms and validations
DHTML : Combining HTML, CSS and Javascript, events and buttons, controlling your browser, Ajax:
Introduction, advantages & disadvantages ,Purpose of it ,ajax based web application, alternatives of ajax
Unit-3 XML and PHP Contact Hours:15
Chapter-5: XML : Introduction to XML, uses of XML, simple XML, XML key components, DTD and Schemas, Well formed,
XML using XML with application.XML, XSL and XSLT.
Introduction to XSL, XML transformed simple example, XSL elements, transforming with XSLT
Chapter-6: Starting to script on server side, Arrays, function and forms, advance PHP
PHP Databases : Basic command with PHP examples, Connection to server, creating database, selecting a database,
listing database, listing table names creating a table, inserting data, altering tables, queries, deleting database,
deleting data and tables, PHP myadmin and database bugs.

1. Steven Holzner, ”HTML Black Book”, Dremtech press.
2. Web Technologies, Black Book, Dreamtech Press
3. Web Applications : Concepts and Real World Design, Knuckles, Wiley-India
4. Internet and World Wide Web How to program, P.J. Deitel & H.M. Deitel Pearson.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
e. CO-PO Mapping
Course
Outcome
CO1 2 3 2 3
CO2 2 3 2 3
CO3 2 3 2 3
CO4 2 3 2 3
CO5 2 3 2 3

7 Code UI/UX Design 2 0 0 0 2 2 DE
21CST-374 21CST-374
The design of user interfaces for machines and software, such as computers, home appliances, mobile devices, and other electronic devices, with the
focus on maximizing the user experience. The goal of user interface design is to make the user’s interaction as simple and efficient as possible, in terms of
accomplishing user goals (user-centered design).
1. Describe the web user Interface
2. Describe the structure of user Interface and design process
3. Organize the web systems and control
c. Course Outcomes:
CO1
Students are expected to describe the Characteristics of Graphics Interface and its Principles
.
CO2
Students are expected to design the standards and structures for Human computer interaction
CO3
Students are expected to explain the technical details of multimedia data representations.
d. Syllabus:
Chapter-1: Contents: Human–Computer Interface, Characteristics Of Graphics Interface, Direct Manipulation Graphical
Introduction: System, Web User Interface, Popularity, Characteristic & Principles.
Chapter-2: User Interface Design Process, Obstacles, Usability, Human Characteristics In Design, Human Interaction Speed,
Human Computer Business Functions, Requirement Analysis, Direct, Indirect Methods, Basic Business Functions, Design
Interaction Standards, System Timings, Human Consideration In Screen Design, Structures Of Menus.
Functions Of Menus–Contents Of Menu, Formatting, Phrasing The Menu, Selecting Menu Choice–Navigating
Menus, Graphical Menus.
Unit-2 Windows Contact Hours:15
Chapter-3: Contents: Characteristics, Components, Presentation Styles, Types, Managements–Organizations, Operations,

Windows Web Systems, Device, Based Controls Characteristics–Screen, Based Controls, Operate Control, Text Boxes,
Selection Control–Combination Control, Custom Control, Presentation Control.
Unit-3 Multimedia and Windows Layout Test Contact Hours:15
Chapter-5: Text For Web Pages, Effective Feedback, Guidance & Assistance–Internationalization, Accessibility, Icons,
Multimedia Image, Multimedia, Coloring.
Chapter-6: Contents: Prototypes, Kinds Of Tests, Retest, Information Search, Visualization, Hypermedia, WWW, Software
Window Layout test Tools.
Textbooks:
T1. Wilbent. O. Galitz ,“The Essential Guide To User Interface Design”, John Wiley& Sons, 2001.
T2. Ben Sheiderman, “Design The User Interface”, Pearson Education, 1998.T3. Li & Drew, “ Fundamentals of Multimedia” , Pearson Education,
2009.
REFERENCE BOOKS:
R1. Alan Cooper, “The Essential Of User Interface Design”, Wiley-Dream Tech Ltd.,2002.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
f. CO-PO Mapping
Course
Outcome
CO1 3 2 3
CO2 3 2 3
CO3 3 2 3

SN Code Course Title L T P S C CH Practical
8 Project - III 0 0 1 5 3 6 PR
21CSR-359 21CSR-359
PRE-REQUISITE 21CST-311, 21CST-313, 21CSP-315, 21CST-319, 21CSP-313, 21CSP-319, 21CST-151, 21CSP-
152, 21ECP-118, 21CST-211, 21CST-214,
CO-REQUISITE 21CST-352, 21CST-353, 21CST-355, 21CSP-355, 21CSP-358,
The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimized code preparation, systematic documentation and other associated aspects
of Software Development. The assessment would be through the project demonstration and the Project Report, which should portray Programming Style, Structured Design, Minimum
Coupling, High Cohesion, Good documentation of the code to ensure readability and ease of maintenance.
5. Develop openness to new ideas in computer science, develop the ability to draw reasonable inferences from observations and learn to formulate and solve new computer
science problems using analytical and problem-solving skills;
6. Develop the ability to synthesize and integrate information and ideas, develop the ability to think creatively, develop the ability to think holistically and develop the ability to
distinguish between facts and opinion;
7. Develop the ability to work individually and as part of a team, develop a commitment to accurate work, develop management skills, improve speaking and writing skills,
improve the ability to follow directions, instructions and plans, and improve the ability to organize and use time effectively;
8. Develop a commitment to personal achievement, the ability to work skilfully, informed understanding of the role of science and technology, a lifelong love of learning, and cultivate
a sense of responsibility for one's own behaviour and improve self-esteem/self-confidence.
c. Course Outcomes: Upon successful completion of this course students will be able to
CO1 Work on a project of latest topic / research area / industrial applications preferably using the tool or language learned in previous or current semester.


Practical
Components Continuous Internal Assessment Semester End Examination
(CAE) (SEE)
Marks 60 40
Total Marks 100
e. Internal Evaluation Component

Sl No. Type of Assessment Weightage of actual conduct Frequency of Task Final Weightage in Internal Remarks
Assessment (Graded/Non-Graded)
1 Project Proposal Submission 5 1 5 Graded

3 Project Design and Modeling 10 1 10 Graded
5 IEEE Paper/ Patent/ H/w 5 2 5 Graded
Product
6 Final Project Assessment + 20 1 20 Graded
viva
f. CO-PO Mapping
CO1 3 2 3 3

CO2 3 3 2
CO3 2 3 3
CO4 2 3 2 3
CO5 3 3

9 Code Mobile Application Development Lab 0 0 2 0 1 2 CR
21CSP-356
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-355,21CST-357,21CST-371
The subject includes accessing device capabilities, industry standards, operating systems, and programming for mobile applications using an OS Software
Development Kit (SDK). Upon completion students should be able to create basic applications for mobile devices. Course Hours per Week: Class
• The ability to understand the Mobile application development lifecycle and methodologies of software systems.
• The ability to learn competent skills and knowledge of mobile application software design process.
c. Course Outcomes
CO1 Student should get the knowledge of Eclipse Indigo and Java.
CO2 Student should get the knowledge of basic operation in Eclipse Indigo and Java.
CO3 Student should get the knowledge about various functions and methods using for mobile application development
d. Syllabus
(Name of the Unit) Contact Hours:
<Experiment No 1> Setting Up the Development Environment

< Experiment No 2> Create "Hello World" Application
< Experiment No 3> Create Application by Using Widgets
< Experiment No 1> Creating the Application by using Tex Edit control
< Experiment No 2> Creating the Application Choosing Options CheckBox
< Experiment No 3> Creating the Application Choosing Options RadioButton
< Experiment No4> Creating the Application Choosing Options RadioGroup
< Experiment No 1> Create Application by Using Building Blocks for Android Application (Design by using Linear Layout)
< Experiment No 2> Create Application by Using Building Blocks for Android Application (Design by using Relative Layout)
< Experiment No 3> Create Application by Using Building Blocks for Android Application (Design by using Absolute Layout)
< Experiment No 4> Create Application by Using Building Menus and Storing Data
< Experiment No 5> Design the Application for Menus and Action Bar

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 3 2
CO2 3 3 2 3 2
CO3 3 3 2 3 2

10 Code Internet of Things Lab 0 0 2 0 1 2 CR
21CSP-358
The Internet of Things (IoT) is a course about the new paradigm of objects interacting with people, with information systems, and with other objects.
The course will focus on creative thinking and on hands-on project development.
To understand functioning of various IOT techniques.
c. Course Outcomes
CO1 Student should get the knowledge of Python and Eclipse background.
CO2 Student should get the knowledge of Arithmetic and looping operation in python
CO3 Student should get the knowledge of Arduino Board and different types of LED and Sensors.
CO4 Student should get the knowledge of MQTT
CO5 Student should get the knowledge of Raspberry Pi
d. Syllabus
<Experiment No 1> Study and Install Python in Eclipse and WAP for data types in python
< Experiment No 2> Write a Program for arithmetic operation in Python
< Experiment No 3> Write a Program for looping statement in Python
< Experiment No 1> Study and Install IDE of Arduino and different types of Arduino.
< Experiment No 2> Write program using Arduino IDE for Blink LED.
< Experiment No 3> Write Program for RGB LED using Arduino.
< Experiment No4> Study the Temperature sensor and Write Program foe monitor temperature using Arduino.
< Experiment No 1> Study and Implement RFID, NFC using Arduino.
< Experiment No 2> Study and implement MQTT protocol using Arduino. Study and Configure Raspberry Pi
< Experiment No 3> WAP for LED blink using Raspberry Pi.
< Experiment No 4> Study and Implement Zigbee Protocol using Arduino / Raspberry Pi.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 2 3 2 3
CO2 2 2 3 2 3 2 3
CO3 2 2 3 2 3 2 3
CO4 2 2 3 2 3 2 3
CO5 2 2 3 2 3 2 3

11 Data Mining lab 0 0 2 0 1 2 DE
21CSP-376 21CSP-376
PREREQUISITE 21CST-214
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-355,21CST-357 ,21CSP-356
The main objective of this lab is to impart the knowledge on how to implement classical models and algorithms in data warehousing and data
mining and to characterize the kinds of patterns that can be discovered by association rule mining, classification and clustering.
o To understand the data analysis techniques
o To understand the concepts behind machine learning
c. Course Outcomes
CO1 To be able to analyze any kind of data set
CO2 To be able to use regressions models as per need
CO3 To be able to deal with machine learning problems
d. Syllabus
EXPERIMENT 1 Implement Exploratory Data Analysis of any data set.

EXPERIMENT 2 Implement Linear Regression on any data set
EXPERIMENT 3 Implement Logistic Regression on any data set.
EXPERIMENT 4 Implement K-Nearest Neighbor on any data set
Unit-2 Methods for data mining Contact Hours:15
EXPERIMENT 5 .Implement Support Vector Machine on any data set.

EXPERIMENT 6 Implement Dimension reduction on any data set.
EXPERIMENT 7 Implement K-means clustering algorithm (cluster some sample data set into disjoint clusters using K-means)
Unit-3 Unsupervised Learning Contact Hours:15
EXPERIMENT 8 Implement Market Basket Analysis on real time data in python.

EXPERIMENT 9 Implement Recommender system for Netflix/Youtube/ in python.
EXPERIMENT 10 Implement Restaurant revenue prediction using data-mining techniques in python.
TEXT BOOKS:
T1. Introduction to Machine Learning with Python - A Guide for Data Scientists by Muller Andreas.
T2. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: Concepts, Tools, and Techniques to Build Intelligent Systems 2nd
Edition by Aurélien Géron.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 2 2
CO2 3 3 3 2 2
CO3 3 3 3 2 2

11 Deep Learning lab 2 0 2 0 3 4 DE
21CSP-377 21CSP-377
PREREQUISITE
21CST-316
This course is an introduction to deep learning, a branch of machine learning concerned with the development and application of modern neural
networks. Deep learning algorithms extract layered high-level representations of data in a way that maximizes performance on a given task.
1. This subject is designed to impart fundamental knowledge on emerging fields of sciences like Machine Learning.
2. It is designed to impart knowledge on how to apply knowledge in application and research field.
c. Course Outcomes
CO1 Familiarization with Tenserflow and Keras
CO2 Familiarization with basic classifiers like SVM
CO3 Familiarization with Clustering techniques
d. Syllabus
EXPERIMENT 1 Implement Exploratory Data Analysis of any data set
EXPERIMENT 2 Implement Linear Regression on any data set
EXPERIMENT 3 Implement Support Vector Machine and Logistic Regression on any data set.
EXPERIMENT 4 Implement K-Nearest Neighbor on any data set.
Unit-2 Deep Neural Network and Optimization Contact Hours:15
EXPERIMENT 5 Implement K-means clustering algorithm (cluster some sample data set into disjoint clusters using K-means).
EXPERIMENT 6 Implement Agglomerative clustering algorithms on any data set.
EXPERIMENT 7 Implement Single Layer and Multi layer perceptron on any data set.
Unit-3 Deep Learning Research Contact Hours:15
EXPERIMENT 8 Demonstrate TensorFlow and Keras for any data.

EXPERIMENT 9 Implement CNN for any application or dataset.
EXPERIMENT 10 Implement any application of deep learning using TensorFlow
TEXT BOOKS:
T1. Introduction to Machine Learning with Python - A Guide for Data Scientists by Muller Andreas
T2. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: Concepts, Tools, and Techniques to Build Intelligent Systems 2nd
Edition by Aurélien Géron

Theory

Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

11 Code WEB TECHNOLOGIES Lab 0 0 2 0 1 2 DE
21CSP-378 21CSP-378
This course provides a basic overview and understanding of many key Web technologies without delving into programming, CSS,
scripting, and interactive Web pages. Web and application servers, PHP, content management systems. Rich Internet Applications and
multimedia.
This Subject is useful for Making own Web page and how to host own web site on internet. Along with that Students will also learn about the
protocols involve in internet technology.
c. Course Outcomes
CO1 After Studying that subject students would have capability to make own web site andhost their own web site on internet.
CO2 Also students would have enough knowledge about what are the technologies used in internet.
d. Syllabus
Experiment-1 • Design web pages for your college containing a description of the courses, departments, faculties,
library etc, use href, list tags.
• Create your class timetable using table tag.
• Create user Student feedback form (use textbox, text area , checkbox, radio button, select box etc.)
Experiment-2 • Create a web page using frame. Divide the page into two parts with Navigation links on left hand
side of page (width=20%) and content page on right hand side of page (width = 80%). On clicking
the navigation Links corresponding content must be shown on the right hand side.
• Write html code to develop a webpage having two frames that divide the webpage into two equal
rows and then divide the row into equal columns filleach frame with a different background color.
• Create your resume using HTML tags also experiment with colors, text , link ,size and also other tags
you studied.
Experiment-3 • Design a web page of your home town with an attractive background color, text
• color, an Image, font etc. (use internal CSS).
• Use Inline CSS to format your resume that you created.
• Use External CSS to format your class timetable as you created.
• Use External, Internal, and Inline CSS to format college web page that you created.
Experiment-4 • Develop a JavaScript to display today’s date.

• Develop simple calculator for addition, subtraction, multiplication and division
• operation using JavaScript
• Create HTML Page with JavaScript which takes Integer number as input and tells whether the
number is ODD or EVEN.
Experiment-5 • Create HTML Page that contains form with fields Name, Email, Mobile No , Gender , Favorite Color
and a button now write a JavaScript code to combine
• and display the information in textbox when the button is clicked.
• Implement Validation in above Feedback Form.
• Use regular expression for validation in Feedback Form.
• Using ajax retrieve data from a TXT file and display it.
Experiment-6 • Create XML file to store student information like Enrollment Number, Name ,Mobile Number ,
Email Id.
• Create DTD for above XML File.
• Create XML Schema for above ( Practical No. 18 )
Experiment-7 • Create XSL file to convert above (refer Practical No. 17 ) XML file into
• XHTML file.
• Write a php program to display today’s date in dd-mm-yyyy format.
• Write a php program to check if number is prime or not.
Experiment-8 • Write a php program to print first 10 Fibonacci Numbers.
• Create HTML page that contain textbox, submit / reset button. Write php
• program to display this information and also store into text file.
Experiment-9 • Write a php script to read data from txt file and display it in html table (the file
• contains info in format Name: Password: Email )
• Write a PHP Script for login authentication. Design an html form which takes
• username and password from user and validate against stored username and password in file.

Experiment-10 • Write PHP Script for storing and retrieving user information from MySql table.
1. Design A HTML page which takes Name, Address, Email and Mobile No. From user ( register.php )
2. Store this data in Mysql database / text file.
3. Next page display all user in html table using PHP ( display.php )
• Write a PHP script for user authentication using PHP-MYSQL. Use session for storing username.
• Using ajax fetch information from a database with AJAX.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3

11 Code UI/UX Design Lab 0 0 2 0 1 2 DE
21CSP-379 21CSP-379
In this course, students will learn how to design a User Interface.
1. The course is oriented toward practical methods for approaching a design problem holistically, beyond usability and usefulness.
2. This introduces students to the methods and tools used in UI UX Design. It focuses on the early design stages of a product’s lifecycle, and aims to
ensure the UI/UX will meet user needs; some example tools and methods to be covered include personas, scenarios, storyboards, focus groups,
wire-framing, prototyping, InVision, Axure, Balsamiq, etc.
3. This course will serve as an introduction to these methods; no prior UI /UX design experience is necessary.
c. Course Outcomes
CO1 Use, adapt and extend design standards, guidelines, and patterns focusing on user experience
CO2 Employ selected design methods at a basic level of competence: diary studies, mood boards, storyboarding, sketching, video
scenarios, and experience prototyping
d. Syllabus
Experiment-1 Input & Output controls and widgets
Experiment-2 Design techniques such as scenarios, personas, storyboards, wireframing, and information architecture.
Experiment-3 App Design and its principles
Experiment-4 Prototyping tools, both low-fidelity and high-fidelity.
Experiment-5 Design for small screens, responsive design
Experiment-6 Non-GUI design (e.g., auditory interfaces, gesture interfaces).
Experiment-7 Pattern of UI / UX Design
Experiment-8 Flow & Layout & Organizational structures
Experiment-9 Swing Programming Introduction & Widgets
Experiment-10 UI Widgets & Input Devices

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3

12 Soft Skills 0 0 2 0 1 2 MNG
21TDY-351 21TDY-351
PRE-REQUISITE 21TDY-301
The course focuses on the building and enhancing the basic soft skills required by the students to become employable and augment their
chances of securing a job while sharpening their communication skills. The course will focus on sharpening the spontaneity in the students
and build their confidence by effectively handling various situations related to individual and team performances. Various activities
planned in the course will also focus on augmenting fluency and listening skills of the students while deliberating on essent ial grammar,
vocabulary, and pronunciation.
The Course aims to:
To attain proficiency in wide variety of soft skills resilience, teamwork along, leadership and effective communication with lifelong learn ing
focusing on interpersonal skills, negotiating skills and mastering verbal communication enabling the students to create a niche for themselves
with an ease in the corporate world, at both national and international level.
c. Course Outcomes
CO1 Have enhanced Creative Thinking and effective Presentation Skills
CO2 Have developed a learning attitude and enhanced general awareness about various categories to become globally smart
and proficient in performing in group discussions
CO3 become self-aware and interview ready
d. Syllabus
<Chapter Name 1> • A Session Exordium
• Business Case Studies
• Situational Analysis
• Grammar Reinforcement
• Current Topics Based GD's

<Chapter Name 1> • Guesstimates
• Descriptive Writing
• Abstract Topic Based GD's
• Ed Talk 1
• Ed Talk 2

<Chapter Name 1> • Interview 360
• Stress Interviews
• Divergent Thinking
• Panel Discussions
• Panel Interviews
TEXT BOOKS:
REFERENCE BOOKS:
R3 Rashmi Bansal, Connecting the Dots, Westland Limited.

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 3 2
CO2 2 2 3 3 2
CO3 2 2 3 3 2

13 Aptitude 0 2 0 0 2 30 MNG
21TDY-352 21TDY-352
PRE-REQUISITE 21TDY-302
CO-REQUISITE 21CST-353,21CST-354,21CST-355,21CST-357,21CST-371,21CSP-356
ANTI-REQUISITE --
1. Time, work and efficiency relation with applications
2. Application of proportionality in time and work
3. Applications of speed time and distance in word problems using trains.
4. Relative speed using boats and stream
5. Algebraic manipulations with one and two degree equations.
8. Counting techniques and its real life based problems.
9. Finding the chances of event of occurrence in various different situations.
10. Properties of logarithms and their applications.
The Course aims to:

To generate problem solving skills, counting techniques, ability to analyze the situation, demonstrate various principles involved in solving mathematical
problems and thereby reducing the time taken for performing job functions with logical thinking and applying decision making in all national and
international projects.
c. Course Outcomes
CO1 To improve arithmetic concepts of work, time and efficiency, speed and distance &use of proportionality in work problems enhance
algebra skills, manipulations with algebraic formulas
CO2 To build the approach for logical reasoning, critical thinking, improve data interpretation skill of the student, demonstrate a basic
understanding of displays of data such as bar graphs, histograms, dot plots. able to read between the lines and understand various
language structures
CO3 To improve concept of analytical and verbal reasoning, understanding of discount in real life scenarios and geometry applications in
2D as well as 3D.
d. Syllabus
Time & Work Basic problems based on above using LCM method.
Basic work problems based on efficiency of manpower.
Chain Rule Solving problems by using concept of direct and indirect proportion
Pipes and Cistern Application of Time and work on Pipes and Cistern
Concept of negative work
Basic and complex problems on above
Time, Speed & Distance Questions based on average speed, relative speed
Linear & Circular Races Concept of races
Concept of meeting points
Concept of meeting at starting point & dead heat ends
Basic problems on above
Problem on Trains Problems on trains running in opposite or same direction
Basic problems on trains crossing a pole, platform etc.
Boats & Rivers Concept of downstream & upstream.
Basic questions based on speed of boat w.r.t. speed of river.
Algebra Polynomials & algebraic equations
Linear equations & quadratic equations
Pie and Tabular Charts Concept of Percentage, average, approximation and ratio
Percentage to degree and vice versa conversion in Pie charts
Detailed analysis of tabular data
Coding- Decoding Concept of EJOTY to learn alphabet.
How to solve abstract problems
Direction Sense Concept of left & right turn (direction).
Clock & anticlockwise movement with East, West, North and South direction.
Basic problems based on above concepts.
Complex problems based on above concepts
Clocks & Calendars Concept of angles traversed by hour and minute hand
Fundamental problems on above concept.
To find day of week on a given date
Syllogism Concept of venn diagram
Basic problems of syllogism using venn diagram
Data Sufficiency To check whether the given data is sufficient to uniquely answer the question
Cubes & Dice Solving problems related to cube cutting painting
Basic problems related to dice faces in different shapes and sizes
Puzzle Solving the puzzles.

Arrangement problems of matrix.
Permutation and Fundamental concept of counting: AND and OR
Combination Relation and difference between Permutation and Combination
Different properties of P and C
Applications of the same on different problems
Probability Introduction to different types of events
Concept of sample space and experiment
Application of these concepts on different problems related to coins, dice, cards and balls.
Addition theorem
Logarithm Properties of logs
Application of these properties in different problems
Sequence and Series Introduction to AP, GP and HP
Relationship between mean of AP, GP and HP
Sum and nth term of each
Applications of above mentioned concepts
Geometry and Area Area and perimeter of different 2-D figures
Different properties of 2-D figures
Problems based to above mentioned concepts
Surface Area and Volume Concept of curved and total surface area of different 3-D problems
Concept of volume of 3-D figures
Different properties of 3-D figures.
Problems based on above mentioned concepts
TEXT BOOKS:
T1 CU-DCDP –Aptitude Book-TDY-352
T2 CU-DCPD – Logical Reasoning Ability for Campus placements
T3 CU-DCPD – Interpreting Data for Success
T4 CU-DCPD – Data Sufficiency
REFERENCE BOOKS:
R1 GuhaAbhijit Quantitative Aptitude for Competitive Examinations 2011 Tata McGraw Hill Publication, 7 West Patel Nagar, New Delhi 110008.
R2 Aggarwal R.S A Modern Approach to Verbal and Non Verbal Reasoning 2012 S.Chand Publishing Kuttab Road, New Delhi. 011-
23672080

Theory
Marks 40 60
Total Marks 100

assignment
each test
As applicable to
quiz
course types
depicted above.
questions)

Engagement Task

g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 1 3
CO2 2 2 3 1 3
CO3 2 2 3 1 3

14 SOFTWARE PROJECT MANAGEMENT 3 0 0 0 3 3 MNG
21CSY-360 21CSY-360
The course provides an in depth examination of project management principles and modern software project management practices. Methods for
managing and optimizing the software development process are discussed along with techniques for performing each phase of the
systems development lifecycle.
• Introduces the concepts and methods required for the construction of large software systems.
• Gain knowledge on the principles and techniques of software project management.
Provides an understanding of both theoretical and methodological issues involved in software engineering project management.
c. Course Outcomes:
I. 1 To implement modeling, communication, construction and deployment practices in software development.

II. 2 To estimate project costs and perform cost-benefit evaluation among projects.
III. 3 To apply schedule and cost control techniques for project monitoring.
d. Syllabus
Unit-1 SOFTWARE PROJECT EVALUATION AND PROJECT PLANNING Contact Hours: 15
<Chapter Name 1> Importance of Software Project Management – Activities Methodologies – Categorization of Software Projects
– Setting objectives – Management Principles – Management Control – Project portfolio Management – Cost-
benefit evaluation technology
<Chapter Name 2> Risk evaluation – Strategic program Management – Stepwise Project Planning-Software process and Process
Models – Choice of Process models
<Chapter Name 3> Mental delivery – Rapid Application development – Agile methods – Extreme Programming – SCRUM –
Managing interactive processes
Unit-2 SOFTWARE PROJECT LIFE CYCLE AND EFFORT ESTIMATION Contact Hours: 15
<Chapter Name 1> Basics of Software estimation – Effort and Cost estimation techniques – COSMIC Full function points -
COCOMO II A Parametric Productivity Model - Staffing Pattern- Objectives of Activity planning
<Chapter Name 2> Project schedules – Activities – Sequencing and scheduling – Network Planning models – Forward Pass &
Backward Pass techniques – Critical path (CRM) method
<Chapter Name 3> Risk identification – Assessment – Monitoring – PERT technique – Monte Carlo simulation –Resource
Allocation – Creation of critical patterns – Cost schedules.
Unit-3 SOFTWARE PROJECT MANAGEMENT AND CONTROL Contact Hours: 15
<Chapter Name 1> Framework for Management and control – Collection of data Project termination – Visualizing progress – Cost
monitoring – Earned Value Analysis- Project tracking
<Chapter Name 2> Change control-Software Configuration Management – Managing contracts – Contract Management - Staffing
-Managing people – Organizational behavior
<Chapter Name 3> Best methods of staff selection – Motivation – The Oldham-Hackman job characteristic model – Ethical and
Programmed concerns – Working in teams – Decision making – Team structures – Virtual teams –
Communications genres – Communication plans
e. TEXT BOOK:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw Hill, New Delhi, 2012.
REFERENCES:
1. Robert K. Wysocki “Effective Software Project Management” – Wiley Publication,2011.
2. Walker Royce: “Software Project Management”- Addison-Wesley, 1998.
3. Gopalaswamy Ramesh, “Managing Global Software Projects” – McGraw Hill Education (India), Fourteenth Reprint 2013.

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 1 3
CO2 2 2 3 1 3
CO3 2 2 3 1 3

21UCY-396 21UCY-396
PRE-REQUISITE -
CO-REQUISITE -
ANTI-REQUISITE --
c. Course Outcomes
d. Syllabus
the program.

the mentor.

Theory
Marks 40 60
Total Marks 100

assignment
each test
quiz course types
4 Homework NA One per lecture Non-Graded: depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3
CO2 3
CO3 3
CO4 3

Semester-7

Type
1 21CST-4** Professional Elective-III DE 2 0 0 0 2 40 60 100

2
2 21CST-411 Cloud Computing CR 3 0 0 0 3 40 60 100

3
3 21**-O4** Open Elective-I OE 3 0 0 0 3 40 60 100

3
4 21CST-412 BLOCKCHAIN Technology CR 3 0 0 0 3 40 60 100

3
5 21CSR-414 Project-IV PR 0 0 1 5 3 60 40 100

6
6 21CSP-4** Professional Elective-III DE 0 0 2 0 1 60 40 100

2
7 Industrial Summer Training: 60 40 100

21CSI-415 MNG 0 0 0 4
(MNG) 2 4
8 Environmental Waste and 60 40 100

21UCY-401 UCR 2 0 0 0
Disaster Management 2 2
TOTAL 13 0 3 9 17 16

1 BUSINESS INTELLIGENCE 2 0 0 0 2 2 DE
21CST-431 21CST-431
PRE-REQUISITE 21UCX-224
CO-REQUISITE 21CST-432,21CST-433,21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-
438,21CST-412
ANTI-REQUISITE -
Business intelligence & mining(BIM)can be defined as a blend of mathematics, business acumen, tools, algorithms and machine learning techniques, all of
which help us in finding out the hidden insights or patterns from raw data which can be of major use in the formation of big business decisions. In BIM,
one deals with both structured and unstructured data. The algorithms also involve predictive analytics in them. That is, finding out the trends based on
historical data which can be useful for present decisions and finding patterns which can be modelled and can be used for predictions to see what things
may look like in the future. Business intelligence & mining is an amalgamation of Statistics, Tools and Business knowledge. So, it becomes imperative for a
Data Scientist to have good knowledge and understanding of these.
• To study basics of business intelligence and it’s connection with data mining.
• To gain the knowledge of techniques and methods used in data mining and BI.
• To gain knowledge about BI applications, tools and technologies being used in real time business
c. Course Outcomes:
CO1 Knowledge about the basics of data mining and BI .
CO2 Various techniques and methods used in data mining and BI.
CO3 Knowledge of data mining for BI applications, tools and technologies.
CO4 Compare and evaluate different data mining techniques like classification, prediction, clustering and association rule mining
CO5 Identify appropriate data mining algorithms to solve real world problems
d. Syllabus:
Unit-1 Introduction to data mining and the architecture of BI. Contact Hours: 15
Introduction to data Motivation for Data Mining and BI, Data Mining-Definition and Functionalities, Classification of DM Systems, DM
mining and business task primitives, Integration of a Data Mining system with a Database or a Data Warehouse, KDD Process, Various
intelligence: Models and their significance.
The Architecture of BI: Relation between BI and Data Mining, Concept Description and Association Rule Mining, BI and DW architectures
and its types, What is concept description, Data Generalization and summarization-based characterization.
Unit-2 Concept Description Association Rule Mining; Classification and Prediction Contact Hours: 15
Concept Description and What is concept description, Data Generalization and summarization-based characterization Attribute relevance,
Association Rule Mining: class comparisons Association Rule Mining: Market basket analysis, basic Concepts, Finding frequent item sets:
Apriori algorithm, generating rules, Improved Apriori algorithm, Incremental ARM, Associative Classification, Rule
Mining.
Classification and What is classification and prediction, Issues regarding, Classification methods: Decision tree, Bayesian
Prediction: Classification, Rule based, CART, and Neural Network.
Prediction methods: Linear and nonlinear regression, Logistic Regression Introduction of tools such as DB Miner /WEKA/DTREG DM
Tools.
Unit-3 Data Mining for BI Applications; Data Analytics Life Cycle & Advance Topics Contact Hours: 15
Data Mining for Business Data mining for business Applications like Balanced Scorecard, Fraud Detection, Clickstream Mining, Market
Intelligence Applications: Segmentation, retail industry, telecommunications industry, banking & finance and CRM.
Data Analytics Life Cycle: Introduction to Big data Business Analytics, State of the practice in analytics role of data scientists, Key roles for
successful analytic project, Main phases of life cycle, developing core deliverables for stakeholders.
Advance topics: Introduction to Hadoop architecture: Hadoop Architecture, Hadoop Storage: HDFS, Common Hadoop Shell
commands, Anatomy of File Write and Read, NameNode, Secondary NameNode, and DataNode, Hadoop
MapReduce paradigm, Map and Reduce tasks, Job, only introduction with real time example.
TEXT BOOKS
T1 Business intelligence and data mining. Maheshwari, Anil. ,Business Expert Press, 2014.
T2 Business intelligence: data mining and optimization for decision making. Vercellis, Carlo ,New York: Wiley, 2009.
T3 Integration of data mining in business intelligence systems. Azevedo, Ana, ed. IGI Global, 2014.
Reference Book:
1. J. Han, M. Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann
2. M. Kantardzic, “Data mining: Concepts, models, methods and algorithms, John Wiley &Sons Inc.
3. PaulrajPonnian, “Data Warehousing Fundamentals”, John Willey
4. G. Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts, Techniques, and Applications in Microsoft Office Excel with
XLMiner”, Wiley India.
5. M. Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education.


Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
PO11 PO11 PO11
Outcom PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2
0 1 2
e
CO1 3 1 3 2
CO2 3 2 3 1
CO3 2 3 2
CO4 3 2 3
CO5 2 1 3

1 Computer Vision 2 0 0 0 2 2 DE
21CST-432 21CST-432
CO-REQUISITE 21CST-433,21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-438,21CST-412
This course provides an introduction to computer vision including fundamentals of image formation, feature detection and matching, Intensity
transforms functions, histogram processing, Spatial filtering, fourier transforms and its properties, frequency domain filters, Hough Transformation,
Image Noise and Restorations. We'll explore Point, Line and Edge and Corner Detection, Thresholding, Edge and Boundary linking, Region Based
Segmentation, boundary detection, and recognition. We'll use both classical machine learning and deep learning to approach these problems. The focus
of the course is to develop the intuitions and mathematics of the methods in lecture, and then to learn about the difference between theory and
practice in the projects.
• To understand the basic concepts of image processing.
• To enhance knowledge about fundamental steps in image processing.
• To apply different image processing concepts to solve research problems.
c. Course Outcomes:
CO1 The students will have capability to understand and know how to apply current and future technologies for the evaluation,
implementation and operation of virtual and / or increased reality environments, and 3D user interfaces based on devices for natural
interaction.
CO2 The students will be able to apply the scientific method to study and analyze of phenomena and systems in any area of Computer
Science, and in the conception, design and implementation of innovative and original solutions.
CO3 The students will be able to design and implement simple experiments, and analyze and interpret their results.
CO4 The students will have capacity for critical, logical and mathematical reasoning and having the capability to solve problems in their
area of study.
CO5 The students will have capacity for abstraction: the capability to create and use models that reflect real situations.
d. Syllabus:
Unit-1 Introduction to Image Processing: Contact Hours:15
Chapter 1: Digital Image representation, Sampling & Quantization, Steps in image Processing, Image acquisition, colour
Introduction to Image image representation.
Processing:
Chapter 2: Intensity transforms functions, histogram processing, Spatial filtering, fourier transforms and its properties,
Image Transformation, frequency domain filters, Hough Transformation, Image Noise and Restorations.
Filtering & Restoration:
Unit-2 Colour Image Processing: Contact Hours:15
Chapter 3: Colour Fundamentals, Colour Models, Pseudo colour Image Processing, Image processing using Neural
Colour Image Processing: Networks and its performance metrics (Confusion Matrix)
Chapter 4: Introduction to basic operation on binary and greyscale images: Dilation, Erosion, Opening & Closing,
Image Morphological Morphological Algorithms: Boundary & Region Extraction, Convex Hull, Thinning, Thickening, Skeletons,
Processing: Pruning.
Unit-3 Image Segmentation, Representation and Description Contact Hours:15
Chapter 5: Point, Line and Edge and Corner Detection, Thresholding, Edge and Boundary linking, Region Based
Image Segmentation: Segmentation,
Chapter 6: Boundary representations, Region Representations, Boundary Descriptors, Regional Descriptors, Image
Image Representation & Wrapping
Descriptions:
Text Books:
1. Gonzalez and Woods: Digital Image Processing ISDN 0-201-600- 781, Addison Wesley 1992.
2. Forsyth and Ponce: Computer Vision A Modern Approach Pearson Education Latest Edition.
Reference Books:
1. Pakhera Malay K: Digital Image Processing and Pattern Recognition, PHI.
2. Trucco&Verri: Introductory Techniques for 3-D Computer Vision, Prentice Hall, Latest Edition.
3. Low: Introductory Computer Vision and Image Processing, McGraw-Hill 1991, ISBN 0-07-707403-3.
e. Assessment Pattern- Internal and External

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course PO11 PO11 PO11
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2
Outcome 0 1 2
CO1 3 3 3
CO2 3 3 3
CO3 2 3 2
CO4 3 2 3
CO5 2 1 3

1 Software Testing and Quality Assurance 2 0 0 0 2 2 DE
21CST-433 21CST-433
CO-REQUISITE 21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-438,21CST-412
Software testing does not guarantee the development of high quality software systems. Testing can be an efficient way to show the presence of bugs in a
software system (or software artifacts developed in different phases of development process), but cannot prove their absence. It has noted by various
researchers or industry professionals that it is impossible to completely test an application because: (1) the domain of program inputs is too large, (2)
there are too many possible input paths, and (3) design and specification issues are difficult to test. The first and second points present obvious
complications and the third point highlights the difficulty of determining the completeness and correctness of the requirement specification and the
design of its implementation.
To understand the different methods and techniques of software testing and quality assurance
• To learn tracking of bugs in the software
• To plan and design various test cases and to use different test tools
• To develop error free and quality software
c. Course Outcomes
CO1 Apply modern software testing processes in relation to software development and project management.
CO2 Create test strategies and plans, design test cases, prioritize and execute them.
CO3 To gain expertise in designing, implementation and development of computer based systems and IT processes.
d. Syllabus
Unit-1 Unit-1 Contact Hours: 15h
Fundamentals and Testing First, second and later cycles of testing. Objectives and limits of testing, Overview of S/W development stages,
types Planning and Design stages and testing during these stages. Glass box code, Regression and Black box testing,
Software errors, Categories of software error. Scope of software metrics, Classifying software measures,
Measurement basics – representational theory, scales, meaningfulness, What to measure – GOM technique,
Control flow structure, product quality metrics [5]
Reporting and analyzing Problem reports, Content and Characteristics of Problem Report, analysis and Tactics for analyzing a
bugs reproducible bug. Making a bug reproducible[5]
Problem Tracking System Objective of Problem Tracking System, tasks of the system, Problem tracking overview, users of the tracking
system, mechanics of the database[5]
Unit-2 Different Types of Testing Contact Hours: 15h
Test Case Design Characteristics of a good test, equivalence classes and boundary values, visible state transitions, Race
conditions and other time dependencies, load testing. Error guessing, Function equivalence testing,
Regression Testing, General issues in configuration testing, printer testing.[8]
Testing Tools and Test Fundamental tools, Automated acceptance and regression tests, standards, Translucent box testing Overall
Planning objective of the test plan: product or tool? Detailed objective, type of test, strategy for developing
components of test planning documents, components of test planning documents, documenting test
materials, product quality metrics – MTTF, defect density, customer problems, customer satisfaction, function
point, Metrics for software maintenance, In-process quality metrics. [7]
Unit-3 Attributes for reliable software Contact Hours: 15h

Software Quality Concepts of software quality, quality attributes, software quality control and software quality assurance,
Assurance Concepts and Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software Reviews, Formal Technical
Standards Reviews, Review Guidelines, Software Reliability, Software Safety, Quality Assurance Standards, ISO 9000, ISO
9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six Sigma, SPICE, Software Quality Assurance Metrics.[8]
Quality related issues S/W Development tradeoffs and models, Quality-related costs, The development time line, Product design,
alpha, Pre-beta, Beta, User Interface freeze, Pre-final, Final integrity testing, Project post-mortems, Legal
consequences of defective software, Managing and role of a testing group, independent test agencies, [7]
Textbooks
1. CemKaner, Jack Falk, HungQuoc Nguyen, Testing Computer Software, Wiley, (Second Edition).
2. William E. Perry,“ Effective Methods for Software Testing”, John Wiley & Sons.
3. Boris Beizer,”Software Testing Techniques”, Second Edition, Dreamtech.
Reference Book
1. Rex Black, “Managing the Testing Process: Practical Tools and Techniques for Managing Hardware and Software Testing” .
2. Daniel Galin, “Software Quality Assurance from Theory to Implementation”, Pearson Education

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 3 3 3
CO2 3 3 2 3 3 3
CO3 3 3 2 3 3 3
CO4 3 3 2 3 3 3
Co5 3 3 2 3 3 3

1 Digital Image Processing 2 0 0 0 2 2 DE
21CST-434 21CST-434
PRE-REQUISITE 21ECT-155
CO-REQUISITE 21CST-433 ,21CST-411,21CSP-436,21CSP-437,21CSP-438,21CST-412
The course begins with the theoretical study of Digital Image Fundamentals which is widely utilized in Image Segmentation, Image
Compression. The students are then introduced to Computer Vision Imaging Techniques and Solutions. The course further emphasizes on the
use of application software implementations.
• To comprehend the relation between human visual system and machine perception and processing of digital images.
• To provide a detailed approach towards image processing applications like enhancement, segmentation and compression.
c. Course Outcomes
CO1 Exploration of the limitations of the computational methods on digital images.
CO2 Expected to implement the spatial and frequency domain image transforms on enhancement and restoration of images.
CO3 Elaborate understanding on image enhancement techniques.
d. Syllabus
Unit-1 Fundamentals of Digital Image Processing Contact Hours: 15
Digital Image Digital Image Fundamentals, Sampling and Quantization, Relationship between Pixels. Image Transforms: 2-
Fundamentals & Image D FFT, Properties, Walsh Transform, Hadamard Transform, Discrete Cosine Transform, Haar Transform, Slant
Transforms: Transform, Hotelling Transform
Image Enhancement Introduction, Image Enhancement in Spatial Domain, Enhancement through Point Processing. Image
(Spatial Domain): Enhancement (Frequency Domain): Filtering in Frequency Domain, Low Pass (Smoothing) and High Pass
(Sharpening) Filters in Frequency Domain.
Unit-2 Attributes of Image processing Contact Hours: 15
Image Restoration: Degradation Model, Algebraic Approach to Restoration, Inverse Filtering, Least Mean Square Filters,
Constrained Least Squares Restoration, Interactive Restoration.
Image Segmentation: Detection of Discontinuities, Edge Linking And Boundary Detection, thresholding, Region Oriented
Segmentation.
Unit-3 Compression Techniques Contact Hours: 15
Image Compression: Redundancies and their Removal Methods, Fidelity Criteria, Image Compression Models, Huffman and
Arithmetic Coding, Error Free Compression, Lossy Compression, Lossy and Lossless Predictive Coding, Transform
Based Compression, JPEG 2000 Standards.
TEXT BOOKS:
1. Digital Image Processing- Rafael C. Gonzalez, Richard E. Woods, 3rd Edition, Pearson, 2008
2. Digital Image Processing- S Jayaraman, S Esakkirajan, T Veerakumar- MC GRAW HILL EDUCATION, 2010.
REFERENCE BOOKS:
1. Digital Image Processing and Analysis-Human and Computer Vision Application with using CVIP Tools - Scotte Umbaugh, 2nd Ed, CRC Press,
2011
2. Digital Image Processing using MATLAB – Rafael C. Gonzalez, Richard E Woods and Steven L. Eddings, 2nd Edition, MC GRAW HILL EDUCATION,
2010.
3. Digital Image Processing and Computer Vision – Somka, Hlavac, Boyle- Cengage Learning (Indian edition) 2008.
4. Introductory Computer Vision Imaging Techniques and Solutions- Adrian low, 2008, 2nd Edition.

Theory
Marks 40 60
Total Marks 100

assignment
As applicable to
course types
each test
depicted above.
Quiz

questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 2 3
CO2 2 2 3 2 3
CO3 2 2 3 2 3

2 Cloud Computing 3 0 0 0 3 3 CR
21CST-411 21CST-411
CO-REQUISITE 21CST-433,21CST-434 ,21CSP-436,21CSP-437,21CSP-438,21CST-412
The course begins with the theoretical study of cloud computing which is new technology in computer science .The students are then introduced to
different types of clouds. The course further emphasizes on new technologies.
• This subject is designed to impart fundamental knowledge on emerging fields of computer science.
• To appreciate the evolution of cloud from the existing technologies.
• To appreciate the emergence of cloud as the next generation computing paradigm.
c. Course Outcomes
CO1 Articulate the main concepts, key technologies, strengths and limitations of cloud computing.
CO2 Learn the key and enabling technologies that help in the development of cloud.
CO3 Develop the ability to understand and use the architecture of compute and storage cloud, service and delivery models.
CO4 The students will have capacity to Understand abount difference service model and providers for cloud.
CO5 The students will have capacity for abstraction: the capability to create and use models that reflect real situations.
d. Syllabus
Unit-1 Introduction to Cloud Computing: Contact Hours: 15
Chapter 1: Introduction to Cloud Computing, Definition of Cloud, Evolution of Cloud Computing, Underlying Principles of
INTRODUCTION of Cloud Parallel and Distributed Computing, Cloud Characteristics, Elasticity in Cloud, On-demand Provisioning.
Computing
Chapter 2: Service Oriented Architecture – REST and Systems of Systems, Web Services, Publish Subscribe Model, Basics of
CLOUDENABLING Virtualization, Types of Virtualization, Implementation Levels of Virtualization, Virtualization Structures, Tools
TECHNOLOGIES and Mechanisms, Virtualization of CPU, Memory – I/O Devices ,Virtualization Support and Disaster Recovery.
Unit-2 Cloud Services Contact Hours: 15
Chapter 3: Design, NIST Cloud Computing Reference Architecture – Public, Private and Hybrid Clouds, laaS , PaaS, SaaS,
CLOUD ARCHITECTURE, Architectural Design Challenges, Cloud Storage, Storage-as-a-Service, Advantages of Cloud Storage, Cloud
SERVICES AND STORAGE Storage Providers.
Chapter 4: Inter Cloud Resource Management -Resource Provisioning and Resource Provisioning Methods , Global
RESOURCE MANAGEMENT Exchange of Cloud Resources.
AND SECURITY IN CLOUD
Unit-3 CLOUD TECHNOLOGIES Contact Hours: 15
chapter 5: Virtual Box, Google App Engine, Programming Environment for Google App Engine, Open Stack, Federation in
CLOUD TECHNOLOGIES the Cloud, Four Levels of Federation, Federated Services and Applications, Future of Federation.
AND ADVANCEMENTS
Chapter 6: Security Overview, Cloud Security Challenges, Software as-a-Service Security, Security Governance, Virtual
Security and challenges Machine Security , Image Wrapping
Text Books:
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, “Distributed and Cloud Computing, From Parallel Processing to the Internet of Things”, Morgan
Kaufmann Publishers, 2012.
2. Rittinghouse, John W., and James F. Ransome, ―Cloud Computing: Implementation, Management and Security, CRC Press, 2017.
Reference Books:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, ―Mastering Cloud Computing, Tata Mcgraw Hill, 2003
2. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing – A Practical Approach, Tata Mcgraw Hill, 2009.
3. George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in the Cloud: Transactional Systems for EC2 and
Beyond (Theory in Practice), O’Reilly, 2009.
e. Assessment Pattern- internal and External:

Theory
Marks 40 60
Total Marks 100
f. Internal Evaluation Component:

1 Assignment 10 marks of each One Per Unit 10 marks As applicable to

assignment course types
2 Exam 12 marks for One per Unit 4 marks depicted above.
each test

quiz
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 2 2 3 3 3 3
CO2 2 2 3 3 3 3
CO3 2 2 3 3 3 3
CO4 2 2 3 3 3 3
CO5 2 2 3 3 3 3

SN Course SYLLABUS L T P S C CH Course Type*
4 Code : Block Chain Technology 3 0 0 0 3 3 CR
21CST-412 21CST-412
CO-REQUISITE 21CST-433,21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-438
A block chain is a permanent, sequential list of transaction records distributed over a network. Bitcoin and other crypto currencies use block-chain
technology to record transactions. Block chain for business applications can include recording of contracts, medical records, monetary transactions and
much more
● Demonstrate advanced scripting and how it can be used to handle several real-world use cases with code example
● Explain how bit coin works, from when a transaction is created to when it is considered part of the block chain
● Decompose a block chain system’s fundamental components, how they fit together and examine a modular block chain system in more detail
c. Course Outcomes
CO1 Understand the technology components of Bit coin and how it really works behind-the-scenes.
CO2 Understand the architectural components of a block chain system
CO3 Develop scripts using the Bit coin Script language and have a deep understanding of the provided API
d. Syllabus
Unit-1 Introduction to Block chain Contact Hours:15
Chapter 1- Introduction Introduction to Block Chain, Components of Block Chain, Record Keeping, Need for Distributed Record
Keeping, Modelling faults and adversaries, Threat Modelling. Introduction to Cryptographic Techniques,
Digital Signature.
Chapter 2-Technologies Introduction to Crypto currency, Why Nakamoto Came up with Block chain based crypto currency?
Technologies Borrowed in Block chain – hash pointers, digital cash etc.
Chapter3:-Basic Introduction to Etherum, Components, History and its Characteristics. Platforms used in Etherum, Algorithms
Distributed Computing for Etherum. Atomic Broadcast, Consensus, Byzantine Models of fault tolerance,
Unit-2 Introduction to Bitcoin Contact Hours:15
Chapter 4-Bitcoin 1.0 Bit coin block chain, the challenges, and solutions, proof of work, Proof of stake, alternatives to Bit coin
consensus, Bit coin scripting language and their use
Chapter5-Bitcoin 2.0 Etherum and Smart Contracts, The Turing Completeness of Smart Contract Languages and verification
challenges, Using smart contracts to enforce legal contracts, comparing Bit coin scripting vs. Etherum Smart
Contracts.
Chapter6-Bitcoin 3.0 Hyper ledger fabric, the plug and play platform and mechanisms in permission block chain,Case studies.
Unit-3 Security and Primitives Contact Hours:15
Chapter 7-Basic Crypto Hash functions, Puzzle friendly Hash, Collision resistant hash, digital signatures, public key crypto, verifiable
Primitives random functions, Zero-knowledge systems.
Chapter 8- Privacy, in Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS for anonymity preservation
Block chain
Chapter 9-Security in Attacks on Block chains – such as Sybil attacks, selfish mining, 51% attacks - advent of aground, and Sharding
Blockchain based consensus algorithms to prevent these
Text Book:
o T1-Don Tapscott, Block chain Revolution: How the Technology behind Bit coin and Other Crypto currencies is Changing the World, Penguin)
Reference Book:
o R1-Nakul Shah, Block chain for Business with Hyper-ledger Fabric, BPB, 1 edition (2019)

Theory
Marks 40 60
Total Marks 100

assignment
As applicable to
course types
each test
depicted above.
Quiz

questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3

SN Course Code TITLE OF THE COURSE L T P S C CH Course Type*
5 Project – IV 0 0 1 5 3 6 <PR>
21CSR-414 Course Code(s)
PRE-REQUISITE 21CSR-264, 21CSR-318, 21CSR-359
CO-REQUISITE 21CST-411, 21CST-412
ANTI-REQUISITE 21CSR-453
Final Year Projects are a culmination of study towards the partial fulfillment of the award of the degree. Projects offer the opportunity to apply and
extend technologies learned throughout the program. Assessment is by means of a seminar presentation along with submission of a thesis, and a public
demonstration of work undertaken.In contrast to the majority of courses studied elsewhere in the program, projects are undertaken individually or in
small groups. This necessarily introduces the dimension of workload management into the program to enable completion of a large, relatively
unstructured "assignment" over the course of the semester.The projects undertaken span a diverse range of topics, including theoretical, simulation and
experimental studies, and vary from year to year. The emphasis is necessarily on facilitating student learning in technical, project management and
presentation spheres.
The aim of this course is to enable the students to work on a project concerning some advanced Problem / research area / industrial applications
preferably using the tool or language learnt in previous semesters. Each student shall have a guide/mentor/supervisor who is a faculty member. The
objective of this course delivering a project exercise for students is to inculcate lifelong learning and professional ethics in order to achieve industrial,
socio-economical, sustainable growth of the society.
c. Course Outcomes
CO1 To exhibit a sound technical knowledge of their selected project topic.
CO2 To undertake problem identification, problem formulation and feasibility study along with the identification of solution.
CO3 To design engineering solutions to complex problems utilizing a systematic approach.
CO4 To conduct an engineering project as an individual or team.
CO5 To communicate with engineers and the community at large.
d. Syllabus / Content
Students will be required to:
1. Perform a literature search to review current knowledge and developments in the chosen technical area;
2. Undertake detailed technical work in the chosen area using one or more of:
Theoretical studies with Practical Relevance
Computer simulations with Software as an output
Hardware construction resulting in a Hardware Model
3. Produce progress reports or maintain a professional journal to establish work completed, and to schedule additional work within the time
frame specified for the project;
4. Deliver a seminar on the general area of work being undertaken and specific contributions to that field;
5. Prepare a formal report describing the work undertaken and results obtained so far; and
6. Present the work in a forum involving paper/poster presentations and demonstrations of operational hardware and software model
constructs.
e. Possible Outcomes
• Software / Web Application / Mobile Application / Research Paper / Patent / Networking Model / Hardware + Software Model

As per the Rubrics Approved by Higher Authorities
The performance of students will be evaluated as follows:
Theory
Marks 60 40
Total Marks 100

Sr.No. Type of Assessment Weightage of actual Frequency of Final Weightage in Internal Remarks
conduct Task Assessment
1 Proposal 5 1 5
2 Synopsis 8 1 8
3 Modeling 8 1 8
4 Implementation 12 1 12
5 Presentation and 5+5+10 3 20
Assessment
6 Project Outcome 7 1 7

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 2 2 3 3 3 2 2 3
CO2 2 2 1 3 2 2 3
CO3 2 2 2 3 2 3 2 3 2
CO4 2 1 3 2 3 2 3
CO5 2 1 3 2 2 3 2 2 2 2 3

6 Code BUSINESS INTELLIGENCE LAB 0 0 2 0 1 2 DE
21CSP-436 21CSP-436
PRE-REQUISITE 21UCX-224
CO-REQUISITE 21CST-432,21CST-433,21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-
438,21CST-412
ANTI-REQUISITE --
This course introduces the student to the business problems and the way the right and meaningful information is extracted from it to get the useful
insight and appropriate actions can be taken by the stake holders. The student is also introduced to the use of tools to automate the analysis based on
prominent features of the given dataset. Documentation is also the part of the course that make the students learn how to prepare and present the
useful insights in the form of report writing.
• The ability to analyze and comprehend the given business problem.
• To understand the problem and intelligence extraction based on given parameters.
• Implement the intelligence extraction parameters using available tools and visualize the meaningful analysis .
c. Course Outcomes
CO1 Students gain hands-on experience by designing, modelling, and implementing the most important intelligence parameters in the
given dataset of the problem.
CO2 Students is able to analyse the features of the data to get insight of the given problem set.
CO3 Analyse the intelligence extracted and display it in a more understandable format including various forms of relevant graphs, charts,
and other visual entities.
d. Syllabus
Unit-1 Unit1 Contact Hours:15
Revisiting basic data mining concepts like OLAP operations including slice, dice, roll-up, and drill down in detail.
Introduction of Power BI Desktop tool (or equivalent) installation with its features and strengths while visualizing data over
multiple feature selections in OLAP operation.
Introduction to UCI repository and select and download the data from the UCI repository (more than 1mb) of your interest for
the analysis.
Compile and preprocess the datasheet for missing value and other minor imputation and prepare the dashboard with at least 7
major features in power bi desktop.
Produce the graph and visualize the selected parameters on the basis of their high relevance while extracting useful intelligence.
Install Latex Editor (TexMaker/ TexStudio/ or the like) and introduce the basic features used for report writing.
Install and learn Weka Tool for data mining while exploring its features.
Perform the pre-processing in the selected dataset using Weka.
Perform classification on the selected dataset using Weka.
Perform Clustering and KNN on the selected dataset using Weka.

T1 J. Han, M. Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann
T2 M. Kantardzic, “Data mining: Concepts, models, methods and algorithms, John Wiley &Sons Inc.
T3 PaulrajPonnian, “Data Warehousing Fundamentals”, John Willey
Reference Books:
R1 G. Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts, Techniques, and Applications in Microsoft Office Excel with
XLMiner”, Wiley India.
R2 M. Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 2 2 2
CO2 3 3 2 2 2 2
CO3 3 3 2 2 2 2

Course Code Syllabus L T P S C CH Course Type*
Computer Vision Lab 0 0 2 0 1 2 DE
21CSP-437 21CSP-437
PREREQUISITE 21CST-333
CO-REQUISITE 21CST-433,21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-438,21CST-412
This course provides an introduction to computer vision including fundamentals of image formation, camera imaging geometry, feature detection and
matching, stereo, motion estimation and tracking, image classification and scene understanding.
• To understand the basic concepts of image processing.

• To enhance knowledge about fundamental steps in image processing.
• To apply different image processing concepts to solve research problems.
c. Course Outcomes:
CO1 Identify basic concepts, terminology, theories, models and methods in the field of computer vision
CO2 Describe known principles of human visual system
CO3 Describe basic methods of computer vision related to multi-scale representation, edge detection and detection of other primitives,
stereo, motion and object recognition,
CO4 Suggest a design of a computer vision system for a specific problem
CO5 Assess which methods to use for solving a given problem, and analyse the accuracy of the methods
d. Syllabus:
Unit-1 Basic Image Processing Contact Hours:10
EXPERIMENT 1 Reading and displaying images in different formats using different colour models
EXPERIMENT 2 Converting colour images into monochrome images, Image colour enhancements using pseudo colouring
techniques.
EXPERIMENT 3 Images enhancements using grey level transformations
EXPERIMENT 4 Histogram Matching and specification on images
Unit-2 Methods for image pre-processing Contact Hours:10
EXPERIMENT 5 Image enhancement using spatial and frequency domain filters
EXPERIMENT 6 Image Noise removal and inverse filtering of images
EXPERIMENT 7 Point, Line, Edge and Boundary Detections in images

Unit-3 Image Morphology Contact Hours:10
EXPERIMENT 8 Boundary Linking, Representation and Description techniques on images
EXPERIMENT 9
Thresholding and Magnification of Images
EXPERIMENT 10 Image Morphological Operations
e. Textbooks / Reference Books

Text Books:
1. Gonzalez and Woods: Digital Image Processing ISDN 0-201-600- 781, Addison Wesley 1992.
2. Forsyth and Ponce: Computer Vision A Modern Approach Pearson Education Latest Edition.
Reference Books:
1. Pakhera Malay K: Digital Image Processing and Pattern Recognition, PHI.
2. Trucco&Verri: Introductory Techniques for 3-D Computer Vision, Prentice Hall, Latest Edition.
3. Low: Introductory Computer Vision and Image Processing, McGraw-Hill 1991, ISBN 0-07-707403-3.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 3 2 3
CO2 3 3 2 3 2 3
CO3 3 3 2 3 2 3
CO4 3 3 2 3 2 3
CO5 3 3 2 3 2 3

6 Software Testing and Quality Assurance Lab 0 0 2 0 1 2 PE
21CSP-438 21CSP-438
CO-REQUISITE 21CST-434,21CST-411,21CSP-436,21CSP-437,21CSP-438,21CST-412
This course explores the goals of quality assurance and quality control activities performed during the life cycle of a software product. It focuses on
integrating test processes with agile software development methodologies
• To verify the fulfillment of all specified requirements.
• To evaluate the work products such as requirements, design, user stories, and code
• To validate if the test object is complete and works as per the expectation of the users and the stakeholders
c. Course Outcomes:
CO1 Contribute to efficient delivery of software solutions and implement improvements in the software development processes.
CO2 To gain expertise in designing, implementation and development of computer based systems and IT processes
CO3 understand how to do performance testing and usability testing
CO4 Communicate effectively and work in teams to develop a working computer vision system
CO5 Critically review and assess scientific literature in the field and apply theoretical knowledge to identify the novelty and practicality of
proposed methods
d. Syllabus:
Unit-1 Software Testing and Quality Assurance Contact Hours: 8
EXPERIMENT 1 To implement test cases on classics application to become familiar with the sample application..
EXPERIMENT 2 To record a simple script using the sample application for getting started with IBM rational functional tester
EXPERIMENT 3 To set up regular expressions for dynamic values (pattern based recognition technique).
EXPERIMENT 4 To play back scripts, call another script from an existing one and view results setting up the preferences
Unit-2 Contact Hours: 8
EXPERIMENT 5 To select the type of Test Log Output (HTML, TXT, Test log in Test Manager) and insert delays in the script.
EXPERIMENT 6 To insert Timers in the script and user defined log entries.
EXPERIMENT 7 To create custom classes and functions (Helper classes)
EXPERIMENT 8 To control Object-matching sensitivity and set up pattern based object recognition.
EXPERIMENT 9
To run the Regression tests and import data from CSV files
EXPERIMENT 10 To create data pools and connect them to scripts.
Text Books:
1. Paul C. Jorgensen: Software Testing a Craftsman’s Approach, Fourth Edition 2014
2. Forsyth and Ponce: SQTA A Modern Approach Pearson Education Latest Edition.
Reference Books:
1. Pakhera Malay K: SQTA and Pattern Recognition, PHI.
2. Trucco & Verri: Introductory software quality testing assurance, Prentice Hall, Latest Edition.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3
CO4 3 3 3
CO5 3 3 3

6 Digital Image Processing Lab 0 0 2 0 1 2 PE
21CSP-439 21CSP-438
PRE-REQUISITE 21ECT-155
This course provides an introduction to basic concepts, methodologies and algorithms of digital image processing focusing on the following two major
problems concerned with digital images: (1) image enhancement and restoration for easier interpretation of images, and (2) image analysis and object
recognition. Some advanced image processing techniques (e.g., wavelet and multi-resolution processing) will also be studied in this course. The primary
goal of this course is to lay a solid foundation for students to study advanced image analysis topics such as computer vision systems, biomedical image
analysis, and multimedia processing & retrieval.
• To study the image fundamentals and mathematical transforms necessary for image processing.
• To study the image enhancement techniques
• To study image restoration procedures.
• To study the image compression procedures.
c. Course Outcomes
CO1 Analyze general terminology of digital image processing.
CO2 Examine various types of images, intensity transformations and spatial filtering
CO3 Develop Fourier transform for image processing in frequency domain
CO4 Understand the need for image compression and to learn the spatial and frequency domain techniques of image
compression.
CO5 Learn different feature extraction techniques for image analysis and recognition.
d. Syllabus
EXPERIMENT 1 To create a program to display gray scale image using read and write operation.
EXPERIMENT 2 To create a vision program to find histogram value and display histograph of a gray scale and colour image.
EXPERIMENT 3 To create a vision program for Non-Linear Filtering technique using edge detection.
EXPERIMENT 4 To create a vision program to determine the edge detection of an image using different operators.
EXPERIMENT 5 To create a program to discretize an image using Fourier transformation.
EXPERIMENT 6 To create a program to eliminate the high frequency components of an image.
EXPERIMENT 7 To create a color image and perform read and write operation.
EXPERIMENT 8 To obtain the R, B, G colour values and resolved colour values from a colour box by choosing any colour.
EXPERIMENT 9 To create a program performs discrete wavelet transform on image.
EXPERIMENT 10 Create a program for segmentation of an image using watershed transforms.
Text Book:
1. R. C. Gonzalez and E. E. Woods, < Digital Image Processing >, Prentice Hall, 3 rd (2007) edition. (The 2nd (2001) edition is doable.)
References:
1. o A. Rosenfeld and A. C. Kak, < Digital Picture Processing >, Academic Press, 1982 o W. K. Pratt, , 3rd Edition, John Wiley & Sons, Inc., (2001).
2. Y. Q. Shi and H. Sun, , CRC Press, 1 st (1999) or 2nd (2008) edition

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping:
Course
Outcome
CO1 2 3 3 3
CO2 2 3 3 3
CO3 2 3 3 3
CO4 2 3 3 3
CO5 2 3 3 3

8 Environment, Waste and Disaster Management 2 0 0 0 2 2 PE
21UCY-401 21UCY-401
PRE-REQUISITE -
ANTI-REQUISITE -
COURSE DESCRIPTION:
The course begins with the basic scientific knowledge and understanding of world from an environmental perspective. Students are then introduced to
different types of disaster and measures involved in strengthening the capacity to reduce the impact of disaster. The course further provides an
overview on the complexities associated with waste material and various techniques for waste management.
COURSE OBJECTIVES:
To familiarize students with basics of environmental sciences, waste and disaster management
COURSE OUTCOMES:
On completion of this course:
1. Understudies will be able to identify different dimensions of environmental studies; problems related to the environmental degradation & will be
able to take remedial steps.
2. Disciples will learn about different type of disaster that occur in nature consequently learning to develop the preparedness and remedial
techniques.
3. Upon learning the problems related to environmental waste, students will be able to segregate the waste in different categories and will learn its
effective management techniques.
COURSE CONTENT:
Unit-1 Introduction to environment Contact Hours:10
General: Definition, Scope & Importance, Need For Public Awareness- Environment definition, Introduction to
Ecosystem-definition ,components, Effects of human activities on environment, agriculture, Housing, Industry,
Mining and Transportation activities, Bio diversity & its conservation
Renewable & Non- Natural Resources and associated problem - Forest resources, Water Resources, Mineral resources,
renewable resources: Energy resources, Land resources. Energy–Hydro Electric, Nuclear, Solar, Hydrogen as an alternative
future source of Energy. Biomass and Bio-gas
Environmental Pollution Water pollution, Land pollution. Noise pollution, Air Pollution. Current Environmental Issues of importance,
and their effects: population Growth, Climate Change and Global warming- Effects, acid rain, Ozone Layer depletion, Salient
features of Environmental Protection Act , Water Prevention & Control Act , Air prevention & control of
pollution Act , Salient Features of Environmental Summit – Paris 2015
Unit-2 Disaster Management Contact Hours:15
Disaster Management: Introduction on Disaster, Different Types of Disaster : A) Natural Disaster: such as Flood, Cyclone,
Earthquakes, Landslides B) Man-made Disaster: such as Fire, Industrial disaster, Nuclear Disaster,
Biological Disasters, Accidents (Air, Sea, Rail & Road), Structural failures(Building and Bridge), War &
Terrorism. Causes, effects and practical examples for all disasters.
Disaster Preparedness, Disaster Preparedness: Concept and Nature, Disaster Preparedness Plan, Prediction, Early Warnings and Safety
Response and Recovery: Measures of Disaster, Role of Government, International and NGO Bodies. Role of IT in Disaster Preparedness,
Role of Engineers on Disaster Management. Disaster Response: Introduction; Disaster Response Plan.
Recovery: Reconstruction and Rehabilitation as a Means of Development. Damage Assessment
Unit-3 Waste Management Contact Hours:15
Waste Management: Municipal Solid Waste Management, Waste Collection, Storage and Transport. Waste Disposal - Key
issues and features. Waste Processing Techniques. Source Reduction, Product Recovery and Recycling.
Recovery of Biological Conversion Products: Composts and Biogas. Composting and Biogasification
Technology.
Hazardous Waste: Management and Treatment. Integrated Waste Management (IWM).
Solid Waste Management Municipal Solid waste (Management & Handling) Rules 2000, Waste Management Rules 2016
Act: (Amendments).
TEXT BOOKS:
T1 Weihrich, H., & Koontz, H. (2005). Management: A global perspective. Tata McGraw-Hill.
T2 Carter, W. N. (2008). Disaster management: A disaster manager's handbook.
REFERENCE BOOKS:
R1 Masters, G. M., & Ela, W. P. (2008). Introduction to environmental engineering and science(No. 60457). Englewood Cliffs, NJ: Prentice Hall.
R2 Peavy, H. S., &Tchobanoglous, G. (1985). Environmental engineering (No. 628 P4).
R3 Monson, R. K. (Ed.). (2014). Ecology and the Environment (Vol. 8). Springer.
R4 Rahman, M. S. (1994). Disaster management handbook for Bangladesh. PACT-Bangladesh, Dhaka.
Theory

Components Continuous Internal Assessment Semester End
(CAE) Examination(SEE)
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3

Semester-8

Type
1 21CST- Professional Elective-IV DE 2 0 2 0 3 4 40 60 100

4**
2 21CST- Professional Elective-V DE 2 0 2 0 3 4 40 60 100

4**
3 21**O- University Open Elective OE 3 0 0 0 3 3 40 60 100

4**
4 21CSR- Project-V PR 0 0 1 5 3 6 60 40 100

451
TOTAL 7 0 5 5 12

1 Code Name of the Course 2 0 0 0 2 2 DE
21CST-461 DATA VISUALIZATION 21CST-461
PRE-REQUISITE 21CST-371, 21CST-372
CO-REQUISITE 21CST-462, 21CST-463, 21CST-464, 21CST-471, 21CST-472
ANTI-REQUISITE -
Fundamental concepts of data visualization; information visualization types; design principles of data visualization; tools for static data visualization;
tree and network visualizations; big data visualizations.
This course covers the basic theories of data visualization, such as data types, chart types, visual variables, visualization techniques, color theory,
cognitive theory, and data patterns.
c. Course Outcomes:
CO1 Present data with visual representations for your target audience, task, and data.
CO2 Create multiple versions of digital visualizations using various software packages.
CO3 Identify appropriate data visualization techniques given particular requirements imposed by the data.
CO4 Apply appropriate design principles in the creation of presentations and visualizations.
CO5 Acquire the skill to apply visualization techniques to a problem and associated data set.
d. Syllabus:
Unit-1 Introduction to Data Visualization Contact Hours:15
Introduction to Data Applications–Process-Data Extraction-Data Cleaning and Annotation- Data Integration-Data Reduction- Data
Visualization Transformation–Visualization-Introduction -Terminology- Basic Charts and Plots- Multivariate Data
Visualization- Data Visualization Techniques– Pixel-Oriented Visualization Techniques- Geometric Projection
Visualization Techniques- Icon-Based Visualization Techniques- Hierarchical Visualization Techniques-
Visualizing Complex Data and Relations
PRINCIPLES AND THEORIES PRINCIPLES AND THEORIES OF VISUALIZATION: Theories related to visual information processing - Colour
OF VISUALIZATION theory - Data types - Visual variables -Chart types: statistical graphs, maps, trees and networks
ASPECTS OF DATA ASPECTS OF DATA PATTERNS: Acquisition of data, Discipline-independent classification of information sources,
PATTERNS Data base issues – In memory database - storage and retrieval of data - Query languages - Reliability of data –
Patterns and predicting data, continuously and discontinuously variable data, plotting data and suitability for
different types of data
Unit-2 VISUALIZATION TECHNIQUES Contact Hours:15
VISUALIZATION VISUALIZATION TECHNIQUES: Scalar and point techniques - Vector visualization techniques - Multidimensional
TECHNIQUES techniques – glyphs, Graph-theoretic graphics - Linked Views for Visual Exploration - Multivariate Visualization
by Density Estimation, Volume Visualization – Rendering - Attribute Mapping - Visualizing Cluster Analysis -
Visualizing Contingency Tables - Matrix Visualization - Visualization in Bayesian Data Analysis - Evaluation of
data visualization
APPLICATIONS APPLICATIONS: Visualization for Genetic Network Reconstruction, Reconstruction, Visualization and Analysis of
Medical Images, Exploratory Graphics of a Financial Dataset, Visualization Tools for Insurance Risk Processes,
Visualization of Social Networks datasets, Visualizing Darwin’s database – A case study
WEB DEVELOPMENT Web Page Designing: HTML: list, table, images, frames, forms, CSS.
Scripting: Java script: Introduction, documents, forms, statements, functions, objects
Unit-3 Data Visualization Tools Contact Hours:15
TOOLS AND LANGUAGES TOOLS AND LANGUAGES: Programming Statistical Data Visualization in the Java Language, Web-Based
Statistical Graphics using XML Technologies, Google Map API, Google Chart, Tableau - Heat Map Generation
Data Analysis Tools Rank Analysis Tools- Trend Analysis Tools- Multivariate Analysis Tools- Distribution Analysis Tools- Correlation
Analysis Tools- Geographical Analysis Tools.

1. Andy Kirk, Data Visualization A Handbook for Data Driven Design, Sage Publications, 2016
2. Philipp K. Janert, Gnuplot in Action, Understanding Data with Graphs, Manning Publications, 2010.
3. Ben Fry, Visualizing Data: Exploring and Explaining Data with Processing Environment, O'Reilly Media.
4. John Verzani, simpler – Using R for Introductory statistics
e. Assessment Pattern- internal and External:

Theory
Marks 40 60
Total Marks 100


assignment
each test
questions)
Engagement Task
g. CO-PO Mapping:
Course
Outcome
CO1 3 3 3 2 2
CO2 3 3 3 2 2
CO3 3 3 3 2 2
CO4 3 3 3 2 2
CO5 3 3 3 2 2

SN Course Code TITLE L T P S C CH Course Type
1 Name of the Course 2 0 0 0 2 2 DE
21CST-462 Natural Language Processing 21CST-462
CO-REQUISITE 21CST-463, 21CST-464, 21CST-471, 21CST-472
ANTI-REQUISITE -
The course begins with the theoretical study of Natural Language Processing which is widely used solving various text and speech related problems.
The students are then introduced with various word forms and concept parsing. The course further comprises language modeling techniques with
Parts of Speech as case study. Different Machine Learning techniques have also been included in the course. The last section focuses on semantics,
different NLP applications and concepts of Machine learning and neural networks.
1. To understand the basic concepts of Natural Language Processing (NLP).
2. The student must be able to apply the various concepts of NLP in other application areas.
c. Course Outcomes
CO1 Comprehend the concept of natural language processing, its challenges and applications.
CO2 Comprehend the concepts word forms of the language by considering the concept of morphology analysis.
CO3 Acquire ability to perform syntax and semantics in natural language processing.
CO4 Acquire knowledge to design and analyze various NLP algorithms.
CO5 Acquire knowledge of machine learning techniques used in NLP, including hidden markov models, N-Grams and probabilistic
context-free grammar.
d. Syllabus
Unit-1 Introduction to Natural Language Processing Contact Hours: 15
Introduction Origin of Natural Language Processing (NLP), Challenges of NLP, NLP Applications, Processing Indian Languages.
Words and Word Forms Morphology fundamentals; Morphological Diversity of Indian Languages; Morphology Paradigms; Finite State
Machine Based Morphology; Automatic Morphology Learning; Named Entities.
Phrase structure and Phrase structure grammar; dependency grammar; formal language theory.
constituency models
Unit-2 Syntax and Semantic Analysis Contact Hours:15
Parsing Definite clause grammars; shift-reduce parsing; chart parsing' Shallow Parsing, Statistical Parsing, Maximum
Entropy Models; Random Fields, Scope Ambiguity and Attachment Ambiguity resolution, Approaches to
discourse, generation.
Language Modeling and Markov models, N-grams, estimating the probability of a word, and smoothing, Parts-of-speech, examples and
Part of Speech Tagging its usage.
Semantics Analysis: Lexical Knowledge Networks, WorldNet Theory; Indian Language Word Nets and Multilingual Dictionaries;
Semantic Roles; Word Sense Disambiguation; WSD and Multilinguality; Metaphors.
Unit-3 NLP Applications and Machine Learning Contact Hours:15
Machine Translation Need of MT, Problems of Machine Translation, MT Approaches, Direct Machine Translations, Rule-Based
Machine Translation, Knowledge Based MT System, Statistical Machine Translation.
NLP Application areas: Pattern Recognition; Sentiment Analysis; Text Entailment; Question Answering in Multilingual Setting; NLP in
Information Retrieval, NLP in Information Extraction, Cross-Lingual IR, Text-classification
Machine Learning Supervised, Unsupervised and Reinforcement learning, Artificial neural networks (ANN) , Convolutional neural
Concepts networks (CNN), and recurrent neural networks (RNN).
Text Book(s):
1. Jurafsky, D. and Martin J. H., Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics and
Speech Recognition. Upper Saddle River, NJ: Prentice-Hall, 2000. ISBN: 0130950696.
2. Manning, Christopher D., and HinrichSchütze. Foundations of Statistical Natural Language Processing, Cambridge, MA: MIT Press, 1999. ISBN:
0262133601.
Reference Books:
1. Dale R., Moisl H. and Somers H., Handbook of Natural Language Processing, MARCEL DEKKER, Inc., 2009.
2. Bird, S.K. Ewan and Loper E., Natural Language Processing with Python, Oreilly Publication, 2009.


Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 2 3 2 3 2 3
CO2 3 2 3 2 3 2 3
CO3 3 2 3 2 3 2 3
CO4 3 2 3 2 3 2 3
CO5 3 2 3 2 3 2 3

1 Name of the Course 2 0 0 0 2 2
21CST-463 Search Engine Optimization 21CST-463
ANTI-REQUISITE -
The course begins with the theoretical study of the search process and basics of search engine along with different search algorithms. The students are
then introduced with the concept of search engine optimization and its objectives along with different case studies. The course further comprises of
different underlying stages involved in search engine optimization along with introduction to keyword research. Further, in this course different
essential elements required for developing an SEO friendly website have also been included. The last section focuses on optimizing vertical search and
need of tracking search results in order to improve SEO performance.
1. To understand basics of SEO and how search engines work
2. To learn the steps, you need to prepare for, execute, and evaluate SEO initiatives.
3. To examine a number of advanced strategies and tactics
c. Course Outcomes:
CO1 Comprehend the basics of search engine and related challenges.
CO2 Comprehend the concept of Search Engine Optimization, its challenges and applications.
CO3 Understand the underlying details of Search Engine Optimization along with relevance of Keyword search.
CO4 Acquire knowledge about essential elements required for developing an SEO-friendly website.
CO5 Understand the importance of tracking search results and other factors for improving SEO process performance.
d. Syllabus
Unit-1 Introduction to Search Engine Optimization Contact Hours: 15
Introduction The Mission of Search Engines, The Human Goals of Searching, Determining Searcher Intent: A Challenge for
Both Marketers and Search Engines, How People Search, How Search Engines Drive Commerce on the Web
Basics of Search Engine Understanding Search Engine Results, Algorithm-Based Ranking Systems: Crawling, Indexing, and Ranking,
Determining Searcher Intent and Delivering Relevant, Fresh Content, Analyzing Ranking Factors, Using
Advanced Search Techniques, Vertical Search Engines, Country-Specific Search Engines.
SEO Objectives Setting SEO Goals and Objectives, Developing an SEO Plan Prior to Site Development, Understanding
Audience and Finding Niche, SEO for Raw Traffic, SEO for E-Commerce Sales, SEO for Mindshare/Branding,
SEO for Lead Generation and Direct Marketing, SEO for Reputation Management, SEO for Ideological
Influence
Unit-2 Understanding Search Engine Optimization Contact Hours:15
Initial Stages of SEO The Major Elements of Planning, Identifying the Site Development Process and Players, Defining Site’s
Information Architecture, Auditing an Existing Site to Identify SEO Problems, Identifying Current Server
Statistics Software and Gaining Access, Determining Top Competitors, Assessing Historical Progress,
Benchmarking Current Indexing Status Benchmarking Current Rankings, Benchmarking Current Traffic
Sources and Volume, Leveraging Business Assets for SEO, Combining Business Assets and Historical Data to
Conduct SEO/Website SWOT Analysis.
Keyword Research The Theory Behind Keyword Research, Traditional Approaches: Domain Expertise, Site Content Analysis,
Keyword Research Tools, Determining Keyword Value/Potential ROI, Leveraging the Long Tail of Keyword
Demand, Trending, Seasonality, and Seasonal Fluctuations in Keyword Demand
Developing an SEO- Making Site Accessible to Search Engines, Creating an Optimal Information Architecture, Root Domains,
Friendly Website Subdomains, and Microsites, Optimization of Domain Names/URLs, Keyword Targeting, Content
Optimization, Duplicate Content Issues, Controlling Content with Cookies and Session IDs, Content Delivery
and Search Spider Control, Redirects, Content Management System (CMS) Issues, Optimizing Flash, Best
Practices for Multilanguage/Country Targeting.
Unit-3 Evaluation of Search Engine Optimization Contact Hours:15
Optimizing for Vertical The Opportunities in Vertical Search, Optimizing for Local Search, Optimizing for Image Search, Optimizing
Search for Product Search, Optimizing for News, Blog, and Feed Search, Others: Mobile, Video/Multimedia Search
Tracking Results and Why Measuring Success Is Essential to the SEO Process, Measuring Search Traffic, Tying SEO to Conversion
Measuring Success and ROI, Competitive and Diagnostic Search Metrics, Key Performance, Indicators for Long Tail SEO.
Intrusion Detection Crow Search Optimization, search space, search space vector, quality measures/assessments for at least 3-4
Systems in SEOs types of search based on search space vectors.
Text Book(s):
1. Eric Enge, Stephan Spencer, Rand Fishkin, Jessie C Stricchiola, “The Art of SEO : Mastering Search Engine Optimization”, O'Reilly Media,
October,2009.
Reference books:
1. Jerri L. Ledford, “SEO: Search Engine Optimization Bible”, 2nd Edition, Wiley India, April, 2009.
2. John I Jerkovic, “SEO Warrior: Essential Techniques for Increasing Web Visibility”, O'Reilly.


Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 2 2
CO2 3 3 2 2
CO3 3 3 2 2
CO4 3 3 2 2
CO5 3 3 2 2

21CST-464 WIREFRAMING AND UI PROTOTYPING 21CST-464
ANTI-REQUISITE -
This course is focused on the application of the early UX research to actual user interfaces: the creation of wireframes, high-fidelity mockups, and
clickable prototypes. Responsive web design and mobile web challenges - Mobile-first approach - Web typography - The relationship between design and
programming and whether it is important to know how to code - The different web technologies that make the web work, such as HTML, CSS, JavaScript,
server-side coding, and databases.
1. This subject is designed to impart knowledge on application of user interfaces, creation of interfaces.
2. It is designed to impart knowledge on skill set of UI/UX for application development.
c. Course Outcomes
CO1
This course is focused on the application of the early UX research to actual user interfaces: the creation of wireframes, high-fidelity
mockups, and clickable prototypes..
CO2
The relationship between design and programming and whether it is important to know how to code.
CO3
The course will help to experience in front- or back-end web development or human-computer interaction and want to sharpen
their visual design and analysis skills for UI or UX..
d. Syllabus
Unit-1 Unit-1 Contact Hours: 15
<Chapter 1> Introduction to wireframes,Design basics,types of websites,wireframing a website,Introduction to design
thinking approach and design terminology,creating wireframes,Design patterns and cognition.
<Chapter 2> Introduction to UI/UX,UI design controls, UI design patterns,UI/UX design process,UI design principles,UI/UX
wireframing,wireframing and prototyping,wireframing for smartphones,wireframing web dashboards.
<Chapter Name 3> Paper wireframes: Introduction,wireframe elememts,wireframe styles,
Digital wireframes: Introduction,wireframe tools,wireframing in adobe photoshop

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping

Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

21CST-471 Big Data Analytics Course Code(s)
ANTI-REQUISITE -
The course begins with the theoretical study of data analysis which is widely utilized in data sciences The students are then introduced the of data
analysis. The course further emphasizes on the use of software's.
1. Data analysis and the background concepts necessary for successfully analyzing data.
2. Represent mathematical information symbolically, visually, numerically and verbally.
3. Use statistical software to summarize data numerically and visually, and to perform data analysis.
c. Course Outcomes
CO1
Understanding concept and approaches of formulating and solving problems by utilizing quantitative and qualitative methods
CO2
Develop working skills of analyzing and solving quantitative models with computer programs used in business
CO3
Apply specific quantitative models and tools in various functional areas in business
d. Syllabus
Unit-1 Unit-1 Contact Hours:
Introduction to Data The need for Data Analysis, Reign of Data Analysis, What we are going to achieve, Real life examples
Analysis Descriptive Statistics: Introduction to the Descriptive Statistics, Probability Distributions Inferential Statistics:
Inferential Statistics through hypothesis tests, Permutation &Randomization Test Regression & ANOVA:
Regression, ANOVA (Analysis of Variance).
Machine Learning Introduction and Concepts, Differentiating algorithmic and model based frameworks, Regression: Ordinary
Least Squares, Ridge Regression, Lasso Regression, K Nearest Neighbors Regression & Classification.
Supervised Learning with Regression and Classification techniques -1: Bias-Variance Dichotomy, Model
Validation Approaches Logistic Regression, Linear Discriminate, Analysis Quadratic Discriminate Analysis
Regression and Classification Trees Support Vector Machines Supervised Learning with Regression and
Classification techniques -2: Ensemble Methods: Random Forest, Neural Networks, Deep learning.
Unsupervised Learning Clustering, Associative Rule Mining Challenges for big data analytics Prescriptive analytics: Creating data for
and Challenges for Big analytics through designed experiments, creating data for analytics through Active learning, creating data for
Data Analytics analytics through Reinforcement learning

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping

Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

21CST-472 Robotic Process Automation 21CST-472
ANTI-REQUISITE -
This course is intended to provide accounting and financial professionals with practical literacy on robotic process automation through a real-world,
relevant data preparation use case.
• Learn to implement Robotic Process Automation.
• To make the system as Improve customer experience, improve accuracy, Manage controls, Higher Efficiency, Reduction of monotonous work, and
Cost saving, etc.
• Robotic Process Automation (RPA) is the next phase of innovation in the world. It’s significant potential to become a differentiator has become
evident. Therefore, objective of the course is to make students’ differentiator to become evident.
c. Course Outcomes
CO1
To be understand and familiar with fundamental processes of Robotic Process Automation
CO2 To understand the working of RPA tools, to recognize and represent problems in better way to find the best solution
CO3
TounderstandbasicdatastructuresandfunctionofAutomationAnywhereEnterprise(ToolforRPA)
d. Syllabus
Introduction to Robotic
Process Automation: Introduction to Robotic Process Automation (RPA and its Use Cases), Introduction to tools used for RPA.
Architecture and Its capabilities. Introduction to Automation Anywhere Enterprise Platform, Advanced
Features and Capabilities, Ways to Create Bots using Automation Anywhere.
Introduction to
Workbench and Introduction to Automation Anywhere Workbench, Various Work Bench Commands, Variables, If/Else
commands command, Loop Command.
Error Handling
Commands and techniques for Error Handling Command (Log and Messages), Log to File Command
Working with office Working with Excels. Read and write excels. Reading Data, Writing Data, Sheet Processing, various formulae
commands in excel.
Files & Folders
File or Folder Command, Object Cloning Command, Insert Keystroke Command
Recorders Introduction to Recorders, Screen Recorder, Web Recorder and Smart Recorder. Manage Windows Control
Command
Security in RPA
Information Security in RPA, implementation of Pretty Good Privacy using various cryptography techniques.
Connectivity and
Communication Email Automation broadcast the email using excel data, Database Connectivity.
Images and OCR
Image Recognition Command, Optical Character Recognition, Introduction to Web Control Room and its
Management, Deploying bots in real time.

Theory
Marks 40 60
Total Marks 100

assignment
2 Exam 12 marks for One per Unit 4 marks As applicable to
each test course types
3 Quiz/Test 4 marks of each 2 per Unit 4 marks depicted above.
quiz

questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

2 2 0 0 0 2 2 DE
21CST-473 AR/VR Simulation 21CST-473
ANTI-REQUISITE -
This course covers the technical and experiential design foundation required for the implementation of immersive environments in current and future
virtual, augmented and mixed reality platforms. The curriculum covers a wide range of literature and practice starting from the original Computer Science
and HCI concepts following the evolution of all supporting technologies including visual displays for VR, AR and MR, motion tracking, interactive 3D
graphics, multimodal sensory integration, immersive audio, user interfaces, IoT, games and experience design.
The objective of the course is to establish and cultivate a broad and comprehensive understanding of this rapidly evolving and commercially viable field of
Computer Science and prepare the student for participating in the production of highly integrative immersive applications, immersive social platforms,
cross disciplinary academic research projects and leading developments in Medical, Industrial and Manufacturing R&D.
.
c. Course Outcomes
CO1
CO2
To excel in career as researcher in both traditional and emerging fields of science.
CO3
CO4
To think critically and creatively, especially about the use knowledge about biology of cancer and new areas of biology to address
local and global problems.
d. Syllabus
Introduction to Virtual Introduction, Fundamental Concept and Components of Virtual Reality. Primary Features and Present
Reality Development on Virtual Reality. Computer graphics, Real time computer graphics, Flight Simulation, Virtual
environment requirement, benefits of virtual reality, Historical development of VR, Scientific Landmark 3D
Computer Graphics: Introduction, The Virtual world space, positioning the virtual observer, the perspective
projection, human vision, stereo perspective projection, 3D clipping, Colour theory, Simple 3D modelling,
Illumination models, Reflection models, Shading algorithms, Radiosity, Hidden Surface Removal, Realism-
Stereographic image.
Interactive Techniques in Introduction, From 2D to 3D, 3D space curves, 3D boundary representation Geometrical Transformations:
Virtual Reality Introduction, Frames of reference, Modeling transformations, Instances, Picking, Flying, Scaling the VE,
Collision detection Generic VR system: Introduction, Virtual environment, Computer environment, VR
technology, Model of interaction, VR Systems.
Visual Computation in Animating the Virtual Environment: Introduction, The dynamics of numbers, Linear and Nonlinear
Virtual Reality interpolation, the animation of objects, linear and non-linear translation, shape & object inbetweening, free
from deformation, particle system. Physical Simulation: Introduction, Objects falling in a gravitational field,
Rotating wheels, Elastic collisions, projectiles, simple pendulum, springs, Flight dynamics of an aircraft.
Augmented and Mixed Taxonomy, technology and features of augmented reality, difference between AR and VR, Challenges with AR,
Reality AR systems and functionality, Augmented reality methods, visualization techniques for augmented reality,
wireless displays in educational augmented reality applications, mobile projection interfaces, marker-less
tracking for augmented reality, enhancing interactivity in AR environments, evaluating AR systems.
Multiple Models of Input Human factors: Introduction, the eye, the ear, the somatic senses. VR Hardware: Introduction, sensor
and Output Interface in hardware, Head-coupled displays, Acoustic hardware, Integrated VR systems. VR Software: Introduction,
Virtual Reality Modeling virtual world, Physical simulation, VR toolkits, Introduction to VRML, Input - Tracker, Sensor, Digital
Glove, Movement Capture, Video-based Input, 3D Menus & 3DScanner etc. Output - Visual /Auditory / Haptic
Devices.
Application of VR in VR Applications in Manufacturing
Digital Entertainment
VR Technology in Film & TV Production. VR Technology in Physical Exercises and Games. Demonstration of
Digital Entertainment by VR.
Productivity Enhancement Platforms: Virtual Prototyping spaces, Virtual collaborative working spaces,
Augmented and Virtual Assistance, Telepresence.
Applications of VR in Robotics: Robot Programming, Robot Teleoperation.
Information Visualization: Oil Exploration and Well Management, Big Data Visualization, Volumetric Data
Visualization
Role of VR and AR in 5G technology: prospects of 5G network model to revolutionize Industry and Education
uosng AR, VR


Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3

2 2 0 0 0 2 2 DE
21CST-474 Computer Graphics 21CST-474
ANTI-REQUISITE -
Students will gain experience in interactive computer graphics using the OpenGL API. Topics include: 2D viewing, 3D viewing, perspective, lighting, and
geometry. This course will introduce students to all aspects of computer graphics including hardware, software and applications.
• To understand growing importance of graphics in computer field.
• To gain familiarity with basic algorithms and techniques of computer graphics.
• To prepare students to design graphics systems and application programs
c. Course Outcomes:
CO1 Design two dimensional graphics and Apply two dimensional transformations
CO2 Apply Illumination and color models and clipping techniques to graphics.
CO3 Design three dimensional graphics and apply three dimensional transformations.
d. Syllabus
Chapter-1 (Introduction) Origins of Computer Graphics, Interactive Graphics display working, Scan conversion; Raster and Random scan
conversion. Point plotting techniques: Coordinate systems, Incremental methods, Line drawing algorithms:
Simple DDA, Symmetrical DDA, Bresenham’s algorithm. Midpoint circle drawing algorithm, Circle generators.
Chapter-2 (Line Drawing Display devices and Controllers, CRT, Inherent memory devices, Storage tube display, Refresh line drawing
Displays) displays.
Chapter-3 (F2-D Transformation principles, Homogeneous coordinate systems, Concatenations, Matrix representations of
Transformations) transformations.
Chapter-4 (Clipping and Point clipping, Line clipping algorithms: Cohen Sutherland algorithm, Midpoint subdivision algorithm. Polygon
Windowing) clipping, Viewing transformations, Windowing transformations.
Chapter-5 (Graphics Ground rules for graphics software design, Functional domains, Graphic primitives, Windowing functions,
Packages) miscellaneous functions, Display code generator.
Chapter-6 (Interactive Graphical input devices: Pointing and Positioning devices, Mouse, Tablets, light pen, 3-D Input devices,
Graphics) Comparators. Graphical input techniques: Positioning techniques, pointing and Selection, Inking and Painting,
On-line character recognition.

Chapter-7 (Solid Area Scan Geometric representation of areas, Scan converting polygons, Priority, The Y-X algorithm, Properties of scan
Conversion) conversion algorithms.
Chapter-8 (3-D Graphics) Curves and Surfaces: Parametric functions, Bezier methods and B-Spline methods. Three dimensional
transformations, Perspective transformations, Perspective depth.
Chapter-9 (Hidden Surface Basic approaches, Depth –Buffer algorithm, Scan line coherence algorithms, Area coherence algorithms,
Elimination) Priority algorithms.

Theory
Marks 40 60
Total Marks 100

assignment
each test As applicable to
3 Quiz/Test 4 marks of each 2 per Unit 4 marks course types
Quiz depicted above.
questions)

Engagement Task
g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3

2 2 0 0 0 2 2 DE
21CST-474 DEV-OPS 21CST-474
ANTI-REQUISITE -
Prepares students for a career in DevOps, bridging the gap between software developers and operations teams.
● Provide developers more control of the production environment and a better understanding of the production infrastructure
● Emphasize the teamwork and communication among software developers and IT professionals
● DevOps to automate build, testing ,deployment ,Monitoring, Issue Tracking phases.
c. Course Outcomes
CO1 Cross-business effort to turn software developments on its head with a shorter cycle time, lower testing time, more automation
CO2 Continuous Integration pipeline and a Continuous Deployment/Delivery process.
CO3 DEV-OPS focuses on supplying software product quicker by lowering the failure rate of builds
d. Syllabus
<Chapter 1> Introduction: DevOPs History and evolution of DevOps, Transformation with DevOps and Agile, market trend of
DevOps Some typical tool stack for DevOps Jobs, Client-Server and Distributed Version control system, DevOps
Life cycle phase wise, End-to-End lifecycle Management, Comparison between DevOps and Agile process,
Principles of DevOps, DevOps Automation Tools, Why DevOps,
A unified process between development and operations : Introduction to how Agile software development
process applies to DevOps, the importance of integrating source control in DevOps, and how automation is
applied to DevOps.
<Chapter 2> Different Use Cases of DevOps: Cloud Computing, How Cloud Computing are helpful, Cloud's role in DevOps
orchestration, AWS, Use cases in AWS, Companies using AWS and Market tends, Different Services offered in
AWS, Use case: - Highly available fault tolerant systems, Understanding availability zone region, Creating your
own account in AWS, Creating a VPC.
Continuous Integration (CI), continuous testing, and continuous deployment: Introduction to the key
concepts, benefits, tools, and practices of implementing Continuous Integration (CI), continuous testing, and
continuous deployment
<Chapter Name 3> Common DevOps Practices and Techniques: 1 Continuous Integration, Testing and Deployment, Infrastructure
As Code, Test-Driven Deployment, Integrated Tool chains, Distributed Version Control, Production Monitoring,
Public, Private and Hybrid Cloud Technologies. Advantages of Git over SVN, Git User trends, Different Git tools
(GitDesktop. Kraken), Git Installation and Configuration, Setting up Git Bash and Git UI, Creating first repository.

Theory
Marks 40 60
Total Marks 100

assignment
each test
questions)
Engagement Task

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3

SN Course Code TITLE OF THE COURSE L T P S C CH Course Type*
4 Project – V 0 0 1 5 3 6 <PR>
21CSR-451 21CSR-451
PRE-REQUISITE 21CSR-264, 21CSR-318, 21CSR-359,21CSR-414
CO-REQUISITE NIL
ANTI-REQUISITE NIL
Final Year Projects are a culmination of study towards the partial fulfillment of the award of the degree. Projects offer the opportunity to apply and
extend technologies learned throughout the program. Assessment is by means of a seminar presentation along with submission of a thesis, and a public
demonstration of work undertaken. In contrast to the majority of courses studied elsewhere in the program, projects are undertaken individually or in
small groups. This necessarily introduces the dimension of workload management into the program to enable completion of a large, relatively
unstructured "assignment" over the course of the semester. The projects undertaken span a diverse range of topics, including theoretical, simulation and
experimental studies, and vary from year to year. The emphasis is necessarily on facilitating student learning in technical, project management and
presentation spheres.
The aim of this course is to enable the students to work on a project concerning some advanced Problem / research area / industrial applications
preferably using the tool or language learnt in previous semesters. Each student shall have a guide/mentor/supervisor who is a faculty member. The
objective of this course delivering a project exercise for students is to inculcate lifelong learning and professional ethics in order to achieve industrial,
socio-economical, sustainable growth of the society.
c. Course Outcomes
CO1 To exhibit a sound technical knowledge of their selected project topic.
CO2 To undertake problem identification, problem formulation and feasibility study along with the identification of solution.
CO3 To design engineering solutions to complex problems utilizing a systematic approach.
CO4 To conduct an engineering project as an individual or team.
CO5 To communicate with engineers and the community at large.
d. Syllabus / Content
Students will be required to:
1. Perform a literature search to review current knowledge and developments in the chosen technical area;
2. Undertake detailed technical work in the chosen area using one or more of:
Theoretical studies with Practical Relevance
Computer simulations with Software as an output
Hardware construction resulting in a Hardware Model
3. Produce progress reports or maintain a professional journal to establish work completed, and to schedule additional work within the time
frame specified for the project;
4. Deliver a seminar on the general area of work being undertaken and specific contributions to that field;
5. Prepare a formal report describing the work undertaken and results obtained so far; and
6. Present the work in a forum involving paper/poster presentations and demonstrations of operational hardware and software model
constructs.
e. Possible Outcomes
• Software / Web Application / Mobile Application / Research Paper / Patent / Networking Model / Hardware + Software Model
As per the Rubrics Approved by Higher Authorities
The performance of students will be evaluated as follows:
Theory
Marks 60 40
Total Marks 100

Sr. No. Type of Assessment Weightage of actual Frequency of Final Weightage in Internal Remarks
conduct Task Assessment
1 Proposal 5 1 5
2 Synopsis 8 1 8
3 Modeling 8 1 8
4 Implementation 12 1 12
5 Presentation and 5+5+10 3 20
Assessment
6 Project Outcome 7 1 7
g. CO-PO Mapping

Course
Outcome
CO1 3 3 3 3 2 2 3 3 3 2 2 3
CO2 2 2 1 3 2 2 3
CO3 2 2 2 3 2 3 2 3 2
CO4 2 1 3 2 3 2 3
CO5 2 1 3 2 2 3 2 2 2 2 3

Sr. TITLE OF THE COURSE L T P S C CH Course Type*
No. Code 0 0 2 0 1 2 DE/PE
6
21CSP-461 DATA VISUALIZATION LAB 21CSP-461
ANTI-REQUISITE -
Fundamental concepts of data visualization; information visualization types; design principles of data visualization; tools for static data visualization;
tree and network visualizations; big data visualizations.
This course covers the basic theories of data visualization, such as data types, chart types, visual variables, visualization techniques, color theory,
cognitive theory, and data patterns.
.
c. Course Outcomes
CO1 Present data with visual representations for your target audience, task, and data.
CO2 Create multiple versions of digital visualizations using various software packages.
CO3 Identify appropriate data visualization techniques given particular requirements imposed by the data.
d. Syllabus
Unit-1 Introduction to Data Analysis Contact Hours:10
Experiment No 1 Data preprocessing methods on student and labor datasets Implement data cube for data warehouse on 3-
dimensional data
Experiment No 2 Implement various missing handling mechanisms
Experiment No 3 Implement linear regression techniques
Experiment No 4 Develop k-means clustering techniques.
Unit-2 Machine Learning Contact Hours:10
Experiment No 5 Design algorithms for association rule mining algorithms
Experiment No 6 Derive the hypothesis for association rules to discovery of strong association rules; Use confidence and support
thresholds.
Experiment No 7 Construct principal component analysis (PCA) for 5-dimensional data.
Unit-3 Unsupervised Learning and Challenges for Big Data Analytics Contact Hours:10
Experiment No 8 Implement the program for converting the clusters into histograms
Experiment No 9 Write a program to implement agglomerative clustering technique
Experiment No 10 Write a program to implement divisive hierarchical clustering technique
d. Textbooks / Reference Books

1. Andy Kirk, Data Visualization A Handbook for Data Driven Design, Sage Publications, 2016
2. Philipp K. Janert, Gnuplot in Action, Understanding Data with Graphs, Manning Publications, 2010.
3. Ben Fry, Visualizing Data: Exploring and Explaining Data with Processing Environment, O'Reilly Media.
4. John Verzani, simpler – Using R for Introductory statistics

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

Sr. No. Code TITLE OF THE COURSE L T P S C CH Course Type*
6 Natural Language Processing Lab 0 0 2 0 1 2 DE/PE
21CSP-462 21CSP-462
ANTI-REQUISITE -
The course begins with the theoretical study of Natural Language Processing which is widely used solving various text and speech related problems.
The students are then introduced with various word forms and concept parsing. The course further comprises language modeling techniques with
Parts of Speech as case study. Different Machine Learning techniques have also been included in the course. The last section focuses on semantics,
different NLP applications and concepts of Machine learning and neural networks.
1. To understand the basic concepts of Natural Language Processing (NLP).
2. The student must be able to apply the various concepts of NLP in other application areas.
c. Course Outcomes
CO1 Comprehend the concept of natural language processing, its challenges and applications.
CO2 Comprehend the concepts word forms of the language by considering the concept of morphology analysis.
CO3 Acquire ability to perform syntax and semantics in natural language processing.
d. Syllabus
Unit-1 Introduction to NLP Contact Hours:10
Experiment No 1 Perform file operations in python.
Experiment No 2 Perform word counts of a file in python
Experiment No 3 Perform word analysis and generation in python
Experiment No 4 Build a full chunker in python
Unit-2 Syntactic analysis Contact Hours:10
Experiment No 5 Create N-gram Model in python
Experiment No 6 Build a POS tagger using HMM
Experiment No 7 Build a POS tagger using Veterbi Decoding

Unit-3 Text Processing using ML Contact Hours:10
Experiment No 8 Perform Text processing using Neural Networks
Experiment No 9 Create a Word prediction system.
Experiment No 10 Perform Sentiment Analysis
Textbook(s):
1. Jurafsky, D. and Martin J. H., Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics and
Speech Recognition. Upper Saddle River, NJ: Prentice-Hall, 2000. ISBN: 0130950696.
2. Manning, Christopher D., and HinrichSchütze. Foundations of Statistical Natural Language Processing, Cambridge, MA: MIT Press, 1999. ISBN:
0262133601.
Reference books:
1. Dale R., Moisl H. and Somers H., Handbook of Natural Language Processing, MARCEL DEKKER, Inc., 2009.
2. Bird, S.K. Ewan and Loper E., Natural Language Processing with Python, Oreilly Publication, 2009.

Theory
Marks 60 40
Total Marks 100



g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

SN Code TITLE OF THE COURSE L T P S C CH Course Type*
6 Search Engine Optimization Lab 0 0 2 0 1 2 DE
21CSP-463 21CSP-463
ANTI-REQUISITE -
Search Engine Optimization Lab Course enables the students to learn search engine optimization to enhance the quality and quantity of web traffic for
their own personal or business websites.
Upon successful completion of this course, students should be able to:
• To understand the basics of Search Engine Optimization and Digital Marketing.

• To use and understand the various search engine optimization techniques for better digital marketing.
• To optimize web content by identifying keywords to achieve a higher webpage ranking.
• To be familiar with latest search engine optimization techniques.
c. Course Outcomes
CO1 Identify the element of Search Engine Optimization.
CO2 Comprehend the latest search engine optimization methods and techniques.
CO3 Construct search engine-friendly web sites.
d. Syllabus
Unit-1 Introduction session Contact Hours: 10
<Experiment No 1> To learn Keyword search.
< Experiment No 2> To learn crawling, indexing and ranking for better search.
< Experiment No 3> To implement page ranking algorithm.
< Experiment No 4> To be familiar with SEO for e-commerce Sale.
< Experiment No 5> To implement Search Engine Optimization for understanding Audience.
Unit-2 List of Tasks/ Micro-Projects Contact Hours: 10
< Experiment No 6> To implement Search Engine Friendly Websites.
<Experiment No 7> To deal with duplicate content issue in Search Engine Optimization.
Unit-3
<Experiment No 7> To study Intrusion Detection in SEOs.
<Experiment No 7> To implement optimization for image search.
<Experiment No 7> To study measurement techniques for search traffic.
Textbook:
1. Eric Enge, Stephan Spencer, Rand Fishkin, Jessie C Stricchiola, “The Art of SEO : Mastering Search Engine Optimization”, O'Reilly Media,
October,2009.
Reference Books:
1. Jerri L. Ledford, “SEO: Search Engine Optimization Bible”, 2nd Edition, WileyIndia, April, 2009.
2. John I Jerkovic, “SEO Warrior: Essential Techniques for Increasing Web Visibility”, O'Reilly.
Web Resources:
1. https://www.coursera.org/specializations/seo
2. https://www.lynda.com/SEO-training-tutorials/1469-0.html
3. https://www.udemy.com/courses/marketing/search-engine-optimization/

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

Sr. No. Code TITLE OF THE COURSE L T P S C CH Course Type*
6 Wireframing And UI Prototyping Lab 0 0 2 0 1 1 DE/PE
21CSP-464 21CSP-464
ANTI-REQUISITE -
This course is focused on the application of the early UX research to actual user interfaces: the creation of wireframes, high-fidelity mockups, and
clickable prototypes. Responsive web design and mobile web challenges - Mobile-first approach - Web typography - The relationship between design
and programming and whether it is important to know how to code - The different web technologies that make the web work, such as HTML, CSS,
JavaScript, server-side coding, and databases.
This subject is designed to impart knowledge on application of user interfaces, creation of interfaces.
It is designed to impart knowledge on skill set of UI/UX for application development.
c. Course Outcomes
CO1 This course is focused on the application of the early UX research to actual user interfaces: the creation of wireframes, high-fidelity
mockups, and clickable prototypes.
CO2 The relationship between design and programming and whether it is important to know how to code.
CO3 The course will help to experience in front- or back-end web development or human-computer interaction and want to sharpen their
visual design and analysis skills for UI or UX..
d. Syllabus
Unit-1 Introduction Session Contact Hours: 15
Experiment No 1 Implement the basic of wireframe.
Experiment No 2 Implement the wireframe styles.
Experiment No 3 Wireframe a website.
Experiment No 4 Implement the basics of UI.
Experiment No 5 Implement the design controls
Experiment No 6 Implement the UI Wireframing
Experiment No 7 Implement the wireframing for smartphones
Experiment No 8 Implement the wireframing web dashboards
Experiment No 9 Implement paper wireframe
Experiment No 10 Implement digital wireframe
Textbook:
1. UI/UX Sketchbook for Wireframing And Prototyping
Reference Books:
1. The Guide to Wireframing
2. UX/UI Design Notebook for Wireframing and Prototyping Responsive Web and Mobile Products | Dot Grid Journal.

Theory
Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

S. Codes TITLE OF THE COURSE L T P S C CH Course Type*
No. 0 0 2 0 1 2 DE/PE
7
21CSP-471 BIG DATA ANALYTICS LAB 21CSP-471
ANTI-REQUISITE -
The course begins with the theoretical study of data analysis which is widely utilized in data sciences The students are then introduced the of data
analysis. The course further emphasizes on the use of software.
• Data analysis and the background concepts necessary for successfully analyzing data.
• Represent mathematical information symbolically, visually, numerically and verbally.
• Use statistical software to summarize data numerically and visually, and to perform data analysis.
c. Course Outcomes
CO1 Understanding concept and approaches of formulating and solving problems by utilizing quantitative and qualitative methods
CO2 Develop working skills of analyzing and solving quantitative models with computer programs used in business
CO3 Apply specific quantitative models and tools in various functional areas in business
d. Syllabus
Unit-1 Introduction to Data Analysis Contact Hours:10
Experiment No 1 Perform Exploratory data analysis in python.
Experiment No 2 Perform Linear Regression in python
Experiment No 3 Perform Random Forest in python
Experiment No 4 Perform Logistic Regression in python
Unit-2 Machine Learning Contact Hours:10
Experiment No 5 Perform K Nearest Neighbors in python
Experiment No 6 Perform Support Vector Machines in python
Experiment No 7 Perform different performance metrics for classification and regression in python
Unit-3 Unsupervised Learning and Challenges for Big Data Analytics Contact Hours:10
Experiment No 8 Perform Single Layer Perceptron in python
Experiment No 9 Perform Multi Layer Perceptron in python
Experiment No 10 Perform Kmeans in python
TextBook(s):
T1. Bill F.2012, Taming the big data tidal wave, john Wiley & Sons. ISBN: 9781119204275
Reference books:
R1. BORIS I. ,KEVIN T.S & ALEXEY Y. 2015 PROFESSIONAL BIG DATA SOLUTION , WILEY ISBN-13:978-1118611937

Theory

Marks 60 40

Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

SN Codes Robotic Process Automation Lab L T P S C CH Course Type*
7 0 0 2 0 1 2 DE
21CSP-472 21CSP-472
ANTI-REQUISITE -
Robotic Process Automation Lab Course enables the students to learn robotic process automation to automate tasks.
Upon successful completion of this course, students should be able to:
• To understand the basics of Robotic Process Automation

• To use and understand the various functionalities and features of any Robotic Process Automation Software
• To identify processes eligible for automation.
• To develop and deploy bots to automate repetitive tasks of daily life.
c. Course Outcomes
CO1 Comprehend the basics of Robotic Process Automation.
CO2 Identification, Implement and deployment of Processes eligible for automation.
CO3 Understanding the underlying details of Implementation of Bots for various day to day useful tasks.
d. Syllabus
Unit-1 Introduction session Contact Hours:
<Experiment No 1> To learn installation process of RPA software (IBM/UiPath or any other open source software) and tools along
with RPA Packages.
< Experiment No 2> To learn to create a simple BOT using RPA Tools for automation process.
< Experiment No 3> To implement a workflow using various control variables and structures in RPA.
< Experiment No 4> To be familiar with workflow in RPA using if/else, For Each and Switch Case structure.
< Experiment No 5> To study various errors and their corresponding error-handling commands.
Unit-2 List of Tasks/ Micro-Projects Contact Hours:
< Experiment No 6> 12. To work with MS-Excel and using RPA to automate following example excel tasks:
A) To read from and write in worksheets.
B) To automate using various formulae in MS-Excel.
13. To study and implement File/Folder command, Object Cloning Command and Keystroke command.
14. To study various screen recording options and commands and to implement Recording Workflow.
Unit-3 15. To implement any one cryptography technique using automation anywhere.
<Experiment No 7> 16. To implement a bot for Email-Automation using RPA.
< Experiment No 8> 17. To learn about database connectivity automation using RPA.
18. To learn and implement web control room automation and its management using RPA
19. To study deployment of bots in real time applications.
< Experiment No 9> 20. To automate data manipulation task using RPA.
< Experiment No 10> 21. To implement a bot for PDF Automation task.
Textbook:
Reference Books:
1. The Robotic Process Automation Handbook: A Guide to Implementing RPA Systems BY Tom Taulli, Apress Publications.
2. Learning Robotic Process Automation: Create Software robots and automate business processes with the leading RPA tool – UiPathByAlok
Mani Tripathi, Packt Publishing, ISBN: 9781788470940.
Web Resources:
1. https://academy.uipath.com/learn
2. https://www.udemy.com/course/complete-uipath-rpa-developer-course
3. https://intellipaat.com/rpa-training

Theory
Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

Sr. No. Codes AR/VR Simulations Lab L T P S C CH Course Type*
7 0 0 2 0 1 2 DE
21CSP-473 21CSP-473
ANTI-REQUISITE -
This course covers the technical and experiential design foundation required for the implementation of immersive environments in current and future
virtual, augmented and mixed reality platforms. The curriculum covers a wide range of literature and practice starting from the original Computer Science
and HCI concepts following the evolution of all supporting technologies including visual displays for VR, AR and MR, motion tracking, interactive 3D
graphics, multimodal sensory integration, immersive audio, user interfaces, IoT, games and experience design.
The objective of the course is to establish and cultivate a broad and comprehensive understanding of this rapidly evolving and commercially viable field
of Computer Science and prepare the student for participating in the production of highly integrative immersive applications, immersive social
platforms, cross disciplinary academic research projects and leading developments in Medical, Industrial and Manufacturing R&D. During the duration of
the course students are expected to work in collaborative group projects and develop working prototypes, demo experiences, immersive platforms,
unique controllers and new innovative technologies that can be used in the development and production of immersive environments in the fields of
entertainment, education, training, medical and industrial innovation.
c. Course Outcomes
CO1
CO2
To excel in career as researcher in both traditional and emerging fields of science.
CO3
CO4
To think critically and creatively, especially about the use knowledge about biology of cancer and new areas of biology to address local
and global problems.
d. Syllabus
Experiment No 1 Development Tools and Frameworks in Virtual Reality
Experiment No 2 Case Study to identify practical uses of VR in daily life.
Experiment No 3 Write a program in VR modeling to draw a house like structure combining different shapes like cone,
cylinderbox
Experiment No 4 Write a program in VR modeling Language to draw a box with desired color and size
Experiment No 5 HARDWARE TECHNOLOGIES FOR 3D USER INTERFACES
Experiment No 6 Studying human behavior with virtual reality: The Unity Experiment Framework.
Experiment No 7 Simulation of Flight to determine Human reaction to Aircraft Motion Environment.
Unit-3
Experiment No 8 Multiple Models of Input and Output Interface in Virtual Reality.
Experiment No 9 Fundamentals of Computer Graphics. Software and Hardware Technology on Stereoscopic Display.
Experiment No 10 Augmented reality methods, visualization techniques for augmented reality.
Textbook:
1. Burdea, G. C. and P. Coffet. Virtual Reality Technology, Second Edition. Wiley-IEEE Press, 2003/2006.
2. Alan B. Craig, Understanding Augmented Reality, Concepts and Applications, Morgan Kaufmann, 2013.
Reference Books:
1. Alan Craig, William Sherman and Jeffrey Will, Developing Virtual Reality Applications, Foundations of Effective Design, Morgan Kaufmann,
2009.
Theory

Marks 60 40
Total Marks 100


g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

Sr. No. Codes L T P S C CH Course Type*
7 Computer Graphics Lab 0 0 2 0 1 2 DE
21-CSP-474 21CSP-474
ANTI-REQUISITE -
The course is to make students aware of the concepts underlying modern Computer Graphics. At the end of the course the student will have
the generic skills to design algorithms for digital image synthesis for a broad-based set of computing problems in various domains
To study line, circle using different algorithm in graphics.
To experience the various clipping algorithms.
To study different curves using graphics.
c. Course Outcomes
CO1 Design two dimensional graphics and apply two dimensional transformations.
CO2 Apply Illumination and color models, clipping techniques to graphics.
CO3 Design three dimensional graphics and apply three dimensional transformations.
d. Syllabus
Experiment No 1 To draw a line using Simple DDA, Symmetrical DDA and Bresenham’s Algorithm for positive line slope.
Experiment No 2 To draw a line using Simple DDA, Symmetrical DDA and Bresenham’s Algorithm for negative line slope.
Experiment No 3 To draw a line, triangle and circle using functions of graphics.h header file.
Experiment No 4 To display simple shapes (Like hut, star, car etc.) using graphics primitives
Experiment No 5 To perform translation, scaling and rotation transformations on a given triangle.

Experiment No 6 To rotate a given triangle clockwise and anticlockwise about a given point.
Experiment No 7 To clip a line intersecting at one point with given window using Cohen Sutherland Line Clipping algorithm.
Experiment No 8 To perform reflection of a point about a line y= mx+c.
Experiment No 9 To draw a circle with a given center and radius using midpoint circle algorithm.
Experiment No 10 To draw a circle with a given center and radius using circle generator algorithm.

Experiment No 11 To display 4-bit region code for end points of a line and check whether line is completely on the screen or off
the screen
Experiment No 12 To clip a line intersecting at Two or more points with given window using Cohen Sutherland Line Clipping
algorithm
Experiment No 13 To display the result of window to viewport transformation.
Experiment No 14 To calculate and display blending functions for Bezier Curves.
Experiment No 15 To draw a Bezier curve passing through four control points.

Theory

Marks 60 40
Total Marks 100

g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

S. No. Subject TITLE L T P S C CH Course Type*
7 code DevOps Lab 0 0 2 0 1 2 DE
21CSP-475 21CSP-475
ANTI-REQUISITE -
DevOps is the practice of combining the philosophies and tools of software development (Dev) and software operation (Ops). The term was first
introduced during the 2008 Agile Toronto conference by developers and technologists Patrick Debois and Andrew Shafer. Yet, as with many relatively
new technological terms thrown around the industry, it can be difficult to pin down exactly what DevOps is and how its functions are commonly put into
practice.
The objective of the DevOps methodology are to speed up the time to market, apply incremental improvements in response to the changing
environment, and create a more streamlined development process.
c. Course Outcomes
CO1 Understand the importance of Jenkins to Build, Deploy and Test Software Applications.
CO2 Analyze& Illustrate the Containerization of OS images and deployment of applications over Docker
CO3 Synthesize the provisioning using Chef/Puppet/Ansible or Saltstack.
d. Syllabus
Experiment No 1 Write a program to Perform Version Control on websites/ Software using RCS.
Experiment No 2 Write a program to Perform Version Control on websites/ Software using Mercurial.
Experiment No 3 Write a program to Perform Version Control on websites/ Software using GIT.
Experiment No 4 Write a program to Perform Version Control on websites/ Software using CVS.
Experiment No 5 Virtualization & Containerization To Install and Configure Docker for creating Containers of different Operating
System Images
Experiment No 6 Virtualization & Containerization To Build, deploy and manage web or Java application on Docker
Experiment No 7 Provisioning To Perform Software Configuration Management and provisioning using Chef
Experiment No 8 Provisioning To Perform Software Configuration Management and provisioning using Saltstack.
Experiment No 9 Provisioning To Perform Software Configuration Management and provisioning using Ansible.
Experiment No 10 Provisioning To Perform Software Configuration Management and provisioning using Puppet.
Textbook:
1. Karl Matthias & Sean P. Kane, Docker: Up and Running, O’Reilly Publication.
2. Len Bass, IngoWeber, LimingZhu, DevOps, A Software Architects Perspective, Addison-Wesley-Pearson Publication
Reference Books:
1. John Ferguson Smart, Jenkins, The Definitive Guide, O’Reilly Publication.
2. Learn to Master DevOps by Star EduSolutions

Theory
Marks 60 40
Total Marks 100



g. CO-PO Mapping
Course
Outcome
CO1 3 3 3
CO2 3 3 3
CO3 3 2 1

Curriculum and Syllabi: University Institute of Engineering

Uploaded by

Copyright:

Available Formats

You might also like

Curriculum and Syllabi: University Institute of Engineering

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Curriculum and Syllabi: University Institute of Engineering

Uploaded by

Copyright:

Available Formats

Curriculum and Syllabi

BE, Computer Science & Engineering

University Institute of Engineering

NH-95, Chandigarh-Ludhiana Highway, Gharuan, Mohali, Punjab

Bachelor of Engineering (CSE) CS-201 Page 1

S. No. Content Page No.

Bachelor of Engineering (CSE) CS-201 Page 2

Program Educational Objectives,

PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering

Bachelor of Engineering (CSE) CS-201 Page 3

Bachelor of Engineering (CSE) CS-201 Page 4

1 University Core Courses (UC) 10 5.325

Bachelor of Engineering (CSE) CS-201 Page 5

Pre- Co- Anti -

2 21SPT- Quantum and DE 3 0 0 0 3 3 40 60 100 - 21SMT-125 -

3 21ELT- Basic Electrical DE 3 0 0 0 3 3 40 60 100 - 21SPT-141, 21ECT-155,

4 21CST- Problem Solving CR 0 2 0 0 2 2 40 60 100 - 21SPT-141, 21CST-151,

7 21SPP- Quantum and DE 0 0 2 0 1 2 60 40 100 - 21SPT-141, 21SZT-188

8 21ELP- Basic Electrical DE 0 0 2 0 1 2 60 40 100 - 21SPT-141, 21ECT-155,

9 21CSP- Problem Solving CR 0 0 4 0 2 4 60 40 100 - 21SPT-141, 21CST-151,

12 21UCY- Life Skills and MNG 0 1 0 0 1 1 0 0 0 - 21SPT-141, 21UCY-196

14 21CSV- Coding Boot Camp 2

Bachelor of Engineering (CSE) CS-201 Page 6

Pre- Co- Anti -

11 21UCY- Life Skills and MNG 0 0 2 0 1 2 0 0 0 21UCY- 21ECT- 21UCY-

Bachelor of Engineering (CSE) CS-201 Page 7

S Code Course Name Course L T P S C CH Evaluation Pre- Co-requisite Anti -

Internal External Total (with Course Code)

9 21CSP- Object Oriented CR 0 0 2 0 1 2 60 40 100 21CSP-112 21CST-211,21CST- 21CSP-255

10 21UCT- Introduction to UC 2 0 0 0 2 2 40 60 100 21PCT-154 21CST-211,21CST- 21CSY-BBB

Bachelor of Engineering (CSE) CS-201 Page 8

8 21SMT- Probability and 3 1 0 0 4 4 40 60 100 21SMT-216 21CST- 21SMT-125

13 21UCY- Life Skills and MNG 0 1 0 0 1 1 40 60 100 21UCY-246 21CST- -

Bachelor of Engineering (CSE) CS-201 Page 9

Pre- Co- Anti -

7 21CSR- Project-II 0 0 1 5 3 6 60 40 100 - - -

8 21CST- Project Based 2 0 0 0 2 2 40 60 100 21CST- 21CST- 21CSP-

12 21CSP- Project Based 0 0 4 0 2 4 60 40 100 21CST- 21CST- 21CST-

Bachelor of Engineering (CSE) CS-201 Page 10

Bachelor of Engineering (CSE) CS-201 Page 11

Pre- Co-requisite Anti -

8 21CSR- Project-III PR 0 0 1 5 3 6 60 40 100 - - -

9 21CSP- Mobile CR 0 0 2 0 1 2 60 40 100 21CSP- 21CST- 21CST-

12 21TDY- Soft Skills : MNG 0 0 2 0 1 2 40 60 100 21TDY- 21CST- 21CST-

Bachelor of Engineering (CSE) CS-201 Page 12

Bachelor of Engineering (CSE) CS-201 Page 13

Pre- Co- Anti -

2 40 60 100 21ECP- 21CST- 21CST-

4 40 60 100 21CST- 21CST- 21CST-

6 21CSP- Professional Elective- 60 40 100 - - -

7 21CSI- Industrial Summer 60 40 100 - - -

Bachelor of Engineering (CSE) CS-201 Page 14

S Code Course Name Course L T P S C CH Evaluation Pre- Co- Anti -

Internal External Total (with Course Code)

2 21CST- Professional DE 2 0 2 0 3 4 40 60 100 - - -

3 21**O- University Open OE 3 0 0 0 3 3 40 60 100 - - -

4 21CSR- Project-V PR 0 0 1 5 3 6 60 40 100 - - -

1 21-O4 Open Elective-1 7 3 0 0 0 3 3

2 21-O4 University Open Elective 8 3 0 0 0 3 3