BENNETT

UNIVERSITY
THE TIMES GROTIP

(
Pro m Stru cture & Sv
-,r

Bachelor of Technology (Computer Science and

Engineering)

Duration: 04 Years

Batch:2020-200.4

r.-)

School of Engineering & Applied Sciences

Department of Computer Science Engineering

Lvtz' Fl
afftr.,
Benneti University, Greater Noida I l4-J
(Establishod Uid6r Act 21 of Gott of Uflar Pradesh)
PIot No's 8,9, 10, 11, Tach Zone-ll
Greater Noida-201 310
 Vision of the University:
To be a global leader in education, research, and innovation, empowering higher leaming
ecosystem

Mission of the University:

Empower all the members of the Bennett ecosystem and provide thought leadership,
focus on nation building and prepare our graduates to mov; with the Times.
Cultivate international partnerships and co aborations with academic institutions-
industry, and govemment organizations and provide a rigorous and innovative
education that equips students with the knowredge, skills, and ethical varues required
to excel in their careers.
Foster a culture of lifelong leaming, adaptability, and criticat thinking, ensuring
graduates are prepared to tackle emerging challenges in all academic
fields.
Drive interdisciplinary research and innovation, pushing trre boundaries of human
knowledge, addressing pressing global issues and solvingieal world problems.
Enhance a collaborative environment that encourages faculty and students to engage
) in
-
research, innovation, and entrepreneurship, creating a lasting impact on society.
Promote diversity, equity, and inclusion, ensuring that all individuals, regardless of
background, feel welcomed, respected, and empowered.
Prepare students to become globar citizens, capabre ofaddressing grobar cha[enges
and
contributing to the well-being of communities worldwide.
Provide a globally connected career services networking with graduate employers and
alumni-
Foster a strong sense of ethical responsibility in our graduates, emphasizing the
importance ofethical conduct, sustainability, and social impact in professional praitice.
Commit to ongoing assessment and improvement of our programs and invest in modem
infrastructure and advanced technology to support teaching, research, and innovation
adapting to the evolving needs of students, industries, and society.

Vision of the Department:

lnternational Excellence and National Relevance in teaching, research, and technology
development.

Mission of the Department:

l. strive to continuouslyadapt and improve teaching-reami,g pedagogy and encourage the
useoftechnology and online Iearning.
2. Innovate through Entrepreneurial framework, Researcrr projects,
euarity pubrications and
Consultancy.
3. Transparency, Teamwork and rimely execution wilr be three mantras ofthe department.
Program Educational Objectives (pEO):
PEol: Provide graduates with a sorid foundation in engineering principles to sorve comprex
computer science problems effectively

Lli !i i i it, Gr.i:ltl, rr- Njr-.iCa

(:- i ..r;. ., [ ^.r ,,lesh)
l-ri.,i 5i.'' i.:r, I ;, ; ], iruit 71.tnc-ll
Gie:ri:. i lr'r '
PEO2: Equip graduates with skills in software development, project management, and
communication to design and implement innovative solutions using emerging technologies.

PEO3: Foster a mindset ofcontinuous learning, enabling graduates to adapt to technological

advancements and contribute to the field through research and development activities.

PEO to Mission Statement Mapping:

Mission
Stetements
-

PEO Stfltemen
t MI M2 M3

PEOI I 2 I
PE02 ) 3 J
.,
PE03 3 I

l: Low 2: Medium 3: High

Program Outcomes (POs) and Program Specific Outcomes (PSOs):

POI: Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.

PO2: 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.

PO3: 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-

t:$, )

' :r' ' ilr:-l;

t,1
;i
, , i:'.'-11 ''j:: -'
,r i 1-r
 PO4: Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of data, and
synthesis ofthe infonnation to provide valid conclusions.

POS: Modem tool usage: Create. select, and apply appropriate techniques, resources, and
modem engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding ofthe limitations.

PO6: 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.

PO7: Environment and sustainability: Understand the impact ofthe professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need
for sustainable development.

PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms ofthe engineering practice.

PO9: Individual and teamwork: Function effectively as an individual, and as a member or

leader in diverse teams, and in multidisciplinary settings.

PO10: 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.

POll: 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.

POl2: Life-long leaming: Recognize the need for, and have the preparation and ability to
) engage in independent and life-long leaming in the broadest context oftechnological change.

PSOI: Analyse a complex problem and propose its solution using various computer system
concepts.

PSO2: Apply software development and project management methodologies on various

platforms using emerging technologies to design, develop and implement solutions of
problems.

PSO3: Foster the field of computing by taking a deep dive into its latest trends and going
through new research & development activities.
Mapping of POs/PSOs to PEOs:

ir !1,,
(J:;.i. r"
i,;r i'lciCa
I l., irr.l.sh)
Fiol l:':-.r r: .', r
, .l i Z-r-.rire-ll
C;reai.r I'i(r i, , i '
 PEO Stetements

-
Program
Outcomeg t PEOT PE02 PE03

POI t 2

Po2 J

PO3 2 t

P(N J 1

B(X 3 2
) PrO6 ,,

PO7 2 2

PrOS ,
PO9 3 2

PO10 2

FOlr 2

POl2 2 3

PSIOl 3 2 I

PSO2 2 3 I

PSO3 ) J
)

1: Low 2: Mcdium 33 Eigh

*"{M
Benyfett University, Greater Noida
(Esta8ishsd Urder Act 24 of Gov! o1l Uttar Prads.h)
Plot No's 8, 9, 10, 11 , Tech Zone-ll
GEater Noida-201310
 List of Courses:
Semester: I
S, No. Course Name Course Credit L T P
Code

1 Computational Thinking
ECSE I05L 5 2 I 4
and Programming

z Fundamentals of Electrical
and Electronics EECEIO5L 5 J I )
Engineering

3 New Age Life Skills EHSSI03L 3 3 0 0

4 Engineering Calculus EMATIOIL 4 J I 0

) 5 Electromagnetics EPHYI05I- 3 2 0 2

6 Introduction to
ESEAl03P 2 2 0 0
Engineering

Total Credits 22 t5 3 8

Semester: II
S. No, Course Name Course Credit L T P
Code

I Object Orienled
ECSEI 06I, 5 3 0 4
Programming using Java

2 Digital Design ECSEIOSL 4 3 0 2

3 Discrete Mathematical
ECSE2O9L 4 3 I 0
Structures

4 Linear Algebra and

Ordinary Differential EMATI 02I, 4 I 0
Equations

5 Intro to Biological
EBTYI06L 3 2 0 2
Systems

6 Foundations of
CIEIOIL 3 3 0 0
Enlrepreneurship

7 Mechanics EPHYIOSL 3 2 0 2

Total Credits 26 l9 l0

{lr.k^,
geifi.,tt t I'iier:ily. Gr,.::ter Noica
(E !lillirl , .i 1., r,, ,r, : 1 1 rl li.!1-icch
(r: fJiirr Praiissh)

P lot l.ln'i i;, :r, 'i(1, f i, TloneJ I

Grealc; liic;,i:, .l l1:l l0
 Semester: III
S. No. Course Name Course Credit L T P
Code

1 Information Management
ECSE2I I L 4 3 0 2
Systems

2 Data Structures using C++ ECSE2I5L 5 3 0 4

3 Microprocessors and
ECSE2ITL 4 3 0 2
Computer Architecture
.>
4 Probability and Statistics ECSE23I L 4 0

5 Design Thinking &

ECSE235P 2 0 0 4
Innovation

5 Specialization Core - I 4 -5 0 2
)
Totrl Credits l5 0 l6

Semester: IV
S. No. Course Name Course Credit L T P
Code

I Software Engineering csET20s 4 3 0 2

2 Design and Analysis of

CSET2O6 6 3 I 4
Algorithms

3 Computer Networks csET207 4 3 0 2

4 Ethics for Engineers,

Patents, Coplrights and CSET2OS I 0 0
) IPR

5 Operating Systems CSET2O9 4 3 0 2

6 Specialization Core - II 4 3 0 z

7 Open Elective - I J J 0 0

Total Credits 26 l9 I t2
*For AI Specialization students CSET30I will run ln semester IV and
(Specializatlon Core-II+CSET208) will run in Semester V

R
Be University, Grearter Noida
(Establ ed UiT,l€rAcl 24 cfGi\'l, L:l Uila r Pradesh)
Plot No's B, 0, 10, 'i1, r'eclr Zone-ll
Greater Noida-20'1 :11 0
 Semester: V
S. No. Course Name Course Credit L T P
Code

I Artifi cial Intelligence and

CSET3OI 5 J 0 4
Machine Leaming

2 Automata Theory and

CSET302 4 J I 0
Compuhbility

3 High Performance
Computing
CSET305 4 ) 0 2

4 Seminar on Special Topics

CSET303 0 I 0
in Emerging Areas

5 Competitive Programming csET304 2 0 0 4

) 6 Specialization Elective - [ 3 2 0 2

7 ElectiYe - ll 3 2 0 7

Total Credits aa l3 t4

Semester: VI
S. No. Course Name Course Credit L T P
Code

1 Undergraduate Research in CSET3O6

Computer Science I 0 0
Engineering

2 Environment and csET108

3 3 0 0
.) Sustainability

? HSS - Elective 3 3 0 0

4 Specialization Elective - 3 2 0 2
III

5 Elective - IV 3 2 0 2

6 Open Elective - II 3 3 0 0

7 Opon Elective-lll 3 3 0 0

Total Credits t9 l6 I 4

I Summ€r Intemship CSET399

A

rat
ne tt Universit y, Grea ter Noida
tablished UoderAct2,i oiGov,l, ot
Ultar Pradesh)
lot No' s 8, 9, 10, 11. Te ch Zone-il
G reater lloid:1,;, I 1 31 0
 Semester: VII
S. No. Course Name Course Credit L T P
Code

I Capston€ Project CSET4OI :r 0 0 l0

2 Specialization Elective - J 2 0 2
VI

3 Open Elective - IV 3 3 0 0

4 Elective - V 3 2 0 2

Total Credits l4 7 0 l4

) OR

1 Professional Practical l4 U U 28
CSET498
Intemship

Semester: VIII
S. No. Course Nrme Course Crcdit L T P
Code

1 Industrial Project/R&D csET499 l2 0 0 24

Projecvstart-up Project

Total Credits t2 0 0 24

)
Specialization Core I and II

S. No Course Name Course Credit L T P

Code

I Statistical Machine
ECSE219L
4 ) 0 2
Leaming

2 Blockchain Foundations ECSE221L 4 3 0 2

3 Linux and Shell 4 3 0 2

ECSE223L
Programming

R
B enn UniversitY, Greater Noida
(Establis ed Under Act 24 of oovt. ofUtlar Pradesh)
Plot N o's 8, 9, 1 0, 11 , T. ech Zorre-ll
Greater Noida-?013'i0
 4 Data Analysis using 4 3 0 2
ECSE225L
Python

Graphics and Visual 4 3 0 2

5 ECSE227t
Computing

software Developers and 4 3 0 2

6
Operations: A DevOPs EC5E237L
Perspective

Full Stack DeveloPment ECSE239L 4 3 0 )

7

4 3 0 7
8 cloud computing ECSE304L

Human Computer 4 3 0 2
9
ECsE233L
lnterfuce

10 cloud Computing CSET224 4 3 0 )

) 11 lntelligent Model DesiSn 4 3 0 2
csET225
usinE Al

4 3 0 2
t2 Blockchain Engineering csET226

13 System and Network 4 3 0 2

csEI227
Security

4 0 4
t4 Data Mining and
CSET228
Predictive Modelling

Game Engine and 4 0 2

15
csET229
Arch itectu re

4 3 0 2
t6 Devops Practices and
csET230
Principles

17 ProgramminB 4 , 0 2
) Methodologies for CSET231

Backend DeveloPment

t8 Design of Cloud 4 3 0 z
c5ET232
Architectural Solutions

Elective-I, III' V
Specialization Electives: Artificial Intelllgence

R
Ben University, Greater Noida
(Established Undsr Acl 24 of Govt of Uttar Prd6h)
Plot No's 8, 9, 10, 11, Te ch Zone-ll
Greater Noida-2O1310
 Cou rse
S. No. Course Name Credit L T P
Code

Advanced Computer
1 Vision and Video CSET340 3 2 0 z
Analytics

2 Cognitive Modelling csET341 2 0 2

Probability and Random

3 CSET342 J 2 0 2
Processes

4 AI in Healthcare CSET343 t 2 0 2

lmage and Video

5 CSET344 3 2 0 2
Processing

Information Rerieval and

6 CSET345 3 2 0 z
Search Engine
)
Natufal Language
7
Processing
csET345 ) 2 0 2

8 Social Network Analysis CSET347 t 2 0 2

9 Reinforcement Leaming CSET348 3 2 0 2

Special Topics in Artificial .,

10 csET349 3 2 0
Intelligence

Specialization Electives: Blockchain

S. No. Course Name Course Credit L T P

) Code

1 Blockchain Technologies:
CSET350
, 2 0 2
Platforms & Applications

2 Smart Con$acts and 3 2 0 2

CSET35I
Solidity Programming

3 Digial Currencies and 3 2 0 2

CSET352
Blockchain

4 Blockchain Policy: Legal, 3 2 0 z

Social and Economic CSET353
Impact

R Tar
ter Noida
Utla r Frradesh)
oh Zone-it
 5 Cyber Secudty with 3 2 0 2
CSET354
Blockchain

6 Web Development for 3 2 0 2

CSET355
Blockchain Applications

7 Security and Privacy for 3 2 0 2

CSET356
Big Data Analytics

I Modern Cryptography CSET357 3 2 0 2

I Cloud In ftastructure and 3 2 0 2

CSET358
Services

t0 Sp€cial Topics in J 2 0 2
CSET359
Blockchain

()
Specialization Electives: Cyber Security
Course
S. No. Course Name Crcdtt L T P
Code

Cyber Security with ) z

I CSET354 2 0
Blockchain

Malware Analysis for 3 2 0 2

2 CSET360
Mobile Devices

3 Modem Cryptography CSET357 3 2 0 2

Security and Privacy for 2 0 z

4 CSET356 3
Big Data Analltics

5 Device Level IoT Security CSET36I 3 ? 0 2

Vulnerability Analysis in 2
) 6
Network Protoools
CSET362 J 2 0

Penetration Testing,
7 Auditing and Ethical CSET363 3 2 0 2
Hacking

8 Forensics and Cyber Law CSET364 3 2 0 2

9 Web Securiry CSET365 3 2 0 2

Special Topics in 2 0 2
l0 lnformation Security
csET366 3

l1
Cloud Security and
CSET462 3 2 0 )
Compliances
.A

Regist
, Greater Noids
f Go!,t, of Uflar pradeshl
11 , Tech Zone-it
310
 Specialization Electives: Data Science
S. No. Course Name Course Credit L T P
Code

I Digital Ma*eting and 3 2 0 2

CSET367
Trend Analysis

2 Structural Equation 0 2
csET368
Modelling

3 Time Series Analysis CSET369 J 2 0 2

4 Data Visualization and J 2 0 2

CSET3TO
Dashboards

) 5 Security and hivacy for

csET356
3 2 0 1
Big Dara Analytics

6 Social Network Analysis CSET347 3 0 2

7 Big Data Analytics and 3 a 0 2

CSET3TI
Business Intelligence

8 Advanced Datsba$e 3 ) 0 2
CSET372
Management Syst€m

.,
9 Satellil€ Data Analysis csET373 3 2 0

10 Special Topics in Data J 0 2

CSET374
Science

t1 Emerging Topics in Data 3 2 0 2

CSET4I4
Science

)
Specialization Electives: Gaming and Virtual Reatity

Course
S. No. Course Name Credit L T P
Code

Augmented Reality and AR

I csET425 , 1 0 2
Core

2 VR Gaming csET375 3 2 0 2

ist
n University, Grea ter Noida
hed Under Ac,t 24 of Govl of Utlar Pradesh)
ot No's 8, 9, 10, 11 , Te ch Zone-ll
Greater Noida-201 310
 VR and 360 Mdeo 2
3 c5ET424 3 2 0
Production

3D Models for Augmented

4 csET375 3 2 0 ?
and Virtual Reality

Building Social VR with 3D 2

5 csET426 2 0
characters

specialTopics in AR and 2
6 csET428 3 2 0
VR

7 AuBmented Reality c5ET337 3 2 0 2

Geme Mechanics and

I csET377 3 2 0 2
Game Physics

Game Programming with 2

9 csET378 3 2 0
,) HTM t5

t0 Alfor Games CSET379 J 2 0 2

Animation and Rendering

l1 csET38o
Techniques

Specialization Electives: DevOPs

S. No, Courso Nrme Course Credit L T P
Code

1 Build and Release csET448 3 2 0 2

Management in Devops

2 Cloud Services Development 2 0 2

CSET449 3
and Operations
)
3 Source and Version Control in 2 0 2
CSET45O 3
DevOps

4 Continuous lntegmtion and 2 0 2

CSET445 3
Deployment in Devops

5 Software CraftsmanshiP in 2 0 2
CSET45I 3
DevOps

5 Software Containerization in 2 0
CSET452 3
DeYOps

*M*,
Ber/rlfit University, Greater Noida
(5s-tabli6hed UnderAct24 ot covt, of Uflar pradesh)
PIot No's 8, 9, 10, 1t, Tech Zone-il
Greater Noida-2013'10
 ? System Provisioning and
Configuration Management in CSET453 z 0 2

DevOps

CSET454 3 2 0 2
8 Test Automation in DevOPs

9 Cloud lnftastructure and CSET358 3 2 0 2

Services

CSET456 3 0 2
10 Special Topics in DevOPs

Specialization Electives: Full Stack

S. No, Coursc Nrme Course Crodit L T P

Code
)
1 Front-End W€b Ul
Frameworks and Tools: CSET457 z 0 2
Bootstrap

2 Front-End Wcb UI
Frameworks and Tools: R€act CSET458 0 4
Native

3 Server-Side Development
CSET446 3 2 0 2
Frameworks: ExPress and
Spring

4 Web Development for 2 0 2

CSET355 3
Blockchain ApPlications

5 Cloud lnfi'astructure and CSET358 3 ? 0 2

Services
)
6 AdYanced Database 2 0 2
CSET372
Management System

7 Front-End Ul Frameworks and 0 4

CSET459 3
Tools: Flutter and Django

CSET46O 3 2 0 z
8 Special Topics in Full Stack

Specialization Electivos: Cloud Computing

*".[yJl..
g.find{ University, Greater Noida
ml'*#u:'#a:.'i5g:ri#:']'
Greater Noida-201310
 S. No. Course Name Course Credit L T P
Code

1 Cloud Services Development

CSET449 2 0 2
and Operations

2 Cloud System Administration

CSET46I 3 2 0 2
and Operations

3 Cloud Security and

CSET462 J 2 0 2
Compliances

4 AWS Cloud Support Associate CSET463 2 0 2

5 Developing Solutions for

CSET464 3 2 0 2
Microsoft Azure

6 Google Associate Cloud

CSET465 2 0 2
Engineer
)
7 Software Containerization in
CSET452 3 2 0 2
DevOps

8 Cloud Infr astructure and

CSET358 2 0 2
Services

9 Special Topics in Cloud

CSET466 3 2 0 2
Computing

General Electives (Elective lI, [V, VI)

S. No. Course Name Course Credit L T P

Code

I lmage and Video Processing csET344 3 2 0 2

)
2 lnformation Retrieval csET320 3 2 0 ?

3 User Centered Design csET321 J 2 0 2

4 secure coding csET322 3 7 0 2

5 Compiler Construction csET323 3 2 0 2

6 Software Project Management csET324 3 2 0 2

7 Digital Communication csET325 J 2 0 2

8 Soft Computing csET326 2 0 2

ful*.,
ge{y'ett ttn ivcrsity, creatnr f,icida
(E3ir:l,sh.Ij Und.rAct 2.1 c,.^x!i cl L,: rrr n,;.,. ,h)
Plot No's Ii, c, 10, 11 , lu;lr Zr:ne-il
Greater t'JoiJa-20 i 3.i 0
 9 Embedded Systems csET327 3 2 0 2

10 Distributed Computing c5ET328 3 2 0 2

11 Agile Software Development csET455 3 2 0 2

L2 Virtual Reality: lnterface,

csEf427 3 2 0 2
Application and Design

13 Engineering Optimization CSET329 2 0 2

t4 Wireless Networks csET330 3 2 0 2

15 Cloud lnfrastructure and

CSET358 J 2 0 2
Services

16 Combinatorics csET331 2 0 2

t7 Mobile and Networked

) Embedded Systems
CSET332 3 2 0 2

18 Problem Solving using C csET333 2 0 2

19 Drone Applications,
csET468 3 2 0 2
Components and Assembly

20 Programming using C++ csET334 2 0 2

2l Deep Learning csET335 2 0 2

22 Bioinformatics and
csET336 3 2 0 2
Computational Genomics

2t Game Mechanics and Game

csEr377 3 2 0 2
Physics

24 Computational Geometry csET338 2 0 2

) 25 Advances in Al c5ET339 2 0 2

26 Network Drivers and Protocols csET429 3 2 0

27 Digital SiBnal Processing CSET43O 2 0 2

2A Special Topics in Computer

CSET431 J 2 0 2
Science

29 Advanced Microprocessor csET432 3 2 0 2

30 Satellite Data Analysis csET373 3 2 0 2

31 Reinforcement Learning csET348 3 2 0 2

Re
Benn Unlversity, Greater Noi da
(Esta UnC eiA.ri 2,1t,i r:)uvt, oi l-lilirr pra.i. sh)
Plot o's B, 9, 1'1, 1J , 'icch zon e-ll
Greater Noi cia-20 i 31 0
 ,2 loT: Security and Attacks CSET42O 3 2 0 2

33 Game Programming wlth ,)

0 2
csET378 3
HTM L5

34 Al for Games csET379 3 2 0 2

35 cu rrent TechnoloBy Project c5ET319 J 2 0 2

Honours-I, II, I[I, fV' V' VI

S. No. Course Name Courge Credit L T P

Code

Semester V

L Hons-I J 2 0 2
)
HonsJI 2 0 2

2 Semester VI

3 Hons-IIl 3 2 0 2

Hons-IV J 2 0 2

4 Hons-IV 3 2 0 2

5 Hons-V 3 2 0 z

Hons-Yl 3 2 0 2

Totrl Credits l8 t2 0 l2

) Minor in AI 0, IIn tIL nr)

S, No. Course Name Course Credlt L T P

Code

Semester III

I Data Structure Fundamentals ECSE281M 4 4 0 0

Semester lV

2 lntroduction to Algorithm 4 4 0 0
c5ET292
Design and Development

R er
Be ett Universlty, Greater Noida
blished UnderAct 24 of Govt, ol Utlar Pradesh)
Plot No's 8, 9, 10, 11 , Te ch Zone-ll
Greater Noida-201310
 Semester V

3 Artificial tntelligence CSET39I 4 4 0 0

Semester VI

4 Applied Al CSET392 4 4 0 0

Total Credits t6 l6 0 0

CS Open Electives-I, II, III, IV

S. No. Course Name Course Credit L T P

Code

I Applications ofAI CSET3S I 3 J 0 0

2 Web Technologies CSET382 3 3 0 0

3 Semantic Technology CSET383 ) J 0 0

4 lT Support Technologies CSET384 t 3 0 0

5 Software Engineering CSET385 3 0 0

6 Programming Languages CSET386 3 0 0

7 Artificial Intelligence for

Creative Expression
CSET387 3 ) 0 0

8 AI and Public Policy CSET388 , 0 0

I Linux Apache MySQL PHP

CSET389 3 0 0
(LAMP)

10 Data Structures and

CSET390 3 0 0
) Algorithms

1l Software Testing CSET4SI J 0 0

t2 Computing Start-ups CSET482 3 0 0

13 Career Skills for lT Companies CSET483 3 3 0 0

t4 Cyber security: Impact on

CSET484 J 0 0
Govts, Policies and Economics

15 AI and Society CSET485 3 3 0 0

L6 Special Topics in Computer

CSET486 3 0 0
Engineering

R r
Be ett Universi ty, Greater Noida
(Esl ished
l.l nder/",.i 24 ofGovi. olt tlar pra desh)
Plot lrlo's B, :t, 10,11 :,-'lr Zon:-ll
Greater Noida-2o1.i 10
 t7 Search Engine Optimiz:tion CSET489 3 ., 0 0

18 Growth Hacking csET488 3 3 0 0

19 Digital Marketing csET487 3 3 0 0

20 Advancad Skill Enhancement CSET492 3 3 0 0

2t Advanced Industry
CSET49I 3 3 0 0
Certification

+The course CSET49I will be considered oquivalent to two open eloctive courses

HSS Electives
_)
S. No. Course Name Course Credlt L T P
Code

I Financial Accounting and

CSET3OT 3 3 0 0
Manag€ment

, Communication Skills for

CSET3O8 3 3 0 0
Global Professionals

3 Organizational Behaviour csET309 3 3 0 0

4 Marketing Strategies and

CSET3 IO 3 5 0 0
Planning

s Micro and Macro Economics csET31 I 3 0 0

tln Special Circumstances Opon Electives can be run as General Electives and Vioe
Versa. Also, Specialization Electivss can be run as Goneral Elestives and Vice Ve$a
)

aw,",
Bepfiett University, Greater Noida
(Bl4[6h€d UrderAd 24 of Govl, ol t ttar PradsEh]
Plot No's 8, 9, 10, 't1. Tech Zone-ll
Greater Noida-2o13'10
)
Semester I

Reg rar
Be University, Greater Noida
(Establlshed Und.tAcl24 ol GovL oi U[ar Prad6sh)
Plot No's 8, 9, 10, 11 , Tech Zone-ll
Greater Noida-201310
 Name of Program Bachelor of Technology (Computer ScieDce and En gineering)
ECSEIOSL Computalional Thinkinq & Programming L T P C
Owning School/Department Department of Computer Science E ngineering 2 4 5
Pre-req uisites/Exposure

Course Outcomes (COsl

On completion ofthis course, the students will be able to

COI: lmplement a given algorithm in python by using standard programming constructs such as,
repetitions, functions, modules, aggregated data (anays, Iists, etc.), etc.
co2: Explain the output of a given Python program and identif and correct errors in a given python
program.
co3: write simple programs using the features of object-oriented programming language such as,
encapsulation, polymorphism, inheritance, etc.fv

CO-PO/PSO Mappins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POr POI PSO PSO2 PS03
6 7 8 9 0 I 2 I
col 3 2 3 2 , 3
c02 2 3 3 3 2
c03 3 3 3 2 3 , 2

l=weakly related 2: moderately related 3:strongty related

Course Contents:

Module I: g lecture hours

overview ofcourse, lntroduction: Introduction to computer Science; computer Algorithms; computer
Hardware;.computer software; The.process ofcomputational problem solving; lnioduction to python
qrogram-ming language Data and Expressions: Literals; Variables and ldentifiers; Operators;
Expressions- and Data Types, Logical operator; Boolean operator; Boolean Expressions;'controi
structures; selection control, Iterative control Lists: List structures; Lists in pyhon, lterating over
Lists in Python.

Module lI: T lecture hours

Functions: Program rout€s; calling Value Retuming Functions; calling Non- value Retuming
Functions Parameter Passing; Keyword and Default Arguments in python; variable Scope; Modulai
design Modules; Top-Down Design Python Modules; File Handling Operation in file, ieading and
Writing Text Files, Sequences, Strings.

Module lll: T lectures hours

Files. Exceptions Data collections Applying Lists, List operations, Dictionary Type in
rython set Data
Type in Plthon; Non-sequential collections. Dictionary operations tntroaucti'on to otject oriented
Programm ing. Class. Objecr.

Module lV: 6 l€ctures hours

Encapsulation, Data abstraction, Inheritance, polymorphism, Graphics programming: Craphics
Using Graphical Objects, Interactive Graphics, Displaying Imagei, Ceneraling Colors,
lrogr-a.mmtlg,
Graphics Objects, Entry Objects, Test Case: Numpy, scipy; Test Case: panda, Matplotlib.

Studio Work/Laboratorv Experiments:

,gdl,",

Eit[i,'.;f f;if$,#;*]i
 The lab component of this courso is designed to introduce online-coding tools such as

Microsoft Azure, Colab to the students and provide hands-on experience with the concepts
taught in the lectures.

rt-@r
1. Dieftach C., lntrodaction to Computer Science lJsing PYTHON: A Cohtputational
Problem-solving Foclt: (1st ed.), Wiley,2015. ISBN 978-0470555156.

2. Kanetkar Yashwant, Let us Python (lst ed.), BPB Publishen,20l9, ISBN 978-9388511568.

Reference Books :
l. Downey Allen B, Think Python: How to Think Like a Computer Scientist (2nd ed.), O'Reilly' 2016'
tsBN 978-9352134755.

2. Brown Martin C., Python: TheCo plete Reference (4th ed.), McGraw-Hill, 2018. ISBN 978'
0072 1271 88.

Ass$sment Scheme:
)
Componcnts Intcrnol AssessmGnt Mid Term Exam End Exam Tot l

Welghtage (o/o) 35o/o 3V/o 35o/o 10tr/o

s r
eil University, Greater Noida
ished Under Acl 24 of Govt of Ullar Prad€sh)
lot No's 8, 9, 10, 11 , Te ch Zonc.ll
Greater Noida-201310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
EECEIOSL Fundamental of Electrical & Electronics L T P C
Engineering
Owning School./Department Department of Computer Science Engineering 3 2 5
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI : Analyse basic electrical circuits using f'undamental laws of circuit theory.
CO2: Apply network theorems to simplily and analyse basic electrical circuits.
CO3: Investigate the gain and cut-offfrequency ofthe passive filter circuit.
CO4: Deyelop an insight into the physics of a diode and its application in electronics circuits.
CO5: Construcl the knowledge of solid-state devices such as BJTs and MOSFET.
CO6: Convert numbers into different number systems, verify digital gates and simpliry Boolean
expressions.

CO-PO/PSO Mapoins
)
PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POt PSO PS02 PS03
I 6 7 8 9 0 I 2 I
col 2 3 2 I 3
cc)2 t 2 3 3
c03 2 I 3 3
c04 3 2 I 2 2
,,
co5 3 2 I 3
c06 I a 3 , 3

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: 20 lecture hours

Basic Circuit Theory: Charge, current, voltage, electric field, conductance, resistance, Ohm's law;
current source, voltage source, dc, ac, periodic signal concept, examples of different periodic signals,
their average. RMS value. resistors in series and parallel, voltage and currentdivision. Kirchoff s current
law (KCL) and Kirchhoff s voltage law (KVL), Nodal analysis and Mesh analysis. Network theorems:
Thevenin's theorem, Norton's theorem, Maximum power transfer theorem, and Super?osition thgorem,
Wheatstone bridge. Introduction to the capacitor (C), introduction to phasor diagram, series and parallel
combination of capacitors, Impedance and ftequency dependency, lntroduction to the inductor (L),
intoduction to phasor diagram, series and parallel combination of inductors, Impedance and frequency
dependency, units of L, C measurements, series and parallel RLC circuits, resonance phenomenon. RL
and RC filter circuits (low pass, high pass), lransfer function.

Module lI: l0lecture hours

The need ofthe transformer, Mutual inductance, self-inductance, coefficient of coupling, Basics of
voltage and current transformers, the equivalent circuit of the transformer, single- phase motors, dc
motors, stepper motors, induction motors and their applications.

R a(
Ben tt UniversitY, Greater Noida
Uttar Ptadesh)
(Es treri U nd€rAct 24 cl Go!'t, of
11, Te ch Zone-ll
PI ot No's B, 9, 1'J,
Greater l'J oida-201310
Module III: 16 lectures hours
Diodes and its applications, Semiconductor Materials: Classification ofmaterials based on energy-band
theory, crystal itiucture, elemental and compound semiconductors, electrons and holes, intrinsic and
extrinsic iemiconductors, doping for n and p-type semiconductors; Diode circuits: PN Junction diode
and its applications: Half wave, centre tapped full-wave rectifiel circuit, bridge rectifier circuit, the
efficiency of rectifier circuits, ripple factor, rectifiers with filter circuits. Zener diode, voltage
regulation. working of LED, working principle of a photovoltaic cell. Thlee-terminal device
ch-aracteristics (BJT and MOSFET): Introduction to bipolar junction transistor (BJT), working of BJT
as a switch, Structure of a MOSFET, working of a MOSFET, curent-voltage characteristics of a
MOSFET, MOSFET as a switch.

Module lv: 8l€ctures hours

Number systems and digital logic: Number system, decimal, hexadecimal and binary numbers Digital
gates: O[, AND, NOT, NOR, EX-OR, Ex-NOR. Boolean algebra, Simplification of Boolean
expressions, the realization of Boolean expressions using logic gates'

Studio Wo rk/Laboratorv Exo erim€nts:

Simulation and Hardware Realization of the following Experiments will be conducted

bystudents:

I. Intoduction to CRO, Signal generator, multimeter, breadboard and DC voltage source

2. Ohm's law, Kirchofls current law and voltage law
3. Thevenin's theorcm, Norton's theorem
4. Low pass and high pass Filters (using Resistor and Capacitor).
5. Current-Voltage characteristics ofa PN Junction Diode (Ge and Si)
6. Half Rectifier with Filter
7. Full-wave Rectifier
8. Clipper circuits

9. Clamper circuits

10. Design of voltage regulator using Zener diode (load regulation and line regulation)

Note: lt can be beneficial for a student to perform the simulation before commencing
thehardware.

Text Books :
1 . Boylestad Robert L., lntro(luctory Circuit Anolysis, Peqrson Education'

2. Boylestad Robert L. and Loais n(tshelslE, Electronic Devices andCircuit Theory,

Pearson Educalion

Reference Books :
l. Bobrow Leonard S, Foundations of Electricql Engineering Oxford Higher Education'
2. Neamen Donald, Microelectronics Circuit Andlysis ond Design, Tata McGraw Hill'

3. Bell David A., Electronic lnstrumenlation qnd Measurements, Oxford Higher Education

e ar
Be et i University, Greetcr Noida
(i-qlabiiiJrl"j lir.l-.r Ai.i 24 ( i GJVI .,1 Uiiar Pra.jesh)
-l-cch
Plot No l'- ti, 3, 10, 11, Zone-ll
Greater i.ioid.r-20 i 3i 0
 AssessBent Schcme:

Components Internal Asse$m€nt Mld Term Exam End Exam Total

Weightage (%) 35o/o 3Wo 35% I00PA

r
UniversitY, Greater Noida
ol covt d Utt8r Prdssh)
Tech Zone-l
1 1 , I

G€ater Noida-2o1310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
EHSSI03L New Age Life Skills L T P C
Owning SchooUDepartment Departm€nt of Computer Science Engineering 3 0 0 3

Pre-req u isites/Exposure

Course Outcomes (COs)

On completion ofthis course. the students \ ill be able to
COI: By the end ofthis course, students should be able to express their role in improving their quality
of life.
CO2: By the end ofthis course, students should be able to understand human psychology and its
applications to improve human achievements and happiness to substantial extent.
CO3: By the end ofthis course, students should be able to reflecl on the aspects of leadership,
motivalion. and stress management.
CO4 : By the end ofthis course, students should be able to appreciate the nature ofpositive and
) proactive thinking and asseniveness.
CO5: By the end ofthis course, students should be able to apply concepts, tools and frameworks of
emotional intelligence and stress management

CO-PO/PSO Maopinq

PO PO2 PO3 Po'4 PO5 PO PO PO PO POI POr POI PSO PS02 PSO3
6 7 8 I 0 I 2 I
col 2 3 3 3 I I I
coz 3 2 3 3 3 3 3 I
cC)3 3 2 3 3 3 3 I
cC)4 3 2 3 3 3 3 3 I
cos 3 2 3 3 3 3 3 I

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: 4lectur€ hours

Introduction to Life Skills, the critical role of management skills, Developing Self-awareness: Key
dimensions, enigma of self-awareness, Understanding and Appreciating Individual differences, Self-
esleem, Case studies and Practice Sessions.

Module ll: 4lecture hours

Introduction to communicating and thinking, Communication, Thinking and reasoning, Proactive
thinking, Positive thinking, Assertiveness, Emotional Intelligence, Values and Elhics, Case studies and
Practice Sessions.

Module III: 4lectures hours

Setting goals, Goal Setting: Setting SMART Goals, what are the main components, Managing time and
prioritizing, Time Management matrix, Balancing Time and Goal, case studies, Practice Sessions.

/l ,
'lX4
.////
Rr:oisifl r
Pein(-tt Universilv. Gre?ter Noida
{Est.r-: 5.red Ull, " Acl 24;f Cc'n, oi Urtir PIsdesh)
irtot No's B, s, 1 0, 11 , Tech Zone-ll
Greater Noida-20'l 310
 Module lV: 4lectures hours
Diagnostic Suryeys for Creative Problem Solving, Problem Solving, Creativity and lnnovation, Steps
in Analy,tical Problem Solving, Multiple Approaches to creativity, Conceptual Blocks, Case studies and
Practice Sessions.

Module V: 4lectures hours

Attitudes, what are the main components? Behavior and attitude, Major job attitude, Job satisfaction,
Satisfied and dissatisfied employees on the workplace, Personality, The Myers-Briggs Type lndicator,
The Big Fiye Personality Model, other personality traits relevant to Life skills, Case studies and Practice
Sessions.

Module VI: slectures hours

Diagnostic Surveys for Building Effective Teams, Team Development Behaviour, Developing
Credibility, Leading Teams, Exercises in Building Effective Teams, Team Development Behaviour,
Developing Teams and Work, Leading Teams, Team Membership' Developing Credibility, Exercises
in Building Effective Teams, Case studies and Practice Sessions.

Module VII: 4lectures hours

Making Oral and Written Presentations, Introduction to Technical Communication, Process of
communication, Essential Elements of Effective Presentations, speaking as a Leader' presenting
yourself professionally, developing your Interpersonal Skills, Argument Building, develop your
facilitation skills, Making Formal Presentations, Creative Writing for social media, developing self-
brand. Case studies and Practice Sessions.

Module Vlll: 4lectures hours

Diagnostic Survey for Gaining Power and Influence, Building a Strong Power Base and Using Influence
wisely, Strategies for gaining organizational power, Transforming power into influence, activities for
gaining power and influence, Diagnostic Survey for Motivating Others, Increasing Motivation and
Performance, Diagnosing Work Performance Problems, Enhancing Individual abilities, Fostering a
Motivating Work Environment, Elements of an Effective Motivation Program, Activities for
Motivating Others, Case Studies and Practice Sessions.

Module IX: 4 lectures hours

Diagnostic Survey for Managing Conflict, tnterpersonal Conflict Management, Diagnosing the Type
of Interpersonal Conflict, Selecting the Appropriate Conflict Managemenl Approach, Resolving
Interperconal Conftontations Using the Collaborative Approach, Conflict Management Strategies,
activities for Improving Managing Conflict Skills, Case Studies and Practice Sessions.

) Modute X: 5 lectures hours

Diagnostic Survey for Empowering and Delegating, Management Dilemma lnvolving Empowerment,
The Meaning of Empowerment, Dimensions of Empowerment, Self-Efficacy, Self-Determination,
Personal Consequence, How to Develop Empowerment, providing Support, providing lnformation,
Providing Resources, Inhibitors to Empowerment, Delegating Work, Advantages of Empowered
Delegation, Review of Delegation Principles, Case Studies and Practice Sessions.

Studio Work/Labo torv Exoeriments:

1. Group Presentations
2. Group Activities
3. Role Plays
4. Croup Decision Making activity
5. Group Treasure Hunt
6. Creating Team profiles
7. Creating Self Profiles

:ir
Be etl Lliri';ct ;iiir, Grs:lter Noida
(F :i rll :lin.l rJi/ I.:i Aii :'1 .l ilc,ri, l:ri U(,rr pr.J:sh
Plr:t I'lo's 8, 9, '1..1, -il , Tech Zon3-ll
Gieaiei- Ll,:. le: llii.l 31 0
 Text Bookr :
l. Whetten DafidA. and Kim S. Cameron, Developing Manageuent Skills (8th ed)' Pearsoa 2017
rsBN 9789i32584686, ISBN 9332584664.

2. l{adkm Alka, Life Skilk for Suecess (lst ed.), Sage Publicdtion$, 2016. ISBN 9789351507314,
tsBN 9351507319.

A$essment Scheme

Component3 Internal Assessment Mld Term Exam End Exsm Tottl

Wcightage (Yo) 35o/o 3ff/o 35o/o ll0c/o

Reg I
Ben Univers ity, Greater Noida
UnderAct 24 of Govt of Uttar Pradesh)
Plot No's 8, 9, 10, 11, Te ch Zone-ll
Greater Noida-2013'10
 Name of Program Bachelor ofTechnology (Computer Science and En gineering)
EMATI Ol L Engineering Calculas I, T P C
Owning SchooUDepartment Department of Com puter Science Engineering 3 0 4
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI: Convergence and divergence ofsequence and series.

CO2: Continuity, differentiability and integrability for functions of one variable and multi variables
Approximating the smooth function with a polynomial
CO3: Computing the area and volume of functions up to three variables.
CO4: Solving the problems using computational software packages.

co- MaDDins

PO Po2 P03 Pc,4 PO5 PO PO PO PO POt POI POI PSO PS02 PSO3
) I 6 7 8 9 0 I 2 I
col 2 3 2 I 3
.,
co2 t 2 3 3
co3 , 2 3 3
cC)4 3 2 I ) 2

l:weakly related 2: moderately related 3:strongly related

Course ontents:

Module l: 12 Iecture hours

The Real Number System, Archimedean Property, Convergence ofa Sequence, Monotone Sequences,
cauchy criterion, Bolzano-weierstrass Theorem, Limit inferior and Limit superior. Infinite series,
Convergence Tests and Altemating series. Limit, Continuity, Existence of Maxima, Intermediate Value
Propeny.

Module Il: l2lecture hours

Differentiability, Rolle's Theorem. Mean Value Theorem. Convexity, Concavity. L,Hospital Rule,
) Fixed Point lteration Melhod. Taylor's Theorem, Taylor Series, Power Series. Riemann Integration,
Fundamental Theorems of Calculus, Riemann Sum. Improper lntegrals, Beta-Gamma Functions,
Differentiation under integration.

Module lll: S lectures hours

Area between tv,/o curves; Polar Coordinates, Volumes by slicing, Washer and Shell Methods, Length
of a plane curve, Areas of Surfaces of Revolution. Review of vectors. Calculus of Vector Valued
Functions, Functions of Several Variables: limit, Conlinuity and Differentiability, Chain Rule,
Directional Dedvative, Gradient.

Module lV: l0 lectures hours

Mixed Derivative Theorem, MVT, Extended MVT, Taylor's Theorem in Multiple Variables, Hessian,
Maxima, Minima, Second Derivative Test, Lagrange Multiplier Method. Double Integrals, Change of
Variable in a Double and Triple lntegrals, Area of a Parametric Surface and surface integral. Surface
Area, Surface Integrals, Line Integrals Green's Theorem and Applications.

T€xt ks:

*.wz
L'iflffi i{,:i":*hj,f$rf#}i
 l. lleir Mqurice D. and Joel Hass, Thomas' Catcllus (l4th ed..1, pearson Education Indiq, 20l g
tsBN 978-935306041 t, |SBN 978935306041 I .
2. Ross K. A., Elenentory Analysis: The Theory ofCalcutus (2nd ed-), Springer, 2013. ISBN 97g-
1493901289, ISBN 978- t 161462705.

Referenc€ Books :
l. Ghorpade S.R and B. Y. Limrye, A Course in Calculus and Real Analysis, Springer-Verlag New
York, 2 006. ISBN 97 8-0387 305 30 l, IS BN 0 3 87 3 0 i 300.

2. Stey'drt James, Calculas (7th ed.), Brool.s Cole Cengage Learning 2012. ISBN 9\g013g497glZ,
ISBN 0538497815.

3 Bartle Robert C. and Donald R. Sherbert, Introduction to Real Analysis (4th ed), lfiley, 2014
lsBN 978-81265s 181 t, ISBN 812655 t 8 tX.

4. Kreyszig Erwin, Advanced Engineering Mathematics (t 1th ed.), Utilq,, 20t 0. ISBN g7g-
81265s4232, ISBN 81265542i 1.

Assessme t Scheme

)
Components Internal Assessment Mid Term Oxam End Exam Total

Wetghtage (%) 35% 30o/o 35Vo l0oo/o

r
Be n ett Uni
(Establis hed versi ty, Grea
U nderAct ter Noida
PI ot No, SB,9 24 of Go!,1, of UIIaTP radesh)
G reater Ncid 10, 11, Te chzone-ll
a-201 310
 Name of Program Bachelor of Technology (Computer Science and Engineerin e)
EPHYIO5L Electromagretics L T P c
Owning SchooUDepartment Department of Computer Science Engineering 2 0 2 3
Pre-req lrisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: Calculate electroslatic fields and potentials, produced by regular shaped charged bodies.
CO2: To understand magnetic fields produced by variously shaped current carrying bodies.
co3: To appreciate the interconnectedness ofelectric and magnetic phenomena and to realize lhe
signifi cance of Maxwell's equations.
CO4: To understand how these equations lead to electromagnetic waves

co-Po/Ps O Maooins

PO Po2 PO3 Pc)4 PO5 PO PO PO PO POr POI POI PSO PSO2 PSO3
) 6 7 8 9 0 I 2 I
cor 2 ) I , 3
cc)2 2 2 2 2 3
co3 3 1 2 3 3
co4 3 3 3 3 3 3

l:weakly related 2: moderately relaled 3:strongly related

Course Contents:

Module I: 5 lecture hours

Vector operators and coordinate systems

Module ll: g lecture hours

Gauss'law and its applications; Electrostatic potential; Electric fields in matter; Electric polarization.
Bound charges, Displacement vector; Electric permittivity and dielectric constant

Module lll: S lectures hours

) Biot-Sayart law; Ampere's law and applicationsi Magnetic fields in matter, Magnetization, Bound
currents;

Module lV: 6lectures hours

Faraday's law of electromagnetic induction; Displacement current and the generalized Ampere,s law;
Maxwell's equations; Electromagnetic rvaves.

Studio Work/Laboratorv Ex riments:

The course covers basic college level experiments on a wide range oftopics in physics.

I Determination of the radius of a current carrying coil using Biot savart law and a deflection
magnetometer.

,,.,w
E. t-,.fr.,. 11t.,, :r':..iiy, Gr. J l.ir Ncida
s' i-l -Jirii.r. (ti).,it ..i c,i iltl.rr lradesh)
lL
Picl l,.io'-" 8, !, 1 0, i 1 , rc .ir Zone-ll
Greate r l,jr:ida-2C 1310
 2 To draw equipotential lines for a given set of electrodes in an electrolytic tank using a digital
multimeter.

3 Measurement of dielectric constants of given materials by using them as the dielectdc layers inside
capacitors.

4 To study ofthe hysteresis loop for a given ferromagnetic material on a cRo using a solenoid and to
calculate the coercivity, retentivity and saturation magnetization ofthe given material.

5 To study the principle ofsuperposition of magnetic fields using Helmholtz coil.

6 study Hall effect in an extrinsic semiconductor sample and determine the Hall coefficient and
density of majority charge caniers.

7 Determination ofthe refractive index ofglass and the Cauchy's constants \vith the help ofa prism
and spectrometer.

8 lnvestigation ofdifllaction phenomena using single slit, double slit, circular aperture and a He-Ne
laser source.

9 Determination ofthe specific rotation of linearly polarised light by sugar molecules using
polarim eter.
)
l0 Determination ofwavelength ofmonochromatic light using Newton's rings formed in an air-
film.

Text Books :
Grffiths David J., Introdaction to Electrodyn,mics (4th Edition), canbridge llniversity press,
2017, ISBN 978-t t08420419, ISBN t t08420419.

Reference Books :
l. Halliday D., R. Resnick & J. Walker, Fundament,ls of physics (6th Edition), Wiley lndia,2006,
ISBN 978-9754586329, ISBN I I2650823X.

2 Resnick, Hallidoy and Krane, Physics, Vol. I & 2, (5th Edition), Wiley Student Edition,2^07, ISBN
978-8 1 265 I 0887, tSBN 9788 I 265 I 0887.

Assessm t Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

) Weightage (o/o) 35% 30% 35o/o lo00

*M,^,
g,*",i"if .;,"'ffi 'r:['t:,],]]i
 )

)
Semester II

..Milr
Benff6lt University, Greaier Noida
(Established LlnderAct 21r 0f co\,t, ol UtLar pradesh)
Plot No's B, 9, '10, 11 , -l-ech Zone-il
Greater Ncida-201 310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
ECSEI06L Object Oriented Programming using JAVA L T P C
Owning School/Department Department of Computer Science Engineering 3 0 4 5
Pre-req uisites/Exposure

Course Ou mes (COs)

On completion ofthis course. the students will be able to

COI: Explain different programming structures in Java.

CO2: Apply the concepts of object-oriented programming: encapsulation, abstraction, inheritance and
polymorphism.
C03: Create GUI Based Applications

co-Po/Ps O Maooins

) PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PSC)2 PS03
6 7 8 9 0 I 2 I
col , 2 3 2 I I 2 2
c02 2 3 I I 3 3
co3 3 7 3 2 3 2 I I 3 3

l=weakly related 2= moderately related 3=strongly related

Course Cont€nts:

Module I: l2lecture hours

Overview ofcourse, Create executable Jaya applications with a main method, run a Java program fiom
the command line, including console output, Platform independence, create if and if/else and ternary
constructs, Use a switch stalement; Create and use while loops, for loop, Create and use do/while loops,
Nested loops, Define the scope ofvariables, Object Orientation, encapsulation, Abstraction, etc.; Know
how to read or write to object fields, Explain an Object's Lifecycle (creation. .,dereference by
reassignment" and garbage collection), Wrapper classes such as Boolean, Double, and Integer, Use Java
) operators; including parentheses, String operations; Declare, instantiate, initialize and use a one-
dimensional anay, multi-dimensional array, Declare and use an ArrayList, Vectors collection Class.

Module ll: l2lecture hours

Create methods with arguments and return values, Apply the static keyword to methods and
fields,Create and overload constructors; including impact on default, construclors; Apply access
modifiers, Apply encapsulation principles to a class; Constructor, destructor, Describe inheritance and
its benefits; Develop code that demonstrates the use of polymorphism, use super and this to access
objects and constructors, use abstract classes and interfaces.

Module !ll: g lectures hours

Differentiate among checked exceptions, unchecked exceptions, and Errors, create a try-catch block
and determine how exceptions alter normal program flow; Describe the advantages of Exception
handling, create and invoke a method that throws an exception.

tl,run,
IJ-r
]tf-.lr lJrrit ,i..i:: ,. c:,, r^r Noicia
-..i
ir .,':,'- "l')
G,c:'cri...; ] .i;,0 " i--ll
 Module lV: 9 leclures hours

writing and running Simple Servlet, servlet Life cycle; Generic Servlet, HTTP servlet, servlet config,
servlet contest, writing servlet to handle cet and post methods. JDBC: objects (statement, prepare-<l
Statement and Callable Statement), Types ofresult set Inserting and updating, records.

Studio W k/Laboratorv nx iments:

Students.will gain hands-on experience on core JAVA. students will be able to solve simple to
medium level computation problems in Java. Emphasis will be that the student code themselves as
much as they can. They leam to debug the programs resulting in error free code. lnstructor will be
giving assignments based on the content covered in the lecture classes in the corresponding week.

Text Books :
l. Schildt Herbert, Java: The Complete Reference (9th ed.), McGraw Hill Education,20l4. ISBN
978- 9339212094.
2. Balagurusamy E, Progromming with Jova (5th ed.), McGrow Hill Education, 20t 4. ISBN g7B-
9351 343202.

)
Reference Books :

l. Kanetkar Yashwant, Let Us Java (2nd ed.), BPB Publications, 20t6. ISBN 9Z&gtgj334679.
2. Schildt Herbert, Jova: A Beginner's Guide (6th ed.), McGrtw Hill Education,2012. 1SBN 9Zg_
93392 t 3039.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (Yo) 35o/" 30n/" 35v" t00vo

rMa
53+ffi
rf +Tii,l.{ff :,},3r*?,
 Nam€ of Program Bachelor of Technology (Computer Science and Engineering)
ECSE209L Discrete Mathematical Structu res L T P C
Owning SchooUDepartment Department of Computer Science Engineering 3 0 4
Pre-req uisites/Exposure
Course Outcomes (COs)
On completion ofthis course, the students will be able to

COI: Learn logical notation to illustrate sets. relations, functions, and integers.
CO2: Identiry induction hypotheses and prove elementary properties of modular arithmetic.
CO3: Apply graph theory models ofdata structures and construct state machines to solve problems of
connecliviU and constraint salisfaction.

CO-PO/PSO MapDins

PO Po2 PO3 PO4 PO5 PO PO PO PO POr POI POI PSO PSO2 PSO3
'7 9 0 I 2 I
I 6 8
col 3 3 2 3
co2 2 3 3 2 2 2 J
co3 2 3 3 3 2 l , ) l 3

l=weakly related 2= moderately related 3:strongly related

Course Contenls:

Module I: 12 lecture hours

Introduction to Propositional Logic, Proposition, Logical Operators, Tautology, Contradiction Logical
Equivalence, Tautological tmplication, Methods of Proof. lntroduction to Sets, Some Standard Sets,
Subset and Proper, Power Set, Venn Diagrams, Operations on Sets, Some Other Classes of Sets.
Definition Function, Types of Functions, Sum and Product
of of Functions, Functions Used in
Computer Science, Definition of Relation

Module II: l2lecture hours

Relation vs Function, Different Types of Relations, Pictorial or Craphical Representation ofRelations,
Matrix Representation of Relations. Closure of relations, Representation of Integers, GCD, residue
classes, linear congruence. Euclidean theorem, Chinese remainder theorem, inclusion-exclusion
principle. Binomial coefficients, permutation and combination

) Module llt: glectures hours

Pigeonhole principle, Definition of semi-group, monoid and group. Types of groups. Addition and
Multiplication modulo m, definition of ring and field. Definition of ring and field, introduction to
partially ordered set.

Module lV: 9lectures hours

Concept and properties of lattices, lntroduction to graph, Homomorphism and lsomorphism. Euler
graph, Hamillonian circuit, travelling salesman problem, definition of trees, spanning trees. Kruskal
and Prims algorithm. Chromatic number, clique and matching.

Text Books :
t. Bishl, R.K. qnd Dhdmi, H.5., Discrete Malhematics (1" ed.), OxJbrd University Press, 2015. ISBN
97- 80 t 99452798..

,,,w,,
:-. '')
rl'
t/l
vt
l''i,;t i'l.r ,.
(1. r. ':i.'.:- ;
 2. O'Donnell, J., Hall, C. and Page, R , Discrete Mathematics Using a Computer (2d ed), Springer -
lntemational, 2006. ISBN 97 8- I84 62 824 16..

Roference Books i

l. Biggs, N.L., Discrete mathernatics (2il ed,), @ford tJntversity Press, 2002. ISBN 978-
a|9850V 178..

Assessment Scheme: t

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (o/o) 35% 3Oo/o 35o/o 10tr/o

lt,
tr// / ,

R&&,,
Bonhett University, Greater Noida
(Established LJndLrAct 24 of Covt. c, UHar pradesh)
Flot No's B, 0, 1 0, 11 , Tech Zone-il
Greater Noida-2o1310
 Name of Program Bac h el o r of Tec h n ol o 9J (C o m p u t er Sc en ce a n d E n gi n ee rl n
c)
EMATI 02L Linear Algebra & Ordinary Differential L T P C
E uations
Owning School/Departmenl Departm€nt of Com puter Science En grneenng 3 0 4
Pre-req u isites/Exposll r€
Course Olrl mes (COs)
On completion ofthis course, the students will be able to:

col: solving system oflinear equations by using caussian elimination to reduce the augmented
matrix to row echelon form or to reduced row echelon form.
co2: To be familiar with the concepts of dimension of a subspace and the rank and nullity ofa matrix.
co3: To calculate the eigenvalues and eigenvectors of a square matrix using the characteristic
polynomial.
CO4: F'undamental concepts of ordinary differential equations
CO5: Solving linear differential equations of both first and higher order.

CO-PO/PSO Manoing

PO Po2 PO3 Pc,4 PO5 PO PO PO PO POI POr POl

) I 6 7 8
PSO PSO2 PSO3
9 0 2 I
col 3
co2 2
2
co3 2 2 3
c04 2
cos 2 a

l:weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: l2lecture hours

Review of Matrices, system of linear equations, causs elimination method, Elementary matrices,
Invertible matrices, Gauss-Jordon method for finding inverse of a matrix, Review of Basic properties
ofdeterminant, Cofactor expansion. Determ inant method for finding inverse ofa matrix, cramer's Rule,
vector space, subspace and Examples, Linear span, Linear independence and dependence ani
Examples' Basis, Dimension, Extension ofa basis ofa subspace, Intersection and sum of two subspace,
Examples. Linear transformation, Kernel and Range ofa linear map, Rank-Nullity Theorem, Rani ofa
.) matrix, Row and column spaces, Solvability of system of rinear equations, some applications, Inner
product, Cauchy-Schwartz inequality.

Module ll: xx lecture hours

orthogonal basis, Gram-schmidt orlhogonarization process, orthogonal projection, orthogonal
complement, Projection theorem. Fundamental subspaces. Fundamentaliubspatei and their relaiions,
An application (Least square solutions and least square fittings). Eigen-values, Eigen- vectors,
characterization of a diagonalizable matrix, Diagonalization: Example, An - application.
-
Diagonalization of a real symmetric matrix, Representation of a real I inear map by matrices.

Module lll: l2lectures hours

Introduction to DE, order ofDE, Firsr order oDE F (x, y, y') = 0. concept ofsolution (general solution,
singular solution, implicit solution etc.) Geometrical interpretations (diiection fields),-Separable form,
Reduction to separable form, Exact equations, Integrating factors, Linear equations, Bernoulli equation,
orthogonal trajectories, Picard's existence and uniqueness theorem (without proof), picard,s iieration
method. Second order linear oDE: fundamental system and general solutioni of homogeneous

,a,ful
l).. ,':-.{, t1;.,, ,,, 1j.,. r,-r.-,;:..:r
Nci.Ja
I lcl 11.. ' .)' ... .. I rr,. ,.il,
..: I
G,eatc; I,J, ;, ;_ .'., :'.',:''-t) ,i( it-1-ll
 equations, wronskian, Reduction of order, characteristic equations: real distinct roots, complex roots,
repeated roots, Non-homogeneous equations: Undetermined coefficients and variation ofparameters.

Module lV: g lectures hours

Extension to higher order differential equations, Euler-cauchy equation, Real analyic solutions of
Linear second order equations, Linear system of Differential equitions, Fundamenial set, Linearly
independent soJutions, Laplace transform: Laplace and inversj Laplace transforms, First shifting
theorem, Transforms ofderivative and integral, Differentiation and lntegration oftransiorms, unit stef,
function, Second shifting theorem, Convolution and applications, lnitiaivalue problems.

Text Books :
Strqng G., lnlrodaction to linear algebra (4th ed.), Brooks/Cole tndia, 2006. ISBN gZg-00J010567g,
0030105676.

2 KreyszigE., Advanced Engineering Mathematics (l}th ed.), John Wiley & Sons, 2010. ISBN 97g_
041 04s83 65. 047 04s83 64.

Reference Books :

) l. Hoffman K. and R. Kurue, Linear Algebra (2d ed.), prentice Hall India, 2004. ISBN g7a9332550070,
9332550077.

2.9immons c F., Dffirential equations with applicdtions and hisroricql notes (2"d ed.), McGraw- Hill
Education (lndia) Pvt Limited, 2002. ISBN 978-00205 307 1 3, 00205302 t 8.

3.coddington E.A, An Introduction to ordinary Dffirential Equations (l't ed.), Dover publication,
I 989. tSBN 9780486659428.
4.s. L. Ross, Differential Equations (j'd ed.), wiley India, lgB9. tsBN 9788t26515370.8126515376.

Assessmen t Scheme

Components lnternal Assessment Mid Term Exam End f,xam Total

Weightage (%) 35o/o 30% 35vo l00o/o

*M,
Pgll(,t Urriv:rsily. Grearrr Noida
F,; il;;l u,'ii ,'t:ilj ,:' ,;t-i;1{:1li
Greater lJcidr-:lit1 3i,
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CIEIOIt, Foundations of Entre preneu rship I, T P C
Ownin g School/Department School of f,ngineering and Applied 0 0 3
Sciences
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

col: To discuss the basic understanding of the relevant concepts and practice of
entrepreneurship.
co2: To recognize the essential criteria in the decision to become an entrepreneur or opt for
entrepreneurship.
co3: To demonstrate how the entrepreneurial process is ofmoving from just an idea to a viable
) and sustainable launch of an entrepreneurial firm/venture.
CO4: To practice with the basic tools and tactics required to manage and grow an
entrepreneurial firm.

CO-PO/PSO Mapoine

PO PO PO PC)4 PO5 PO PO PO PO POt POI POI PSO PSO2 PSO

I 2 J 6 7 8 9 0 I 2 I J
CO 2 3 2 I 3

CO I 2 3 2 3
2
.,
CO 2 I 3 3
3
CO 3 2 I 2 2
4

,' l=weakly related 2= moderately related 3=strongly related

Course ontents:

Module I: 12 lecture hours

The Psyc}ology ofAn Entrepreneur, who is an entrepreneur? The entrepreneurial mind-set:

looking inside the black box, Entrepreneurial expertise. overview of Entrepreneurship,
Evolving concept of Entrepreneurship &amp; Entrepreneurial Environment, How'to avoid the
pitfalls of entrepreneurship - The Dark Side, Myths &amp; Realities about Entrepreneurship

Module II: 15 lectur hours

creativity in Entrepreneurship, The Creative process stages/steps, Creative Thinking,
-
Techniques, Sources for Generation of ldeas, and Role of, Imagination, Effectuatioi,
Improvisation, Analogous Thinking, etc., problem Finding &ampf Solving _ Divergent

l
frWrq
Dttt t ,ll
i,,, -6: if.!'jr.iv''..'7;,!:' |,".ig:,
Fl,ti r.,r,,." .,.
Gi.-3t...r
,,, ,,, t ,. .
;:t:ti.....,: ",._if
 Convergent, Associative approaches and, Improvisation, The Innovation Dimension, Barriers
to Innovation, Typology of Innovation, Innovation and New Product Development - An
overview.

Module lll: 15 lectures hours

The Hatchery Sprint- A Hands-on Process ofEntrepreneurship. Stage I : Ideation &amp; Team
Formation, The Founding team [their motivation/skills/etc.], Idea generation, Resources and
skills required, Logistical/Legal requirements Stage 3: Opportunity Analysis, Macro-
environment scanning, Sizing the opportunity, Stakeholder analysis, Competition analysis,
Customer segmentation, Understand the custonrers'context/needs: personas Stage 5 -The
Early Solution, Mock-ups &amp; Prototyping, Customer validation/demo, Value Proposition
Canvas, Cost/Revenue Model, Marketing plan, Business Model Canvas, Pitching, Social
lmpact Measurement.

Text Books :
l. Hatten, T. S-. Small business managemenl: Entrepreneurship and beyond,
Entrepreneurship and small business managemenl. Pearson Education, 201 2.
2. Robert D Hisrich, Michael P Peters, & Dean A. Shepherd. South-Western, Cengage
) Learning. Entrepreneurship. McGraw-Hill Education, 201 7.

Reference Books :
1. Drucker, Peter, and Joseph Maciariello. Innovation and entrepreneursftlp. Routledge,
2014.
2. McGrath, Rita Gunther, and lan C. MacMillan - The entrepreneurial mindset: Strategies for
continuously creating opportunity in an age of uncertainly- Vol. 284. Harvard Business
Press, 2000.. Harvard Business Press.2000.
3. Murray, E. L., H. M. Neck, and D. C. P. Neck. Entrepreneurship: The Practice and
Mindset, ed. (201 7). SAGE Publications.

Assessment Scheme:

Components Internal Mid Term f,xam End Exam Total

Assessment

Weightage (7o) 40 20 40 100

)

II
el ; ,,-:i'lloiCa
(r r rirJish)
Pl:l I 1:,': 7l it:-ll
 Name of Program Bachelor of Technology (Computer Science and En gineering)
EPHYTOSL Mechanics L T P C
Owning School/Department Department of Computer Science Engineering 2 0 2 3
Pre-requisites/Exposure
Collrse ()xl omes (COs)
On completion ofthis course, the students will be able to:

COI: Leam how to apply Ne\ryton's Laws and understand the concept of energy
CO2: Solve problems involving rotational motion
CO3: Get inhoduced to central forces and conversion of two body problem into one body problem
CO;l: Leam about harmonic oscillators.
COs: Introduction to special theory ofrelativity
CO6: Perform basic physics experiments, tabulate observations, analyse data and draw conclusions

CO-PO/PSO Maoping

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POr PSO PSO2 PSC)3
6 7 8 9 0 I 2 I
) col 3 3 2
c02 3 3 1 I t 3
c03 3 3 t 3
c04 2 2 ) I 3
co5 3 2 ) a 2 3
co6 3 3 , 3 ,|
3 3

l:weakly related 2= moderately related 3=strongly related

Cours€ Contents:

Module l: lOlecture hours

Mathematical prerequisites, Kinematics, Newton's Laws.Work Energy Theorem, Conservation of
Momentum and Energy,Conservative Forces and Potential Energy, Non-conservative

Module ll: 12 lecture hours

Rotational Motion, Conservation of Angular Momentum,Moment of Inertia, Rigid Body Motion,
Euler's Equations.Non-lnertial Frames of Reference, Pseudo Forces, Coriolis and Centrifugal
) Forces,Central Forces, Kepler's Laws, Planetary Motion.

Module lll: 6lectures hours

Harmonic Oscillator: Free, Damped and Forced Oscillations. Resonance Special Theory ol Relativity
Lorentz Transformation, Length contraction, Time Dilation, Energy-Mass-Momentum Relations.

Studio Work/Lahor atorv ExDeriments:

The course covers basic college level experiments on a range oftopics related to mechanics and modem
physics.lntroduction to the concept of error in physical measurements.
L Estimation oferror in measurements involving Vernier calipers and screw gauge.

2. Determination ofmoment of inertia of a flywheel about its principal axis passing through the axle

3. D€termination ofco-eificient ofviscosity ofglycerin by measuring the terminal velocity ofa falling
sphere
A
/lx/,4/
N(,11rar
/]4' 't'.1'.'
ti' f,:,. , ' , r ':':r:, l'l:rija
r.r.,,i.rlt
i.rctr..,..;;, r. r tire"-
Grt:i.rIi .:
 4. Determination of Young's Modulus of a malerial by analysing the bending of a beam

5. Determination of the coefficient of static friction between the surfaces of a slider and a wooden
plane

6. Measurement of Planck's constant, work function and threshold frequency using photoelectric
effect

7. Measurement of band gap of a semiconductor by studying the variation of its resistivity with
temperature using the four-probe method

8. Measurement ofspecific charge (e/m) ofelectron by Thomson Method using cathode ray tube and
defl ection magnetomeler

9. Study of uniform motion and collisions in near-frictionless conditions using a linear air track

10. Study ofdifferent modes ofvibration and coupling factors ofa coupled pendulum

Text Books :
) l. Kleppner D & R. J. Kolenkow, .42 Introduction to Mechanics (2nd Edition), Cambridge University
Press, 2014, ISBN 978-0521 l98 l 10.

Reference Books :
l. Young Hugh D. and Roger A. Freedman, University Plysics (l3th Edition), Peqrson (Addison-
lYesley), 2012, ISBN 978-0321696861, ISBN 0321696867.

2. Kittel Charles, Walter D. Knight, Malvin A. Ruderman, Berkeley Physics Course, Mechanics Vol.l
(2nd Edition), McGrqw-Hill, 1973, ISBN 978-0070048805, ISBN 0070048800.

3. Halliday Dnid, Fundamentals ofplysics (l1th Edition), lYilqt,20l3, ISBN 978-l 118230718

Assessment Scheme:

Components lntern!l Assessment Mid Term Exam End Exam Total

Weightage (%) 35% 30o/o 35o/o 100%

R
Benn niversity, Greater Noida
(& la UnderAct 24 of co!,l, of Uttar Pradesh)
PI ot No's 8, 9, 1 0, 11 , Te ch Zone-ll
Greater Noida-2o1310
)
Semester III

lar
Be nett Universit y, Greater
lished Undert,c[4 cl Go\,'l
Noida
of Ultir pra d$h)
t No's 8, g, 10 11 , Tech Zo ne-ll
G reater Nr:ida-20 1310
 Name of Program Ba c h e I o r o f T ec h n ology
(c o m p u ter S ct e T ce AT d E n n ee rt ng)
ECSE2t I l, lnformation Man agemeDt Systems L T P C
Owning SchooUDepartment De pa rt m e n t o f c om p u te r Sci e n ce E ng I n ee r n 0 2 4
Pre-req uisites/Exposure

Corrrs e Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: Show the understanding ofthe tundamentals relational database systems.

CO2: Construct databases using DBMS products such as MySeL/Oracle/My SeL Server
co3: Design database systems and understand new deveropments and trends in
databases

CO-PO/PSO Maopins

PO Po2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POt POI POt PSO PS02 PS03
I 0 I 2 I

COI 3 I 3 3 3
) co2 1 'l 3 3 3 I 2 a 2 3
cc)3 3 2 3 3 3 2 3

l=weakly related 2= moderately related 3:strongly related

Corr rse Contents:

Module I: lz lecture hours

Introduction and applications of DBMS, purpose of database, Data, Independen"., outuuu."
archjtecture- levels Mappings, Database, users and DBA Relational Model:
sy.t".
Structure of relational
databases, Domains, Relations, Rerationar argebra
- fundamentar operators and syntax, rerationar
algebra queries, tuple relational calculus. Funitional Dependency
- difinition, rriviai ano'non+riviai
FD, closure of FD set, closure ofattributes. Irreducible set ofFD, Normalization _
lNf,2NF, 3NF.
Mod[le Il: l2lecture hours-
Decomposition using FD- dependency preservation, BCNF, Multivalued dependency,4NF,
dependency and 5NF. Overview. measures of query cost, selection opeiation,
Joil-
soning, join.
Eyaluation of expressions, transformation of rerationar expressions, estimating satiiici
) expression results, evaluation plans, materialized views. Tiansaction concepts, properties
of
of
transactions, serializability oftransactions, testing for serializability.

Module lll: g lectures hours

System recovery, Two- Phase Commit protocol, Recovery and Atomicity, Log-based
recovery,
concurrent executions of transactions and related problems. Locking mechanism,
solution to
concurency rerated problems, deadrock, two- phase locking protocor, Isolation,
Intenl locking;
Introduction, Discretionary access control, Mandatory Access Control, Data
Encryption.

tar
r. r -i. i;, ; . ,,t .l

(, itr'i. i jj-':uj-1'10
 Module lV: 9lectures hours
lntroduction to Distributed Database Systems (DDS), pro and cons of DDS, transactions, commit, and
transpaxency in DDS. Data warehousing, Big data technologies, including big data storage, big data
processing and big data analytics; Introduction to NoSQL database systems, including column stores,
RDF slores, HBase; Hadoop MapReduce Algorithms for expensive queries over big data.

Studio Work/l,aho torv ExDeriments:

Entity-Relationship model: - Basic concepts, Design process, constraints, Keys, Design issues, E-
R diagrams, weak entity sets, extended E-R features, generalization, specialization, aggregalion,
reduction to E-R database schema. SQL Concepts: - Basics of SQL, DDL, DML, DCL, structure -
-
creation, alteration, defining constraints Primary key, foreign key, unique, not null, check, tN
operator Functions - aggregate functions, Built-in functions -numeric, date, s$ing functions, set
operations, sub- queries, correlated sub-queries, use ofgroup by, having, order by"join and its types,
Exist, Any, All, view and its types. Transaction conftol commands Commit, Rollback, Save
-
point.PL/SQL Concepts: - Cursors, Stored Procedures, Stored Function, Database Tdggers.

Text Books :
l. Ramakrishnan,Raghu and Johannes Gehrke, Dqtqbase mqnagement systems (3 ed.), McGraw
) Hill,2014. ISBN 978-93392I3I I4.

2. Elnasri, Ramez and Shamkant B. nayathe. Fundamentals o/ dotabane systems (7h ed.), Pearson,
20 I 7. ISBN 978-0 I 3 3970777.

Reference Books :
l. C J Dqte, An lnlrodaction to Databqse Systems (8'h ed.), Pearson Education, 2006. ISBN 978-
8177s85568.

2. Silberchatz, Database System Concepts (6h ed.), McGrawHill, 2013. ISBN 978-9332901384

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (7o) 3svo 3Oo/" 35vo l00o/o

.^M-,
iJl{ffKun'., r;tv. Gr€rtnr Noi(r3
rt. [/'".tr.: ,i \r ,.i .
,.", t::- .

Pict No's B, 9, 10, 1-l ,'t:cii .li;rre-ll

G r:.:aici- NriiCa-20'l 1 0 31
 tT i m a 0f Progra m Ba ch e lor ot
f,,CgD2tsL n (cOInp Uf
Da ta Str U c
tn ent tu res usiD el" Scien
Dep8 rt,,, ET C++ CG a D d E ngin
P ra .nq u lt lorlEt ure tof Corn Pu te eeri I c)
o r ED g D eeri
IIg
on completion o f thls course,
the students
will be able
to:
COI: Wflte recursive algorithns
to handle all
co2 : Choose appropriate search recursive
dah strucfufes
,ng and sorti
Prrot hrl
problems. ng technigues
and apply
coJ I lbnnu6to ne/improved graph algorithms
solurions for for various
pro *m&rng
problems
Cql0ltq0.Uudar ustllg learned
data stucture.

lcoz PO3 P04 Po5

2
) 3
t '2
J 3 I
I =weakly related
2= moderate.ly
related
Caurr. (.oitents: 3=shongly
re,lated

DlodIt h
htroduct lon
ao oops Concepts,
Complox lO, handl lng
Ary6ploli. Analysrs. Arays, Tower
Irhplem entations: Big -oh of Han oU 12 tecture
h ol!rs
- Linked
,isrs, Recursiye
n oradon,
Solvrng Binary s earch
func6 ons Rec Tnn e
Module II: on Iists, relations.
Deleuon, lrrence I_ists and
Stacks, rnsenion,
Queues using linlk reyersln& jolnlng.
biru.y and ed lisrs, handlin
complete bin Polynorn
arI fees; flsg ials; Tree
del etion traversals data structure 12 lecture
algori thrns, and Implern Irou rs
B lnary search enhtions,
Modulo lrr, hees, in senion
) Soning Algorithms: and
- Merge and
heap sort. euick soq AVL
tuees, B-Trees, 9 lettures
Heap Trees Dours
Modulc lVr - &ioriry
Hashing: -Chai eue ues,
ned Hash Tables
Algorirhms, pa , Linear probin
th compression; g, Double
Huftnan codi Craph: .BFS, Hash lng; 9 lectures
ng. Shonesr DFS Topo
Di siolna set h outs
path, Tree logical s class -Smart
data sfructure ort, Minimum Un lon
s Panning
hees,
The Iaboratory
of Data struoures
tte concepb is designed
and toprcs to provi de
c ++ will help raught in f, e classroom a pracfcal
the s tudenh exposure
sessi ons. to the studeflIs
to have a befter Irnplern enting
un derstan the about
Text Books dre of r.li. learnt
: bjec. ., concepb
using

Srfu,
Ei!lW!: jy p,'iry, c.. -, -
5r:[?i,:;;#,i?",,#"r,d#J:fl
 l. Horowitz Ellis and Sartaj Sahni, Fundamentals of Data Structures inC++ (2 ed),
Universities Press, 2008. ISBN 978-0929306377.
2- Langsem, Augenstein and Tenenbaunl, Data Structures using C and C++ (?d ed.), Pearson,
20t 5. tsBN 978-8t20it t770

Reference Books :

l. Aho V., J. E. Hopcroft, and J. D. Ullman, Dqts Structures and Algorithms (1" ed), Pearson,
2002. tsBN q7&8 I 7808 I 02 1..

2. Tenenbaum Aaron M., Y. Langsam and Moshe J. Augenstein, Data Structures Using C (2d ed.),
Pearson 20 I 9. ISBN 978-8 I 3 I 70328 1..

Assessmen t Scheme:

Components Itrternal Assessment Mid Term Exam End Exam Total

Weightage (%) 35% 3Oo/o 35o/" l00o/o

_)

*hil,.,

Eiffijigij#pffilri;?$i
 Name of Program Bachelor of Technology (Computer Science and Engineerirg)
ECSE2I7T, Microprocessors and Com puter Architecture l. T P C
Owning SchooUDepartment Department of Computer Science Engineering 3 0 2 4
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI : Understand about modern architecture and microprocessors and the design techniques used
lo increase their performance.
CO2 : Evaluate yarious design altemalive ofcomputer architecture based on CpU performance,
memory, 1/O.
CO3 : Create new designs at the register-transfer-leyel.

CO-PO/PSO MaDDins

PO PO? PO3 PO4 PO5 PO PO PO PO POt POt POI PSO PSO2 PS03
1 6 7 8 9 0 I 2 I
cot 1 2 3 3 I 2 2
) co2 2 3 3 3 I 1 3
cC)3 2 2 2 3 3 3 3 3

l=weakly related 2: moderately related 3:skongly related

Course Contents:

Module l: l2lecture hours

Arithmetic and Logic Unit, Introduction to memory Unit, control unit and Instruction Set, working
with an ALU, Various addressing modes and designing ofan Instruction set, Concepts ofsubroutine
and subroutine call. Introduction to CPU design, Instruction interpretation and execution, Micro-
operation and their RTL specification; Concepts of semiconductor memory, CpU- memory
interaction, organization of memory modules.

Module Il: l2lecture hours

Cache memory and related mapping and replacement policies, Virtual memory Introduction to
input/output processing, working with video display unit and keyboard and rouline to controlthem,
) programmed controlled l/O transfer Interrupt controlled I/O hansfer, DMA controller, Secondary
storage and type of storage devices, lntroduction to buses and connecting l/O devices to CpU and
memory; Introduction to RISC and CtSC paradigm, Design issues ofa RISC processor and example
ofan existing RISC processor, inftoduclion to pipelining and pipeline hazards.

Modul€ III: g lectures hours

Design issues of pipeline architecture, lnstruction level paraltelism and advanced issues
lntroduction to interconnection network and practical issues., Examples of interconn€ction
networks; Multiprocessors and its characteristics, Memory organization for multiprocessors
systems, synchronizztion and models ofmemory consistency, Issues ofdeadlock and scheduling in
multiprocessor syslems.

Module lV: 9 lectures hours

M
U, r- i"'. rlrctir-li f\Joial;.1
,./c
r, 1 , r,.., , i,l Lli .r, i ,,i: ijl
3, 1il, i i, i:oh.:1rr:r:,ii
, r "rt.i t-::.)lil il-,
 cache in multiprocessor systems and rerated problems, cache coher€nce protocols, parauer
processing concepts, Parallelism algorithm for multiprocessor systems;
General definitions of mini
computers, microprocessors, micro controllers and digital signal processors, overview of
microprocessor, signals and pins ofmicroprocessor; overview ofmicroprocessor, signars and pins
ofmicroprocessor.

Studio Work/Laboratorv Exoeriments:

In this course students will start with basic components of cpU such as ALU, Memory
etc. Then
finally combine all components and develop a processor. The Lab will use Altera
euanus prime
Lite for design. MIPS for assembly programming.

Text Books :
l. Hennessy J. L. and D. A. Patterson, Computer Archirecture: A euanlitatiye Approach (5,h ed.),
Morgan Kaufnann, 2012. tSBN 978-938 t 269220_

2 sjallings ll/illiam, computer organization and Architecture (10'h ed.), pearson, 20r6. ISBN g7B-
0 t 32936330..

) R€ference Books :
l. Harris D.M and S. L. Harris, Design and Computer Architecture (2 ed.), Morgan
-Digital
Kaufmann,20l2. ISBN 978-0 t 2394424j..

2. Morrk Mqno M., Digital Design: with an Introduction to the yerilog Hdl (5th ed.), pearson
Education, 20 I 4. ISBN 978-9 3 32 53 5763..

3. Palnitkar 5., Verilog HDL: A Guide to Digital Design and Synrhesis (2 ed-), prentice Hall, 2003.
ISBN 978-01 32 599702..

men t Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 3svo 30o/o 3s%o 100%

Re
Benir UniversitY, Greater Noida
(E511'ol
acl 24.ri(lJ!'l oiuilirr Pradesh)
Picl t':o's 0, 9, 10, 11 , ]-e ch Zone-ll
G re:; lri, i{cida -201310
 Name of Program Ba c h e o r of Tec h n ol ogy (c o m p ute r Sc te n c e a n d E ng T e e r I ns)
ECSE23I L Probabil & Statistics L T P C
Owning SchooVDepartment D ep a rtm en o f C om p u te r Sc le nc e E n gr n ee rt n 3 0 2 4
Pre-req uisites/Exposure

Cou rse Outcomes ( COs)

On completion ofthis course, the students will be able to:

col: To make students understand basic probabirity theory and statistics,

and important laws therein.
co2: To make students know difrerent standard distributions, and how these
can be used to model
different real-life random phenomena.
co3: To make students visualize and interpret data using simple charts and calculate
their measures of
central tendency and variability.

CO-PO/PSO Ma DDINS

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PS03
) 6 7 8 I 0 I 2 I
COI 3 3 t 2 3
c02 3 3 3
co3 3 3 3 3 2

l=weakly related 2: moderately related 3=strongly related

Course CoIltents:

Module l: 12 lecture hours

Fundamentals of Probabirity: Covering probabiliry, conditionar probability, independence,
totar
probability theorem, Bayes'theorem, and random variabres (both
discrete and continuous), Stochastic
Processes, Moments- Expectation, Variance, Covariance, Correlation
coefficient, Moment generaling
function, probability generating function, characteristic function.

Module 1l: I0lecture hours

Specific discrete and continuous distributions; Uniform, Binomiar, poisson, geometric,
.) Exponential,
Normal, Central Iimil theorem.

Module lll: 20 lectures hours

Analyzing Data Visually: Leam to visuarize dala through the creation and interpretation
ofhistograms,
bar charts' and fiequency prots. Exprore nreasures of centrar tendency
and variabirity. Derve into
sampling distributions, incruding chi-square, t, and F disrributions, Hyporhesis
Testing with Chi-
square, t, and F distributions, parameter estimation, Least square
estimation melhod, Maximum
Likelihood estimation, confidence intervars, Hypothesis testing- z test, t test,
F test; chi-squared test,
ANOVA: test ofdifference between groups, Linear regression, multiple regression

Studio WorldLaboratorv Experiments:

In the labs component ofthe subject probability and statistics,

the department offers ining on the core

,-i.gi fir j
i r':.t.t OI: ,. ;i , C, C: t,,r ilCida
l: j:t ., .'l " il' i_ r. icsh)
I ,, Lttr
l.l,rr
. l:]
Cr.tat.:t , . ,..r"t-_Li.tc Zone_tl
iiJ
 ideas of data analysis. The students leam to perform numErical analysis, compute odds of any even!
check distribution (both basic and advanced). The students furtha try their hands on both linear and
In addition to tlis, students build search engines (like google), implement
non linear regression.
ideas ofdynamical system (via Markov models), play with the concepts of central limit theorem and
law of large numbers. Lastly, everyone is encouraged to try and test scientific hypothesis via the
paradigm ofstatistical hypothesis testing and confidence interval estimation. The students are also given
hands on training in the language R.

Text Books :
1. Rox Sheldon M., Intro&tdion to Ptobabilv and Stqtistics for Engineers and Scientists (4th ed"),
Academic Press, 2009. ISBN 978-123704832

2. Michael Baro4 Probabilily and Stqrisrics for Computer Scientist$ (l'1 ed.), Chapnan and Hall
booh 2006. ISBN 978-1584886419
Referenco Books :
l.Paul L. Meyeri lntroductory Prcbability and Statistical Applications (2 ed.), Addison- Wesley,
1970. ISBN 978-0201047I4 t
2.Irwin Miller and John E. Freund, Probability and Statistics for Engineers (il ed.), Pea?son 2010.
) tsBN 978-0321640772

dEssEsEcESslEElg:

Components Intcrnal Assossment Mid Term Exrm End Exam Total

l eightage (%) 354/o 3Oo/o 35Yo l00P/o

-)

JM*,
Egffikrl:t,ffili#;ir$,r
 Name of Program Bac h el o r o f Te c h n ol ogy (c o m p u ter Sc I e n ce an d E rg n ee rt n
s)
ECSE235P Des n Thinkin & lnnovation L T P C
Owning SchooUDepartment De pa rt m € n o f c om p u te r s cre n c€ E n I n ee r n 0 0 4 2
Pre-r€q uisites/Exposure

Cou Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: Understand the basics ofdesign thinking.

CO2: conceptualize and ideale sorution fbr an existing problem using computing
resources and
computing devices.
co3: Apply the concept to create and prototype the idea into near workable solution.

CO-PO/PSO Mapoine

PO PO2 PO3 P04 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
col 2 3 ) 2 3
) c02 3 2
I 3 2
3
co3 2 , , 3

I =weakly related 2= moderately related 3:strongly related

Course Contents:

Module l:
56 lecture hours

students will
be doing a group project that gives them the 360-degree understanding
ofthe design
thinling approach that goes into making a project. The students wi[ be continuousry assessed
and
evaluated on different criteria rerated to project development. students wir
be creating poster,
Video, Blog, Report and presentation to understand the different deliverables and
documentation
associated with the project. Students wilr be supposed to work on rear rife problems
and workabre
issues that can be solved with the intervention oftechnology and befter
design.

Studio Work-/Lahoratorv Exneri ments:

The coursewill be taught using a combination ofthe besr practices of teaching-leaming. Murtipre
environments will be used to enhance the outcomes such as seminar, selfJeaming,
MOOCs, group
discussions and ICT based toors for crass participation arong with the crassroom
sessions. The
teaching pedagogy being forowed incrudes more exposure to hands-on experiment
and practicar
implementalions done in the lab sessions. To match with the latest trend in
academics, case study,
advanced topics and research oriented topics are covered to ray down
the foundation and develop
the interest in the students leading to further exploration ofthe related
topics. To make the students
aware ofthe industry trends, one session ofexpert lecture will be organized
to provide a pratform
to the $udents for understanding the relevant industry needs

Assessment Scheme:

F
,u&
:i, i,/, () itr ii
.r-:al l\ l,-. : rtl,_1

I 1!r, 1 I, r
' , ,,
.:crre_ll
,r :li)t :
 Components Internal .A.ss$sment Mld Term Exam End Eram Totsl

Welghtege (7o) 3s% 3@/o 35% 100V,

*"M,,,
FHffid.j{t{if"*;1f'}#g'i
 )

Semester IV

Re r
Be It LIn h,rersity, Gi"eater Noida
(Frlr irlrci Llr,lir '\ct,ll cfGovl, if Uttar PraCesh)
Plr:t l.lc's , g, '10, 11, Tcch Zone-ll
e
G ril.rtei^ I\Jcida-201 31 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET205 Software Engineering I, T P C
Owning School/Department Department of Computer Science :l 0 2 4
Engineering
Pre-req uisites/Exposu re

Course Outcomes (COs)

Orr complelion oflhis course. lhe studenls u ill be able to:

COI: To articulate understanding of Software Engineering as an iterative and systematic

process.
CO2: To examine the software development process to complement the technical
understanding ofsoftware products.
CO3: To implement development life cycle through the IDE, UML, and Cit.

CO-PO/PSO Maonins

POI PO2 PO3 P()4 PO5 PC)6 PO7 PO8 PO9 PO l0 POI I POl2 PSOI PSO2 PSo3
.,
col I 3 2 3 2
co2 I I 3 2 2 I
col 3 I 3 2 2

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: glecture hours

Importance of Software Engineering, Phases of software development lifecycle, SDLC case
study, Software process model, Waterfall model, V Model, Prototyping model, Incremental
model, RAD Model, Spiral model, Choosing a model, Lifecycle documents, Agile model,
Need of agile, Version Control System, Distributed VC, Git repository, Git online and Desktop,
Check-in, and check-out code in repository, Create branch and merging branch, Git +
Eclipse/lDE.

Modulo II: 9leclure hours

Agile manifesto, Agile principles, Agile development methods, Extreme programming (XP),
XP principles, Test first development, Refactoring, Pair programming, Scrum, Product
backlog, Sprint cycle, Continuous integration, Requirements engineering, lssues in capturing
requirements, Requirement elicitation, Requirement analysis, Functional and Non-functional
requirements, Requirement specification, Requirement prioritization, User stories, Acceptance
criteria, Requirement validation and verification, UML, Use case, Use case Diagram, Include
and extend relationship, Generalization in use Case, Top down and bottom-up approach in use
case diagram, Guidelines for creating use case diagrams.

i 1 ':r,. -r...ty, tt,..:::ir:r l..r;ri,-ra

,, t,)
. , li t.l, i r, i.,-ir - _ na_ll
.-, I l::l:.20'l3i 0
 III:
Module I I lecture hours
UML behavioural diagrams, Activity diagram, Activity diagram with swimlane, UML
structural diagrams, Class diagram, Relationships in class diagram, Sequence diagram, Rules
of creating sequence diagram, Description of relationship between use-case, activity, and
sequence diagram, Architectural design, Cohesion, Coupling, Early locking of architecture,
Architectural pattem, MVC pattern, Layered architecture, Repository architecture, Client
server architecture, Software architect, roles, and responsibilities, Pipe and filter architecture.

Module IV: 13 lecture hours

Reverse engineering, Horseshoe model, Software cost estimation, Cost estimation
factors,COCOMO model, Software quality assurance and testing, Software testing for
competitive advantage, Testing strategies, Designing test cases, Black box testing, Equivalence
partitioning, Boundary value analysis, White box testing, Black box vs. white box testing,
Control flow testing technique, Control flow graph, Cyclometric complexity, Levels of
coverage, lntegration testing, Top down and boftom-up integration, ContiDuous Integration
testing, Regression testing, Acceptance testing, System testing. Performance testing, Software
engineering standards, ISO standards, CMM.
,)
Text Books :

l. Pressman R., SoJit,are Engineering A Practitioner's Approaclt (8th ed.), McGraw

Hill lntemational, 20 I 9. ISBN 97 8-1259253 1 57..
2. Sommerville, Software Engineering (lOth ed.), Person Publications Publishing
Company, 20 I 7. ISBN 97 8-9332582699..

Reference Books :
L Summers B. L., Efibctive Methods for Sofrwure Engineering (l ed.), CRC Press, 2020.
lsBN 9781 00005271 0.

Assessment Scheme

Components lnternal Assessment Mid Term Exam End Exam Iotal

Weightage (o/o) 45 20 35 100

 Name of Program Bachelor of Technology (Computer Scienc€ and
Engineering)
CSET206 Design and Analysis of Algorithms L T P C
Owning School/Department Department of Computer Science t I 2 6
Engineering
Pre-req uisites/Exposure na

urse Outcomes COs

On complelion of this course. the sludenls will be able to

CO1: Exarnine and Analyze the asymptotic performance of algorithms.

CO2: Explain various algorithmic techniques for solving problems.
CO3: Experiment to find and develop optimal solutions by applying different algorithmic
strategies for polynomial and non-polynomial problems.
,)
CO-PO/PSO MaDDins

PO PO PO PO4 PO5 PO PO PO PO POI POI POI PSO PSO2 PSO

2 t 6 7 8 9 0 I 2 I J
,, ,,
CO 3 3 3 2 I 2 1 )

CO 3 3 3 2 I 2
,, 1 ) 3
2
CO I .,
3 t ) , 2 2 3
3

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module I: 12 lecture hours

) Introduction to algorithm, What is Time Complexity and Space Complexity. Order of Growth;
Approximation; Asymptotic Notations : Big Oh, Theta, Omega, Amortized analysis,
Analysing control statement, Loop Invariant, Recurrence Relations Introduction, Back
Substitution Method, Recursion Tree Method. Master's Theorem, Divide and Conquer
Algorithrn, Multiplying large lntegers Problem, Median of two sorted arrays, Binary search.
Quick Sort, Merge Sort, Max-Min problem. Strassen's Matrix Multiplication, Radix Sort,
Bucket Sort.

Modulo II: 14 lecture hours

Greedy Algorithm: General Characteristics, Knapsack Problem, Huffman code, Activity
selection problem, Minimum Spanning trees, Prim's algorithm, Kmskal's algorithm *ith
Disjoint sets, Shortest paths: Dijkstras Algorithm, Graphs Algorithms:- Applications of DFS-
bi-connectivity. Topology Sort, Articulation point, Connected components, Max-Flow, Min-
 Cut, Ford-fuelkerson, Dynamic Programming:- Introduction, principle of Optimality,
calculating Binomial coefficient, 0-l Knapsack, Matrix chain multiplication, Longest
Common Subsequence, All Points shortest path Floyd warshall, Largest Divisible Subset.

Module III: g lecture hours

Backtracking and Branch and Bound: - State-Space Search rree, eight queen's problem, Graph
colouring, Hamiltonian cycle, Travelling Salesman problem using Branch and Bound
Approach, String Matching Algorithms, naive string-matching algorithm, Knuth Morris-pratt
algorithm.

Module IV: g lecture hours

Introduction to NP-completeness: - p and Np, Np Complete and Np-Hard, Approximation
algorithms, Travelling Salesman problem, Randomized Algorithms: Randomized
euick
Sort,Computational Geometry: Convex hull, Online Algorithmi: K Server problem.

Text Books :
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
Introduction to Algorithms (4th ed.), The MIT press,2022. ISBN 9780262367505.
4. Horowitz Ellis, Sahni Sartaj, Rajasekaran Sanguthevar, Computer AtgorithmslC++
(2nd ed.), The Orient Blackswan, 2019. ISBN 9386235145.

rence B ks:
l. Karumanchi narsimha, Algorithm Design Techniques: Recursion, Backtracking, Greedy,
Divide and Conquer and Dynamic Program (lst ed.), Career Monk publications. 201g.
rsBN 978-8193245255.

Assessment Scheme

Components Internal Mid Term Exam End Exam Iotal

Assessment

Weightage (7o) 45 20 35 100

Re r
B tUn :\,/3r-r;iy, Gre:tci \!o iCa
(l ci :,1 i i C r,4, .i Liiiirr
P Iot i\ir's J, 0, '10, 'il, -Iech iri:r desh)
Zo ne-li
G rt'later Ncida_ 201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET2OT Computer Networks L T P C
Owning SchooUDepartment Department of Computer Science 3 0 2 4
Engineering
Pre- req uisites/Exposu re na

Course Outcomes (COs)

On completion of this course. the sludenls will be able to:

COl: Examine the functionality ofthe different layers within network architecture.
CO2: Illustrate TCP/IP model suite protocols.
CO3: Design the networks for organization and select the appropriate networking architecture
and technologies, subnetting and routing mechanism.

CO-PO/PSO Mappine

POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 POtl POl2 PSOI PSO2 PSO3
cor 3 2 1 I 2 I 1 2
co2 3 3 3 3 3 2 2 2 2 2 3
co3 2 'l 1 I 2 I 1 1

l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module I: 9lecture hours

Why Computer Networks: Applications of Networks, Transmission Media, Connecting
Devices, Local Area Networks: LAN topologies: Bus topology, Ring topology, Star
topologies, Mesh topology, Hybrid topology, OSI reference model, TCP/lP Protocol suite,
Physical Layer: Services, Line coding scheme, Modulation, Multiplexing, Switching rnethods,
) Ethernet, Bluetooth, Wi-Fi, Wi-Fi Direct, WPA/WPA2/WPA3, Data Link layer: Services,
Framing, Switches.

Modulo ll: S lecture hours

Reliable Data Delivery: Error detection, Error Correction, Flow control: Stop and wait, Go
Back-N, Flow control: S-R Protocol, Error control (Retransmission techniques, timers),
Medium Access sub layer - Channel Allocations, LAN protocols /ALOHA protocols, CSMA,
CSMA/CD, Network Layer Protocols: Services (lP. ICMP), IP addressing, sub netting, Super
netting (CIDR), IPV4, IPV6.

Module lll: 9lecture hours

Routing and Forwarding, Static and dynamic routing, Unicast and Multicast Routing,
Distance-Vector Routing, Link-State Routing, Shortest path computation-Dijkstra's algorithm,
Address mapping-ARP, RARP, BOOTP, DHCP, Transport Layer: Services, UDP and TCP

'. i.t.-
J. :.)
 segment forrnats, connection estabrishment and termination, Expert Lecture
from Industry,
Congestion control, Congestion control: Open Loop and closed loop,
euality ofservice, Flow
characteristics, Techniques to improve eoS.

Module IV: 7 lecture hours

Session Layer: Services. Protocols, presentation Iayer: Services, protocols,
Application layer:
Services, DNS, SIP, RTP, Telnet/SSH, HTTP, HTTPS, Remote login, Electronic
mail, SMTp,
FTP Commands and Replies, WWW, SNMP, Addressing Schemes, Uniform Resource
Identifiers.

Module V: 9 lecture hours

Principles of Cryptography, Symmetric key, public key, Authentication protocols, Digital
signatures, Firewalls, Security in different layers: Secure E-mail ssl, Ip
security, Advanced
Topics in CN: Dark Net, CASS: Content-Aware Search System, Service_centric
networking,
Software-defined networking, croud systems: Services, Data centre, 4c and
5G Networks,
Body area sensor Networks, Satellite networks, SWARM networks.
)
Text Books :
I Forouzan 8.A., Data communication and Networking (5th ed.), Mccraw Hi[, 202
r . ISBN
1260597822.
2. Tanenbaum A. S. and David J. Wetherall, Computer Networks (6th ed.), pearson,
2021.
rsBN 9780r37523214.

Refe rence ks:

Trollope, Data Communication & Networking (lst ed.), PEARSON INDIA. 2020. ISBN
978 r 48583253 5

Assessment Sch eme:

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

e r
($.
,i PiJ:Ieah)
i0, 11, Teclr Zue-ll
Grcatei" l! r; id:r-201310
 Name ofProgram Bachelor of Technology (Computer Science and
f,ngineering)
CSET209 Operating Systems L T P C
Owning SchooVDepartment Department of ComPuter Science 3 0 2 4
Engineering
Pre-requisites/Exposure

Cource Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To explain the structure and the services provided by the Operating System.
CO2: To define, restate, discuss, and explain the policies for scheduling, deadlocks, memory
management, synchronization, system calls, and file systems.
) CO3: To examine distributed Operating System, cloud computing, and Virtualization'

CO.PO/PS O ManDina

POl PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POt0 POI I PO l2 PSOI PSO2 PSO3

cot 3 3 2 1 3 2
co2 3 3 3 3 3
co3 2 3 3 2 3

1=weakly related 2= moderately related 3=strongly related

Course ontents:

glecture hours
Module l:
Operating system: Organization, abstraction provided by OS, features and roles' OS
evolution,Operating sy.iem architecture, OS examples; Process management: Process control
block, system calls and interrupts, context switching, schedular and dispatcher, process states
) and life cycle. multithreading. kernel vs. user level threads, process vs. thread; CPU scheduling
algorithms: FCFS, SJF, STRF. priority, round robin, multilevel queue and feedback
scheduling, highest response ration next, lottery scheduling.

Modulo Il: 12 lectur€ hours

Memory management, techniques, Contiguous: Fixed and variable length partitioning, Non-
contiguous: Paging, translation lookaside buffer (TLB), multilevel paging, segmentation,
segminted paging; Virtual memory, dynamic loading, demand paging, page fault, thrashing,
Pale replacemini algorithms: First in First Out (FIFO), Least Recently Used (LRU), Optimal
Page Replacement; File organization, access mechanism, file allocation methods - Contiguous
allication, linked allocation, indexed allocation, Indexing techniques: Single indirect block,
double indirect blocks; Storage management, storage devices - HDD, SSD; disk architecture,
disk performance metrics; Disk scheduling algorithms: FCFS, SSTF, SCAN, C-SCAN, LOOK,
C-Look. NOOP and deadline schedular.
 Module lll: 12 lecture hours
Distributed systems, network vs. distributed oS, robustness analysis, design issues; Remote
procedure call (RPC), structure, parameter passing, handling pa,tial failures, SunRpc
and
xDR; Distributed file systems, Servers: stateless and stateful, REST; Distributed shared
memory, architecture, design principles, consistency model; Security systems calls,
authentication & authorization, reliability, availability & privacy, common attacks, crypto
systems, Kerberos, access control lists; OS design: MAC, and iOS; Virtualization: Types,
models; cloud computing, architecture, service and deproyment models, cloud challenges.

Module IV: 9 lecture hours

lnter process communication, shared memory method, message passing method and its types;
Process synchronization. critical section problem (cSp), synchronization constructs, hardware
solutions to csP- Lock variables, software solutions to CSp-peterson solutions, strict alteration;
classical synchronization probtem: Producer consumer problem, dining philosopher problem,
reader writer problem, monitor; Deadlock, necessary condition for deadlock, deadlock
handling mechanism: prevention, avoidance, detection; resource allocation graph, deadlock
) recovery.

Text Books :
l. Silberschatz, A., Galvin, P.B. and Gagne, G' Operating System Concepts (lOth ed.), John
Wiley,20l8. ISBN 978-l-l l9-32091-3 .
2. Stallings w., operattng systems Internals and Design principles (9th ed.), prentice Hall,
202 l. ISBN 97 8-013467 0959

Reference Books :
I Tanenbaum A. S. and Herbert Bos, Modern Operating Systems (lst ed.), pearson,202l
ISBN 9789332575776.

Assessm ent Scheme:

Components lnternal Assessment Mid Term Exam End Exam fotal

Weightage (o/o) 45 20 35 100
)

. Clnr:.i,r:'I\!oida
:1. I,-. -,;i t'l tr .,r i, rrj :h)
t::, i'-li_ Ir.. ,',

iriot ij.r':. U, i.r, I I, lbclr Zorre-ll

(:;:aie i- I l:l:.la ,2013',10
)

Semester V

R
B ett [.Jniver. i
([rslirb]rs reaicr ll
,l: liJ.l-il.
PIot I,Jo':r i.l ): t1, ci
-le Ltit,:r
Giea ler fjo ,!)
''lo, 11 ,
I
cir 1.
e-:.013.1 0
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET3OI Artificial Intelligence and Machine L T P C
Learni
Owning School/Department Department of Computer Science 3 0 4 5
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On cornpletion of this course, the students will be able to:

COI: Articulate various supervised and unsupervised rnachine learning approaches.

CO2: Build and evaluate models generated from data.
co3: Implement systems to solve rear rife probrem using Al and Machine Leanring
approaches.

co- M aDDlns

POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 t0 POI
PO I POl2 PSOI PSO2 PSO3
cot 2 3 2 3 3 3
co2 2 3 3 1 3 2 3
co3 3 3 3 3 3 3 3 3

l:weakly related 2: moderately related 3:strongly related

Cou rse Con ts:

Module 1: E lecture hours

Designing a learning system, Types of machine learning: problem based leaming,
Supervised
leaming, Unsupervised leaming, Reinforcement learning, Linear Regression: Weights
and
Features, Applications, Cost Functions, Finding best fit line, Gradient Descent Algorithm:
Leaming Algorithm, First order derivatives, Linear regression using gradient descent,
) rate, Logistic Regression, Sigmoid Function, Cost Function
Leaming
for Logistic Regression, Multi-
class classification, Probability Distribution, SoftMax Function, polynomiar Regression,
Performance Metrics: classification (confusion Matrix, Accuracy, precision,
Recal, Fl-
score, ROC-AUC), Regression (MSE, MAE, RMSE, R2 Score).

Modulo ll: T lecture hours

Decision Tree, Selecting Best Splitting Aftribute, CART (Gini Index). ID3 (Entropy,
Information cain). Hyperparameters in Decision tree, Issues in Decision tree leaming.
overfitting and Underfitting, Bias and Variance, cross validation. Ensemble Leaming
(Concord's Theorenr), Bagging. Bootstrap and Aggregation, Randonr Forest.
Boosting,
AdaBoost, Gradient Boost. Feature Engineering, Feature Selection, Feature Extraction.

Module Ill: 9 lecture hours

fro
/" l.r',ia
. :.,::h)
a;1.:t-il
 Artificial Neural Network, Neural network representation, Perceptron model, Stepwise v/s
Sigmoid function, Multilayer perceptron model, Matrix Calculus (Jacobian, Hessian Matrix),
computation Graph, Backpropagation Algorithrn, Activation Functions. Stochastic Gradient
Descent. Batch Gradient Descent, Mini-Batch Gradient Descent, Vanishing and Exploding
Gradients, Overfitting Problem, Regularization (Ridge, Lasso, Elastic), Dropout and Early
Stopping, Bayesian Learning: Bayes theorem and concept learning, naive Bayes classifier'
Gibbs Algorithrr, Bayesian belief networks, The EM algorithm, Support vector Machines,
Hyperplane, Support Vectors, Kernels, Non-Parametric Regression, Locally weighted
regression, K-nearest nei ghbour.

Module IV: 7 lecture hours

Unsupervised learning (clustering, Association rule learning, Dimensionality reduction)'
common distance Measures, k-means clustering, Elbow method, Hierarchical clustering -
agglomerative and divisive, Dendogram, Similarity measures for hierarchical clustering,
DBSCAN, Cluster Quality (R index, silhouette coefficient), Dimensionality Reduction,
principal component Analysis, Singular Vector Decomposition, T-dislributed Stochastic
Neighbour Embedding.
)
Module V: I I lecture hours

Population Based Algorithms: Genetic Algorithm, Fitness Function, Selection, Crossover'

Mutation, Swarm Optimization, Particle Swarm Optimization, Ant-Colony Optimization'
Reinforcement Learning, Actors, State, Reward Policy, Actions, Computer Vision'
convolutional Neural Networks, Deep Leaming for Sequential Data, Reculrent Neural
Network, LSTM, GRU, natural Language Processing, Word Embeddings, Transformers
(BERT and GPT), Building and Deploying ML models (MLFlow), MLOps, Need of MLOps'
ML Production lnfrastructure.

Text ks:
I MitchellT.M..MachineLearr?i/ls(lsted.),McGrawHill,20l7'lSBN978-125909695 2.
2 Alpaydin E., lntroductksn to Machine Learning (4th ed.), Phi, 2020' ISBN
978-
81203s0786

Referenc e Books :
) I Oswald Campesato, ArtiJiciat Intelligence, Machine Learning, and Deep Learning (l st
ed.), Mercury Learning & lnformation, 2020. ISBN 97 81683924665 '

Assessment Sc eme:

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (%o) 45 20 35 t00

9u
/
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET3O2 Automata Theory and Computability L T P C
Owning School/Department Department of Computer Science ) 0 2 4
Engineering
Pre-requisites/Exposu re
Course Ou mes (COs)

On completion ofthis course. the students will be able to:

COl: To articulate Chornsky hierarchy, and different languages and grammars.

CO2: To design machines and develop efficienl mathematical models for real-life problems.
CO3: To examine computational cost and cornplexity for computer-based problems.

CO-PO/PSO Mannins

POt P()2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 PO POl2 PSOI t)so2 PSO3
.,
col 2 3
c02 3 3 3 2 3 3 3
co3 2 3 3 , 3 3

I =weakly related 2: moderately related 3=strongly related

Cource Contents:

Module l: 12 lecture hours

Introduction, Sets, Relation, and Functions, Mathematical Logics, Formal Languages,
Language Classification, Finite Automata: Finite State Machine, DFA, NFA, epsilon-NFA,
Equivalence between NFA to DFA, Equivalence between epsilon-NFA to DFA, Minimization
of DFA, Regular Language. Regular Expression, Regular Expression to Finite Automata,
Finite Automata to Regular Expression. Arden's Theorem, State Elimination Method, Pumping
Lemm4 Closure Properties ofRegular Languages, Decision Properties ofRegular Languages,
Finite Automata with Output, Mealy Machine, Moore Machine, Equivalence between Mealy
and Moore Machine, Propefties and Limitation of FSM.
)
Modulo ll: 9lecture hours
Context Free Grammar, Context Free Language, Regular Grammar, Left and Right Associative
Grammar, Left Derivation and Right Derivation, Removal of Ambiguity in Crammar,
Normalization of Grammar, CNF, GNF, Deterministic Push Down Automata, Non-
Deterministic Push Down Automata, Comparison between DPDA and NPDA, Pumping
Lemma for CFG, Closure Properlies of CFG, Context Sensitive Crammar.

Module lll: I I lecture hours

Turing Machine: Definition and Design, Church-Turing Thesis, State Transition Diagram for
Turing Machine, Un-restricted Crammar, Universal Turing Machine, Combining Turing
Machines, Variations of Turing Machine, Multi stack PDA, Multi-tape TMs, Single sided
infinite tape TMs, Non- deteministic TMs, Multi-head TMs, Post Correspondence Problem,

W.
I
" ri.lrr:l-t:r

.ri:l 'l
 Halting Problem, Enumerability of TMs, Acceptability of TMs, Decidability of TMs, Rice
Theorem, Chomsky Hierarchy, Diagonalization,

Module IV: l0 lecture hourc

Computational Complexity: The concept of a reduction, p, Np, and Np-completeness, Np-
Hardness, The Cook-Levin Theorem, Space Complexity Classes (pSpACE and NpSpACE),
Probabilistic state Automaton, Markov chain Model, probabilistic Turing machine, cellular
Automata. Quantum Computing.

Text Books :
1. LinzPeter, An Introduction to Formal Languages and Automata (6th ed.), Jones & Bartlett
Leaming, 2016. ISBN 978 1284077247.

2. Sarkar Bikash Kanti and Ambuj Ktmar, INTRODUCTTON TO THEORY OF

COMPWATION (lst ed.), The Orient Blackswan,20l9. ISBN 9789386235757

Refercnce Books :
) l. Wigderson Avi, Mathematics and Computation A Theory Revolutionizing Technologt and
Science (lst ed.), Princeton University Press,20l9. ISBN 97E-0691 189130.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

e r
B ctt Un rversity, Greaier Noida
(Eslabjl.Ir.J t h,, '.1/'..12.,
oi Go vt, ol Uitir pradesh
P lot No's u, 9, 10, 11,
Tech Zone- il
G reate I lici da-701310
 Name of Program Bachelor of TechnologY (Computer Science and
Engineering)
CSET3O5 H h Performance Computi I, T P C

Owning SchooUDepartment Department of Computer Science 0 z 4

Engineering
Pre-requ isites/Exposure na

Course Ou mes (COs)

On completion ofthis course, tlte students will be able to:

COI: Compare and Anatyze data parallel and task parallel algorithms and their serial versions
for searching and sorting tasks on matrix, tree, and graph data structures.
CO2: Explain distribuGd memory, message passing modelling and mapping of parallel
programs to physical processors.
bO-3: Implement seriil and parallel algorithms for different applications using HPC libraries.

CO.PO/PS O Manninp

POI P()2 P03 PO4 PO5 PO6 PO7 PO8 PO9 POt0 PO POl2 PSO I PSO2 PSO3

col 3 2 2 2
cC)2 2 3 2 3 2
co3 3 3 3 ) 3 2 3

l:weakly related 2: moderately related 3:strongly related

Course Co ntents:

Module I: 6lecture hours

why High Performance Computing, Applications of High Performance computing, Parallel
programming Software platforrns, Cloud computing, Grid computing and Cluster computing,
Multi-core CPLJs, Graphical Processing Units, SISD, SIMD, MISD, MIMD' Communicatiol
architecture. Shared memory, Cache memory, Virtual memory, Data parallelisn, Task
parallelism, Bit-level parallelism, Instruction-level parallelism, concurrency, Decomposition,
Mapping.
)
Modulo lI: 13 lecture hours
PRAM, NUMA, Multithreading vs Multiprocessing, Shared memory model, OpenMP'
Distribured memory model, Message passing interface, computalional graph, Multithreaded
DAG model, Brent's theorem, Work optimality, Weak scaling, Dependencies in code, Data
races, Race conditions, Sync and Spawn, Paraltel for loops, Parallel merge sort, Parallel bubble
sort, Parallel shear sorl, Parallel quick sort. Comparatol networks, Bitonic sequences. Bitonic
splits, Bitonic merge, Bitonic sorl.

Module III: I t lecture hours

Parallel prefix scan, Prefix scan Application, Parallel list ranking, Parallel tree processing,
Parallel independent sets, Parallel tree traversal, Parallel tree level finder, Parallel Euler tour,
parallel BFS, Distributed memory and Message passing networks, Broadcast, Reduction,

q/,,
 Parallel Prefix Sum, Scafter, Cather, Network topologies for parallel computing,
Network
optimization.

Module IV: 12 lecture houm

Distributed BFS, Graphs and adjacency malrix, Matrix based BFS, cuDA programming, para[el
matrix operations, Sparse vs Dense matrices, BLAS, LApAC, Cluster Computing, Job Scheduling,
Load Balancing, Resource Allocation, Code optimization, Memory management for parallel
computing, Distributed memory sorting, Graph partitioning, parallel graph operations,
Advanced research topics and tools in Hpc, SLURM, LSF, InfiniBand, libraries for
Cloud
HPC, OpenaCC, Docker, containers and Kubemetes, Shell, power Shell.

Text Books :
l. Robey Robert and Zamora Yuliana, paralter and High performance Computing (r ed.),
Manning, 2021. ISBN 9781638350385, 1638350388.
2. Sterling Thomas, Maciej Brodowicz and Maflhew Anderson, High performance
Computing: Modern Systems and practices (l ed.), Elsevier Science, 2017. ISBN
97 801242021 53, 0t 24202t 52.
)
Referen ce Books :
I Fidanova Stefka and lvan Dimov, Advances in High performance Computing (l ed.),
Springer, 2020. ISBN 9783030553477.

Ass ment Sc e:

Components Internal Assessment Mid Term Exam End Exam otrl

Weightage (7o) 45 20 35
r 00

Reg r
Ben Grester Noida
([!lnir i- t 0i
r,\ 1J ri rr iir.tic!h)
.'-!1\,, .'' r/.,,r
.,, lU, l l fi,' r .-l' r. : ,. - li
'li h;r:iC:-10 l3 i
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET303 Seminar on Special Topics in Emerging I, T P C
Areas
Owning SchooUDepartment Department of Computer Science 0 I 0
Engineering
Pre- req u is ites/E x pos u re

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI: To articulate speech preparation and presentation techniques, audience awareness and
self- awareness along with the cultivation of self-confidence.
CO2: To examine the ability to present scientific material in visual, written and oral form
including the formulation of an effective presentation on a topic in the Computer Science
domain.
) CO3: To explain an ability to listen to a scientific presentation with the discussion of the
strengths and weaknesses ofa speaker's presentation.

CO.PO MaDDine

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 PO| | POl2 PSOI PSO2 PSO3
col 2 2 2
.,
co2 3 3 3 2 3
,,
c03 2 2 3 2

l:weakly related 2: moderately related 3=strongly related

Cource ontents:

Module I: l4lecture hours

Importance of seminars/presentations in undergraduate studies. Introduction presentation with
extemporaneous delivery approach (include information on likes/dislikes, hobbies, family,
) career goals, etc.) Experiencing the problems oftalking in front ofpeople, Understanding body
language. Considerations when preparing an oral presentation - audience, purpose,
organization, flow, style. Presentation delivery approaches, Importance of visual aids,
Designing effective presentations. Demonstration/How-To Speech - valuable information to
the audience by demonstrating a process via visual aid. Infomative speech/Speech of
Explanation - original concept, policy, idea, or person, location or event to inform the audience
about it via visual aids. Persuasive Speech - establish a problem with references and offering a
solution via visual aids. Language of presentations: Explaining the title, outline, and summary,
Explaining the background, problem, materials, methods, and processes, Explaining and
discussing data in the form offigures and tables, Understanding and answering questions from
the audience and Final presentations.

Text Books :

^.rM
P,c .,11,l'.1..::.i-. ( i,L.:i.rr I'toiciJ
I ( -,. . : , ., (.:.::prJ,:csh)
i, ,:...,r,, i,.). Ii, Tcclr Zonc-li
C, .;:ll:ri i.l,r jia,30'l310
 l. Geraci Angelo, Special Topics in ldormdtian Technologt (lst ed), Spring€r Internalional
Publishing 2021. ISBN 9783030624765

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam TotBl

45 20 35 100
Weightogo (7o)

,t

t
ter Noida
Ufiar Pradesh)
ch Zone-ll
Greater Noida-201310
 Name of Program Bachelor of Technology (Computer Science
and Engineering)
CSET304 Competitive Programming L T P C
Owning SchooUDepartment Departmenl of Computer Science 0 0 4 2
Engineering
Pre-req uisites/Exposu re na

Course Outcomes (COs)

On completion of this course, the students will be able to

COI: To be able to solve a complex problem in given deadline in a cotnpetitive setup.

C02: Find optimal solution by implementing rnost suitable algorithm.

CO-PO/PSO Mapoing

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO IO PO I'Ol2 PSOt PSO2 PSO3
,,
cor 3 3 3 3 2 3 3 1
) c02 3 1 3 3 3 3 3 2

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: 56 lecture hours

This course having multiple problems statements from the following topics in each Iab. Coding
Exercise and Mathematics; Basic Data Structures (Array); LinkedList, Searching and Sorting,
Stack and Queue; Bit manipulation. Divide and Conquer, Greedy and Dynamic Programming
(DP); Backtracking, Branch and bound, Tree algorithms; Combinatorial Games; Basic Graph
Algorithms; Shortest Path Algorithms and Network, FIow Problems; String Algorithms,
Randomized Algorithms, Approximation Algorithms, Ceometric Algorithms, Optimization
Algorithms, Game Theory, Online algorithms.

Text Books :
l. Laaksonen Antli, Competitiye Programner's Handbook (lst ed.), Springer, 2018. ISBN
) 918- 3319725468.
2. Laaksonen Antti, Guide lo Competitive Programming (lst ed.), Springer International
Publishing, 2020. ISBN 9783030393577.

Reference Books :
l. Diirr Christoph and Jill-J6nn, Competitive Programming in Python (lst ed.), Cambridge
University Press, 2020. ISBN 9781 1081 1 6826.

'' '- 1.,r i.l: ir-i'r

. . ;' l )
,.-,:.ir .:-.1:i:-!l
I ,.)
 Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 lo0

R eg I
Be Univers ity, Greater Noida
(Blablished U ndcrAct 24 oi Govt, of U ttar Pradesh)
Plot No's 8, 9, 10, 11, Tec h Zone-ll
G reater Noida-201310
 VI
)

Semester

R trar
Eennett University, Greater Noida
{Esl6bl;:.hed UnderAct24 otGovt. ol Ltltar pradesh)
Plot No's 8, 9, 10, t1, Tech Zone-il
Greater Noida-20131 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET306 Undergraduate Research in Computer L T P C
Science f,ngineerins
Owning School/Department Department of Computer Science 0 0 I
Engineering
Pre-req uisites/Exposure

Coqrse Outcomes (COs)

On completion ofthis course, the students will be able to:

col: Build sufficient background and contextual knowledge by conducting a thorough

literature search.
co2: Make use of knowledge gained from literature to identify the gaps in the present study
to consluct the research goal(s)/question(s) and execute the study.
)
Co3: write a coherent scientific report/research paper including context, methods. discussion.

co- Mannins

POI PO2 POI PO4 PO5 PO6 PO7 PO8 PO9 PO t0 PO PO t2 PSOI PSO2 PSO3
col I ", 3 3
c02 I 2 3 3
c03 I 2 3 3

l:weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: 14 lecture hours

Importance of know-how of research in undergraduate studies. Formulating the Research
Problem, Provide a brief description of past research related to a study, Explain the connection
of current research/work to this past research, State research goal and questions under each
) goal, Describe the research methodology and data collection plan, statistical test performed on
the data, coding procedures performed on the data to prepare them for analysis, results of the
study with visual description, limitations ofthe study. Future work, conclusion as implications
ofthe results: What impact do they have on anything in the world?
other responsibililies include time management (monitoring speakers' times) and moderating
the question/answer period.

Professionalism: All students enrolled in this course are graduate students (apprentices) irr a
chosen field of study. As such, you are considered to be professionals. you are expected to
conduct yourselves in a professional manner by meeting all course expectations (deadlines)
as required and without the need for constant reminder.

T ext Books :

il
l)
C;
 1. Robson Colin, How to Do a Research Project: a guide to undergraduate students (l ed.),
Wiley, 201 6. ISBN 9781 I 1 8691326.

Reference Books :
L Developing Your Research Project httns;//www.futureleam.com,/courseVresearch-oroiect
2. Understanding Research Methods https:/www.coursera.org/learn/researoh-methods

Assessment Scheme

Componerts Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

Plot No
Greater
 Name of Program Ba c h eI or o f Tech rl ol ogy ( om p u te r Sc te nc e a nd E ng I D e er n
c c)
CSETIOS Environment & Sustainibili ty L T P C
Owning SchooUDepartment Department of Com puter Science Engineerin 3 0 0 3
Pre-req uisites/Exposure

Course Outcomes (COsl

On completion ofthis course, the students will be able to:

COI: Demonstrate analyical thinking skills conceming environmental topics .

co2: Demonstrate an ability ro combine the many disciplines and fields that intersect wilh
enyironmental concerns.
co3: Illustrate an integrative approach to environmental issues with a focus on sustainabilitv

co- P S0 Maonins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POr POI PSO PSO2 PSO3
) 6 7 8 I 0 I 2 I
cot 3 2 3 2 ., 1 2
co2 2 1 2 3 2 2 I
co3 3 3 3 2 3 2 )

l:weakly related 2: moderalely related 3:strongly related

Course ontents:

Module I: 6lecture hours

Environmental sustainability, ecosystems and climate change: Introduction to environmental
sustainability, sustainability and population growth growth cuNes way forward Ecosystems
-
and climate change introduction - Ecosystem dynamics Tragedy ofcommons - Tragedy oi
- -
-
commons solutions - Ecosystems and extinctions weather vs. climate climate changes in the past
- -
- Climate change in the present - Climate processss.
Module I1: slecture hours
) Biodiversity - Value of biodiversiry _ Threars ro biodiversiry
Fild-,:-.1:il_ ryA
Lonservalron il,,:9,!:..lurlo1
ol t,lodtverstty
_
- Case studies.
Module lll: g lectures hours

natural resources: natural resources - Associated problems with natural resources .renewable and non-
renewable energy - water and Agriculture - Agriculture and Food problems and solutions.
-
Module lY: g lectures hours

Environmental pollution: causes, effects and control measures ofvarious types ofpollutions - Air
pollution - water pollution - wastewater treatment - Soil pollution - Noise pollution - Thermal
pollution - - Solid waste management - E-waste - Case studies on pollution.

Module V: 7 lectures hours

Reg ar
!lr i i l:r'., t',.
iri .,',, i-,.), . r,'i i, i,--
.i
4.. i il. i-i:: i- i, ::t '1 0
 Environmental ethics and policies: Environment ethics Global policies Environmental laws
-
in India Environmental impact assessment lssues involved in- the enforcement of
- -
environmental legislation.

Module VI: g lectures hours

Life cycle analysis and sustainability thinking: Introduction of LCA

ISO 14044 Significance ofLCA
- Methodology of LCA -
- Case studies ofLCA _

Text Books :

l. Bharucha Erach, Textbook of Environmental Studiesfor lJndergraduate gourses (2nd

ed.),
Universiry Press, 201 3. ISBN 978-8173718625..
Reference Books :

I . Lodkh Hanqt,Arnold Berlc,Lawrence Zipursky,Paul Matsudaira,Dqvid Baltimore and Jomes

Darnell, Molecularcell Biolog (8h ed.), W.H.Freeman, 2016. ISBN g7S- t319067248_

) Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exrm Total

Weightage (%) 35o/o 30o/o 350/o l00o/o

Bc Unive rsi ty, Greater Noida

(Esiabiish€d Unrl .rAci:
I ol coyl, of U(ar prad€sh
Plot No's 8, 0, 11, Tech Zone- il
Greater Noi d a-201310
 Name of Program Bac h e I or o f T ec h n o logy (c om p u te r s clen ce an d E ng n ee rt n
c)
csET399 Summer lrternshi L T P c
Owning School/Department De pa rt m e n t o f C om p u te r Sc te n c e E ngl neer n g 0 0 0 0
Pre-req uisites/Exposure

Cours e Outcomes (COs)

On completion ofthis course, the students will be able to:

col: To gain a better understanding ofthe workprace and deveroped and demonstrated
workplace
competencies necessary for professional and academic success.
CO2: To clari$r career preferences and professional goals.

co- PSO Ma DDINS

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POt PSO PS02 PSO3
I 6 '7
8 9 0 I 2 I
col 2 3 ) I I 3 3 I 2
) co2 2 1
I .,
3 3

l:weakly related 2= moderately related 3:strongly related

Course ontents:

Module l: 0 lecture hours

summ€r intemship program arrows students to gain practical experience in the

workprace before
iving undergrad-uate degrees. The studenl ide;tifies companies willing to Hre
ttl_,rtre. on a
turl-trme ,their
:e:,e
basrs tor an 4-8 week period. A basic premise for this course is thit
career-related work
experiences during graduation benefit students by ;[owing them to gain
comfort and confidence in.lob
performance and job search skills, explore compatibiliry- with spe"cific
become more mature professionaly_. students wir gain an understanding
careers and
""rilri;r; ;;;
or *orr.pru""'
professional exp€ctations, and the influence of curture-on both. Buird proficiin"y
ayru-i".,
r, u .ung"
or.industry skills appropriate to lhe.fierd ofthe intemship pracement, incrudingprofes.ii.,ur
orl^ir"r,
una rni"i-
cultural communication through written, verbar, and non-verbar means.
RefinJand crari! professional
and career goals through critical analysis ofthe internship experience '
or research project.

) Asse ssment Sc heme

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 35% 30o/o 35o/o l00o/o

1-,
(/,,;, 1, r:t . I ii

P jor t. i,'
o'.-
Gi'eater-ii ,. ,_ _,
, :;ir:l':' l,;t1:.1f,
, teCh ZOlte-l,l
r r
 Semester VII
J

E"Mu n u.r ritv, c re ate r N o id a

r,si$:s"'a':'a:l'a',ttrt*t*r;iPlr
Greater Noida-201310
 Name of Program B a c h e lo r of T ech n ol ogy ( o m p u te r Sc te n c e
c a d E n gt n ee rt n s)
CSET4OI Ca ne Pro ect L T P C
Owning SchooUDe partment c
D e pa rtm ED o f om p u te r Sc tence E n gr n ee rt n
0 0 l0 5
Pre-requisites/Ex posure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: Finalize the Capstone project problem which is ofthe level

of representative ofthe
Undergraduate work.
co2: Evaluate the proposar keeping in view the different slakehorders
incruding potential customers
and market analysis.
CO3: Assess the idea from feasibility, scope, timeline and
delivery point ofview

CO-PO/PSO Mappins

) PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POr PSO PS02 PS03
I 6 7 8 9 0 I 2 I
col 3 2 3
co2 3 2 I 3
co3 3 2 I 3

l:weakly related 2: moderately related 3:strongly related

Cou rse Con nts:

Module l: I40 lecture hours

Inilial Milestones ofthe Capstone Project should be completed
in this course. ln lhis semester students
should- have a fulr understanding of the probrem he is working upon
and shourd be abre to do a, the
preliminary analysis and documentalion required for
capstonei student should be able to discuss with
potential stakeholders about the viabirity, risks and
opportunities associated with the project. He shourd
also assess it fiom the point of view of scope and rimltations,
so that it can be compreted in time with
desired functionaliries. students wir be discussing
the proposed project with the instructors and iterate
to make it more optimistic and workable for the issuing
facing the society.

As t Scheme:

CompoIlents Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 35o/o 30% 350h 1000/0

t;]r
Be () ii I.lr::,,r::r:il,r. (ilii. a ier Ncida
lErllli,.rlj::J Li .li:, !, ;ll. .rl . ,i.'i. 1rl l-lLiirl 3i!'ieth)
-l-ech
i,lot tlo's tJ, 'J, 1il, 1 l, Zone-ll
Greater li,:iCa-20'l 31 0
 VIII
)

Semester

_)

e rar
Be ett Uni,/ersity, Greater Noida
(Btablished U:rdJrAct:4 oIGovl. cf ULldr Pradesh)
Plot No's 8. 9. 10, '11. Tech Zone-ll
Greater Noida-201 310
 Nam€ of Program Bac h e o r of Tec h n ol ogy (c o m p u t er Sc I en ce a Il d E n gln eer ln g)
CSET499 lnd ust rt a Proj ecV R& D P ro e cl/ s ta rt p L T P C
Pro ect
Owning SchooUDepartment De partment of Computer Science Engineering 0 0 2 t2
4
Pre-req uisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: ldentification, formulation and analysis ofthe existing problem in the (non-automaled)
workflow for performing a specific task. Design and implementation ofthe automated
solutions for
the assigned,/identified real world problems.
co2: Technical repon writing. practice and further deveropment of skilrs in time
management and
reporting within an industrial or research laboratory setting.
co3: contribute to an ethicar and professionar work cutture and to ream to work
in diverseteams.:
Integration and application ofknowredge and skirs acquired in
earlier course work

CO-PO/PSO Mappins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POt POI PSO PSC)2 PSO3
I ,7
6 8 9 0 I 2 I
col 2 ) , 3 3 2 , 3
co2 2 , I a 1
c03 3 3 3

l=weakly related 2= moderately related 3=strongly related

Cou rse Con ts:

Module I:
336 lecture hours
The purpose of the project semester is to further develop the
understanding rerated to the
implementation, design and theorelicar aspects ofthe computer
science and its apprication to the
practical problems. Many ofthe subjecls that a studenr had
studied in the university have a direct
) impact on what the student wir be doing in the software house / industry.
Student extend wi
and deepen the knowledge ofthe computer science whire working.
Student wiI be reaming whar
it's like to be part of a workforce: how to deal with the ferow workers,
including your bosses;
how to take suggestions, (including criticism): how to contribute in
the team. and so on. lmmersed
in this absorbing and exciting worrd, it's easy to lose sight
ofthe academic worrd. but remember
that the project semester is realy part of your university education.
computer science
Engineering department has developed several leaming outcomes
for it, and deparlment will
evaluate a student based on these tasks and goars to see how we
a student has achieved the
leaming outcomes. There are few points to worth about the ofthe
semester project, which are as
following:lt is the largest single piece ofwork you will do during your
degree course.lt is the part
ofthe curriculum that allows you to specialize in a topic you are good at or
enjoy.lt allows you
to show off a wide range of the ski,s and knowredge rearned during your
course.rt encourages
integration of material leamed in a number of course units.lt gives you
an opportunity to leam

R egr

Pi
Grcate
 higher level of project related skills as given in the leaming outcomes for project semester. A
company involved in developing Websites, Mobile Apps, Business applications, Societal
applications in different domains of Computer Science Engineering.Company / Academic
Institution/ research institute must dear in the software related projects.work assigned having
a
profile of system analyst, Tester, euality Analyst, Data Scientist, Data Analyics, programmer,
Software Engineer or similar is acceptabre.student must not opt for the profire related to sales
or
marketing.student may opt for startups.project must be related to the phases of software
development life cycle.hojects having some research insights will be appreciated.No Self-
certification or online training courses will be considered as a substitute of project
semester.However, these can be good value additions to the real industry projects
and may add
value to your assessment.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Totel

Weightage (%) 35o/o 30o/o 35o/o lOOo/o

)

1_
j
(EJ t; Gre: lrl r Noida
Plot lJ o ir6,9 CJvi of U rl ?t Piedea
10, I I. i6 ch
Greater i'j oida -201
h)
Zon e-ll
310
)

Specialization
Core I and II

R
Ben ti Lliriversity, Gie.rtcr Nlcida
(EsiabIilh ed U,rdliAcl 2,i ol
{trrl t) I lU -.r F.,i.:h)
Plot No's B, C, 10 11 , 'fech Zone-ll
G reater fioida-20131o
 Name of Program Bachelor of Technology (Computer Science and Engineering)
ECSE2I9L Statistical Machine Learning L T P c
Owning SchooUDepartment Department of Computer Science Engineering 3 0 2 4
Pre-requisites/E xposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: Understand key features of Statistical Machine Leaming .

CO2: Decide, formulate, design, and implement giyen application as statistical machine leaming
problem
CO3: Implement common statistic techniques and evaluate them using relevant metrics.

C0-PO/PSO Maooinp

PO Po2 PC)3 PO4 PO5 PO PO PO PO POt POt POI PSO PS02 PSO3
I 6 7 8 9 0 2 I
cot 2 3 3
co2 2 3 3
,,
co3 J 3

l=weakly related 2: moderately related 3:strongly related

Course ontents:

Module l: l0lecture hours

Statistical Principles: Maximum Likelihood, Bayesian Inference, Minimax Strategies, Methodology
Analysis: Parametric vs. Nonparametric Approaches. Bayesian Fmmework: A Comparative Study
of Bayesian and Non-Bayesian Approaches, classification, regression, density estimation.
Convexity and Optinrization: Convexity. conjugate functions, unconstrained and constrained
optimization. KKT conditions.

Module Il: lolecture hours

Introductory supervised learning, Concentration inequalities and generalization bounds, plugin
) classifiers. the perceptron algorithm and single-layer neural networks. Peature maps and the "kernel
trick", Theory ofgeneralization, Vapnik-Chervonenkis (VC) dimension, VC generalization bounds,
least-squares, regularization.

Module III: I I l€ctures hours

Sparsity: High dimensional data and the role of sparsity. basis pursuit and the lasso revisited.
sparsistency, consistency, persistency, gleedy algorithms for sparse linear regression, sparsity in
in graphical rnodels, compressed sensing. Explorations in
nonparanretric regression. sparsity
Nonparanretric Approaches: Nonparametric Regression and Density Estimation. Nonparametric
Classification Techniques. Clustering and Dimension Reduction in Nonparametric Methods,
Manifold Melhods in Statistical Analysis, Spectral Methods: Unveiling Pattems in Nonparametric
Data. The Boolstrap and Subsampling Applications, Nonparametric Bayesian Frameworks.
 Module IV: l l lect[res hours
Advanced rheoretical concepts: concentration of Measure in Advanced statistical rheory
covering
Numbers: A Deeper Dive into statisticar Anarysis, Leaming Theory: Exploring Advanced principlel
Risk Minimization Strategies in Statistical lnference, Tsybakov Noise Conditions: Advanced
lnsilhts.
Minimax Rates in Classification and Regression: A Theoretical Exploration, sunogate loss functions.
computation: The EM Algorithm, simulation, variational methods, regularization path algorithms,
graph algorithms

Studio Wor k/Laboratorv Exn erimenls:

Students will gain practical experience with the inrplementation of different statistical
methods. The
students will be able to use different statistical machine leaming tools. Students will
be able to learn on
how to formulate the problem as a statistical machine leaming pioblem followed by i* implementation.

Text Books :
1. sugiyqmq Masashi, Introducrion to stcttislicql Machine Learning (r ed..), r[orgon Kaufruann, 20r7.
tsBN978-0t2802t2t7.
2. Hastie, T, Tibshirani, R. qncl Friedman J., The elenents ofsratisricctl learning:
data nining, inference
and prediction (2 ed.), Springer Science & Business Mediq, 2017. tSBN 9Zg_038781g570.

Reference Books :

1. Adler, J., R in q Nutshell: A Desktop euick Reference (l ed.), O'Reill\, Media, 2012. ISBN 9ZB_
9350239209..

2. Murplry, K., Machine Leorning: A probabilistic perspectiye (l ed.), MIT press, 2012. ISBN 97A_
02620t8029.

3, Gqreth James, Daniela wiflen, Trevor Hqstie and Robert Tibshirani, An introduction to srdtisticdr
learning: with applications in R ( I ed.), Springer, 2013. 1SBN 97g- 146 t 17l 370.

Assessme t Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (7o) 3s% 30o/o 35o/o looo/"

e lrat
Bl] il ett Llni,/c r5;ty, Greatcr
([sta].rli!i )a:J l): :::.)l t,.: : i , r'r Noi da
),,i -.J r-t iif p radesh)
Pht irj o's 3, 9, 1 0, 1i, tnch
L:, f ial er Ai0id -201h;.i
Z one-li
a a)
 Name of Program Ba c h el o r o f T ech n ol ory (C o m p u te r Sc re n ce a n d E n gr n ee rt n
c)
ECSE22I L Introduction to Blockchain L T P C
Owning SchooUDepartment D ep a rtm ent of Co m p u ter Sc ren ce E n gr nee r I n g 3 0 2 4
Pre-requisites/E xposure

C rse Ou mes / COs)

On completion ofthis course, the students will be able to:

col: Be able to understand fundamentars of brockchain and abre to

exprain cryptographic concepts
underlying blockchain technology in layman terminology.
Co2: Describe how cryptography applies to blockchain and impacts implementation-related
decisions
CO3: Describe blockchain technology, how il relates to the myriad of associated
technologies
and concepts (communication, consensus, architecture, identity,
among others). Create a
minimalist blockchain application.

CO-PO/PSO Mappins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POt POt PSO PS02 PS03
I 6 7 8 9 0 2 I
col 3 2 3
co2 3 2 3
co3 3 2 3

I=weakly related 2: moderately related 3:strongly related

Course Conten ts:

Module l: 6lecture hours

Introduction to Blockchain: Basics, History, Architecture, Conceptualization,
Blockchain
components, Bitcoin Basics, creation of blocks, Merkre
Tree, Gas Limlt, Transactions Trustless
system.s' Disruptive Technorogies, Advantages of Brockchain,
Decentrarization Benefits, Regulaof
Compliance, lnteroperability in Blockchain, lesring of Blockchain
Code.
Module ll: g lecture hours
Basic crypto primitives: Hash functions, puzzre friendry Hash,
collison resistant hash. digitar
signatures, public ltey cryptography Random Beacons, cryptographic
,) Hash Functions, ziro-
Knowledge Proofs, Homomorphic Encryption, Secure Uulti_pa6
Cimpuration.
Module lll: lOlectures hours
Distributed Consensus, Consensus in Bitcoin: the basics, proof of
Work (poW), proof of Stake
(PoS), PoW PoS. and Beyond, Miners in blockchain, permissioned Blockchain (Basics,
_vs
consensus), Permissioned Blockchain (RAFT consensus, Byzantine
General problem, practical
Byzantine Faull Tolerance). Bitcoin scripts.

Module IV: g lectures hours

Blockchain Architectures: public, private, Hybrid, Blockchain
for Enterprise _ Overview.
Blockchain Components and Concepls, Ethereum.

R
Be t Univerc;tY, G reaior Noida
oiU I F:odesh
lli.i!r r\il il cl (::o !l-i'eoh
(Esiiibli hed
Plot o's 8, 9, 10, 11, Zotre-
Greater Noida-201310
 Module V:
8 lectures hours
Decentralized Contracts, Achieving Turing Completeness in Smart Contract Languages, and
Addressing Verification Hurdles, Leveraging Smart Contracts
for Legal Agreement
Enforcement, comparing Bitcoin scripting vs. Ethereum Smaft Contracts.

Studio WorldLaboratorv Experiments:

ln this laboratory course students

wir rearn to imprement various cryptographic primitives such
as symmetric/asymmetric cryptosystems, digital signatures, and hash
functions. Further, students
will set up a MetaMask Ethereum waret in the web browser to create walets (user
Accounts)
and use it to send and receive Ethers. use Etherscan to view the
transaction detairs, explore
Blockchain test networks to perform transactions, execute smart contracts,
and launch Dapps.
This lab provides a platform to create a genesis brock to set up the private
blockchain network
using Go Ethereum (Geth) and Mist, start mining with miner. start0
command. In addition,
students will leam creating and deploy the simple smart contracts like .,Hello
World,,,
incrementing/decrementing the counter variable on the Blockchain
network.

) Text Books :
1 . Wqrburg Bettina, B illlltanger ancl Torn Serres, Bos ics of Blockchain ( 1't ed.), lndependentl,
publis hed 20 I 9. ISBN 978- I 0B9s I 9145.

Reference Books :

l. Anlonopoulos .lnd Andreqs M,, Mdstering Bitcoin: un!ocking digital

cryplocurrencies (l,,ed.),
O'Rei$,Media, lnc., 2015. 4SBN g7B- t 41937 404.1.

Assessm€nt Sc heme

Components Internsl Assessment Mid Term Exam End Exam Total

Weightage (o/o) 3s%o 300/" 3s% 100o/o

 Name of Program B a c h el o r of T ec h n ol ogy (C o m p u er Sc ten ce a n d E ng n ee rt ng)
ECSE223L Linux & Shell P rammtn L T P C
Owning SchooUDepartment De pa rtm en o f c o m p u te r S c I en ce E n I n ee rt n 3 0 2 4
Pre-req uisites/Exposure

Cours e Outcom€s (COs)

On completion ofthis course, the students will be able to

coI To articulate Linux commands that are used lo manipulate system operations at
an admin
level
c02 To write Shell Programming using Linux commands.
co3 To design and write applications to manipulate internal kernel-level Linux
File svstems

CO-PO/PSO Ma DDINS

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POr POt PSO PSc,2 PSC)3
6 7 8 9 0 I 2 I
col 3 3 3 2
,,
c02 2 3 3 3 3 2
co3 3 3 2 3 3 3 3

l=weakly related 2: moderately related 3:strongly related

Cou rse Contents:

Module I: E lecture hours

Linux Overview and Utility Commands, The Architectural Framework of Linux, Distinctive
Features
that Define Linux, Introduction to vi editor, Linux commands, Fire handring utilities,
security by fire
permissions' process utilities, disk utirities, Networking commands,
Text processing utilities, backup
utilities, User managenent.

Module II: l2lecture hours

Introduction to shells in operating
systems, purpose and significance of She s, overview of
Command-Line Interfaces (CLI), Types of shers: Boume sheu (sh1, Bash
sher (bash), C SheI (csh),
etc.. lnteractive vs Non-interactive Shels, Derived operators, Linux session, Standard
streams.
Redirection, Pipes, Tee command, command execution, command_line editing,
euotes, command
substitution, job control, ariases. variables, sher/environment customization,
rilteri, and pipes, Fire
operations.

Module III: 22 lectures hours

Definition and Purpose ofGrep (Grobar Regurar Expression print). searching and
Matching pattems in
Text. overvierv of Pattem Matching operations. crep cornmands. crep Address.
Grep Apprication,
Seed Scripts, operation, unix fire structure, Fire descriptors, System cars
and devici drlvers, File
management. File structures, system cars for fire management, Directory
Apr, process and process
Structure, Process table, Viewing processes, System processes, process scheduling,
zombie processes,
orphan process. Fork and its operation, Signars functions. unreriable signars.
interrupted system cu[s.
Signal sets, File locking, Threats and Vulnerabilities analysis of Linux- direct,
indiiect, veiled,
conditional, Security Measures in Linux-ssH key pair. scan Log fires . crose Hidden ports.
Linux
Malwares- Botnets, Ransomware, Rootkits, Socket, Sockel communications,
UDp, TCp, AWK, Shell
scripling and Security- Password rester. permissions and Access contror Lists, shelr
Scripting for

_ul ry
Iifgiq(rar
L.'qyqr, :,;,r,, L:r. -,1,_ Ncio,a
.
t( r:.) - l, .; ., r. : ,.]...Je.h)
i)i...rt l,l l.
c, ,r r;'; .i': '',i]',1 .r' :lr Zr' r'r-t;
 Devops- Using environment variables. Bash Script

Studio Work/Laboratorv Experiments:

students will use LINUX / UBUNTU to gain hands-on experience on LINUX
and Sher programming,
Linux commands. their uses and practice, editors: vi. nano etc. tntroduction
to sheil, shett basic
commands, variables Shell programming environments- filters and pipe, Shell programming
File
handling, Grep its use and commands. Using ofGrep with pipe and firters,
unix fire struituring, inodes
and related system calls. Fire handring commands una apt, Network penetration
testiil toors,
wireshark, Nmap, Hash cat, process management. creation. termination and other
useful
Process scheduling. Parent, zombie and orphan process, process system "orr-aunor,
calls. Fork, exec, wait and
signal. various commands. Basics of Socket programming via UDp
socket.
Text Books :
l. Ebrahim M. qnd A Mallett, Masrering Linux shel scripting: A practicar
Guide to Linux command-
Line Bash Scripting, and She (Znd ed.), pqckr publicqtion, 20 t A. ISBN 978_ 1788990i512.

2 Blun Richqrd qnd chrisrine Bresnqhan, Linax conmqnd Line qnd shel scripting
Bibre (r st ed.),
lltiley, 2020. ISBN 978 t t 19200930.

Reference Books :

l. Steyens 14.R., uNlX Network programning (3rd ed.), pHl publicqtiorc, 2017. ISBN 978_
8t 20307490.
2. Bqshir qnd lmran Mastering blockchain: "Disrribtnecr redger technorog/, decenrrarization,
and
smdrt contracts explained (lst ed.), packt publishing Ltd, 20t8. ISBN 978-lZgBBj9044.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 35o/o 30% 35Yo l00yo

#fl
aeat4trar
Bffelt University, Greater Noida
(Eslabi:hid UldcrA'-r 24 ot (jor,l. of Utlar Pradesh)
Plct Nos 8, 9, 10, 11, Tech Zone-ll
Greatei- Noida-201310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
ECSE225L Data Analysis using Python L T P C
Owning SchooUDepartment Department of Computer Science Engineering 3 0 2 4
Pre-req uisites/Exposu re

Course Outcomes (COs)

On completion of this course. the students will be able to

COI: Understand statistical analysis using Python

CO2: Understand probability distribution.
CO3: Understand statistical test.

CO-PO/PSO Maopins

PO PO2 PO3 PO4 PO5 PO PO PO PO POt POt POt PSO PS02 PSO3
'7
6 8 9 0 I 2 I
.,
cor 3 t 3
) cC)2 3 I 2 3
co3 3 I 2 3

I=weakly related 2: moderately related 3:strongly related

Course Contents:

Modul€ l: l4lecture hours

Python Data Analysis: Exploring Vectors, Factors, Lists, Matrices, and Data Frames. Creating Scatter
Plots in Python, Enhancing Plot Labels and Axis Text. Modifying Plot Characters (pch) from Circles
to Plus Signs. Fihered Data, Add text to the plot. Make plot colorful, and text bigger and bold, Multiple
pairs of scatter diagrams, Time Series Plot, Histogram, Box and Whisker Plot, Descriptive Statistics,
Desffiptive Statistics Using psych Package.

Module ll: l4lecture hours

Probability Definition, Probability - Union and Intersection, Probability - The Law of Addition,
Multiplication and Conditional Probability, Factorial, Permutations and Combinations, Central Limit
Theorem, Central Limit Theorem Demonstration Using Python, Normal Probability Distribution,
Python Functions for Normal Distribution - morm, pnorrn, qnorm and dnorm, Plotting Normal
Distribution Using Plthon Functions Explore Probability Distributions in Python, focusing on Binomial
and Poisson distributions. Master Python functions for computation and visualization, including
rbinom, pbinom, qbinom, dbinom, rpois, ppois, qpois, and dpois. Enhance your skills with the Visualize
Package, Advanced Probability Models

Mod[le lll: 14 lectures hours

Exploring Inferential Statistics; Understanding Mean and Variance Tests, Hypothesis Testing Strategies
Error Types, Significance Level (p-value), and lmplementation of One-Sample Z Test. Practical
Application of One-Sample Z Test with the BSDA Package. Introduction to One-Sample t Test,
Utiiizing the Visualize Package for Comprehensive Visualization of One-Sample t Test Results,
ANOVA Techniques for Multigroup Comparisons, One Sample Variance Test - Chi Square Test, One
Sample Variance Test Using Envstats Package, Chi Square Distribution for One Sample Variance Test.
Two Sample Z Test, Two Sample Z Test, Visualizing Two Sample Z Test Using Visualize Package,
Two Sample Z Test for Populations with Different Means, Two ple I Test (Equal Variance) Using

t^
t' : I /, a. i1,," l\lrt;Ca
l, .:rl ' LIL ijr li'lalli
,,1.,t ;. . . ii, l:uir Zorr:-li
Grr.'l:it,' N,.'l l:l :10 i 3'10
 Python, Two Sample t Test (Unequal Variance) Using python, paired t Test, paired t Test, Two Sample
Vaxiance Test Using F Test, Two Sample Variance Test (F Distribution, Visualizing Two Sample
variance Test Results using Visualize Package, understanding the concept behind ANovA without
doing any calculation, Formulas and calculations in ANOVA, ANOVA Example Using Manual
Calculations, Analysis of Variance (ANOVA), Contingency Table.

Studio Work/Laboratorv Er ents:

students will be working on Different Data Analysis Methods, Techniques, Algorithms using pyhon.

Text Books :

l. McKinney lles, Pythonfor Data Analysis: Data Wranglingwith pandas, Numpy, and lpyhon

(/ ed.), O'Reilly, 20t7. ISBN 978-149t957660. .

2. Klosterman, stephen, Data science Projects with Pyrhon: A case study Approach ro successful Data
Science Projects Using P (l't ed.), packt publishing Limited,20l9. ISBN g7B-tg38S5l02S.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exrm Total

Weightage (%) 35o/o 30% 35o/o l00o/o

Reg
Benn U niversity, Greater Noida
of ultar Pradesh)
Esiablishad Unde r Act 24 of Govt,
I' 10, 11, Te ch Zone-ll
P lot No's 8,
Greater Noida -201310
 Name of Program Bachelor ofTechnology (Computer Science and E ngineering)
ECSE227L G raphics& Visual Computing L T P C
Owning School/Department Department of Com puter Science Engineerin 3 0 2 4
Pre-req uisites/Exposu re

Course Outcomes (COs)

On completion ofthis course. the students will be able to:

col: Demonstrate various graphics primitives and 2-D, 3-D geometric transformations and clipping
techniques.
CO2: Comprehend the concepts related three-dimensional object representations.
CO3: Demonstrate the use ofOpenCL to create interactive computer graphics applications.

CO-PO/PSO Maooins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
col 2 3 .,
I 3
) c02 3 , I 3
c03 2 3 ) I 3

l:weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: T lecture hours

Introduction to Gaming and VR: Wlat is a Game, Conventional Games veruus Video Games, Games
for Entertainment. serious Games. Evolutions of virtual reality and video games. Modern vR
experiences, Hardware and software requirements, Human physiology and perception. Designing and
Developing Games: An approach to the task, Key components and slructure of video game, Stages ol
the design process. Game design team roles and documents. The Geometry of Virtual Worlds:
Geometric Models, changing Position and orientation, Axis-Angle Representations of Rotation,
Viewing Transfonnations. Chaining the Transformations.

Module Il: 7 lecture hours

Graphical User lnterfaces : Rapidly prototype VR interfaces, practice the Design loop, Understand
simulator Sickness, Experiment with various vR locomotion schemes, Implement a teleportation
locomotion, Audio goodness and game mechanics: Understand the importance of audio in VR,
Implement 3D audio, Use Google VR Spatial Audio, Explore pros and cons ofthe major VR headsets
on the market including Cardboard. Rift, Vive. Gear VR. PSVR. and more, platforms and focus path:
Discover future teclrnology that will impact VR development such SLAM and eye tracking by
examining VR prototypes and studies.

Module lll: T lectures hours

Fundamentals of computer Graphics: Applications of computer Graphics in various, video Display

Devices. Random scan displays, raster scan displays. DVST, Flat panel displays. l/o Devices. Graphics
 Primitives: Algorithms for drawing Line, circle. ellipse. arcs & sectors, Boundary Fill & Flood Fill
algorithm, Colour Tables. Transformations & Projections: 2D & 3D Scaling.

Module lV: T lectures hours

Translation. rotation, shearing & reflection, Composite transformatiol'r, Window to View port
transformation. Orthographic and Perspeclive Projections. Clipping: Cohen Sutherland. Liang Barky.
Nichol-Lee-Nichol Line clipping algorithms, Sutherland Hodgeman, Weiler Atherton Polygon clipping
algorithm. Three-Dimensional Object Representations: 3D Modelling transformations, Parallel &
Perspective prcjection, Clipping in 3D.

Module Y: 7 lectures hours

Curved Iines & Surfaces, Spline representations, Spline specifications, Bezier Curv€s & surfaces, B-
spline curves & surfaces, Rationai splines, Displaying Spline curves & surfaces. Basic Rendering:
Rendering in nature. Polygonal representation, AIIne and coordinate system transfomrations, Visibility
and occlusion, depth buffering, Painter's algorithm, ray tracing, forward and backward rendering
equations.

Module Vl: 7 lectures hours

Advanced Rendering Techniques: Introduce advanced shading models like Cook-Torrance or Orenna-
yar shading models, exploring their applications and advantages ,Augmented Reality Visualization:
Discuss the integration ofvisualization techniques into augmented reality environmenls and its impact
on data perception. Data Visualization Ethics: Address ethical considerations in data visualization.
including privacy, bias, and responsible data representation ,Interactive narrative Visualization: Explore
the concept of interactive storytelling through data visualization, emphasizing narrative-driven visual
representations .Visual Analytics for Decision Making: Introduce visual analytics techniques focusing
on decision-making processes and strategies. combining data visualization with decision science.

Studio Work/Lahor atorv ExDeriments:

Lab work would be conducted in OpenCL (verslsn l+). All the basic drawing. filling. transformation
and clipping algorithms will be covered.

Text Books :

)
l.Hearn Donqld D and M. Pauline Bake4 Cttmputer Graphics C yernion (2*t ed.), Pearson Education,
2002. ISBN 978-8 I 77 5 87 65 4.

Reference Books :

l. Foley James D., Andries von Dam, Steyen K. Feiner and John F. Hughes, Computer Graphics
Principles & Practice in C (2't ed.), Addison Ilesley Longman, 1995. ISBN 978-020t345193.

2.Zhigang Xiang and Roy a Plastock, Computer Graphics (2''d ed.), Mccraw Hill Educqtion, 2006.
ISBN 978-0s070601659.

3.Shreiner Dwe, Mason lltoo, Jackie Neider and Tom Dqvis, OpencL ProgrammingCuide: The Ofrcial
Guide to Learning OpenGL (Sth ed.), Addison-ll/esley Longman Publishing, 2005. ISBN 978-
0321335739.

M
Replsgar
9dfi-eit Unrter'-:;ty. Gre:rtcr Noida
(ESI6b.r<h-J Ir l,j.-r,r:, '_.: n, L( or Utidr pr3desh)
Plot No s S, 9, 10, 11,"tTech Zone_il
Greatei Noida-201310
 Assessment Schsme

Components lnternal Asse$ment Mid Term Exam End Exam Total

Weightag. (%) 35%i 3oo/o 35o/o l00o/o

*.kfr--
Benn6fl University, creater Noida
(Btablish& Under Act 24 ot covt, ol UttEr Pra(Br)
Plot Nols 8, 9, 10, 11, Tech Zone-ll
Greater Noida-2013'l 0
 Name of Program Bachelor of Technology (Computer Science and Engineering)
ECSE237L Software Developers & Operations: A DevOps T P C L

Perspective
Owning School/Department Department of Computer Science Engineering ,J 0 2 4
Pre-requ isites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COl: To articulate the fundamentals of Linux, Containerization, Build and Release Management
CO2: To examine Devops tools for Devops automation.
CO3: To make use Web Applications and platforms using Devops tools.

CO-PO/PSO Mappins

PO P02 PO3 PC)4 PO5 PO PO PO PO POI POI POI PSO PSO2 PSO3
6 7 8 9 0 2 I
col 3 2 2 2 3
,, , 3
.,
2
) co2 3 2 2 3 2 ", ) I 2
co3 2 2 2 2 3 2
., ) 1 2

l:weakly related 2= moderately related 3=strongly related

Course Contents:

Module I: ll lecture hours

Fundamentals of Linux: Linux vs Unix, Linux File System Commands, Start and Stop Services, Web
Application on Cloud, Overview of addressing in networks, Allocation, Association and Releasing of
Elastic IP Address, Storage Services on Cloud, Buckets on Cloud (Creation, Storing Data, Cross Region
Replication), Elastic Block Storage (EBS) and its types, Types of EBS Volumes, Creation, Attaching
and Detaching Volumes, ELB (Elastic Load Balancer), Configuration of ELB, Addition of Webserver
under ELB, IAM (ldentity Management Access) Security using IAM, Creating IAM Users and
Managing Password Pol icies.

Module Il: 8lecture hours

Container: Objective and Concept, Container Vs Virrual Machine, Docker introduction and
installation on Different OS (CentoS, Windows, etc.), DockerCommands to Maintain Container,
) Docker Compose, Docker: Registry, Hub, CommunicationNetworking within Single Docker
Container, Communication,Networking across Docker Container, Building Docker lmages.

Module lll: lOlectures hours

CICD and its Pipeline, Implementation and Pfinciples of CICD Pipeline, Tools for CICD
Devops, CICD Project Overview, Industries providing CICD Services, Package Management,
Release Pipeline, Build Management, Build Reporting and Status, Release Planning,
Dependency Management, Dependency ldentification, Dependency Scope, Dependency
Features, Dependency Management Examples (Parent POM, Child POM-a, Child POM-b),
Project Release Cycle, Deploying build to production.

Module lV: l3lectures hours

l., r. l'J':.ici:
i. ( llril.ii iriadtsh)
1.1
, Icch Zorre-li
:-l 0
 DevOps Automation, The Sofiware Delivery Pipeline, Fully Automated Software Delivery
Process, Automated build, Automated Test, Automated Deployment, Automation Scenarios,
Archiving Logs and its auto discard, Auto Backups, Web Server Automation, Automated Usage
Alarm/message, Scenarios Where Automation Prevents Errors, Writing Automation Scripls,
Automated Task Scheduling, Best Practices for Automated Scripting, Configuration
Management (CM), Use ofCM in tndustries, CM Tools, Configuralion oftools (Ansible, Puppet"
Chef, Saltstack, Managing CM Infrastructure, Comparison of Ansible, Puppet, CheC and
SaltStack.

Studio Work/Laboratory ExDeriments:

The Studio work includes the practical understanding of multiple tools and languages thal are
used in Devops Industry. Devops practices aims at merging development, quality assurance,
and operations (deployment and inlegration) into a single, continuous set of processes.

Text Books :
l. Leszko Rafql, Conlinuous Delivery with Docker and Jenkins: Creqle secure applications b)
building complete Cl/CD pipelines (2'd ed.), Pqckt Publishing, 2019. ISBN 978- t 838552 183.

2. Brqnson Steven, DevOps: Building Software with Lean Process for Modern Business (2od ed.),
I ndependent ly publ is h ed, 20 I 9. ISBN 97 8- I 67 57 4 I 2 I 4.

Reference Books :
1. Chou Eric, Michael Kennedy and Man$t llhaley, Mastering Python Networking: your one-stop
solution to using Pythonfor network automdtion, progrqmmability, and DevOps (3 ed.), Packt
Publishins, 2020. ISBN 978-1 8392 I 4677.

Assessment Schem€:

Components Ioternal Assessment Mid Term Exam End Exam Total

Weightage (%) 35v. 30o/o 35o/o l00Yo

Re tra ; ,/ (; r.:i.c r hlcida

Bg
r i:, -[u,]irZclltr- li
G 1-q..itoi i.iL-rii3- tli310
 Name of Program Bachelor of Technology (Computer Science and Engine€ring)
ECSE239L Full Stack Development L T P c
Owning SchooUDepartment Department of Computer Scienc€ Engineering 2 0 4 4
Pr€-req uisites/Exposure

Course Ou mes (COs)

On completion ofthis course, the students will be able to

COI: To understand the Client-Server architecture and the basics of clienrside programming
languagesand frameworks.
CO2: To examine client-side languages: HTML, CSS, and Javascript.

CO3: To implement client-side application development.

CO-PO MaDDins

PO PO2 PO3 PO4 P05 PO PO PO PO POt POI POt PSO PS02 PSO3
I 6 7 8 9 0 I 2 I

) col
co2
2
2
3
2
2
2
2 3
2
2
2
II
II
2
a
3
2
2
2
., )
co3 2 2 2 2 2 2

l=weakly related 2: moderately related 3=strongly related

Course Coptents:

Module I: 8lecture hours

Exploring Full Stack Development: The rationale behind Full Stack Development, web development
VS. Full Stack Development, client-server architecture, principles of three-tier architecture,
examination of MEAN, MERN, Rails, Django Stack, and LAMP, A comparative analysis of MEAN vs
MERN stack, and an overview of front-end frameworks and libraries, Scalability in Full Stack
Development, Web, Web Browser, Web Seryer. Analomy of a Website, Developer tools, inspector,
Wirefiaming , Web hosting steps, HTML, HTML Document Object Model. W3C standards for HTML,
HTML Validation, Structural markup . Semantic markup, HTML Lists, Links , Absolute velsus relative
path names , URL: Anatomy, Types, HTML Formatting, HTML Tables, Meta tags, Structural tags,
Character entities, escape codes, Image maps, Font awesome Icons, Forms Input Types.

Module Il: l0lecture hours

Why CSS? W3C CSS Validator, Syntax, Types, CSS Selectors, Cascading, lnheritance, Specificity,
Units ofMeasure, Width and Height ofelement, Box Model Layout, Border Box Versus Content Box,
Responsive website Design Bootstrap Grid Syslem, CSS pre-processor: Less, Sass and features.

Module lll: l0lectures hours

Javascript, JavaScript Events, Javascript APIs, Expert Lecrure from lndustry, Ajax Web App Flow,
Web Dynamics: Delving into Ajax processes, ES6 specifications, and features such as let, const, arrow
functions, classes, inheritance, spread operator, iterators, and generators, Javascript Transpilers. React,
React in HTML, React in CSS, Built in libraries Leveraging Vi ual DOM, Setting up React, Configure
gil/client,Creating Repositories, push local repositories ro GirHub, Git Branching and Merging, Web
Publishing ethics, Hosting a website.

R
i.l.ida
(E!ii
Pkrt I'ir.r it, i L'r, i1 , Tcclr Zone-l
Greale i NoiCa-2-01310
 Studlo WorldLaboratorv Exoerimetrts:

In studio work, developers develop both the front-end and the server-side of the application, deploy,
debug and maintain th€ir databases and servers. Being a Full Stack Web Developer, you will be at an
edge as you make better technical decisions and see the big picture.
Text Books :

l. Flanagan, D., Javastipt: The Delinitive Guide (76 ed.), Shroff and O'Reilly Media, 2020. ISBN
978-935213996.

2. Robbins, J., Leamng lleb De gn: A Beginner's Guideto HTML, CSS, JnaSuipt, and lleb Graphics
(sh ed.), O'Pleilly Medi4 ?020.ISBN 978-1491960158.

Belesrce-Plef
l.Meloni, J.C. and Kymin J, HTML, CSS, and Jovasuipt All in One, Sams Teach Yoursef(5d ed.),

J Pearson, 2018. ISBN 978-9389552416

Assessment Scheme:

Components Internal Assessment Mid Tcrm Eram End Exrm Totd

Welghtage (%) 35o/o 3Oo/o 35o/o l00P/o

M,
R e&Kar
Bennett University, Greater Noida
(Established UnderAct 24 of Govl, ol tlltal Pradosh)
Plot No's 8, 9, 10, 11 , Tech Zone-ll
Greater Noida-201 310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
ECSE3O4L Cloud Computing L T P C
Owning School/Department Department of Computer Sci€nce Engineering 3 0 2 4
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion olthis course, the students will be able to

COI: Understand cloud computing and service models.

CO2: Develop in depth understanding of Vinualization.
CO3: Demonstrate competence in implementing cloud.

CO-PO/PSO MaDDins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POt POI PSO PSO2 PSO3
6 7 8 9 0 I 2 I
col I 2 a 3 2 I 2
.,
c02 3 2 2 3 2 3
1 ,,
co3 2 2 2 2 3 2 2

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module I: I I lecture hours

Introduction and Evolution of Computing Paradigms: Brief History and Evolution - History
of cloud computing, evolution of cloud computing, traditional vs cloud computing. Cloud
service models (laaS, PaaS & SaaS); Cloud Deployment models (Public, Pfivate, Hybrid and
Community Cloud), Benefits and challenges of cloud computing; Virtualization: Basics of
virtualization, Server virtualization, VM migration techniques, Role of virtualization in cloud
computing, pros and cons of virtualizationi Working with cloud: Private cloud definition,
Characteristics of private cloud, Private cloud deployment models, Private cloud vendors.

Module ll: I I lecture hours

Private Cloud benefits and challenges; What is public cloud, when to opt for public cloud,
why we need public cloud, Public cloud service models, public cloud vendors and offerings,
Private vs Public cloud; Overview of cloud Security: Explain the security concems in
Traditional IT. Challenges of cloud computing in terms of application security, server
security, and network securiry. Insecure interfaces and APls Malicious insiders, Shared
technology issue, Data loss or Ieakage, Account or service hijacking. Unknown risk profile.
shared security model between vendor and customer in IAAS/PAAS/SAAS.

Module lll: l0 lectures hours

Classification of Cloud Implementations: Amazon Web Services, The Elastic Compute
Cloud (EC2). The Simple Storage Service (33), The Simple Queuing Services (SQS). Coogle
AppEngine - PaaS, Windows Azure; Aneka, Hadoop, A Comparison of Cloud Computing
Platforms. lntroduction No-SQL databases, Map- Reduce framework for Simplified data
processing on Large clusters using Hadoop, Design of data applications based on Map
Reduce in Apache Hadoop

. , -,: ii-, l"l,::(:.:

,i , I'i i l:i)-
r r l, iacii Z(Ji-l;-ii
i..i ':.i l:'; i!l
 Module IV: l0 lectures hours
Task Partitioning, Data partitioning, Data Synchonization, Distributed File system, Data
Replication, Shared access lo weakly consistent to data stores. When and when not to move
to cloud computing, migration path ofcloud, Selection criteria for cloud deplo),ment, Issues
risk in cloud computing, Future technology trends in cloud computing.

Studio Work/Laboratory Experim€nts:

Students will gain practical experience by using AWS.
Text Books :
L Buyya Raj Kumar, James Broberg and AndrezeiM.Goscinski, Cloud Computing: Principles and
paradigms(l* ed.), MIT Press,20l L ISBN 978-0470887998.
2. Miller Michael, Cloud Computing ( I'r ed.), Que Publishing, 2008. ISBN 978-0789738035

Reference Books :

l. Velte Anthony, Toby Velte and Robert Elsenpeter, Cloud Computing: A practical Approach (l"r
ed.), Tata MccrawHill, 2009. ISBN 978-0070683518.
)
2. Hurwitz Judith, Robin Bllor, Marcia Kaulinan and F Halper, Cloud Computingfor dummies (l"l
ed.), Wiley, 2009. ISBN 978-8126524877.

Assessm t Scheme:

Compon€nts Internal Assessment Mid Term Exam End Exam Total

Weightag€ (%) 35vo 30% 3syo l00Yo

-,)

. j"i tr tj fl_ ,-"{il

' : ;-' ' - r-'r -, .lltg-il
 Name of Program Bachelor of TechnologY (Computer Science and
Engineering)
CSETlOS Environment and SustainabilitY L T P C

Owning School/DePartment Department of Cornputer Science J 0 0 J

Engineering
Pre-requisites/Exposure

Course Outco mes (COs)

On completion ofthis course, the students will be able to:

COI : Demonstrate analytical thinking skills concerning environmental topics'

COZ : Demonstrate an ability to combine the many disciplines and fields that intersect with
environmental concems.
co3 : Illustrate an integrative approach to environmental issues with a focus on
sustainability.
)
CO-PO/PSO Manoinp

PO PO PO4 PO5 PO PO PO PO POr POI POI PSO PSO2 PSO

PO
2 6 7 8 9 0 I 2 I J
I 3
CO
I 3
.,
3 2 ) 3 2
CO
z
CO
) .,
2 3 ) 2 I
3

l=weakly relared 2- moderately related 3-strongly related

Course C ontents:

Module I: 6 lecture hours

Environmental sustainability, ecosystems and climate change: lntroduction to environmental
sustainability, Sustainabiliiy and population growth, growth curves , Way forward'
Ecosystems'and climate chinge introduction. Ecosystem dynamics' Tragedy ofcommons'
irug"dy of .o**ons solutionl, Ecosystems and extinctions, Weather vs Climate' Climate
changes in the past, Climate change in the present, Climate processes'

Modulo Il: 5 lecture hours

Biodiversity and its conservation: Biodiversity, value ofbiodiversity, Threats to biodiversity,
Conservation of biodiversity, Case studies.

Module III: I lecture hours

natural resources: natural resources, Associated problems with natural resources .renewable
and non-renewable energy, Water and Agriculture, Agriculture and Food, Problems and
Solutions.

1r
II : :.r.i,.,' r,
).:'.:t
L:r-:t,tt l'!oida
.i ll,i.ii i:t,:h)
i r. i ;irZoIr.:-li
 Module V. 7 lecture hours
Environmental ethics and policies: Environment ethics, Global policies, Environmental laws
in India, Environmental impact assessmenq Issues involved in the enforcement of
environmental legislation.

Text Books :
1. Bharuoh4 Eraah. Textbook of environmental studies for undergraduate courses,
Universities Press, 20 I 3.
Reference Books :
1. Lodish, Hrvey F. Molecular cell biolog. (86 ed.), W.H.Freeman, 2016. ISBN 978-
1319067748

Assessmeut Scheme:

Componetrt3 Internal Mld Term Eram End Exlm

Ass$sment
[""'
) Wotgtage (%) 3So/o 3oo/o 35o/o 00o/o

a). -

Bc :-rtt IJnirr=r sity, Greater Noi da

1.,'-r:-:,JJ Ur
i:rA.r 2 i ri Go!l, ol U,ta r PrnJesh)
P ci l.lo's B, 9, lt), 11, te ch Zone-ll
ieater N oida-20'13.10
 Name of Program Bachelor of Technology (Computer Science
and En neenn
CSET224 Cloud Computing I, T P C

Owning School/Department Department of Computer Science ., 0 2 4

Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate cloud computing principles and their business need'

co2: To identify the design principles of virtualization techniques in cloud resource
management.
CO3: To design and development ofcloud architectural solution with its detailed monitoring.

CO-PO/PS O Manoins

POt Po2 PO3 PO4 PO5 PC)6 PO7 PO8 PO9 PO t0 POt I PO l2 PSOI PSO2 PSO3
1 2 2 2 I
col 2 I t ", 2 2
,,
2
) I
co2 2 2 1 2 2 2 2 2 2
,, ", ., 3
co3 2 3 2 2 2 2 2 2 2 2 z

l:weakly related 2: moderately related 3=strongly related

Course C ontents:

Module I: ll lecture hours

Cloud computing, Adoption ofcloud-based IT resources, service Models: lnfrastructure-as-a-
-platfoim-as-a-service (PaaS), Software-as-a-service (SaaS), Deployment
Service (laaS),
models: iublic' Cloud, private Cloud, Hybrid Cloud, Community Cloud. Cloud Computing_
Characteristics, Challenges ofcloud computing, Virtualization concept' Types of
virtualizations. Demo of virtualization, Virtuilization Merits, Role of virtualization in cloud
computing, Virtualization Demerits, VM Placement, VM Migration, VM Migration Demo'
Vtrl ctrstJiing, Design Issues in VM Clustering, Need ofDockers and Containers, Docker Eco-
System, Hypervisor vs Docker.

Modulo ll: l2lecture hours

Microservices. Service-Oriented Architecture, REST APl, lP Addressing, Subnetting,
Supernetting, Designing of Virtual Private Cloud, Demo of VPC, VPC Peering, VPC Case
Study, cloud Storage, Serverless computing, Cloud API Gateway, Cloud Databases, Resource
provisioning, Time shared and space shared, Efficient VM Consolidation on cloud server,
Task/DAG Scheduling Algorithms, Min- Min, Max-Min. MET, B-level Demo. T-level Demo,
Task-VM Mapping, Auto Scaling, Load Balancing.

Module lll: l0 lecture hours

Case Study: Cloud Market analysis, Security and Compliances, Shared security model in
IAASiPAAS/SAAS, Shared technology issues, Data loss or leakage, Account or service

E:,tt r l_' .._-ij.:ii Gr-t::1er Noida

([ i r_,I r-r:l-i .l (,t:l .1i.": ii i.l.iir P,adcsil,
l, 'l'cch Zot-re-ll
:

PIct i i:i s U, [), ]ri, i

Glrli:i f':(r;ii.-:201 :r't0
 hijacking, Implementation ofcloud security, Security Groups, Network Access Control Lists,
Cloud databases, Parallel Query Execution with NoSQL Database, Big Data, Handling Big
Data on Cloud Platform, Map- Reduce framework for large clusters using Hadoop, Design of
data applications based on Map Reduce in Apache Hadoop.

Module IV: 9 lecture hour"s

Comparative study/analysis of public clouds, Edge Computing, Fog Computing, Data
Offloading, Cloud-Based DevOps Tools, Task Partitioning, Data Partitioning, Data
Synchronization, Distributed File System, Data center, Ongoing Research Topics.

Text Books :

1. Wang L., Rajiv Ranjan, Jinjun Chen and Boualem Benatallah, Cloud Computing (ltt ed.),
CRC Press, 201 7. ISBN 978-1351 833097.
2. Hurwitz J. S. and Daniel Kirsch, Cloud Computing For Dummies (Znd ed.), Hoboken: John
Wiley & Sons, 2020. ISBN 978-1119546658.

) Reference Books :
1. Sharma Prema, Moolchan Sharma and Mohamed Elhoseny, Applications of Cloud
Computing (lst ed.), CRC Press,2020. ISBN 9780367904128.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam fot8l

Weightage (9/o) 50 l5 35 t00

R ar
e tt Untversity, Grea ter Noida
Establish.d U nderAut 24
P.adesh)
oi Govt, ot uttar
ch Zone-ll
P lot No's B, 9, 10, 11, Te
Greater No ida-201310
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET225 lntelligent Model Design using AI L T P C
Owning SchooUDepartment Department of Computer Science 0 2 4
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate key features of various Machine leaming and Deep Learning tools for
Intelligent Modell ing.
CO2: To examine and implernent intelligent applications using Machire Leaming and Deep
Learning tools.
CO3: To irrplement Machine Learning and Deep Learning rnodels for design thinking and
evaluate them using relevant metrics.

CO-PO/PSO Manoins

POt PO2 POI PO4 PO5 PO6 PO7 PO8 PO9 POr0 POt I PO t2 PSOI PSO2 PSO3
cor 3 3 3 3 2 t 3 2 2 2 3
co2 3 2 3 3 3 , 2 3
c03 3 3 3 2 3 2 , 3 3
,|

l:weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 8lecture hours

Why Intelligent Model? lntelligent Citizens of the World, Thinking More Clearly, Empathize,
Define, Ideate, Prototype, Test, Using and Understanding Data, Using Models to Decide,
Strategize, and Design, Automation/Augmentation Opportunities, AI in Sensitive
Applications, AI in Healthcare and Security, Pervasive, AI Systems, AI in IOT Devices,
) Business Value of Data: Case Study on Data Dependent Company, Data Valuation, Data
Quality, Data Driven Marketing and Commerce, Biases in AI Models, Handling Gender, Race,
Religion, Cultural Biases, Unintended Biases.

Modulo II: l0lecture hours

User privacy. Data Privacy aware AI, Data Sharing Regulations, AI Model Security, Attacks
on AI models, Adversarial Attack, Relevance Feedback, Adaptive Learning, Online leaming,
Model fine-tuning, Transfer Learning, Domain Adaption, Explainable Al, ML Accountability
and Faimess, Model Interpretation, Class imbalance in Modelling, Handling Data Drift,
Human- Machine Co-learning.

Module lll: l2lecture hours

Aligning Mental and Machine Leaming Models, CodiIg Automation, Rapid Prototyping in
AI, Market Demand Analysis, Automated Requirement Analysis, Customer opinion analysis,
Attribute based opinion mining, Geospatial Analytics, Spatial analysis, Spatial-temporal
 analysis, Geo-clustering, Market Segmentation, Demographic, Cultural, Behavioural and
Psychographic Segmentation, Dynamic Pricing, Price Optimization, Personalization,
Recommender Systems, Feature Attribution, SHAP (SHapley Additive exPlanations), Lime,
Shapash, Dalex.

Module IV: 12 lecture hours

Speed vs Accuracy Trade-off, optimizing models for resource constrained devices, Deep
Leaming Model compression, Pruning, Low-rank factorization, Automatic Machine Leaming,
Neural Architecture Search, Deploying Machine Leaming Models, Staging Automation,
Cognitive Modelling, Conversational Systems, Data driven person4 User personas, Reasoning
Under Uncertahty, Multi-agent System, Reinforcement Learning, General Intelligence, Super
Intelligence, Decision Making Systems.

Text Books :
L Aggarwal C. C ., Nettral Networks and Deep Learning ollltst ed;. springer Intemational, 2018.
tsBN 978-3030068561.

Reference Books :

)
L Kasparov Carry, Mig Greengard, Deep Thinking: llhere on Machine Intelligence Ends and
st
Human Creativity Begins (l ed.), John Murray, 2018. ISBN 978-147365351 l.

Assessment Scheme:

Components Internal Assessm€nt Mid Term Exam End Exam Iotal

Weightage (%) 35v, 3ovo 35o/o t00%

/)x4
I
,u.0
-H-egtsfrat'
Ben6iBIt Universrty, Grc rtcr Noida
(Establijh.C Lnd.r l cl2L1 Lrf rin,'1. 01 llii,li FraC{ish)
Plot No's 8, I, i 0. 'i 1, lcch Zone-ll
Greate i Noida-zo1.:l i'
 Name of Program Bachelor of TechnologY (Computer Science and
Engineering)
CSET226 Blockchain f,ngineerin L T P C

Owning School/Department Department of Computer Science 3 0 2 4

Engineering
Pre-requisites/f, xposure

Course Outcomes (COs)

On completion oftltis course, the students will be able to:

COI: To articulate blockchain concepts and software applications that are used to develop the
blockchain use cases.
co2: To perform compilation, migrating, testing, and deploying the blockchain applications
on the decentralized network.
CO3: To make use of building distributed ledger technologies for Blockchain applications and
able to solve double spending problems in the digital payments using cryptocurrencies.
)
CO.PO/PSO Manoins

POI P02 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POt0 POII POl2 PSOI PSO2 PSO3

col 2 2 a 3 2 2 t ) 2 ) 2 2
1 .| .,
2 2 2 2
c02 2 1 3 2 2 2 2
c03 2 2 3 2 1 2 I 2 2 2 1 , 2 2 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: lOlecture hours

Blockchain platforms, distributed ledger technologies, distributed consensus algorithms,
endless chains, Proof-of-elapsed time, Proof of Burn, Hyperledger, Frameworks, Fabric
network, Transaction flow, Fabric- Membership, Identity management, Fabric components,
Fabric deployment, Hyperledger Composer, Application Development, Composer - Network
Administration

Modulo II: I I lecture hours

IPFS, Decentralized web, Privacy and encryption on IPFS, nodes' IPFS commands, IPFS
vs HTTp, Location-based addressing, contentbased addressing, Distributed Hash Table (DHT),
Merkle DAGs, IPNS, IPFS Gateway-, IPFS Daemon, DNS Link, On-chin Transactions, off-chain
Transaclions, Forking, Hard forks, Softworks, Double spending issues, lmproving throughputs,
Algorand, DAC- Chains, Hyper ledger lndy' Hyperledger Sawtooth'

Module III: I I lecture hours

Decentralized Autonomous Organizations, DAO Membership, Problems witll automated
immutable systems, Challenges with the decentralized web, Defi (decentralized finance), Defi
on Ethereum, Non- Fungible Tokens (NFTs), NFT use cases, Gas pricing' Ethereum

development using Whisper, Swarm, and Raiden Network, State Channe lsTCase studV,

{'i ar
i-l al t,
(ii
ir l::t il ri), ir. l
(:., i
':-;"ll:'t
 Costless Verification: Blockchain Technologr, last mile problem, Verification cost reduction
in blockohain, Bootstrapping network effocts.

Tert Books :
1. Gaur, Nitin and et al, Hands-On Blockchain with llyperledger: Building decenfialized
$
applications with Hyperledger Fabric and Composer (l ed.), Packt Publishing Ltd, 201 8.
ISBN 9781788994521.
2. Pathak, Nishith and Anurag Bhan dxi, IoT, AI, and Blockchain for. NET: Building a Nert

Generarion Applicationfrom the Ground Up (1* ed.), Apress, 2Ol 8. ISBN 9781484237083.

Refersnce Books :
l. Bashir and Im raa, Mastering blockchaik: " Disttibuted ledger technologt, deeentralization,
and smart contracts explained" (lst ed.), Packt Publishing Ltq 2018. ISBN
9781787125445.

Assessment Schsme
.)
Components Intornrl Ass$sment Mid Tc?m Ex.m End Exsm fohl

Welghtege (o/o) 45 20 35 100

R r
G reater Noida
Bennett UniversitY' 24 of Go!t, ot Uttar Pradesh)
{Established U nder Act
ch Zone-l
irlot No's 8, 9, 10, 1 1, Te
Greater N oid a-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET227 System and Network Security t. T P C
Owning SchooUDepartment Department of Computer Science J 0 2 4
Engineering
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course. the sludenls \ ill be able to:
COI: To articulate the system vulnerabilities, exploitation, and defense mechanisms
CO2: To examine the spyware, security issues and diflerent types ofattacks.
CO3: To do programming for system and mobile security.

CO-PO/PSO Mapoine

) POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 POI I POt2 PSOI PSO2 PSO3
COI 3 3
,, ) 3 3 2 3 ,
co2 3 3 a 3 1 3 3 3 1 2
co3 3 3 3 1 2 a 3 3

l=weakly relared 2: moderately related 3=strongly related

Course Contents:

Module l: I I lecture hours

Threats and Vulnerabilities of Windows, Threats and Vulnerabilities of Linux, Controls, Risk
Management, Basics of Confidentiality, lntegrity and Availability, Generic Security Policies,
Security Mechanisms, Assurance, Prevention, and Detection, Security lssues in Windows
Operating System (Windows XP, Windows Vista, Windows 7 and Windows l0), Linux Kemel
TCP/IP Vulnerabilities, TCP SACKs (25), SACK Panic, Mitigation Schemes and Patches
Developed for Each Security Issue, Bool Loader Security lssues, Grub Security FIaw.

Modulo ll: glecture hours

) Security in Broadcast Networks, Security in Centralised Networks, DDOS Attacks, Volume-
based DDoS attacks, Protocol attacks, Application-layer DDoS attacks, Introduction to
Malicious Softwares- Botnet, Logical Bombs, Grayware, Spyware, Adware, File Binders,
Antivirus, Honeypot, Trapdoor, Latest Malwares Definitions and Their Defence Mechanisms.
Android-based Malwares and their Security Patches.

Module lll: glecture hours

lntroduction to Network Security, Network-based Attacks, Active and Passive Attacks, Phishing
and lts Types, Tailgating, Impersonation, Dumpster Diving, Shoulder Surfing, Hoax, Waterhole
Attacks, Denial of Service Attacks and its Types, Man in the Middle Attack, Buffer Overflow
Attack, Cross-Site Scripting, SQL Injection Attack, Privilege Escalation, Man in the Browser,
Zero-Day Attack, SQL Injection Attack, Privilege Escalation, Man in the Browser.

Module IV: 13 lecture hours

,\
l/il
R6tIr$far
Bffiett UniversIY, Creater Noida
{Eslablished Uir.l.,il Act 24 oi Govi, ol L.lllar FraCesh
irlot No's 8, s. 10, 11, lbcn Zorre-
Greate. Noida-201310
 Generic Security Software's, Windows Firewalls, Linut Firewalls, Access Control Lists of Firewalls,
Types and Examples of Firewalls, Networt-based Honeypots and Trapdoors, virtual Private Network
and its Implementation, Network Intrusion Detection System, Network Intrusion Prevention System,
Router S€curity, Switch Security, Proxy Server and its Configurations, Load Balanc€rs, IPv6 and IPv6
Security, Secure Forwarding in Overlay Networks,

Text Books :
l. R. Bragg et al, Nefieork Security: The Complete Reference (l st ed.), TMH Publications,
2017. rsBN 978- 0070586710.

rd
2. W. Stallings, Nework Security Essentials: Applications and Standards (3 ed.), Pearson,
2018. lsBN 978-0132380331.

Reference Books :
l. Joseph Migga Kizza. Guide to Computet Nefirork Secun ry, (56 ed.), Springer.
2020. ISBN 978303038 t 40.

AegesgsqeglSsbse:
)
Componerts Internal Assessment Mid Tsrm Exam End Exam otsl
t'
Welghtage (o/o) 3sYo 30olo 35o/o OOo/o
I

,)

ffigig1s*'*i*m,
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET228 Data Mining and Predictive Modelling I, T P C
Owning School/Department Department of Computer Science 3 0 2 4
Engineering
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate data preparation for data mining and analyzing based on pre-processing
techniques.
CO2: To examine predictive analysis in various use cases.
CO3: To make use ofexploratory data analysis to gain insights and prepare data for predictive
nrodelling.

CO-PO/PSO MaDDins

POI P()2 POI PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POtl POI2 PSOI PSO2 PSO3
., .,
cor 3 2 2 2 2 2 2 2 2 2
c()2 2 3 2 1 2 , 2 2 2 'l 1 2 2
co3 2 2 2 2

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module I: I I lecture hours

Purpose of Data mining, Procedures of Data Mining, Functionality of Data Mining, Knowledge
data discovery process, Data and attribute type, Properties of data, Discrete and continuous
attribute, Dataset types, Data quality measurement, Noise Analysis and its importance,
Techniques of Data pre- processing, Aggregation, Sampling, Curse of dimensionality,
Dimensionality reduction, Feature selection and generation, Discretization and vectorization,
Binarization, Aftribute transformation correlation, Association rule mining, Apriori algorithm,
Rule generation, Pattern Mining in: Multilevel, Multidimensional Space Pattern Mining.

Modulo ll: T lecture hours

Rule-based reasoning, Memory-based reasoning, measuring data similarity, Similarity Metrics:
Distance based measure, Information based measures, Set similarity measure, Jaccard Index,
Sorenson Dice Coefficient, Model Selection Problem, Error Analysis, Case study, Staftups in
Data Analysis.

Module III: l0 lecture hours

Outlier analysis in classification and clustering, Probabilistic rnodels for clusterirrg, Clustering
high dimensional data: Subspace clustering, Projection Based clustering, Exploratory data
analysis, Data summarization and visualization, Dataset exploration, Data Exploration Tools,
lnteractive Data Exploration, Predictive models, Design Principles, Parametric Models, Non-
Parametric Models, ANOVA, Regression Analysis, Frequent Pattern Mining, Mining Closed
and Max Pattems.
 Module IV: 14 lecture hours
Linear discriminant analysis, Fisher discriminant analysis, Time series Model: ARMA,
ARIMA, ARFIMA, Factor Analysis, Uncertainty quantification, Forward uncertainty
propagation, Inverse uncertainty quantification, Non-Negative Matrix Factorization, Sequential
Mairii Factorization. Exact Matrix Factorization, Expert Lecture fiom lndustry,
Recommendation System and collaborative Filtering, Multidimensional Scaling, Mining
Textual Data, Temporal mining, Spatial mining, Visual and audio data mining, Ubiquitous and
invisible data mining- Privacy, Security, Social Impacts of data mining'

Text Books :
1. Bruce Rlatner, Stalistical and Machine-Learning Data Mining Techniques fot Belrer
Predictive Modeling and Analysis (3rd ed.), Chapman and Hall/CRC, 2017. ISBN 978-
1498797603
2 Dursun Defen, Pr edictive Analytics (lsted.), Knime,2020. ISBN 9780136738516.

Refe Books :

l. Mohammed J. Zaki and Wagner Meira, h, Data Minimg and Machine Learnr'ng (lst ed'),
Cambridge University Press, 2020. ISBN 9781 108473989.

Assessment Scheme

Components lnternal Assessment Mid Term Exsm End Exam Total

Weightag€ (%) 50 l5 35 100

*fur,n,,
E6loet(U niv er sitv. G re ater N oida
(EsT6!; I'e,l Lrc.: ..c! , i ;' (.o\,1. or Urtar Pradesh)
Plot No'sB, S, 10, 11, Tech Zone-li
Greater Noida-201 31 0
 Name of Program Bachelor of Technology (Computer Science
and Engineering)
CSET229 Game Engi ne and Architecture I, T P C

Owning SchooVDepartment Department of Computer Science 3 0 2 4

Engineering
Pre-requisites/ExPosu re

Course Ou tco mes (COs)

On completion ofthis course, the students will be able to:

COl: To explain concepts ofunderlying game engines' Solve practical 3D game problems
CO2: To lmplement Game control systems for multiplayer games using Human
Interface

DevicesandanalysethebasicfeaturesofPhysicsforGames;Illustratethecollisiondetection
systems used in games.

CO.PO/P SO Ma nDlnp
)
P()6 PO7 PO8 PO9 PO l0 POI I PO l2 PSOI PSO2 PSO3
POt PO2 PO3 P04
,|
PO5
, 2 1 2 a 3 , 3
cot 3 2 3 2 2
co2 2 3 a , 2 2 2 2 1 1 2 3 ^,

l=weakly related 2: moderately related 3:strongly related

Co urse Contents:

10 lecture hours
Module l: Base layer'
Curn" g.gir", Engine Differences Across Genres, Runtime engine architecture:-
rtl"rno.y,luv"i, uility, tvtooute, Management, Gameplay, Build layers' Asset Pipeline' Pre-
."rJ.rirg plir"fi*, ruii:o pip.iin", Gime profiler, Tools for optimization of games' Types of
p.ont"riV"oion control in game ;evelopment, Best Practices in version control' Issues and
;;i;ii;r;, engine and ieatures, Unieat engine and features, Amazon Lumberyard and
Unity
features, cryEngine for VR and features

l: l0lecture hours
) Modulo I
Water rendering' Lightening
Engine Levels, Game Engine VR Modes actors, Landscape'
and Environment, Capsule shadJw, Iighr mobility. and types of lights' Volumetric clouds'fog
functions' and flow
effects. Level streaming, Hierarchal tivel of detiils, Blueprints, Variables'
Toolset, occlusion Culling,
controi, rimetines and b-lueprint classes, Render To Texture Blueprint
and scripting' Actor
Render targets, Real time iaytracing, Frame Rendering tool, Programming
Architecture' Gameplay classes and
Co*.un;""ution, Blueprinl visual lcripting, Gameplay
Threaded rendering' Mesh
functions. Interfaces. Craphics Programmin'g, Shader development'
drawing pipeline, Slate UI Framework.

Module ltl: l0lecture hours

in practice'
Human Interface Devices, Types of HID for games, Interfacing with HID' Devices
features ofpopular devices,-Gameplay Framiwork, Pawn, Controller, Camera'
Al Entities in
gu-ing, eJnurior trees, navigation system, Environment query system' Physics in gaming'
iitUC ijt O".ign"r, Networking and multiplayer, Animation Characters and Objects, Animation

Gre:lter Noida
rtu niversitY, G0,4
Be 2,1oi Li Urtar Pradesh)
lEst3blrshed UrrderAct
11, Te clr /-one-l
Plot No' S8,9, 10,
Greater Noida -201310
 rigging toolse! Skeletal Mesh Animation System, Sound in gaming, Ambient Zones, Sound
classes, Audio Engine and mixer, Sound Attenuation, Sound cue.

Module IV: 12 lecture hours

lmporting and integration media objects, Asset manag€ment, Asset Build tool, Automation
tool, tesing and Gtimization, performance and profiling, Animation System Architeeture,
Animation [lending, Animation pipeline, Skinning and Matrix Palette Generation, Skeletons
-controller
496x, Animation Coiision and Rigid Body Dynamics, Collision/Physics
uiddleware, The Collision Detection System' Rigid Body Dynamics, and Advanoe physics
features.

Text Books :
l. Jason Cregory, Jeff Lander and Matt Whiting, Game Enginefrchiteawe (3rd ed'), A
K Peters/CRC Press, 20l8. ISBN 978-l 138035454.

Refertnce Boo}s :
1 Heather Maxwell Chutdler, Game Prod.uction Hardbook (3rd ed.), Jones & Bartlett,2013.
) ISBN 97E- 1449688097.

Assessment Scheme

Components Intornrl Assessment Mid Term Exam End Exom Totd

r eightage (%) 65 0 35 lo0

'i.:y, Grei,i,tr l-.roida

i:lciC-vt , cl ULlar p radcsh)
P]
Greater l{o icra-20131 , Tcch Z one-ll
0
 Name of Program Bachelor of Technology (Computer Science
and Engineering)
CSET23O f)ev Practices and Principles L T P C

Owning SchooVDepartment Department of ComPuter Science 0 2 4

Engineering
Pre-requisites/Exposur€

Cours e Outcomes (COs)

On completion ofthis course, the students will be able to:

col: To articulate Devops engineering and Devops terminologies to meet the business
requirements.
co2: To construct different applications of Devops that can be used on different platforms.
CO3: To design and execute projects using different tools, modules, and templates'

CO-PO/PSO Maooins
)
POI Pro2 PO3 P()4 PO5 PO6 PO',7 PO8 PO9 POl0 POI I PO l2 PSOI PSO2 PSO3

col 3 2 2 a , 2 2
,, .|
2
.|
3 , 2

co2 ) , 1 3 , 2 2 2
.,
2 1 2
co3 1 3 2 3 2 2 2 3 2 3 3 2 2 J

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: l2lecture hours

why Devops? , Terminologies, Devops Stakeholders and roles, Devops Perspective: People,

Process and Product, Building Teams, Boston Consultancy Group (BCG) Matrix, Three
Horizons Model, Autonomous Team and its Pros and cons, Autonomy criteria, Decoupling
Point for Autonomous Team, Case Study on Autonomous Team, DevOps and ISTM (lT
service and Management), Traditional vs Agile Devops, DevOps Phases with diagram
) representation, lntroduction ofSource and Version control(svc), Algorithms for SVC: Lock-
Modi!-Unlock and Copy-Modifi -Merge, Continuous Integration, and Deployment (CICD)'
Software Craftsmanship, Software Containerization, System Provisioning, and Configuration
Management, Testing and Test Automation.

Modulo tl: I I lecture hours

Service-Oriented Architecture and Microservices, Build and Release Management, Virtual
systems, Hypervisor Cloud Computing, Need of cloud Computing with Application, Delivery
Models of Cloud cornputing, Deployment Model of cloud computing, Git Desktop usage,
and Benefits, connecting Git Desktop and Git online, Git version control, and Types,
Distributed version control Systems with Example, centralized version control systems with
Example, Configuration Management, Chef Configuration, Workstation Setup, Configuration
of the knife, Test Connection between Knife and Workstation' ization Setup, Creation

Re
{:r\ tt University, Cr i'erl r::r Noida
blished Uiriier Aci 24 oi Govi, of U rt.r P,adesh)
P lot No's B, 9, 10, 11 Tec h Zone-ll
'
Greater Noida-20131 0
 and connection ofNode to organization, operations on Node, object and Search, Creation
of
Environments and Connecting them with Servers.

Module lll: 6lecture hours

puppet, puppet working and Architecture, Master and Agents in Puppets, Installing Puppet'
Configuring Puppet Master and Agent, Connecting Agents, Puppet Language, Declarative
Language, Resources, Files, Exec, Packages, Service in Puppets' Virtual Resources and
Exported Resources

Module IV: l3 lecture hout's

Devops Security, Issues in Devops Security, Devops Security Needs and Challenges,
DevOps Risks Management, Strategies, Policies, Practices for DevOps Security, DevOps
Security Tools, DevOps security over Clouds, Security Models. and their Use' Modules and
Templates for DevOps, DevOps Manifests, Class Templates Static and Dynamic Content'
ERB Module, NTP Module, SSH Module, Sudo Module, Install LAMP with pre-existing
Modules.
) Text ks:
l. Reed Mark, DevOps The Ultimate Beginners Guide to Learn DevOps Step-by-Step (lst
ed.), Publishing Factory, 2020. ISBN 978- 1647710941 .

) Gene Kim, Kevin Behr, and George Spafford, The Phoenix Proiect (5th ed'), IT Revolution
Press,20l9. ISBN 978- 1942788294

Refere nce Books :

1, Gene Kim and John Willis, Beyond the Phoenix Project: The Origins and Evo lution of
DevOps (lst ed.), IT Revolution Press, 2018. ISBN 978-1942788256

Assessme nt Scheme:

Components lniernal Assessment Mid Term Exam End Exam Total

35 100
Weishtage (%) 50 15

t-::

..: l
l. :.lt -,:i..,lle-il
ri., l0
 Name ofProgram Bachelor of Technology (Computer Science
and Engineering)
CSET231 Programming Methodologies for Backend L T P C
Develo m€nt
Owning School/Department Department of Computer Science 2 0 4 4
Engineering
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate the client-Server architecture and the basics ofback-end technologies
and tools.
CO2: To examine sewer-side programming languages like PHP and Nodejs.
CO3: To connect with database with the help of server-side scripting-PHP and MySQL'
Nodejs and MongoDB.

co-Po/Ps O Mennins

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POt 0 POt I PO l2 PSO I PSO2 PSO3

col 2 3 I 3
co2 3 I 3
co3 2 3 I 3

l=weakly related 2: moderately related 3=strongly related

Course ontents:

Module l: 12 lecture hours

Back-end technologies: servefs, applications, and databases, object-oriented based backend
programming languages: PHP, Java, Nodejs. MERN Stack: Mongo DB, Expressjs' Reactjs, Nodejs'
iunctional-based backend programming languages (Mongo DB), Databases, MySQL, XHTML' PHP-a
scripting language. PHP: server-side scripting and its syntax, working wirh variable and constant. PHP
Utoctr:1nays, strings, function. PHP error handling and Controlling program flow, looping, and
"oO!
) branching, file handling, directories, PHP sessions and security, processing forms on server-side,
cookies, Web services, exploring Java-based web technologies: JDBC, servlet, JSP. Web architecture
model: client-server model, three-tier model, and service-oliented architecture (SOR), MVC
architecture: model, view, controller.

Modulo ll: T lecture hours

Database programming: Operations and working on metadata, database configuralion, connection to
MySeL sirvir, execut'ion ot tUySql queries, Nodejs: Web Applications with Nodejs, Core Nodejs
ani packages, Events Streams, Modules: expoft, object, class. Loading module from a separate folder,
File Systeins. MongoDB, Features of MongoDB, MongoDB Database Tier, using Nodejs with
MongoDB, using Nodejs with MySQL, Server-side rendering.

Module III: 9lecture hours

REPL environment and commands, Backend liameworks: Django' Spring, Express Docker
Contain ers, GraphQL integration, API documentation: Swagger API, Postman (API testing), RESI
Principl es for APt. Containerize APIs with Docker, Serverless computing, Devops toolkit'

i tll
n nett Universilv,
-ol
G reater Noida
(Eslall 1..i,'.d U1d.r Act 14
(iovl o'Lltlar Pradesh)
Plot f*ot S, g, 10, 1'1, Tech Zone-ll
Greater Noida-2O1 31 0
 Text kr:
1. Henon David, Node.js Web Development: Server'side web development made easy with
Node tuing practical examples (5th ed.), Packt Publishing Limited, 2020. ISBN 978-
1838987572.

Reference Books :
1. Zammetti Fratk, Modern Fqtl'Stack Development: tlsing TypeSuipt, React, Nodeis,
'tfiebpack, and Docker(lst ed.), Apress, 2020. ISBN 978' 1484257371

Assessment Scheme

Components Internal Assersment Mld Term Exam End Exam otal

rOU/o
Weight ge (o/o) 3s% 3ff/o 35o/o

)
 Name of Program Bachelor of TechnologY (Computer Science and
trngineering)
CSET232 Design of Cloud Architectural Solutions L T P C

Owning SchooUDepartment Department of Computer Science J 0 2 4

Engineering
Pre-req uisites/ExPosu re

Course O utcomes C Os)

On completion of this course, the students will be able to:

COl: To learn stack of cloud architecture and design guidelines ofthe final product
C02: To build the cloud architectural blueprint for deployment'
CO3: To deploy and implement cloud architectural designed solution'

CO-PO/PSO Maooine

PO6 PO7 PO8 PO9 PO l0 POll POl2 PSOI PSO2 PSO3

) POI PO2 PO3
)
PO4 PO5
a ,|
2 2 3 1 2
cot 3 2 2 2 2 2 2
", ", 2 1 2 2 3 3
co2 3 3 2 2 2
,
co3 2 2 3 1 2 , 2 2 2 2 2 2 3

l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: I I lecture hours

cloud erchitecture Job roles, Solution Architect certifications, Cloud Solution Architect
a;",|f,.1iilo|;. aioua co*puttng with characteristics, core cloud Seruices, Loose Coupling,
ioor! Coupf ing Strategies, 6ommunication in coupled components, De-coupling. of
provisioning,
Iri;;.r;td, sialaule lieb application deploymenr, Muhi-Tenancy, Resource
Tra{fic / Demand Monitoring,'-apacity Planning and Prediction, Data centre management,
coJng una iiicing ol puuliJ cloud services, Cloud Governing Rules, cloud Privacy issues,
n".igf pii".ipr* io. ,ting cloud services, Design Principles for providing clo'{ t:ryi:g:'
Clou-a arclrit"itural design irinciptes, Principles o1the Security, Principles of the.ReliaPility
pitlu., irin"ipt". of the -peiformance Efficiency Pillar, Cost optimization, High-Availability
) b;;l;- p;tr";r., Criteria for cloud service selection, Multi-criteria Decision Making, Cloud
Infraitructure security, IAM user' group, roles, and policy'
Modulo ll: ll lecture hours
CtouJ Authentication protocol implementation, Content Delivery, Domain
"orptiun"es,
namesyStem,Contentdeliverynetwork,CDNDemo,Traditionalnetworkarchitecture'SDN
Start-
architecture, SDN controller, OpenFlow protocol, Demo ofSDN, Discussion ofrelated
up, Traditional infrastructure, virtual infrastructure, converged infrastructure. IoT-Cloud
Inirastructure, Autoscaling, Launch configuration, Autoscaling groups, ASC Balancing'
Autoscaling policies, LoJBalancer, Fault tolerance, High availability, Architectural need
of
I-S, npptilution L6, Network LB, Listener, Target groups, Targets, Cross zone load
balancing.

Module III: 9 lecture hours

FI
Be cr::ily, Grcatc: l'lotda
.. r.,(,i1.t.. U:.il '',.:1.)
PIoi I'i c' -), i3, 1 1 , lbch .rr:ne-ll
Greatei r-2-01 -110
 Case Study of a federated cloud, Mobile "backend" as a seruice (MBaaS), Serverless
computing, Business Processing as a service (BPaaS), Virtualization Demo vs
Containerization Demo, Virtualization and Containerization, Virtualized Operating Systems,
Resource to OS-Hypervisor communication, Design of virtualized Database CIusters, Cloud
Regional Backbone Nelworks, Network Troubleshooting, Transcoding and Serving Video
Files Example, Stream Processing Example, Sensor Network Data lngestion and Processing
Example, Application Backend Example.

Module IV: 11 lecture hours

Cloud Monolith Applications. Cloudna-tive Applications, Cloud Enterprise Applications,
Challenges towards HypergroMh of cloudna-tive applications, Evolution of Deployment,
Current Cloud Computing System Designs, Modern Cloud Architecture lntegration, Structure
ofa Cloudna-tive Application, Characteristics ofCloudna-tive Application, Bridging DevOps
Culture with cloud architectural solution, Software development on cloud PaaS,
Microservices, Microservice Architecture, Microservice Architeclure v/s Monolith
Architecture, Developing Cloudna-tive Applications using Microservices, Flexibility and
Scalability in microservice, Pros and Cons of Cloud native Architecture, Microservice Use
Cases, Service Decomposition, Microservice Demo, Strategies for Decomposing a System
into Microservice, Migrating Monolithic Solutions to Microservice Ecosystem, Minimizing
) Dependency to Monolithic Solutions, Orchestration / Choreography of Micro-Services.
Shared Data and Communication, Case Study on Cloudna-tive Development. Advanced
Research Topics.

Text Books :
1. Goessling Scott and Kevin Jackson, lrchitecting Cloud Computing Solutions: Build cloud
strategies that atign technolog,t and economics while elfectively managing rrtt (lst ed.),
Packt Publishing, 2018. ISBN 978-1788472425.

Reference Books :
1. Bahga Arshdeep and Vijay Madisetti, Cloud Computing Sohttions Architect: A Hands-On
Approach (lst ed.), Vpt, 2019. ISBN 978194997801X .

Assessmen t Schem€:

Components Internal Assessment Mid Term Exam End Exam Total

)
W€ightage (70) 50 I5 35 t00
) Minors in AI
(r rr, III, IV)
)

R r
Be ett Universi ty, Greater Noida
(Eslablished U nderAcl24 of Govt,
of Ultar Pradesh)
Plot No's 0, 9, 10, 11, Tech Zone-ll
Greater N oida-20131o
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
ECSE2STM Data Structure Fundamentals L T P C
Owning School/Department Department of Computer Science 4 0 0 4
Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI: To articulate data preparation for data mining and analyzing based on pre-processing
techniques.
CO2: To examine predictive analysis in various use cases.
CO3: To make use ofexploratory data analysis to gain insights and prepare data for predictive
) modellhrg.

CO-PO/PSO Maooins

POr P()2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 POt I POt 2 PSOI PSO2 PSO3
col t 3 I 2 ", 2
coz 3 3 a 2 2 t a 3 2
co3 3 3 2 2 2 2 a 2 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: l4lecture hours

Data Structures (What, Why, Where), Anays, (Search, insert, delete, merge), Linked list,
(Search, insert, delete, merge), bubble sort, selection sort, counting sort, radix sort.

) Modulo ll: l0lecture hours

Circularly and Doubly linked list (Traversal, Insertion, Deletion), Stacks (Traversal,
Insertion, Deletion), Simple Queue (lnsertion, Deletion), Circular Queue (lnsertion, Deletion,
Traversal), Tree Data Structures, Height, Complete, Full, Perfect Trees.

Module Il I: l6lecture hours

Tree Preorder traversal, Postorder traversal, Inorder traversal, Binary search trees, BST
searching, BST insertion, BST deletion, Heap. Max heap, min heap, Heapi!, Heap sort,
Priority queues, Priority queues using max heap and min heap.

Module IV: 7 lecture hours

AVL trees, AVL trees traversal, AVL trees insertion, AVL trees deletion, Hashing, Hash
Functions, Hash Tables, Hashing Collision Resolution Strategies, Separate Chaining, Open

Re r
B e il Unlversity, Greater Noida
(Es '-'i 5 rj U.,Jcr /.cl 2.1 of (;f,v4 clU.:.rPrrdcsh)
Plo t No's B, 9, 10, 11, Tech Zone-ll
Greater NoiCa-201 310
 Addressing, Double Hashing, Graphs, Adjacency matrix, Adjacency list, Incidence matrix'
Graph traversal, BFS, DFS.'
Text
l. Balagurusamy E., Data Structures (l ed.), McGraw Hill Education,2019' ISBN 97E.
93s3161835.

2. Anuradha A. Puntambekar, Dala structures (l ed.), Technical Publications, 2020. ISBN

978-9333223911.

Reference Books :

[email protected],DataStrusturesUsingC(led'),CRCPress,202l'ISBN
ISBN 978-1000470741..

Assesspent Scheme

Components Internal Assessment Mld Term Exam End Exam Totrl

)
20 35 100
Weightsge (%) 45

l.ie
0?/
giti/;;v
liln'f " li ' rrilv, crea Jr Noida
r

3','.1,;?1,,;:.1"1; i,il5 ; il;;'ljl

 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET292 Introduction to Algorithm Design and t. T P C
Development
Owning SchooVDepartment Department of Computer Science 4 0 0 4
Engineering
Pre-req uisites/Exposu re

Coume Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To explain time and space complexity of algorithms.

CO2: To examine the divide and conquer approach for making algorithms.
CO3: To Implement greedy, dynamic, and backtracking algorithm approaches

CO-PO/PSO Mappins
)
POI PO2 PO3 PO4 PO5 t()6 PO7 PO8 PO9 POt0 POt I POl2 PSoI PSO2 PSO3
col I 2 3 I 3 I
co2 I 2 1 I 3 I
co3 I 2 3 I 3 I

l:weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: 12 lecture hours

Algorithms need (Why, what where), Analysing control statement, Loop invariant and the
correctnessof the algorithm, Analysis of Algorithm: Arnortized analysis, Asymptotic
Notations: Big Oh, Theta, Omega. Average, Best and worst-case analysis of Time
Complexity arrd Space Complexity, Iterative method complexity, Recurrence relations,
Master's Theorem.

Modulo Il: l2lecture hours

Divide and Conquer Algorithm, Multiplying large Integers Problem, Binary Search, Merge
Sort, Quick Sort, Complexity analysis of quick soft, Matrix Multiplication (Strassen's matrix
multiplication). Complexity analysis of Matrix Multiplication.

Module III: l2lecture hours

Greedy Algorithms, Disjoint sets union. find, Spanning Tree. Minimum Spanning Tree,
Kruskal's algorithm, Prim's algorithm, Analysis of Minimum spanning trees algorithms,
Single source shortest path in graplrs, Dijkstra's algorithm, The Knapsack Problem, Analysis
of Knapsack problem.

Module IV: 20 lecture hours

vp
' . i': 'i, i:r
,: . ---[[ r)
:lr 7 l'r,:
 Dynamic Programming The Principle of Optimality, 0-'l knapsack problem, Matrix chain
multiplication, All Points Shortest path (Floyd Warshall algorithm), Exploring Graphs: BFS,
Applications ofDFS- bi-connectivity, Backtracking and Branch and Bound, The Eight queen's
problem, Graph Coloring

Text Books :
1. Cormen Thomas H., Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
Introduction to Algotithms (4h ed.),The MIT hess, 2022. ISBN 978-02 62367505.
2. Rocca Marcello La, Advanced Algorithms and Data Structures (lst ed.), Manting,2021.
ISBN 978-1617295485.

Reference Boola :
l, Karumanchi nasimha, Algorithm Design Techniques: Recursion, Baclaracdng, Greedy,
Divide and Conquer and Dywmic Program (lst ed.), Career Monk Publications, 2018.
ISBN 978-8193245255.
)
Assessment Scheme

ComBonents Internal Assessmetrt Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

,-M*,,
Rf;f: !,u.liY:f iiir', Grs; i-p r!r;ir,
gB
* l,: r',igl,ri1','il i"f#Yi,
 Name ofProgram Bachelor of Technology (Compuler Science and
Engineering)
CSET32O Informalion Retrieval L T P C
Owning SchooUDepartment Departm€nt of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion of this course, the students will be able to

COl: Comprehend types oftext analysis, Information retrieval, IR syslem architecture, query
processing models and probabilistic models.
CO2: Manage information retrieval systems by perfonning indexing, compression,
information categorization sentiment analysis, network managenrent, search engine
optimization, records compliance and risk management.
C03: Implement different information relrieval approaches for applications in texl domain.
)
CO-PO/PSO Mannins

POt t)o2 PO3 P()4 PO5 P()6 PO7 PO8 PO9 POt0 POt I POt2 PSOI PSO2 PSO3
cor 3 2 2 3
c02 3 2 2 3 I 2 2 2
c03 2 I 2 2 ) 2 I 2

l:weakly related 2: moderately related 3:strongly related

Coulse Contents:

Module l: 7 lecture hours

Text analysis and types, Information retrieval. Text processing, lndexes and query
matching, Semistruclured text data, Tokenization, Stemming, Lemmatization, Language
modelling, Examples ofopen source IR Systems, Query processing rrodels, Probabilistic
models. Binary independence model, Robertson/Spark Jones weighting formula, Two-
Poisson model, Relevance feedback, Term selection. Pseudo relevance feedback, Language
models, Unigram, Bigram language models, Generating queries from documents,
Language models and smoothing, Ranking with language models, Retrieval evaluation
measures.

Modulo I l: 7 lecture hours

Normalized Discounted Curnulative Gain (NDCG). Kullback-Leibler divergence,
Divergence from randomness, Passage retrieval and ranking, Management of Information
Retrieval Systems, Knowledge management, Infonnation management, Digital asset
management, Network management, Search engine optimization, Records compliance and risk
management, Version control, Data and data quality, Information system failure, Web retrieval
and mining, Semantic web, XML information retrieval, Recommender systems and expert
locators, Knowledge management systems, Decision support systems, Geographic information
system (GIS).

, i,-..r-:,-rl I ; ici --,r

., ')
;l: , r.;-r:-ti
 Module |ll: g lecture hours
Indexing, Inverted indices, Index components and Index life cycle, Interleaving Dictionary
and Postings Iists, Index construction, Query processing for ranked retrieval, Compression,
General-purpose data compression, Symbol-wise data compression, Compressing posting
lists, Cornpressing the dictionary, Information categorization and filtering, Classification,
Probabilistic classifiers, Linear classifiers, Similarity-based classifiers, Multi category
ranking and classification, Leaming to rank.

Module IV: 7 lecture hours

Text Clustering, Partitioning methods, Clustering versus classification, Reduced
dimensionality/spectral methods, Lexicons, Corpora, Sentiment Analysis, Document-level,
Sentence-level and Aspect-based sentiment analysis, Web crawling, Near duplicate pages,
Distributed word representations, Link Analysis, PageRank algorithm, Search engine bias,
Personalized searching, Question Answering, Cross lingual retrieval, Adversarial
Information Retrieval.

Text Books :
) l. Buttcher Stefan, Charles L. A. Clarke and Gordon V. Cormack, Information Retrieyal;
lmplemenling and Evaluating Search Engines (l ed.), The MIT Press. 2016. ISBN 978-
0262528870.
2. Croft W. Bruce, Donald Metzler and Trevor Strohman, Search Engines - lnformation
Retrieval in Practice (l ed.), Pearson,2009. ISBN 978-0136072249.

Refe Books :
l. Bates, M. J., Understanding information retrieval systems: managemen| types, and
standards (l ed.), Auerbach Publications, 201 l. ISBN 978-1439891964.

Assessment Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (7o) 45 20 35 t00

RWv,,
f -'4{ li I li.:J Tq,. ., C'renter- I\loicja
(l:tl,ll i : I li :r' *l I c,i ajo.l, ol Iltt.r Prailesh)
1'
[:l.rt iic,' ; U, !), -lir, 1 i, Iech Zorre-ll
Gr,]at:ri- [ :ci{-ia-11[)i 31 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET321 User Centered Design I, T P C
Owning School/Department Department of Computer Science 2 0 2
Engineering
Pre-requisites/Exposu re na

rse Outcomes COs

On completion ofthis course, the students will be able to:

COl: Articulate appropriateness of potential design methods such as contextual design,

prototyping, ideation given a problem setting.
CO2: Exarrine the issues and challenges to achieving a user-cantered design process.
CO3: Implement design methods at a basic level of competence: interviews, personas,
storyboarding. sketching, and evaluation"

)
CO-PO/PSO MaDDins

POt Po2 PO3 PO4 PO5 PO6 PcJ1 PO8 PO9 POl0 POI I PO t2 PSOI PSO2 PSO3
col I 2 3 3 I I
co2 2 2 2 2 , 3
c03 2 3 2 3 J 3 3 2 I 2

l:weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: S lecture hours

User Centred Analysis (UCA), Mental models, knowing how the user works, Learnability, User
model vs System Model, Which UCA steps to perform, Obstacles of user-centred analysis.
Retum on Investment (ROt), Justifuing the right process, Creating a Design Strategy:
Components of a design strategy, Site strategy drives design strategy, Where to get strategy
information. Mining existing documentation, Working with brand objectives, Design
) techniques: Sketching, Scenarios, Storyboards, Design patterns.

Modulo lI: glecture hours

Profiles and Personas, Value of profiles and Personas, User profiles, Task profiles,
Environment profiles, Data gathering metlrods, Choosing the right method, Elements of field
interview, Developing interview questions, Good and bad interview technique, Conducting a
user observation. Complementary Data Gathering Methods: Value of complementary
methods, Focus groups, User group meetings, Usability roundtables, Complementary Data
Gathering Methods, Facilitated workshops, JAf) sessions, Using surveys and other indirect
methods, Online surveys, Using multiple methods.

Module tll: ll lecture hours

Primary Noun Architecture, Describing primary nouns, Primary noun views, Primary noun
details, Primary nouns to navigation, lnformation Architecture, Costs of poor organization,

Etil
"#.. .. ,, .. : :.j i(lx
.| .: ' :,,;i r, Ii.,i'ih)
, . '.t i: I i ,,, 'i , , ,i-:e;ir .l".li:e-ll
ri,-i..:.:1:,.,;.ri0
 Basic organization schemes, Hybrid schemes, Shallow vs. deep structures, Labelling systerns,
Information Architecture, Affinity diagrams, card sorting techniques, card sorting tools,
Getting sign-offon the contract for design, using concept sketches to drive out requirements,
Setting usability criteria, Scenario and rask Analysis: The power of a scenario, Scenarios vs.
use cases, Determining the level of detail, Scenarios driven priorities. Scenario and Task
Analysis: Identifoing functions and tasks, common errors and challenges in task analysis,
Characterizing the new task design, Primary Noun Architecture: Value of primary nouns,
Identifoing primary nouns, Domain Analysis, Requirement analysis.

Text Books :
1. Lowdermilk Travis, User centred design: A Developers Cuide (l ed.), O,Reilly Media,
20 r3. ISBN 978-1449359805.

Referen Books :
I . Steve Krug, Don't make me think Revisited: A common sense approach to web usabitity (3
ed.), Berkeley CA: New Riders Publishing, 2020. ISBN 978-032t965516.
) 2. Travis, D., and Hodgson, P.,Think Like a UXResearcher: How to Observe Llsers,Influence
Design, and Shape Business Strategl (l ed.), CRC Press,20l9. ISBN 978-l 138365292.

Assessmen t Scheme

Components Internal Assessment Mid Term Exam End Exrm Iotal

Weightage (o/o) 45 20 35 100

Mt
F' '
- ,r (-li ' r i I r:-ll:
;il r; ;'ll)
.,\, -.rirZ:,;r':-li
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET322 Secure Codi L T P C

Owning School/Department Department of Computer Science 2 0 z J

Engineering
Pre-requisites/Exposu re

Course Ou omes (COs)

On completion ofthis course, the students will be able to:

CO1: To explain secure programming philosophy. design principles, and its methods.
CO2: To examine typical mistakes done during programming and the methods of their
handling.
CO3: To implement the typical threats in prograrnming and understand concepts of
implementing the secure codes.

CO.PO/PS O Mannins

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POI I PO l2 PSOI PSO2 PSO3
1
col 1 2 2 2 2
c02 3 3 , 3 2 1

3 1
co3 I 3 3

l:weakly related 2= moderately related 3:strongly related

Course ontents:

Module I: holrs glectur€

Secure Programming. Robust vs. Secure Programming, security Policies and Procedures,
checking Design and Implementarion, where to Look for Vulnerabilities, Classification of
Security Flaws, Landwehr"s Taxonomy. Fortiry Taxonomy, Protection methods at different
layers, PreDeCo matrix of software security. lnput Validation in Programming, lmproper Error
and Exception Handling, Code Injection and Mitigation, Broken Authentication..
)
Moduto II: 6lecture hours
Secure Programming Design Principles, Principle of Least Privilege, Fail-Safe Defaults,
Principle of Economy of Mechanism, Principle of Complete Mediation, Separation of Privilege
Principle, Principle of Open Design, Principle of Least Common Mechanism, Principle of Least
Astonishment, Control Hijacking Attacks and Defences. Attacks Using Virtual Machines,
Static and Dynamic Analysis, Language-based Security Models, Isolation Techniques.

Module III: 13 lecture hours

XML Extemal Entity (XXE), Cross-Site Suipting (XSS), Insecure Deserializtion, LFI
(Local File lnclusion) and RFI (Remote File Inclusion) vulnerabilities, Unvalidated File
Upload vulnerability, Buffer Overflow vuhrerabilities, Client Side Security, JavaScript
Security, Click Jacking, Ajax Security, HTML5 Security, Java Secure Socket Extension

,fu:
ct.1

ll a
 (JSSE), Common Coding Enors and Vulnerability, Automation and Testing for secure coding,
Research Issues in Secure Coding.

Text Books :
l. Richardson T. and Thies C. N., Secure Software Design, Jones & Bartleft Leaming (l ed,),
Jones & Bartlett, 2012. ISBN 978-1449626327.

Reference Books :
l. Codings Zach, Computer Progranming and Cyber Security for Beginners (l ed.),
Independently published, 2020. ISBN 978-l 801091442.
2. Seacord Robe( C., Secure Coding in C and C++ (2 ed.), Pearson Education, 2013. ISBN
978- 0321822130.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

) Weightege (%) 45 25 35 100

,h/,.
a{Krar
Bennett U tive:.s;t),, Greater Noida
b%1',il',";, r:' i'; :!','I# ;;'!;X:'l,l
Lireater N;oida-201 31 o
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET323 Compiler Construction L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

Course Ou mes (COs)

On completion ofthis course, the students will be able to

COl: To articulate major phases of compilation.

CO2: To examine various parameters passing, scheme, explain memory management of a
programming languages and perform code optimization.
CO3: To Implement lexical analyzers, parsers, and small compilers by using general purpose
programming languages.

) CO-PO/PSO Maooinp

POt P02 PO3 PO4 PO5 PO6 PO7 PO8 P(]9 PO t0 POI I PO t2 PSOI PSO2 PSOS
col 2 2 I 3
co2 2 I I 3 2 , 3
co3 3 3 ) ) 3 2

l:weakly related 2: moderately related 3=strongly related

Course Contents:

Module I: l0lecture hours

Compiler, Code Analysis, Interpreler, Single Pass, Two pass, Multi Pass compiler,
Preprocessor, Macros, Phases of compiler, Symbol table manager, Operations on symbol table,
Error handling, Bootstrapping and cross compiler, Lexical Analysis, Tokens, Regular
expression, Oeneration of lexical analysis from DFA, Syntax Analysis, Parser, Context Free
Grammar, Conversion Rule for Ambigous To Unambigous Grammar, Non-Deterministic &
Deterministic Grammar, Left Recursive And Right Recursive Grammar, Parsing: Top down
and Bottom up, Backtracking and their automatic generation, LL (l) Parser, LR Parser, LR (0)
items, SLR ( I ). LALR ( I ), Canonical Parsing..

Modulo ll: glecture hours

Error Analysis, Error Classification, Error detection, Error Detection in LL and LR parsers,
Error recovery, Panic mode error recovery, Static semantic, Intermediate code generation,
static semantic analyses in declaration processing, name, and scope analysis, S-aftribute,
Semantic analysis through S-attribute gral'nmar, L-aftribute, Type checking, Language features
influencing run time memory management. Parameter passing mechanism, Division of
memory into code, stack, heap and static, Activation record, Garbage collection, Code
generation for expressions, issues in eflicient code generation

Module II l: 9lecture hours

 Sethi Ullmar algorithm, optimal code generation, Retargetable code generation, Code
generation for control structures, code optimization, Local and global optimization, control
flow analysis' Data flow analysis, Global optimizations, Graph colouring in optimization, Live
ranges ofrun time values.

Text Books :
1. Sunitha, K. V. N., Compiler construction (l ed.), pearson Education India 2013. ISBN
978-9332500297.
2. Thain Douglas, Introduction to Compilers and Language Design (2 ed.), Lulu.com, 2019.
rsBN 978-035914283s.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

U/
Reoj/fiar
Be&'d-it U n,versity, Greater Noida
(Bl rlill:.-'J Il'd:r /:::rtr (" (':nvl of Ultar Pradesh)
Plot Nc'r 3. C. 10. 11, Tech Zone-ll
Gr€atei Noida-2013'10
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET324 Software Project Management L T P C
Owning School/Department Department of Computer Science 2 0 2 3

Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion of this course, the students will be able to:

COl: To articulate and determine the purpose and importance of basic processes involved in
project management from the perspectives of planning, tracking and completion of project.
CO2: To examine different organization structures and project structures.
CO3: To implement programs to manage project management. project schedule, expenses and
resources with the applications of project management 1ools.

CO-PO/PSO Mannins

POI PO2 PO3 PO4 PO5 I'O6 PO7 PO8 PO9 PO t0 POll POt2 PSO I PSO2 PSO:l
cor 2 I 3 3 t 2
c02 I 2 l 3 3 3 3 3
c03 I 3 3 3 2 J 2 2 2 3 3

l:weakly related 2: moderately related 3:strongly related

CouI.lSe Contents:

Module I: l0 lecture hours

Project Management: Characteristics ofsoftware projects, Objectives, Slakeholders, Feasibility
Study, Cost-benefit Analysis, Planning, Project Execution, Project and Product Life Cycles,
Role of project manager, Knowledge areas, Tools & Techniques, System view of project
management, Agile software, Iterative steps for planning, Project Plan documentation methods,
Software Requirement Specification, Measurement and Control, Reviews, feedback and
) reporting mechanisms, revisiting the plan, Scope Planning & Scope management plans.
Function point calculation, Scope definitions & project scope statement, Project time
management, Activities sequencing, Network diagrams, Activity recourse estimation, Activity
duration estimation, Schedule development. Gantt Charts, Critical path method' Program
evaluation & review technique (PERT) and CPM, Principles of cost management, Cost
estirnating, Type of cost estimate, Cost estimate tools & techniques, COCOMO.

Modulo ll: T lecture hours

Putnam/SLIM model Estimating by Analogy, Cost budgeting. Cost control, Earned
value management, Project portfolio management. Project Quality Planning, Quality
Assurance, Quality control, Tool & techniques for quality control, Pareto Analysis, Six Sigma'
CMM, ISO Standards, Juran Methodology, Project Human resource planning, Project
organisational charts, Responsibility assignment metrics, Acquiring project team, Resource

4fr.
 Project Communication
assignment, resource loading, Resource levelling, Team structures'
tlarining, Performance reporting, Managing stakeholders'

Module lll: ll lecture hours

ProjectRiskManagementplanning,Commonsources.ofrisk,Riskidentificationtechniques,
qr"titutir" risk aialysis, Experi judgement, Decision Expected monetary value'
-trees' & control' Projecl
S-irofutior, sensitivity analysii, nist response planning, Risk monitoring
pr'o*r...r, .unug.n,.nt ilun., Contrac; statement of work' Planning contracts' Requesting
seller responses, seiecting sellers, Administrating the contract,
closing the contract, software
elements (SCI's)'
Configuration Managemint, Retaining versions, Software Configuration
Change Control and Management.

Text Books :
A practitioner's approach (9
1. Pressman Roger and Bruce Maxim, Software Engineering:
ed.), Tata McGraw Hill, 2020. ISBN 978-1259872976'

Referetrce Books :
for Sofrware
1. Aggu*ul M*uj and TetraTutorials Team, The Art of Project Management
) oii IT Engin""r, (l ed.), Packt Publishing, 2018' ISBN 97E-1789804768'

Assessment Scheme

Internal Assessment Mid Term Exam End Exam Total

Components

20 35 100
Weightage (%) 45

()

W,
EEHI#(r",**ity, Grvl, Greater Noida
;;,il ;.','l ,i .r...i ii
. 2.1 ui uiLv Pridesh)
FiJi ftu'Jl, s, io, 11, Tech zone-ll
Greatei ficica-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET325 Digital Communication L T P C
Owning School/Departmenl Department of Computer Science 2 0 2 .,
Engineering
Pre-req uisites/Exposure

Course Oul mes (COs)

Orr cornpletion ofthis course. the sludents uill be able to:

col: To explain digital communication systems with emphasis on digital modulation

techniques.
CO2: To irnplement information theory and channel coding/decoding.

CO-PO/P Maoninc

POI P02 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POI I PO t2 PSO r PSO2 PSO3
col 3 I I I 2
co2 t 3 I I I 1 3
c03 3 2 3 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: g lecture hours

Digital communication, Elements of Digital Communication, Classification of Signals,
Deterministic and Random Signals, Periodic and Non-periodic Signals, Analog and Discrete
Signals, Sarnpling Theorem, Methods of Sampling, Random Signal Analysis, Random
variables, Limit theorerns for sum of random variables, Random variable flunctions,
Information Theory, Mathematical Models for Information Theory, Logarithmic Measure of
Information, Coding of Information Sources, Coding Algorithms, Lossy Data Compression,
Statistical Signal processing, Linear models of random signals, Estimation Theory,
Quantization, Uniform Quantization, Nonuniform euantization, Statistics of Speech
Amplitudes.

Modulo II: 8lecture hours

Pulse Code Modulation (PCM), Sampling in PCM, euantization in pCM, Encoding.
Logarithmic PCM, Differential PCM, Delta Modulation, Delta Sampling, Delta euantization,
Baseband Processing, Orthogonality in digital signal, Signal Noise, Signal-Space Analysis,
Likelihood Functions, correlation Receiver Structure, Bandpass Modulation, Amplitude Shiff
keying (ASK), Frequency Shift Keying (FSK), Binary phase Shift Keying (BpSK). euatemary
Phase Shift Keying (QPSK).

Module lll: I I lecture hours

Differential Encoding, Performance of BPSK and QpSK, Multiplexing, Frequency division
multiplexing, Time division multiplexing, Channel coding, Types of Error control, Structured
 Sequences, Block codes, Linear Block codes, Error correction, convolutional
Encoding,
coding Modulation Trade-off, Spread Spectrum, Direct Sequence Spread spectrum
systems,
Hopping Spread-spectrum, Spread-Spectrum as Multiple Access, Code_Division
flequency
Multiple Access, Time-Division Multiple Access.

Text Books :
I Proakis J.G. and Masoud Salehi, Drgfta I Communication (l ed.), McGraw Hill, 201g. ISBN
978-9353163020.

Refe nence
I Lathi B. P., Zhi Ding, Modern Digital and Analog Communication (5 ed.),
Oxford
University Press, 2018. ISBN 978-0190686840.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

) Weightage (%) 45 20 35 100

")

.w_
pendSft t rnivcr.;ly, Greetcr Noida
Fi", a'C' i ;:!q;',.r:i[ *,i:1,1
G "Li;Nr.i,:la-20 1 :r 1 0
reater
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET326 Soft Computing L T P C
Owning SchooUDepartment Computer Science Engineering and 2 0 2 J

Technology
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion of this course, the students will be able to:

COI: To comprehend the fuzzy logic and the concept of fuzzy set theory in soff computing.
CO2: To examine Neuro-Fuzzy and Genetic Algorithm expert system.
CO3: To implement applications on different soft computing techniques like Fuzzy, Multi
Objective optimization and Genetic Algorithm (GA).

) CO-PO/PSO MaDDins

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POI I PO t2 PSOI PSO2 PSO3
col 3 2 2
c02 3 ", 2 3 2
co3 3 I 3 , 3 3 2 3

l:weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: T lecture hours

Soft Computing, Key characteristics and applications of soft computing, SoIl vs. Hard
computing, Fuzzy logic, Fuzzy set, Crisp vs. Fuzzy Set, Fuzzy Set Properties, Operations on
Fuzzy set: Union. lntersection, Complement, Sum and Difference, Equality and Power,
Cartesian Producl, Fuzzy lfThen Rules - Fuzzy Reasoning, Fu,zzy membership functions,
Gaussian membership function, Sigmoid membership function, Triangular membership
) function, Trapezoidal membership function, Fuzzl proposition, Fuzzy interferences, Fuzzy
relations- Max-Min Approach, Fuzzification - Defuzzification, Fuzzy Logic Controller,
Neuro-Fuzzy modelling.

Modulo lI: 7 lecture hours

Multi Objective Optimization, Multi-Objective Evolutionary Algorithm. Pareto based
Approach, Non- Pareto based approaches, Genetic Algorithm (GA), GA working architecture,
Genetic representations, GA Encoding and Selection Techniques. Survival of the Fittest,
Fitness Computations, GA Crossover Techniques, GA Mutation, Reproduction, Rank method,
Rank space method, GA Case Studies: Optimisation of traveling salesman problem using
Genetic Algorithm, Genetic algorithm-based Intemet Search Techniques.

Module 1l l: I I lecture hours

1.,{.:
)I:.ii,,-.Crlili-r, l\r,1,:C;i
.l,,:li 1.. r,l ,t)
I .):ti,-ii
 Evolutionary Algorithm, Ant system, Ant corony optimization, Max-Min Ant
system, Ant
Miner, Snake-Ant Algorithm, particre Swarm optimization, Artificiar Bee corony, cuckoo
Search Algorithm, working architecture, co-evorution, plasticity and life-tim; Iearning,
Lamarckian learning, 'No free lunch.' theorem, Hybrid fuzzy controller, Ftzzy Logic
Controlled Genetic Algorithms.

Module IV: 6 lecture hours

Genetic Algorithms-Neural Networks, Neurar Networks Fuzzy Logic, Extreme Learning
Machine, Training SLFN using ELM, Extreme Leaming Machine, Variants of ELM,
Applications of ELM, Extended ELM.

Text Books :
l. Kaushik Saroj and Sunita Tiwari, soft Computing, Fururamentars, Techniques and
Applications (l ed.), McGraw-Hill Education, 201 8. ISBN 978-9353160678.
2. Sivanandam, S. N., and Deep4 S N, principles of soft compuring (l ed.), John Wiley &
Sons, 201 l. ISBN 978-8126527410.

) Reference Books :
I . Buontemp F., Genetic Algorithms and Machine Learning
for programmers (l ed.\,
Pragmatic Bookshelf, 2019. ISBN 978-1680506204.
2. Gridinl., Learning Genetic Algorithms with python ( I ed.), BpB publications, 2021 . ISBN
978- 8t94837756.

Assessment Sc heme:

Components lnternal Assessment Mid Term f,xam End Exam Total

Wcightage (%) 45 20 35 100

")

R I
l-lni ic:"si1v, Greater I'loida
(Eiii.Ll.l i,i: I li I r /,,r' :.;'ri (:l,r!-i, i l U,t r i,r,'iacsh)
Plot i\io'j Ij, I, 1U, Ii, Tech Zone-ll
Grcetlrr Nir;,irla-201 31 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET327 Embedded Systems L T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

Col: To explain the functionar difference between generar computing systems

and Embedded
systems.
Co2: To articulate the architecture of the ATOM and ARM processor and its programming
aspects (assembly Ievel).
Co3: To examine partition among HW and SW a high-rever functionarity with
emphasis on
the interaction with the network and operating system. Model, design and
verifu a complex
digital device.

CO-PO/PSO Maonins

POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 POt0

PO9 POII PO t2 PSOr PSO2 PSO3
cor 3
co2 3 , 2 3
co3 2 , 3 I

l=weakly related 2= moderately related 3:strongiy related

Cou nse Contents:

Module l: lolecture hours

components of Embedded systems, Appricalion areas of Embedded
System, Characteristics
ofan Embedded System, Hardware and Software buirding brocks ofEmbedded systems,
core
of Embedded system, Embedded system vs general Computing system, Architecture
of an
Embedded System, Embedded product Development Life Cycl; (EDLC),
Analysis, Design ,
and lmplementation of embedded system, pros and cons of an rmuediea systlm,
classification ofEmbedded systems Based on performance and Functionar
Requirements, IA
Architecture and features, ATOM processor and its addressing modes,
Advanced RISC
Machines (ARM) processor, Registers and Memory accesses, Memory
map and Instruction
set, Segmentation and Task switching. paging, Hyper+hreading, Caches,
ani TLB, Execution
pipeline, Optimization in Embedded Svstems.

Modulo lI: 9 tecture hours

case Study: Multimedia handsets and DVB-MHP Set top Boxes, Middreware
for chip
Integration, System Middleware for Runtime Environment Abstraction,
Firmware for
Embedded Systems, Embedded Computing Software Environment, Interrupts,
VT. FSB
Architecture, Chipset overview and function, Steps before Boot sequence,
BOOT up

i. i:l(i':.,:tl :l'..'.f: ..1r :h)

.r':, a:. i!, i'i ,'l.cir Zorie-ll
i ..;; ,:-11i.)-i -li 0
 sequence, Embedded Computing Hardware Architecture, Platform-based Design Concept,
FPGA-based System Design.

Module lll: I I lecture bours

Embedded Processor Cores, Hardware and Software lnterfaces, HW-SW Interface Design,
Bus Protocols (12C, AMBA, Core Connect, and Wishbone), Hardware-Software Co-Design,
System Models and Formalisms, System Co-design Flow, Verification and Debugging ofa
Co-Designed System, Embedded systems using Atom processors, Complex Embedded
Systems and Embedded Multimedia System Co-Design.

Text Books :
L Shibu K. Y., lnrroduction to Embedded Systems (2 ed.), Tata Mccraw, 2009. ISBN 978-
93392t9680.
2. Kamal Raj, Embedded Systems Architecture, Programming, and Design (2 ed.), Tata
McGraw Hill, 2008. ISBN 978-9332901490.

Reference Books :
) l. Barry Peter and Patric Crowley, Intel architecture for Embedded sysrez (l ed.), Morgan
Kaufmann, 201 2. ISBN 978-01 239 I 4903.
2. Woff Wayne, Computers as Components: Principles of Embedded Computer System
Design (4 ed.), Elsevier, 2020. ISBN 978-0128053874.

Assessment Scheme:

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (7o) 45 20 35 100

i'('r'i :: i\1.,i{i.l
, lr, ,,-iit i,r.,r;c-ii
1l::': i)
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET328 Distributed com putin L T P C
Owning SchooUDepartment Department of Computer Science 2 0 2
Engineering
Pre-requisites/Exposu re

Cou Outcomes (COs)

On completion of this course, the students will be able to:

col: To articulate the moders, architectures, and the concept of virtuar clock and crock
synchronization. (BTL-2).
co2: To examine the algorithms for mutual exclusion, deadlock detections. and termination
detection. (BTL-2).
Co3: To irnplementing the concepts ofdistributed computing on Googre Fire System
, Hadoop
Distributed File System ( HDFS ), and sensor networks. (BTL-3).

CO-PO/PSO Mannins

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POr I POl2 PSO I PSO2 PSO3
col 3
co2 l
3 2 2 3
co3 2 3 3 2 3 2 3

l=weakly related 2: moderately related 3:strongly related

Course Con tents:

Module 1:
E lecture hours
Introduction, process communication, Message passing, Leader Election, Leader
election
algorithm, Distributed Moders, causarity and Logicar rirne, Size of vector
clock, Matrix
clocks, virtual Time and physicar crock Synchronization. Grobar state and
Snapshot
Recording Algorithms, Distributed Mutuar Excrusion and Non-Token
based Approaches,
Quorum Based Distributed Mutual Exclusion Approaches: Maekawa,s Algorithm.
Modulo Il: T lecture hours
Distributed Mutual Exclusion-Token based approaches, Consensus & Agreement,
checkpointing & Rollback Recovery, Deadlock Detection in Distributed svstems.
Approaches' Algorithms for deadrock detection: path-pushing. Edge Chasing,
Diffusiorr
compution. and GIobal state detection Distributed Shared Memory, Features and
advantage,
Distributed Minimum Spanning Tree.

Module lll:
7 lecture hours
Termination Detection, Huang's argorithm, Message ordering & Group
Communication,
Fault Tolerance and self-stabirization, Distributed Randorniied Argoiithms,
Distributed
Hash Tables and Peer to Peer Computing.

t,'r.,ir
,. ', ; .,-,r,:a,-il
.;iriil
 Module IV: 13 lecture hours
Case Studies: Google File System and HDFS, Distributed Execution using Map Reduce,
Introduction to spark, Introduction to Sensor Networks, Distributed Algorithms for Sensor
Networks: Coverage and Connectivity, Topolory Discovery, LEACH Cluster based Low
-
Power Algorithm, Authentication in Distributed systems, security in Distributed systems and
Block Chain.

Text Books :
1. Maarten Van Steen and Tanenbaum Andrew S., Distributed Systems (3 ed.), Amazon
Digital Services, 2017. ISBN 978-1543057386.

Reference Books :
l. Aspnes James, Nores on Theory of Distributed Sys/ens, yale University,
202 Lhttp://www.cs.yale.edu/homes/aspnes/classes/465/notes.pdf.

Assessment Scheme:

) Components Internal Af,sessment Mid Term Exam End Exrm Totel

Weightage (%) 45 20 35 100

Dll,.
Reg${ar
B:nr{clt Lrnivcrsity, Greater Noida
(Eii?biiih.d U-i,rAci 2,'1of Gc\,t, of U[ar predesh)
Plot i,lo's 8, 9, 10, 11, Tech Zone-ll
Greater Noida-20'1310
 Name ofProgram Bachelor of Technology (Computer Science rnd
Engineering)
CSET329 Engineering Optimization L T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COl: To articulate, Identi! and develop operational research models from the verbal
description ofthe real system.
CO2: To examine the mathematical tools & software that are needed to solve optimization
problems.
CO3: To analyze the results to resolve resource optimization.

CO-PO/PSO Mannins

POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 POtl POt2 PSO I PSO2 PSO3
cot 2 I I I 2 I 3 2 3
c02 3 , 3 2 3 t I )
co3 I I 3 2 ) 3

l:weakly related 2= moderately related 3:strongly related

Course ontents:

Module I: T lecture hours

Need of Optimization, Development of Optimization, Engineering Applications of Optimization,
Design Vector, Design Constraints and Constraint Surface, Objective Function, Objective Function
Surfaces" Stationary Points: Functions of Single and Two variables, Convexity and Concavity of
Functions ofOne and Two Variables, Optimization ofFunctions of Single and Two Variables, Multiple
Variables Subject to Equality Constraints, Lagrangian Function, Hessian Matrix Formulation, Eigen
Values Kuhn-Tucker Conditions.

Modulo Il: ll lecture hours

Linear Programming (LP) Problem, Canonical Form of LP Problem, Assumptions in LP Models,
Elementary Operations, Craphical Method for Two Variable Optimization Problem, Branch-andBound
Method, Sequential Linear Discrete Programming, Ceneralized Penalty Function Method, Ceometry
and Formulation of LPP, Craphical Solution, Duality Theory, Duality in LP, Primal- dual Relations,
Dual Simplex Method, Post Optimality Analysis, Kannarkar's Projective Scaling Method. Network
Models, Shortest-Route Problem, Maximal Flow Model, CPM and PERT, Transportation Model,
Nontraditional Transportation Models, Transportation Algorithm, Hungarian Method, Probability
Theory, Random Variables and Probability Density Funclions, Stochastic Linear Programming,
Stochastic Nonlinear Programming, Objective Function and Consraints, Stochastic Geometric
Programming, Heuristic Programming, Local Search Heuristics, Tabu Search Algorithm, Simulated
Annealing Algorithm.

t/'
ry
 Module III: l0 lecture hours
cenetic Algorithms, Differentiar Evolution, particle swarm optimization, Ant corony
optimization, crow
Search Algorithm, Firefly Optimization Algorithm, Harmony Search
Algorithm, TeachingLeaming-Based
optimization, Honey Bee Swarm optimization Algorithm, Reduced Basis Technique,
Design variabre
Linking Technique' Incremental Response Approach, Basis vector Derivalives
, of Statio Displacements
and stresses, Multi-objective optimization, paraller processing, utility
Function Merhod, Inverted utility
Funclion Method. Global criterion Method, Bounded objective Function Method,
Lexicographic uethoi,
Goal Programming Method, Coal Attainment Method, Game Theory Approach,
Inventory problem: A
Supply chain Perspective, static Economic-order-euanrity Models,
Dyriamic Eoe Moders, sticky rssues
in lnventory Modeling.

Text ks:
1. Singiresu S. Rao , Engineering Optimization Theory and practice (5
ed.), John Wiley & Sons, 2019
rsBN 978- l I19454?17_ I

,.,'
Reference Books :
l. Taha H.A, Operotions Research: An rntrodaction (10 ed.), pearson clobar Edition,2ol7. ISBN
) 978-0t34444017.

Assessment Scheme

Components Internal Assessment Mld Term Exam End Exam Totrl

Weightage (o/o) 45 20 35 100

ln,
&Wstrar
,fcr rnctt Univcr.;it5r, Greater Noida
(Establisircd lJi:rji,rrA0t 24 olOod, of Utlar Pradesh)
Plot No's B, 9, 10, 11, Tech Zone-ll
Greater Ncida-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET33O Wireless Networks L T P C
Owning School./Department Department of Computer Science 2 0 2
Engineering
Pre-requisites/Exposure

Cource Outcomes (COsl

On completion of this course- the students r.r ill be able to

COI: To explain where the wireless technologies can be applicable and evolving wireless
technologies and standards.
CO2: To articulate the architecture of various wireless technologies.
CO3: To experiment with various wireless technologies through hands-on projects.

CO-PO/PSO MaDDins

PO PO PO PO4 PO5 PO PO PO PO POI POI POr PSO PS02 PSO

,7
2 , 6 8 9 0 I 2 I J
CO 2 2 I I 2 3 I 2 2 I 2 )
,|
CO I 2 2 I 3 1 I 1 7 I 1 I 3
2
CO ) I ) , I ) I I I , 3
3

l=weakly related 2= moderately related 3=strongly related

Counse Contents:

Module I: 9 lecture hours

Wireless technologies: Cellular systems, satellite systerrs, broadcast systems, wireless LANs.
) Propagation modes, Fading in the Mobile Environment, Characteristics of wireless
transmission (signals, antennas, multiplexing, modulation, interference). Signal Encoding
Criteria, Digital Data, Analog Signals, Analog Data, Analog Signals, Analog Data, Digital
Signals. Frequency Hopping Spread Spectrum, Direct Sequence Spread Spectrum, Code
Division Multiple Access, Generation of Spreading Sequences.

Modulo II: 10 lecture hours

Recent trends in Wireless Networking Technology, Layered architecture for Wireless
communication, Wireless TCP, Physical and Logical Architecture. Radio and Infrared
Communication. Satellite Communications, 802.1 I WLAN Standards. 802. I I MAC Layer,
802.11 PHY Layer,802.ll Enhancements, Other WLAN Standards like 802.11g,802.11n and
802.11p. Wireless sensor network platforms, Communication architecture and protocols,
Energy Management, Area Optimization, Time Synchronization, Duty Cycle Optimization,
Sensor Data Acquisition, Processing and Handling.

i ':r i-
'-,- ,. (.':" i-i: r ir|--::1,r
r.. ., t r ,. ; , . ) , .. l r i l r

.
r

-,,,, ii:rll Zo,l::-li

t.t i:r i0
 9 lecture hours
Module III:
(IEEE 802'15'1), Wireless USB-' ZigBee
Wireless Personal Area Network Standards, Bluetooth
Gigabit Wireless LANs' 5G Technolory:
iie;E 80i.is.a, Infrared Data e-sto"i"tion (I'DA),b"tJ"tion System for WSN' Anomaly and
Small Cells, Massive MIMO, T-W""t, lntt"io"
ili*." O"i.r,i"r, Evolution of "effufat systems, 6G Technologies' Starlink wireless' 7G
Technologr: lntelligent Communication of the Inevitable'

Text Books l
C ommuntcation Networlcs and Systems (l ed')' Pearson'
1. Beard C and Stallings W. , Wireless
201 5. ISBN 978-l 292108728.
2.GordonColbach,lfiiretessNetworking:IntroductiontoBluetoothandWiFi(1ed.)'
Independently Published, 201 7' ISBN 978-19732521 l5'

Reference Books :
'1. velrajan saro, An Infioduction to 5G lnireless Networks ('l ed'), Amazon Digital services
LLC - KDP Print US,2020. ISBN 979-E643303107'
) and Candidate
2, Vannithamby R. and S, Talwar, Towards 5G: Applications' Requirements
Technologiis (1ed.), John Willev & Sons,20l7' ISBN
978-l I18979839'

Assessment Scheme

Internal Mid Term Exam End Exam Total

Components
Ass$sment

20 35 100
Weightage (%) 45

R r
t University, Greater Noida
(Eslabriai:. a l.liid.-.r Acl2,l of Govl, of Ultar Pradosh)
Plot hJc:; 8, 9, 10, 11, Te ch Zone-ll
Greater I'loirJa-201 31 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET33I Combinatorics L T P C
Ownin g School/Department Department of Computer Science 2 0 2 J
Engineering
Pre-req uisites/Exposu re

Course Outcomes (COs)

On completiorr of this course- lhe students will be able to:

COI: To explain knowledge of combinatorics, nunrbers, and probability theory.

CO2: To articulate combinatorial problems, extract and interpret descriptive statistics from
social networks, search engine and hypergraphs.
CO3: To implement and design various quantitative properties oflarge combinatorial structure.

) CO-PO/PSO MaDDins

I POr PO2 PO3 PO4 PO5 P06 PO7 PO8 PO9 PO t0 PO PO t2 PSOI PSO2 PSO3
col ) 2 2 a I I I I 2
,|
coz 3 2 2 I 3 2 2 2 2 2 3 3
cc)3 2 I 2 I I 2 3 2 ) 2

l:weakly related 2: moderately related 3=strongly related

Course Contents:

Module I: S lecture hours

Combinatorics, Counting and product principle, Counting over counting and sum principle,
Function and bijection priDciple, Relations and equivalence principle, Pigeonhole principle,
Subsets, Partitions, Subsets offixed size, Subset of multiset, Subset ofcombination, Binomial
theorem and Pascal's triangle, Binomial Coefficients, Congruences, Congruence of binomial
coefficients, Permutations, One-line notation, Two-line notation, Canonical cycle notation,
) Estimates for factorials, Stirling's Approximation, Ramanujan's factorial approximation,
Selections, Equivalence and order, Finite topologies,0 or 1 points,2 points.

Modulo ll: T lecture hours

Compactness and countability. Connectivity, Separalion axioms. Cayley's Theorem on trees,
Algebraic topology, Generating Combinatorial Objects, Generating Subsets, Variable Size
Decrease Algorithms, PageRank (PgRk) algorithm for searching engine, Kernel Networks for
paftern analysis, Partially ordered sets or Posets, Graded poset, Lattices. Metroid, Linear
extensions ofposets, Distributive lattices, Propositional logic, Chains and antichains, Products
and dimensions.

Module Illr 7 lecture hours

WL
(
/ .r i:)
[-
r-:tt):.oriu'-li
(
 Mobius function of poset, Famous Number Families, Multinomial Coefficients, Fibonacci
Numbers, Lucas Numbers, Stirling Numbers, lnteger Partition Numbers, Bell numbers,
Recurrence Relation and Generating Functions, First order recurrence relation, Second order
recurrence relation, Non- homogeneous recurrence relation.

Module IV: 6 lecture hours

Combinatorics on graphs, Infinite Combinatorics and Graphs, Counting trees, Minimal
spanning Trees, Chromatic polynomial, Manifold method for non-linear dimensionality
reduction, Spectral methods to solve differential equations, Turan problem, Littlewood-
Offord Problem, Catalans Numbers, Isoperimetric problems.

Text Books :
l. Bona M Mikfos, A llalk-Through Combinatorics: An Introduction to Enumeration and
Graph Theory@$ ed.), WSPC, 2016. ISBN 978-9813148840.

Reference Books :
) I Mladenovii Pavle. Combinatorics: A Problem-Basecl Approach (lst ed.), Springer, 2019
ISBN 978- 3030008307

Assessm ent Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightase (%) 45 20 35 r00

.ut,
nqllyfur
B(. r,: tt t ri:ir.,:rsily. Greatcr N!oida
(9Lr... :1 ,.:.{,.l::c;L:.r.c'Ur: .r l-i- i. rh)
Pict f .j,..r': Lr, 3, 1(), 1 1 , Tcclr Zorr:-ll
Grcatei- I'Jcicla-20 1 310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET332 Mobile and Networked f,mbedded Systems L T P C

Owning School/Department Department of Computer Science 2 0 2 3

Engineering
Pre-requisites/Exposure

Cource Outcomes (COs)

On completion of this course, the students will be able to:

COl: To articulate the concepts of mobile and networked embedded systems.

CO2: To explain the architecture ofnetworked embedded systems.
CO3: To design and develop networking systems for automated applications for smart cities,
building, parking.

co- MaDDinE
)
POI P()2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 POll PO t2 PSOI PSO2 PSO3

col 3 1 3 I 2 2 I I 2 3
co2 2 I 2 I 1 1 I 3 2 2 I 3 2 3
,,
co3 , 2 2 ", I ) I 2 1

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: 12 lecture hours

Smart Environments. Paradigms for pervasive networking, Networked Embedded Systems,
Wireless Embedded Networking, Applications, Network Topology, Real-time embedded
systems, Components ofnetworked embedded systems, Centralized and distributed embedded
systems, Physical sensor, Passive sensor, Semi-passive, Active sensors, Soft sensors, Sensor
nodes, Hardware architecture. operating systems for sensor nodes, Mobile sensor network,
) Sensor networks with mobile nodes.

Modulo II: S lecture hours

Power management and mobile node discovery, Data transfer to mobile nodes, Routing to
mobile nodes, Sensor networks with all mobile nodes, Participatory sensing, Vehicular
Networked Embedded systems, Embedded Networks for car Domains, Intra -vehicular
Network Embedded Systems, Event Triggered Systems, Time Triggered Systems, Inter-
Vehicular Network Embedded Systems.

Module lll: 8lecture hours

Applications for smart cities (pollution monitoring), Applications for smart cities (smart
lighting, context-aware applications), Smart mobili[ (parking area management)' Smart
 mobility (intelligent transportation systemE), Smart buildings (home/building automation'
energy efficiency), Soeial sensing applications.

Text Books i
1. Chattopadhyay 5., Embedded System and Design (2nd ed'), Prentice Hall India Learning
Private Limited, 2013' ISBN 978'8120347304.

Reference Books :

1. Lyla B. Das, Enbedded systems: an Integrated Approach (lst ed,), Pearson Education India,
20 12. ISBN 978-933251 167 5.

2. Peckol, Enbedded Sl,srerirs (2nd ed'), Wiley, 2019' ISBN 978-11 19457497'

Assessmont Schcme

Components Internal Ascessment Mid Tcrm Exom End Exom Total

) Weightoge (%) 45 20 35 100

Res
Ben rsity, Greater Noida
Ad 24 of Goq ofuttar Pcdesh)
lot o's 8,9, 10, 11, Tech Zone-l
Grnat":r Noida-2O1310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET333 Problem Solving using C L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-req uisites/Exposu re

Course Outcomes (COs)

On completion of this course, the students will be able to:

COI: To explain various concepts in C programming language and understand the problem-
solving aspect.
CO2: To Implement concept ofpointer and perform I/O operations in files and make use of
concepts in finding solutions to real-life problems.

CO-PO/PSO MaDDins
)
POI PO2 P(X PO4 PO5 P()6 PO7 PO8 PO9 PO t0 POI I PO l2 PSOI PSO2 PSOI
,,
col 3 3 I 2 2 I t 2 I I I 2 I
., ,,
c02 2 2 I I I 2 J I

l:weakly related 2: moderately related 3:srongly related

Course Contents:

Module l: S lecture hours

Program structure, Communications with the Operating System, Library Functions, Pre-
processor Directives, Debugging and Efficiency, Memory Models. Data Types-Simple C data
types, Integer Data types, Floating Point types, Derived Data types, The ASCII Character Set,
Compilation and Linking, 'lypes of compilers, Decision making, Loops, Switch statement,
Goto statement, Null statement, Comma operator, setjmp functions, longjmp functions,
Storage classes: automatic variable, extemal, static. register, Arrays, Array Indexing, Using
) Array names as Pointers, Character Arrays.

Modulo ll: l0 lecture hours

Advanced data types: #define statement, Variable length array, Flexible array members,
Complex number type, Type Qualifiers: Const, Volatile, Restrict, Functions, Pass by value,
Pass by reference, Command Line Arguments, Structures, Arrays of Structures, Structures of
Arrays, Structures of Structures, Bit Fields in Structures, offseto(), Macro, unions, Typedef,
Typecasting, Implicit type casting, Explicit typecasting, Pointers- Declaration, NULL pointers,
Indirection, Pointer to array, Pointer to function, Pointer to structure, Arrays of Pointers.
Passing pointers to functions.

Module ll l: l0lecture hours

File handling, Recursive functions, Memory allocation in a recursive method, Dynamic
memory allocation, Global Memory versus Local Memory, Error handling in C, Global

W' ,,'1';.1"r,ii,-r;
 Variable Enno, penor0 and strerror0, Exit status, Divide by zero errors, Interfacing C with
Python code: Calling C functions from Python, Calling python functions from C, Threads:
Creating a thread, Passing arguments and retuming values, Common thread functions, Thread
synchronization concepts, Mutexes, condition variables.

Module IV: 13 lecture hours

Generic Security Software's, Windows Firewalls, Linux Firewalls, Access Control Lists of Firewalls,
Types and Examples of Firewalls, Network-based Honeypots and Trapdoors, Virtual Private Network
and its lmplementation, Network Intrusion Detection System, Network Intrusion Prevention System,
Router Security, Switch Security, Proxy Server and its Configurations, Load Balancers, lPv6 and IPv6
Securiry, Secure Forwarding in Overlay Networks.

Text Books :

Gottfried Byton, Outline of Programming with C (4th ed.), McGraw Hilt Education. 201 8.
ISBN 978- 0070145900_

Reference Books :

) l. Balaguruswamy E., Programming in ANSI (8rh ed.), McGraw Hill Education, 2018. ISBN
978- 9351343202.

Assessment Scheme:

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

)
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET334 Programming using C+ t- T P C
Owning School/Department Department of Computer Science 2 0 2 3

Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion of this course. the students will be able to:

COl: To explain the fundamental programming concepts and methodologies to building Cr-r
programs.
CO2: To implement various OOPs concepts including memory allocation/deallocation
procedures and Member functions.

CO-PO/PSO Manoinc
)
POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 POII PO t2 PSOI PSO2 PSO3
., a
col 3 3 3 2 I t 3 2 2 t 2 3 3
co2 2 3
.,
2 3 ) 3 2 2 3

l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 9lecture hours

Principles of Object-Oriented Programming, data types, Symbolic constants, Reference by
variables, Operators, Operator precedence, Control structures, lf-else, Nested If, Switch, break,
continue, Functions, main function, Function prototyping, Call by reference, Return by
reference. Inline function, Default arguments, Function overloading, Defining a class and
member functions, Private member functions. Nesting of member functions.

Modulo tl: 8lectur€ hours

Virtual base classes, Abstract classes, File Handling, Throwing Mechanism, Caching
) Mechanism, Rethrowing an Exception, Constructors in derived classes, Nesting of classes,
Exception Handling, Opening and closing a file, Detecting End-of-fiIe, Sequential input and
output operations, Generic Programming using template, Class template, Function template'
Class member function template, Function overloading, Standard Template Library:
Containers, Stack, List, Queue. Algorithms, Iterators.

Module lll: I I lecture hours

Arrays within a class, Arrays of objects, Memory allocation, Static data members, Static
member functions, Friendly functions, Objects as function argumetlts, Returning Objects,
Constructors, Default constructor, Parameterized constructor, Copy constructor, Multiple
constructors, Constructors with default arguments, Dynamic constructor, Destructors, Rules
for overloading, Operator overloading, Unary and binary operator overloading, Overloading
using friends, Type conversion, Inheritance, Defining derived classes, Visibility modes, Single
 inheritance, Multilevel inheritance, Multiple inheritance, Hierarchical inheritance, Hybrid
inheritance, Runtime Polymorphism

Text Books :
l. Stroustrup Bjame, The C++ Programming Language. (4th ed.), Addison-Wesley
Professional, 201 3. ISBN 978-0321563842.
2. Balagurusamy 8., Object Oriented Programming with C++ (lst ed.), Tata Mccraw
Education Hill, 2013. ISBN 978-1259029936.

Refe Bookq :

I Ravichandran D, Pr ogamming with C++ (3rd ed.), McGraw Hill Education, 2017. ISBN
978- 0070681897.

Assessment Scheme

Components Inlernal Assessment Mid Term Exam End Exam Totsl

)
Weightage (%) 45 20 35 100

Registr
Bennet rriversity, Greater Noida
r i,.i : i r i a!vi, .i Uiiar P :id:,sh)
(Esli.lriir:r:d t.lr,:::
Plct Nc's C, i, 'i0, 11 , 'fcch Zcne-ll
Greater I loi',la-2tl'l 310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET335 Deep Learning L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre- requisites/Exposure

Course Outcomes (COs)

On completion of this course, the students will be able to:

COl: To explain the fundamentals ofdeep learning, Convolution neural network.

C02: To articulate different problern ofclassification, detection, segmentation, generation and
understand existing solutions/ deep learning architectures.
CO3: To implement a solution for the given problem and improve it using various methods
transfer learning. hyperparameler optimization.

CO-PO/PSO Maooins

POI Pro2 POI PO4 PO5 PO6 PO7 PO8 PO9 POt0 POt I POl2 PSOI PSO2 PSO3
col 2 2 I 2 I 2 2 I 2
co2 2 3
,,
I 2 2
.,
3 )
c03 2 2 , 2 2 I t I 3

l:weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: T lecture hours

Why Deep Learning?, Machine Learning: features, weights, Artificial Neural Network, loss
function, cost function, ANN: forward propagation; Backpropagation, Stochastic Gradient
Descent, Batch gradient descent, mini batch gradient descent, Oplimizers: Momentum,
RMSProp, Adam. Deep Learning Experiments: Datasets, training-validation testing set,
evaluation measures: accuracy, precision, recall, f-measure, Model Improvement: Overfitting
) vs underfitting, Bias vs Variance. Regularization: Ll, L2 regularization, Dropout, Early
stopping, Data normalization, Batch normalization, Hyper parameter Tuning: random, coarse
to fine, Network architecture search.

Modulo Il: I I lecture hours

Imbalance data problem (25) Data Augmentation in image: Cropping, Flipping, Rotation,
Brightness, Contrast, Color Augmentation, Saturation, Convolutional Neural Networks:
convolution, striding, padding. pooling, Alexnet Architecture, Image classification (lmageNet
Challenge), Well known CNN architectures VGCI6&19, Residual Block, Resnet5O, lxl
convolution, XceptionNet, EfficientNet, Transfer leaming, Object Detection: setup problem
and cost function, well known datasets, Evaluation measure: Average precision, Mean average
precession, Two stage detector, single stage detector, RCNN, Fast RCNN, Faster RCNN,
SSD, YOLOI-4, RetinaNet, EfficientDet. Image Segmentation: setup problem and cost

.:r.'r. l'l: iC a
i .:' )

, :.:r r..!,, .)-:l

 function, various dataset, Semantic segmentation, Instance segmentation, Evaluation
measure: IoU/Jacard lndex, Dice score, Mean pixel accuracy, Segnet, Unet, Mask R-CNN.

Module lll: l0 lecture hours

Generative Learning, Variational Auto-encoders, Generative Adversarial Neural Networks,
GL Applications: Image generation, font generation, video generation, anime face/celebrity
face generation, Deep Reinforcement Leaming, Markov decision Processing, Deep Q
Leaming, Exploration vs Exploitation, Value lteration vs Policy Iteration, RL Applications:
Robotics, gaming, Ad Targeting, recommendation system, decision making, Model
optimization for Deployment, Pruning, Quantization and binarization, Transferred or
Compact Convolutional Filters, Knowledge distillation,

Text Books :
l. Coodfellow lan, Yoshua Bengio, Aaron Courville and Yoshua Bengio, Deep learning. Vol. I
C(lst ed.), ambridge: MIT press, 2016. ISBN 978-0262035613

) Reference Books :
1. Zhwtg Aston, Zack C. Lipton, Mu Li and AlexJ.Smola. Dive into Deep Learning (lst ed.),
Corwin, 201 9. ISBN 978-l 544361 376.

Assessment Scheme

Compotrenls Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

Rcll
Lln:,/.rs;i j/, Greatef l{cida
(!:'r:.1 : ':i,
r:': ;,',i : i Lrf (:.,,'1, oiUt{in Pi!.ie:h)
L'
Fiu't il,:'r'; aj, !1, 'i0, 'i1, Tech Zorre-ii
Gr i:;:i:i l.ir-r: :l::. 1l I1 3'l O
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET336 Bioinformatics and Computational L T P C
Genomics
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion of this course. the sludents will be able to:

COl: To articulate knowledge of Bioinformatics, Computational Biology, and Celromics.

CO2: Implement algorithms and programs related to sequence database, search and
alignments, gene prediction and homology.

CO-PO/PSO Mappine
)
POI P()2 PO3 PO4 PO5 PO6 P.o1 PO8 PO9 PO t0 P0l I PO t2 PSoI PSO2 PSO3
COI 3 1 I I 2 ) 3 I I 2 2
co2 2 2 3 3 3 3 2 1 2

l:weakly related 2= moderately related 3=strongly related

Course ontents:

Module l: l0 lecture hours

Dna, Rna, Proteins, Splicing, Gene structure, Medicine as a Data-Driven Science, Human
Genome Project, Biomedical DaIa, Exact Sequence Searches: Z-algorithms, Knuth-Morris,
Boyer- Moore, Rabin-Karp, Sequence Analysis: Pairwise Sequence Alignment, Homology,
Sequence alignment with Dynamic Programming, Extensions of pairwise Sequence Alignment,
Phylogenetic Tree Reconstruction, Biological and Molecular Databases, BLAST Search
Engine, Human Variation Databases and Genome Viewers.

Modulo Il: 8lecture hours

Markov chain, Hidden Markov Model, Viterbi Algorithm, Forward Backward algorithm, HMM
for motif finding, Advanced alignment techniques: Linear space, Affine gaps, Banded linear
time alignments, Time warping. Burrow Wheeler Index, Next Generation Sequencing,
Comparative genomics, Micro arrays, Shotgun sequencing, BAC to BAC sequencing.
Phylogeny, Fitch algorithm.

Module lll: lolecture hours

Multiple sequence alignrnent, MSA algorithms, Progressive alignment, CLUSTALW,
Expectation Maximization, Cibbs Sampling, Genetic Algorithm, Clustering with a Genetic
Algorithm, System Biology: Network Analysis,Rational Drug Design, Biomarkers, Human
Genomic Variations, Monogenic Diseases, Complex Diseases, Genetic predisposition to
Cancer, Cancer Immunotherapy

L)
 .Text Books :

1. Akalin Altuna, vedran Franke,Bora Uyar and Jonathan P.onen, computational Genomics
st
wiri R(l ed.), CRC press, 2020. ISBN 97g- 1498781 862.
2. Baxevanis A. D., Wishart D. S., Bader G. D., Bioinformatics (4th ed.), Wiley, 2020. ISBN
978- I I 19335580.

Reference Books :
1. Singh Dev Bukhsh and Rajesh Kumar pathak, Bioinformatics,Methods and Applications
st
(l ed.), eBook, 2021. ISBN 978-0323900053.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exem Total

Weightage (%) 45 z0 35 100

)

R
att Unii/crsi ty, Grcatr:i.Noida
'i'lirA.i lci Cofi, ril Ull Pr;(].sh)
r-'

!, 'j,.1, 11 , "iu.;ir zone-il

Gro: l^.i' I,J.t lt.tO 1310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET337 Augmented Reality L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

Course Outcomes ( COs

On completion of this course, the students will be able to:

COI: To articulate alternative 3D cornpositing techniques using computer vision with

applications in interactive interfaces - most notably augmented reality interfaces on mobile
devices.
CO2: To irnplement interactive augmented reality games and understand the practical issues

CO-PO/PSO Manpins

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 PO PO t2 PSO I t)so2 PSOS
col 3 I 3 3 J
cC)2 3 3 3 3 3 3 3 3

l:weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: I I lecture hours

Industrial applicability of AR, AR Systems Overview, Input and Output Devices for AR,
Optical vs. Video, See-Through AR, AR system architecture, Senses, Simple
sensing/perception model, Human visual system,3D Vision, Tracking system, Tracking for
Augmented Reality, Importance of Accurate Head Tracking, Tracking Problem, Tracking
Technologies, lmportance of Accurate Head Tracking, Tracking Problem, Tracking
Technologies, Head motion prediction, Registration, Calibration - static and dynamic. Real
Time Performance, Characterislics - spatial, temporal, system robustness, Scheduling and
) Fusing Sensor Information, mixed reality UI design, Design of irnmersive user experience.

Modulo Il: I I lecture hours

Altemative Interface Paradigms, Usability guidelines. immersive environments, Space,
Scale,Ergonomics, Physical locomotion techniques, Target based techniques, Steering.
Comfort and distress, Gaze direction, comfort range test, Motion Sickness, Simulator Sickness,
Cybersickness, AR lnterface Design, Propefties of AR Environments. Collaborative AR
Interfaces, Heterogeneous AR User lnterfaces, Tangible and Graspable lnteraction, Tracking
for Augmented Reality, Augmented Reality Interaction, Augmented Reality Information
Browsers, AR Widgets, Graphical Interface Elements, Evaluating AR Interfaces.

Module lll: 6lecture hours

video mixing, optical blending. projection devices, spatially augmented reality, Immersive
virtual reality, Desktop metaphor, mobile/wearable computing, Ubiquitous computing,
Tangible user interfaces, Distributed graphics

' - \1. i,, -

I rl:'.., .l
-r.-,.i1
,',.
,, .l()ri-'-;i
,: l|)
 Text Books :
1. Alan B Craig, William R Sherman and Jeffrey D Will, Devetoping Virtual Reality
Applications: Foundations ofEffective Desrgn (l ed.), Elsevier publisher, 2009. ISBN 97g-
0t23749437.
2. Doug A Bowman, Ernest Kuijff, Joseph J LaViola, Jr and lvan poupyrev, 3D (Jser
Interfaces: Theory and Practice (Usability) (2 ed.), Pearson Education, USA,20l7. ISBN
978-0134034324.

Reference Books :
1 Pangilinan Erin, Steve Lukas, Vasanth Mohan, Creating Augmented and Virtual
Realities( I ed.), Creating Augmented and Virtual Realities (l ed.), O,Reilly publishers,
201 9. ISBN 978- I 492044192.

Assessment Scheme

Components Internal Assessment Mld Term Exam End Exem Tot l

)
Weigbtage (%) 45 z0 35 100

^""Wr,,
rffiiijtiir*'flili
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET338 Computational Geometry L T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate the representation of geornetric prinritives and evaluation of geometric

predicates.
CO2: To implement Motion Planning and approximation metlrods, related problems. and
algorithms.

PO/PSO Ma tn

POI PO2 PO3 PO4 PO5 PO6 P()7 PO8 PO9 PO t0 PO I'O I2 PSoI PSO2 PSO3
cor 3 2 I 2 2 I 2 2 I 2 2 3
co2 3 3 I I 3 2 2 I I 3 3

l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: I I lecture hours

Convex Hulls: naive Algorithm, Graham's scan. Quick Hull, Chan's algorithrn, Polygon
Triangulation and partitioning, Triangulations of point sets, Triangulating a monotone
polygon, Ear- cutting algorithm. Art gallery problems, Gift Wrapping algorithm, Polyhedra,
Fractional cascading, Priority search trees. Plane-sweep intersection, Line segment
intersection, Represenlalion and intersection of planar subdivisions, Trapezoidalization,
Voronoi Diagrams, Post Office problem, Divide and conquer algorithm, History graphs,
)
Fortune's algorithm, Connection to Convex Hulls.

Modulo ll: g lecture hours

Delaunay refinement, Mesh refinement algorithm, Roadnraps, Linear Programming. Half-
plane intersection. Arrangements, Duality, Point/line duality, Kirkpatrick's method, Point
Location, Convex polygons, Intersection of convex polygons, Extreme point of convex
polygon, Search and Intersection, One-dimensional range searching,KD-trees. Range trees,
Higher dimensional range trees, Convex Parlitioning, Zone theory.

Module lll: S lecture hours

Motion planning: Shortest paths, Visibility graphs, Approximation Method: Dudley's theorem,
Well separated partitioning, Epsilon-Nets, VC Dirnension, Geometric set cover, Clustering
point sets using Quadtree, Quadtrees epsilon, Construction ofepsilon.

.)
 Text Books :
f . n".g ln a", Kreveld, M. Overmars and O. Schwarukopf, Computational Geometry
ft4. van

Atgorithms and Applications (CGAA) (3rd ed.), Springer, 2008. ISBN 97 8-3642096815.

Reference Books :
1. Boissonnat, Jean-Daniel, Chazal, Fr6ddric, Yvinec and Mariette, Geometric and
Topological lnference (lst ed.), Cambridge UniversitY Press, 20'18. ISBN 978-
1 l 08410892.

Assessme nt Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

20 35 100
Weightoge (%) 45

Reg
Bcn UniversilY, G reater Noida
I, of Ultar Pladesh
Eslsuiill.d t.lrrd:rAcl21ol(iov
l{o's I, 9, 10, 11, Tech Zone-
P lot
GreateI No ida-20'1 310
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET339 AI
Advances in I, T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the studenls will be able to:

col: To explain new research trends of Artificial lntelligence and interpret advanced topics
in natural Language Processing and chal bots.
CO2: To implement the model and use the current trends in Artificial lntelligence.

CO.PO/P Ma IN

) POI P()2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POtl PO l2 PSO I PSO2 PSOS
col 2 2 2 a , I
., 1 l 3 I 3 I I I
cr)2 2 I I I ., 1 2 2 2 2 3

l=weakly related 2= moderately related 3=strongly related

Course Cont ents:

Module l: g lecture hours

Bootstrapping, semantic draft, zipf distribution, Never Ending Learning (NELL), co-training,
multi- task learning, coupled semi-supervised learning, macroreading vi micro ieading, Opein
IE, lexicalized vs unlexicalized, types ofsemantics, distributional semantics, frame seriantics,
full semantic parsing, Davidsonian semantics, relation kemels, dependency parsing,
combinatory categorial grammar, supervised vs. semi-supervised vs. unsupervised IE, tre'e
kernels, distant supervision, macro vs micro reading, voted perceptron. stochastic gradient
descent, multi-instance leaming, serf-rearni'g. Deep learning foi Ig. cNNs: subgradient,
CNNs: non-li,earity (sigmoid, tanh, relu, leaky relu, maxout), cNNs: initializatlorf cNNs:
.networks, cNNs: regularization. Deep learning for IE: LDA. Bayesian non-
residual
) parametrics (chinese restaurant process), Dirichlet distribution, conjugate ii.tribrtion,
Reinlorcement Learning: Q-leaming.

Modulo ll: g lecture hours

Knowledge Base Inference, crrarrenges to Inference in KBs, t.rorn Crause Inference:
Assumptions, Horn Clause Inference: Issues, Horn Clause Inference: Exarnples, Random
walks Inference, Random walks Inference: pRA, path Ranking Algorithrn, Link prediction
Task,_Data-driver Path finding, Neural models for KB lnference, Matrix factorization (MF)
for K.B, Tensor factorization (TF) for KB, Evaluation ofKB Inference, Joint MF-TF models,
Graph-based semi-supervised learning, Text as interli'gua, Text for inference, Temporai
scoping, Open Question-Answering, paraphrasing, parsing, Rewriting, Executing, Latent
variable Perceptron, Semantic parsing for euestion Answeiing, Semanlic Represeiiation of
Questions, Answer Generation.

W, ,
" '
.i, , i,
,:1..
:: i ir l':i'l
li..::
i.:,i:ii Zorre-li
)

Gi-iri..:j i.- r ..:.' )ii.l10

 Module III: l0lecture hours
Recurrent Neural Network (RNN), Bidirectional RNN, RNN problems, vanishing/Exploding
Gradient Problem, Long Short-Term Memory (LSTM), Aftention
-
Motivation, Highway
netlvorks, Maxout networks, additive vs. multiplicative models, attention over attention,
Dependency tree RNNS, weighted rank loss, deep feature fusion networks, Squaring
probabilities, Synthetic oversampling, Bi-LSTMs, Siamese networks vs. LSTM.,
conversation Agents, open Domain vs. closed Domain, challenges in building chatbots,
Taxonomy of Models, Retrieval Based Models, Generative Models, Dialogui Systems.
Applications of Dialogue Systems, Traditional pipeline models, End-To-End motels with DL,
Generative Dialogue Modelling, Evaluation Metric, Memory Networks, End-to-End Memory
Network with Single Hop, Endto-End Mernory Network with Stacked Hops, Gated End_to-
End Memory Network, End-to-End Memory Networks with Unified Weight Tying,
Generative Adversarial Networks, Adversarial Nets Framework. GANs - The Good and the
Bad, GANs for NLP: Dialogue systems, GANS for NLp: Dialogue systems Architecture.
Teacher Forcing learning, Adversarial Evaluation, Automatic Evaluation vs Human
Evaluation-

T ext Books :

l. Russel, Arti/icial Intelligence: A Modern Approach (lsted.), pearson Education India,

20t 6. ISBN 97812921 53964.
2. Rothman Denis, ArtiJicial lntelligence by Example: Develop machine intelligence.from
scratch using real artificial (lsr ed.), Packt publishing, 2018. ISBN g:-g-lli}gg}54l.

Reference Books :
I Elaine Rich, Artifcial Inrelligence (3rd ed.), McGraw Hill Education. 2017. ISBN 978-
0070087705

Assessment Scheme:

Components lnternal Assessment Mid Term Exam End Exam Totrl

Weightage (9/o) 45 20 35 100

i i la,:::'.1

, r,..r r ;:c i., li

)
Elective I III, V
)

R I
nett Unlvers ity, Greater Noida
(Btablished UnderAcl 24 of Govt,
o, Ultar PradBsh)
Plot No' s 8, 9, 10, 11 ,TC ch ZoneJl
Greater Noida-20131 0
) Specialization
Electives:
Artificial
)
Intelligence

M,- '''. (l,r'-:lr:i l'roirla

,l{
t
r,. lt',
- _, .il
.,.,.,
-:l,ii ,, ,:, ir, 1i,l:ch Zollo-l!
'1

Cli:: .l :i i, i ..i r:r-13'10

 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET34O Advanced Computer Vision and Video L T P C
Analytics
Owning School/Department Department of Computer Science 2 0 2 3

Engineering
Pre-req uisites/Exposu re

Course O utcomes (COs)

On completion ofthis course, the students will be able to:

CO1: To articulate the key features of Computer Vision to analyze and interpret the visible
world around us.
CO2: To build the applications of Deep Learning in Computer vision and video processing.
CO3: lmplement the state-of-the-ar1 computer vision and video analytics concepts to different
applications.

CO-PO/PSO Mannins

POI POz PO3 PO4 PO5 P()6 PO7 PO8 PO9 PO t0 POI I POl2 PSOI PSO2 PSOI
1
col 3 1 2 2 2 1 2 2 2 3 3 2
,
co2 3 3 ) .,
3 2 2 2 2 2 2 3 3
c03 3 2 3 3 3 2 2
.,
2
., , 3 2 3

I=weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: T lecture hours

Introduction to Computer Vision, The Four Rs of Computer Vision, Challenges in Computer
Vision, Low-level vs High-level processing, Two View Ceometry, Binocular Stereopsis:
Camera and Epipolar Geometry, Planar Scenes and Homography, Depth estimation and multi-
camera views, Robust Correspondence Estimation, 3-D reconstruction, Auto-calibration'
DLT and RANSAC, Structure from Motion, Hough Transform, Fourier Transfonn, lnterest
Point Detection, Edge Detection, Local Binary Pattern, Convolution and Filtering' Gaussian
derivative filters, Gabor Filters, DWT, Pyramids, Visual Matching: Bag-of-words' Pyramid
Matching, Part based recognition models, Recognition: Detectors and Descriptors, Optical
Flow & Tracking.

Moduto ll: T lecture hours

Shape from Texture, Color, motion and edges, Face Detection, Feature Tracking, Motion
Layers, SIFT & Single Object Recognition, Dense Neural Networks. Backpropagation,
Convolutional Neural Networks (CNNs), AlexNet, VGC 16, Image Quality Enhancement,
lmage Restoration, Super resolution, Residual Leaming, Visual Saliency detection.

Module III: T lecture hours

 Evolution of CNN Architectures: AlexNet, MobileNet, InceptionNets, ResNets, DenseNets,
3D CNN for images and videos, Unsupervised image segmentation, Watershed, Level set,
Active Contour, GraphCut, Supervised image segmeniation, Agglomerative clustering,
Segmentation as pixel classification, UNets, FCN, Deep GenerativJ Models, GANs, VAEi,
PixelRNNs, naDE, Normalizing Flows, Zero-shot, One-shot, Few-shot Leaming, Self_
supervised Learning, Reinforcement Learning in vision, video Analytics, Spatial bomain
Processing, Frequency Domain Processing, Background Modelling, Ciowd Analysis, Video
Surueillance, Traffi c Monitoring, lntelligent Transport System.

Module IV: 7 lecture hours

optical_ character Recognition,online Character Recognition, visual Anomaly Detection,
Anomalous action recognition, Post Estimation, Action Recognition, Graph CNN, Shape
Recognition, Shape Retrieval, content based Image retrieval, visual Instance Recognition,
Emotion Recognition from videos, Video Ceneration.

Text Books :
l. Rajalingappaa Shanmugamani, Deep Learning for Computer Vision ed.), packt(t"
Publishing, 2018. ISBN 9781788295628 .
) 2. Nedumaan J., ProfThomas Binford, J. Lepika, J. Tisa, J. Ruby and p. S. Jagadeesh Kumar,
Modern Deep Learning and advanced Computer Vision (l^ ed.), Intel, 2019. ISBN
978170879864t .

Reference Books :
1. Kar Krishnend u, Mastering Computer Vision with Tensor Flow ( L ed.), packt, 2020. ISBN
9781838826939.

Assessment Scheme

Comporlents Internal Assessmellt Mid Term Exam End Exam Total

Weightage (o/o) 45 20 35 100

{jI,.:r-1;
[:'; ri {:i::l-v, Gre ater i,Joi(1a
{i:il. :.' 'r: :L :ir!l .r: t.l.l,ri ii:l-j'.:h)
Pirt'L i'
G r.)at,ri f i,;:'r-2ri1li10
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET34I Cognitive Modelling L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-req uisites/Exposu re

Cource Ou es (COs)

On completion of this course, the students will be able to

COl: To articulate the thought, leaming, and mental organization..

co2: To examine the extraction ofbrain signals into digital form and
develop critical skills to
evaluate and assess problems including psychology, philosophy. neuroscience, and computer
modelling.
Co3: To implement the models that reflects human cognition and apply to different real-lile
scenarios.

CO-PO/PSO Maonins

POt P(]2 PO3 PO4 PO5 PO6 PO7 P()8 PO9 PO l0 POI I PO t2 PSO I PSO2 PSO3
cot 2 3 2 2 3
cC)2 3 3 2 , 3 3 2 2 2 2 3
c03 3 2 3 3 3 2 2 a 2 3 I

l:weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: T lecture hours

Why Cognitive Science, Structure and processes of
human cognition, Computational
simulation or modelling, Theory and Research in Human Cognition, object perception, object
Recognition, Aftentional Processes, Concept formation, Visual perception, Acquisition and
processing of natural language, Human reasoning and problem-solving.
)
Modulo ll: T lecture hours
Memory lntroduction, Long Term Memory encoding, Retrieval from Long Term Memory,
Memory of general knowledge, Semantic memory basics, Models of semantic memory,
Human language skills, Midlevel Vision and Aftention, Motion, disparity, depth. and
orientation representation, convolution, Mechanisms underlying attention, Attention at the
cognitive/algorithm level.

Module Ill: T lecture hours

Brain Signals and Feature extraction, Types of Brain signals, case study, Feature extraction
methods and their analysis, Models of understanding cognition or Mind: Neuroscientific
Model, Psychological Model, Representational Model. Computational Model, Isomorphic
Model, Multiple realizable Model, Multiple Draft Model, Sub perpnal Model.

UY
Ft{{stYx r' ' ' "-' t,.',''
-r^r i'r'1idzi
Dtb/.'t ';.." ,t-rl ', "l .. .i

Fiot ri t ''' :l' i r''

r""ir zone it
Gr''-atir I :rii ' ?i)1li'lu
 Module IV: 7 lecture hours
Thought process and Problem Solving, Applications of cognitive oomputing in the field of
psycholos/, Applications of cognitive computing in linguistics, Dscision Making models,
Commercial Applications of Cognitive science/computing, Advanced Topics in Cognitive
computing, Applications of cognitive computing in philosophy, Applications of cognitive
computing in computer modelling, Machine Leaming models for cognitive computing, Neural
Networks for cognitive computing.

Text Boola :
l. Bermfdez Jos6 Luis, Cognitive Science: An Inffoduction to the Science ofthe Mind (3 ad.\,
Cambridge Univenity Press, 2020. ISBN 978-1 108440349.

Reference Books :
1. High Rob and Tanmay Bakshi, Cogzr'liv e Computing wtth IBM Watson: Build Smart
Applications Using Artifuial Intelligence as a Service (1 ed.), Paokt Publishing, 2019.
ISBN 1788478290.
)
Assessment Schemo

Components Internal Asssssmetrt Mld Term Erem End Exem Totrl

Weightage (o/e) 45 2A 35 100

A//
Effi i'*vfJ:rt f t:"?i,fl ,!:l:,i
i,toi o's B, 9, 10,
tf Tech zone-
11 ,
Greater Noida-201310
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET342 Probability and Random Processes L T P C
Owning School/Department Department of Computer Science 2 0 2 3
f,ngineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: To explain the probability and random processes..

CO2: To formulate the problerns and tackle with probability and randonr processes
CO3: To implement the applications of probabilities for a real-world scenario.

CO-PO/PSO Manoine

POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 PO P()t2 PSOI PSO2 PSO3
., .,
col 2 2
.,
co2 2 2 a 1 2 2
co3 2 , ", 3 , 2 3 3

l=weakly related 2: moderately related 3:strongly related

ourse Contents:

Module I: 7 lecture hours

Events, sample spaces, and probabili6,, Limitation of classical and relative-frequency-based

definitions, Independent events. Conditional probability, Sets and fields, Sample space and
events, Axiomatic definition of probability, Joint probability, Conditional probability.
Independence probability, Total probability, Stationarity: strict-sense stationary (SSS), wide-
sense stationary (WSS) processes, Ergodicity and its importance, Bayes theorem,
Combinatorics: Probability on finite sample spaces.

Modulo ll: T lecture hours

Random variables, Discrete and continuous random variables. Probability mass funclions,
Moment generating functions - Binomial, Poisson, Geometric, Uniform distribution,
Exponential, and Gamma distributiorrs, Normal distributions: definitions, applications, Joint
distributions - Marginal and conditional distributions, Covariance: defirrition, type.
applications, Correlation regression, Linear regression, Transformation of random variables,
Classifi cation - Stationary process.

Module 1ll: T lecture hours

Markov process, Poisson process, Random telegrapll process, Bemoulli and Binomial random
variables, Geometric random variables, Negative Binomial random variables, Random process
realizations, Random process sample paths, Discrete time processes, Continuous time
processes, Probabilistic structure ofa random process.

Module IV: 7 lecture hours

 Mean functions, Autocorrelation functions, Autooovariance frmotions, Poisson random
variables, Hypergeometric random variables, Disorete uniform random variables Bnd counling,
Independont conlinuous random variables, Normal distribution and CLT, Approximate models
of in
Spam filtering, Random processes in
continuous uniform distribution, Probability
gambling app desigp, Probability and random processes in market predicdon and risk
prediction.

Text Books r
1. Peebles. P. Z, Probabitity, Random Variables and Random Signal Principles (4 ed.), Tata
Mc Graw Hill,20l7. ISBN 978-0070474284.

Reference Books :
1. Peebles. P. Z, Probability, Rondom Variables and Random Signal Principles (4 ed.), Tata
Mc Graw Hill,20l7. ISBN 97E-007O4742U.

Asse$pent Scheme:

) Components InterDrl Assessment Mld Term Eram End Exam

[rotat
Weightage (o/o) 45 20 J5 00

w,
Effiiffi ,ffi ,q{ir!"f #i+81,
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET343 AI in Healthcare L T P C
Owning School/Department Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposu re

cllry-Qlse!rcil98!)
On cornplelion of tlris course. the students rr ill be able to:

COl: To artioulate the factors involved in decision support that can improve business
performance across the provider/payer ecosystem.
CO2: To build rnethods and techniques in order to appropriately apply to pain poirrts using
case studies-
CO3: To build methods and techniques in order to appropriately apply to pain points using
case studies.
)
CO-PO/PSO ManDine

POt tc)2 PO3 P()4 PO5 PO6 ?o7 PO8 PO9 PO t0 POII PO l2 PSO r PSO2 PSO3
cot 1 3 2 2
c02 3 3 3 3 3 2 2 2 2 3
co3 3 3 3 3 3 1 2 2 2 3 3

I:weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: 6lecture hourc

History of AI in Medicine, AI for Decision Support. Capabilities and lirnitations of AI in
flealthcare, Automated healthcare system: challenges and opportunities. Biostatislics, Research
ethics in Al, Common healthcare data types, Medical data: quality vs quantity. Clinical Dala,
Clinical decision support systems, Electronic Health Records (EHR).
)
Modulo II: 7 lecture hours
Time series and non-time series data, Data Sourcing, Data Enrichment, Handling missing
values, Advantages and challenges in observational data, Ceographic and demographic
variation in medical Data, Classification, regression, clustering for healthcare, Evaluation
measures for healthcare applications, Bias and Error in medical data, Analysis of data from
IOT body sensors. Automated diagnosis processes, Treatment protocol development.

Module lll; 9lecture hours

Time series and non-time series data, Data Sourcing, Data Enrichment, Handling missing
values, Advantages and challenges irr observational data, Geographic and demographic
variation in medical Data, Classification, regression, clustering for healthcare, Evaluation
 measures for healthcare applications, Bias and Error in medical data, Analysis of data from
IOT body sensors, Automated diagaosis processes, Treatment protocol development.

Module IV: 6 lecture hours

Clinical text, Medical Word Corpus, Text representation, BERT for medical data, PubMed
BERT, Question answering systems, Finding similar patients through clustering, Medicine or
treatment recommender systems, Q&A systems for Telemedicine, Personalized medicine
recommendation system, Drug development analysis, Drug discovery, Modeling drug-drug
interactions, Pandemic spread prediction. lnfection pattem identification, Computer Vision
systems for physiotherapy, Pose estimation, Gait Analysis.

Text Books :
1. Bohr A. and Kaveh Memarzadeh, Arti/icial Intelligence in Heallhcare (l ed.). Elsevier
Science, 2020. ISBN 978-01 281 84387.

Reference Books :
l. Bohr A. and Kaveh Memarzadeh, Artificial Intelligence in Healthcare (l ed.), Elsevier
Science, 2020. ISBN 978-01 281 84387.

Assessment Scheme:

Components Internal Assessm€nt Mid Term Exam End Exam fotal

Weightage (o/o) 45 20 35 100

R
w
'f/,
ti
1i
i.l
;a'
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET34.l Image and Video Processing t. T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To explain and Analyse images using Histograms and spatial filters. Apply Hough
transforms and be familiar with image representation using textures.
CO2: To compute motion using optical flow and understand methods for image description
and morphological operations.
CO3: To implement different low-level and high-level image and video processing techniques
to wide variety of applications.

CO-PO/PSO MaDDinc

POt P02 PO3 PO4 PO5 PO6 PrJ1 PO8 PO9 PO t0 POI I PO t2 PSOl PSO2 PSO3
cor 3 3 3 3 3
co2 3 3 2 3 2 2 3
c03 3 3 3 3 3 , a 2 2 3 3

1=weakly related 2: moderately related 3:strongly relat€d

Course Contents:

Module l: T leclure hours

Applicationsof Digital lmage Processing, Elements of Digital image processing systems,
Sampling and quantization, Neighbours of a pixel, adjacency, conneclivity, Regions and
Boundaries, Distance measures, Cray scale to Binary image using thresholding, Image
Enhancement in the Spatial domain, Gray level transforms, Histogram Processing, Histogram
)
Equalization, Enhancemenl using Spatial filteB, Concept of convolution, Smoothing, Mean,
median and Gaussian filters, Edge detection using Prewitt. Sobel, Laplace Filters, Laplace of
Gaussian Filter.

Modulo ll: 6lecture hours

Canny Edge Detector, Harris Comer Detector, Color models, RGB, HSV, YCbCr models,
Pseudocolor Image Processing, Color Transforms, Color to grayscale conversion, Handling
Binary Images, Line detection using Hough transform, Polar form, Circle Detection,
Morphological Operations, Dilation, Erosion, Opening, Closing, Boundary detection, Hole
filling, connected components, Hit and Miss transform, Shape representation using moments,
Texture analysis, Texture from histogram, Texture from GLCM matrices.

Ulz
r.i.;:{rtl1. , ....r (: ,.r t*.,"-'i, r.ro:.:-r
i,. i,,
Fict
, ,,., . .-
I . '' ':. -' '..'," - 't O
.,

Gr:atl-t t'""'- ,' --

 Module III: g lecture hours
Motion Detection, Concept ofoptical Flow, optical flow equation, Lucas Kanade method, Image
Enhancement in the Frequency domain, l-D and 2-D Fourier Transform and lheir Inverse. Low
pass and Hi pass Filtering, ldeal and Butterworth and Gaussian Filters, Homomorphic Filtering,
Image compression Fundamentals, Lossless Compression Models, Run lengrh Encoding,
Huffman Coding, Lossy Compression, Discrete Cosine Transform, euantization, Zigzag
coding, Color image compression, Text recognition, Feature detection, Integral Image
Formation.

Module IV: 7 lecture hours

Face Detection - viola Jones method, Face Recognition, principal component Analysis
(PCA),concept of Eigenface, Feature detection for Machine learning applications, SIFT and
HOG parameters, Video Processing, Video fonnation, Video sampling, Motion estimation,
Motioncompensaled (MC) filtering, Frame-rate conversion, Video Codi.g, Video
Compression, Framebased compression (MPEG), Salient object detection, Human action
recognition frorn videos, Depth cameras- Kinect camera data capture, RGBD data.

Text Books :
I Szeliski Richard, Computer Vision: Algorithms and Applicqtiow (2 ed.), Springer, 2022. ISBN
97 8-30303437 t2.
2. Jain K., Fundamenlals of Digilal lnage processing (lst ed-), pearson Education tndia.20l5
lsBN 978-933255 19 t6.

Refe ren ce Books :

l. Bovik, A. C-, Handbook ol'image and video processing (l ed.), Academic press,20l0.
ISBN 9780121 197902.
2. Kim, B. G., Digital Signal, Image and Vicleo processing for Emerging Multimedia
Technologt. Electronics ( I ed.), Mdpi AG, 2021 . ISBN 978-3039438570.
3. Vyas. A., Yu, S. and Paik, 1.. Fundamenlals o/ digitat image processing. In Mulriscale
Trans;fbrms with Appliccttion to lmage Processing (l ed.), Springer, 2018. ISBN 97g_
98lt3s6l3t.

) Assessmen t Scheme:

Components lnternal Assessment Mid Term Exam End Exam Total

Weightag€ (%) 45 20 35 t00

 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET345 Information Retrieval and Search En grne L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion of this course, the studcnls nill be able to:

Col: To explain the comprehend types of text analysis, Information retrieval. IR system
architecture, query processing models and probabilistic models.
CO2: To build information retrieval systerns by performing indexing, compression,
information categorization sentiment analysis, network management, search engine
optimization, records compliance and risk management.
co3: Implement different information retrieval approaches for applications in text domain.
)
CO-PO/PSO MaDDins

POt PO2 PO3 PO4 PO5 PO6 l,()7 P()8 PO9 POt0 POII PO t2 PSOt PSO2 PSO3
col 3 2 2 3
co2 3 3 3 3 3 I 2 2 2 2 3
c03 2 3 3 3 2 2 I 3 3

l:weakly related 2= moderately related 3=strongly related

course Contents:
Module I: lglecture hours
Text analysis and types, Infonnation retrieval, Text processing, Indexes and query matching,
semistructured text data, Tokenization, Sternming, Lemmatization, Language modelling,
Examples ofopen source IR systems, Query processing models. probabilistic models. Binary
independence rnodel, Robertson/Spark Jones weighting formula, Two-poisson model,
)
Relevance feedback, Term selection, Pseudo relevance feedback, Language models, Unigram,
Bigram language models, Generating queries from documents, Language models and
smoothing, Ranking with language models, Retrieval evaluation measures Normalized
Discounted Cumulative Gain (NDCG), Kullback-Leibler divergence, Divergence from
randomness, Passage retrieval and ranking, Management of Information Retrieval systems,
Knowledge management, lnformation management. Digital asset management, Network
managemenl

Modulo ll: E lecture hollrs

search engine optimization, Records compliance and risk management, version control, Data
and data quality, Information system failure, Web retrieval and mining, Semantic web, XML
information retrieval. Recommender systems and expert locators, Knowledge management
systems, Decision support systems, Geographic information system (GIS), Indexing. lnverted

l\4.//
7/
.,, ,/. /.,
U/, .l1.,,,., .i',..r.,i
'; ' . -l' ':i-'tr' ii
1
 indices, lndex components and Index life cycle, lnterleaving Dictionary and Postings lists,
Index construction, Query processing for ranked retrieval, Compression, General-purpose data
compression, Symbolwise data compression, Compressing posting lists, Compressing the
dictionary.

Module III: l0 lectur€ hours

Information categorization and filtering, Classification, Probabilistic classifiers, Linear
classifiers, Similarity-based classifiers, Multi category ranking and classification, Learning to
rank, Text Clustering, Partitioning methods, Clustering versus classification, Reduced
dimensionality/spectral methods, Lexicons, Corpora, Sentiment Analysis, Document-level,
Sentence-level and Aspect-based sentiment analysis, Web crawling, Near duplicate pages,
Distdbuted word representations, Link Analysis, PageRank algorithm, Search engine bias,
Personalized searching, Question Answering, Cross-lingual retrieval, Adversarial lnformation
Retrieval.

Text Books :
l. christopher D. Manning, Prabhakar Raghavan and Hinrich sch;jtze, Inttoduction lo
Information Reffieval (l ed.), cambridge university Press, 2019. ISBN 9781 107666392.
2. Mitra Bhaskar and Nick craswell, An Introduction to Neural Information Retrieval (l ed.),
Boston Delft, 2019. ISBN 9781680835327.
-
Reference Books :
l. Sarfraz Muhammad, Critical Approaches to Information Retrieval Research (led'), lcl
Global, 2019. ISBN 9781 79981 0232.

Assessme nt Scheme

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

*"MUri,',
Dcn'Zrrcii l-i,:)'. CnJat' I i Joiclr
;- I:. . ::.;.:'..,(:L::'I -i:'h)
i,i. t ;l rt. L, 'J, 10, il, iccir Zons-ll
Greatci Noicia-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET346 natural Language Processing L T P C

Owning School/Department Department of Computer Science 2 0 2 J

Engineering
Pre-requisites/Exposure

Course Ou mes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate natural language processingand impoftance ofword representation'

CO2: To build deep learning model for solving natural language problems such as language
modelling, machine translation, POS tagging, Seq2Seq generation.
CO3: To implement state-of-the-art Machine Leanting and Deep Learning solutions to NLP
problems in Global & Indian context.

) CO.PO/PSO MaDDinp

POI ?02 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 PO POt 2 PSOI PSO2 PSO3

col 1 2 2 2 2 2 3
,, 3
cCJ2 3 3 3 2 2
c03 3 3 3 3 3 3 2 2 2 3 3 3

l:weakly related 2= moderately related 3:strongly related

Course ontents:

Module I: 7l€cture hours

natural Language Processing: Need, applications, industry demand, Challenges in NLP:

Ambiguity in language, Contexfual words and phrases and homonyms, Coreference, Domain-
specific language, Low-resource languages, Segmentation' Stemming, Lemmatization,
Spelling correction, Synsets, Hypemyms, Tokenization, N-grams, Stops Words, WordNet,
) WordNet Similarity, Language Corpus, N-gram Language Models, Hidden Markov Models'

Modulo II: 7 lecture hours

NLTK (natural Language Toolkit for Indic Languages), Text normalisation, script
normalisation, Parallel Corpus, Handling Code-mix text, Cross Lingual Information Retrieval,
Word representation, Sentence representation, Word embedding, Vector space model, Term
Frequency, TF-lDF Representation, Distributional representation, Word2vec: CBOW(20)'
Word embedding for regional language, Word2Vec, GloVe, Document to Vector.

Module lll: T lecture hours

Neural Networks for text, Recurrent Neural Networks, Vanishing Gradients, Exploding
gradient, LSTM (Long sort term memory), CRU (Gated recurrent Unit), Seq2Seq
Modelling, Bidirectional Model, Contextual Representations, Transformers, BERT,
 Multilingual Embedding, Transfer Leaming in Word Embeddings, MUSE, POS tagging,
named Entity Recognition, Sentiment Analysis, Text Clustering.

Modute IV: 7 lecture hours

Topic Modeling, Latent Semantic Analysis, Statistical Machine Translation, Neural
Machine Translation, Self-Attention for Generative Models, natural Language Ceneration,
Attention, Question Answering Bot, I D-CNN for NLP, Sub-word Models, Openal's GPT,
Google's ALBERT ULMFiT. Facebook's RoBERTa, Text Summarization, Extractive,
Abstractive Text summarization, Transformer models for Text Summarization'

Text Books :
l. Rao Delip and Brian McMahan, ra tural Language Processingwilh PyTorch: Build Intelligent
Language Applications Using Deep Learning (l ed.), O'Reilly Media, 2019 ISBN
9781491978238.

Reference Books :
1. Eisenstein lacob, Introduction to mtural Language Processing (l ed')' The MIT Press;
) Iltustrated edition, 20 I 9. ISBN 97 80262042843.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

Weightrge (Yo) 45 20 35 100

rat
Be nett Uni'/ersity, Greater Noida
(Es l?bli:h.d Uldir Acl 2.1 of Govt, of Utlar P radesh)
PI ot No's B, 9, 10, 11, Tech Zone-ll
Greater Noida-2013'10
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET347 Social Network A ts L T P C
Owning School/Department Department of ComPuter Science 2 0 2 J
Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion of this course, the students will be able to

COI: To understand human behavior in social networks and related communities.

CO2: To build and apply networking models for understanding social interactions'
CO3: To implement network rnedia graph virtualization and network relationships

CO-PO/PS O Mannins

) POI PO2 PO3 PO4 PO5 PO6 PO7 PO{t PO9 PO t0 POI I POt 2 PSOI PSO2 PSO3

col 1 I 3 I 1 2 2 2
c02 3 , 3 I 3 3 2 2 2 3
1 2 a 2 3 3
co3 3 1 3 2 3 3

l=weakly related 2: moderately related 3=strongly related

Course Con fents:

Module I: S lectur€ hours

Social network analysis purposes, Phenomenology ofsocial media, Social network monitoring
tools , Entity resolution, Types of social networks, Networks Representation, Adjacency
Matrix, Weighted and Directed Networks, Hypergraphs, Bipartite Networks, Graph Laplacian,
Random Walks, One mode and two mode networks, Heterogeneous Information Networks,
Closeness centrality, Betweenness centrality, Eigenvector centrality, Clustering coefficient,
Density of graphs, Isomorphic graphs. Reachability, Cliques' Graph colouring problem,
Valued graphs, Multi graphs.
,)
Modllo tl: T lecture hours
Large Scale structure of Networks, Small world Effect, Degree Distributions, Power Law,
Scale Free Networks, Assortative Mixing, Time series analysis in graph, Temporal graph
algorithms, Parallel dynamic graph algorithm, Matching theory, Bipartite matching, Konig's
thiorem, Hall's Matching Theorem, Network flow, Max flow min cut theorem, Menger's
theorem, Ford Fulkerson method.

Module lll: 7 lecture hours

Ties, Structural holes, Structural balance, Equivalence, Motifs, Random Graphs, Giant
Component, Small Components, Configuration Model, Excess Degree Distribution, Vertex
Copying network models, Erdos-R6nyi model, Barab6si-Albert model, Exponential Random
Graphs, Percolation

Module lV: 6 lecture hours

ar .', c,'. lr r lrr ,, i,j' '

! lJtI,"'
, , ,,"1 !i,
,1,.)1lr1C
i ,i='i'
 Communities in network, Community detection from network, Louvain Method, Overlapling
communities, Non-overlapping communities, Information diff.rsion in social notworks,
cascading Behavior in Networks, Link Prediotion, Preferential Attachmont, Geospstial social
networks, Crowdsourcing, Rumours and Deoeption in sooial networh Fake News, Spamming,
Identift theft.
Text Books :
l. Blokdyk Gerardvs, Social Network Analysis A Complete Guide (3 ed.)" 5starcooks, 2020.
rsBN 978-1867330097.
2. Beineke L.W., Martin Charles Golumbic and Robin J. Wilson, Topics in Algorithmic
Graph Theory (l ed.), Cambridge University Press, 2021. ISBN 9781 108492607

Reference Boots :
1. Dey Nilanjan, Social Network Arralyties: Computational Reseot"ch Methods and
Techniques (1ed.), Aoademic Press, 2018. ISBN 978-0128154588.

Assessment Scheme:

J Components IDternrl Aisgssment Mid Term Erom End Exrm Totd

Welghtogo (o/d 45 2A 35 100

W.'*
#6.:it U.riversitv, Greater Noida
IFrr:: : r (l J :l:r Act 24 Ll Giu, cl U:lrr Pradash)
irlct 1u,,,. B, 9, 10, 11, Tech zone-ll
Greerter t{0ida-20131 0
 Name of Program Bachelor of TechnologY (Computer Science and
Engineering)
CSET348 Reinforcement Learning l- T P C

Owning SchooUDepartment Department of Computer Science 2 0 2 ,

Engineering
Pre-req uisites/Exposu re

Course Outcomes Os

On completion of tlris course. the students will be able to:

CO1: Understand key features of Reinforcement Learning (RL)'

CO2: Decide, formulate, design, and implement given application as RL problern'
CO3: Implernent common RL algorithms and evaluate them using relevant metrics

CO-PO/PSO Ma ln

PO3 PO4 PO5 PC)6 PO7 PO8 PO9 PO l0 PO POl2 PSOI PSo2 PSO3
POI PO2
3 1 3
col 3 3 2
3
1 3 3 3
c02 3 3 3
1 3 3 3 3
co3 2 2 3 3

l:weakly related 2= moderately related 3:strongly related

Cou rse Contents:

Module l: T lecture hours

lntroduction to RL: Course logistics and overview. Introduction to Reinforcement Learning
(RL), Origin and history of RL research, RL and its connections with other ML branches'
Linear algebra overview, Probability overview, Sequential Decision Making, Modelling the
world, Components of a reinforcement learning agent, Taxonomy of reinforcement leaming
agents. Introduction to lnstance based learning.

Modulo II: T lectur€ hours

) & lntroduction
Markov Decision Processes and Bandit Algorithms, Policy Gradient Methods
to Full RL, Reinforcement Learning Problems, MDP Formulation, Bellman Equations &
Optimality Proofs, Markov Processes, Markov Reward Processes, Markov Decision
pio"".ses, Bellman Equalion, Bandit Algorithms (UCB, PAC, Median Elimination. Policy
Gradient), Contextual Bandits.

Module Ill: T lecture hours

Dynamic Prograrnming & Temporal Difference Methods, DQN, Fitted Q & Policy Gradient
Approaches, Introduction to f)ynamic Programming, Policy Evaluation (Prediction), Policy
lmprovement, Policy lteration, Hierarchical Reinforcement Leaming, Value Iteration,
Generalized Policy lteration, Hierarchical RL: MAXQ, Asynchronous Dynamic
programming, Efficiency of Dynamic Programming, Temporal Difference Prediction, why

w,.
L/
 TD Prediction Methods, On-Policy and Off-Policy Learning, Q-learning, Reinforcement
Leaming in Continuous Spaces, SARSA.

Module IY: 13 lecture hours

Dynamic Programming & Temporal Difference Methods, DQN, Fitted Q & Policy Gradient
Approaches, Introduction to Dynamic Programming, Policy Evaluation (Prediction), Policy
Improvement, Policy lteration, Hierarchical Reinforcement Learning, Value Iteration,
Generalized Policy lteration, Hierarchical RL: MAXQ' Asynchronous Dynamic
Programming, Efficiency of Dynamic Programming, Temporal Difference Prediction, Why
TD Prediction Methods, On-Policy and Off-Policy Learning' Q-learrring, Reinforcement
Learning in Continuous Spaces, SARSA Prediction, Monte Carlo Estimation of Action
Values, Monte Carlo Control, Monte Carlo Control without Exploring Starts, Incremental
lmplementation, Policy optimization methods (Trust Region Policy Optimization (TRPO) and
Proximal Policy, Optimization (PPO).

Text Books :
l. Sufton R.S. and Andrew G. Barto, Reinforcement Learning: An Introduction (2 ed.)' MIT
) Press, 201 7. ISBN 978-0262039246..
2. Murphy K.P., Machine Learning: A Probabilistic Perspective (l ed.), MIT Press, 2012.
ISBN 978-026201 8029.

Reference Books ;
l. Bertsikas Dimitri and John G. Tsitsiklis, Neuro Dynamic Programming, Athena Scientific
(l ed.), Athena Scientific, I996. ISBN 978-1886529106. .
2. Sewak Mohit, Deep Reinforcement leaming: Frontiers of Artificial Intelligence (l
ed.),
Springer, 2019. ISBN 978-981 1382840..
3. Masashi Sugiyama, Statistical rcinforcement learning: modern machine learning
approaches (l ed.), Chapman and Hall/CRC,2015. ISBN 978-1439856895.

Assessment Scheme

Components lnternal Ass€ssment Mid Term Exam End Exam Totsl

Weightage (%) 45 20 35 100

)

...r., .I .. ..1 .r l!:I'l;,1

';1 , t. -,1,1
t ,. , .l;, r-!.r''o'l'-li
c '-.-.)'il.lic
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET349 Special Topi cs in Artificial Intelligence L T P C

Owning School/Department Department of Computer Science 2 0 2 J

Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: To familiarize and leam about the latest trends and research in the field.
C02: To equip themselves with the conceptual and practical experience offew latest methods,
tools, technologies or algorithms in Artificial Intelligence.

CO-PO/P MaDninp

) POI PO2 P03 PO4 PO5 PO6 PO7 PO8 P()9 PO t0 POI I PO l2 PSOI PSO2 PSO3
col 3 3 3 2 2 3
co2 3 3 3 3 a 3 3

l=weakly related 2: moderately related 3=strongly related

Course onlents:

Module l: 28 lecture hours

This course covers the cutting-edge topics in Artificial Intelligence, and these modules will be
chosen by the instructor based on the requirements and relevance at that point of time. These
modules need to be relevant to the industry and start-ups will also include related case studies,
use cases and implernentations scenarios. Students will be working on lab work and projects
to get real hands-on experience ofthese topics and modules.

Assessment Scheme:

) Components lnt€rnal Assessm€nt Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

)
Specialization
Electives:
o
Blockch atn
)

W ' t
..:1.
'r;'
.l:l
r- rl
:-ti
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET35O Blockchain Technologies: Platforms & L T P C
Applications
Owning SchooVDepartment Department of Computer Science 2 0 2 3

Engineering
Pre-requisites/f, xposure

Course mes (COs)

On completion ofthis course, the students will be able to:

COI: To articulate blockchain platfonns that show promise in solving complex business
problems.
CO2: To examine the life cycle ofa chain code and its components.
CO3: To make use ofvarious blockchain-based enterprise applications.
)
CO-PO/PSO MaDDins

POt PO2 PO3 PO4 PO5 PO5 PO7 PO8 PO9 PO t0 POI I PO t2 PSOI PSO2 PSO3
.,
col 3 1 3
,|
2
.,
2 3
cC)2 3 3 3
co3 I 3 2 2 , 3 2 2 ) 3 3

l:weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 8l€cture hours

Blockchain platforms: Ethereum, Hyperledger Project, IBM Blockchain, Multichain,
Hydrachain, Ripple, R3 Cord4 BigChainDB, IPFS, Building Dapps, Ethereum consensus'
Proof of Authority, Ethereum Client, Mist Wallet, Accounts.

) Modulo Il: S lecture hours

Contract creation code, Deploying solidity code, Web3js and RPC protocols. Miners,
Transaction and Block in Ethereum, Front End Development, Fabric Model, Identity
management in Fabric, MSP in fabric, Policies, Ledgers in fabric, Chaincode, Multiple
chaincodes on fabric, Endorsement peers.

Module lll: T lecture hours

Ordering nodes, committing peers, Anchor peers, creating organizations via fabric, Life cycle
of chain code, packing transactions into blocks, Validation and commit, Channels, Solo
ordering service, Kafka, Sharing private data, Private data sharing patterns.

Modute IV: 5 lecture hours

Key level transaction access control, Key level endorsement, Set up a cluster on fabric model, Set
up your CA, Use the CA to create local MSPs, Deploy a production network on HF.

Ui, ','.:t',. Gr::..iilt- i'.l3iCa

., il .i Itr :r'ijh)
' :ir, ii .r i,;ir Zrrr.:-ll
 Text Books :
1. Serres Tom, Bill Wagner and Bettina Warburg, Basics of Blockclzain (l ed.), Animal
Ventures LLC, 2019. ISBN 978 I 08991 944 l.
2. DiMatteo Larry A., Michel Cannarsa and Cristina Poncib, The Cambridge Handbook of
Smart Contracts, Btockchain Technologt and Digital Platforms (l ed.), Cambridge
University Press, 2019. ISBN 978-1 108492560.

Reference Books :
1. Gaur and Nitin, Hands-On Btockchain with Hyperledger: Building decentralized
applications with Hyperledger Fabric an (l ed'), Packt Publishing Ltd' 2018. ISBN 978-
1788994521.

Scheme:

Components Internal Assessmont Mid Term Exam End Exam Total

) Weigbtage (%) 45 20 35 100

Wa
B#nett University, Greater Ncida
(Eliab:ith.d Und.rAct 2J ofGlvt, o, ULtar pradesh)
Plot No's B, 9, 10, 11, Tech Zone-il
Greater Noida-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET35I Smart Contracts and Solidity L T P C
mmt
Owning SchooUDepartment Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/f, xposu re

Course Outc COs

On completion ofthis course, the students will be able to:

CO1: To articulate smart contracts and construct Decentralized Applications

CO2: To build solidity programming constructs.
CO3: To implement various smart contracts using solidity.

CO-PO/PS O Manninp
)
POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POt0 POI I PO l2 PSOt PSO2 PSO3

col 2 2 I I 3 2 2
c02 3 , 3 1 2 1 2
,,
3
c03 3 , 3 2 3 3 2 2 2 2 3 a

l=weakly related 2= moderately related 3:strongly related

Course ontents:

Module l: T lecture hours

Why Smart Contracts, structure of a smart contract, solidity constructs, global variables in
solidity, Life cycle ofa solidity contract, Interfaces, External function calls, fall back functions,
payable functions, Revert, assert, Require, Decentralized Autonomous organization tokens,
Maker DAO.

Modulo ll: 9lecture hours

) Token based membership, Share based membership, Automated immutable systems, Ethereum
with DAOs, Pure functions, View functions, Ethereum Virtual Machine (EVM), Byte Code
interpretation, Ethereum mining reward scheme, Gas pricing, Ethereum development.

Module lll: T lecture hours

Whisper, Swarm, Raiden Network, State Channels, Development with Solidity, Development
environments, MIX (The DApp IDE), Ether.camp' Truffle' Sublime, testRPC, Development
and reuse of common pattems, modifiers driven development, contract driven development,
testing.

Module IV: 5 lecture houns

Smart contract security issues, Common attacks on smart contract, Error Handling in smart
contracts, Modifiers, Mutex Pattern, Balance limit pattem, Smart contract security tools, Smart
Inspect, GasTap, Smart Check, Solgraph, advance research topic rt Contract.
 Text Books :

1. Reed snd Jeff, Srfiart contracts: The essential guide to using blockchain smart contracts
for cryptocffrency exchange (1ed'), CreateSpace Independent Publishing Platform, 2016'
ISBN 978- 1539457442

Reference Books :
1. Antonopoulos Andreas M., Gavin Wood Ph.D, Mastering Ethereum (l ed'), O'Reilly,
2018. ISBN 9781491971916 .

Assessment Scheme

Components Internsl Assessment Mid Term Exam End Exam Total

W€ightag€ (%) 45 20 35 100

frh
ae{*4rar
Bennett Uni\/ersitv, Greater No.d-
(E5iri:-:, , r, ,-, : l:r,,-l; i; i G1vl. cf I rtrirr pradc-sh)
Hrol I Ic .- ii, !, 'l
0, 11 , teih Zone-il
Greater N,-.iCa-101 31 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET352 Digita I Currencies and Blockchain L T P C

Owning School/DePartment Department of Computer Science 2 0 2 ,

Engineering
Pre-requisites/ExPosure

Course Outco mes (COs)

On completion of this course, the students will be able to:

COl: To articulate blockchain-based digital currencies and data structure ofthe bitcoin digital
currency.
CO2: To examine different approaches of digital currencies.
co3: To implement the different digital currency wallet types and transactions using different
types of wallets.

CO-PO/PSO Maooins

PO7 PO8 PO9 POl0 POI I I'Ol2 PSOI PSO2 PSO3

POI P.)2 PO3 P()4 PO5 PO6 .,
,, 3
col 2 3
3 3
co2 2 3 3
co3 , 2 2 1 3 2 2 3

l=weakly related 2= moderately related 3:strongly related

Course Cont ents:

Module l: 8 lecture hours

Digital currency, cryptocurrency vs fiat currency, web 3.0, transactions in digital currencies'
bitcoin model, Bitcoin Structure, Bitcoin implementation, public and private addresses'
Data
alternative cryptocurrencies-ETH, Ripple, Litecoin, Matic, Bitcoin network architecture'
structure ofth; bitcoin blockchain, Stack for bitcoin blockchain, Linked list representation
of
bitcoin blockchain, operations on the bitcoin blockchain, special variables in Bitcoin.
)
Modulo ll: S lectur€ hours
in the
Bitcoin storage, Bitcoin mining, Bitcoin Services and functionality, Bitcoin forks, Users
Bitcoin system, Applications of Bitcoin' tmpact of Bitcoin mining, Bitcoin anonymity'
Blockchain verification. Bitcoin consensus, Full nodes vs. SPV (Simplified Payment
Verification.l nodes. Light nodes.

Module lll: 6lecture hours

Mining economics, Mining infrastructure, the Bitcoin Script language, reverse polish notation'
-writing,
script script execution, bitcoin wallets, types of wallets, security implications of the
different type of wallets, Dark web.

Module IV: 6 lecture hours

W,,. ''-ch;{!tlc
l-
r..l )ill'1t)
 Socio-potitical impast, and regulation on crypto curencies, Law enforcement on Bitcoin,
sudden gro*th of Bitcoin, Bitcoin impact on society, issues with bitcoin, Bitcoin impact on
environment, Bitcoin application other than cryptocurrency, Bitcoin vs file coin, startups in
Digital Currencies.

Text Books :
1. Lewis Anlr:ny, The Basics of Bitcoins and Blockthains: An Introduction to
Cqptocurrencies and the Technologt that Powers Them (Cryptography, Crypto Trading,
Digital Assets, NFT) (l ed.), Mango medi4 201 8. ISBN 978-1633538009'

Reference Books :
1. Tapscott Don and Alex Tapscott, Blockchain Revolution (l ed.), Portfolio, 2018. ISBN
978-1101980149.

Assessmen t Scheme:

Components lnternal Assessment Mid Term Exf,m End Exam Total

)
Weightage (%) 45 20 35 100

t//
Re,<i{dr
b-ui,6i, ut,, ,"rs:iy. Greater Noida
E.,"it.i,,' r'. r', r,.r : ; ;f G.-(. ol uitar Fredesh)
FiJ-i r::o i c, e, 10, 1 1 , Tech zone-ll
Gre.iter Noida-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET354 ber Security with Blockchain L T P C

Owning SchooUDepartment Department of ComPuter Science 2 0 2 J

Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulatethe cyberthreat landscape and Security Challenges

CO2: To build Blockchain-based apps for authentication and for storing DNS entries.
co3: To implement various decentralized applications using blockchain to provide various
security services.

CO-PO/P Mannins
)
POI Pt)2 PO3 PC,4 PO5 PO6 PO7 PO8 PO9 POl0 POI I POl2 PSOI PSO2 PSO3

col 2
.,
2 3 3
co2 3 3 2 3 2 2 2 2 3 3
., 3 3 3 3
co3 3 3 3 3 3 3

l=weakly related 2: moderately related 3:strongly related

Course ontents:

Module l: E lecture hours

Cyber Security, lntemet Governance - Challenges, Constraints, Threats, Cyber Warfare, Cyber
Crime, Terrorism, Espionage, Need for a Cyber Security Policy, Nodal Authority requirement,
Requirement of an lnternational Convention on Cyberspace, CIA model' Cyber Security
vulnerabilities, Cyber Security attacks.

) Modulo ll; S lectur€ hours

Security services, Blockchain on the CIA Security Triad, Authentication mechanisms. Two-
Factor Authentication with Blockchain, PKI Infiastructure, Deploying PKI-Based ldentity with
Blockchain, IPNS, Blockchain-Based DNS Security Platform, Deploying Blockchain-Based
DDoS Protection, EIP Block for DDoS attacks, Security related issues in smart contracts
development. Smart contract testing.

Module I Il: 6lecture hours

Exception handling, debugging of applications, Formal verification, smart contracts security
Oyente, why3 for smart contracts, Solgraph based formal verification, implications of
blockchain technology for digital privacy, implication for Security, Membership and Access
control in Fabric. authentication in fabric network.

Module IV: 6 lecture hours

tt l'.r !ei,;ilv, G.i:llar l!ctd:l

lil:. :, t-lr i r.?1.-iirch
L,i I.il,r':r.:lci.h)
!r, 10, '11, Zor)e-ll
-2013'10
 privacy in Fabrio, channel encryption, Blockchain Socurity (Fabrio sideDB), security ofa
ledger, anonymity, pseudonymity, blockchain Implementation Challenges, privacy law
applicability, startups in blockchain based cyber security applications'

Tert Books :
1. Gupta R., flazals -on cybersecurity with bloctwhain (1 ed.), Packt Publishing, 2018' ISBN
978- 788990189.

Referencc Books :
1. Yuan Michael Juntao, Buitding Blockchain Apps (l ed'), Pearson Eduoation,2020' ISBN
978- 9390168385.

Assessment Scheme

Componcnts lnternal Assessment Mid Torm Exom End Exam Totsl

Weightag€ (%) 45 20 35 100

)

'., ; ';l:"
Ei,W,,' : i1 i I li r'..l,lJl l-9,i,
H--i ^;.' "i
n ii . ici.ir Zone-ll
E[l'.'"," ir'.;ii'] :-or gr'o
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET355 Web DeveloPment for Blockchain L T P C
A lications
Owning School/DePartment Department of Computer Science 2 0 2 J

Engineering
Pre-requisites/ExPosure

Course Ou tcom es (COs)

On completion ofthis course, the students will be able to:

websites to produce functional' flexible' &

COl: To explain planning strategy for developing
versatile websites.
developing websites'
CO2: To examine critically assess current & emerging technologies for
CO3: To implement the front-end for decentralized applications'

CO-PO/PSO MaoPins
)
PO8 PO9 PO t0 POI I PO l2 PSOI PSO2 PSO3
POI PO2 PO3 P3()3 PO5 PO6 PO7
4
3
cot 3 3 3
I 3 3
co2 3 3 3 3
3 3 3
c03 3

l:weakly related 2= moderately related 3:strongly related

Cour"se Co n ts:

8 lecture hours
Module I:
Why ntoctcnain *ith Web Development. Technology stacks, HTML5
& CSS for blockchain-
dev tools, Functional programming parad igm JavaScript
basid web development. Chrome
basics, communication with peers' bui lding client and
inside a browser, Python data types and
."-"., ,nin"t una *allet, building a socket communication utility' tJse ofLow Code, No Code
Tools in the develoPment.
6lecture hours
) Modulo Il: to the old one-with
l"""S.ifpi enabled blockchain applications, compiling .new JavaScript
in project' Asynchronous JavaScript
*.Up""f, Better CSS *ith *ebpaci, Code organization a
code for developing smart contracts, APIs for blockchain solutions'
S lecture hours
Module lll:
its ecosystem'
Overview of server-side options, Node JS environment for blockchain and
application state'
JSON, REST API Using Fostman to debug API' Managing server-side
(SQLite,
*J:li f", blockchain ieb applications. Ditabases and users to interact.
SQL PostgresQl), data
no.r'utirution. User authorization and authentication, allowing
6 lecture hours
Module IV:
other software
Web security basics, not trusting your clients, why use H'ITPS, integrating
*iitr ifr" .e'rver, developing fr:ontend with React, concept of single-page applications,
."""gi"g applic,ition state (Redux). overview of other client JS frameworks'
"fi*,-side

Rrul,
1,..\{.1'.
(il :' : l.

i:i,-i, :: i i, l. .ir ,'-''r:e-

Cr'. ,
 development brganization, using git, concept of continuous integmtion, configuring a
production web server with Ubuntu.

Text Books :
1. Eric Traub, earn Bloclrrhain Programming wtth Javasctipt: Build your very own
Bloclrchain and decentralized netwo (l ed.), Packt Publishing Ltd, 2018' ISBN 97E-
1789618822.

Refercnce Boo}s :
1. Gabarr6 Steven A, lYeb Application Design and Implementation: Apache 2, PHPS'
MySQL, JavaS,cript, and Linut/WN (1 ed'), WileyJEEE Computer Society, 2006' ISBN
978-0471773917.

Assessment Scheme:

Components Internal Assessment Mld Term Exam End Exam Totrl

l Weightage (%) 45 20 35 t00

*W,i/^,
Bei#ett Universitv. Greater Noida
irl 24 oi G Ju..l'ech
(Estibr..l : i r.i-it. Lf urlar Pradesh)
Plot Nos d,9, 10, 11, Zone-ll
Greatei Noida-201310
 Name of Program Bachelor of TechnologY (Computer Science and
Engineering)
CSET356 Security and PrivacY for Big Data L T P C
An cs
Owning SchooUDepartment Department of Computer Science 2 0 2
Engineering
Pre-requisites/Exposure

Course Ou mes (COs)

On completion ofthis course. the students will be able to:

COI: To articulate security threats in big data analytics.

CO2: To examine the system vulnerabilities, exploitation.
CO3: To implement defence mechanisms on big data analytics

CO-PO/P SO MaoDins

) PO PO PO PO4 PO5 PO PO PO PO POI POI POI PSO PSO2 PSO

2 t 6 7 8 9 0 I 2 I J
,'
CO 3 3 ", , 2 3 2 2
I
CO , 3 3 2 ) , .,
2 ^,

2 .,
., 2 3 3
CO 2 3 2 3
J

l=weakly related 2= moderately related 3:strongly related

Course ontenls:

Modute l: 9 lecture hours

Introduction and Basic Concepts, privacy by design, security roadmap, Map Reduce
Architecture, Detailed Design of Architecture, Hadoop, Spark, Hive etc' Generic Data
Security, Data Theft, Data Manipulations, Privilege Escalations. Big Data Storage based
) Security lssues, Hardware Failure Impacts, Known Trivial countermeasures, Failure ofTrivial
Methods on Big Data.

Modulo II: 9 lecture hours

case Study ofStolen Data in Big Data Environment, Types ofThreats, Distinguished Security
Goals for Big Data, lmplementing Security on Big Data: Methods and Aim of each Method,
Administrative Measures of Big Data, Preventive Measures of Big Data Security using
Encryption, Preventive Measures of Big Data Security using Access Control, Detective
Measures of Security in Big Data, Auditing, Log Analysis, Data and Network Monitoring
Methods and Tools, Best Practice for Securing Big Data, Security cost of Big Data, Data
Anonymization, Data Pseudo Anonymization.

Module III: 10 lecture houts

1,.,..,. .,,,,, C- 'i..rr Ncr(!a

, .',,ta i-r,tr-Pr;.i . ir)
,
.. ,',,', 11, i,.Lh;Zorl-'-ll
Gii: i: .' - " llll l!
 Differential Privacy in Big Dat4 Methods for Differential Privacy and Impact of each Method,
Homomorphic Encryption, Heteromorphic Encryption, Complexity Analysis of Encryption
Techniques, Complexity Analysisof Privacy-based Methods. Malware and their Impact on
Big Data, Secure Multiparty Communication in Distributed Environment, Data protection
Laws for Big Dat4 General Data Protection Regulation, Important changes resulting fiom the
GDPR, Personal Data, Personal data and Big Data applications.

Text Books :
1. Joshi R,, Secari$, Privacy, and Forensics Issues in Big Data Network Security Essentials
( l st ed.), ICI Global, 201 9. ISBN 978- 1 52259742 1.

Reference Books :
1. Gupta Brij B. and Ramesh C. loshi, Security, Privaqt and Forensics Issues in Big Data (1*
ed.), CI Global, 2019. ISBN 9781522597441.

Assessment Scheme
)
Components Internal Mid Term Exam End Exam Total
Assessment

Weightage (7o) 45 20 35 100

r
/y/
Redlstrsr
Blha6tt Universit,/. Greatcr Noida
(6t661;shcd uldEr.r(.i 2; of C -.!,1 o'ur:sr Pr.rlcsh)
plot No,s g, 9, 10, 1j . T _rr .lone-ll
G rr,.1.- r i\i. i-i^ -r ^ 'r ^
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET357 Modern Cryptography L T P C
Owning School/Department Department of Computer Science 2 0 2 J
Engineering
Pre- req uis ites/E xpos u re

rse Outcomes COs

On completion ofthis course, the students wilt be able to:

COI: To comprehend and implement various cryptographic algorithms to protect confidential

data.
CO2: To identif! network vulnerabilities and apply various security mechanisms to protect
networks from security attacks.
CO3: To make use of security tools to locate and fix security leaks in a computer
network/software.
)

CO-PO/PSO Maooinp

POI P.)2 PO3 PC)4 POs PO6 PO7 PO8 PO9 POt0 POn PO t2 PSO I PSO2 PSO3
cot I 3 2 3 2
co2 3 3 3 , 3
c03 2 3 3 .,
3

I=weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: S lectlrr€ hours

Modular arithmetic, Modular Polynomial Arithmelic, Divisibility and greatest common divisors,
Euclidean Theorem, Random Number Cenerator, Pseudorandom Number Cenerator. prime
numbers, unique factorization, finite fields, Powers and primitive rools in finite fields, Fermat,s
theorem, Euler's theorem, Symmetric ciphers (Difference between symmetric and asymmetric),
) Monoalphabetic ciphers (Caesar cipher, Affine cipher, Additive cipher).

Modulo ll: g lecture hours

Polyalphabetic cipher (Playfair cipher, Vigendre cipher) hash functions, authentication and key
establishment, Message Authentication Codes (MACs), digital signatures, PKl. Block Ciphers
(Feistel Ciphers), Numerical of Feistel Ciphers, Data Encryption standards 8-bit, Discrete
Logarithms, Logarithms for Modular Arithmetic.

Module lll: I I lecture hours

Data encryption standards 64 bits, Advanced encryption standards, Diffie Hellman Key
Exchange Algorithm. Euclid Algorithm, Extended Euclid Algorithrn, RSA Algorithm.
Message Authentication and Hash Functions. Information Theory, Elliptic curves, Elliptic
curves over finite fields, The elliptic curve discrete logarithm problem, Elliptic curve
cryptography, Lenstra's elliptic curve factorization algorithm, Hash Al gorithm-SHA, MD5
 Digital Signature Algorithm and Authentication, Authentication Applications KDC, RSA
digital signatures, El Gamal digital signatures, GGH lattice-based digital signatures.

Tert Boo*s :
1. Stallings William, Network Security Essentials (4th ed.), Prentiee Hall, 2018. ISBN 978-
9352866601

Reference Books l
l. Stallings W., Cryp,tography and Network Secunry (7th ed.), Prentice Hall,20l7. ISBNgTE-
9332585225

Assessment Schome

Components Internal Assessment Mid Term Exam End Exam Totrl

Weightage (o ) 45 20 35 100

E It Llnlv.) sllv, Greater NoiCa

(E! trl: i:r, id Li rc..iiri !.4 (d iovl, ol Lllll i PieCeeh)
PI oI No':' 8, S, '1a), 11, l"ech Zono-ll
Grcsi:;i I'ioida-101 31 0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET358 Cloud Infrastructure and Services L T P C
Owning School/Department Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

Course Outcomes (Cr)sl

On cornpletion ofthis course. the students will be able to:

col: To explain where the wireress technorogies can be appricabre and evorving wireress
technologies and standards.
CO2: To articulate the architecture of various wireless technologies.
CO3: To experiment with various wireless technologies through hands_on projects.

CO-PO/PSO Ma DI'INg

POI PC)2 POI PO4 PO5 PO6 PO7 PO8 PO9 PO r0 POI I POr 2 PSO I PSO2 PSO3
col 2 2 I 2 2 I 3 3 I 2 I
co2 2 2 ^, I I 1 t 3 3 I ) I 2
co3 2 I I 3 I 2 I I ) 2 J

l:weakly related 2: moderately related 3:strongly related

Course Con tents:

Module l: glecture hours

wireless technologies: celrurar systems, saterite systems. broadcast sysrems, wireress
LANs.
Propagation modes' Fading in the Mobile Environment, Characteristics
of wireless transmission
(signals, antennas, multiprexing. moduration, interference).
Signar Encoding crit.ria, oigitai Da;,
Analog Signals, Analog Data, Analog Signals, Analog Data, Digiial Signals. Frequency
Hopping Spread
spectrum, Direct Sequence Spread spectrum, code Division Murtipre eccess,
cen".ution oi sf,."uding
Sequences.

) Modulo ll: l0lecture hours

Recent aends in wireress Networking Technorogy, Layered architecture for wireress communication,
Wireless TCP, Physical and Logical Architecture. Radio and Infrared Communication.
Salellite
Communicalions. 802.r l WLAN srandards, g02. I r MAC Layer, g02.1 r pHy
Layer, g02. r r Enhancements,
other *LAN stardards like 802.Ug, g02.nn and g02. p. wiretess sensor network platforms,
communication architecture and protocors, Energy Management, Area
optimization, Time
Synchronization, Duty Cycle Optimization, Sensor Data Acquisition. processing
and Handling.
Module lll: g lecture hours
wireless Personal Area Network standards, Bruetooth (rEEE 802. l5.l wireress USB,
), ZigBee (rEEE
802. 15.4), lnliared Data Association (rrDA), cigabit wireress LANs,
5c rechnorogy: Smar cers,
Massive MIMo. mmwave. rntrusion Detection system for wSN, Anomary
and mliuse detection,
Evolution of cellular systems, 6C Technologies, Starlink wireless, 7G Technology:
tntelligeni
Communication of the Inevitable.

W ,. ( i

r .
ri.: i::r-i.tri,jf
. ,N,
,ii ,...r)r:-lj
,.,
 Text Books :
l. c Beard and Stallir.gs w ., wireless comhunicarion Networfu and systens (l ed.), pearson, 2015. lsBN
978-t292108728.
2. colbach Gordon, wireless Net*orking: Intrcduction to Bluetoorh qnd lt/iFi (l ed.), Independently
Published, 2017. ISBN 978-19732521 15.

Refererce Boolc :
1. velrajan sefo, An lntoduction to 5G ll/ireless Networl<s (l ed.), Amazon Digital Services LLC -
KDP Print US, 2020. ISBN 979-8643303107.
2, Vannithamby R. and S. Talwaq Towards SG: Applications, Requirements and Cand.idate
Technologies (l ed.), John Willey & Sons, 20t 7. ISBN 978-l I 18979839.

Assessment Scheme

Components Internal Aseessment Mid Term Exam End Exam Totol

Weightage (%) 45 20 35 t00

)

Reri4lri
W,
Beiifftt Uni'.,:r:ity. C.enter l'loida
(t: f,.. ( : vr oi ijll.r. f radesh)
t-.5:.51:cd U 1 lcr 2r ;r

Ptct t'lo's C, 3, 10, 11,lech Zone-ll

Greater Noida-201310
 Name of Program Bachelor of Technology (Computer Science and
f,ngineering)
CSET359 Special T in Blockchain t. T P C
Owni ng School/Department Department of Computer Science z 0 2 3
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: To familiarize and learn about the latest trends and research
in the field.
Co2: To equip themserves with the conceptuar and practicar experience
offew ratest methods,
tools, technologies or algorithms in Blockchain.

co- PO/P Man Ins

) POI PO2 PO3 PO4 POs PO6 PO7 P08 PO9 t0
cot ., PO POI I PO l2 PSOI PSO2 PSO3
3 3 2 2
c02 2 ) 3 3 3 3
2 2 3 a 2 2 3

l=weakly related 2= moderately related 3=strongly related

Course Con ts:

Module l:
This course covers the cutting-edge topics in Blockchain,
and these ,n"0r,", *1i'otjtJ,ii.llTi
the inslructor based on the requiiements and rerevance ui
tr,,ui foint of rime. These modures
need to be relevant to lhe indusrrv and stan-ups
wi[ arso incrude'rerared case studies, ura aur",
and implementations scenarios. 3tudents wiri ue wo.t ing
on tau work and projects to get rear
hands-on experience ofthese topics and modules.

Assessm en t Scheme:

Components IIlternal Assessment Mid Term Exam End Exam Total

Weightage (7o) 45 20 35 100

i'
.,. r ';, iJCh;,,()itu-l!
.; ll.r i...i0
 Specialization
) Electives:
cvb er
Security

l:i.;
F
(

f.
(jr'.rat. r- l.l .t' .;.i.:i)ill'lC
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
Name of Program Bachelor of Technology (Computer Science
and Engineering)
CSET360 Malware Analysis for Mobile Devices L T P C
Owning SchooVDepartment Department of Computer Science 2 0 2 3
f,ngineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion of this course, the students will be able to:

COI: To skills to carry out independent analysis ofmodern malware samples.

possess the
CO2: To understand and analyse the Mobile application threat landscape.
CO3: To Apply techniques to unpack, extract, decrypt, or bypass in future malware samples

CO-PO/PSO Mappins

POI PO2 PO3 P04 PO5 PO6 PO7 PO8 PO9 POl0 P{)l I PO l2 PSOI PSO2 PSO3
cot 3 3 2 a 2 3 3 3 ,
co2 .,
3 2 2 2 3 ) 2 2
., ,, 3
co3 3 2 3 2 2 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: T lecture hours

Mobile Operating- System and Threats, Mobile Development Tools, Risky Apps, Looking
Closer at Mobile Apps. Malware Threats, Hoaxes, and Ta,xonomy- FakePlayer, DroidSMS,
Fakelnst, TapSnake, SMSReplicator, Geinimi, ADRD, Pjapps, AirPush, Boxer, GGSmart,
Defender, DriveGenie, Torec.

) Modulo Il: 6lecture hours

Open-Source Tools- Locating and Downloading Mobile Packages, Vulnerability Research for
Mobile OS, Antivirus Scans, Static Analysis, Linux File Command, APK, Key tool Key and
Certificate Management Utility, Sandbox Analysis, Emulation Analysis, native Analysis,
Reverse Engineering, Memory Analysis.

Module ll l: 8lectur€ hours

Static Analysis, Collections and Marketplace, Marketplace Mirrors and Cache, Contagio
Mobile. File Da1a. Cryptographic Hash Types and Queries, Metadata, Antivirus Scans and
Aliases, Certificate Information, Permissions, Strings, Mobile Malware Evolution, Detecting

R ar
Ec-l 'r,-:,-,ri'r.
'.,'l'.1 Orc lt;r ['lo'da
'al, i;',r { | L-llllrP"rJ':nJ"
ii,, i'l , Icch Zone-ll
f-i
, l"
i "i13'10
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET36I Device Level IoT Securi ty L T P C
Owning School/Department Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To articulate the security issues in IoT.

CO2: To apply the cryptographic techniques in IoT.
CO3: To implement various types of access control mechanism for IoT devices in network
environment.

/PSO Ma
)
POI PCl2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 POt I PO t2 PSO I PSO2 PSO3
cor 3 3
,, , 2 3 3 3 2
,,
c02 2 3 2 3
.,
2 2
c03 2 2 3 1 3 3 2 3 3

l=weakly relaled 2= moderately relaled 3:strongly related

Course ontents:

Module l: 6lecture hours

Briefreview ofthe Internet ofThings IoT, IoT in business world, Benefits Applications ofloT,
Security Issues with IoT, Basic Architecture of IoT, loT Attack Surface, OWASp Top l0 for
IoT. Concept of Vulnerability management, Quarantine and Prevention.

Modulo ll: S lecture hours

Security Requirements in IoT Architecture - Security in Enabling Technologies - Security
) Concems in IoT Applications. Security Architecture in the lnternet of Things- Security
Requirements in loT - Insufficient Authentication/Authorization - lnsecure Access control -
Threats to Access Control, Privacy, and Availability - Aftacks Specific to toT. Vulnerabilities
- Secrecy and Secret-Key Capacity- Authentication/Authorization for Smart Devices -
Transport Encryption - Attack Fault trees.

Module lll: l4lecture ho[rs

Cryptographic primitives and its role in loT, Encryption and Decryption, Hashes, Digital
Signatures, Random number generation, Cipher suites, key management fundamentals
cryptographic controls built into IoT messaging and communication protocols, IoT Node
Authenlication, ldentity lifecycle, authentication credentials, IoT IAM infrastructure,
Aulhorization with Publish / Subscribe schemes, access control. concems in data dissemination,
Lightweight and robust schemes for Privacy protection, Trust and Trust models for IoT, self-

FI i-' a
ll crstl!', Ci'e ater Ncida
[-lrt ii
(r r/,:t;: ll" .i r, tjii..r:riarjp5h)
i', !, 'i0, 'l i , lccir Zorle-ll
Gr.-.i: l :r,' t:ci -l: lrl l :i'i 0
 organizing Things, Preventing unauthorized access, Cloud security for loT, Cloud services and
IoT, offerings related to IoT from cloud service providers, Cloud IoT security controls.

Text Boola :
1. Saravanan Vijayalakshmi, Securing IoT and Big Data: Next Generation Intelligence
(Internet of Everything (IoE) (lst ed.), CRC Press,2020. ISBN 0367432889.

Reference Books :

1. Bhattacharjee 5,, Practical Industrial Internet of Things Security (lst ed.), packt
Publications, 2018. ISBN 978-17888 2687.

Assessment Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

)

E:W: r,,' rY, sl".?li,t,T,?,?.xr

r;;1i1*i1,i rt ir,rrcrr zone-tr
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET362 Vulnerability Analysis in Network I, T P C
Protocols
Owning School/D€partment Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposu re

Course Outcomcs (COs)

On completion of this course. the sludents will be able lo:

COI: To understand the vulnerabilities ofnetwork protocols.

C02: To examine penetration testing on each network protocol for vulnerability detection
CO3: To make use of tools for detectirrg vulnerabilities in OSI layers.

CO-PO/PSO Manpins
)
POI P.J2 POI PO4 P()5 PO6 PO7 PO8 PO9 POl0 POll POt2 PSOI PSO2 PSO3
cot 3 3 2 2 3 2 2
c02 2 3 2 2 2 2 2 3 2
,,
cC)3 2 2 2 2 3 3 3

l:weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: 6lecture hours

OSI model and TCPflP suite, Layer wise security issues, Network Access Layer
Vulnerabilities, Wiretaps, Reconnaissance, Hardware Breakage, Voltage Fluctuations, natural
Disaster, Misconfigurations and Malfunctioning ofNetwork Interface Cards. Signal Disruption
Attacks.

Modulo Il: S lecture hours

Absence of VLANs, Network Layer Protocol Vulnerabilities, [Pv4 Packet Structure and
) Vulnerabilities, lPv4 Header Based Modification Aftack, IPv4 flooding Attack. Man in the
Middle Attack by Manipulating IPv4, IPv6 Security Issues IPSec and its Key Management,
ICMP Packet Structure and Working, ICMP Header based Modificatiorr Attack, Ping of Death,
Countermeasures for Each Attack in Network Layer Protocol, Attacks on Routers and Routing,
RIP. OSPF, BGP, Countermeasures of Attacks.

Module lll: T lecture hours

Transport Layer Protocol Vu lnerabilities, TCP Packet Structure and its Working, TCP Header
Based Modification Attacks, TCP Incomplete Connection Attack, TCP SYN Flooding Attack,
TCP Reset Attack, TCP Session Hijacking Attack, Reverse Shell Attack, Detection and
Countermeasures ol Each type of TCP Attack, UDP Packet Structure and its Working, UDP
Header Based Modification Attack, UDP Generic Flooding Attack, Detection and
Countermeasures of Each type of UDP Attack.

11,_1I .l
i,r:..: -r
, 'l',,,,i i li,i: \)
['ii: I i'. r -;ii Zori...-li
Cii;.,.ir , i
Module IV: 7 lecture hours
Application Layer Protocol Attacks, DHCP Packet Structure and working, classic DHCP
Starvation Attack, Induced DHCP Starvation Attack, DHCP Spoofing Attacks, DHCP
Flooding Attacks, countermeasures for each attack on DHCP, DNS Packet Structure and
working, DNS Cache Poisoning for Phishing, Domain Hijacking DNS Flooding, Reflection
and Amplification Attack, Random Subdomain Attack, NXDomain and Phantom Domain
Attack, Countermeasures for each attack on DNS, HTTP Packet Structure and its Working,
Method based Flooding Attacks, HTTP Half connection Attack, HTTP fuzzers and
misbehaved fields, Cache bypassing attacks, countermeasures for each attack on HTTP.
wireless Access Point Firmware vulnerabilities, SSID Beaconing and checking for Hidden
and Fake Wireless Networks, Brute Force Attack, Evil twin Attack, WiMax vulnerability,
Vulnerability of zigbee protocols.

Text Books :
l. Sanders C. , Practical Packet Analysis (3 'd ed.), No Starch Press, 2017. ISBN
97 8t s93278020.

Reference Books :
l. Gebali F., Nem,ork Vtlnerability Assessment: Identify security loopholes in your network's
i nfr as tr uc t ure (lsr ed.), Springer, 20 1 8. ISBN 97 8- 1 7 88627 252'

Assess ment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (o/o) 45 z0 35 100

r0
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET363 Penetration Testing, Auditing and Ethical L T P C
Hackin
Owning School/DePartment Department of Computer Science 2 0 2 J

f,ngineering
Pre-req uisites/Exposu re

Coune Outco mes (COs)

On completion ofthis course, the students will be able to:

COl: To identi! and analyze the stages an ethical hacker requires to compromise a target
system.
CO2: To utilize tools and techniques to carry out a penetration testing'
co3: To critically evaluate security techniques used to protect system and user data.

CO-PO/PSO Manoins

PO5 PO6 PO7 PO8 PO9 POr0 POI I PO t2 PSO I PSO2 PSO3
POI PCJ2 PO3 PO4 .,
col 3 1 1 a 2 2 3 2
., a
co2 a 3 3 2 ) 2 3
co3 2 , 3 , 3 2 2 3 3

l=weakly related 2: moderately related 3:strongly related

Course Cont ts:

Modute l: 8lecture hours

Penetration Testing Concepts, Plan a Pen Test Engagement, Rules
engagement' of
Communication escalation path, Resources and requirements, Budget, lmpact analysis and
remediation timelines. Disclaimers, Technical constraints, Support resources, Key legal
concepts, contracts, Environmental differences, written authorization, Scope and Negotiate a
Pen Test Engagement, Prepare for a Pen Test Engagement, Conducting Passive
Reconnaissance, Information gathering, Perform Social Engineering Tests, Perform Physical
Security Tests on Facilities.

Modulo ll: 13 lecture hours

Active Reconnaissance, Scan Networks, Enumerate Targets, Analyzing Vulnerabilities,
Exploiting cross-Site Scripting, Cross-Site Request Forgery, Web Application Exploitation,
File upload vulnerability , HTTPS Requests: Get & Post, Using Burp as a Proxy Server, Code
Execution vulnerabilities, countermeasures, Penetrating Networks, Exploit Network-Based
vulnerabilities, Exploit wireless and RF-Based Vulnerabilities, Evil twin, Karma attack,
Downgrade attack, De-authentication attacks, Fragmentation attacks, Credential harvesting,
WPS implementation weakness, Bluejacking, Bluesnarfing, RFID cloning, Jamming,
Repeating, Local File lnclusion vulnerabilities, Getting Shell from LFI vulnerability, oSINT
Tools, Maltego, Shodan, Google Dorks, The Harvester, Metagoofil, ye

R
ll t-.1 l-lnir':rcil'r, Greatef Ncida
L i,. ', i ., l ( f r:iirvl. of Utter prlri::i)
Plct i{u l, {-', I '10, 11 , -Icclr Zc_rne-
Grcatei t,lciCa-201310
 Module IIt: T lecture hours

Analyze Pen Test Data, Repofting Pen Test Results, Write and Handle Repofts, Normalization
of data, Written report of findings and remediation, Risk appetite, Storage time for report,
Secure handling and disposition of reports, Conduct Post-Report-Delivery Activity, Post-
engagement cleanup, Removing shells, Removing tester-created oredentials' Removing tools,
Client acceptance, Lessons leamed, Follow-up actions/retest, Attestation offindings, Develop
Recommendations for Mitigation Strategies, Solutions, Findings, Remediations'

Text ks:
I Harper Allen, Gray Hat Hacking: The Ethical Hacket's Handbook (6th ed'), Mo6raw'Hill
Osbome Media, 2022. ISBN 1264268947

Reference Books :
1. Wallace Conno\ Penetration Testing: Penelration Testing: A Hands-On Guide For Beginners
(lst ed.), Independently Published, 2020- ISBN 979-8614981143.

) Assesment Scheme

Components Internal Asses!mcnt Mid Term Eram End Exam Total

Weightage (%) 45 z0 35 100

i"iegi
Bert LL i'r,-:r-,ity, Q rcnier l{DldB
$ !i 0f Ulic r P{n,jcsll)
,.i-'.1.'rl,.lr-r. oi
10, 11,
'le clr Zonel-ll
P
Grcai,) j- i\jui'-l:'
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET364 Forensics and C ber Law L T P C

Owning School/Department Department of Computer Science 2 0 2 J

Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COl: To understand the Volatile Data Collection from Windows system'

CO2: To understand cyber activities which are considered as crime in India'
CO3: To apply forensic analysis in Computer lnvestigations'

CO-PO/PSO MaDDins

POt PO2 P()3 PO4 PO5 P()6 PO7 PO8 PO9 PO t0 POI I PO l2 PSOt PSO2 PSO3
) col ., .,
2 3 , .,
3 2 2
t ., 3 2 ,
c02 2 3 2
,, , 1
c03 1 ) 3 2 2 2

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: 8lecture hours

Cyberspace and Criminal Behaviour, Traditional Problems Associated with Computer Crime'
TheEmergenceofe.Cash:ANewProblemforLawEnforcement.Hacking'Intellectual
property, web- Based criminal Activity, Theft of Information, Data Manipulation, web
Encroachment. Cyberterrorism' Dissemination of Contraband or Offensive Materials'
Threatening and Harassing Communications, Money Laundering, Online Fraud' ldentity
Theff:/Fraud, victirnology, virtual or Internet-Facilitated Methods, Data Piracy and
counterfeit Goods, volatile Data collection from windows system, Volatile Data collection
) from Unix system.

Modulo ll: T lecture hours

Act of
Computer Fraud and Abuse Act of 1986, national lnformation Infrastructure Protection
1996(NI|PA),EvotvingChildPomographyStatutes,ldentityTheftandFinancialPrivacy
Statutes, Law Enforcement Operations and Tools in the United States, Computer-Related
Crime ofthe Council ofEurope, Council of Europe's (CoE) Cybercrime conventions. Law
to

child Pomography starutes, Unlawful Intemet Gambling Enforcement Act of 2006. Electronic
communications Privacy Act of 1986, Privacy Protection Act. Electronic Surveillance and
criminal lnvestigations, communications Assistance for Law Enforcement Act. other
Questions Regarding Privacy: Peer-to-Peer or File sharing,
Intemet Service Provider
Subscriber Records, Web sites, Cell phones.

lectur€ hours
Module ll l:
W,
 Duplicates as
Traditional Problems in Computer Investigations, Forensic Duplication, Forensic
Admissible Evidence, Forensic Duplication Tool Requirements, Creating a Forensic
DupIicate/QualifiedForensicDuplicateofaHardDrive,Phaseafterdetectionofanincident,Disk
Data Integrity'
Structure and Data Storage, File Systems, Firmware Operating Instructions'
Associated with
Developing computer Forensic Science capabilities, Traditional Problems
Finding Digital Evidence, Pre-search Activities, on-scene Activities: Knock, Notice,
and
Scene
Document, Securing the crime Scene, Determining the Need for Additional Assistance'
Processing, Locating Evidence, Seizure and Documentation of Evidence' Bagging
and
and
Tagging,lnterviewing Witnesses, Collecting Network Based Evidence, Scene Departure
Transportation of Evidence to Lab, Forensic Anatysis of File Systems, Hard Drives
Evidence

Handling, Challenges in evidence handling.

Iy: 6 lecture hours

Module
tnvestigating Live Systems (Windows &
Email Tracing Intemet Fraud, Data Analysis Techniques,
UNIX), Email Tracing tntemet Fraud, Data Analysis Techniques, lnvestigating Live Systems

(windows&UNlx),IssuesrelatedtoDataPrivacy,CriminalLiability,ElectronicContracts&Digital
Signatures, Misappropriation of information, Civil Rights, Evidence' Legal
Developments' Security in
cyber laws case, Trademarks, Reverse Hijacking, Jurisdiction in Trademark Disputes'
Copyright in the
(30)' Cryptography Laws'
Oigi,ut M.dir*, Copyright and WIPO Treaties, Concept of Patent Right
Ethical Issues - Cybercrime6.

Text ks:
th
I Britz Marjie T, Computer Forensics and Cyber Crime: An Introduction (4 ed.), Pearson
Education lndia, 2022. ISBN 978-01 34847528'
techniques
2. Johansen Gerard, Digital Forensics arul Incident Response: Incident response
and procedures to respond to motlern cyber threats (2nd ed'), Packt Publishing
Limited'
2020. lsBN 978- 1838649005.

Reference Books :
1. Reddy Niranjan, Practical Cyber Forensics (lst ed.), Apress, 2019' ISBN 978-
1484244605.

) Assessme nt Scheme:

Internal Assessm€nt Mid Term Exam End Exam Total

Components

45 20 35 100
Weightsge (9/o)

it
i ,.r: .-f.ti1l,, (l,in:.tr:i l'loirja
-i -: l r l. r .i \.. l.lrrj Pr.'llifr)
r; ir, -, ,'--r, l'l ,l-ech Zcl)e-ll
i'ii.i!:ar'::i.1310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET365 Web Security L T P C

Owning School/DePartment Department of Computer Science 2 0 z J

Engineering
Pre-requisites/Exposure

Cou Outcomes (COs)

On completion ofthis course, the students will be able to:

COl: To skills to carry out independent analysis ofmodem malware samples'

possess the
CO2: To understand and analyse the Mobile application threat landscape'
CO3: To apply techniques to unpack, extract, decrypt, or bypass in future malware samples

CO-PO/PSO MaDDinc

PO6 PO8 P()9 PO l0 PO POt 2 PSOI PSO2 PSO3

POr I'o2 PO3 PO4 PO5 PO7
1
., 2 3 2
col 2 I 2
3 1 2
a 2
co2 2 3 2
,
c03 , I 1 2 2 2

l:weakly related 2= moderately related 3:strongly related

Couns€ Co nt nts:

Module I: 5 lecture hours

Web HI'ML, CSS, JS, URLs, DOM, Frames, HTTP, navigation, X-Domain
Basics:
communication, web security, Security elements, Implementation of safety assessment,
understanding the dangers of an insecure communication channel, Network Attacks
& HTTPS,
for
HTTPS deployment, HTTPS impact on your application, lnsights into the latesl evolutions
HTTPSdeploymenls,LimitationsofHTTPS,CookieFlawsandSewerMisconfiguration'
T lecture hours
Modulo :
) i".r.lt, .f g-*ser same origin policy, sandbox browser, malicious URL intercept' Rapid
developmentofbrowsersecurity,cross-sitescriptingattack,AdvancedXSSattack'XSS
defence, Cross-Site Request Forgery, Advanced CSRF defence, Clickjacking'
HTML5
Securities, other security problems.

Module lll: 8lecture hours

Injection Attacks, SQL injection attacks, Database attacking techniques properly defending
againstSQLinjectionandotherinjection,FileUploadVulnerability,designingsecurefile
Access
upload features, Authentication and session management, Attacks on User lnterfaces,
control, Encryption algorithms and random numbers, Web framework security, Application-
layer Denial-of-service Attacks, PHP security, TCP Reset Attack'

Module IV: 8 lecture hours

 Security of lntemet Business, Business logic security, How the account is stolen' Intemet
garbage phishing, User privacy protection ,Security development lifecycle' Security
Ip".ulion., Process of vulnerability patch, security monitoring, Practical ways to
secure the

authentication process, prevent authorization bypasses and harden session

management
incidents Risk
mechanisms (10) security ptanning, business continuity planning, Handling
technologies'
Analysis, Dealing with disaster: privacy on the web, Privacy impacts ofemerging
impacts
Haniling incidenls, Risk Analysis, Dealing with disaster: privacy on the web' Privacy
of emerging technologies, Browser Design & Flaws'

Text ks:
1. Hoffinan Lndrew, t4leb Application Security: Exploitation and Countermeasures for
Modern Web Applications (lst ed.),O'Reilly Media, 2020' ISBN 978-14920531
l8'

Reference Books :
2020' ISBN
1. McDonald Malcolm, Web Security for Developers (lst ed'), No Starch Press'
9781s93279957.
)
ent Sc me:

Internal Assessment Mid Term Exam End Exam Totrl

Components

20 35 100
Weighttge (%) 45

r
B ett Unlversity, Greater Noida
bii :h.ri UnC.rAct 24 of UoU, of U ttar Pradesh)
lot No's B, 9, 10, 11 , Tec h Zone-il
G reater N0ida-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET366 S lTo in Infomation SecuritY L T P C

Owning School/Department Department of Computer Science 2 0 2

Engineering
Pre-requisiles/Exposure

Course O mes COs

On completion ofthis course, the students will be able to:

COl: To familiarize and leam about the latest trends and research in the field'
CO2: To equip themselves with the conceptual and practical experience offew latest methods.
tools,technologies or algorithms in lnformation Security (lS).

co-Po/Ps O MaDDins
) POI PO2 PO3 PO4 PO5 PO6 PC)7 PO8 PC)9 POl0 POI I POl2 PSOI PSO2 PSO3

col 3 2 3 2 3 3
co2 2 I 3 I 3 3

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: 2E lecture hours

This course covers the cutting-edge topics in lnformation Security and these modules will be
chosen by the instructor based on the requirements and relevance at that point of time. These
modules need to be relevant to the Industry and start-ups' will also include related case studies,
use cases and implementations scenarios. Students will be working on lab work and projects
to get real hands-on experience ofthese topics and modules.

Text Books :
l. Pfleeger CharlesP., Security in Computing, Fourth Edition, Pearson Education
) 2. Stallings William, Network Security Essentials: Applications and Standard. Prentice Hall
Referen Books :
1 Stallings william , Cryptography And Network security Principles And Prqctice,Fourth or
Fifth Edition, Pearson
2. Mao Wenbo, Modern Cryptography: Theory and Praclice, Prentice Hall
Assessment Scheme:

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (o/o) 45 20 35 100

R s tlar
E-' en nett Llniversity, Greater Noida
(E 3lal-ll-,ll:'l LlrJnrAci 2rt of r,;ovt,
(,f utl"r Pradesh)
P l:rt ir!o's 0, 9, 10, fi,T'echZone-ll
Greeter i-loicia-201 31 0
 Special rza tron
O a

Electives:
Data Science
)

ry/,
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET367 Digital Marketing and Trend Analysis L T P C
Owning School/Department Department of Computer Science 2 0 2 )
Engineering
Pre-requisites/Exposure

Course Outcomes (COs)

On completion of this course, the students will be able to:

COl: To articulate online applications based on recent digital marketing trends.

CO2: To examine digital marketing and its applications.
CO3: To make use of state-of-the-art tools for digital marketing and trend analysis

CO-PO/PSO Mapninq

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 POl t PO r2 PSO I PSO2 PSO3
col 3 I 3 I 3
c02 , t 3 I 3 2 I
co3 2 I 3 1 2 2 2 I ,
l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module I: S lecture hours

Digital Marketing, CRM, Affiliate Marketing, P-O-E-M Framework, Online vs offline retail,
Customer profile analysis, Factors influencing consumer behavior, Traffic source analysis,
Multi- channel analysis, On-site merchandising analysis, Digital Advertising Market, Growh
of e- commerce, Social media monitoring vs listening, Competitor and Website Analysis,
Structure of online conversations, Methods of gathering data, Unlocking actionable insights
from e-commerce, Adwords, Link Tagging, Exit rate and bound rate, Online advertising
optimization, Measuring Performance and Quality Control, Crisis management.

Modulo ll: 6lecture hours

Online content, Content Creation, Types of
Content, Content optimization, Content
Management & Distribution, Recommendation system for e-commerce, User-User and User
Itern, Study ofpopular recommendation platforms, Market basket analysis, Predicting product
adoption.

Module III: T lecture hours

Conversation modeling, Campaign optimization, Clickstream Analytics, Traffic Analytics,
Customer segmentation, Search Engine Optimization techniques, Expertise Authority and
Trustworthiness, Featured Snippets, Site architecture optimization, Long-Tail Keyword
Phrases, Keyword Planner, Google rankings, Link Building, Steps to optimize the website.

Module IV: 7 lecture hours

:.l r i:: rir r:1,-. r IlatCi)

f: ir :i i,cl'r 7,rrr:r:-li
C: :t .l i3 iil
 Mobile Advertising, Mobile Marketing tool Kit, Mobile Marketing Features, Brand Health
Management, Sunogate advertising, Fake news propagation models, Fake news identification,
Social Media Monitoring, Digital data heasure, Digital rights.

Text Books :
1. Gary P Schneider, Electronic commerce (l3th ed.), Cengage Leaming, Inc,2019. ISBN
9781285425436.
2, Kingsnorth Simon , Digital Marketing Strategt: An Integrated Approach to Onltne
Marketing 74fi ed.), Pearson,2019. ISBN 0749484225.

Reference Books :
1. Clarke Adam, SEO 2020 (2ad ed.), Amazon Digital Services LLC - KDP Print,2Ol9. ISBN
9781712354889.

Ass$sment Scheme:

) Components lnternrl Assessment Mid Term Eram End Exam Tot l

Wetghtage (%) 45 20 35 t00

il/
# l.'--',i l, n,uu n,,,',, Grcater
lE:ri.l,i.:11 . :'.r/,. . _.!t
No!da.
. . I ,'t llrli:i [-iair5h)
i,lot tl"'.- ij' tr, lJ.'. i'i, reitr zorre-tl
Gic:r'cr l':.'i''1'r-'1'/ 310 I
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET368 Structu ral Equation Modelling t. T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COl: To explain the statistical and numerical models used in SEM Framework.
CO2: To build factor analysis to find multiple hidden variables.
CO3: To implement of parameter estimation and regression analysis ofpractical frameworks.

CO-PO/PSO Maooine

POI PO2 POI PO4 PO5 PO6 PO7 PO8 PO9 POt 0 POI I POl2 PSOI PSO2 PSO]
cor I , 2 2 3 I I
c02 3 I 3 I , ,,
3 3
co3 3 I 3 I 2 I I 3 )

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: S lecture hours

Structural Equation Modelling, Representation of Structural Equation Models using Path
Diagrams, Multiple Regression, Estimation Parameters, Least Squares estimation, Latent
Variable Estimation. Estimation with Non-normal Distributions, Computing Power,
Equivalent Models, Causal Foundations ofSEM, Representing lnterventions, Causaleffects,
Model Specification, Identification and Estimation, Power Analysis, Categorical Data in
SEM Framework.

Modulo ll: 6lecture hours

Model Fitting, Model Selection, Path Modelling, Covariance Structure Analysis, Parameter
Estimation, Maximum Likelihood, EM Algorithm, Bootstrapping Standard Errors, Bayesian
bootstrap, Smooth bootstrap.

Module lll: S lecture hours

Factor Analysis, Factor quantification and selection, Exploratory factor analysis, Factor
selection and rotation, Velicer's Minimum Average Partial test, Convergence of Tests,
Confirmatory Factor Analysis, Investigating Measurement Invariance, Indirect Effects in
SEM, Bootstrapping Methods, Monte Carlo Method, Likelihood Ratio Test, Single-Croup
and Multi-Group Approaches.

Module IV: 6 lecture hours

 Latent Interaction Modelling, Quasi-maximum-likelihood (QML), Multilevel Modelling of
Networks, Linear and non-linear Multilevel Networks, Growth Mixture Modelling, Multiple-
group Growth Curve Modelling, Latent Curve Modelling of Longitudinal Growth Data'
Adding Covariates and Multiple Causes Model, Estimating Group Effects, Moderation,
Mediarion Effect, lndirect effect.

Text Books :
1. Thakkar Jitesh J., S*uctural Equation Modelling: Application for Research and Practice
(lst ed.), Springer, 2020. ISBN 978-981 1537929.

Reference Books :

I Civelek Mustafa Emre, Essentials of Structural equatton modelling ('lst ed.), Zea Books,
2019. tsBN 978-l -60962-129-2.

Assessment Scheme:

) Compooetrts Internal A$essmetrt Mid Term Exam End Exam Total

rrYeightage (Ye) 45 20 35 100

st
B n llniversity, Greater Noida
(E aJ Uid.ry'.r1 :.1 of Govl, ai Uli;ir lrrades h)
P No's 8, 9, 10, i1, Tech Zon e-li
G reater Noida-20131 O
 Name ofProgram Bachetor of Technology (Computer Science and
Engineering)
CSET369 Time Series Analysis L T P C
Owning School/Department Department of Computer Science 2 0 2 t
Engineering
Pre-requisites/f, xposu re

Course Ou mes (COs)

On completion ofthis course, the students will be able to:

COl: To explain the working of different components of a time series.

CO2: To build autoregressive models for time series forecasting.
CO3: To implement multiple time series methods on real-world datasets

CO-PO/PSO Ma

) POI Po2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 POt I PO l2 PSOI PSO2 PSOS
col 2 I a I 2 3 I I
.,
c02 I I 3 I I I 3 3
co3 3 I 3 2
., I I 3 I

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: S lecture hours

Purpose of Time Series Analysis, Descriptive techniques, Times series plots, Line chart,
visualizing multidimensional Time series, Visualizing multiple time series, Histograms,
Seasonal effects and trend identification, Transformations, Sample autocorrelation,
Correlogram, Time series filtering, Probability models, Stochastic processes, Bernoulli
Process, Weiner process, Brownian Motion, Omstein-Uhlenbeck Process, Stationarity,
Second-order stationarity, Autocorrelation.

Moduto ll: T lecture hours

White noise modet, Random walks, moving average, lnvertibility, ARIMA Models'
Autoregressive processes, Fitting an AR process, Yule-Walker equations, Ceneral linear
Holt-
process, Wold decomposition theorem, Time series Forecasting, Exponential smoothing,
Winters, Box- Jenkins forecasting, Optimality models for exponential smoothing, Model
selection lor time series forecasting.

Module ttl: T lecture hours

Spectral analysis, Sinusoidal model, Wiener-Khintchine theory, Cramer representation,
Periodogram analysis, Statistical properties of periodogram, Consistent estimators of spectral
density, Bivariate processes, Cross-covariance, Cross-correlation, ARCH, GARCH.

Module IV: 6 lecture hours

'.'
 Gaussian Process, Gaussian Regression, Vector autoregression models VAR, Structural Form,
Reduced Form, Parameter Estimation, Kemel Methods for forecasting, Adaptive filtering
mechanism for forecasting, Statistical Testing for stationarity, Augmented Dickey-Fuller,
Kwiatkowski-Philtips-Schmi&-Shin Test, Goodness of estimation.

Text Books :
l. Nielsen Aileen, Practical Time Series Analysis: Prediction with Statistics and Machtne
Learning (l* ed.)^ O'Reilly,20l9. ISBN t49204t653.
2. Mills Terence C., Applied Time Series Analysis: A Practical Guide to Modelling and
Forecasting (l* ed.), Academic Press,20l9. ISBN 978-0-12-8l3ll7-6.

Reference Books :
1. Nielsen Aileen, Practical Time Series Analysis (l* ed.), O'Reilly, 2019. ISBN
9781492041629.

)
Components Internil Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

elt I lrrivcrsity, Greater No icla

hi,l I 'ir.--f Ail 2'i ciGo!4, ol Uttar Pra dcsh)

Plo i t,lo r iJ, C, i0, 11. Tech Zone- il

Greater t\Dida-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET3TO Data Visualization and Dashboards L T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion of this course, the students will be able to:

COl: To explain best practices in data visualization to develop charts, maps, tables, and other
visual representations of data.
CO2: To build an interactive dashboard for a cohesive and seamless visualization.
CO3: To implement different visualization approaches on real-world datasets.

CO-PO/PSO Mappins
)
POr PO2 PO3 PO4 PO5 PO6 Pc)l PO8 PO9 PO l0 l,o l l POl2 PSO I PSO2 PSO3
cot I 2 I 1 1 2 3 I I
c02 3 3 I I , I 3 3
., .,
co3 3 3 I I 3 3

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module I: S lecture hours

Gathering data and Business process modelling, Business reference model, Business process
integration, Workflow modelling, Business process Management, Visualizing Workflow,
Layered graph drawing. Layout Algorithm, Information visualization, Graph Drawing Theory,
Layout Methods, Forced Layout, Spectral Layout, Tree Layout, Exploratory Visualization,
Visual data exploration, Visual thinking.

Modulo II: 7 lecture hours

Visual Analytics, Visualization from Heterogenous data sources, Reasoning and data
representation, Optimal visualization types, Binning, Dashboard development, Design
principles, Interactivity, Connected drill-down dashboards, Drill Down and Drill Up Charts,
Bidirectional Relationship, Working with stakeholders, Stakeholder categories, Creating
analytical products, Receiving feedback, Dashboard retune, Design iterations.

Module lll: 7 lecture hours

Performance management, Balanced scorecard, Showing Rank and Magnitude, Bump Chart,
Measuring Claims across Multiple Dimensions, KPI wheel, Quantitative KPI, Qualitative KPI,
Lagging KPI, Leading KPI, KPI Reporting.

Module IV: 6 lecture hours

t.

l! l:_ l
 rollup dashboard, personalized Dashboards'
Actual versus potential utilization, utilization
Demographics Dashboard, vi"unii'i'g
f'"'ds Across Dmensions' Comparing growth rates'
Assessingthe quarity ordasrruoatii
M"t**ing tut"tts' Dashboard Administration' Designing
Colour-Blind-Friendly Visualizations'

Big Book of Dashboards:

,ro*, ,r"r", Jeftey Shaffer and Andy cotgreave' The(1st
ffiP, ed')' John Wiley & Sons'
Business Scenarias
Visualiztng Your Data Using Real-World
2017. ISBN 978- 1t19282716'

Reference Books :
st
Excel Dashboards and Reporr's ( 1 ed')' ohn Wiley
1. Kusleika Dick Data Visualization with
'
& Sons, 2021' ISBN 1 I 19698723'

Assessment Scheme

Mid Term Exam End Exam Totrl

Components Internol Assessment
)
20 35 100
Wsightage (%) 45

R
Be elt
Pilt l"1o'
)!ni1
I'i'i'
i,1 t?, i*ii#fiiil
Grc3tei i:1::i-.''tutt10
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET371 Big Data Analytics and Business L T P C
Intelligence
Owning School/Department Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposure

Course Outcomes I COs )

On completion of this course, the students will be able to:

COI: To articulate key technologies in data science and business analytics.

CO2: To build Big Data framework: Hadoop (HDFS and MapReduce), Hadoop Ecosystem &
spark.
CO3: To make use ofcutting-edge tools and technologies to analyze Big Data.

) CO-PO/PSO MapDins

POt PrJ2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 PO PO t2 PSOI PSO2 PSO3
,,
col 3 2 3 2 1 2 3 I 1 2 2 3
co2 2 ) 3 2 2 2 2 I 3 3 a

cC)3 3 t I ) 2 I

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: S lecture hours

Big Data Analytics: Data and Relations, Business Intelligence, Business intelligence vs
business analytics, Big Data Predictive Analysis, Why what and how BI?, OLTP VS OLAP,
Project life cycle, Methodology, Impact Analysis, Testing and release management, Ethics in
Business Intelligence, Big Data Technology Component, Real Time Analysis of Big Data, Big
Data Architecture, Cost Conscious Design, Storage Conscious Design.

Modulo II: 6lecture hours

Big Data Warehouse, Functional vs Procedural programming models, Data placement
strategies, CAP Theorem, Streaming, Stream Data Types, Stream Computing, Filtering
Stream, Estimating Moments, NoSQL, Aggregate Data Models, Document Data Model,
Schema Less Databases.

Module lll: 6lecture hours

Hadoop Ecosystem, Hadoop Overview, HDFS, Map-Reduce, Pig Overview, Pig Grunt Shell,
Hive, HBase, Architecture of Hive and HBase.

Module IV: 8 lecture hourt

HQL, Associations and Joins, Aggregate function, Polymorphic queries, Clauses, Subqueries,
Spark, Core, Spark SQL, Spark RDD, Deployment and lntegration, Spark GraphX and Graph
Analytics, Research Topics in Big Data Analytics.

, rt,:rr, CjJi:'1;,r lr,-i;fla

' ,i li r: ;:r,L.ilti
, ', : , i;ril
1 Zoirr:-f i
.....rt3t0
 Text Books :
1. Ghavami Petet, Big Data Analytics Methods (2nd ed.), De Gruyter, 2020. ISBN
9781547417951.
2. Acharya and S eema, Data Analytrcs usr'ng R ( lst ed.), New York: McGraw-Hill Education,
2018. rsBN 9352505241.

Reference Books :
1. Azevedo Ana and Manuel Filipe Santos, Integrdtion Challenges for Analytics, Business
Intelligence, and Data Mining (l* ed.), Engineering Science Reference, 2020. ISBN
9781799857832.

Assessment Scheme:

Componoots Internal Assessment Mid Term Exam End Exrm Totel

Weigbtage (%) 45 20 35 100

)

R tra r
B nett University, Greater Noida
rjlishEi l.!:ir:irA.l 24 ofGovl, oi tl llar Pradesh)
Plot Nlo'$ 3, 9, 10, 1'l , Tec h ZoneJl
Greater' Noida-201310
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET372 Ad va nced D a ta b ase Ma age m e n t Sys te m t. T P C
Owni ng SchooUDepartment Department of Computer Science ')
2 0
Engineering
Pre-req uisites/Exposure

urse utco es C

On completion of this course, the students will be able to:

col: To afticurate the concepts of transaction processing,

concurrency contror techniques,
database recovery techniques.
Co2: To build distributed and object-oriented databases and
learn to appry concurrency contror
and recovery algorithms.
co3: To imprement distributed and object-oriented DBMS
to speed up information
processing and storage.
)
co- Man lns

POI PO2 PO3 P04 PO5 PO6 P07 PO8 PO9 PO t0 PO POt 2
col 3 PSOt PSO2 PSO3
co2 3 3
3 3 3 3 2 3 2 3 3 3
c03 3 3 3 3 3 2 3 3 3 1 3
l=weakly related 2: moderately related 3=strongly related

Cou rse Contents:

Module l:
ER Model, Indexing Dependencies, Transaction processing,
Transaction n,'"""*".";,t!""tn'J;1,;ET.
Databases. Seriar schedurer, Non-seriar Schedurers,
concunency Contror, Time stamp ordering
Protocol' Multi version concurrency contror. varidation
concurrency contror, Recovery Techniques in
Databases, Undoing, Deferred Update, Immediate
Update, euffering and Caching in Databases,
Design Elements' cache SeL Resurtset, cache
serected fierds and varues, Caching seriarized
applications, Shadow paging, Data Backup Architecture,
Transaction logging, paging Architecture in
Databases, Full Backup, Differential Backup.

Modulo ll: 6 lecture hours

Distributed DBMS, Architecture of a DDBMS,
Distributed Design of Relational Database. Variant of
the 2 Tier Model, Fragmentation and Replication,
Update inbOe MS, Update Srrategies, Eager
update, Distributed Reliability, phase commit protocol,
Asynchronous Update, Distributed transaction
management, Distributed concurrency control, Distributed
deadlock m anagement.
Module lll:
7 lecture hours
ObjecrOriented DBMS Architecture, Capturing Semantics,
Message Passing, OODB persistenc€,
Object relational database model, Object relational features,
Objecr tables. Nesred tables. VaDing
arrays, Support for large objects, Database Migration,
M igration Architecture, Heterogeneous

ill,
 migra.tion ve6us homogeneous migration, Migration consistency, Database Transformation,
Differential Querying, Migration Consistency Verification, Order violation, Consistency violation,
Local Transactions.

Module IV: 6 hcture hours

Flex Cluster Architecture, Policy-Based Cluster, Grid Infrastructure, Kemel Requirements, Data
Redaction, Database Auditing, Database Diagnostic Monitor, Global User Authentication, Label
Security, Data Masking, Privilege Analysis, Virtual Private Databases.

Text Books :
l. Connolly Thomas and Carolyn Begg, Database Systens (6fi ed.), pearson, 2019. ISBN
9789353438913.
2. Sadalage Pramod J and Martin Fowler, NoSQI Distilled (l* ed.), pearson, 2012. ISBN
978032t826626.

Reference Books :
) 1. Hoffer prescott and Mcfadden, Mo dern Database Management (8h ed.),prentice HaI|,2008. ISBN
978-8131709481.
2. Bayoss lvan, Sp[ and Pt |SQL (46 ed.), BPB Publications,20l0. ISBN 928-8176569644.

Ascessmetrt Scheme

Componertts Internd A$€ssment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

ar
B l-lniversity, Grealer Noida
-.1.t
l:iliii I Li;rJli1,.124 a,J GJvt, of Uri.x lriiidesl l)
PIot N,r's tl, $, 1 0, 11 , lbch .Zone- I
G; r;,.r1.r I iri'rr:r-:. ;1 3 r :)
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSETJTJ Satellite Data A nalysis L T P C
Owni ng SchooYDepartment Department of Computer Science 2 0 2 3
f,ngineering
Pre req uts I tes/E x pos u re

Course O u tcomes ( COs)

On completion ofthis course, the students will be able to:

COI: Analyse the Fundamentar mechanism ofl GIS

and process spatiar and attribute data
towards preparation of thematic maps.
CO2: Understand and Interpret the various lalrd
features over satellite images.
CO3: Generate a,d pubrish the spatiar maps
derived frorn sate,ite data to be used for societal
applications.

)
CO-PO/PSO Maonins

PO PO2 PO 3 PO4 PO5 PO6 PO7 PO8 PO9 PO IO POlt POt2

cor 3 3 I I PSOI PSO2 PSO3
co2 3 2 , I
2 3 2
c03 I 2 3
3 3 3 2
2 2 3
l=weakly related 2= moderately related 3=strongly related

Cou rse Con nts:

Module 1:
G^lS Definition, GIS applications, Geospatial dara for
GIS apptications, o,*,"1
of geospatial data. Concepts of mapping, paper based fi.[:""ni[,
projection, lirnitations. Cartography _
rup.'i. Aig,ul maps, map scale, map
History and o"r"foin,"rtr, advantages of digital maps.
Electromagnetic spectrum, pre-processing
of sut"rit" rrug"r- c"o."r.rencing and Image
enhancement' Ground Contror points- coriction
) rtect.omffit spectrum, pre-processing of
Satellite Images-Georeferencing and Image enrrancernert,
c-r-no cort.or points co[ection.
Modulo ll:
Key Elements of Satellite Image Interpretation-
Colour, Texture, size, *"r" ]H:['H;:O
GlS-raster representation of data grid size
and ."r;i;;i.n, raster ",tdata structures,
advantages/disadvantages of raster data moders,
data aup*r", ,u*". to vector conversion
vECTOR BASED GIS' Vector representation ofdata,
aaurntrg"rzarruauantages ofvector data
models, data bases Spatial and Non-spatial
data, Data Ciit""tion, Data Formats. Dara
Conversion.

Module lIl:
hours 6 lecture
Spatial Database Management Database Structures, Files; Standard Data Fo
Information Systems, Modelling Rea I World Features rmats.
Data Spatial Analysis and Modelling _
Proximity Analysis. Overlay Anal ysis, Buffer
A nalysis Network Analysis-findi ng shortest path
and Overview ol methods of multicriteria
analysis for educatiorr health a lcatrons.
 Module IV:
Inregration of Elevation data- DTM/DEM
wirh satellite images Generating,
features from satelite images or* ,;;;T;"js
alit#filt;
S:*:J::: for publishing spatial maps-

Text Books :
l' Chang'K'T" Introduction to geographic information sysrezs (g
ed.), McGraw-Hilr Higher
Education, 201 9. ISBN 978-12601 36371.
2. Lillesand, T., Kiefer, *. *.,.T0-91]ry an; J., Remote
sensing and image interpletation (l
ed.), John Wiley & Sons,20t4. ISBN
978-l I18343289.
Refercnce Books :
1. Bemhardsen, T,, Geographic information
systens: an inrroduction(3 ed.), Wiley,
rsBN 978_ 8126511389. 2010.
2. Chris Brunsdon and Lex Comber, An Introduction
to Rfor Sryial Anatysis and Mapping
(spatial Anarvrics and GIS)
Q ed.), SAGE pubrication. i,a, Io r s. I'BN 978-1526428509.
)
Assessment Scheme:

Components In ternal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

r
E nett Univers ity, Greater Nloida
: olG,)!'1, flI Utiar prrdes h)
iirll!r-l.-.il L'Idor /l,rt 1
Pl( t r,11,': '1, g, i tl, I1,-Ti,:clrZone -[
I
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET374 s To cs in Data Science L T P C
Owning SchooVDepartment Department of Computer Science 2 0 2 J
Engineering
Pre-requisites/Exposu re

Course Outco mes ( COs)

On completion ofthis course, the students will be able to:

col: To familiarize and rearn about the latest trends and research in
the fierd.
Co2: To equip themserves with the conceptual and practicar experience
offew ratest methods,
tools, technologies or algorithms in Data Science.

CO-PO/PSO Maoninq

) POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 POt l2
cot I , I a I
I PO PSOt PSO2 PSO3
2 2 I
c02 a 2 1 2 3 3 2 3

l=weakly related 2: moderately related 3:strongly related

Co Con ts:

Module l: 28 lecture hours

This course covers the cutting-edge topics in Data Science. and
these modules will be chosen
by the inslructor based on the requirements and relevance
at that point of time. These modules
need to be relevant to the industry and start_ups will also include
related case studies, use cases
and implementations scenarios. Students will be working on lab
work and projects to get real
hands-on experience ofthese topics and modules.

As ment Sc heme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

ar
Be ty, Greatci. Noicla
.i1.
o; a': ai Uli;ti fi.:lesh
t r, r,-(jlt,._,lllc_
r'i r.,1li1a)
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET375 VR Gami ng L T P C
Owning School/Department Department of Computer Science 2 0 2
Engineering
Pre-req uisites/Exposure

Course Ou tcomes (COs)

On completion of this course, the students will be able to:

COI: To articulate the concepts, requirements and processes of VR game development.

co2: To implement the audio-video developrnent and production process
games.
associated with vR

CO-PO/PSO Mappins

POt PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO t0 PO PO t2 PSOI
cot 3 3 I 2 I I
PSO2 PSO3
2 I 3
c02 2 I 3 2 2
2 2 3 3
l=weakly related 2= moderately related 3:strongly related

Cou rse Cont ents:

Module l:
Industrial applicability of VR, Five Classic Components
of a VR
Controllers, Position and Motion Trackers, Inside Out/Outside,
ar""r,':i[:[lT;;
Tracker performance
Parameters, Optical - Active and passive Trackers, Inertial
and Hybrid Trackers - HMD
Trackers, Magnetic Trackers' Mechanicar rrackers, Urtrasonic
Trackers, navigation and
Manipulation Interfaces, Tracker-Based navigation, Manipulation
Interfaces. Three_
Dimensional Probes and contro[ers, Data Groves and
Gesture Interfaces, Human behind the
lenses, Human Perception and Cognition, Human Visual
System, Human Auditory System,
) Human vestibular system, camera tracking and 3D Renderi,g
for Immersive Enrironm"nts,
Inside-Out Camera tracking, Depth Sensing, Full_Body lracking,
Inverse & Forward
Kinematics, Full body inertial tracking , Holographic Video.

Modulo Il:
Rendering Architecture, Graphics Accelerators, 3D Rendering,
Distributed
Multi- piperine Synchronization. Co-rocated Rendering pipetines, Distributed
#il:ilil;r:l.".,
virtuar
Environments, Modering thephysicar world, Geometric Modeling, virtual Architecture,
Virtual object shape. virtuar object Appearance, procedurar .r.extures,
Advanced Materiar
Properties, Procedural Objects, photogrammetry, Kinematics
Modeling, Homogeneous
Transformation Matrices, object position, Transformation
Invariants, object Hieirchies,
Scale, Perspective and perception, physical Modeling,
Collision Deiection, Surface
Deformation, Force computation, Force Smoothing and
Mapping, Haptic Texturing.

, Greater f.loida
,r:\i, of ilLiir Jrli Lj(
Piol i I 1, Tc!-tr :{o ne-Il
sh.i
.- :
t',', ,
,i1310
 Module III: 9lecture hours
Presence, Agency and Interactivity, Augmenting the sense of Presence, Space and
Architecture, Dissolving the Medium, ldentity in Immersive Environments, Change of
Id€ntiry, Transforming the senses, Extending the senses, Agency and Interactivity,
Cybemetics, Interactivity within Physical Dimensions, Interactivity beyond Physical
restrictions: the Super Hero effect, Sound in Immersive Environments, Evolution of Sound
Systems, From mono to stereo to surround, Object Based Sound, Ambisonics, Sound Design
Basics, Sound as Information, Earcons, Impact of Sound in Objects and Actions, natural vs
Real Sound, Physical Computing, loT and sensor networks, Rapid Prototyping.

Text Books :
1. Glover Jesse and Jonathan Linowes, Complete Virtual Reality and Augmented Reality
Development with Unity: Leverage the power of Unity and become a pro at creating mbrcd
reality applicatioras (lst ed.), Packt Publishing Limited,20l9. ISBN 1838648186.

Reference Books :
l. Jerald Jason, The VR Book: Human-Centered Design for Virtual Reality Jason Jerald (lst
ed.), NextGen Interactions 2016, ACM Books. 2016. ISBN 978-1970001129.

Assessment Scheme:

Compohents lnternal Assessment Mid Term Exam End Exrm Total

Weightage (%) 45 20 35 t00

? r
Clr,:::rter Noida
, ..i .:Lllrl lrr.r,l:th)
"i': , iiclr Zorle -ll
C ''."1()
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET376 3D Models fo r Augmented and Vi rtual l. T P C
Reali
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
P re- req u s ites/E x p os u re

Course O utco es (C Os)

On completion of this course, the students

will be able to:

col: To estabrish and curtivate a broad and comprehensive urrderstanding

wolving and commercially viable field of Computer of this rapidry
Science.
CO:................: prepare for participating in the production
To of highly integrative immersive
applications, immersive social platforms, cross_disciplinary
research projects, and
leading developments in 3D user interfaces. """d"ri"
CO3: To create avatars: the virtuar representation
of other prayers, and agents: computer-
controlled NPC characters.

CO-PO/PSO Manning

PO I P02 PO3 PO4 POs PO6 PO7 PO8 PO9 l0

col 3 3 3
PO PO POl2 PSOI PSO2 PSO3
cCJ2 3 3 3
3 2
co3 3 3 I 3 2 3
3 2
3 2 3
l=weakly related 2= moderately relared 3:strongly related

Co urse onte ts:

Module l:
Virtual reality and environment, The historical
development o, ,*
computer ;;p;i.r, Ftight "no'i"il"!""i:H;.
landmarks in Computer Graphics, Real{ime
) simulation. Virrual
' rrirrqrq'lrvrrr v Irruilr
environments, Requirements for VR and AR,
benefits of ilnr"r *"iryI
Modulo ll:
S,FTWARE TECHNOLOGIES: Database ni,i;,o
Environment, Objects - Geometry, position
- wortd Space, wortd a"Ji"i,l"rr."l
/ Orientation, Hierarchy, Bounding Volume,
Scripts and other attributes, vR and AR Environment
Data, LODs, Cullers and Occluders, Lights - vR and AR Database, Tesserated
and Cu*"ru., Scripts, Interaction _ Simple,
Feedback' Graphical User Interface, contror paner,2D
contrors, Hardware Contrors, Room /
Stage / Area Descriptions, worrd Authoring
and prayback, v*,."rriu, Avairabre software
the market. in

Module Ill:
T lectu re hours
3D INTERAC TION TECHNIeUES: 3D Manipulation
tasks, Man lation Techniques and
Input Devices. lnteraction Techniques for 3D
Manipulation, Desi lines - 3D Travel

L',-r, I
 Tasks, Travel Techniques, Design Guidelines - Theoretical Foundations of Wayfinding, User
Centered Wayfinding Support, Environment Centered Wayfinding Support, Evaluating
Wayfinding Aids, Design Guidelines - System Control, Classification, Graphical Menus, Voice
Commands, Gestrual Commands, Tools, Mutimodal System Control Techniques, Design
Guidelines, Case Study: Mixing System Control Methods, Symbolic Input Tasks, symbolic
lnput Techniques, Design Guidelines, Beyond Text and Number entry.

Module IV: 7 lecture hours

ADVANCES IN 3D USER INTERFACES: 3D User Interfaces for the Real World, AR
Interfaces as 3D Data Browsers,3D Augmented Reality Interfaces, Augmented Surfaces and
Tangible Interfaces, Agents in AR, Transitional AR-VR Interfaces - The future of3D User
Interfaces, Questions of 3D UI Technology, 3D lnteraction Techniques, 3D Ul Design and
Development, 3D UI Evaluation and Other Issues. VR and AR APPLICATIONS: Engineering,
Architecture, Education, Medicine, Entertainment, Science, Training.

Text Books :
l. Bowman Doug A, Emest Kuijff, Joseph J LaViola, Jr and lvan Poupyrev, 3D User Interfaces,
Theory and Practice (2 ed.), Pearson Education, 2019. ISBN 978-0134034324.
2. Glover Jesse and Jonathan Linowes, Complete Virtual Reality and Augmented Reality
Development with Unity: Lewrage the power of Unity and become a pro at creating mixed
reality applicatiors (l ed.), Packt Publishing,20l9. ISBN 9781838644865.

Reference Books :
l. Pangilinan Erin, Steve Lukas and Vasanth Mohan, Creating Augmented and Virtual
Realities (l ed.). O'Reilly Publishers, 2019. ISBN 978-1492044192.

Assessment Scheme

Components lIlternal Assessm€nt Mid T€rm Exrm End Exam Total

Weightage (7o) 45 20 35 100

E Ul 1,,/crs itl,, Grcrter Noida

(!: i.', : r.l c t- i, oiUilffPradi:ih)
P :rt i'J: lr .r, t, 1 tl, 1 'l , Tcch Zone-il
G rrla,ioi i:"ii :-l\/ l.r'ltJ
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET377 Game Mechanics and Game L T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre- req u is ites/E x pos u re

Co urse O u t(omes ( COs)

On completion of this course, the srudents will be able to:

COl: To articulate different types of bodies and their dynamics,

used in-game programming
CO2: To irnplement the collision detection and their resolution
techniques.

co-PO/PS O Man tns

POt P.]2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 POI POr2
col 2 2 I 3 3 3 3 2 2 I
I

3
PSO I
.,
PSO2 PSO3
c02 2 2
2 3 2 a I 2 2 I I 3

l:weakly related 2= moderately related j:strongly related

Cours EC ontents:

Module l:
Game theory and mechanism, Normal fom games, Super modular games, JJ,liil,iJ"gr#j,
Repeated games, Games with. incompreti/imperfeci informatioi,
Cooperative game theory, Network games, Linear'Algeuru,
rrr."rruni., i".ign,
Rion. Algebra, calculus, phvsics
Concepts. Newlon's Law. Forces. Momenta. fr""rgy.
Rigid b";; ;ilr"r.-*i;;"ffi;
classifrcation, Rigid body kinematics. Newtonian dynu"ri"r,
iugrungian dynamics, Equations
of motion for a particle, system of particl-es, continium of
equations, of rnotion. Eurer's equations of motions, Sofl
r^i, Co*t.ulni.. fnt".pr.tution oi
Bodies physics, gnstrcityi stress ana
Strain..Mass- Spring Systems, l.D. 2D and 3D array
of rurr"r, Arbitrary configurations,
control point deformation, B-spline curves, B-spline surfrcer.
surrace. built fronr curves.
Modulo ll:
Free- form deformation, Impricit surface deformation,
Lever Set a"ri"1,iT:'i:*'il"
extraction in 2D images, Isosurface extraction in 3D images,
Numericar integration methods,
Euler's Method. High order Taylor methods, Runge-iutta methods,
Murtistep methods,
Predictor-corrector methods. Extraporation methods,
verret Integration, Numericar stabirity,
StiffEquations, Quaternion: Rotation matrices, crassicar
and Linear algebraic approach, From
rotation matrices to quaternion, Interporation of quaternion,
Co[isio, Detection: piperine,
Broad phase collision detection, Bounding vorume hierarchies,
spatial panirioning, Generation
contacts: Collision geometry, Contact generation Algorithms,
Separating Axis tests,
Coherence.

Module ll l:
6 lecture hours
Collision Re solution: Impulse, Torque, Collision Impulses, Resolvin g
lnte rpenetration, The
coll ision resolution process, Resti ng Contacts and Friction:
Resting force Micro collisions.

r, r.Ji i,,r
 Types of friction, Stability, Optimizations, Digital physics: Physical modelling,
Acoelerometer, Location based gaming, pressure sensors, load cells.

Text Books :
1. Bourg David M and Bryan Bywalec, physics for Game Developers (2nd ed.), O,Reilly
Media, 201 3. ISBN 978- 144936t 037

Reference Books :
1. Schell Jesse, The Art ofGame Design: A Book of Lenses, (3rd ed.), A K peters/CRC press,
20r9. ISBN I13E632058.

Assessment Scheme

Components Int€rnal Assessment Mid Term Exam End Exam Total

Weightage (%) 45
) 20 35 r00

Reg
Ben University, Grea ter Noida
Ul:i;rl.l ?4 of Gor'l, of U(dr Fradesh)
ed
tN o's B, 9, 10, 11 , Te ch Zone-it
G reater Noida-201S.10
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET378 Game Programmi ng with HTML5 I, T P C
Owning School/Department Department of Computer Science 3 0 0 3
Engineering
Pre-req uisites/Exposure

Cou rse Outcomes ( )

On completion ofthis course, the students will be able to:

col: To explain the fundamentars of Game programming in HT'ML5 arrd

understand trre
elements of programming in the two-dimensionar environment forthe
creation of Garnes).
Co2: To create the games for the desktop machine and Internet using the
different toors
available in a major programrning language like HTMLS.

CO-PO/PSO Ma DDTNS

POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO l0 PO PO l2 PSOI PSO2 PSO3
cot J 3 2 2 3
c02 3 3 2 , 2 3 1 3
c03 3 2 2 3 ", 3 I 3 3

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module I: lz lecture hours

HTML5 Multimedia- Game frarnslyslk, FrameRate class, Creating custom rendering-
thread.
creating an active rendered thread, Changing the dispray mode, Active
rendering in fuir-screen
display mode' Handring keyboard input, Keyboarri improvements, Handring
mouse Input,
Relative mouse movement, points and vectors, Transformations, Transformation
using the
vector 2fclass, Transformation using porar coordinates. Matrix transformations,
Row-n,4"or ns
column-ma jor matrices. Matrix3x3f crass, Affine transformation in
time and space, Carcuiating
) time delta, Screen mapping, Viewport ratio, Cannon physics.

Modulo ll:
12 lecture hours
lntersection testing, Point in polygon testing, Testing using AAtsB,
Testin g using circles for
rntersections, Testing using the separati ng axis method. Testing
using the line-line overl ap
method. Testing using the rectangle-rec tangle overlap method,
Optimizing the tests, G ame
development setup, Exploring the G ame Library, XML. Deploying
an Applet, Executable JAR,
Deployment of game on rnultipl e applications, Swing animation.
Component animator,
RepaintCollector. LoopGovem er. Animated component. Animation library,
ComponentPainter, ComponentU pd ater, ComponentAnimator. Advanced
Graphics, Hardware_
Accelerated Images, Multi-Bufferi ng and Multi-Threading, Full-screen
Exclusive Mode.
Persistent Data, Persistent data formats, Persistence mechanisms,
Data Integrity, Game
architecture, Interfaces and inheritance, Model-View-controlleq
Component View MVC, A+
Algorithm, GridCartographer and GradientCartographer
 Module III: 6 bcture hours
HTTP Tunneling, Reusable client and server-side code, Game specific client and server
side code, HTTP Polling, HTTP pulling, HTML5 file upload and download, File ApI and
Ajax / XHR2, Drag and drop files, Indexed DB, HTML5 Multimedia, Web Components,
Web Workers, The Orientation and Device Motion Apls.

Text Books :
1, Wright Timothy M., Fundamental Gatne programming with Java (l ed.), Cengage Leaming
PTR, 20t4. ISBN 978-1305076532.
Reference Books :
l. Millington IAN and John Funge, Artt/icial Intertigence for games (2 ed.), cRC press, 2009.
lsBN 978-0123747310.
Assessment Scheme:

Components Internel Assessment Mld Term Exam End Exam Total

l Weightage (%) 45 z0 35 100

*",w{
Ecnrlctt Un!e rs;ty, Greeter
Noida

Eli:p l:i[ ;i, ;;,i.: i#f;Tfl]

 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET379 AI for Games t. T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

Coume Outcomes (COs)

On completion of this course, tlte students will be able to:

Col: To comprehending an interconnection between the techniques

ofAI and their usage in
Games-
CO2: To Implerrent the idea of AI in Games for developing games programmatically.

CO-PO/PSO Mappinq

) POt Po2 POI PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO PO t2 PSOI
cot 3 1 3
PSO2 PSO3

c02 3
3 3 3 3 J 3 3 3

l=weakly related 2= moderately related 3:strongly related

Co urse Conten ts:

Module l:
Artificial Intelligence in Games, ways of AI in Games, Deterministic
u..rr. ol:i:"#[,l,lff"
AI, Established Game AI, Chasing and Evading, Agent Movement, Two_Dimensional
Movement, Statics, Kinematics, Steering Behaviors, Combining
Steering Behaviors,
Randomness in game, FSM with probability, Dynamic Al,
Coordinated Movement, Motor
Control' Movement in the Third Dirnension, pathfinding, Breadcrumb pathfinding, path
Following, Wall Tracing, Waypoint navigation, A* palhfinding,
World Represen-tations,
Defining Search Area' starting search, Scoring, Fi,ding Dead
End, Hierarchicai pathfinding,
Continuous Time Pathfi nding.

Modulo Il: g lecture hours

Decision Making: Finite State Machines, Rule based systems,
Decision tr""r, nurry Logi" in
gaming. Markov systems in gaming, Goal-oriented
Behavior, Rule-Based AI Sysiems,
Fighting Game Strike Prediction, Action Execution, Decisions
under uncertainty-Bayesian
Techniques, Bayesian Network, Tacticar and Strategic
Al, waypoint Tactics, Tacticar
Analyses, Terrain A,alysis, Leanring with racticar Analyses,
structure tbr Tacticar Anaryses,
Map Flooding, Tactical pathfinding, Cost Function, Tactic
weights and Concern ntenaing,
Modifl,ing Pathfinding Heuristic, Tactical Craphs for pathfinding.

Module llI: 8 lecture hours

Coordinated Action, Multi- Tier AI, Emergent Cooperation,
Scripting Group Actions, Military
Tactics, Leaming mechani sm, Online or Offline Leaming, Intra-Behavior
Learning, Inter_
Behavior Learning, Over- Leaming, Minimax algorithm, Negamax
algorithm, parameter
r, ./
ut./
t(/ t:t
;,.:,r::ilx, (,lrc:i:r l roid;t
(r') : : ,' .l ..i .i,. ! i,i | :i i:i:r .. ..h\
:
irr ;'1 1;r-: ,, -, r,j I i, l_;.t/_ar e_jl
Gi.-,.ri:rr i i_
 Modification, Parametef Landscape, Hifl climbing in gaming,
Extensions to Basic Hill
climbing, Annealing Action prediction, Left or Right, Raw probabirity,
string Matching, N-
Grams, Neural Networks in gaming, chasing and Evading
with Brains, Reinforcement ,e#ing
in gaming.

Text Books :
l' Bourg David and Glenn Seeman n, Alfor Game Deveropers:
Creating Inteligenr Behaviour
in Games (l ed.), O,Reilly Me dia,2020. ISBN 978_0596005559.

Reference Books :
l. Yannakakis Georgios N. and Julian Togelius, Artificial
Intelligence and Games (l ed.),
Springer, 201 8. ISBN 978-3319635194.

A.ssessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Totrl

)
Weightsge (%) 45 20 35 100

R
Be ett UniversitY, Greater Noida
Establi$l\{S UrlirAct 2'1 ol Govl of Uttrr Piadesh)
P lot t"lo'ri 8, 9, 10, 1 1, Tech Zone-ll
Greater I'loi 3-201310
 Name ofProgram Bachelor of Technology (Computer Science and
Engineering)
CSET3SO Animation and Rendering Techniques I, T P C
Owning SchooUDepartment Department of Computer Science 2 0 2 3
Engineering
Pre-requisites/Exposure

C ourse Outcomes fCOs'l

On completion of this course, the students will be able to

COI: To define viewpoint and colnmon rollouts-editing splines.

CO2: To understand different concepts of light.
CO3: To make use ofVRay in animation and create anirnation by using rendering technique.

CO-PO/PSO Mapnine

POr PO2 PO3 PO4 PO5 PC)6 PO7 P08 PO9 POt0 POt I POl2 PSOI PSO2 PSO3
col 3 3 3 3
co2 3 3 3 3
co3 3 3 3 3 3 3 3 3

l=weakly related 2= moderately related 3=strongly related

Course ontents:

Module I: 6lecture hours

3D View, Viewports, Standard primitives, Transformations, File formats and operations,
Selection, Cloning, Group, Ungroup. Alignment, Splines: common, Rollouts-editing splines,
Architectural tools, Max scene files. Modifiers, World space modifiers, Object space modifiers,
Modifier stack. Instanced modifier.

Modulo ll: S lecture hours

Compound objects and types, Modelling, mesh modelling, converting objects to editable mesh, sub
objects: vertex, edge, face, polygon, element, Edit mesh modifier, Editable poly modelling,
Material Editor, Assigning materials to objects, Material editor options, Material properties,
Material types, Concepts of Light, omni Iights, Spotlighr, target lights, free lights, directional light,
area lights, Mental ray, Skylighr, Creating max basic lights, Iights pammeters, positioning lights,
Creating max light in exterior environment, Creating max light in interior environmenl.

Module lll: g lecture hours

Introduction to Network Security, Network-based Attacks, Active and passive Attacks, phishing
and Its Types, Tailgating. Impersonation, Dumpster Diving, Shoulder Surfing, Hoax, Waterhole
Attacks, Denial of Service Attacks and its Types, Man in the Middle Attack, Buffer Overflow
Attack, Cross-Site Scripting, SQL Injection Attack, Privilege Escalation, Man in the Browser,
Zero-Day Attack, SQL Injection Attack, Privilege Escalation, Man in the Browser.

Module IV: 6 lecture hours

ii.ir
it::: l' . l^,,.. r' i r -.i-r-,
,
.rr.r itr .,.a,1
l

..,..i, lt llltl,.1-ll
,.
)
 Animating modifiers, animating elements, animation helpers, using dummy
objects, dynamics
and reaction, Dynamic Objects: damper, Spring, simulation
mass FX.

T Boo ks:
l. Watt Alan H. and Mark Watl, Advaneed Animation and Rendering
Techniques Theory
and Practice (l ed.), ACM press, 1992. ISBN 978020154 4121, O20lS44lZt
.

Refercnce Books :
l. Mdller Tomas Akenine, Eric llaines and naty Hoffman, Real-Time Rendering (3
ed.), CRC
Press, 2019. ISBN 9781315362007, t3t3362007.

Assessment Scheme:

Components Internal Assessment Mid Term Exsm End Exam Total

Weightage (%) 45 20 35 100

)

Re
B enn ett 'llr
(E!lnlil!hed rxi'illi f i", "1',fl ,!:.:l'?)
Lorle-rr
iriot No' ., C. L tO, 11, Tech
Grt:atir Noida-201310
) CS Op en
Electives: f,
rr, III, IV
)
 Name of Program Bachelor of Technology (Computer Science and
Engineering)
CSET3STL A lications of AI L T P C
Owning SchooUDepartment Department of Computer Scie[ce 3 0 0
Engineering
Pre-requisites/Ex posure

Course Outco mes (COs )

On completion ofthis course, the students will be able to:

col: Know various AI Agents and AI search argorithms (uninformed,

informed, heuristic,
constraint satisfaction, genetic algorithms).
co2: Demonstrate working knowredge of reasoning in the presence of incomprete
and/or
uncertain information_
) co3: Apply knowledge representation, reasoning, and machine reaming techniques
to rear-
world problems.

CO-PO/PSO Manoins

POt Po2 PO3 PO4 POs PO6 PO7 PO8 PO9 PO t0 POr I PO I2 PSO PSO2
cor 3 3 2 2
r PSO3
3
coz 3 3 2 2 2 2
c03 ., 3
3 2 3 2 1 I 3 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l:
Introduction: Introduction to Artificial Inteiligence, Foundations
Intelligence, Introduction to Search: Searching for sorutions,
,ro ,i.rJN,'1"1'i"nli,ilir
Uniformed search strategies,
) search strategies, Locar search algorithms and optimistic probrems,
lnformed Adversarial
Search, Search for games, Arpha - Beta pruning, Apprications
of Artificiar Intelrigence. Markov
decision processes, lntro to neural nets.

Modulo ll:
Reasoning wirh uncertaintv, probabiristic reasoning over
Decision Making, Strategy, Infrastructure, AgentBased
time Leaming o"ftfflil""IH;,,
Al.
Module llI:
9 lecture hours
Hacks and^Heuristics. Vision Systems: fundamentals of image
formation, camera imaging
geometry, feature detection and matching, Multiview geometr!.

Module IV:
9 lecture hours
Motion estim ation and tracking, and classification, Action recognition
Color spaces and
Segmentation,

!ljs i.ij r
erter iVoi da
r:,- -., 'il cl
'i-e
l-.,.i.ri
ch
,i lcsh)
. oi-l a -201 :r :Z one-li
l0
 Text Books :
1. Russell Stuard and Peter Norvig, ArtiJicial Intelligence: A Modern Approach (3 ed.\,
Prentice Hall, 2010, ISBN 978-0136042594.

Reference Books :
l. Forsynth and Ponce, Computer Vision: A Modern Approach (2 ed.), prentice Hall, 201 l.
rsBN 978- 9332550117.
2. Millington tAN and John Funge, Arti/icial Intelligence for games (2 ed.), CRC press, 2009.
ISBN 978-01237473 10.

Assessment Scheme

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 45 20 35 100

E)
I
Be ntvo rsit),, Greater
(Eiil rhcJ UrCtiA. I :4 0lLj ,vt, oi No ide
ultir P radesh)
Plot llo'3 B, O, 10, 11, Tech
Gre drcr t\tJiC.l -201310 Z one-ll
 Name of Program Bac h e o r o f T ec h n o logy (Co m p u ter Sc I en ce z n d E D gl n ee rl n g)
CSET3SI Ap ications of Al I, T P C
0wning SchooUDepartment Department of Computer Science En gineering 3 0 0 3
Pre-req u isites/Exposure

Course Outcomcs aCOs)

On completion ofthis course, the students wili be able to:

COI: Know various Al Agents and AI search algorithms (uninformed, informed, heuristic^ constraint
satisfaclion. genetic algorithms).
CO2: Demonstrale working knowledge of reasoning in the presence of incomplete and./or uncertain
information.
co3: Apply knowledge representation, reasoning, and machine leaming techniques to real-worrd
problems.

CO-PO/PSO Mappins

PO Po2 PO3 PO4 POs PO PO PO PO POt POt POI PSO PSc)2 PSO3
6 7 8 9 0 2 I
col 3 3 , 2 3
co2 3 3 2 2 2 , , 3
co3 3 , 2 3 2 2 t 3 3

I:weakly related 2= moderately related 3:strongly related

Course Contepts:

Module I: l2lecture hours

Introduction: lntroduction to Artificial Intelligence, Foundations and History of Artificial
Intelligence, Introduction to search: searching for solutions, Uniformed search strategies, Informed
search slrategies, Local search algorilhms and optimistic problems, Adversarial Search,
Search for
games, Alpha - Beta pruning, Applications of Artificial Intelligence. Markov
decision processes,
Intro to neural nets.

Module ll: 12 lecture hours

)
Reasoning with uncertainty, Probabilistic reasoning over time Leaming caming: Movement,
Decision Making, Strategy, Infrastructure, Agent-Based AI.

Module I lI: 6lectures hours

Hacks and Heuristics. Vision Systems: fundamentals of image formation, camera imaging
geometry, feature detection and matching, Multiview geometry.

Mod[le lV: g lectures hours

Motion estimation and tracking, and classification, Action recognition Color spaces and
Segmentation.

Studin Work-/Laho torY Exneri menls:

tu,,'
fr,-,
,'l r- r
.tit:a
'
i lj;.1l: tl
_1_- )
Ii, Zone-il
ii:11[J
 studenls will be able to imprement the various AI algorithms and develop a project based on
gaming/image processing using python/MATLAB/CUDA.

Text Books :
l. ftts-sell lluard and Nonig Peter, Artificial Inteligenee: A ModernApproach, (3 ed.), prentice Halr,
20 I 0. tsBN 978-0 I 36042594.

Reference Books :
I l?yyfi-l lnd Ponce, Comryter Vision: A Modern Approach (2 ed.), prentice Hall, 201l. ISBN
978- 93i2550117..
2. IAN Mi ington and John Funge, ArtiJicial lntelligencefor games (2 ed.), CRC press, 2009. ISBN
978-0t237473t0.

Assessment Scheme:

Components Internal Asscssment Mid Term Exem End Exam Total

Weightage (%) 35o/o 30o/o 35o/o l0V/o

)

R S r
B * tt Univi,rr.ity, Grealel N0ldts
blisi r.J j.j/\!l
!" ,1 otCc( ol l-r:l:1| [,rr,]?rh
Plot t\],;'s il, 9. '10, 11, Teclr Zone"
Gre"rlcr f.;cicia-;10 1 31 0
 Name of Program Bachel or of Te c h n ol o gv (c o m p u ter s c I e n ce a n d E n gr n ee rt n
s)
CSET382 Web T€chnol es L T P C
0wning SchooUDepartment Department of Computer Science En grneerlng 3 0 0 3
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the studenls will be able to:

COI : Understand and write a well-formed / valid XML document.

co2 : Leam to connect ajava program to a DBMS and perform insert, update
and derete operations
on DBMS table.
CO3 : Develop dynamic webpages usingjava script and DHTML.
co- Ma DDINS

PO PO PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PS02 PS03

) 2 6 7 8 9 0 I 2 I
col 3 3 2 2 I 3
co2 3 3 1 3
co3 2 3 2 3
c04

l=weakly related 2= moderately related 3=strongly related

Cou rse Contents;

Module l: g bcture hours

Introduction to Web Technologies, History ofthe Web, OSI Reference Model,

Understanding Web
system Architecture. understanding 3-Tier web Architecture, Layers in the TCp/rp
Modei web
Browsers, Overview of HTTp, Exploring Web Technologies, Introduction
to Web Services, About
IIS, services supported by [s7, lnstallation of IIS7, Administer web Server Remotery,
creating
Web Sites.

) Module ll: g lecture hours

lntroducing HTML Document Structure, Creating Headings on a Web page, Working

with Links,
Creating a Paragraph, Working wirh Images, Working with Tables, Working with
Frames,
Introduction to Forms and HTML Controls, Introducing Cascading Style She;ts,
ln*oducing
DHTML, Introducing Javascript, crient-Side Benefits of using JavaScripr over VB Scripi
Embedding JavaScript in an HTML page, Handring Events, using variables
in JavaScipt, Using
Array in JavaScript, Creating Objects in JavaScript, Using Operators, Working with Control
Flo;
Statements, Working with Functions.

Module lll: g lectures hours

Introducing PHP, working with variabres and constants, contro[ing program flow,
working with
Functions' Arrays, Files, and Directories, working with Forms and Database, Databases:
Basic
command with PHP exampres, connection to server, creating database, serecting
a database, listing
database, listing table names creating a table. inserting data, artering tabres, queries,
deleting databasi

r
,r, (l r,:l::tir Nci.ia
.l
_- :j ' : l1i:,:;.,4h)
, r i, l:.,:t,,'.Crt,"..li
, ii, rr)
 deleting data and tables, pHp myadmin and database bugs, Exploring
cookies, Sessions, and pfrp
Security.

Module lV: E lectures hours

Getting started with web Apprications in Java, working with JavaBeans,

working with Servret
Programming, working with JSp, Database higramming, ASp.NET 315 Essentiars,
_Java
Developing. p web Application , Application Stnrcture
anJstate, wlb Forms: standard controls;
navigation controls: Tree view, Menu, and site Map path,
valiiation controls, Introducing web
Parts controls, working with Database contrors, Introducing
Login controls, rnside Master:pages
and Themes, Managing Web Applications, Applicarion
Clob]aliza'tion.
Module V:
8 lectures hours

Inroduction to XML. Basic and advance XML, Java ApI for

XML procossing, Document Object
Model (DOM), XML Linking Mechanism, Evolution of Web
Applicati-on, Uraeot_jing
Javascript for AJAX, Asyrchronous data transfer with XML
) Frameworks, Integrating pHp and AJAX, Consuming Web
Http Request, hplementing AJAX
Serviees in AJAX .application in IT
sector.

Text Books :
l. 5_ogglr_!:Tnlrg Solutions Inc, Web technology btack book (l ed.), Dreamtech press, 2009. ISBN
978-8177229974.
Refercnce Books :

I. I1l"^r^9Il: Web programming, building inremet apptications (3rd ed.),

Wiley,2006. ISBN 978_
047A0177 S3

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Welghtage (%) 35o/o 30Yo 35o/o l00o/o

R trar
Bennetl Unlvcrsity, Greater Noida
(Esiablishc, UndirAct !1 of Gcvt, ol UllBr Pradesh)
-lech
Plot hlo's 8, S, 10, 11, Zone-ll
Groater Ncidii-20'1 310
 Name of Program Bachelor of Technology (Comp ut€r Science and Engineering)
CSET383 Semantic Technology L T P C
Owning SchooYDepartment Department of Computer Science Engineering 3 0 0 3
Pre-requisites/Exposure

Course Outcomes (COs)

On completion oflhis course, the students will be able to:

COI : Demonslrate the understanding ofthe approach to modelling information and knowledge.
CO2 : Produce the data that encodes semantics using well-known technologies such as RDP and
owL.
CO3 : Use sophisticated querying approaches Io facilitate distributed information retrieval and
aggregation.

CO-PO/PSO Mappinq

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PS02 PS03
I 6 7 8 I 0 I 2 I
1
col 2 I 2 I 2
,'
co2 2 t 1 I 2 3
c03 2 2 3 2 3 2 3 3

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: 12 lecture hours

Information Architecture and Interoperability, Semantics and Knowledge Modeling. RDF
Modeling Language, RDFS Extended Modeling Language.

Module ll: 12 lecture hours

Logic and Rule, OWL Modeling Language, OWL and Reasoning, Projects Discussion.

Module lll: l8 lectures hours

Projects Discussion, Ontology Mapping, SPARQL Overview. SPARQL Extended Features,
)
Proiects Presentation, Projects Presentation.

Studio WorldLaboratory Experiments:

Students Protege tool which is an open source

will model the knowledge graph using
ontology editor and knowledge management system. There will be Java programming using
Iena library that is Apache project and java framework for building Semantic Web
applications.

Text Books :
l. Hitzler Pascal, Krotzsch Markus qnd Rudolph Sebaslian, Foundations of Semantic Web
Technologies (l'' ed.), CRC Press,2009. ISBN 978-1120090505
 Assescment Scheme;

Components Internal A$essment Mld Term Exam End Exrm Totsl

Weightage (%) 35o/o 30Yo 3SYo 100%

R r
Be University, Greater Noida
hed UnderAcl 24 of Govl, ol U ttar Pradesh)
lot No's B, g, 10, 1'1, Tec h Zone-ll
Greater Noida-201310
 Name of Program Ba c hel o r o f T ec h n ol ogy (c o m p u e r Sc I e n ce AN d E ng n eer I ng)
CSET3E4 lT Su rt Technologies L T P C
Owning SchooUDe partment De pa rt m e n t o f om p u te r Sc I e T ce E ng I Il ee rt n
c 3 00 3
Pre-requisites/Ex posure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI : Understand the need for lT Support Technologies in the current era.
CO2 : Gain an in-depth knowledge offirewall security and other network
security components

CO-PO/PSO Maopinq

PO Po2 PO3 Pc)4 PO5 PO PO PO PO POI POt POI PSO PSO PSO
6 7 8 9 0 I 2 I 2 3
col 2 3 I I 2
.,
I 3
c02 3 3 3 2 3 2 , ', ", I 3 3

l:weakly related 2= moderately related 3=strongly related

Cou rse C ontents:

Module l: l2lecture hours

Introduction to the different types of IT Support Technologies. Infiastructure,
Hardware
Suppol't, Security. Need for IT Support, lraditional IT Support demands
vs modem IT
Support demands. Evolving support technologies.

Modtrle II; l4 lecture hours

Introduction lo LANS, WANs, MANs, lnternet. Types ofcables, switches.

routers, repeaters.
LAN topologies: Bus lopology, Ring topology, Token passing rings. Cloud service
and
Deployment models, Server virtualization-

Module lll: l6lectures hours

Security concems in modem IT, chalenges ofcroud computing in terms

ofapprication security, server
security, and network security. Security in computer networks: principles
of cryptography, symmetric
key, public key, digital signatures, firewalls, Security in different layers:
secure E_mail. SSL, tp
security Firewall planning and design, deveroping a security poricy, firewa
configuration strategies.
Recent trends and challenges in the field of IT Support Technologies.

Text ks:

Cisc', ASA con/iguration (1't ed.), Toto McGraw_Hill Educarion,2009. ISBN

?::!l!r!*a
0070677241.
978_

r )l
-ii .r'tfl 'ii
,
:, iJ
 2' stallings ltilliam, Data and conputer communicctions (gh ed.), pearson Education,
20r0. tsBN
978-0t3t392052.

Refcronce Boolis :

l. Buyya.Raj Kunar, Broberg James and.Goscinski, AndrezeiM Cloud

Computing: principlu and
paradigns (lst ed.), WT press, 20t t. 4SBN 97\-0470gt7gg8.

2. Foroazan B. A., Data communication and Networking (5th ed.), McCraw

Hill, 2007. ISBN g7g_
1259064753.

3. Tanenbaum A.5., Compater Ne*orks (5th ed.), prentice Hall,20t0. ISBN g7g-0t334BSgj6.

Assessment Scheme:

Components Intsrnal Arsessment Mid Term Exam End Exam Total

Weightage (%) 35o/o 30Vo 35o/o 100%

)

R r
ett L,niversi ty, Greater Noida
air;i!;)cd U:t:lJfArl 2 .1 cl t";c\,1,
ol U ,tdr Prcdersh)
ot l',lo' sc, g, 10, 1 1, l-ec h Zone-it
Greater N oiCa-201310
 Nam€ of Program Bachelor ofTechnology (Computer Science and En gineering)
csET385 Software En grneenng L T P c
Owning SchooUDeparlment Department of Computer Science Engineering 3 0 0 3
Pre-requisites/Exposure

Cou Ou tcomes (COs)

On completion ofthis course, the students will be able to

col : Demonstrate understanding ofsoftware Engineering as an iterative and systematic process

COz : Apply development life cycle through version control system, lDE, UML, etc

CO-PO/PSO Mapning

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
cot I 3 I I I I 2 3 I 3
c02 3 3 3 2 3 ) I
.,
2 2 ) 3
)
l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 12 lecture hours

Importance of Software Engineering, Discipline of software Engineering Lifecycle, Engineering

standards in building, testing, operation and maintenance of the computer and software systems.
software Process Model Introduction, waterfall process, spiral process, Evolutionary prototypinB
Process, Agile Process, Choosing a Model, Lifecycle Documents, Version Control System:
Introduction to Git, Git Demo: Git + Eclipse, Git.

Module ll: 12 lecture hours

Requirements Engineering: General RE Definition, Functional and Non-functional Requirements,

User and System Requirements, Modelling Requirements, Analysing Requirements, Requirements
Prioritization, Requirements Engineering process and steps, creating SRS. Requirements
Inspections. oo Software and UML: object orientalion Introduction, uML structural Diagrams:
Class Diagrams, Component Diagram. UML Structural Diagram: Deployment Diagram., UML
Behavioural Diagram: Use Case, Use Case Diagram: Creation Tips, UML Behavioural Diagrams:
Sequence, UML Behavioural Diagrams: State Transition Diagram.

Module Ill: 9lectures hours

Agile Development Methods: Cost of Change, Agile Software Development, Extreme

Programming (XP). XP's Values and Principles. Test First Development, Refacloring. pair
Programming, Continuous lntegration, Testing Strategy, High-Level Scrum process. Unified
Software Process: Use-case Driven, lnception phase, Elaboralion phase, construction phase,
Transition Phase, Phases and Iterations. Software Evolution: Evolution processes. Legacy systems,
software Maintenance- situations during software evolution and maintenance. software
 Reengineering and Refactoring: Reasons to Reengineer and Refactor, Advantages, Refactoring
Demo, Refactoring Nsks, Cost of Refactoring, When Not to Refactor.

Module IV: 9 lectures hours

Software Architecture: What is Software Architecture? Advantages and use ofarchitectural models.
Architectural pattems. Different architectural pattems (Layered, MVC, Repository, Pipe and
Filter). Design Patterns: Pattems Catalogue, Pattern Format, Factory Method Pattem, Strategy
Pattern, Choosing a Pattem, Negative Design Pattems. Software Testing: Black Box Testing
Failure, Fault and Error, Verification Approaches, Pros and Cons of Approaches, Testing
lnroduction, Alpha and Beta Testing, Black-Box T€stirg, Systematic Functional Testing
Approach, Test Data Selection, Equivalence Partitioning and Boundary Value Analysis, Create and
Evaluate Test Case Specifications, Generate Test Cases from Test Case Specifications, White-Box
Testing: Coverage Criteria lntro, Statement Coverage, Control Flow Graphs, Test Criteria.

Text

.) l. Pressman R, Software Engineering, A Practitioner's Approach (7th ed.), McGraw Hill

International, 20 I 4. ISBN 978-93392 I 2087.

2. Sonnemille, Softwme Engineering (l1th ed.), Person Publications Publishing Company, 2015. ISBN
978-0133943030.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 35o/o 30o/o 35Vo | 000/"

.)

*"k/
Bennett University, Grcnter Noida
(EtrL i:llcJ U ljrl:t.:rlCo,l.( U.t.,r oradtsh)
Plot IJc s 8, 9, 10, 11, Iech Zone-il
Greater t'loiCr-201 :ii 0
 Nam€ of Program Bachelor of Technolos/ (Computer Science and Engineering)
CSET386 Programming Languages L T P C
Owring SchooUDepartment Department of Computer Science Enginesring 3 0 0 3
Pre-requisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COt : To explain the requirement for the interdisciplinary application of programming languages

CO2 : To build the logic for the given problem.

CO3 : To develop programs and debug.

CO-PO/PSO Maopinq

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POr PSO PS02 PS03
I 6 7 8 9 0 I 2 I
col I I a ., , I I !
) co2 .,
I I
.,
I I 3
co3 I I I 3 3

l:weakly related 2= moderalely related 3=strongly related

Course ontelrts:

Module I: l0lecture hours

Programming, programming language. Types of programming languages, high level Ys low level,
compilers, interpreters, assemblers, binary code. Datatypes, variables, keywords, identifiers,
Importance ofcomments in programming. Implementation of scope rules. Static scoping and dynamic
scoping.

Module ll: ll lecture hours

hogramming constructs: conditional stalements if statements, else statement, if-else statement. For
loop, while loop, nesting loop. Do-while loop, infinite loops, break, continue statements. Arrays, one
dimensional array, multidimensional array.

Module I ll: l0 lectures hours

Functions, in-built functions vs user-defined functions, importing libraries for using in-built functions.
Pointe$ and its types, arrays of pointers, pointers, and functions. Passing parameters to functions,
returning values fiom funclions, recursion. Dynamic arrays, string, string variables, string handling
functions.
Module lV: I I lectures hours

Object-oriented paradigm. Fundamental concepts, objects, classes, encapsulation, and inheritance.

Errors and wamings, rectirying errors and debugging. File handling, opening and closing file, input /
output operations on file.

TextBooks:
bl
'P1frf;hisr
(C::,,'.- .t.I :ni'.'.-1r l;r),. (l1elt..r l.!Oida
(frl.r- ,.,lrJ I l,' . .-rirl :l.lf-:Jvl,0i l.liii'rr Pl:dcsl,
FInt Nc':,4, g, 1C, 11, Tech Zone-li
Gr()a]lei- [.:oi.:e-2r,11 31 0
 l. Bansol Anind Kunar, Infioduction to ptogramming Languages (r"t ed,), chapman
and Hal/cRC,
20I7. ISBN 978I I384608 t8.

2. Kanetbar Aditya and Kanetkar yashwant, Let us python (1" ed.), BpB, 20lg_ ISBN g7ag3agg4500g.

Reference Bookt :
1. Klobnik steve and Nichols Caror, The Rust programming Language (t't ed), No starch press,
2019-
ISBN 978t718500159.

Agsessment Srheme:

Components Internal Asssssment Mlal Term Exrm End Exam Total

Welghtage (%) 35o/o 3V/o 35o/o 1}ff/o

I
{4,
R#strar
Bdnnett University, Greaiei [!oidq
(Eslae:;lhEJ Una:.A tl.1al Oort, ct U rar Prq.leEhl
Plot No's 0, 9, 10, 1 I , -teeh EoilCdl
Greator I'loida-201 310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET387 Artificial lrtelligence for Creative Expression L T P C
Owning SchooUDepartment Department of Computer Science Ergineering 3 0 0 l
Pre-req uisites/Exposure

Course Oxt mes (COs)

On completion ofthis course, the students will be able to

COI : To explain the creative expression possibilities of artificial intelligence.

CO2: To create artistic experiments and prototypes, in a variety ofoutput forms like visual, textual,
musical.
C03: To examine the implication ofAI in the field ofcreative expressions, which was human
terrilory t ill now.

CO.PO/P Maooins

PO PO2 PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PSO2 PSO3
I 6 7 8 9 0 I 2 I
col t I 2 3 I I
co2 I 3 2 2 1 3 3 3
co3 3 I I , 3 2 2

l=weakly related 2= moderately related 3:strcngly related

Course Contents:

Module l: 14 lecture hours

Wlat is machine leaming? Playing around with Wekinator and Tensorflowjs to start making some
interactive work and get familiar with concepts of training the machine with some data, running a
trained model and seeing interactive output. What are neural networks? Looking inside neural networks
and how neural networks are ffained, understanding what terms like weights ofa network. activation
function etc. mean, Convolutional neural networks and how that leads to Deep dream. Experiments
with deep dream to visualize layers.

) Module ll: l4 lecture hours

Discussions around how AI is like a photography moment for art to give some art histdrical context to
AI. Style transfer- real-time style transfer liom pre-trained models. Run style tmnsfer experiments
through webcam input. Discussions around how artists are using style transfer.

Module Ill: T lectures hours

Recurrent neural networks- Text Modeling, Sketch (vector drawing) Modeling, Music Modeling.
Introduction to sequential datasets in the contexl of art, like quickdraw, text corpuses and musical
datasets and what can be done wilh such sequential data. Ethical considerations around widespread use
of Al. Conceptual art pieces that commenl on this issue.

Module lV: 7 lectures hours

#4,"'" :
if i", cri:r1. i-i.,loirla
L.i ...i1:: : i'l.l.rrlt)
.1, -l
. .,, , 1 i. ::;ir Zoirc-li
'' r lltir)
 Dimensionality reduction algorithms like TSNE, and how they can be used to form intersctive
ways of
exploring data. Example art pieces using this. Cenerative models- Generative Adversarial Networks
(cANs). understanding the basic formulation ofa GAN. pipeline ofhow to
train a GAN for art. GAN
latent space aritbmetic.
Text Books :

1. Sautoy Marcus Du, The Creativity Code, Art ond lnnoyarion in the Age
ofAl (ts, ed.), Hanard
University Ptess, 2020. ISBN 978067424421g.

Reference Books :

l;/s+q fevin,,y* An with Artifcial lntettigence, Make and Selt your Art with At,
Btockchain and NFT (1" ed), Independently piblished, 202 t. ISBN 97g8S7Z t 8g3 t0.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Erem Total

) Weightrge (%) 35o/o 3@/o 35% l00o/o

Reg ar
Be iverslty, Greater Noida
ed Uxd er Act 24 of Govl, ol U ar p radesh)
No'e 8, 0, 10, '11. Tech Z one-ll
G reater Noida-201310
 Name of Program Ba c h el o r
of Tec h n ol ogy (Co m p u te r s cl en ce a n d E n ll e e r ng)
CSET388 Al and Public Policv L T P C
Owning SchooVDepartment Deparlment of Com puter Science En gineering 0 0 3
Pre-req uisites/Exposure

Course Oulcom€s (C()sl

On completion ofthis course, the students will be able to

col: To explain the policy frameworks and strategy repons by different countries and organizations
co2: To articulate the arguments for AI laws rerated to Autonomous and Robotics systems.
CO3: To make use of legal framework and challenges conceming Al and Data science.

CO-PO/PSO Ma DDTNS

PO P02 PO3 P04 PO5 PO PO PO PO POI POI POI PSO PS02 PS03
I 6 7 8 9 0 I 2 I
col 2 z 2 2 , 3 2 2 2 1
cC)2 1 3 ) ) a , 2
.|
T 2
) co3 , .|
2 2 2 2 2 2 !
l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module I: I I lecture hours

AI: j{n gpportunity and a risk, comparing and interpreting the strategy and reports ofdifferent countries
on Artificial lntelligence: Singapore, USA, UK, Cermany, tn,tia, Ciina. Blickchain: Japan, China,
USA, Switzerland, Singapore, India, Robotics: Singapore, Japan, USA, India, International AI
strategies; European union, united nations, AI Agreement between uAE and India, intemational Study
Croup of Al.

Modrle ll: 13 lecture hours

AI Policies in India: NITI Aayog, Al initiatives by Ministry of Electronics and IT, Al Initiative by
Ministry of commerce and lndustry, national AI based portil, AI Academia,/ lnstitutes and centers in
India, AI standardization in India: Bureau of Indian standards (BIS), Department of relecom (Dor),
) Key considerations for AI policymaking in India: Resources, Infrastru;ture, Markets, and Funding,
Policy environment for Al innovalion, Democratize AI technologies and data, national infrastructure t-o
support domestic development: AI Data storage, AI Networking Infrastructure, Awareness, Education,
and Reskilling: skill sets ro successfully adopr AI, Early Childhood Awareness and Education, Focus
on marginalised groups, Improved access to and awareness of Internet of rhings, public Discourse,
Impact of AI on different stakehorders: Emproyees, customers, Business, etc.. How has CovrD-19
affected the Al trends?, Business Transformations with Al-

Module lll: S lectures hours

AI in warfare and diplomacy, AI shortfalls for milirary applications, Transparency in AI, Audits, Tiered
Levels of rransparency, AI and economic growth: Economic characteiistics of AI, private equity
investments in Al start-ups, Broader ffends in development and diffusion of Al, How increases
automation in the production of goods and services is impacting economic growth?, How can we
reconcile the advent of AI with the observed constancy in giowth mtes and cap'ital share over
mosl of

' j','_i!!, :.-- r I l'- i.'l

i-.l.rL I'i,,.r :, 1)

\ t'i , clt Zr}r:i-ll

(:,1i:a'.'.., . ,.i't:a
 the twentieth century?, should we expect such constancy to persist in the twenty- first century?, can
AI drive massive increases in growth rates? Under what condiiions, and are these conditions plausible?,
How are the links between AI and economic growth modulated by firm- level considerations, includin!
market shucture and innovation incentives?, How does AI affect the internal organization offirms, an;
with what implications?

Module IV: l0lectures hours

Documentary on Impact ofAI in economy, case study: How do you organize the skills to best facilitate
innovation for your firm?, Pitch deck for ideas or new application of AI, pitch deck for ideas or new
application of A[, Coordinatior and collaboration across stakeholders, Development of Contextually
Nuanced and Appropriate AI solutions continuing, deepening, and expanding partnerships for
innovation, Develop contextual standard benchmarks to assess quality of algorithms, Frameworks for
Regulation: national legislation, Data protection Law, Discrimination Law, Frameworks for
Regulation: competition Law, consumer protection Law, secloral Regulaion, AI policy challenges:
Intellectual Property Regime and Al issues, catastrophic and Existential Ris( AI policy challenges:
Security and Cyber security, Re-thinking Intellectual hoperty Regimes.

) Text Books :
3. West Darrell M and Allen John R, Tarnihg point: policymaking in the Era of Arrificial
lntelligence (l't ed), Brookings lnstitution press, Washington, D.C, 2b20. ISBN \dl57iSSgS.

Refercnce Books :

l. Shmma Pankaj and Sarangi Saswa, Artificial lntelligence: Evolution, Ethics and public
Policy (l"t ed.), Trylor & Francis, 20t9. ISBN 978-t t38625389.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Welghtsge (%) 35o/o 3Oo/o 35o/o 1000a

"{ks"{Unuersity, Greater
B$fr}il Noida
(Est;Lrij-h:J Lr;rl.rAct24 of Go!,l, of Uttar Pradesh)
Plot No's 0,0, 10, 11, Tech Zone-ll
Greaiei i\ioi.la-201 31 0
 Name of Program Bac h el or o f Tech nol o gv (c om p u ter Sci ence a n d En gl n ee fl n c)
csET389 Linux Apache MySql PHP (LAM P) L T P C
Owning SchooUDepartment Department ofComputer Science En gineering 3 0 0 3
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis coune, the students will be able to:

COI: To articulate an overall understanding ofpHp programming through various sewer.

CO2: To build modular web applications with different framework.

CO3: To design and develop webpages and web sites for the needs ofan organization.

CO-PO/PSO Maooinq

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PSc)2 PSO3
I 6 7 8 9 0 I 2 I
) col 3 , a 2 1 t ., a
co2 2 2 3 2 1 , 2 3 2
.,
co3 a 2 2 3 2 1 2 3

I =weakly related 2: moderately related 3=sfiongly related

Course Contents:

Module I: l0 lecture hours

LAMP technology, Linux operating system, Knowledge of various editors, pHp introduction,
operators in PHP, Logical and conditional operators use cases, Function Definition and Function call,
Function with arguments, Function with return value, call by value and call by references.

Module lI: I I lecture hours

Understanding variable scope, clobal variables and static variables, tnclude and Require, Built-in
) functions in PHP, tntroduction to Anay, Array in pHp, creating an Array, Accessing Elements of an
Array, Modirying Elements ofan Array, Array and string related operations.

Module lI l: l l lectures hours

ooPs concepts, Defining class in PHP, object in pHp, constructor, constructor with parameters,
lntroduction to Exception, Exception Handling mechanisms, crealing custom Exceplions, Multiple
Catch Blocks, Exception Propagation, Enor Handling in pHp, Web designing principles.

Module IV: l0 lecl[res hours

r
B t ill r,,,ersity, Gre cter N oida
,l-lith.:l ll : l il ::1ci G!vl, r,l U( p r'aJ6sh)
lDt I'; t'l; |, C, 10, 11, Tech
Z one-ll
G rea t.i l,l.ia.r ::01310
 HTML, CSS, Java script, Supporting tools and CMS, lntroduction to MySeL, Learning the MySeL
Data Types, Frequently used string functions in MySeL, Regular expressions and their uses in pHp,
Cookies, Session variable, its session ID management, File handling in pHp.

Text Books :

1. McPeak Jeremy, Beginning Jqvascript (Sth ed.), wox publication,20l5. NBN g78-D rgg03J39.
Reference Books :

Luke and Lqura Thomson, pHp and MySeL l(eb Development (Sth ed.), pearson,
-a^. _1. lfeJli1g
20t 7. tsBN 978-0672329I66.

Assessment Scheme:

Components lnternal Assessment Mid Term Exam End Exam Total

W€ightage (%) 35o/o 30o/o 35o/o l00o/o

)

IS r
e tt Unhrers ity, c reater Noida
.,;i../ l-rndri q.l 2,lof(,i./ q,
lot l{o's 8, 9 10, 11, oi U{ia r Pradesh)
Tech Zone-il
G rc"'atc r Airrid a-201310
 Name of Program Bac hel or o f Tec h n ol ogy (c o m pu ter Sci en ce a lt d E n gi n ee rt n g)
csET390 Data Structures and Al ithms L T P C
Owning SchooUDepartment Department of Computer Sciencc E ngineering 3 0 0 3
Pre-req u isites/Exposure

Course Outcomes (COql

On completion ofthis course, the students will be able to:

col: To explain basic data structures for storage and retrieval of ordered or unordered
data. Data
structures include arrays, linked lists, binary, trees, heaps, and hash tables.
co2: To implement algorithms for the creation, insenion, deretion, searching, and sorting ofeach
data structure.
CO3: To examine and compare algorithms for efTiciency using Big-O notation.

CO-PO/PSO Mappins

PO PO2 PO3 P04 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
I
) cot
6 7 8 9 0 I 2 I
I a 3 , 3
co2 I 2 3 a 3
co3 ) 3 't 3

I =weakly related 2: moderately related 3=strongly related

Course Contents:

Module l; 14 lecture hours

Asymptotic notation, Recursion, Masters theorem, Array storage, Memory allocation in 2D array,
static
vs dynamic memory allocation, Binary search, Array search, traverse, insertion, and
deletions, Linked
list, Linked list modifications (circular, doubly), Traverse, insertion, and deletions in linked list.

Module lI: 12 lectur€ hours

stack representation, Application of stacks, Traverse, insertion, deretions in stack, eueue

representation, Application of queue, Modifications in queue (circular, priority), Traverse, insertion,
deletions in queue, Tree representation, Binary tree, Heap representation, Extract min, search, insertion
operations in heap.

Module III: 16 lectures hours

Graph representation, BFS, DFS argorithms, Divide and conquer argorithm, sorting
techniques, Greedy
algorithm, Coin exchange problem, Frog jump problem (proof of correctness), Dynamic algorithm,
MCM, 0-l and liactional knapsack.

Text

n (
I :ri.': :r; l,,, Grc:tti:r Nr.rida
.r , L'iiy Fr. l.tl)
,l', Ir, il, t.tchZorre_ti
C : .:-' r -il I i'l il l (i
 l.Karumanchi narasimha, Data structwes and Argorithmic Thinkingwith Go (t"t ed.), careerMonk
Publications, 2020. ISBN 978 I 949870909.

l. Cormm Thqnas H, Charles E. Leiserson, Ronald L. Rivest and Clifotd Stein, lntroduction to
Algorithns (4h ed),
The MIT Press, 2022. ISBN 9280262362]105.

Reference Books :

l. D_edov Florian, A Complex Subject Sinply Explained (Rurtime Compl*ity, Big O Notation,
Programhing) (t"t ed.), Amazon Digital Senices LLC - KDp'prini USI 2020. ISBN
9798678017192.

2. Wengrow Jay, A Common-Sense Guide to Dqta Structures and Algorithms (2 ed,), O,Reilly, 2020.
tsBN 9781680508059.

Asses3ment Scheme:

Componenta Internal Assessmetrt Mid Term Exam End Exam Total

-) Weightage (%) 35% '3Wo 3sYo l00o/o

o.w
Benfi'ett Univcrs;t/, Grcater Noida

[, 5i,i[i"' A':U'i'6 : ;11'ig :il'f;T:']i

Greater Noida-201310
 Name of Progrsm Ba c h eI o r of Tec h D ologv (com p u te r Sc te nc e a nd E T I neer ng)
CSET3gI Artilicial ln Ilce L T P C
Owning SchooUDepartment Department of Computer Science Engileerin 4 0 0 4
Pre-req uisites/Exposure

Cou Outcom es (COs)

On completion ofthis course, the students will be able to:

col: Leam the basics and applications ofartificial intelligence, machine leaming and categorize
various problem domains, basic knowledge representation and reasoning methods.
CO2: Design Supervised and Unsupervised Learning approaches for real-life problems.
co3: Develop AI and Machine Learning systems using supervised and Unsupewised Leaming
approaches.

CO-PO/PSO MaDDins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PS03
) 6 7 8 9 0 I 2 I
cor ,,
3 3 3 1
3 3
c02 3 3 3 2 3 , 3
co3 3 3 ,,
3 2 3 3

l:weakly related 2= moderately related 3:strongly related

Course IrteIrts:

Module l: l4lecture hours

lntroduction to AI, history of AI, course logistics, and roadmap, Intelligent agents. uninformed search,
Informed Search, Greedy search, A* algorithm, Hill climbing, best first search. Basic concepts of
machine leaming, Regression.

Module lI: l4lecture hours

classification, Artificial Neural networks, perceptron, Multi-layer perceptron, Back propagation,
) Activation Functions.

Module lll: 14 lectures hours

Evolurionary Algorithms like Genetic programming, Genetic Algorithm, optimizarion of ANN using
Evolutionary Algorithms, Fuzzy Logic, Member ship function, how to improve the model, diversityl
training time, partitions of datasets.

Module tV: l4lectures hours

Measures ofclassification Performance: Accuracy, sensitivity, specificity, confusion Matrices, ROC

curves, Area Under ROC curves, Unsupervised Leaming: clustering, k-means, c-means, Analysis and
Comparison ofmodels.

Studio W k/Laboratorv Er ents:

i ';
t/ (-' ;Ilii1la
_'.
, ,;r. i I i. :jh)
' i.' ': i, I'cf' 'ro're-ll
j:-.'l l' ,t-li'
 Design, analysis, and implementation of programs that leam from experience and project that
includes machine leaming for solving real life applications.

Text Books :

l- Knight Kevi4 Elaine Rich and B. nair, Arti/icial Intelligence (3rd ed), McGraw Hil! Education,
20 I7. rSBN 978-0070087705.
2. Alprydin 8., Introdaction ro Machine Leatning (ird ed_), pHl, 2015. ISBN gZ8-B t 20350286.

Referenc€ Books :

l. Panerson D.W, lntloduction to Al and Expert Systems (tst ed.), pearson Education lndia,20lS.
lsBN 978-9332 551947..
2. Bishop C- Patern Recognition and Machine Learning (tst ed.), Springer, 201 l. ISBNg7g-
0387i 107i2_

Assessment Scheme:
)
Components Internal Assessment Mid Term Exam End Exam Total

Weightoge (%) 35o/o 3e/" 35o/o l00o/"

R ar
B niversity, Greater Noida
j llrrCrr,'.t24 !lCo\4, oiUttar pradesh)
P t'Jo 's 3, 9, 10, 11 , Tech Zone-il
G reater Noida-201310
 Name of Program Bac heor o f Te c h n ol ogli (C o m p u te r Sc t€ n c e a nd E n gi n ee rt n s)
CSET392 Applied Al L T P C
Owning SchooUDepartment Department of Computer Science En gineering 4 0 0 4
Pre-requisites/Exposure

Course Outcomes tCOsl

On completion ofthis course. the students will be able to:

col: understand the need for Artificial lntelligence and the limitations ofconventional methods.
co2: Design, Develop, and Implementation of various AI methods in prolog, and in python for
prediction, regression. classification, clustering, Searching, and decision-making problems.
CO3: Demonslrate the ideas behind seleclion ofvarious Al methods and their use.

co- Maonins

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POI POt PSO PSC)2 PSO3
6 7 8 9 0 I 2
cor 2 3 .,
3 3 2
) co2 2 3 3 2 1
3 I
c03 2 3 3 2 ,,
3

l=weakly related 2= moderately related 3:strongly related

Course ntenLs:

Module I: 12 lecture hours

Introduction of AI : The AI basics, Al problems, The core assumptions of A I, The need of AI over the
traditional methods, the AI Techniques, The level ofthe Model, briteria for success and failure ofthe
models, Artificial intelligence fundamentals, Machine leaming, Human languages technologies.
Distributed systems: paradigms and models for AI, Inteligenr syitems for patteir ricognition, sirart
applications using AI, Computational mathematics for leaming and data anaiysis.

Module lI: I0lecture hours

Algorithms for Heurislic search and state space search, Defining problem as stale space search,
Production Systems, Production Characteristics, Production System Characteristics, And issues in the
) design of search programs, Additional problems. cenerate-and-test, Hill climbing, Best-first search,
Problem reduction, Constraint satisfaction. Means-ends analvsis.

Module lll: T lectures hours

Application ofAI in natural language processing, Introduction, syntactic processing, semantic analysis,
discourse and pragmatic processing, spell checking, Measures of wordNet similarity. Sentiment
analysis and opinions on the web.

Module lV: T lectures hours

Exploring sub-discipline of AI: Machine Leaming, Supervised leaming, Unsupervised learning,

Reinforcement leaming, classification problems, Regression problems, Clustering proulemi,
Introduction to neural networks and deep leaming.

k.
/"
 Module V:
12 lectures hours

Probabitity
and_Bays' Theorem, Cenainty Factors and Rute-Base Sysrems,
::::.],,::1.*T_"jl:g:Dempster-Shafer fieory,
::I^.jlT-^1yr"r, Fuzzy Logic. AI for knowtedge represenrario;, rule:
oased Knowredge representation, procedural and declarative knowledge, Logic-progiamming,
Rorward
and backward reasoning.

Module VI:
8 lectures hours

Introduction to Prolog: syntax and numeric function, Basic list manipulation

functions in prorog,
functions, predicotes and conditional, Input, Output and local variables,
Iteration and ;.r"i;;,
Property lists and arrays, Miscellaneous topics, LISi and other AI programming languages
Text Books ;

l. \tlylf !il: !.4rti/icial Inte igence: A New Synthesis ( tst ed.), Morgan_Kaufmann, 1998. ISBN
978-1558605is0.

) 7.!yt:!_S!y:1,-y! Peter Norvis, ArtiJiciat Ine igence: A Modern Approach (3rd ed.), pearson,
0. tsBN
20 I 978-0 I 36042594.

Reference Books :
I !!t!:n Christopher M, Pattern Recognition and Machine Learning (tst ed.), Springer,
2006.
tsBN 978-t 493938438..

2. Jurafslcy Daniel and James H. Martin gteech & language processing (2nd
ed,), pearson
Education [ndia, 2000. ISBN 978-013t573216.

3. Shalev-Shx,a/tz, Shai, and Shai Ben:David, (.tndersranding machine

learning: From theory to
algorithns (3rd ed), Cambridge university press, 2014. tiAU CZa4IOZStZAZS.

Asgessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 35o/o 30o/o 3svo l00o/o

^",W
Benneli L':i. ,. r;:ly. Grr.:rtcr Noida
(Eji.,-li"h!d lli,- .: ,1..i r^l cl(;!,,/1, oi Uil$ Pradesh)
PIot l.lc r: ll, i;, 1C, 1i, Tech Zone-ll
Grc;:: ior' l(oi,,i::-201 3 1 0
 Name of Program Ba c h e o r of Tec h n ol ogy (c o m p u ter Sc T en ce an d E ]lg I n ee rl n
c)
CSET42O loT: Securi and Attacks L T P C
Owning School/Department D ep a rtm en t o f c o m p u Ier Sc I en ce E n n ee rI n 2 0 2 3
Pre-req uisites/Exposure

C rse Ou es(COs)
On completion ofthis course, the students wili be able to:

COI: Understand about IoT overview including requirements.

CO2: Leam loT related protocols and specifications.
C03: Develop a project of loT mock-up application oftheir own

CO-PO/PSO Mappirq

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POt PSO PS02 PSO3
6 7 8 9 0 I 2
col ,
I
t .,
2 I 2 I
c02 2 , 3 2 2 2 2 I ^, 2
) c03 2 a 3 , 2
.,
3 3 2 3

l:weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 7 lecture hours

overview ofwsN. roT, roT conceptuar Framework, IoT Architectural View, Technorogy
Behind IoT,
Sources of IoT. M2M communication. roTA42M systems Layers and
Design s-tandardization,
communication Technologies, Data Enrichment, oati Consolidation and Devi-ce
Management at
cateway. Examples of IoT, Ease of Designing and Affordability. use case studies: Smart
Hoire, Smart
City, Precision Agriculture.

Module Il: 7 lecture hours

lels]ng tle Real-world using Anarog and Digitar sensors, Industriat IoT, Automotive IoT, Actuator,
RFID. Technology - Principles, Architecture, Apprications & components, web of rhings of RFIDsI
cloud computing Paradigm for Dara Coflection, storage and Comjuting, Everything
as a-service and
) Cloud Service Models for loT.

Modul€ Ill: S lectures hours

Introduction, web communication protocors: Constrained Apprications protocor (coAp),

Lightweight
Machine-to-Machine communication; Message
eueue Teremetry Transpon (Merr). IntroJuctiorito
Internet conneclivity Principles, Internet connectivity, lntemer6ased communication,
Ip Addressing
]q
tle ]or, Media Access contror, 6LowpAN and ioRawAN. Apprication Layer protocors: Hiip]
HTTPS, FTP and Telnet.
Module lv: s lectures hours

Security and Privacy Requirements, Threat Anarysis, toT Layered Attacker Moder,
Access contror and
Secure Message communicalion, Security Modirs.roT Hardware (deveropment
Boards): Raspbe.ry;i
Arduino, NodeMCU, etc.SDN, NFV, Humanoid, Drones, 5G.
 Studlo Work/Laboratorv Exneriments:

Network programming hands on guide. Hands-on exercises on IoT hardware and software. Develop
loT Capstone hoject.

Text Books :

l. Kanal Raj, lfiemet o/ Things: Architectare and Design Principles (fted-),TMH

Publieatiotrs,
20 I 7. ISBN 97 8-9 3 52605 2 2 4.
2. Mddisetti Vijay and Arshdeep Bahga, Internet ofThings (A Hands-on-Approach) (ft ed.), VPT,
20I5. ISBN 978-099602sst s.

Reference Books :

l. Ovidiu Vermeson & Petet Friess, lntemet of Things: Cowerging Technologies for Smart
Etnitonments and Integrated Ecosystems (lst ed,), River Publishers Series in Communications,
20 I 7. ISBN 978-87929827 3 S.

) @s@c:
Components lnternal Assessment Mld Term Eram End Exam Totel

\ elghtage (%) 35o/o 30o/" 3So/s lOOo/a

0
ett Univers ity, Greater
l;L,l;i
, l.l;:d,nt,cl: ,i N oida
iot No' s8,3, 10 ol1Govi, oi Uliaf P r;desh)
Grearer l{oi da-20"1 1, Tech zone-ll
310
 Name of Program Ba c h e lo r o f Tec h n ol ogy (Co m p u ter s ct e n c€ a n d E n gr n eert n e)
csET424 VR & 360 Video Production I, T P C
Owning SchooUDepartment De pa r tm e n t o t C om p u te r s c I e n ce E n gr n ee r n g 2 0 2 3
Pr€-requisites/Erposure

Course Oulcomes /Cf)st

On completion ofthis course. the studenls will be able to:

COI: Leaming to create a VR use flow.

CO2: Using Tools and Caming platforms to build VR experiences and 360 Video production
co3: Make next steps to start buirding an VR experience using ratest toors and
technorogies.

CO-PO/PSO Maooins

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POI POt PSO PS02 PS03
6 7 8 9 0 2 I
col 3 3 3 3 3
co2 3 3 3 3 3 3 3 3
c03 3 3 3 3 3 3 3 3

l:weakly related 2= moderately related 3=strongly related

Corr rse Con n ts:

Module l: g lecture hours

Intro to design: understand basic vR design principres such as iteration, user testing,and
documentation, Design foundations, ergonomics: Create a VR User persona,
d"rign an ergoromil'Vi
experience, create comfortable vR Text, set the scene and first
user test: create-a vR te"sting scene,
Create your first User Test, Document your first VR experience.

Module ll: lOlecture hours

lntroduction to Immersive Media: understand the principres of immersive
360 media such as sphericar
by critically reviewing professional 360 content, Undersland the basic workflow
?l?::lig,
360 video, Applying Metadata to 36-0 video and pubrishing thar contenr,
of *eatin!
Anaryze a variety ofexistin!
360 video content, Analyze footage for the-varioui techniqies, rips, and pf"r"irgi
.) tricks,t*lptirg
create a script for 360 content, pran-a 360 shoot. Edit stripis io match equipment
uia"ia
urag"t, iot
cameras: Exploration of existing 360 cameras, Differentiate between
monoscopic and sterelscopic
capture, Explore different equipment and techniques used for audio
capture, Exploie righting techniques
for 360 video.

Module lll: l0 lectures hours

stitching: sritch 360 video using Autopano Video pro, Brend, weighr. synchronize,
and stabirize
footage, Editing Basics: Edir footage in Adobe premiere, create trans'irions
in 360 viieo, Advanced
Editing: color correct 360 Footage, Add points of interest using Gopro's prugin,
Advanced stirchin!:
Use Autopano Giga to edit and refine stitching.-using cont;l points and masks, Gain a deepJr
understanding of how blending works, Spatial Audio: c-ut spatiarized
audio, prace souna in :o spice
using. Google audio spatiarizer, rntera;tivity with Gaming pratfo..:
create an interactive 360
experience using Gaming pratform's video prayer, ate prayer Jontrols
and branching storyhnes using u
custom 360 video player.
 Studio Work/Laboratory Experlments;

The laboratory of 360 Video hoduction is designed to provide a practical exposure to the students about
the concepts and topics taught in the classroom sessions. Implementing ths learnt concepts using
An&oid and Unity will help the students to have a better understanding ofthe subject.

Text Books :

1. Wohl Michael, The 360" Yideo Handbook: A step-by-slep guide to creating video for virtual
reality (YR) (1 ed), MichaelWohl, 20 I 7. ISBN 978-0692904282.

2.Tustain Jonathon, The complete guide to Vr and 360" Photogaplry (1 ed.), llex Press,2018. ISBN
978- 1781575390.

Reference Books :

l. Tricart Celine, yirtual teality Filnmaking (l ed.), Taylor and Francis, 2018. ISBN 978-
11382ji9s9.

) 2. Bucher John, Storytellingfor Virtaal Reality (l ed.), Routledge, 2018. ISBN 978 I138629660

Acc@slelqq:
Compotrents Interml Aise$ment Mld Term Exam End E:am Total

lVelghtage (%) 35o/o 3@/6 35o/o t 000/.

R stroi'
B n!it t.lni\i er'r', i1,,. Grert,:r' ll'-'lda
' ,f Gr .1. (i r.'. i' P, rile:lr)
'i'l -teclr Z':r rc-l
(E
P I, 0, ,
Gr -at,:r i',i.',i.i:. :lJ1 3i0
 a
Sp ecta lization
) Electives:
Gaming and
Virtual
.l
Reality

At
,/
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET425 Augmented Reality & AR Core L T P C
Owning SchooYDepartment Department of Computer Science Engineering 2 0 2 3
Pre-req uisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI: To identify different types of AR experiences, tools and platforms used in the AR landscape
CO2: To break down complex AR concepts to make them easy to understand.
CO3: To start building an AR experience using ARCore and other tools.

CO-PO/PSO Manoinq

PO P02 PO3 P04 PO5 PO PO PO PO POI POI POI PSO PSO2 PSO3
6 7 8 9 0 I 2 I
col 3 3 3 3 3
) co2 3 3 3 3 3 3 3
c03 a 2 3 2 3 2 3 3 3 3

| -weakly related 2 - moderately related 3- slrongl, related

Course Contents:

Module I: 6 lecture hours

AR today: smartphone vs. standalone, Google AR, AR for shopping and retail, AR for business, AR
for social media, AR for gaming, AR for education, AR for healthcare, AR for non-profits, AR reality
design guidelines, Physical environment, virtual environment, environmental limitations, movements,
types of moyements, accessibility, Tracking in AR, outside-in tracking, inside-out tracking, motion
tracking.

Modrl€ ll: 8 lecture hours

Light estimation. Anchors, lnterface issues and lack of UI metaphors, Constraints of occlusion and
shading, AR required vs AR optional, Runtime considerations, Performance considerations, Run AR
) Apps in Android Emulator, Camera configuration, Buffering Camera frames, Sharing camera access to
ARCore, Working with Anchors, Creating play instant app, ARCore as input for Machine Leaming
models

Module lll: 8 lectures hours

Enable call logging for Android, Disable call logging for Android, Display call logs, Recording and
playback in AR, Add custom data while recording, Depth in ARcore, Distance and depth offield, Depth
images, Use ofRaw depth, Lightening estimation, Environmental HDR mode, Ambient intensity mode.

Module lV: 6 lect[res hours

Augmented lmages APIs. Augmented Images APIs' Capabilities" Requirements of Augmented Images
APIS, Creation of image database, lmage tracking, Cloud Anchors on Android, Augmenled Faces on

L'
i il:; ,.':
. . . , Grenicli
rt'rr', i\iniCa
(
. ,/,. .i t_,Li ..lr tii)
F' . ,'1, 1 i, lccir 2lorre-ll
C . :_l i:r t0
 Android' custom textures and 3D models for Augmented Faces, ARCore SDK for unity, ARCore
sDK
for Unreal.

Studio Work/Laboratorv Exoeriments:

Experiments using scene viewer to display interactive 3D models in AR from an

Android app or
browser, AR Dragon using ARCore, AR Drone using ARCore, AR Core drawing, Creation
of
augmented faces, Drawing a virtual dancing character with space sound.

Text Books :

l. Lanham Micheal, Leam ARCore--^Fundamentals

dGoogle ARCore (l ed.), packt pubtishing,
201 8, ISBN 9781 788833639, I 788833635.

Refercnce Books :
l' Linowes Jgnathan, Krystian Babirinski, Augmented Rearity
for Deveropers: Buird practicdr
1iea.1, packt pubrishii[,
Realttv Applications with unitv, ARCore, ARKit, ina vu1oria
7t:ryellgd
20t 7. rsBN 978178728804t, t787288048.
)
Assessment Scheme:

Components Intsrnal A$sessment Mid Term Exam End Exam Total

Weightage (%) 3s% 3Oo/o 35o/o toov.

-l

R
Be t Universi ty , Greater Noida
(EsiiLj; ,it.i
LJriiJ. /^,ai 2 of Go!,t, of Utiar p
Plot I ii.:'l; ii, 9, 10 11 Tech Iadesh)
r- ^11'r tn , Zone-ll
 Name of Program Bachelor ofTechnology (Computer Science and En gineering)
CSET426 Building Social VR with 3D Characters L T P C
Owning SchooUDepartmert Department of Computer Science En gineering 2 0 2 3
Pre-req uisites/Exposure

Course Outcomes (COsl

On completion ofthis course, the students will be able to

cot : To understand the psychology ofsocial interaction and the practical skills to implement it.
CO2 : To make characters that can respond to players, speech and body language.
co3 : To create ayatars: the virtual representation ofother players, and agents: computer-controlled
NPC characters.

co-Po/ MaDDins

PO Po2 PO3 PO4 PC)5 PO PO PO PO POI POt POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
cot 3 3 3 3 3
) co2 3 3 J 2 3 , 3
co3 3 3 3 3 3 3 3 3

l=weakly related 2: moderately related 3=strongly related

Course ontents:

Module I: 6lecture hours

Social VR and virtual characters, virtual characters Realism, Agents and Avatars, Applications of
virtual characters, character Animation, cristina, Designing virtual characters, Importing a virtual
character to unity, Embodiment in unity using Mobile vR, skeletal Animation, Motion capture,
Capturing posture, gesture, and body language, Applying Motion Capture Data onto a Virtual
Character, Applying Speech inleraction in characters.

Module Il: g lecture hours

) Markerless motion capture, Bodily communication, psychology for facial expression, Facial
Expression in unity, Blinking and Lip sync Animation, caze in Social lnteraction, Gaze Interaction.
other Facial Features and rheir Psychological Effect, psychology Behind Social Interaction,
Challenges in Human-Avatar Interaction, Challenges in Human-Agent lnteraction, Evaluation ofsocial
lnteraction in vR, Human-avatar: social VR apps. Embodiment - implementation and psychological
effect, natural lnteraction, Magic lnteraction, Active and passive Interaction, Affordances.

Module ll l: T lectures hours

VR Interaction Theory, standard HMDs, navigarion in VR, Real walking, Redirected walking, walk-
in-Place, virtual navigation, objects Interaction, object lnteraclion within Reach, Hyperna-tural
Interaction, Magic Interaction, Evaluation Metrics, physics lnteraction, physics objects, physics
objects in unity, Physics in VR, Physics Inremction in unity with NewtonvR, state Machines. state
Machine Interactions in Unity.

"': - ',.,, l'-ii.aitlor

l,,tnida
'-,t'tt
-li-..tlr , l -irl
, i 1,, ,lons_1tr
 Module ry: 7 lectures hours

case study: Popular interaction-based products, Graphical User lnterfaces in vR, Abstract Interfaces,
Diegetic and Non-Diegetic UI, Gestural Interaction, Issues in vR lnteraction, uX ofvR, tmmersedvR,
Spatial.io, EngagevR, Mozilla Hubs, Unity User Interfases, Unity gesture plugin, Bespoke VR,
VFairs,
INXPO, AltspacevR, High Fidelify, Sansar, Rec room, and Webaverse.

Studio Work/Laboratorv f, xoeriments:

The experiment in Unity: loading designed character, Skelton animation, movements, and
interaclion.

Text Books :
l. Pangilinan Erin, steve Lukas and vasanth Mohan, cleqring Augmented ahd yirrual Realities (t
ed.), O' Re illy Publis hers, 20 I 9. ISBN 97 A- t 492 044 t 92.

Reference Books :
)
l. Bowman Doug A, Ernest Kuiiff, Joseph J Laltiola, Jr and lvan poupyrev, 3D lJser lnterfaces,
Theory and Practice (2 ed), Pearson Education, t)9A,2017. ISBN 978-01340J4324.

Ass€ssment Scheme:

Componetrts Internal Assessment Mid Term Exrm End Exam Totil

Weightrge (%) 3sYo 30o/o 35o/o 100%

aK,^,
6enr'.r:lt u, ri,,rcrsity, Greater Noida
(t-:. l.-' j | ,:.:r. .:12,1 ofr;oy..,, ,1.:ipradesl,)
l-1.). i-J:'r- 1, !,
i 0, 1 .1, Tuch Zone_il
()I..,1..,- l. Ot:, r.2il1310
 Name of Program Bac hel or o f Tec h n o lo ry ( o m p ut€ r Sc te n c e a n d E n gi n ee r I n
c c)
csET427 Virtual Reality: lnt€rface. Application and I- T P C
Des n
Owning SchooUDepartment Depa rtm € n t o f C om p u t€ r Sc tence E n gr n ee rl n 2 0 2 3
Pre-requisites/Exposu re

Cou Outcom€s (COs)

On completion ofthis course. the students will be able to

COI: To demonstrate an understanding of fundamental techniques, processes! technologies, and

equipment used in immersive virtual reality.
CO2: To explore the materials and processes used in immersive virtual reality.

CO3: To show a basic awareness and understanding of historical and theoretical contexts relevant
to
immersive virtual reality and demonstrate an understanding of the importance of critical and
self-
reflective practice.

CO-PO/PSO Mappins

) PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PSC)2 PSO3
6 7 8 9 0 I 2 I
col t I
c02 I t I 2 2
c03 2 3 2 , !
l:weakly related 2= moderately related 3=strongly related

Cou rse ontents:

Module l: g lecture hours

vR Goals and definitions, Historical perspective, Birds-eye view, ceometry of virtuar worlds,
Geometric modelling, transforming models, Matrix algebra ind 2D rotations, iD rotations and yaw,
pitch. and roll, Axis-angle representations, eualemions, converting and murtiprying rotations,
Homogeneous transforms, the chain of viewing transforms, Eye transforms, canonical
viei transform,
viewporl transform. Hardware Technologies for 3D usei lnterfaces: visual Displays Auditory
Displays, Haptic Displays, choosing output Devices for 3D User rnterfaces.3D user'rnierface Inprir
) hardware: Input device characteristics, Desktop input devices, Tracking Devices,3D Mice, Sp;;;i
Purpose Input Devices, Direcr Human rnput, Home - Brewed rnput Devices, choosing
Input'Devices
for 3D Interfaces.

Modlle ll: g lecture hours

Light and optics: Three interpretations oflight, Reriaction, simpre renses, Dioptres, Imaging properties
of lenses, Imaging properties of len^ses, Lens aberrations, optiiai system ofeyes..Visuir Ftry.iotogy,
Photoreceptors, Enough resolution for vR, Light intensity, Eye movements, Eye
movement i..re. io,
vR, Neuroscience of vision. Visual Perception: Depth percepiion, Motion perception, Frame rates and
displays.

Module lll: t2 lectures hours

t::
i'rrl.':..t ;;rv, Grt. ::t:r l,,ioid:i

,:jtle,;#;;,'2#!li
 Tracking Systems: orientation tracking, Tirt drift correction, yaw drift
correction, Tmcking with a
camera, Perspective n-point problem,_ Filtering, Lighthouse approach.
viruuf n"na".inti Vi.uui
Rendering-overview, shading models, Rasterizaiion, Fixer shading,
VR-specific probrems, bistortion
shading. Posr-rendering image warp.

Module IV:
4 lectures hours

Auditory perceprion, Auditory locatization, Rendering, Spatialization and

Lll::::il ,llT'"logy.
olspray. Lombrnrng other senses. Interfaces: Interfaces -overview, Locomotion, rianipuration,
System
control, Social interaction, Evaluation ofVR Svstems.

Stud io Work/ bora ExDerim €nts:

The Iaboratory of virtual rearity is designed to provide a practicar exposure

to the students about the
cllcfpls a1d topics taught in the crassroom sessions. Imprementing tire
reamt concepts using python
will helpthe students to have a better understanding of the subjectlio Modeling
and .r.fdr; Biii
Fleming, Ehevier (Morgan Ka VR programming_ti Int.oOu.ing fava
:O, toaaln'g und ,;n6ri;tin;
external models, using a lathe to make shapes, programming_'il: 3D Sprites,
aru:mated 3D'sfritei
particle systems.
)
T€xt
t!::,!i:.*:l!,:y.* and.Atan Crais. un-derstonding Virtual Reatity. tntetface. Applicorion
and
uestgn (2 ed.), Morgan Kaufmonn. 2018. ISBN 979_0l2gl8j99t.

2 yirtual Reality ( I ed.), Cherry

!1^592 4otn, MineqaJi Lake publishing, 20 t 8. ISBN g7A_
1531129917.

Reference Books :
l.Greengard samuer, virtuar Rearity (r ed.), The Mtr press, 20r9. rsBN 978-0262351684.
2. Tasgin 2., Yirtual and Augmented Reatity (l ed.), Rourledge, 2022. ISBN g7g_1527548225

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

Weightage (o/o) 3s%

) 30o/o 3s% l00o/o

R eg raiI
,?':: l'.. I '. r.'' .'-'..: r.cr- ,r r t,:.i.1 ,

i
Fict ,r, .,: , ', r. ;t, t,lt,:lo,,u
tl
Ur,la:,- I i.,.j- l--r'il l0
 Name of Program Bac h e lo r of Tec h n ol ogy ( C o m pu ter s ct en ce an d E n gi n ee rl n
c)
csET428 s ial To ics in AR and VR t. T P C
Owning SchooUD epartm€nt De pa rtm e n t o f C om p u te r Sci en ce E ng neerI ng 2 0 2
Pre-requisites/Ex posure

Cours e Outcomes (COs)

On completion ofthis course, the students will be able to:

COI : To familiarize and leam about the latest trends and research in the field.
co2 :To equip themselves with the conceptuar and practicar experience offew ratest
methods, toors,
technologies or algorithms in AR and VR.

CO-PO/PSO Maooinq

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PS03
6 7 E 9 0 I 2 I

)
col J I 3 1
c02 3 t 3 3 3
I 3 3

l=weakly related 2= moderately retated 3=strongly related

Course ntents:

Module l: 28 lecture hours

This course covers the cutting-edge topics in AR and vR, and these modures wir be
chosen bv the
instructor based on the requirements and relevance at that point of time. These modules
need to be
relevant to the industry and start-ups will also incrude rerated case studies.
use cases and
implementalions scenarios. students wifl be working on rab work and projects
to get rear hands-on
experience ofthese topics and modules.

Studio W orWLsboratorv ExDeri ments:

students will gain practical experience by using toors and technorogies rerated
to AR and vR.
) Assessment Scheme:

ComponeIlts lnternal Assessment Mid Term Exam End Exam Total

Weightsge (%) 3s% 30% 35o/o 1000/"

(.i
 Name of Program Ba c h e lo r of Tec h n ol ogy (C o m p u te r s ct en ce a n d E n gr n ee rt n s)
CSET429 N€twork Drivers and Protocols L T P C
Owning School/Departmena De pa rt m e T t o f C om p u te r s ct e n c e E n n ee r I n 2 0 2 3
Pr€-requisites/Exposure

Cours€ Outcomes (COs)

On completion ofthis course, the students will be able to

col: To explain purpose, types and configuration ofvarious network drivers and
deriver in-depth
ofthe netuork protocols.
knor.l ledge
CO2: To develop a network device driver from scratch.

CO-PO/PSO Mannino

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POt POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
cot ! J ) 2 I I I 3 2 2 I I I 3 3
) co2 I 2 ) ) 2 2 3 ) 2
.,
I

l=weakly related 2= moderately related 3=strongly related

Cou rse Con nts:

Module l: l0lecture hours

osl model, Application Layer protocors: Boorp: Bootstrap protocor, DCAP:
Data Link Switching
Client Access Protocol. Dynamic Host Configuration protocol. DNS, FTp, HTTP, S_HTTP:
^DHCp:
secure Hypenexr Transfer protocol, rMAp & rMAp4, IRCP, LDAP, M|ME, secure
virup, nar:
Network Address Translation, NNTp: Network News Transfer protocor, NTp: Network
rime prorocor,
PO,P::gj-Oj3,Il9gin: Remote Login in UNIX Systems, RMON: Remore Monitoring MIBs (RMON
and RMON2), SLP, SMTP. SNMp (SNMpvt, SNMpv2 SNMpv3, SNTP,
i
TELNE-T,TFTP, Who is
(and Rwhois) Presentation Layer pJotocoh: Lpp: Lightweight presentation protocor.
session Layer
Protocols: RPC: Remote procedure Call protocol-

Module ll: 9lecture hours

) Transport Layer Protocols, rror:rSo rransport service on top ofrcp, RDp:
Reriable Dara protocol,
RUDP: Reliable user Datagram protocor, Introduction to transport layer, TCp, UDp,
Network Layer
Routing Protocols, BcP (Bcp-4): Border Gateway protocor, Ebp: Exterior
Gareway protocol, odpF
and RIP, lPv4, IPv6, Mobile lp, naRp and NHRp, R.lpng: Routing Information protocol
next genemiion
for lPv6, RSVp, VRRP, Multicasring protocots: MARS, MBCP: MOSPF, MSDP, -Multicast_
MZAp,
Scope Zone Announcemenl Protocol.

Modlle lll: g lectures hours

Network. security Technologies and protocols: Kerberos, Network Drivers: Bus

Infiastructure,
Network hardware driver, block drivers and network drivers, Designing the kernel
interface for network
drivers. Network Simulator NS3, introduction and programming."

Studio W orli,/ Laboratory ExDe riments:

Explore the various network protocors. (HTTP, FTp, TCp, etc.) using wireshark.
Tracing using
wireshark. In-depth 'Socket programming' in Java for communicatioi in a network.
Uoisockei

', t: .-,,)
['i .,
' I::i iO
 TcP socket programming. Development of a network
fos-1,r.inq,
Network.device
device driver fiom scratch.
Driver examples contd. Mapping the vo registe$, Hardware reset and initialization.
use of NS-3 for simulating network protocois. lts-l: simui-ating a various
wireress and wired LAN
topology.

Text Books :
l. Y:F filltf_1., _Handbook of Server Management and Administation (t't ed.), CRC press,
20 I 9. ISBN 978_1 35 I 08 I 207.

Reference Books :
l. lfig:l:! Rai, Handbook of Heterogeneous Networking (t't ed.), CRC press, 2018. 1SBN gZ8_
135108t078.

Assessment Scheme:

Componetrts Itrternal Assessmstrt Mid Term Exam End Exem Total

Weightage (%) 3,Vo 3oo/o 3sYo l00o/o

)

*.k{*/
Ben1ffi Urriver:ity, Greator Noida
ij i6t 24 olGgvi, ol Lriiar p€oesh)
(EslJblish.J Ui!
Piot l{o's 0, 0, 10, 11,]-ech Zone-il
Greater tJoiCa-201 3'1 0
 Name of Program B a ch e lo r of T ech n ol ogy (C o m p u er Sc en ce a n d E ng
n €er ng)
CSET43O D tal Si al Processi ng L T P C
o n IN Sch oo YDe pa rtm en t D ep a rtm en o f Co m p u ler Sc I EI ce En grn ee rt n 2 0 2
Pre-req uisites/Ex posure

c rse Oul comes f

On completion ofthis course, the students will be able to:

col: To design FIR and IrR filters by hand to meet specific

magnitude and phase requirements.
Co2: To perform Z and inverse z transforms using the definitiois,
Tables of Standard Transforms
and Properties, and partial Fraction Expansion.
CO3: To design and implement digital filters by hand and by
using MATLAB.

CO-PO/PSO Mappins

PO P02 PO3 PO4 PO5 PO PO PO PO POI POr POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
COI 3 3 )
) coz 3 I 3 2
3 2
,, 3
c03 I .,
3

l:weakly related 2= moderately related 3:strongly related

Course Contents:

Module I:
9 lecture hours
Course Structure/Handout Assessment Mechanism, Signals
and Systems, Discrete time complex
exponentials signals, Elements of digital signal pro"rrrilng,
feclnotgy for DSp, Building bl;;il i;
represent a digital system. Types of DSp pio""iso.s,
Reirsive and non-recursive systems, Canonic
and.Non-canonic structures, IIR Firter Rialization, Direct
rorm,-Cascaa" rearization, paralrer form
realizalion, Ladder structures, continr-ed fraction
Filter Realization, Direct, Cascade, FIR Linear pfr^"
"xparsion,-
n""ri*i",
of a ladder structure, FIR
n"ufirutior,'iifnit" f rprf." n..p"r.. Egfi"i
(llR) Filter Design, Low pass Fitters, High pass Fih.r., Bu;t;;;; 'Fiit;r..

Module Il: I I lecture hours

Impulse Invariant Transformalion. Bi-Linear.Transformation,
Anarog Firters, Butterworth, chebyshev,
Finite lmpulse Response Firrer lFrR) windowinj ana'rf;e nectangular window. Gibb,s
phenomenon, Hamming Hanning, Blackman-n, -Design,gurtl.t,
fui.-"., iihei-oesigns Using Windows, Finite
word-length efrects in digitar firters, coefficienr quanrizarion
enof noise-truncation and
rounding, Limit cycre osci[ations-dead band effects, oiscrete [uantization
]ourier Transform, Fast Fourier
Transform, circular convorution,
Linear convotution usirg ci;ia.convorurion, Decimation
(DIT) Algorithm: DFT, FFT, Decimation in Frequency (D"tFjeigorirf,r, in Time
DFT, FFT.
Module III: E lectur€s hours

Z-Transform:.
.
Definition, Region of coNergence (RoC) , Ztransform properties, Inversion
methods: partial fraction expansion, power series,bonto*
int"grui ,*inoa_ **"f ity, i""i"rii"i"g;i
method: stability, lmplications on pole locations.
 Studio Work/Laboratorv Exoeriments:

Laboraiory work involves developing signal processing systems on a personal computer and using them
with both real and simulated drta. Generally, MATLAB and DSp processor are thi working plaiform.

Text Books :

l. Lathi B.P. and Roger A green, F,ssentials of Digital Signa! procusing (l

ed.), Cambridge
University Press,20l4. ISBN 978-l t07444454.
2. S Salivahanan, Digital Signal Processing (4th ed.), McGraw-Hilt Education, 2020. ISBN g7g-
935316743 t.

Reference Books :

l. Hohon Thomas, Digital Signal Processing principles and Applications (1"' ed.), Canbridge
University Prus, 2021. ISBN 978-1108290050.

) Assessment Scheme

Components Internal Assessm€nt Mid Term Exam End Exsm Tot.l

We lghtage (%) 35o/o 3oolo 35% l00Yo

fuk,,",
,Bennett University, Cr. :tter l\rcirl?
Lq'ablshrd Und., ,;cr:.lai
( ..i,r,;uru,.r e1-.h)
Plot No's 3, 0, 1 0, 11, Tech Zotie-ll
Greater NoiCa-20i -? i O
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET43I Special Topics in Computer Science L T P C
Owning SchooUDepartment Department of Computer Science Engineering 2 0 2
Pre-requisites/Exposure

Course Outcomes (Cos)

On completion of this course, the students will be able to:

COI : To familiarize and leam about the latest trends and research in the field.
CO2 : To equip themselves with the conceptual and practical experience of few latest methods,
tools, technologies, or algorithms in Computer Science.

CO-PO/PSO Maooins

PO P02 PO3 PO4 P()5 PO PO PO PO POt POr POI PSO PS02 PSO3
'7
6 8 9 0 I 2 I
col 2 3 3 I I 2 I 2 I 2 2 t
)
cC)2 2 I 1 t I 2 1 2 I ) I t
l=weakly related 2: moderately related 3:strongly related

Course ontents:

Module l: 28 lecture hours

This course covers the cutting-edge topics in Computer Science, and these modules will be chosen by
the instructor based on the requirements and relevance at that point of time. These modules need to be
relevant to the industry and slart-ups will also include related case studies, use cases and
implementations scenarios. Students will be working on lab work and projects to get real hands-on
experience ofthese topics and modules.

Studio WorldLaboratorv Experiments:

Students will gain practical experience by using tools and technologies related to Computer Science.

Assessment Scheme:

)
Components lnternal Assessm€nt Mid Term Exam End Exam Total

Weightage (%) 3svo 300/" 3syo l00o/o

r- l\j: l:
,,_t;t,a.a., -it
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET432 Advance Microprocessors L T P C
Owning SchooUDepartment Departmert of Computer Science Engineering 2 0 2 3
Pre-req uisites/Exposu re

Course 0utcomes (COs)

On completion ofthis course, the students will be able to:

COI : Understand the functionality of Von Neumann architeclure to design advanced

microprocessors systems.
CO2 : Familiarize with the internal structure ofmotherboard and its components.
CO3 : Design and use new interface techniques principle to access the peripherals.

CO-PO/PSO Mappins

PO PO2 PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PSO2 PSc,3
I 6 7 8 9 0 I 2 I
) col 3 2 2 I 2
co2 3 2 2 I 2
co3 , 3 3 3 ", 3 3

l:weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: 8 lecture hours

Introduction Basics of Von Neumann Architecture and the early Microprocessors, CISC and RISC
concepts.

Module ll: 8lecture hours

Parallelism in
Processor Architecture: Pipelining, Super-scalar, Super-pipeline and VLIW
Architectures, Low-power Architecture; Built-in Multiprocessing supportl Co-processors.

Module lll: 6lectures hours

Processor Architecture with hierarchical memory organization: Cache memory, Virtual memory; Built-
)
in Multi-user and multitasking support in l6-bit and 32-bit microprocessors, Built-in memory mapping
and management support; Evolution of platform architecture.

Module lV: 4lectures hours

Special-purpose processor Architectures: Signal processing Microprocessorsi Communication
processors; Case studies with contemporary Microprocessors.

Studio Work/Labo torv F,xneriments:

ln Iab students will perform experiments in assembly language. Students will implement code for RISC
and CISC architecture, they also write code to perForm parallelism in processor architecture pipelining,
super-scalar, super-pipeline. They can create application specific processor from scratch as project.

Text Books :
 l. Hall D. l/., Microprocessor and Interfacing Progrsmming and Hd,'dware (2 ed.), McGraw Eill,
1 99 I . ISBN 978-00702574:29.

Refercnce Bcolts :
l. Bh:urchandi K M, A K Roy, Advanced Microprocessor and Peripherals (3 ed.), Mcgratt Hill, 2O12.
iSBN 978.12590061i5.

Alrsscaxls$srge:

ComponenG Int€rnal A$essment Mid Term Exrm End Exsm Totrl

Wetghtage (%) 3504 3tr/o 31Yo 100%

a"si"tfr/'
ff,+ftfif:j{rd'f iffif#}i
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET445 Continuous lntegration & Deployment in l. T P c
DevOps
Owning School/Department Department of Com puter Science Engineering 2 0 2 3
Pre-requisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI: To afticulate continuous integration and continuous deployment pipeline. and an automated
deployment pipeline.
CO2: To examine the continuous integration tools. jobs, and performance of integration testing.
CO3: To implement the continuous integration and continuous deployment.

CO-PO/PSO Maooinq

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POt PSO PSO2 PSO3
I 6 7 8 I 0 I 2 I
col 2 3 2 3 3 3
co2 3 3 a 3 3 3 3
cC)3 2 3 3 2 3 3 3

l=weakly related 2: moderately related 3=strongly related

Course Contents:

Module l: 7 lectu re hours

Continuous Integration and Continuous Deployment, CI Pipeline, CD Pipeline, CICD Components,

CICD roles, CICD Cloud, Continuous Integration on SVC, CI Build Cycle, Architecture.

Module II: 6lecture hours

Automated Integration, Automated Vs Manual Cl, Installation and Configuration ofCl Tool (enkins),
Creating Jobs, Running the lobs, Build Deployments, CI Documentation principles, Documentation of
Tool discussed. CD Build Cycle, CD Architecture.

Module lll: l0lectures hours

Automated Delivery, Automated Vs Manual CD, Continuous Deployment, Continuous Deployment
) Requirement, Continuous Deployment Components, Continuous Deployment Build Cycle, Continuous
Deployment Architecture, Automated Continuous deployment, Automated Vs Manual Continuous
Deployment, Continuous Integration Vs Continuous Delivery Vs Continuous Deployment, Industry
Perspective of CICD, Bit Bucket in CICD, Business models of CICD.

Module4 lV: 5 lectures hours

CICD Pipeline security, lssues. and challenges in security, CICD in Agile Software Engineering, CICD
for microservices, Advanced CICD Overview.

Studio Work/Laboratorv Exoeriments:

The lab work demonstrates various programming methodologies like extreme programming, pair
programming and test-driven development for designing, testing, and refactoring and illustmtes
automation testing and continuous integration with different tools.

W
 Text Books :
l. Rossel Sande1 Continuous Integration, Delivery, and Deployment (lst ed), Packt Publhhing Ltd
2020. ISBN 978-t 787284I80.

2. Hornbeek Mmc, Engineering Devops: From Chdos to Conlinuous Improvement and Bryond (lst
ed.), BookBaby, 2019. ISBN 978-154i989618.

8e@-:
l. Swmtow Paul, Contiruous Delivery and DevOps - A Quickstart Guide (ird ed.), Packt
Publishing Linired, 2020. ISBN 978-l 788995474.

4$9!c!EgEtsslel[s:

Components Internal Assessment Mid Term Exam End Exam Totd

Wetghttge (o/o) 35o/o 3@/o 35o/o liWo

Regi r
Ben t Universi ty, Greater Noida
(Eetrblislred Un der/\ct 14 of f-iJvt, ol U (tar Pradeeh)
Plot No's 8, 9, 10, 11, Tec h Zone-ll
G reater Noid3-201310
 Name of P rogram Bac h el or o f Tec h n o logy (c om p u te r s ct en ce an d E n gi n ee rt ng)
csET446 Server-Side I) evelopment Frameworks:
L T P C
Ex ress & S n
o wn ng s c h o o U Depa rt m e n t De pa rtm en t of C o m p u te f Sc I en ce E n gi n €e rt
ng 2 0 2 3
Pre- req u isites/E x p os u re

Co urse u es( s)

On completion ofthis course, the students will be able to:

col: To articurate the Express which is a minimar and flexibre Nodejs

web apprication framework
that provides a robust ser oIfeatures for web
and mobile appti.ution..'
co2: To examine server-side devetopment ofweb apprications
using Spring liamework using Java
language.
CO3: To make use ofthe interaction with backend
databases such as mongo dB, MySeL,postgreSel
with Express and Spring applications.

CO-PO/PSO Maooinq

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POr PSO PS02 PSO3
6 7 8 9 0 I 2
col 3 3 3
I

c02 3 3 3
1 ,
3 3
co3 3 3 3
3 3 3 3
3 3
l:weakly related 2= moderately related 3:strongly related

Course Contents:

Module I:
T lecture hours
lntroduction to Fu, stack Deveronment, Server-side
Deveropment: Node, Node modures and the Node
HTTP server.. Third pany modules: mongoose. angular.
reacl. express, npx. npm. brew, http server
usage and_options. Express fiamework. nfSt
t ntpiesenrution iutJ irunrf.r. (REST))
Apt server with
o*t out, detete, Node serv., *ttr,r e.pr"*, p".trliii.ier
r"rtirg automation, Monso
S;Tiij;lil,
)
Module lI:
T lecture hours
lnteracting with MongoDB from a Nodeapprication, Insta, mongo dB
Connecr to clienr. euery execution fiom script ni" ir.al"r"rir.using
js).
npm, rmport mongo crient,
authentication and session-based authentication.'Nf; Mongo and Mongoose.
.;;;;-;;;;irr.
with rhe support ot'JSoN web tokens^and ,h" 'prr;;;;";;;1". Token-based authentication
jsonwebtoken' Fundamentar concepts ,odut.r, express. passpon,
of Spring core: o"p.na.i.f'rn;"aion (DI) and Inversion of
Control (loC), Auromated Java-Based Conr,gu*iio"
Constructor Injecrion, Field - -"'r""'"! s
@C;poi.rilOauro*ir"d, @ComponentScan,
Injection, Sener-lnlectioni

'', l, .- r,,,. 1,,, :J.l

Gt..i-:, i
 Module lI l: 6lectures hours

Spring core application with Maven, using Eclipse, contents of pom-xmr, Spring Framework support
for Mod€I, controller and view pattern Directory structure ofspring MVC using-Mur"n, nequirei tar
files or Maven Dependency, Entry of controller in the web.xml fili, oefine thi bean in the xml
file,
Displaying the message in the JSP page, Java, Spring MVC, Spring Security, Algorithm, Hibernate,
Maven, Mysql Integration Application, Java persistence Apl (managiment ofrelational data in the
Java
application9 and Hibemate (object-Rerationar Mapping (oRM)),1pA
0avax.persistence), Hibernate
(org.hibemate), JPA (EntityManagerFaclory), Hibemate (SessionFactory), ipA (Java persistence
Query Language (JPQL)), Hibernate (Hibemate euery Language (HeL)).

Module lV: S lectures hours

cR.UD paradigm injava application, RESTful web service: create (posr), Read (GET), updare (put),
Delete_(DELETE), Basic PostgreSeL data storage and management capabirities
["r"ut" i auLuu.", orop
a database, select database, seled table, update a record, create a table, delite record, drop iable,
triggers, functions, insert the record,. procedures, cursors], Spring SecurityBa.i.r, Spring d""urity
Features, Spring security Authentication, Spring JDBCTemprate rntroduction, nowMappei,
euirder,
Spring Boot, JDBCTemplate using Postman Apl Hands on Sission.

Studio Work/Laho lorv ExDeri ments:

Studio work consists of server-side development using Express framework based on nodejs, use REST
API with Express to interact with backend server. To develop Java Spring web applications"using MVC.
Also leam to integrate borh frameworks with databases sucir ar Ie, vybql ana nostgr;sqL.
-ongo
Text Books :

1. B!.o-wl.Ethaa lleb Development wirh Node and Express: Leveraging the Javascript stack (2 ed.),
O'Reilly, 20t9. ISBN 978- 1492053502.
Refer€nce Books :

l. Kumqr Akshi, web rechnologt (1 ed.), Chapman and Halt/cRC,20r8. rsBN g78t r38ss0.t3i.
2. Moseley Ralph and M. T. Savaliya, Developing Web Applications (2 ed.), lllLEy lNDlA, 2005
rsBN 9788126s38676.
3. Murach, l.luroch's beginningJA|A JDK i (l ed.), Mike Murach & Associqtes,2022. ISBN
978189077429s.
)
Assessm t Scheme:

Components lIlternal Assessmenl Mid Term Exam End Exam Total

Weightage (%) 3s%o 3jvo 35olo l00vo

I]
(

Jl
G ;_r ,: I i.: ')
Specialization
Electives:
DevOp s
 Name of Program Ba ch elo r of Tec h n ol ogy (c o m p u ter Sc te nc e a n d E gln
eert n c)
CSET448 Build and Release Mana ent in DevO L T P C
Own I n Sch OOI/D ep a rtm CD t Dep a rtm en t of Co m p u ter Sc lence E n gr neeri ng 2
0 2 3
Pre-requisites/Ex posu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: To explain the build and release management cycle in

DevOps.
CO2: To examine the Assess packages, repositories, needr,
und ,sag".
CO3: To experiment with building a management tool for
dependency management.
co- Msn lns

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
I 6 7 8 9 0 I 2 I
) col 3 3 3
3
c02 3 3 3
.|
3 3
c03 3 3 3 3 3
3 3 3
I:weakly related 2: moderately related 3=strongly related

Course Contents:

Module I:
6 lecture hours
Build and Release Management overview: overview
of Build Management, Buird Abstraction,
Overview of Packaging Management, packaging
Package Manager vs package Management,
*p"rit"ils. p;;;e Registries using the package.
Fac-kagi Manag"r"ri i8or..
Module ll: T lecture hours
Build and Release concept and process, rerease management,
overview of Release and Deproyment
Managemenr, objective and Benefits, rey terminolog;es'r."alr-i"r"^"
Release Management' Rerease Management eroc.* -n"t"ur"M"r"g";"r;,;;;ki;; ;
) tompor"nir, Lifecycre Management,
change management, Need ofchange management,
change Management vs Rerease Management.

Modute Il l: I0lectures hours

Declarative Dependencv Manasement,_Dependency
Management and Build rools, Repositories,
Dependencv ldentification, Traisitive o"pina.n"i.".
Gradle) inrroducrion, Apache Ant Fundamentar. Ap".t;6ffi;;:; s'cope. roors (Maven. Ant and
Advance, MsBuild Fundamental. Gradle Fundamental.
il;;;"'i;;l;*.ri",]'op".ii.ti"lll

Module IV:
5lectures hours
Documentation and Reporting: Documentation Vs Technicar
Documentation, Different Types of
Documentation, Ceneral practice in Documentarion,
Do^cumentation, system vs user Documentation,
Agil";;; Wrt;.f"ll Approaches, Tools used for
DiscG s"r" t"ipr"vr"rprates used in General for
Soft ware Documenlation.

{k:
Ecn: c'i Un..r;:':.ty, Greater Noida
(L:i..r .r .
L:r_ , ., ;j.Co\4,otLlllorprade:h)
Ploi i .,-,'s 3, f , 'l {1, t 1, Tech Zorre-il
Grealci I',lcici.:-201 31 0
 Studio Worldlaboratorv Experiments:

organizations that have adopted agile software

deveropment are seeing much
releases.witi the increasing popurarity ofagile development,-uii* upproa.t, higher quantities of
to software rereases
lslown as continuous derivery is sarting to influen."
to* ron*ur. i-sitions from development to
a release one goar ofcontinuous Derivery
and Devops is to ,"tease ,,ore reriabro applications
and more frequently. The movement of the apprication
faster
tom a uuita t,ougtr difhrent environments
to production as a rerease h part ofthe continuous
oetivery pipeline. The rab work ro, tt i. ruiiu"t
deal with the concept that how the students
can buird and rel*. trrii, ,ot**".
Tert Books 3
l. Blokdyk Gerardus, Change and Release, Manqgement
A Comptete Guide (l
2021. ISBN 978_18673 10242. ed.), SSTARCooks,

Refercnce Books :

, utkarsh shigihaili, Azure Derops sener (t ed.), packt pubtishing.

) l;l;,,r{;;!;f;{. 20te. rsBN

Z. !1t.fi97fie,llefano Demiliani and Amit Malih Azure DevOps Exptained

Publishing, 2020.
(l ed.), packr
1SBN 9ZA 18005686s7

Assessment Scheme:

Componetrts Internal Asse$ment Mid Term Exam End Exam Total

Weightage (o/o) 35o/o 30o/o 35% l00a/o

R trar
B enne lt university, Greater Noida
(E.iaLl,:h e, Und:rAct 2.lot Govi. ol ULlrr
Pradesh)
P ot l,Jo':; 3, 9, 10, 11, Tech Zone-ll
G reater NloiCa-2013i 0
 Name of Program or o f T ec h n ologv (C o m p u te r s cle n ce a n d E D gln eer I n
Bac h e
c)
CSET449 Cloud Services Develo pment & o rations L T P C
Owning School/I) epartment De pa rt m e n t o f C om p ute f Scie n c e E ng n ee rI ng 2 0 2 3
Pre-requisites/Ex posure

Cou rse o utcomes (COs)

On completion ofthis course, the students will be able to:

COI: To articulate service Apl Cateway and using ofserverless computing

CO2: To build, test and integrate cloud services.
CO3: To deploy, operate and maintain the secure cloud service solution.

CO-PO/PSO MappirE

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POt PSO PS02 PS03
6 7 8 9 0 I 2 I
col 3 2 3 )
., 3 3
cC)2 2 3 3 3 3 3
co3 2 3
2 3

l:weakly related 2: moderately related 3=strongly related

Course Contenls:

Module lr
l0lecture hours
systems Development Lifecycre, workflow for deveroping croud
apprication on pubric clouds, croud
Software Development Kit (sDKs), sDK Terminorogy, croud
resting service, Errors and Exceptions,
Cloud Service developing rools, Storage Solutions with public clouJ,
Developing NoSeL Solutions
with public cloud platform, Caching Information for Scalability.

Module Il: 9 lecture hours

cloud notification seryices, Message eueueing Service, Events processing
with serverress computing
service, lmplementation and Authentication using serverress
computing, Serverress best natricei
serverless step Functions' secure network connections, manage
apprications secrets, Authenticate
with security token, Cognito for user sign-up and sign_in ro tt. *"f
and mobile app, Container,
Container Management.

Module llI: 9 lectures hours

configure auto-scaling' launch auto-scaring, Serf-hearing Kubemetes

cruster, Deptoy the microservices
using Kubernetes cluster. croud service registration, Cloud
service discovery, configure scaring and
selthealing for each service, best practices for debugging, Microservices,
Monitoring and Logging ror
microservices, Case Study ofresilience cloud service.

Studio Work/Laboratorv Experiments:

The lab oliectives are to test serverress apprications, minimize risk

of vendor lock-in, create murtipre
slagesofourAPlandimprovesecurityandobservabiiityofourappricationonctouapratrorm.'-'-''-

q/ ( .a ca
'i,:rl
, ..ir )-urrc li
 Text Books :

l' stephen o'ban, Aheqd in the ctoud:. Be* practices

for navigaring the Future of Entelprise IT (r st
ed), createspace rndependent publishing rhtfom,20t8. ls1r{'6zsrqatsznstt.
.

2' r*adia and yohan' AWS Adminisffation-The Delinitive

Guide (rst ed"), packt pubrishing Ltd,
20 I 6. ISBN
978 I 782 I 7 37 5s..

Assessment Scheme:

Componentg Internal Ass€ssment Mid Term Exam End Exam Totfll

Weightage (%) 35o/o 30o/o 350 l0oo/o

R tr
B Universit Y, Greater Noida
i !.d Urn€rrct 2,i of Goyt, ol Ultar Praoesh)
t I{o's B, 9, 10 11, Te ch Zone-il
Gre ater Noic,a-20 '1310
 Name of Program Ba ch e lo r o f Tec h n ol ogy C o m p ter Sc en ce
a n d E ng n ee rl ng)
CSET4SO s o u rc€ a d ve rs to C o ro tn DevO I- T P C
Owning SchooUDe partment D ep a rtm e n of c o m p u te r Sc e n ce E n tn ee rt Il g
2 0 2 3
Pre-requisites/Ex posure

Course Outcomes (COs.l

On completion ofthis course, the students will be able to

COI: To articulate the technical

aspects ofsource and Version Control systems
in Devops
CO2: To examine the version control systems for
tracking, Urun"iing, merging, and managing code
revisions.
co3: To make use ofthe workflows ofvarious version
contror systems rike cit, sun and Mercuriar.

CO-PO/PSO Mappins

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POt POI PSO PS02 PSO3
6 7 8 I 0 I 2 I
) cor 2 3 3
3 3
co2 3 3 2 2 3
c03 3 3
2 2 3
3
l=weakly related 2: moderately related 3:strongly related

Cou rse Con nts:

Module I: g lecture hours

Source Version Control (SVC), SM\ (Sub Version Systems), Mercury
repository, creation, commit, Buirds, croud compuring,
and
Source Cit, Single
Version controt over croud, Implementation
ofversion control over cloud, copy-merge and merge -update
algorithms, practices and rules ofversion
control systems, Industries using version control
system (Car.
"I*aV).
Module Il: glecture hours
Distributed Version Control System (DVCS), DVCS
) ) Vs CVS, Local Repository, Advantages of
Distributed version contror system, Locar repository
operation. ln."Jttirg I-o"ut Environment, Revert
- cancelling out
changes. private workspace;, uutripre n"pJiori".
Moders, Repositories for
Different Merging Repositories, Branching nepositorier, Automation
_Services,
SVC on cloud, BitBucket SVC on local svstem.
of svc, BitBuckel

Module lll: T lectures hours

continuous Integration and continuous Deployment (crcD),

cr Moders, CI practices over SVC,
Operations ofCI over SVC, Automated CI over
SVC, CD ori, SVC, aO Models, CD practices
SVC, Operations of CD over SVC, Automated over
CD over SVC, CICD Toot.
Module lV: 4lectures hours
cit Basics and Remote Repositories, BitBucket Server and its working,
Security over BilBucket,
Creation of Projects over BitBucket.

l.l

Ct:'i :
 Studio Work/Laboratorv Experiments:

The lab components ofthis couse demonstrate

how to implement GitHub on desktop
and remote repository and explores to manage rocar
the furctionality orsoilar" vJ"ion
on experience ofconcepts taught in connol systems with hands-
the lecture.

Text Books :
l cerarfus BrokdyN Distfibuted r/ercion contuor
system A comprete Gutde (rst ed.),
202t. rsBN 978_ts6733I t93. SsrARCooks,

' iiii!fff ,"iil1,#;"riri#;#f;x:',uide to version controt (tst ed'), Independenttv

Ass€ssmeni Scheme:

Compotrents In ternal Asscssment MI d Term Exam End Exam Total

Weightoge (%) 35o/o 30o/o 35% lNo/o
)

) )

istrar
nnett U jiver ty, Greater
(Esiablir'll. d U: ta.t t,.l :: i Noi da
olCr!,l. of Uttar pradesh)
Piot l{o ':i 8, g, 1 0 1 1, Tech
Zone-ll
Greate r hjoid a-2013'10
 Name of Program Ba ch e lo r of Tec h n ol ogy (c o m p u er Sc t€
n ce a n d E n grn e e r ng)
CSET45I Software Craftmanshi in DevO I, T P C
Ow n n Sc h oo I/De pa rtm en t Dep a rtm ent o f Com p u ter Sc ren ce E n gr n e€ rt
n 2 0 2 3
Pre-requisites/Ex posure

Course Outcomes (COs)

On completion ofthis course, the students
will be able to:
cot : To articulate the concept of Software Craftsmanship
coz : To examine the concept of software documentation,
structure, testing and validation.
c()3 : To implement the rules and principles ofsoftware
craftsmanship.
"
CO-PO/PSO Maoning

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PSO2 PSO3
6 7 8 9 0 I 2
cot 2 2
I

co2
,
3 2 3
) co3 3
3 3 )
3
3 3
I =weakly related 2= moderately related 3:strongly related

Course Contents:

Module l:
8 lecture hours
software craftsmanship, Four Dimensions of
euarity, Software Ethics, ciean code, craftsmanship Vs
Engineering, Frameworks and Tools, Design,
Structure, Fo_;in;, and Documentation of Code,
Types of Designs/Models, Design Sructure
Matrix (DSV;, Rroduct_jervice System using DSM.
Module ll:
8 lecture hours
Process Documentation. product Documentation.
Different phases of Design, Requirement of
Documentation, Advantagesof Documentation, Technicar and Non-Technicar charenges
Documentation, Content Authoring, Formatting, in code
Styling, Issue Tracking. Testing, publishing,
Documentation: Testing, Debugging, Refactoring
) ) Improuin! Structur.
Module lIl:
7 lectures hours

Testing and varidation. Different Typ€s of resting, properties

of resting, Customizabre, Extendabre,
Link Validity, Component Checking, Semantic,
arid Syniax earsing.--'
Module lV:
5 lectures hours
Frameworks, Tools, and the proo66rning process,
DevOps Frame Definition, Agile Framework,
Scaled Agile Framework. Adoptio"n Framework.
lndustry practices.
St dio W ork/La borato rv Ex ertm ts:
The lab work of this subject deals with documentation
as well as designing projects using different
models. The projects should also go through different
tesring ana vatidaiioniafro, a.f,* ulprop.iut"
boundaries and layers , and organize components
and servlces.
 Text Book! :
l. Fowlet Martin, Refactoting: Improving the Design of Existing
Code (2nd ed.), Addison- Wesley,
20t 9. rsBN 97&01 34757s99.

2. Marrin Series-Robert C., Sofiware-Cr{tsman, The: professionalkm, pragmatism, pride lslEdition

(lst ed.), Addison Utesley. 2020. ISBN 978_0t340i2StiZ
- -'--'
Assessment Scheme:

Components Internal Assessment Mld Term Exem End Exsm Total

Weightoge (%) 35oA 3Oo/a 350h l00o/o

J)

rlt
Recsi/,6ar
Bci,fi ett Unlversi'v, Greater Norla
l. l:J': --.i clllti.nF: --5h)
tE:r:LI:,h:d U:rlcr
iSiJi ilotss, 9, 1tr, i1, Tech zorlo-li
Greater I'Jcicln-2i)'1 31 0
 Name of Program Bac h e o r o f T ec h n o logv(c om p u te r S ct e n ce a n d E n t n ee rt n s)
CSET452 Software Containerization in DevO s L T P C
Owning SchooUDepartment De po rt m e n t o f c om p ute r Sc te n c e E n gl n € e r I n 2 0 2 3
Pre-requisites/Exposure

c Oul comes (COs)

rse
On completion ofthis course, the students will be able to:

COI : To articulate the software containerization with virtual machines.

coz : To examine the need for Manipuration, coordination and orchestration
Toors for a rarse
production environment.
CO3 : To implement Containers and Image Operations along with Container Networking.
CO-PO/PSO Mappinq

PO P02 PO3 PO4 POs PO PO PO PO POt POI POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
cot I I I I )
) co2 ) 3 I 3 2 2 1 2
co3 3 ) 2 3 l 3 I

l=weakly related 2: moderately related 3=strongly related

Course Conlen ts:

Module I:
5 lecture hours
Containerization and Virtualization, Virtual Machine (VM), Hypervisor
and ifs typ es, Architecture of
VM, Architecture ofContainer, Docker Engine, Difference between Containers
and Virtual Machines.
Module ll: T lecture hours
container Manipulation, container's providers Exampres, croud platforms usirg
contain"rs, tvturtipl",
scalability, Portability of containers, orchestration, Architecture of orchestration, Container
orchestration' cloud Platforms using container orchestration, container operations,
Image operations
Running Multiple Containers, Custom lmage in Containers.

Module lll: g lectures hours

) ) Creation of Custom Image, Need and Benefits of Custom Image, Running
Container using Custom
Image, Publishing of custom lmage, The chroot system, FreeBSD Jails,
Linux Containers, Docker
architecture. Docker Daemon (container pratform), Docker Rest Apr, Industries
using Dockers,
Networking' container Networking, Architecture of container Network, Types
of Container
Networking, Use ofContainer networking in Web-Scale Applications.

Modute IV:
7 lectures hours
OpenShift Enterprise, OpenShiff Features, OpenShift in Devops, pro viders
ofOpenShift, OpenShift in
Devops, Providers of OpenShift, Container and Microservices. K ubernetes,
Kubemetes on cloud,
Docker Swam and Kubemetes, Deployment ofContainers, Monitorin g ofcontainers,
Elastic Container
Service providers (AWS, Azure).
 Studio Worli/Laborrton Experiments:
The lab work demonstrates orchestration tools like
Docker, Swarm, and Kubeme@s with hands-on
experience
ofconcepts taught in the lecture. students wi gain hands-; experience using rear accounts
on AWS, Azure, Ooogle Cloud plarform

Text Books :
I P_anhokr Mo* Mastertns Ooc\1-ey1y1y3, A conpanion guidefor agile container
(l adoption
ed.), Packt Publishing,,20tg. ISBN g78-17596120fu.

Reference Books :
l. *,ce_Liz, Co*ainer Sectrig: Fundamental Technologt
Concepts that protecf Containerized
Applications(l ed.), O'Reilly Medi4 2OZO. ISSN SZd:HqZOS;206.

Assessment Sch€me:

Components T nternal Asse$ment Mid Term Exrm End Exem Totsl

Weightage (0z6)
)
35o/o 30p/o 35o/o tw,

) )

i
lv ,,'
l-idJ.,-{t ttt
Qf,r'fi ,r't U. :i'rcrsity. Greater Noida
(EL:: l" liiri I lj, ra r.r.rl ;l,l oi Govl, oiUttarP.adBsh)
,, 1 0, '11 , Tech Zone-ll
Plclt Ne',i 0,
Greater Ncido-20131 0
 Name of Program Ba ch e lo r of Tec h n OI ogy (C om p u te r Sc te lt
ce an d f, ng n ee r c)
CSET453 sv s tem P rov sl o n ng 2 I d C o fi gu ra to
L T P C
Ma I a m en DevO
Own ng s c h OOUD ep a rtm ET t De pa rtm e n t o f com p u te r Sc I e n ce E n ln
ee rt ng 2 0 2 3
Pre-req uisites/Ex posure

Course Outcomes (COs)

On completion of this course, the students

will be able to:

COI: To explain the system provisioning and configuration

management.
CO2: To examine the various configuration tools
and their suitabiiiry,
CO3: To implement and use ofconfiguration management
tools-

co- PO/P Man lrs

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PScJ2 PSO3
6 7 8 9 0
COI , ) I 2 I

) c02 2 3
3
3
c03 ) 2 3
3 2
2 3
l=weakly related 2= moderately related 3=strongly related

Co urse Conte nts:

Module l:
of provisioning: Introduction and Significance of provisioning. nJrrt.
9r"11"*.
Provisioning under Devops Moder, prouisioring *."d :,*"[J;
i. conngu*i*,"tnriru.",u."
'
provisioning and
its Tools, Environment provisioning., Artoruti proririoi;;.'-
Module ll:
overview of configuration Management: Inlrodudion
of configuration ,rr"*r1,'ir",','!""1,"""'
Terminologies of Configuration Management,
s".r".,'oiNJ"f
- woir.sration, workstation setup,
Organization Setup, Test Node* Seiup, n"r"nt,
ionngJrurio, Uurug"*enr Severs.
Configuration Management Tools, Features and
Comp"ri.",
)) Selection Criteria of Tools. "f;;;i;r;;r#ffi;;#r;;;;
Module I lI:
Configuration Management & Tools (puppet, Chef,
Ansible, and Saltstack): ,roO'"J"Jl*,1i,'"'
Working, Architecture, Master ana egenis, ir.,uffurion
uni coii,g"rurion of puppet, Ansible
Definition, Ansibie Requirement S.pecificarion,
a"siUfe Cornpo#irl an.iUf" Sfategy, Sahstack
Inaoduction, Important Features of Sartstack, sattstacr<
Versions, Salt vs. Ansible, puppet.
enteriris" uri tur, op"n-source Software

Module lV:
Application configurarion: tnrroduction to^corfigfyt6p5
and secrets, Application :""""#;:,[T^
with ConfisMaps and Secrets. Creating Config'Md,
secrets, setting Environmenr for secrets. pods
E;il;;;;; Specific Config, Creating
overvLw: Inlroduction to pod, pod Specification,
Pod Lifecycle, Launching pods, pods operation, poa.
uno Corium"rl, poa.
Template, Resource Sharing and Communication: -o controllers, pods
Storage and Networking in pods, Static pod.

L)
 Studio Work/Laboratorv Experiments:
The lab work ofthis subject deals with Design, development, and solving real-world automation
and orchestration problems by unlocking the automation capabitities of configuration tools
(Puppet, chef, Ansible, and saltstack) used for Devops. A small web application-based softwarr
is to be developed using any ofthe tools ofDevops.

Text Books :
l. Freeman James and Jesse Kearing, Mastering Ansible: Efectively automate conligulation
management and deployment challenges with Ansible 2.7 (lst ed.), packt publishing 20tg.
lsBN 978-1789951547.

Referenc€ Books :
l. Verana Joakim, Practical DevOps (2 ed.), packt publbhing,20lB. ISBN g7A-17g83g2570

Assessment Seheme

Components Internal Assessment Mld Term Exam End Erem Total

) Weightage (o/o) 35o/o 30% 35o/o l00o/o

) J

ri r
B ett [Jnivf,rsity, Gre:rter Noida
i iriiH,.l l.liiij.f,',:t:i; ji'-lJvt,-l-cch
of tJ:tdr Pradesh)
Plo t No's il, 9, 'i0, 11 , Zone-ll
Greater hicida-201310
 Name of Program Bac he or of Tech n ol ogy Co p T te r Sc le n ce a n d E
ng neer ng)
CSET454 Test Automation in L T P C
Owning SchooUDepartment De pa rt m ent o f Co m p u ter Sc ence E n gr nee rt ng
2 0 2
Pre-req u isites/E xposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: To articulate the various testing approaches.

CO2: To examine the automation testing technologies through
tools.
CO3: To make use of various automation test cases under DevOps
environments

CO-PO/PSO Mappins

PO P02 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
6 7 8 9 0 I 2 I
cot 3 3 3
3 3 I
c02 3 3 3 3
) c03 t
3 3 2
3 3 3 3 3 3 I
l=weakly related 2: moderately related 3:strongly related

Cou rse Con ts:

Module I:
Test Automation Manifesto and Testing: Test Automation Use 8 lecture hours
cases, principles, SDLC vs STLC,
Testing cycle, usabirity Testing, Functionar retting, non-frnct;nar
_Life
Compatibiliry Tesring, CUI Testing, Apt resting, UsaUlf l"ry f"sting.
-'-' testing, En d to End Testing,

Module Il:
Testing Approaches and rest cases Design: Manuar resting,
Automation ,".,,"r, ,ir',","f::;X;,"t
Integration Testing, System Testing, Acceptance Testing,-
Smoke-sanity Testing, R.g."*;;;
Testing, Test Scenario, Test Case Design, Test Basis, Trace-ability
Matrix.
Module lll:
)1 DevOps Testing Best practices, Business Test Automation,
Functionar Test Automation, Functional Test Automaiion,
hours
Technical Test Automation, Non_
oiff"."nr t".t
7lectures

Aulomation
Tools(Kobiton, Ranorex, Zeuz, etc.).

Module lV: 7lect[res hours

Mobile Automation and Cloud Testing: Mobile Automation
and its Requirement, Application and
Role of DevOps in Mobile Automation, Cloud Testing, Cloud
Testing Setup, fntettigent fesi
Agents' conlinuous Testing, continuous Testing Requirement
and its Advanages, continuous
Testing strategy, continuous Derivery, continuous Testing
vs continuous Derivery.

Studio Wo rk/Laborato Exoe riments:

The lab component ofthis course demonstrates test cases

design and ir us*ates automation testing
and continuous integralion with toors. rike Agire and Jenkins.
The practicar work wi, herp tl
identify all the stages ofyour rerease arong with the gates and requirements
necessary in a buird,s

"-. I - irtoid:r
.. ::: i,,;.:.rt,.i
', 'r r, i..i;ii.r.oti::-li
. l.;irr ii)
 joum€y to production. Also, all the operational
procedures, services, and actions involved
release
with a
cycle will be elaborated.

T Boo
l. llolfgang Platz and Cvnthia Dunlop, Enterryise
Continuous Testing: Trawforming Testingfor
(tsi ed.) (t ed.), C,"*isiiiiiii"'ii#,'iiliuoi,g
lgtle !:!-??oes
978- t 699022948. rhforn, 201e. tsBN
Reference Books :
t lryl!11ty-oa, Complete Cuide to Test Automation (t ed.), Apress, Z0tg. ISBN g78-
14842383t8.

Assesment Scheme:

Compon€nts Internal Assessmcnt Mid Term Exam End Exam Total

Weight ge (%) 35o/o 3U/" 3s% l00e/o

J)

"M,ra
Bolfgft Universily, Greater Noida
(Eslaullshcd L^d,ri r.cl: I slGoil, oi Ultar Predosh)
PIot No's B, ?, 10, 11 , Tech Zone-ll
Grecter i\.loiti.r-201 31 0
 Name of Program Bac h e o r o f TGC h n ol ogy ( o m p u er Sc CT
c ce an d E ng neer n c)
csET455 ile Software Devel ent L T P C
Ow n I Il s c h o o UDepa rtm en t Depa rtm en o f C o m p u e r Sc en ce E n gln ee rt ng 2
0 2 3
Pre-req uisites/Ex posure

Course Ou mes a Os)

On completion of this course, the students will be able to:

COI: To articulate existing problem with the team, development

process, and wider organization.
CO2:. To specify the most appropriate way
to improve the results for a specific need using agile
techniques.
CO3: To apply understanding of agile principles and
specific practices

CO-PO/PSO Mappinq

PO Po2 PO3 PO4 POs PO PO PO PO POt POt POI PSO PSO2 PSO3
6 7 I I 0 I 2 I
cot 2 2 ) 3
co2 2 2 I
co3 3 3
) 2
1

l=weakly related 2= moderately related 3=strongly related

Cou rse Con nts:

Module t:
Agile mindset, Agire manifesro, predictive moder,
adaptive moder, Agire prin.,o,"r, 3l!ltilirl"',i1'
impact ofadopting agire, Agile case study, agire requirements,
ur"r rlori", uno u"ceptance criteria
3 C's in user stories.

Module ll:
Epics and tasks, product backrog and refinement,
Scrum llamework,
scrum, Sprinrs. Sprint backlog. Daily scrum. Scrum
*",". ,,
.",.?,rll"llll.1t,1tt
rules. agiie .stimarion and planning.
Effectivell using srory points. Need. oi velocity and arr"ri"r.'fi"i,
irg poker rechnique for pBI
sizing, Fixed estimation based on velocity, Velocity range, n"i"u." ff""rirg, Fixed scope release,
Fixed date release, Agile and DevOps.

Module lll:
)) sprint planning, capacity determination' Sprint Execution,
lZ lectures hours
Frow management, Swarming in flow
management' Task boafd and task tabre, sprint charts, sprint
review, pre-work, process, and activities,
Sprint retrospectiye, participants,
nre-w91f, process, ani activities, Sfrint retrospective steps, Extreme
Programming (XP) in agire, Xp varues, Xp practices,
Xp process moder, Scrum vs Xp.

Studio Work/Laboratory Experiments:

Analyzing,larious agire toors, Agire requirements -
creating epics and activities, user story
mapping, Kanban Board and Dailv gl6ndup Board,
JIRA p."j"".;;l; Kanban board, Configure
Kanban board in JIRA, Create a scium project JIRA, gui"L S"u."i,, Basic Search, and JeL,
JIRA _
Filters in JIRA, Issue types in JIRA, Applying s"r* frur"*i.k-urir-f .,tna for.upr,one project.
T€xt Boo ks:
Larman Crqik ond Bqs Vodde. Lurge-Scole Scrunt:
Professionctl. 20I 6. tSBN g-8-0J2liRS- t 256.
"" '!tt t"''L'r"It
More,yith LeSS (t ed.), Addison_ll/esley

:'.t, ,, r ).-r.:: Lr:,-

lrloid;,1
. ,: Lri,iFr..r.r.ri,t
( ,.i r...,1t-Ut,L_,1
' 1.r ,.,r
 Referetrce Books !
Cambell Alex, Agile:
All you Need to.!{no!l oloy Agite Software
Development. Team and
'u;7;;irff;**e* usins scrun (t "a.t, r,i"iiii,ii"iiim"a, 2020. rsBN s7s-

Asscasment Scheme:

Components In ternsl Assessment Mid Term Exam End Exam Total

Welghtage (%) 35% 3V/" 35% l00o/"

r
nOtt L.lnir,,ers ity, Greater
shcd Underil.t
lrlo ida
Li cl
I
PI ot No's ,9, 1 0, 11
C,o.ri,
Uiid r PreJesh
, l-ech Zone- ti
ol

Greater No id a-20.1310
 Name of Program Bac h e o r o f T ec h n o logy (C o m p te r s ct en
ce an d E ng n ee rt n c)
CSET456 s ial Topics in DevO L T P C
o n I ng Sc ho o vDe pa ram e n t De pa rtm e n t o f com p u te r Sci e n ce E n n ee rt n g 2 0 2 3
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

COI: To familiarize and leam about the latest trends and

research in the field.
co2: To equip themserves with the conceptuar and practicar
experience of few ratest methods, tools,
technologies or algorithms in DevOps.

CO-PO/PSO Maonins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POt PSO PS02 PSO3
I 6 '7
8 9 0 I 2 I
COI l 3 3 1
I
co2 3 3 3 I 3 3 3 1 3 3
l=weakly related 2= moderately related 3:strongly related
)
Cou rse Contents:

Unit/Module l:
28 lecture hours
This course covers the cutting-edge topics in Devops,
instructor based on rhe requiremenrs and relevance
and these modures wi, be chosen by the
relevant to the industry
ai that p"i;t;i;i;;. These modules need to be
and start-ups wi, arso incrude .;i";;-;;r" studies,
implemenhrions scenarios. studenrs.wi, be wort<ing use cases and
on tat *"rt lo get rear hands-on
experience of these topics and modules. "].ipr"-i*"
Studio Wor WLa boratorv Exoerime nts:

Students will gain practical experience by using tools and technologies

related ro Devops.
Assessment Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

))
Weightage (9/o) 3s% 30ro 3s% l00o/o
 ) Specialization
Electives: FuII
Stack
)
)

, , , :clt Z!.,r r.:-il

:ii)
 Name of Program Ba c h e o r o f T ec h n ol ogy C o m p u er Sc te c e a n d E gr
eert n c)
CSET457 Frort-End Web UI Frameworks and Tools: L T P C
Bootstra
o n n s c h o o v Dep a rtm en t D e p a rt m e nt o f C o m p u e r Sc ten c e E n gl n e e r n 2 0 2 3
Pre-req uisites/Ex posure

Course Out comes ( s)

On completion ofthis course, the students will be able to:

COI: To articulate grids and responsive design, Bootstrap CSS. and

JavaScript components
CO2: To examine Bootstrap Grid and display of responsive web page
design.
CO3: To implement Bootstrap components and plug-lns.

CO-PO/PSO Me DDINO

PO P02 PO3 PO4 PO5 PO PO PO PO POt POI POt PSO PS02 PSO3
) 6 7 8 9 0 I 2 I
cot 3 3 3
3
c02 3 3 I 3
3
c03 3 3 3 3
3 3 I
l:y/eakly related 2: moderately related 3=strongly related

Course Contents:

Module l: l6lecture hours

Responsiveness, Features of Bootstrap, Mobile_First
Strategy, Sening up Environment, Bootstrap
to Applications, Bootstrap crid, Setting up Cit, Appty eootiirap
Crid] Oirpluy ,..ponriu" irugr{
Use readymade themes. Customize Aootst.apt 'compon.r,rl1.r.,'
Variables, jeuery plug_in,
Bootstrap iaule,, boot*mp Form Layout, Bootsrrap
3:,:l':*oJfq:o_ll^_Y::
,,urron. Irpr*.lqhy. shape,
tmages rn drtterent stvles:.Circle Display text like muted and *a.ring, Car"ti
Classes, Hide or show the Ln in Boorstrap.
_irdil; a;;;onents: Advantages, Types,
)S Clyphicons Component: Use, navigation pills a Tabs Con,,pon.rii. nuuUar Component, build a
Responsive navbar. Forms and navbar_ controls, navbar'p";ir;;,
Breadcrumb, Component,
Pagination Component, Labels/Badge Components, furnUotrnn
7'eug" Header Components.
Thumbnail Component, Alerts & Dis;issibte Alerts, f.ogr.ss
eu., UeOiu OUi".t. Corpon"nr,'Ur"
Media Objects Component, Bootstrap Lisr Croup CompJn"rt,
nolt*up panel Component.

Module ll: 12 lecture hours

Bootsrrap Plug-lns, Use BootstraD plug-lns, Transition plug_in,

Modal Dialog Box, propenies,
Methods and Events of Modet Oiatog sox, Scrolspy elug_in]
plug-in.
i;U etg_in, use Tab plug-in, Drop
Down Plug-in, Tooltip Use Button pfug_i", li"tf,La, unJevents of Tooltip plug-in,
Popover Plug-in, alert and Button plug-ins, pil;_;: "properti"s, Collapse plug-in:
_Co"llapse
Methods, Events ofColapse plug-in, Cariusel plug_in, Affi- ?frg_i".'
Studio Work/Laboratorv Experiments: :

l)t
t,/
 studio work consists oful Design and Prototyping using Front-End web ul Frameworks and Tools of
S""trt np t ura CSS-and JavaScrili. tiere, building r_esponsive design and Bootstrap Grid
Sy#,1";;g "avanced
cit, and utilizing BootstrapCSS Components for displaying content is also taf,geted.

Text
-1. Books r
Chw* Si^o*, Fronlend Development with ASP.NET Core, Angular, and Bootslrap (1 ed')'
Wrox, 2018. ISBN 9781 I 19243963.

2. Moreto and Silvio, Goodnan, Danny Bootstrap 4-Responsive lYeb Design

(l ed')' Packt
Publishing Ltd, 2017. ISBN 9781785288876.

Reference Books :

l. 4 lo build
Jakobus and Benjamin, Maslering Bootsiap 4: Master lhe latesl vercion of Bootstrap
(t ed), packt publishing Ltd, 2018. ISBN 97817888349024.
highly customized.responsive weblpps

2. Duckeu Jon, Jcvascript and JQuery: Interactive Front-End Web Development

(l ed')' Wiley' 2015'
ISBN 9781 I 1853 t 648.

)
Components Internal Assessment Mid Term Exam End Exam Total

1000h
Weightage (%) 35o/o 3oo/o 35o/o

) .),

R
Eo CL t ll n ive i-sity, Greater Noida
Lr ( !,r1, .: Lrtiar PrrCesh
F,'l.; : L.io'. l), 9, 'jr), i1,'i;ch Zone-ll
(
 Name of Program Bachelor of Technology (Computer Science and Engineering)
csET458 Front-End W€b UI Frameworks and Tools: L T P C
React native
Owning SchooUDepartment Department of Com puter Scienc€ Engineering 0 4 3

Pre-req uisites/Exposu re

Course Outcomes (COs)

On completion ofthis course, the students will be able to

COI : To understand of JavaScript, react and native components

CO2: To design and display ofweb app and mobile app.
CO3: To implement native components and Plug-lns.

CO-PO/PSO MaDDins

PO PO2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PSO2 PSC)3

I 6 7 8 9 0 I 2 I

cor 3 3 3 3
c02 3 3 2 2 3 3 3 3
c03 3 3 2 2 3 I 3 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: 7 lecture hours

Course handout assessment mechanism, Front end web development, Javascfipt: Arrow Functions,
React, spread operator, Default params, Let and const variables, React Components: State and
Props, composing components, adding states, React Components: Lifecycle, Event handling,
lntermediate React: Rendering lists. Form elements, Forms: Controlled, Uncontrolled. Functional
Components. React Virtual DOM, The Flux Architecture, Redux, Redux form validation, Brief
Representational State Transfer (REST).

Module ll: 7 lecture hours

)) React native, Animation API, Components: Basic, Stateful, Stateless, Custom fonts, Component
APl,Higher-Order Components: Keys, Fragments, Constructor, Animations, HTTP Requests:
Syntax, XML HttpRequest, Web Socket with Socket.io, lmages module: Image source. image path,
Network image, Firebase integration, Reactnative ListView, Authentication in Reactnative Using
Firebase, Layouts, Listview navigators. Bofton navigation. Push Notifications: Simple and navigation
based.

Studio WorlrLabo ratorv ExDeriments::

Studio work consists of React library for JavaScript based ftont-end application development. It uses
of Javascript ES6, JSX and React framework for building user interfaces in front-end application
development. Developing web Applications using React is to be focused.

{-l
 Text Books :
t. Banks Alex, and Eve Porcello, earning React: functional web d*elopment with React and Re&x
(1 ed.), O'Reilly Media,2017. ISBN 9352135636.

2. Stefanor S, Reoct: up & running: building web applications (l ed.), O'Reilly Medta,2016. ISBN
1491931825.

Referenc€ Books :

t. A M Vipul and Prathamesh Sonpatki, ReactJS by Example-Building Modern Web Applications with
React (1 ed.), Packt Publishing Limited, 2016. ISBN 1785289640.

2- Gackenheimer Cory, lfhat is react?. In Introduction to Reacl (1 ed.), Apress, 2015. ISBN
1484212460.

4ss$!r9!!ss@9:
Components Internal Assessment Mid Term Exam End Exrm Total

) Weightage (%) 35o/o 30% 35o/o t00%

) )

al
n nett UniVC!"sitY, Greeter Noida
(Estab i rl,r.al l tf:l!r Acl ? i .[ Covt, of Ulti r Pr:i \rlth)
-l'€ch Zon e-ll
Plot tJo': 8, 0, 1ir, 11,
Grciiel i l'r:r':-lJ I 310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET,l59 Front-End Ul Frameworks and Tools: Flutter L T P C
and Dianqo
Owning SchooVDepartment Department of Computer Science Engineering I 0 4 3

Pre-req u isites/Exposu re

Course Ou es (COs)

On completion olthis course, the students will be able to:

COI: To understand of UI design with flutter components.

CO2: To design the flutter app and understand Django.
CO3: To irnplement Flutter and Django components and libraries

-PO/PSO Ma

PO Po2 PO3 PO4 PO5 PO PO PO PO POt POI POI PSO PSO2 PSO]
6 7 8 9 0 I 2 I
\ col 3 3 3 3
-, c02 3 3 I 3 3 3 3 3
co3 3 3 3 3 3 I 3 3

l=weakly related 2: moderately related 3=strongly related

Course ntents:

Module l: 6lecture hours

Basics of Fluner and Dart Programming, Dart Programming - Syntax: Variables, Data type, Dart
conditional operators: If-else, For, while do-while Dart Functions: structure. retum type. expression.
OOP: classes, object, Methods, constructor, lnheritance, Abstract class, Flutter widgets: Scaffold,
image, container, Icon, Flutter Layouts: card. Stateful and stateless widget. navigation: button widget-
floaiing raised, flat, dropdown, outline, Flutter Webview widget. Visual, Behavioral, and Motion-Rich
Widgets, List View, Data View, Date Picker, Time Picker, Dialogs' alerts.

Module II: 8lecture hours

), Django structure, URL dispatcher Requests and Responses, CET and POST melhods' MVC model
and Generic Views, lmages, Forms Alert Handling, Django REST. Ceneric Views in Django Rest,
Building RESTful APIs, Database- Add tables, Dynamic progress bar Deploying Web APls,
Advanced Django for Web and Automation.

Studio Work/Laborato rv Ex riments:

ln-studio work, students will leam that how to deploy Django REST Framework on different
platforms and deploy Django Apps for various use cases.

Text Books :
l. Zqccdgnino Cqrmine, Progromming Flutter: ndtive, Cross-Platforn Apps the Easy lVay (The
Pragnatic Prograntmers) (l ecl.), O'Reilly,2022. ISBN 1680506951.

.r)
'. .''ii
 Reference Books :

| . Peyne F.ap, Be+inning App Developnent with Fluttet : Create Cross-Plotform Mobile Apps ( I
ed.), Apress, 2019. ISBN 148425 I 806.

Aclg$sgnlsgLigs:

Com ponents Internal Assessmetrt Mid Term Exam End Eram Total

Wetghtage (%) 35o/o 3V/o 35o/o 100%

J)

*"M/
Benffi University, Greater Noida
(E.lafished UiderArt 24 of Govt, of Uttar pradesh)
Plot No's 8, 9, 10, 11, Tech Zone-il
Greater Noida-201310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET460 Special Topics in Full Stack L T P c
Owning SchooUDepartment Department of Computer Science Engineering 2 0 2 3
Pre-req uisit€s/Exposure

Course Ou mes (COs)

On completion ofthis course, the students will be able to:

COI: To familiarize and leam about the latest trends and research in the field.
C02: To equip themselves with the conceptual and practical experience of few latest methods, tools,
technologies or algorithms in Full Stack.

CO-PO/PSO Mappins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
I 6 7 8 9 0 I 2 I
col I 3 3 I 3
\ CQ2 3 3 I 3 3 3 3 3
)
l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module I: 28 lecture hours

This course covers the cutting-edge topics in Full Stack, and these modules will be chosen by the
instructor based on the requirements and relevance at that point of time. These modules need to be
relevant to the industry and start-ups will also include related case studies, use cases and
implementalions scenarios. Students will be working on lab work and projects to get real hands-on
experience ofthese topics and modules.

Studio Work/Laboratorv Exneriments:

Students will gain practical experience by using tools and technologies related to Full Stack.

Assessment Scheme:
) )
Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 3svt 30o/o 350i{ 100%

egistrer
enncit [.rit rl/: r.-,1 / Gr,. rra" h{o i.la
Plct I'j,--.'rr i I :;)
Gre;ltcr l i ;:.li-2ll: Zons-li
l t)
\
, Specialization
Electives:
Cloud
Computing
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET46I Cloud Sv stem Adm in istration & Operations I, T P C
Owning School/Department Dep artment of Computer Science Engineering 2 0 2 3
Pre-requisites/Exposur€

Course Outcomes (COs)

On completion ofthis course, the students will be able to:

cot : To get fundamentals of suppon and maintain cloud workloads as per the cloud archilecture
coz : To perform operations by using the cloud management console, CLI and SDK.
co3 :To implement architectural requirements with monitoring' logging,
and troubleshooting.

co-Po/P Mannins

Po2 P04 PO5 PO PO PO PO POt POI POI PSO PSC)2 PSO3

\ PO PO3
.) 6 7 8 I 0 I 2 I

cot I 3 2 3
c02 3 3 2 3 3 3 2 3
3 1 3
co3 3 3 3 3

l:weakly related 2: moderately related 3:skongly related

Course ontents:

Modrle I: 9 lecture hours

Need ofcloud administration and operations, Roles and responsibililies ofcloud Admin, lnter-cloud
Resource Management, Resource Deployment and Provisioning, ldentifying the steps to provision
cloud resources, ldentify, and remediate deployment issues, Storage and Data Management
connectivity services of public/private cloud Automation and optimization, Manage and assess
resource utilization, Employ cost optimization Strategies, Automate manual or Iepeatable process,
Minimize management overhead, Monitoring and Reporting, Maintain metrics and alarms utilizing,
Recognize and differentiate performance metrics, Availability metrics, Manage security policies on
) ) cloud, Access controls when using cloud, Shared responsibility model.

Module ll: l2lecture hours

Data Centre Management Tools Integration, Service and Resource Management, implement
scalability and elasiicity, highly available and resilient environments on cloud, automate snapshots,
Data Lifecycle Manager, Data Retention policy, Restore databases versioning, Lifecycle rules,
Disaster recovery procedures. Cost optimization strategies. Networking and Content Delivery,
Perlormance optim izalion stralegies.

Module llI: T lectures hours

OS boot process (Win/Li nux) and Troubleshooting: Memory management, Memory pages, Bufter
and Caches, System date/ti me management, Network time protocol, Network Logs Auditing,
Managing Users and groups, File permissions, AssessmenVBuffer Lecture. managing software,
Managing system services, Background processes. Windows start-up tasks lnte Internet-
 aware network troubleshooting, Network tools to report the problem, Network address translation,
troubleshooting in common VPC, Troubleshooting in On-premises to VPC, System performance -
DISK, System performance Memory, System performance Network System Login issues'
- -
System booting issues System logs, Network connectivity issues

Studio W rk/Laboratorv ExD eriments:

Studio work focuses on seven cloud sub domains that are as; l. Monitoring and Reporting, 2 High
3. Availability,4. Deployment and Provisioning, 5. Storage and Data Management 6. Security and
Compliance, 7. Networking and Automation and Optimization.

Text Books :
1 . 5., Digby, G., Fitch, C., Friedberg, 5., Qualheim, 5., Rhoads' J qnd Sundrud, B, AlltS Certified
SysOps Adninistrator Official Study Guide: Associate Exan (l ed-), John ll/iley & Sons, 2017'
rsBN 9781 1 19377429.

2. Chandra Rajasekharqiah, cloud-Based Midoservices: Techniques, challenges, and solutions (l

ed.), Apress, 2020. ISBN 9781481265642.
)
Referen Books :

Jackson, K. L., & Goessling, Archilecting Cloud Computing Solulions: Build cloud stalegies thal
align technologt and economics while efectively managing risk (l ed.), Pdckt Publishing Ltd,
20 I 7. |SBN 978 I 78847 212 5.

Assessme t Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (Yo) 3svo 30% 35% 100%

.) )

, (l;r::1cr hil;:ia
; ,.r : r t:ri ll
-'l 7 ;' i:- lt
(
 Name of Program of T ec h n o ogy C o m p u ter S c ence an d E n gi nee r n c)
Ba c h elo r
CSET462 Cloud Security & Com tances L T P C
Department of Com p uter Science Engineering 2 0 2 3
Owning SchooUDePartment
Pre-req uisites/Exposure

Course Out mes (COs)

On completion ofthis course, the students will be able to:

COI: To leam and examine the security breaches of IaaS, PaaS, and SaaS'
co2: To apply various data encryption methods and security mechanisms to gel the administrative
control using IAM service.
C03: To create a secure production environment using cloud security features and services'

CO-PO/PSO Mappins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS()2 PSO3

I 6 7 8 9 0 2 I
\ 3
,, col 3 3 3
3 1 3
c02 3 3 2 3 3
cCJ3 3 3 3 3 3 3 3 3

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: l0l€cture hours

security Pattems for Cloud computing - Network security, Identity & Access Management & Trust,
secure on-Premises lntemet Access, Secure External cloud connection, cloud Denial-of- service
protection, cloud Traffic Hijacking Protection, Automatically Defined Perimeter, cloud
Authentication Gateway, Federated cloud Authentication, cloud Key Management, Trust Attestation
Service. Collaborative Monitoring and Logging' Independent CIoud Auditing

Module ll: ll lecture hours

)) End-to-end secufity, shared responsibility in the cloud, Backup and restore, Detect and mitigate
threats, Plan for ransomware, recovering fiom systemic identity compromise, Threat protection,
Securing workloads, Security technical capabilities, Physical seculity, components and
boundaries, operations and Monitoring, Platform integrity and security, secure Data Protection
Law: national and Intemational, Firmware security, Code integrity, Secure Boot, Secure Isolation
of Physical & Logical lnfrastructure, Compute, Network, Storage, Common attack vectors and
threats, Secure Isolation Strategies, Multitenancy, Virtualization strategies'

Module lll: T lectures hours

Data Protection for Cloud lnfrastructure and Services. Undentand the Cloud based Information
Life, Cycle, Data protection for Confidentiality and lntegrity, Encryption, Data Redaction'
Tokenization, obfuscation, PKI and Key, Management, Assuring data deletion, Data retention,
deletion and archiving procedures for tenant data, Data Protection Strategies'

W,
/
 Studio Work/Laboratorv ExD€riments:
Learner will be able to examine Public clouds Shared Responsibility Model, IdentiS
the security
and compliance benefits ofusing the AWS/Azure/GCP cloud, Describe the basic features for access
control and management, Describe AWS/Azure/GCP data encryption methods' Describe
AWSiAzure/GCP services used to protect network security, Describe the basic steps to ensure
StronggovemanceofyourAWsresources,examinelegalandregulatoryissueslelatedto
cybersecurity.

Text
1. Chen, Lei, Hqssan Tokabi, qnd Nhien'An Le-Kfutc, Security, privacy, an d digital forensics
in the
cloud (l ecl.), John lliley & Sons, 2019. ISBN l3: 9781119053286'

q seclrity
2 Russell, Brisn, qntl Drew Van Duren, Practical lnternet ofThings Security: Design
(2 )' Packt Publishing Ltd' 2018' ISBNl3:
frameworkfor an Internet connected ecosysten ed
978 t 788625821.

Referenc e Books :
Anthony, Mqsrering AWS Security: Credte and maintain a secure cloud ecosystem
(l ed.), Packt
Publishing Ltd, 2017. ISBN I i: 978178829i723.

2. Tevqult, Donald A, Mastering Linw Security and Hardening: Secure your Linux sener-y1
protect it from intruders, malware qttacks, and othef external threats ( I ed.), Packt Publishing
Ltd, 2018. tsBN 178862030s.

Ac!ssw!-!s@e:
Components Internal Assessment Mid Term Exam End Exam Total

'100o/o
Weightage (%) 35o/o 3ovo 35o/o

)
)

R r
E lt UnlversitY, creater Noida
(E51 iLi;.hsd UnCerAct 21r ol Go\4, oi uttar Pradesh
Piot No's B, g, 10, 11, Tech Zone-
Greater Noida-201310
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET463 AryVS Cloud Support Associate L T P C
Owning SchooUDepartmen t Department of Computer Science Engineering 2 0 2 3
Pre-requisites/Erposure

Col,rse Outcomes (COs)

On completion ofthis course. the students will be able to:

COI: To identily the possible scope ofbug, enor, and glitch in system.
CO2: To analyse and solve problems for AWS client/user.
CO3: To get expertise in AWS cloud solutions to solve technology challenges

CO-PO/PSO Mappinq

PO Po2 PO3 PC)4 PO5 PO PO PO PO POI POI POt PSO PSc)2 PSO3
6 7 8 9 0 I 2 I

\ col 3 3 3 3 2
.) c()2 3 3 3 2 3
c03 3 3 3 3 3 3 3 3

l=weakly related 2: moderately related 3:strongly relaled

Course Contents:

Module l: l0lecture hours

Setting up AWS accounts, Accessing Methods of AWS Services, AWS Organizations, AWS Cost
Explorer, AWS Technical Support, Cloud Billing and Support. AWS Well-Architected Framework
Well-Architected Design Principles, Choosing a Region, Selecting Availability Zones, Virtual
Private Cloud. Dividing VPCs and Subnets, Default VPCs and Default Subnets, Controlling VPC
TrafIc, Connecling Multiple VPCS, Integrating On-premises Components, Load Balancing and
Fault Tolerance, High Availability Across Regions, Connections Outside of Amazon VPC,
Designing for High Availability CLOUD Solution, Scaling Data Stores, AWS Lambda and Event-

ls Driven Scaling, Manual AWS Environment Configuration. lnfrastruclure as code on AWS,

Crouping resources in a template, Automating AWS Infrastructure.

Module ll: I I lecture hours

Loose Coupling, Loose Coupling Strategies, Communicating Easily and Reliably Among
Components, Communicaling with Loose Coupling and Amazon DynamoDB, Amazon API
Gateway. Serverless Architectures. Decoupling lnffastructure, Storing Web-Accessible Content
with Amazon, Caching with Amazon CloudFront, Managing NoSQL Databases, Storing Relational
Data in Amazon RDS, Designing Web-Scale Media, Scalable Web Application, Operational
Excellence Pillar, Security Pillar,

,lr;
 Reliability Pillar, Perfomance Efficiency Pillar, cost optimiztion, High- Availability Design
Pattems, Stream Processing Example. Sensor Network Data Ingestion and Processing, Application
Hosts,
Backend, Transcoding and Serving video Files Example, Dedicated Instances and Dedicated
Trusted Advisor, Optimizing Costs with Caching, AWS Cost Calculation Tools' Amazon
CloudWatch. Amazon CloudWatch Monitoring, Amazon CloudWatch Events, Amazon
CloudWatch Logs, AWS CloudTrail, AWS Service lntegration with Amazon Athena' AWS
Config, Elastic Load Balancing, Amazon EC2 Auto Scaling.

Module lll: T lectures hours

Amazon Route 53, Amazon Route 53 Routing, Configure ECz Auto Scaling, Configure Failover
Routing with Amazon Route 53, Continuous Integration and Continuous Deployment on AWS'
AWS
Developer Tools and Services, Database Cluster on Amazon Aurora, Amazon DynamoDB' AWS
DatabaseMigrationservice(AWSDMS),MigratetoAmazonRDS,Tagging,AWSTrustedAdvisor'
Managing Resources, Optimize AWS Resource Utilization, Features of AWS Support plans' creating
Support cases and case management, Monitoring, reso|ving, and reopening the tickeVcase, Access
p"r.i..ions for AWS Support, changing your AWS Support plan, Using AWS Support with an AWS
SDK.
)
Strdio Wor k/l,etroratorv ExD erimenis:

By performing lab work on AWS cloud platform, students will have the knowledge ofthe Design
piin'.ipf.r an; best practices of the R;liability pillar, select comPute, storage' database' and
i',"t*o'rking a"rour"aa to improve performance, evaluate the most important performance metrics
for your aiplications, follow best practices to eliminate unneeded costs or suboptimal resources'
$oubleshoot common erTors.

Text Books :
l. iper, Ben, qnd David Clinton, AWS Certified Solutions Architect Study Gui de: Associqte
P

SAA-CL, tuan ( I ed.), John LViley & Sons, 2020. ISBN 978- l I l9l 38556

Reference Books :
L S Wadia and V ohan, AWS Aclninistation-The Delinitive Guide (2 ed\, Packt Publishing Ltd'
2016. ISBN 9781782173755

).t Assessment Scheme:

lnternal Assessment Mid Term Exam End Exam Total

Components

Weightage (7o) 35% 30% 35% t000

;l.a
v
 Name of Program Ba c h e lo r of Tec h n o logy C o m p u te r s ct en ce an d E n neer n c)
CSET464 Develo lng Solutions for Microsoft Azure L T P C

SchooUDepartment Depa rtment of Computer Science Engineering 2 0 2 3

Owning
Pre-requisites/Exposure

Course Out comes (COs)

On completion ofthis course, the students will be able to:

COI: To articulate Azure IaaS, PaaS, and SaaS solutions.

CO2: To develop the applications using Azure services integration
CO3: To deploy, operate, and monitor Azure solutions.

co-Po/PSO MaDDins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3

6 '7 8 9 0 I 2

col 1 3 3 3
\ c02 3 3 3 3 3 3 2 3
) 3 3 3
co3 3 3 3 3 3

l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: l0lecture hours

Setting up Azure accounts, Azure Console Walkthrough, Microsoft Azure Services, Azure CLI,
Azure Powershell, configuring Azure cLI, Azure Resources & Subscriptions, Azure Resource
Manager, Azure Tags, Azure Storage Account & its types, Azure Blob Storage Azure Content
Delivery Network (CDN), Azure Files Storage. Azure File Sync, Azure Table Storage, Azure
(SAS), Azure Databox,
Queue Storage, Azure Storage Explorer, Azure Shared Access Signature
Azure Storage Replication Data replication options, Azure lmpon/Export Service, Azure virtual
machines. Data disks in Azure Azure VMs and interfaces, ARM templates, VHD templates,
custom images of Azure vM, Virtual machine scale sets. vifiual machine availability sets, App
Service Web App for containers, App Service plan, Networking for an App Service, Deployment
.) slots, Container image.

Module ll: 10 lecture hours

Azure Kubemetes Service, Azure Container Registry, Azure Yiftual networks' Azure
vNetcomponents. Azure M!et subnets, Azure Network Interface cards (Nlc), Network Security
Groups (NSGs). Route tables, Service tags, Azure DNS, Private DNS, Application Gateway, Azure
Froni door Service, Azure Traffic Manager, Application Security Croups, Azure Load Balancer,
Azure, ExpressRoute, ExpressRoute Circuits' ExpressRoute Peering, Azure Firewall, Azure
Bastion, Network watcher, tdentity and Access Management in Azure, Role-based Access control
(RBAC), Role definitions, Role assignment in Azure resources, Azure users and groups, RBAC
policies.
 Module Il I: 8lectures hours

Microsoft azure active directory, Azure Monitoring and Autoscaling, Azure Data Platform, Azure
Migration, Server-side programming model, Triggers, User-defined functions (UDFs), Table Apl,
Cosmos DB graph database, populating a graph, Writing Cremlin queries, Azure Table Storage,
integrate caching and content delivery, Configure cache and expiration policies for Azure Redis
Cache Connections, App Configuration Azure Key Vault, Key Encryption, expiration.

Studio Work/Laboratorv Experiments:

Studio work covers accessing Azure cloud services with handling data migration based on provided
architectural requirements using Azure migrate service. Learners would be able to create and
migrate Azure virtual machines and create slorage accounts and application gateways for aiding
Azure Migrate. They will also develop the applications using Azure services by using cloud
architecture.
Text Books :
) 1. Orban ond Slephen, Aheod in the Cloud: Best Practices for nqvigqting lhe Future of Enterprise
lT (1 ed.), CreateSpace lndependent Publishing PlatJbrn, 2018. ISBN 978198t9243t8.

2. Modi, Rilesh, Azurefor Architects: Implementing cloud design, DevOps, containers, IoT, and
serverless solutions on your public cloud (2 ed.), Packt Publishing Ltd,, 2019. ISBN
978 t 7883987 32.

Reference Books :
l. Benjqmin Perkins and William Panek, Microsoft Azure Architect Technologies, and Design
Complete Study Guide: Exans AZ-303 and AZ-304 (led.), Wiley Publication, 2020. ISBN
9781 I 19559573.

Assessment Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (o/o) 350/" 30vo 350/. 100%

.)

.,, ,::'il . , r..,

1,a,a,,
1 , : .: ,: ,-::lr)
, i, tlcir
'r
7_c,re-ll
C;:. .:.: . l,:, ll
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET465 Coogle Associate Cloud Engineer L T P C
Owning SchooUDepartment Department of Computer Science Engineering 2 0 2 3
Pre-req u isites/Exposu re

Course Outcomes (COs)

On complerion of rhis course. lhe sludenls will be able to

COI : fo articulate the Coogle cloud services and platform

CO2 : To integrate cloud resources and services using Google cloud.
CO3 : To develop, deploy and monitor secured cloud-based solution on the CCP Platform
CO-PO/PSO Maooins

PO PO2 PO3 PC)4 PO5 PO PO PO PO POI POt POI PSO PS02 PSO3
I 6 7 8 9 0 I 2 I
col I 2 ) I l
) co2 3 3 I 2 I 3
.t
co3 2 2 3 2 3 3 I I

l:weakly related 2= moderately related 3:strongly related

Course Contents:

Module l: l0l€cture hours

Setting up cloud projects and accounts, creating projects in GCP, Viewing Google Cloud Platform
Status Cloud Console, Cloud Shell, Cloud SDK, Configuring access and security, Assigning users
to predefined IAM roles within a project, Managing users, groups, and roles in Cloud ldentity,
Enabling APIs within projects, Provisioning one or more Stackdriver workspaces, Managing billing
configuration, Creating one or more billing accounts, Linking projects to a billing account,
Establishing billing budgets and alerts, Sening up billing exports to estimate daily/monthly charges,
Billing Services, Configuring the command line interface (CLI), Accessing services using CLI,
Working with GCP SDK, lntegration of CCP Platform with other Cloud Services.

t Modrle Il: l0lecture hours

Planning and estimating GCP product use, Pficing Calculator, Planning and configuring compute
resources, Selecting appropriate compute choices for workload, Compute Engine (20) Google
Kubernetes Engine, App Engine, Power Shell, Cloud Functions, Deploying and implementing
Compute Engine resources, deploying a Google Kubemetes Engine cluster, Planning and
configuring network resource, Load balancing options, Identirying resource locations in a network
for availability, Configuring Cloud DNS, Deploying a container application to Google Kubemetes
Engine. Auto Scaling in Google Kubemetes, Handling Fault Tolerance in Google Kubemetes.

Module lll: 8 lectures hours

Deploying and implementing data solutions, Cloud SQL, Cloud Datastore, BigQuery, Cloud
Spanneq Cloud Pub/Sub, Cloud Bigable, Cloud Dataproc, Cloud Dataflow, Cloud Storage,
 Loading data, Deploying and implementing networking resource, Monitoring and logging, Creating
Stackdriver alerts based on resouce metrics, Creating Stackdriver custom metrics, configuring log
sinks to export logs to extemal systems, viewing and filtering logs in Stackdriver, viewing specific
log message details in stackdriver, cloud diagnostics, cloud Trace dat4 cloud Debug to view an
application point, Case Study.

Studio Work/Laboratorv Experlments:

studio work focuses on the Google cloud platform ofdeploying, monitorin& and maintaining
projects on Google Cloud.

Text Books :
L Legorie Raja4 Steven Porter, and Ted H*ttet, Building Google Cloud Platform Solutions (l
ed.), Pack Publishing 2019. ISBN 97818386474382.

Reference Books :
l.Legorie Raja4 Sreven Porter, and Ted Hwter, Building Coogle Cloud Platform Solutiorc (l
ed.), Packt Publishing 2019. ISBN 97818386474382.
)
AssfslcullSs@r:

Components Internll Assessment Mid Term Exam End Exam Total

\treightsge (%) 35o/o 3V/o 35o/o r00%

:ilrar G rca Dr llclLla

U irl'lr t.li i_v, FI:J::h
Be nrrt. '1i,1, illl ar
tlJr :l -k';
(E:tr-i
1') 11, cl r Zcne-
Plot l3
Gte airlr I l:;l'; . -u 10
 Name of Program Ba c h € lo r of T ec h n ology (Co m P u t er Sc I en ce A n d E ng I n een n c)
CSET466 S cial T ics in Cloud Com utin
L T P c
Owning SchooUDePartment De pa rtm e n of C om p u te r S ct e n ce E I! I n e€ rt n 2 0 2 3

Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis cou$e, the students will be able to:

COI: To familiarize and leam about the latest trends and research in the field'
tools'
CO2: To equip themselves wilh the conceptual and practical experience of few latest methods'
technologies or algorithms in Cloud Computing.

co-Po/P MaDDins

PO4 PO5 PO PO PO PO POI POt POI PSO PSO2 PS03

PO PCJz PO3
6 7 8 9 0 I 2 I

1 2
cor 2 3 3 I
co2 3 3 3 3 I 3
)
t=weakly related 2: moderately related 3=strongly related

Course Contents:

l: 28 lectur€ hours
Modute
Thi, the cutting-edge topics in Cloud Computing, and these modules will be chosen
"our." "ot"r,
by the instructor bas"d on thJrequirements and relevance at that point of time' These
modules need

toberelevanttotheindustryandstafl-upswillalsoincluderelatedcasestudies,usecasesand
get real hands-on
implementations scenarios. Students will be working on lab work and projects to
experience ofthese topics and modules.

StlIdio WorldLaboratorv ExDeriments:

students will gain practical experience by using tools and technologies related to cloud
computing.

-._'
Text Books :
qnd Daniel Kirsch., cloud Computingfor Dummies Hoboken (I ed )'
l. Judirh s. Hurwitz
) John ll/itey & Son, 2020 ISBN 978-l I19546658'

2 Chandra Rajasekharuiah, Cloud-Based Microservices: Techniques, Challenges' and

Solutions (l ed.), Apress,2020. ISBN 978-1481265642

J
Assessme t Scheme

Components lnternal Assessment Mid Term Exam End Exam Total

Weightage (%) 35Yo 30o/o 35% l00o/o

A./
._ tv.1_
i,, .,.",ry, Gre ,cr Noida
; 1' r" :: .. r ,,i';li,!,.J,; j;1;"lii,
i-l'il6li

G;i:;ier l'J:i,-:: l0 i 310

) General
Electives
(Elective II,
,
IY, VD
 Name of Program Bachelor of Technology (Computer Science and Engineering)
csET468 Drone Application, Components & Assembly L T P C
Owning SchooVDepartment Department of Computer Science Engineering 2 0 2 3
Pre-req uisites/Exposure

Course Outcomes (COs)

On completion ofthis course, the studenls will be able to

COI: To understand UAVs, UAV application, needs" deployments, and advancements

CO2: To construct mullirotor UAVs from scratch using various flight controllers.

CO-PO/PSO Manoins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POt POI PSO PSO2 PSO3
I 6 7 8 I 0 I 2 I

cot 3 I 2 3 2 t 1 2 I ) 2 3 3
) co2 2 2 2 I 2 I I 7 1 1 2 )

l:weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 6lecture hours

Technological Advancements; Unmanned Aerial Vehicles; Unmanned Aerial Systems; UAV Concept
of Operations (CONOPs): UAV Chemical, Biological, Radiological and Nuclear (CBRN); UAV
Classification: Wing Ceometry Based, Payload Based, Size Based, Mission-Based, UAV Anatomy,
Mission Planning

Mod[le ll: E lecture hours

Wing Configuration and Thrust; Airframe Configuration; Aerodynamic Configuration; Vibration and
Noise; UAV Propulsion; Propeller Modelling; Motor Modelling: UAV Communication; Radio Wave
Communication; Microwave Communication; Line of Sight Communicalion; Beyond Line- of-Sight
Communicationl Waypoint Tracking navigation.

-) Module III: T lectures hours

Sensor Calibration: Tracking using GPS; UAV Stability; UAV Controllability; Flight Control;
Autonomous Control; Semi-Autonomous Control.

Module IV: T lectures hours

Drone Sensing and lmagery: Riverine. Aquatic, Agriculture. Vegetation and Forest Ecosystem, Oil and
Gas, Surveillance, Search and Rescue; UAS Ground Control; Human Machine Interface; Computer
Telemetry; UAV Launch System; UAV Recovery System.

Studio Work-/Laboratorv Exoeriments:

ii:, ll )
,rl r.:-ll
 In Lab work, students will start with basic Multicopter design principles, components, and assembly
precautions. Then finally design and develop a fully functional Multicopter UAV/Drone using off- the-
shelf Flight Controllers.

Text Books :
l. Quan Quan, /r?r/ oduction to MubicoPter Design and Control (l'r ed.), Springer,20l7. ISBN 978-
981t033810.

Reference Books :

l. R Kurt Bqrnhart,Douglas M. Marshall Eric Shappee and Michael Thomas Most, Introduction to
unmanned aircraft systems (2 ed.), CRC Press,2016. ISBN 978-1482263930-

2. Quan, Q., Dai, X., and Wang, S-, Multicopter Design and Control Practice: A Series Experimefis
Based on MATLAB and Pixhowk (l!ed.), Springer,2020. ISBN 978'9811531392.

Assessment Scheme:
)
Components lnternal Assessment Mid Term Exam End Exrm Total

Weigbtage (%) 35o/o 30o/o 35o/o 100%

r)

R tal
nne 1i Univer-sity, Greater Noida
(Er1iL,l,:ll i J U i.l.: r\jl 2.'i rJ C,rU oi Urt.]l Pradesh)
Plot No's 3, 0, 10, '11 , I-ech Zone-ll
Greate i NoiC:-2013'10
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET48! Software Testing L T P C
Owning SchooUDepartment Depa rtment of Com puter Science Engineering 3 0 0 3
Pre-requ isites/Exposure

Course Ou mes (COs)

On completion ofthis course, the students will be able to:

COI: To articulate the various software testing methods.

CO2: To make use ofthe various test cases for different types and level of testing'

CO-PO/PSO Mappinq

PO PO2 PO3 P04 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3

I 6 7 8 9 0 I 2 I

CO
.,
3 I 3
I
CO 3 I 3
)
2

l=weakly related 2= moderately related 3:strongly related

Course Contents:

Module I: l0lecture hours

Software testing, testing objectives. Principles ofSoftware Testing, Testing and debugging, Test metrics
and measurements

Module Il: I I lecture hours

verification, Validation and Tesling, Software Quality and Reliability, software defect, Manual and
Automation Testing, Software Testing Life Cycle, Phases of STLC, Test Case Preparation'

Module lll: l0lectures hours

Testing Techniques: whire Box Testing, Black Box Testing, unit Testing, Integration Testing, user
Acceptance Testing, Alpha and Beta Testing, Smoke Tesling, Sanity Testing, Regression Testing'
) lV: lectures hours
I I
Module
Formal Testing, lnformal Testing, Monkey Testing, Re-Testing, Load/stless Testing, Ad hoc Testing:
Pair testing, Exploratory testing, Iterative testing, Defect seeding.

Text Books :
1. S. Linye, Software Testing - Principles, Techniques ancl Tools (1'' ed.), McGruw Hill Education,
2 0 I 7. |SBN 97 80070 I 39909.

Referen Books:
l. Pressman R 5., SoJiware Engineering: A Prqctilioners Approach (7h ed.), McOrav, Hill, 2019
rsBN 978-0073375977.
 4!!9E!Eg!S9@9:

Components Internrl A}se$ment Mid Term Exam End Exrm Totrl

Weightagc (o/o) 35o/o 3ff/o 35% 100%

WK
pfinett University, Greater Noida

5[i[iAi{,.#fiitxiriu#*l
 Name of Program Bachelor of Technology (Comptrter Science and Engineering)
CSET482 Computing Start-Ups L T P C
Owning SchooVDepartment Department of Computer Science Engineering 3 0 0 3

Pre-req uisites/Exposure

Course O mes (COsl

On completion ofthis course, the students will be able to

COI : Understanding ofcomputing start-ups.

COZ : How technology can change or upswing the scenario.
CO3 : Proposed an idea for start-up and applicability oftechnology (ldea to Start-up)

Co-PO/PSO Maopins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PSO2 PSO3

I 6 7 8 9 0 I 2 I

col 3 3 1 2

cCl2 3 2 3 2 3
., ", 3 3
co3 2 2 2 3 3 2 2

l=weakly related 2= moderately related 3:strongly related

Course ontentt:

Module l: 20 lecture hours

what Does 11 Mean to Be a Startup Entrepreneur?, Engaging others with Actionable Next steps,
Benefits vs. Features, Simple strategies to Get unstuck, The Financial Model, The Legal Setup ofYour
Startup, Meetings and Communication Skills.

Module ll: 22 lecture hours

Startup Crants: Can Govemment Programs Stimulate Entrepreneulship?, Venture Capital and Angel
lnvestors Incubators and Accelerators Incubators and Accelerators, Moving Past the Startup Stage, How
Univetsities Can Suppon Their Startups Today.

Studio Work/Labo torv ExDeriments:

)
Project based leaming according to computing start-up idea. Each lab has specific targets to identify
the outcome of lab and evaluate them accordingly. A mentor will be assigned to each individual team
for guiding them for their project (Technology and formalizing idea).

Text Books :
l. B.tchir Brahin, The Colony of tnnov(tive stqrtups ( I ed.), 2020.lsBN 97891519587 40

Reference Books :
t. Wrighl Mike qnr) Philippe Mustar, Student Slqrl-ups: The New Landscape OfAcademic
Entrepreneurship (l ed.), IYSPC, 2019. ISBN 9789811208123.
 Assessment Scheme:

Componelts Internal Aslessmcnt Mld Term Exam End Exsm Totil

Wetghtage (%) 35o/o 3V/a 350/o l00q/o

R
Universit y, Grea ter Noida
(Eri ed Und.3r Act 2,: ol Govt, cl Ullar
Pradesh)
Pi.,l i'Jo's e, I 10, 'i1, Te ch Zone-it
G -l.r - :l:, -
'laJll
 Name of Program Bachelor ofTechnology (Computer Science and Er gineering)
csET483 Career Skills for IT Com panres L T P C
Owning SchooUDepartment Department of Com puter Science Engineering 2 0 2
Pre-requ isites/Exposure

Course 0utcomes tCOs)

On completion ofthis course, the students will be able to

COl: To impart aptitude, reasoning, technical and soft skills rhat would aid in the employability of
the students.
CO2: To develop both personal and professional skills effectiveness.
CO3: To help students to gain a confidence for the upcoming placements.

CO-PO/P MaDDins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POt POt PSO PSC)2 PSO3
6 7 8 9 0 2 I
col 3 3 2 2 1
co2 2 ", 2 3 2 3 3 3 2 2
co3 3 3 2

l:weakly related 2= moderately related 3:strongly related

Corrrse ontents:

Module l: l1 lecture hours

lntroduction to Problem Solving; Prime Numbers; GCD; LCH; HCF; Theorems of Divisibility;
Divisibility Rules; Remainder Theorem; Counting; Arithmetic progression; ceometric progression;
Hamonic; Progression; Averages: Allegations; Ratio; Proponion; Variation; Interest; Time and Work;
Negative Work; Product Constancy; Equivalence Method; Efijciency; pipes and Cistems; Boats;
Relative Motion; Opposite Motioni Straight Lines; polygons; Triangles; euadrilaterals; Circlesi
Tangent; Eclipse; Star; Functions: Tabular, Graphical, Even Odd, lnverse; lnequalities; Logarithmic;
Graphical View of Logarithmici Properties of Inequalities: Notion of Ranges, Linear lnequality,
Quadratic Inequality; Permutation; Circular Permutation: Combination; probability; Real Life
Estimation ofProbability: Conjunction AND, Conjunction OR; Concept for Odds for and Odd Againsr;
Set Theory; Operations; Algebra; Coordinate Theory; Cartesian Coordinate System; Rectangular
Coordinate Axes.

Module ll: I I lecture hours

Data lnterpretation: Representation of Data. nature of Data, Capturing of Data, Organization of Data,
Tables, Bar Charts, X-Y Charts, Pie Chans, Cases; Logical Reasoning; Reasoning Analogies; Artificial
Language; Calendar; Cause and Effect; Clocks; Critical pathl Directions; Data Interpretationl
Deduction Reasoning; Statement Analysis; Data Sufficiency; puzzles; pattem Series; Embedded
Images; Figure Matrix; Picture Series; Pattem Series; Shape Construction; Statement and Assumptions;
Statement and Conclusions; Syllogism; Verbal Reasoning.

Module III: l3 lectures hours

 Communication Skills; Listening Skills; Team Building; Asseniveness; Group Disoussions; penonal
Interview; HR Communications; Specific Applicatioos; Essay; Memo; CV; Busin$s Letter; press
Release; Policy and hoject Proposal; Repot; Minutes; Email; $ocial Media for professional purposes;
Editing Documen*; Crisis Communication; Getting your I&as Acmss.

Studio Work/Laboratory Experlmstrts:

Problsms based on search enginos and conmon open-source software to perfom common methods of
exploratory and predictive analysis. Application of toxt analysis techniques for data analysis.
Performing sentiment analysis.

Text Books :
l. Shorma Arun How to Prepuefor LOGICAL REASONING (6 ed), Mcoraw Hilt Educarion,202t.
rsBN 9354600557.

2- Shorma Arun, Quantitatlve Aptitude (8 ed), Mfiraw Hill Education 20t8. ISBN gZAg3S3l60tB0.

i. Gttbord Hans, Handbookfor Professiorul Communicaion (l ed.), yerlag GD publishtng Liniled

and Co KG, 2020. ISBN 9783744870788.

) Rcfercnce Books :
1. Agarwal R $ Quafititative Aptitude for Competitive bamlnations (l ed), S Chand publishing
2017. ISBN 9i52534026.

2. Agowal R S, A L{odern Approach To VerM & No*Verbal Reasoning (2 ed.), S Chand

Publishing 2017. ISBN 9352832167.

Ass€ssment Scheme:

Components Internal As3essmen, Mld Term Erem End Exrm Tot l

Weightlge (%) 35o/o 3V/o 35o/o l00o/o

-)

Reg ter Noida

Grea
tt UniversitY,of Olrvt,
Be 01 Llitar Pradesh)
shed Uoder Act 24
(E5
PI ot NO,S B, o to 11,Te ch Zone'll
G reater No lda-au I
310
 Name of Program Bachelor of Technolo&y (Computer Sci€nce and En gineering)
CSET485 AI & Society l. T P C
Owning SchooUDepartment Department of Com puter Science Engineering 3 0 0 3
Pre-req u isites/Exposure

Course Outcomes (COs)

On completion of this course. rhe students will be able to:

COI : To aniculate the ethical issues related to the development and adoption ofAI
co2 : To examine the ways in which AI is impacting culture and communities.
c03 : To understand the impact of Al to make il more useful.

CO-PO/PSO MaDninq

PO P02 PO3 PO4 PO5 PO PO PO PO POt POt POI PSO PSO2 PSO3
6 7 8 9 0 I 2
col 2
,,
l I 3
) co2 3 I 3
c03 2 3 t 3

l:weakly related 2= moderately related 3=strongly related

Course Contents:

Module I: l0 lecture hours

Terminology ofAI, realistic view of Al, AI Timeline, AI system illustrations, AI Failures / challenges,
case study /critical discussions on curenl applications ofAI across a range ofdomains and sectors:
Finance: conventional risk models, Environmental, social, and Governance (ESG) Criteria, chatbots
and virtual Assistanls, Relationship Manager Augmentation , Health care: Health data management,
Treatment pathway design, Surgical robots, supporting pharma: drug creation and clinical trials,
Agriculture: tntelligent spraying of chemicals, AI-based robots for farm harvesting , national security:
Emerging Threals in the AI Era. Autonomous weapons syslems, Risks associated with A[-Enabled
warfare, An and culture: virtual visits, Language Preservation, Interpreting expressions, painting by
numbers-

Module llr l6lecture hours

) Al Ethics: Human-centred values and fairness, Ethical governance, Ethical auditing. Ethical lssues,
Data access problems Healthcare Sector - Ethical Considerations, Explainable AI, Model
interpretability: clobal Interpretation and Local Interpretation, The Trade-off Between Accuracy and
Interpretability, Interpretation Techniques: Feature lmportance, panial Dependence plots, Local
lnterpretable Model-agnostic Explanations, Transparency in Al: Model cards, Datasheets for Datasets,
Fact Sheet, Faimess: AI Fairness 360, AI Explainability 360 Decision Tree, Bias in AI, Types of Bias:
observer bias, Prejudice bias, cognitive bias, Exclusion bias, Racial bias in healthcare risk algorithm,
AI leaming unhealthy stereotypes, combating Bias in AI:Use less bias or more inclusive data, Diverse
workforce, Legal liability: Manulacturer (product) Liability, product Liability Defenses Applied to
AVs, lnsurance Liability, Insurer's Key challenges, Autonomous vehicle Levels, product Liability
Defenses Applied to aulonomous vehicle, Liability Due to Hacker Attacks, Role of the Regulatory
Bodies.

Module III: g lectures hours

L] .tt I; iv.rr,ry c ="lfiT.l!ir

'; tr-r' r1, tirlr Zone-ll
al r i-- i: i('l f i : ..'l. -:,'1-''11)
 Attacks on AI: Adversarial attacks, Physical attacks, Membership inierence attack, The Need for
Responsible AI Understanding lhe Al system's functioning for safe and reliable deployment, Post-
deployment--can the relevant stakeholders of the AI system understand why a specific decision was
made, Consistency across stakeholders, Incorrect decisions leading to exclusion from access to services
or benefits, accountability of AI decisions, Dimensions of AI Accountabili4/: Assess governance
structures, Understand the data, Define performance goals and metrics, Review monitoring plans, AI
and Data Privacy: AI policy options for privacy protection, Policy documents and working drafts on
Artifjcial lntelligence, Societal Considerations in Al: Technology Based Approach for Managing Al
Systems, Principles for Responsible Management ofAI Systems, Societal Considerations in AI: lmpact
ofAl on job displacement.

Module lV: T lectures hours

Case study: Future in the balance? How countries are pursuing an AI advantage, Review of Global
Regulatory Landscape, Guidelines for Trustworthy AI, Preparing forjob transformation and building
skills, Role of AI in the ecosystem for persons with Disability: Personalisation and Customisation,
Neurosymbolic AI, Recommendations for Integrating Cender Equality into AI Principles, The Effects
ofAI On Child Psychology, Principles for AI in society, Guidelines for AI developed by stakeholders,
How do countries seek to develop competitive advantage in AI?, Faster conditions, Demand conditions,
Related and supponing industries .

)
Text Books :

I . Kumqr Puneel, Vinod Kumar Jain and Dharminder Kumar, Artificial lntelligence and Global
Society: lmpqct qnd Prqctices (lst ed.), CRC Press,2021. ISBN 0367439133.

Reference Books :
1. OECD, ArtiJiciol lntelligence in Society, 2019, Publisher (lst ed.), 2019. ISBN
9789264515199.

Assessmenl Scheme

Components lnlernal Assessment Mid Term Exam End Exam Total

Weightage (%) 3s% 3ovo 35% t00vo

)
 Name of Program Bachelor of Technology (Computer Science and Engineering)
CSET486 Special Topics in Computer Engineering L T P C
Ownirg SchooUDepartment Depa rtment of Computer Science Engineering 0 0 I
Pre-requisites/Exposure

Course Out omes (COs)

On completion ofthis course, the students will be able to:

COI: To familiarize and learn about the latest trends and research in the field.
CO2: To equip themselves with the conceptual and practical experience offew latest methods, tools,
technologies or algorithms in Computer Engineering.

co-PO/PSO Mappins

PO P02 PO3 PO4 PO5 PO PO PO PO POI POt POI PSO PS02 PS03
6 7 8 9 0 I 2 I

col 2 J t J 2 ) 2 J
,,
3
co2 I 3 3 3 3 2 I 3
) 2 2

l=weakly related 2: moderately related 3:strongly related

Course Contents:

Module l: 42 lecture hours

This course covers the cutting-edge topics in Computer Engineering, and these modules will be
chosen by the instructor based on the requirements and relevance at that point of time. These
modules need to be relevant to the industry and start-ups will also include related case studies, use
cases and implementations scenarios. students will be working on lab work and projects to get real
hands-on experience ofthese topics and modules.

Studio Work/Laboratorv ExDeriments:

Students will gain practical experience by using tools and technologies related to Computer
Engineering.
Assessm t Scheme
)
Components Internal Assessment Mid Term Exam End Exam Total

Weightage (%) 35o/o 30% 35./. 100%

/. i: .t ",.1r j'lci.-ia
.. r' :.rr i r- i-:l)
.i
:, ; -.4il Zoi):l-ll
i.. : 1t)
 Name of Program Bachelor of Technology (Computer Science and Engineering)
ECSE233L Human Computer Interface T P C L

Owning SchooUDepartm€nt Department of Computer Science Engineering 3 0 2 4

Pre-requ isites/Exposure

Course Outcomes (COs)

On complelion ofthis course, the students will be able to:

COI : Analyze models on user centric design process and test the appropriateness of individual
methods for a given problem.
CO2: Leam information gathering and usage oftools for analysis and user requirements.
CO3: Implement interaction design basics and associated design rules.

CO-PO/PSO MaDDins

PO Po2 PO3 PO4 PO5 PO PO PO PO POI POI POI PSO PS02 PSO3
6 7 8 I 0 I 2 I
cor 2 3 3 2 2 3 2 3 3
c02 3 1 2 2 2 3 2
co3 a 2 2 2 2 a ", 2 2

l:weakly related 2= moderately related 3=strongly related

Cours€ Contents:

Module I: 12 lecture hours

Inlroduction to graphical user interface: Importance of user Interface - definition, importance of good
design, benefits of good design, a brief history of Screen design. Popularity of graphics, graphical
system, Web user - Interface popularity, characteristics- Principles of user interface. Design process:
lnteraction design basics, Human interaction with computers, design rules, implementation support.
Prototyping, Heuristic Evaluation, Experimental Design.

Module ll: 12 lecture hours

Models and Theories: Cognitive Models- Goal and task hierarchies, Mental Models, Design Principles
and Heuristics. Distributing Cognition, lnformation Modelling and Designing. User-Experience:
Design and Research. Psychology and Human factors, Conceptual Models, Mistakes and Error. Social
Psychology, Interface implementation & evaluation: With and without users.
)
Module III: 9lectures hours
Social Computing: Introduction to social computing, collaboration, social computation units. Power of
the Crowd, crowdsourcing, crowdsensing, ubiquitous computing, intemet of things. Experimental
Design. Experiments designing concepts and methods, exploring data, one and two sample tests.

Module IV: glectures hours

A/B testing, T-tests, data assumptions and distributions, one factor test with human subjects.
Interpretation ofnon-numeric response ofhumans, generalized linear models Case studies.

Studio Work/Laboratorv ExDeriments:

(
 Focus on designing and implementing visually appealing graphical user interfaces,
conducting experimental validation of developed methods and models. To implement and
test all the related programs and prototypes on relevant tools and technologies.

Text Books :
l. Galitz Wilbert O., The Essential Guide to User lnterface Design: An lntroduction to GUI
DesignPrinciples and Technique (2N ed.), John Wiley & Sons, 2007. ISBN 978-8126502806.

@
1. Dix, J- Fincay, G. D- Abowd, and R Beale, Human Computer lnteraaion (3d ed.),
Pearson Education, 2003. ISBN 978-01 30461 094.

2. Lauesen 5., User lnterface Design: A Software Engineering Perspective (1"' ed.), Addison-
Wesley, 2004. ISBN 978-032118143.

Assessment Scheme:

Compotrents Internal Assessment Mid Term Exam End Exsm Total

) Weightage (%) 35o/o 30o/o 35o/o l00o/o

B tt Univcr"iity, Gleartcr Noida

Ur d.rA.l 2'1 oi (lJvl, fi L't1.lr Pra'Jc5h)
(!ri .!i,shed
f i3 t No's B, 9, 1 I, 1 l, le ch Zone-ll
Greaier l'loiC.r-?0 i 3'i Cl
 Name of Program Bachelor of Technology (Computer Science and Ergineering)
csET382 Web Technologies L T P C
Owning SchooUDepartmeDt Department of Computer Science Engineering 3 0 0 3
Pre-req uisites/E xposure

Course Outcomes (COs)

On completion ofthis cou6e, the students will be able Io

COI: Understand and write a well formed / valid XML document.

CO2: Leam to connect a java program to a DBMS and perfonn insert, update and delete operations on
DBMS table,
CO3: Develop dynamic webpages usingjava script and DHTML.

CO-PO/PSO Mappine

PO Pc)2 PO3 PO4 PO5 PO PO PO PO POt POt POt PSO PS02 PS03
6 7 8 I 0 I 2 I

) cot 3 3 1 2 2 3
c02 3 3 ) 2 3
c03 2 3 2 3

l=weakly related 2= moderately related 3=strongly related

Coursc Contents:

Module l: 8 lecture hours

web Evol[tion Overview: Explore the evolntion of the web from its inception to lhe present day.
Understand key milestones that have shaped the development of rveb technologies. Foundations of
Web Systems: lntroduction to the OSI Reference Model and its relevance in web architecture.
Overview ofthe TCP/IP Model and its role in facilitating communication on the web. Understanding
W€b System Architecture: Web Architecture Essentials: Explore the fundamentals ofweb system
architecture.Delve into the components that make up a robust and scalable web infrastructure. Tier
Web Architecture:Undsrstand the principles behind 3-Tier Web Architecture. Explore the benefits
and challenges associated with this architectural approach. Layers in the TCP/IP Model: 5. TCP/IP
) Model Layers: Breakdown ofthe layers in the TCP/lP nrodel and their functionalities. Understand how
each layer contributes to the seamless functioning of web communication .Web Browsers: 6.
navigating Web Browsers:Overview of popular web browsers and their unique features.Explore the
role ofweb browsers in rendering and interpreting web content. Overvi€w ofHTTP: 7. Understanding
HTTP:Explore the Hypertext Transfer Protocol (HTTP) and its role in web comnrunication.Understand
the request-response model and the importance of status codes. Exploring Web Technologies: 8.
Diverse Web Technologies: Introduction to a variety of web technologies shaping the modem web
landscape. Explore emerying trends and their impact on web development. lntroduction to Web
Services: 9. Web Services Fundamentals: Understanding the concept of web services and their
significance in distributed systems. Explore tlre different types ofweb services and their use cases.

About ltS: I0. Insights into llS: - Overview of lntemet lnformation Services (IIS) and its role as a
web server. - Explore the features and capabilities that make IIS a popular choice for hosting web
applications.

" , ilr -l.i lJoide

,. I.r. ii { ':.ii'r':lr)
, ,' , i;, l;clrZorrc-li
r:: l1a-lii)
 Services Support€d by IIST: ll. llST Service Portfolio: - Detailed examination of the services
supported by IIS7. - Understand how IIST facilitates hosling and managing various types of web
content. lnstallation of IIST: 12. llST lnstallation Process: - Step-by-step guide to installing IlST on
different platforms. - Explore configuration options and best practices for a successful installation.
Administ€r Web Server Remotely; 13. Remote W€b Server Administration: - Techniques for
administering a web server remotely. - Understand security considerations and protocols tbr remote
server nranagement.

Creating Web Sites: 14. Web Site Development Ess€ntials: - Step-by-step guide to creatirg web
sites using different development tools. - Explore best practices for designing and implementing
eflective web interfaces

Modul€ ll: glecture hours

HTML Document Structure: Understanding the Document Object Model (DOM) Document
Validation and Best Practices Semantic HTML Tags for Improved Accessibility Creating Engaging
Headings: Implementirg SEO-friendly Heading Structures Customizing Headings with CSS Styling
Responsive Design Considerations fbr Headings Exploring navigation Links: Advanced Linking
Techniques Incorporating navigation Menus Utilizing Anchor Tags for Smooth Page Scrolls Crafting
Dynamic Paragraphs: Formatti|tg Text with CSS Styles lmplementing Responsive T1'pography
) Enhancing Readability with Line Heights and Margins Enhancing Content with Multimedia:
Optinrizing Inrages for Web Interactive lmage Galleries Lazy Loading Techniques for Improved
Performance Mastering Tabular Data: Advanced Table Styling with CSS Responsive Tables for
Mobile Devices Accessibility Considerations for Tables Modern Frames and Layouts: CSS Grids
and Flexbox for Layouts Creating Responsive Multi-column Designs Flexibility with CSS Media
Queries Form Design and lDteractiye Controls: Building User-friendly Forms Advanced Form
Validation Techniques Customizing Form Controls with CSS CSS Mastery with Cascading Style
Sheets: Advanced CSS Selectors and Specificity CSS Variables for Efficient Styling Creating Custom
CSS Frameworks

Dynamic HTML (DHTML) Techniques: Interactive Page Elements with DHTML Dynamic CSS
Styling Smooth Page Transitions using DHTML JavaScript Beyond Basics; Modem Javascript
Features (E56+) Asynchronous Programming rvith Promises Error Handling and Debugging Strategies

Client-Side Scripting Choices: Evaluating the Pros and Cons of JavaScript and Other Scripting
Languages InteBrating External Libraries for Enhanced Functionality Perforntance Considerations in
Client-Side Scripting Embedding Scripting Magic: ExtemalizinB Javascript for Code Modularity
Best Practices for Script Tag Placement Security Considerations in Script Embedding Event-driven
Programming: Handling Events with Event Listeners Event Delegation Techniques Custom Events
for Cross-component Communication JavaScript Variables and Data Types: Understanding Variable
) Scope Exploring Data Types and Conversions Memory Management in JavaScripl Arrays Unleashed:
Advanced Alray Methods and lteration Multidimensional Anays and Nested Structures Perfonnance
Considerations wilh Large Arrays Obj€cts in Depth: Creating and Manipulating Objects Object
Prototypes and Inheritance Practical Design Patterns with Objects Masterirg Javascript Op€rators:
Unraveling Unary, Binary. and Ternary Operators Logical operators and Sho(-circuit Evaluation
Operator Precedence and Associativity Control Flow Mastery: Switch Statements and Advanced
Conditional Logic Iterative Statements beyond the Basics Error Handling with Try...Catch Funclion
Powerhouse: Function Expressions vs. Declarations Arrow Functions and Lexical Scoping Functional
Programming Paradigms in JavaScript

Module III: 9lectures hours

l.lntroduction to PHP: Overview of PHP and its role in web developmert. Underctar'rding the seryer-
side scripting concept. Imponance of PHP in building dynamic web applications. Variables and
 application in
constants in PHP: Declaration and usage of variables in PHP. Constants and their
Program Flow Control:
maintaining fixed values. Best pmctices for variable naming and data types'
(for, while, foreach)
conditional statements for decision-making (if. else. elseif). Looping structures
and their implernentation. Switch statements for efficient code organization'

Functions in PHP: Defining and calling functions. Parameters and retum values in functions
Scope

of variables inside and outside functions. Arrays in PHP: Creation and manipulation of arrays'
Associative arral's and their significance Array ftrnctions for efficient data handling
File and
with file paths.
Directory Handiing: Reading and writing to files. navigating directories and working
Filepermissionsandsecurityconsiderations.FormsandDatabaselnteraction:HandlingHTML
Data validation and
fomrs using PHP. Basic database operations: connecting' querying' and updating
with PHP Examples: Establishing a corrnection to
sanitizatiori in tbrms. Basic Database Commands
and table names. creating.
a server. creating and selecting databases. Listing available databases
altering, and deleting tables. Inserting and Querying Data: Inserting data into tables Executing
queries and retrieving results. Best practices for secure database interactions

Module lV: 8lecture hours

lntroduclion to Web Development in Java: Overview of Java for Web Applications Exploring
JavaBeans Understanding Servlet Programming Java Server Pages
(JSP) Mastery In-depth Study of
(JDBC) Essentials
JSP Advanced Techniques in JSP Development Java Database Connectivity
)
DatabaselnteractionwithJavaHands-onJavaDatabaseProgranlmingASP.NETFundamentals
Essentials of ASP.NET 3 5 Developing Web Applications with ASP NET Web
Application
ArchitectureDesigningEffectiveApplicationstructuresManagingApplicationStatelnteractile
web Forms stand;d c;ntrols for web Forms Advanced navigation co[trols: Tree view, Meru,
and
Validation controls Best Practices in Form
site Map Path Form validation strategies Implementing
Validati,on web Parts and Database lntegration Exploring web Parts controls
Efficient Database
ControlsUsageEnhancingSecuritywithLogincontrolslntrodurtiontoLoginControls
pages and Theming Techniques Inside Master Pag€s:
Implementinglecure Authentication Master
Advanced Concepts Theming for Web Application Aesthetics Web Application
Maragemert
Performance Globalization itl
Effective web Application Governance optimizing web Application
Web Development Strategies for Application Globalization lnternationalization Best Practices

8 lecture hours
Module V:

lntroduction to XMl:Overview of XML (eXtensible Markup Language)'XML syntax

and^struciure
ofxML in lr Basic and Advanced XML: Fundamental concepts of xML
n"neirts ano apptications
Advanced XML featu.e, and techniques,XMl Schema for document validation Java API for XML
f.o."iring' lntroduction to JAXP (Java API for XML Processing) Parsing and manipulating XML.in
) Java XMI] transformation using xsLT in Java Document object Model (DoM): understanding the
with DOM DOM vs SAX (Simple API for
Ooo*"nt Object Model Manif,ulating XML documents
irrali XML Lin[ing M-echanism: Exploring xML tinking mechanisms XLink and
Xpointer foi linking XML documents practical impiementation of XML linking Evolution of Web
"ornpariron
web
eppii."ii""r, Hiralcal perspective on web application development Shift front static to dynamic
for AJAX:
uJpli.urlon. Emerging tiendi in web applicaiion architecture Underslanding JavaScript
.

Basics of JavaScripi programm ing. iote of JavaScript in enhancing user experience JavaScript
. Introduction
frameworks for web d"vetopment a'synchronous Data Transfer with xML Http Request:
for asynchronous data transier
io aryn.hronou, .luvaScripi and XML IAJAx) xMLHttpRequest object
Uandiing AJeX requests and responses lmplementing AJAX Overview of popular
-Frameworks: implementation of
AJAX fiameworks ihoosing the right framework for web development Hands-on
AJAX frameworks lntegrating pHiand AJAX: pHp as a server-side scripting language lntegrating
pffp *ltf, AJAX for dyiamiciveb content Practical examples of PHP and AJAX integration
 Name of P ram Bachelor ofTechno (Comp uter Science and En neering)
CSET484 Cyber security: Impact on Govts, Policies L T P C
and Economics
artment Com ut€r Science En neertng -t 0 0 3
Ownin Schoo
Pre- uisites/Ex ure

Course Outcomes (COs)

On completion ofthis course. the students will be able to:

col:To explain the broader picture of cybersecurity at the world stage. To articulate the
arguments for Cybetsecurity related policy frameworks.
CO2: To examine the cybersecurity related challenges facing the world'

CO-PO/PSO Maooinq

PO2 PO3 PO4 PO5 PO PO PO PO POI POt POI PSO PSO2 PSO3
PO
I 6 '7
8 9 0 I 2 I
col 2 3 3

coz 2 3 J
)
l=weakly related 2= moderately related 3=strongly related

Course Contents:

Module l: t0 lecture hours

Definition of Cybersecurity; Key Concepts in Cybersecurity: Threats to Cybersecurity; Compromises

to IP. Deviations in QoS. & Espionage or Trespass; Forces of Natule. Human Error or Failure &
Information Extofiion; Sabotage or vandalism, software Attacks & Technical Hardware Failures;
Technical Software Failure, Technological Obsolescence. and Theft. Security Technologies: Access
control; Firewalls; Intrusion Detection and Prevention systems; virtual Private Networks,
Vulnerabilities in Information Assets, Understanding Vulnerabilities and Vulnerability Assessment,
Vulnerability Assessment: Tools and Techniques, Vulnerability Remediation Strategies^ Configuration
and Change Management in Vulnerability Assessment.

Module Il: l0 lectur€

hours

Govemance, Risk Management, and Compliance (CRC) approach to Managing Cybersecurity;

Management of cybersecurity: cybersecurity Personnel: Roles and Responsibilities; cybersecurity &
Personnel Issues; Cybersecurity Govemance and Planning; Cybersecurity Strategic Planning;
Cybersecurity Planning ior Contingencies; Cybersecurity Risk Management; Risk Management:
tviodels and Methodologies; Preparation for Risk Management; Risk Assessment; Risk Treatment;
cybersecurity Policy; Enterprise Cybersecurity Policy; Issue Specific cybersecurity Policies; system
Specific Security Policies: Developing and Implementing Effective cybersecurity Policy: Enterprise
Cybersecurity Policy; Performance Measures in Cybersecurity; Specifling Cybersecurity
Measurements: Larv and Regulation in Cybersecurity: Key Security Laws: Privacy Laws'

Module lll: l0l€cture hours

il
 Name of Program Bachelor of Technology (ComPuter Science and
En neerln
CSET487 ital Marketin L T P C

Owning School/DePartment Department of ComPuter Scieirce l 0 0 3

En neenn
Pre- uisites/Ex ure

Course Outcomes (COs)

6i ofthis course, the students will be able to:
"ornpt.tio,
Understand, visualize, and analyse online applications based
on recent digital marketing
COI:
trends.
iOi, o.r.top un in depth understanding ofdigital marketing and its applications'
a digital marketing;lan, identifling digital .channels' their advantages'
and
aOa, Tr create
budget.
the available
li-riitutionr, to p"r".ivinlg ways of their-integration taking into consideration

CO - PO /PSO MaDoins:

PO PO PO PO POI PSO PS PO
PO PO PO PO PO
I 2 3 4 5 6 7 8 I 0 I o2 S3
) CO
2 2 2 a 2 I
2 I 2
CO 1 ,,
I
a 1 3 2 a 3 2 2
2
CO ,, 3
,, 1 1 3 2 2 2 2
3 2 3
l=weakly related 2: moderately related 3:strongly related

Course Con nts:

l0lecture hours
Module I Branding for International
S.""Jirg Communications, Branding, Brand Engagement Strategy'
"ra collection, Marketing Data
rririi..,.]rra"rr"i"g Communications, tvtirketing oati Identification and
Social Media
and Decision Making
i";;g;;i", Data Analysis, Predfctive.Analytics
urJ s*;toruro.y
Advertising and social media'
and Content Marketing, Cont"nt M,.k"ting Specialization' Paid
campaign Planning' Developing creative
6 ,.r"ii, rta"*g"mJnt, vark"ting comriunications,
communications. Public Relations.
I I lecture hours
Module ll On-Site SEo:
) d"uiJ engln. optimization (SEo)' Search Engine Marketing (SEM)' Keywords'
op"il^ u=i a rtsign, off-Site Srb: Linf-buiiiing Programmatic & Display Advertising: !:3*h
gigi*-ftlurt"tine with Google Ads (SEM), Keywird Selection' Text Ads' CPC Bidding'
^Create o5n!y {as
N;ilg",;6;;;il"Aa., serra fr"tri.. c optimization, Jobs.in SEM' Display Advertising, in Display
c iiig.,i"g,-srr"s Models' oisplay eds in Google^ Ads' video Advertising' Jobs
Marketing' Email List Ceneration' Create an Effective EmailCampaigns' Create
eOr..t?S"g]'g*"if
"Plan,
an pmail Measure Risults, Measure & optimize with coogle Analytics Measurability'
Conversions'
Ura..rtura Your Audience, Evaluate Acquisition' Understand Behavior' Evaluate
Optimize CamPaign Budgets.

I I lecture hours
Module llI
Strategy, designing a.Web Presence' Social Media
Web Analytics, Robust Digital Marketing
Marketing, Land scaoe.Chan.nels.Content.Content'N4arketing.lmplement&MonitorCampaigns.
Measure lmpact, ill:l; a;;t;i fula Marketing, Social Media
Advertising, Platforms for Social Ads'
 Module III ll l€cture hours
on your website, Black hat sEo, Mistake by website
r.relriine seo, avoid duplicate content
Defense against negative
ffi;;,ilJpil;
-i;"fdeo, on tlie website, common Negative sEo practices,
(GMB)' optimize GMB Listing'
ieo, Local SEo factors, Google lriy .Business
Element's optimizationon GMB listing, Citations, citations in Local SEO'
8 lecture hours
Module IV
Optim ization, Title Optimization, Desuiption Optimization,
YouTube SEO Ranking Factors, Video
YouTube Subscribers Organically, SEO Strates/ from Google
Thumbnail Optimization, Increase
the position of existing ranking key*ords, keep Eyes
Search Console & Google Analytics, maintain
On Competitor Ranking KeYwords.

Text ks:
l. Das, S., Search Engine Optimization and Marketing: A Recipe for Success inDigital Markering
(lst ed.), CRC Press,202!. ISBN 978'0367278786

Reference Books :
l=f..n-o
- Z02Z: Leam Search Engineoptimization with Smart Intemet Marketing
d;gi;;' iistea), simpte EnectiveneJs LLi,2022. ISBN 9780s78333380'0578333384
)
Assessment Scheme:

Internrl Assessment Mld Term Exam End Exnm Total

Components

35o/o t 00%
Weightage (%) 30o/o 35o/o

-l

,,,,W*.'..r\' 9l:,1iir:,t::!$)
:jcr zone-tt
r'
E*lilit *i L
 Reference Books :
i:. curn . lseo 2022: Larn Search Engineoptimization with Smart lnternet Marketing on
tine 416 LLC 2022. ISBN 97805?8333380,0578333384

Assassment Schemes

Components Int3rnal As6essment Mid Tbrm Exam End Exam Total

100%
Wetghtage (%) 3Oo/o 35o/o 35o/o

R r
Be (j.L [.i n iye rsitv, Greater Noida
(E5i!Lji.hi.J 1-1
, ol Ullar Pradesh
PIot Lc',r Jrt 11, Tech Zone-
I
'riii-l
 Name of Program Ba c h elo r of Tec h Il o logy (C om p u te r Scien c e a n d E n gi n €e rl t! c)
CSET49I Advanced Industry Certification L T P C

Owning School/DePartment De p a rt m e n t o f Com pu te r S cle n c e E n gl n ee n It 6 0 0 6

Pre-requisites/Exposure

Coltrs e-outcomes (COsl:

On completion ofthis course, the students will be able to:

Col:Familiarizeandleamaboutthelatesttrends,tools,technologies,andresearchinthefieldof
computer science.
CO2: Develop the conceptual and practical understanding of the industry relevance of latest

technologies and research trends.

CO-PO/PSO Mappins

PO PO PO POI POI POI PSO PSC)2 PSO3

PO PO2 PO3 PO4 PO5 PO
6 7 8 9 0 2 I
I
3 I
col 3 2 3 2 I
I 2
I
co2 3 2

l:weakly related 2= moderately related 3:strongly related

Course ont€nts:

lecture hours:84
Module I

science thlough relevant

This course covers the cutting-edge topics fiom different domains ofcomputer
industrycertificationswhichwillpreparethestudentsfordifferentjobrolestrendinginthemarketand
help them gather the required skills that will provide the students an edge
over other candidates for the
projects to get real hands-on experience
unuilubl" lob ,ol"r. Students will be working on lab work and
ofthe latest tools and technologies. This course would be equivalent to two open elective
courses'

209

Asse ment Sc e
a)
) Mid Term End Exam fotal
Components Internal Assessm€nt

30y" 350/o toDyo

W€ightage (7o) 3s%

LJrir :; :,t,', Grci ,'r l'loida -

' . I , i -rl. r'i li,r Pfirlasll)
: tl, i), '1il, .i'i .-lcr:h Zone-ll
Gi'Ci:',.t:- ila i-:;...J illi 0
 HSS Electives
)

j,\,, Gr eater Noida

ot Littar PIadGsh)
2,1cl Go!t,-le
'A.i
Esi.hlr:,llc
P lot No 8, 9, 10, 11, ch Zone-ll
Greater I'loi'lr-201 310
 Name of Program Bachelor of TechnologY (Com uter Science and En neerln
csET307 Financial Acco[nting and Mana ent L T P c
Ownin Schoo rtment Computer Science En rneerrng 3 0 0 3

uisites/Ex ure

Course Ou omes (COs)

On completion ofthis course. the students will be able to:

COI: To afiiculate foundations of finance with an emphasis on applications vital for corporate
managefs.
Co2:.Toexplainfinancialdecisionsmadebycorporatemanagersbothwithinthefirmandintheir
interactions with investors.

CO-PO/PSO Mappinq

Po2 PO4 PO5 PO PO PO PO POI POt POI PSO PS02 PSO3

PO PO3
6 '7 8 9 0 I 2 I
I
col I 2 2 I 3
2
2 3 3 3 2
co2 I 2

l=weakly related 2: modcrately related 3:strongly related

Course ontents:

Module l: l2 lecture
hours

Finance overview, Present Value Concepts, NPV Rule, Separation Theorem, Simple
vs Compound
Interest, Annuities and Perpetuities, Growing Delayed Annuities and Perpetuities,
compounding within
the Year and the Effective Annual Interest Rate, Fixed Income valuation. valuation
of Pure Discount
Bonds, Yield to Maturity vs. Holding Period Retum, Prices and Retums on Coupon Bonds' Semi-
Retum and Yield to Maturity for Zero-Coupon Bonds,
Annual Bonds, The Yield curve, Holding Period
CalculatingtheHoldingPeriodRetumonaCouponBond.Equityvaluationlnterest.Applyinglnfinite
Horizon Firmulas, Determining Dividend Growth, lnternal Rate of Retum
(IRR), Comparing NPV and
IRR: Accept or Reject Decision, Comparing NPv and lRR. Capital Budgeting in Practice' Expected
Retum, ani Risk, Portfolio Analysis. iapitai Asset Pricing Model (CAPM). Market Efficiency' Capital
Strategies, Option
Structure. Valuation and Capital Budgeting with Leverage, Option Definitions and
Valuation.
) l0 lecture
Module ll:
hours
cash
Intuition and Discounting. compounding. lnflation, APR and EAR. Term Structure. Discounted
Flow: Decision Making, Free Cash Flow, Forecast Drivers, Forecastilrg Free Cash Flow' Retum on
lnvestment, Financial Reporting, Balance
lnvestment. Decision Ciiteria, Sensitivity Analysis, Return on
Sheet Equation. Assets, Liabilities' and Stockholders' Equity' Debit and Credit
Bookkeeping' Relic
SpotterCase,RevenuesandExpenses,AdjustingEntries,Financia|statementsandClosingEntries,
Plainview
Operating. Investing. and Financing Cash Flows. Statement ofCash Flows' Ratio Analysis'
Techno logy. ).

Module III: 09 lecture

hours

I .i ',' r'. ?1^s,t),,, Greater Noi

da
, oi l.llier pred!5h
l-ech Zone-l
G;r.' .11 31 0
 Name of Pro m Bachelor of Technolo Com uter Science and En neerln
CSET3OS Co m m u n c a t lo n s k ls fo r G o ta I P ro fe ss o n a ls L T P C
Ownin School/De rtment Comp uter Science En nearrng 3 0 0 3
Pre-requisites/Ex osure

Cours e Outcomes (COs)

On completion ofthis course, the students will be able to:

col:To apply the dynanrics business cornmunication strategies and

of conrmunication skills in
principles to prepare effective communication for business situation
bo2, Munrg" infbrmation retrieval systems by performing indexing' compression' information
categorizatio-n sentiment analysis. network management. search engine optimization' records
compliance and risk management

co-Po/PSO Ma nntns

PO PO PO PO POI POI POt PSO PS02 PSO3

PO Po2 PO3 PO4 PO5
6 7 8 9 0 2 I
I
2 2 2 2
col I

co2 3 3 2 3 2
) 2

l=weakly related 2= moderately related 3=strongly related

Course ontents:

Module I: ll lecture
hours

VocabularyBuildirrg,ConceptofWordFormatiol,l,Rootwordsfromfoteignlanguagesandtheirusein
derivatives"
English. Acquaintance with prefixes and suffixes from foreign languages in English to form
Syionynrr, Antonyms, Staniard abbreviations, Eft'ective Communication, Purpose of Communication'
Technical
Procesi of Communication, lmportance of Communication in Business, Differences between
and General Communicatioll. Barriers to Communication' Measures to Overcome the Barriers to
Communication, Types of Comnlunication, Verbal Conrmunication' lmportance of verbal
communication. Significance of Non-verbal communication. Communication Netrvork, scope
and

Types of Communication Network. Formal and lrrformal Communication Network' Upward

communication. Downward communication, Horizontal communication, Diagonal communication'

) Module ll: 09 lecture

hours
Barriers
Listening skills, Listening Process, classitication ofListening, Purpose ofListening, common
to the Listening Process, Measures to lmprove Listening. Listening Comprehension' Pronunciation'
Intonation, Stress and Rh1'thm. Listening as an Important Skill in Workplace' Note taking
tips' Group
Discussions.

Module lll: 14 lecture

hou rs

of good
written communication, Principles of effective writing. hnproYing writing skills. Essentials
style,Expressionsandwordstobeavoided,CrammarandUsage,stepsofwriting'Differencebetween
creative academic and professional rvriting, ldentifying Common Errors in Writing'
Rhetoric'

', /, i:i..r:t t: frjili:::)

i i. :r l.i_ l..il)
,. r., lo,t.. li
.ri.:i, '.4;t
 Institutional communication. Intercultulal communication, Subject-verb agreement, Noun-pronoun
agreement, Misplaced modifiers, Articles, Prepositions, Redundancies, cliches, writing
introduction
aid conclusion. Comprehension, Precis Writing. Essay Writing, Idea Expansion. Letter writing. E-mail.
writing, writing using latest collaborative tools like Slack. Microsoft team, issues of plagiarism. Memos
and Circular Writing, Linkedln Profile and Digital Presence

Module lV: 08 lecture

hours

Employment Communication, Job Interview ImPortance and Factors Involving Job Intervieu
Characteristics of Job Interview, Job Interview Process. Job Interview Techniques' Manners
and
etiquettes to be maintained during an interview, Sample Questions commonly asked During Interview,
Mock Interviews, Expert Talk. Resume: Contents of Good Resume. Guidelines for Writing Resume.
Different Types of Risumes, Reason for a cover Letter to Apply for a Job-Format of cover Letter,
Different Types ofCover Letters, Written and verbal feedback giving and receiving'

Text Books :
ll tuti.t.u3i.hu urd Ratna Rao,,4 Textbook of English qnd Communication Sti/h lsted'
Macmillan Publishers India Private Lld,2020.
)
Reference Books :
lFo*,Ni*.c,mmunicationskillsforpro|essionols.2"ded.PHILeamingPvt.Ltd.,202l

Assessment Scheme:

Components Internrl Assessm€nt Mid Term Exam End Exam Tolal

lOOo/o
Weightage (%) 65o/o 00o/o 35o/o

R:
Ec . 'ilrt itL:i N::ida
(4,i.'- ...,t -l.itr t'. -,;'"tD
.l
Fiot i 1l., .. '-, .- , 1 J, i,,r,,:ir Zorle-ll
Greatcr t,:ciil; ?:01 :r1C
 ram Bachelor of Techno Co u te r Sc te n c e 2 n d E n tn e e rt n g)
Name of P
o nizational Behaviour L T P c
CSET309 1 0 0 3
Ownin School/D rtment Com u t€r Science Engineerin
Pr€-r€ uisites/E re

Cou rse Ou mes (COs)

On completion of this course. the students will be
able to

change' power and conflict'

CO I : To articulate concepts of organizational
theories' models and other tools to make
Co2: To acquaint the students with iftl"pp"ptiutJ"o"cePts'
better understanding of behavioral dynamics'
team performance'
Lol, rr"ryr.,rri role ofteam dynamics and composition in the
i"
CO-PO/PSO MaDDins
PO I PO I PO I P SO PS02 PSO3
P03 PO4 PO5 PO PO PO PO
PO P02 2 I
6 7 8 9 0
I I
I I 2 2 2
col I
2 2 2 3
c02 3 I
t 3 I J 2
) co3 3 2 2

l:weakly related 2: moderately related 3:strongly related

Course Contents:

l:
ll lecture
Module
hours
Conflict Dynamics' Varied Perspectrves on
Addressing Misconduct Management, Conflict Resolution'
C"riff"i,
"f-pr"y.e
DissatiJfactio s Influence' Emotional and Mood
Considerations' Stress
Organizational Behavior' Exploring
Management, Counseting teclnlques, Disciplines Contributinglo
lntuition' Hierarchy of Needs Theory'
Rational ftaoati-bounO"A Rationality and
Attribution Theory.
Theory'
McClelland's Theory Of Needs, Self Determination
19 lecture
Module lI:
holIrs
Defining and Classi[ing Groups' The Five-
Groups and teams, Group Behavior, Group Dynamics' process' Conformity and
Of Group o"u"top-t"t'-dt*p o""i'ion Making'- Team
) Stage Model 'Cuttu'ut
competence' Leadership' Leading across cultures'
."i?.fr"""* oigunirutiorut cult"", Bases ofPower' Power Tactics'
;;;;;i;ri;;,'r;.;ion mat ing ana gt'oial stamns'Power and Influence'
Management' HR policies and practices'
How People Respond To Organizaional Politici Impression
Change management, organizational Stress,
Theories of work motivation, Organizational Structure,
Nature of management.
12 lecture
Module Illr
hours
Traits' Values' and Attitudes in the Workplace'
Understanding organizational Behavior, Personality
Perception Mechanisms' fn"
pi'" p"t'o"ufity ft4oatf' Attitudes' Influence on Learning and Job
PercePtion's Role in Decision-Making
Satisfaction, Relationship Between BehaYior and Attitudes'
Biases and g"o"'ln ot"ltion Making' Diversity'
The challenge of divenity'
Processes. cognitive
 your people?' Job design and
Diversity management, What motivates your people?, How to motivate
employee reaction, Communication, Evaluation, Feedback,
Rewards'

Text Books :
1* ed' Pearson' 2019'
1. Buchanan, David A., and Andrzej Huczynski. Organbational behaviow'

R€ference Books :
l=tth,Trrl
" -iinisirs E" Wendy yellowley. and Christopher J. McLachla* Orgonizational behrviour:
p"iptu in dynamic organiza'ions' I st ed Taylor & Francis' 2020'

@.e!!ss@e:
Mid Term Exam End Exam Total
Componenti Intcrnal Assossment

00yo 3s% l00o/o

Weightage (%) 65%

.)

Re
Be Universi ty, Greater
(f [,rderAct 2 tr Noida
I' r(rt lJ o's B. g, .i c)l Govl,
c, 'l
of Ullar Pradesh
1 , Tech Zone- il
 Name of Pro m Bachelor ofTechno (Com uter Science and En lneerrn
CSET3I O Mark€tin Str ies and PlaDning L T P C
Com uter Science En neenn 3 0 0 3
Ownin School/D artment
Pre- uisites/Ex ure

Course Outcomes (COs)

On completion ofthis course. the students will be able to:

COI : To identiry the importance ofthe rnarketing for marketing success'

Co2:Tonranagecustomerrelationshipsacrossalldigitalchanne|sandbuildbettercustomer
relationships.
CO3: To manage customer relationships across all digital channels and build better customer
relationships.

CO-PO/PSO MapDinq

PO PO POI POI POI PSO PS02 PSO3

PO PO2 PO3 P04 PO5 PO PO
6 7 8 9 0 I 2 I
I
I 2 2
cor 2 I

) co2 ) I 2 2 2 2
3 3 2
co3 3 2 3

l:weakly related 2= moderately related 3=strongly related

Course ontents:

Module I:
13 lecture
hours
Value' lmportance
Marketing Strategy Process, Scanning the Environment, Creating Value' Sustaining
Targeting
of Markel neseaich, Conducting lriarket Research, Strategic Marketing, Segmentation
Segmentation and
Positioning. Levels of Market Segmentation. Profitable Segmentation' Targeting'
Targeting in Practice, Branding, Marketing Strategy and Brand Posilioning'
Building Strong Brands'
Product-
Brid pisitioning- Experiential Branding. product-centric to customercentric Management.Centricity'
Centric ApproaIh. Data-Driven Business Models' Direct Marketing' Customer
Communications campaign designing, Media Planning'

Module ll: l2 lecture

) hours

Pricing, Price Sensirivity, Measuring Price Elasticity, Psychological Aspects

of Pricing' Analytic
Found-ations for pricing. Economic ialue to the Customer, Creating
Customer Access, Disruption in
Managing Channel
Information Delivery, influencing Consumer Behavior, New Product Adoption'
Branding, Brand Elements: Choosing a Brand Name'
Conflict, Online Reiailing and E-Commerce.
Your Professional Brand'
Color & Taglines. Packaging, Persuasion. Repositioning a Brand' Building
Content Marketing, Structure for Effective Content'

Module I Il: l7 lecture

hours
Stealing Headlines for
Applied Marketing. Strategic Context' 7A Framework, Agility & Authenticity'
& Risk Reversal' Expanding Your Netwotk'
Aitention. Capturing Audience Attention. Call-to-Action
 Irresistible Content'
Crafting Marketing Strategy, Empathy Maps' Experience.Map' Creating
a Content
Content' Action Content' Making Action
Strategic Types of Content, ett u"ii'on Cont"nt, AiTinity-
Your Content' Ethics and Professionalism'
Content Actionable, Authority cont€nt' Managing
pfrgf*., Copyright f,u*' f"f"iii.iai" Conieni visuals' Audio and video' Digital Marketing'
o-ig"ltai
""A iram-ework, Marketing Channels' Social Media Marketing' Email Marketing'
rllart*ing

Text Books :
marketing: *eating
ii.':w"rt,
' oougtu. c., John Battice Ford, and Essam lbrahim' s-trategic
tsted. LtD publishing Limited,2020. rsBN 978-1912ss5765.
":..iitiiziniiase.
Reference Books :
l.Fenell,odiesc.,MichaelHartline,andBryanw.Hochstein'Marketingstrateg)'lsted'cengage
Learning, 2021. ISBN 978-03575 16362

4s!@!Ss!e.!qe:
Mid Term Exam End Exam Total
Components Internal Assessment

35o/o 100%
Weightage (%) 65o/o O0o/o

R ts I
E c i.t Un versity, Greater Noida Pradesh)
rh: -l UirJ:t.r'ci 11':lG:vl, of Uilar
1l,Te cl.r Zone-ll
P lct l.lo"-; 0, 9, 1C,
Creater N,l i.ia-201310
 B A c h e I o r of Tec h n o logy (C o m pu t e I Sc te n c e A n d E n n eer tn s)
gr
Name of Program
Micro arld Macro Economics L T P C
csET3l I

Owning School/Department De p a rt m e n t o f Co m p u te r S c e n ce E n gr n ee rl n 3 0 0 3

Pre-requisites/ExPosu re

Course Outcomes (COs)

G cornpletion ofthis course, the students will be able to:

professionals'
COI: To examine the understanding importance ofthe economy for engineering
CO2: To articulate the tactors ,"q,ii,"i in taking appropriate economic decisions rvhich will help in
minimizing investment. operating ard maintenance expenditures

CO-PO /PSO MaoPing:

PO PO PO PO PSO PSO 2 POS 3

PO PO PO PO PO PO PO PO
5 5 7 8 9 10 11 72 L
1 2 3 4
2 2 2
3 3 2 3 L
co1
1 3 3 2
3 3 2 3
co2

l:weakly related 2= moderately related 3:strongly related

Course Con nts:

8 lecture hours
Modul€ I
Macro Models' Markets &
Economics as a Science, Finance, Growth, and Volatility' Micro-Founded
Costs' Welfare Economics'
i"rp",i i*, Supply and Demand. Consumer Theory' Production and
Capital Supply and Capital
Monopoly, Ottrei Market Structures, International Trade, Uncertaint)',
tl,tarkets.EqLrityandEfiiciency.TaxationandRedistribution.Sociallnsurance.

ll l3lecture hours
Modul€
Preferences and ulility'
Microeconomics, Demand Curve. Elasticity of demand, Consumer surplus'
theoty'
Brdg"t lncome elasticity of demand, Deriving demand curve, Applying consumer
of denand. Elasticity of supply' Elasticity interpreted' Surpluses &
"onrtruintr, Min/Max
Croi elasticity -price'
Maximum tent. Minimum *ug", i*"hung" rates, Demand for impotVexporl' Producer Theory'
Market' lnt€rnational trade'
Productivity and cost. Welfare economics Monopoly. Oligopoly' Factor
economics'
Uncertainty. Capital supply and nrarket. Equity and efficiency' Healthcare

l2lecture hours
Module lll
GDB Expenditure approach'
Mafioeconomics, 'ry'hat is GDP'/, GDP Calculation' Nominal and Real
and trade balance, Aggregated demand' Aggregated supply'
Shifts in
Income approach, Fiscal balance
Aggregate Demand. Shifts in Aggregate Supply' Maroeconomic
Equilibrium' Sources' Measurement'
and Sustainability of Economic ci*th'
gusin"ts cycle' Resource Use' Housillg Market' External
Inflation' lndexes Used to Measure
Trade, Types of Unemployment, Measures of Unemployment'
Cost-push and Demand-pull lnflation'
Inflation, iJses and Limitations of Inflation Measures,

9 lecture hours
Module lV
ofMoney' Definitiorrs ofMoney'
Types of Econ omic indicators, Monetary and Fiscal Policy, Functions
and Supply' The
Money Creati on Process, Quantity Theory of Money, Theories of Money
Demand

;-.r', 'r1.rr llc i'l -j

. l:i t ,l' _-l'
 Fisher Effect, Effective Tax Policy, Modeling the lmPact of Taxes and Government Spending'
-vs.
Intemational trade, Gross oornui" hoduct Grosi National Product, Cost and benefits of
Rsstrictions, capital
intgrnational trade. comparative Advantage vs. Absolute Advantage, Trade
Restrictions, The Balance of Payments

@ei]Ei
l. ZahidA. Khan , tushad N. Siddiquee , Brajesh Kumar and Mustafa H' Abidi' Principles of
rigineering Economics with Applications ( l st ed'), Cambridge University Prcss'
20l8 ISBN 978-
l108458856..

Reference Books:
l]F.iluu"t -d Niall Kishtainy, The Economics Book (lst ed.). DK Publishing, 2014. ISBN
978-1465438409

A!sc!E!4!Ssh@g:
Lrb End Exam Total
Components Quiz

3V/o 35o/o 100%

Welghtage (%) 35o/o
)

R
o^ n 'It U,-r:.r:r.- 'y, Greater [.loida
(E:itif ::,lred L ri-:., " ; {r; G:rvt, .F t-lit.i[ Pradesh)
Plot l'lo's D, '.1, 'l n, 1i , 'lurh Zone-ll
Greate r I i -.: ,, .'r -2.11 :r 'i 0