Four-Year Undergraduate Programmed

Bachelor of Technology

Computer Science Engineering (AIML)

1
 Faculty of Engineering & Technology

Parul University

Vadodara, Gujarat, India

Faculty of Engineering & Technology

Bachelor of Technology in Computer Science and Artificial Intelligence and Machine
Learning

1. Vision of the Department

To be a distinct hub of education that prepares skilled professionals in the field of

Computer Science and Engineering.

2. Mission of the Department

• Enhance academic performance by adopting industry-oriented curriculum

focusing on the thrust area of computer education through integrated learning in
collaboration with prominent industries.
• Preparing students to face challenges of the real world through internships and
project-based learning.
• Foster a research culture that results in a sound knowledge base, high-quality
publications, new products and IPR.
• Inculcate ethical consciousness in students so that they can achieve success in
their professional endeavors and can become responsible citizens.

3. Program Educational Objectives

The statements below indicate the career and professional achievements that the
B.Tech. Computer Science engineering curriculum enables graduates to attain.

PEO 1 Apply computer science and engineering theories, principles, and skills to
address societal challenges.
PEO 2 Display a lifelong learning mindset and adapt to quick technological
developments in the sector.
PEO 3 Exhibit professionalism, collaboration, leadership abilities, and awareness of
contemporary demands.

4. Program Learning Outcomes

Program Learning outcomes are statements conveying the intent of a program of study.

PLO 1 Engineering Apply the knowledge of mathematics, science,

knowledge: engineering fundamentals, and an engineering
specialization to the solution of complex engineering
problems.
PLO 2 Problem analysis: Identify, formulate, review research literature, and
2
 analyses complex engineering problems reaching
substantiated conclusions using the first principles of
mathematics, natural sciences, and engineering sciences.
PLO 3 Design/development Design solutions for complex engineering problems and
of solutions: design system components or processes that meet the
specified needs with appropriate consideration for public
health and safety, and cultural, societal, and
environmental considerations.
PLO 4 Conduct Use research-based knowledge and research methods
investigations of including design of experiments, analysis and
complex problems: interpretation of data, and synthesis of the information to
provide valid conclusions.
PLO 5 Modern tool usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including
prediction and modelling to complex engineering
activities with an understanding of the limitations.
PLO 6 The engineer and Apply reasoning informed by the contextual knowledge
society: to assess societal, health, safety, legal and cultural issues
and the consequent responsibilities relevant to the
professional engineering practice.
PLO 7 Environment and Understand the impact of professional engineering
sustainability: solutions in societal and environmental contexts and
demonstrate the knowledge of, and need for sustainable
development.
PLO 8 Ethics: Apply ethical principles and commit to professional
ethics and responsibilities and norms of the
engineering practice.
PLO 9 Individual and team Function effectively as an individual, and as a member
work: or leader in diverse teams, and in multidisciplinary
settings.
PLO 10 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.
PLO 11 Project Demonstrate knowledge and understanding of the
management and engineering and management principles and apply
finance: these to one’s own work, as a member and leader in a
team, to manage projects and in multidisciplinary
environments.
PLO 12 Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning
in the broadest context of technological change.

3
5. Program Specific Learning Outcomes

PSO 1 Demand as per recent An ability to analyze, design, verify, validate, code
development and maintain the solution of given problem to derive
execution of software system
PSO 2 Software skill An ability to understand, apply and work with one or
more domain using knowledge of mathematical
techniques and principles with relevant areas of
computer science

6. Credit Framework

Semester wise Credit distribution of the Category wise Credit distribution of the
program program
Category Credit
Semester-1 16 Major Core 113
Semester-2 20 Minor Stream 0
Semester-3 22 Multidisciplinary 16
Semester-4 23 Ability Enhancement Course 9
Semester-5 19 Skill Enhancement Courses 7
Semester-6 24 Value added Courses 4
Semester-7 27 Summer Internship 4
Semester-8 14 Research Project/Dissertation 14
Total Credits: 167 Total Credits: 167

4
 Faculty of Engineering and Technology- PIET / PIT
B. Tech in CSE (AIML)
Semester 1
Sr.
Subject Code Name of the Subject Credit LECT LAB Tutorial
No.
1 303190102 Engineering Physics 4 3 2 0
2 3031911011 Mathematics-I 4 4 0 0
3 303105103 Open Source Software 2 1 2 0
4 303193103 Communication Skills 2 2 0 0
303105104 Computational Thinking for 4 3 2 0
5
Structured Design 1
6 303104105 Environmental Science Audit 1 0 0
Total 16 14 6 0
Semester 2
Sr. Subject Code
Name of the Subject Credit LECT LAB Tutorial
No.
303105151 Computational Thinking for Structured 4 3 2 0
7
Design-2
8 303107152 ICT workshop 1 0 2 0
9 303106103 Electrical and Electronics Engineering 4 3 2 0
10 303105152 Design Thinking 3 2 2 0
11 303191151 Mathematics-II 4 4 0 0
303193152 Advanced Communication & Technical 2 0 0 2
12
Writing
13 303105153 Global Certifications ( Azure) 2 2 0 0
Total 20 14 8 2
Semester 3
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
14 303105201 Design of Data Structure 3 3 0 0
15 303105202 Design of Data Structure Laboratory 2 0 4 0
16 303105203 Database Management System 3 3 0 0
303105204 Database Management System
17 1 0 2 0
Laboratory
303105205 Object Oriented Programming With
18 2 2 0 0
Java
303105206 Object Oriented Programming With
19 1 0 2 0
Java Laboratory
303105210 Computer Organization and
20 3 3 0 0
Microprocessor
5
 303105211 Computer Organization and
21 1 0 2 0
Microprocessor Laboratory
22 303191202 Discrete Mathematics 4 3 0 0
23 303193203 Professional Communication Skills 2 2 0 0
Total 22 16 10 0
Semester 4
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
24 303105251 Operating System 3 3 0 0
25 303105252 Operating System Laboratory 1 0 2 0
26 303105253 Software Engineering 3 3 0 0
27 303105254 Software Engineering Laboratory 1 0 2 0
28 303105322 Computer Network 3 3 0 0
29 303105323 Computer Network Laboratory 1 0 2 0
303105257 Programming in Python with Full Stack
30 3 3 0 0
Development
303105258 Programming in Python with Full Stack
31 1 0 2 0
Development Laboratory
32 303105262 Competitive Coding 2 - 4 -
303105263 Probability , Statistic and Numerical
33 4 4 - -
Methods
303193252 Professional Grooming and Personality
34 1 - - 1
Development
Total 23 16 12 1
Semester 5
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
35 303105218 Design and Analysis of Algorithms 3 3 0 0
303105219 Design and Analysis of Algorithms
36 2 0 4 0
Laboratory
37 303105306 Theory Of Computation 3 3 0 0
38 303105307 Artificial Intelligence 3 3 0 0
39 303105308 Artificial Intelligence Laboratory 1 0 2 0
40 303105309 Enterprise Programming using Java 2 2 0 0
Enterprise Programming using Java
41 Laboratory 1 0 2 0
303105310
42 303193304 Professionalism & Corporate Ethics 1 - - 1
43 303105311 Quant, and Reasoning 3 3 0 0
303105301 Open Elective 01 (Compulsory
44 2 2 0 0
Subjects :1) AWS Fundamental
Total 21 16 8 1

6
 Semester 5 Open Elective 1
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303101331 Basic Aircraft Science 2 2 0 0
2 303105303 Disaster Preparedness and Planning 2 2 0 0
3 303105304 Cyber Security 2 2 0 0
4 303105305 Internet of Things 2 2 0 0
Fundamentals of Communication
5 2 2 0 0
303107346 Engineering
6 303105301 AWS Fundamental 2 2 0 0
Semester 6
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
46 303105300 Project – 1 3 0 6 0
47 303105365 Security Monitoring 3 3 0 0
48 303105366 Security Monitoring Laboratory 1 0 2 0
49 303105367 Cloud Computing and Security 3 3 0 0
303105368 Cloud Computing and Security
50 1 0 2 0
Laboratory
303105389 Reverse Engineering and Malware
51 3 3 0 0
Analysis
303105390 Reverse Engineering and Malware
52 1 0 2 0
Analysis Laboraroty
53 PEC 01 (Compulsory Subjects :1) 3 3 0 0
54 PEC 01-LAB (Compulsory Subjects :1) 1 0 2 0
55 PEC 02 (Compulsory Subjects :1) 3 3 0 0
56 PEC 02-LAB (Compulsory Subjects :1) 1 0 2 0
57 303193353 Employability Skills 1 0 0 1
Total 24 15 16 1
Semester 6 PEC 01
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303105307 Artificial Intelligence 3 3 0 0
2 303105395 Digital Forensics and Incident Response 3 3 0 0
3 303105314 Data visualization and Data Analytics 3 3 0 0
Semester 6 PEC 01-LAB
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303105308 Artificial Intelligence Laboratory 1 0 2 0
303105396 Digital Forensics and Incident Response
2 1 0 2 0
Laboratory
303105315 Data visualization and Data Analytics
3 1 0 2 0
Laboratory
7
 Semester 6 PEC 02
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303105379 Mobile Application Development 3 3 0 0
2 303105385 MEA(R)N Stack Web Development 3 3 0 0
3 303105387 Devops 3 3 0 0
Semester 6 PEC 02-LAB
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
Mobile Application Development
1 1 0 2 0
303105380 Laboratory
MEA(R)N Stack Web Development
2 1 0 2 0
303105386 Laboratory
3 303105388 Devops Laboratory 1 0 2 0
Semester 7
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
58 303105424 Summer Internship 2 0 0 0
59 303105415 Blockchain and Web 3.0 Security 3 3 0 0
Blockchain and Web 3.0 Security
60 1 0 2 0
303105416 Laboratory
61 303105423 Project - II 6 0 12 0
62 303105413 Fundamental of OT Security 3 3 0 0
63 303105414 Fundamental of OT Security Laboratory 1 0 2 0
64 PEC 03 (Compulsory Subjects :1) 3 3 0 0
65 PEC 03-LAB (Compulsory Subjects :1) 1 0 2 0
66 PEC 04 (Compulsory Subjects :1) 3 3 0 0
67 PEC 04-LAB (Compulsory Subjects :1) 1 0 2 0
68 Open Elective-2 3 3 0 0
Total 27 15 20 0
Semester 7 PEC 03
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303105377 Software Testing and Quality Assurance 3 3 0 0
2 303105353 Machine Learning 3 3 0 0
3 303105489 Internet of things 3 3 0 0
Semester 7 PEC 03-LAB
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
303105388 Software Testing and Quality Assurance
1 1 0 2 0
Laboratory
2 303105354 Machine Learning Laboratory 1 0 2 0

8
 3 303105490 Internet of things Laboratory 1 0 2 0
Semester 7 PEC 04
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303105381 Image Processing 3 3 0 0
303105417 Information Security Management
2 3 3 0 0
System
3 303105485 Augmented Reality and Virtual Reality 3 3 0 0
Semester 7 PEC 04 LAB
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
1 303105382 Image Processing Laboratory 1 0 2 0
303105418 Information Security Management
2 1 0 2 0
System Laboratory
303105486 Augmented Reality and Virtual Reality
3 1 0 2 0
Laboratory
Semester 7 Open Elective-2
1 Remote Sensing and Geo Informatics 3 3 0 0
2 Real Time Systems 3 3 0 0
3 Cyber Physical Systems 3 3 0 0
4 Computational Number Theory 3 3 0 0
5 VLSI System Design 3 3 0 0
Semester 8
Sr.
Name of the Subject Credit LECT LAB Tutorial
No.
69 303105499 Internship 14 0 28 0
Total 14 0 28 0
Total Credits 167

9
8. Detailed Syllabus
Semester 1 - 1
a. Course Name: Engineering Physics

b. Course Code: 303192102

c. Prerequisite: Knowledge of Physics and some basic concepts in Mathematics like

differentiation, integration, limit, differential equation, vector calculus up to 12th
science level.

d. Rationale: Knowledge of physics is essential for all Engineering branches because

physics is the foundation subject of all the branches of engineering and it develops
the scientific temperament and analytical capability of engineering students.

e. Course Learning Objectives:

CLOBJ 1 Understand the basics of quantum mechanics, including Schrödinger’s

equations and the physical significance of wave functions.
CLOBJ 2 Apply the Schrödinger equation to analyze particles in one-dimensional
potential boxes, emphasizing practical implications and tunneling ef-
fects.
CLOBJ 3 Master concepts of energy bands, semiconductor classification, E-k
diagrams, and semiconductor device analysis including P-N junction
diodes.
CLOBJ 4 Comprehensively understand material classification, focusing on mag-
netic materials, nanomaterials, and analyzing physical, thermal, elec-
trical, optical, and magnetic properties.
CLOBJ 5 Gain expertise in laser principles, types, and applications, as well as
fiber optics principles and applications. Understand optoelectronic de-
vices, their functionalities, and practical applications.
 f. Course Learning Outcomes:

CLO 1 Understand the basics of quantum mechanics, including Schrödinger’s

equations and the physical significance of wave functions.
CLO 2 Apply the Schrödinger equation to analyze particles in one-dimensional
potential boxes, emphasizing practical implications and tunneling ef-
fects.
CLO 3 Master concepts of energy bands, semiconductor classification, E-k
diagrams, and semiconductor device analysis including P-N junction
diodes.
CLO 4 Comprehensively understand material classification, focusing on mag-
netic materials, nanomaterials, and analyzing physical, thermal, elec-
trical, optical, and magnetic properties.
CLO 5 Gain expertise in laser principles, types, and applications, as well as
fiber optics principles and applications. Understand optoelectronic de-
vices, their functionalities, and practical applications.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Modern Physics 20% 9
Introduction about quantum Mechanics, Schrödinger’s
equations, Time dependent and Time Independent Wave
Equation, Physical Significance of the wave Function, Ap-
plication of Schrödinger equation in particles in One Di-
mensional Potential Box and Tunneling effects.
2 UNIT-II: Band Theory of Semiconductors 20% 9
Energy bands in solids, Classification of Materials into
Semiconductors & Insulators, Density of state, E-k dia-
gram, Kronig-Penny model (to introduce origin of band
gap), and Effective mass. Direct and indirect band gap.
Carrier Concentration in semiconductors, Fermi Level
in Intrinsic and Extrinsic Semiconductors, P-N junction
diode, Ohmic and Schottky Junction.
3 UNIT-III: Materials 20% 9
Classification of materials: Magnetic materials, Nanoma-
terials based on semiconductors and metal oxides, Basic
characteristic properties of nanomaterials, Novel Materi-
als. Physical, Thermal, Electrical, Optical and Magnetic
properties of materials.
4 UNIT-IV: Laser and Fiber Optics 20% 9
Lasers: Interaction of radiation with Matter, Absorption,
Spontaneous and Stimulated emission, Characteristics of
Lasers, Types of Lasers: Ruby Laser, Helium-Neon Laser,
Semiconductor Diode Laser, Applications of Lasers. Fiber
Optics: Principle and Structure of Optical Fiber, Numeri-
cal Aperture of fiber, Types of Optical Fibers, Attenuation
in Optical Fibers, Applications of Optical Fibers.
5 UNIT-V: Devices 20% 9
Optoelectronic Devices: Photoconductive cell, photo-
voltaic cell, Photodiode, Phototransistor, LED, IR emit-
ters, Opto coupler, X-ray diffractometer, Quantum de-
vices and their applications.

i. Text Books:

1. J. Singh, Semiconductor Optoelectronics: Physics and Technology, McGraw-

Hill Inc. (1995)
2. B. E. A. Saleh and M. C. Teich, Fundamentals of Photonics, John Wiley &
Sons, Inc., (2007)
3. S. M. Sze, Semiconductor Devices: Physics and Technology, Wiley (2008)
4. Engineering Physics — HK Malek and A. K. Singh- McGraw Hill Publication
5. Semiconductor Optoelectronic Devices- P. Bhattacharya-Prentice Hall of India
6. Fundamentals of Physics- Halliday, Resnick and Walker

j. List of Practicals:

1. I-V characteristics of light emitting diode in forward bias.

2. I-V characteristics of Zener diode in reverse bias.
3. Determination of Velocity of ultrasonic waves in water.
4. Determination of Dielectric constants of Dielectric samples.
 5. Measurement of Band gap of semiconductor material.
6. Measurement of Hall coefficient RH and carrier concentration in a semicon-
ductor.
7. Measurement of Planck’s constant using LED.
8. Measurement of wavelength of laser light using diffraction grating.
9. Measurement of Numerical aperture of an optical Fiber.
10. Moment of Inertia of a flywheel.
11. Measurement of power loss in an optical fibre.
12. B-H Curve tracing.
13. Determination of Young’s modulus.
14. Determination of thermal conductivity. (Searle’s method or Lee’s method)
 Semester 1-2
a. Course Name: Mathematics-I

b. Course Code: 303191101

c. Prerequisite: Knowledge of Mathematics up to 12th science level

d. Rationale: The Mathematics I syllabus integrates fundamental calculus concepts,

advanced mathematical techniques, and matrix algebra, preparing students for en-
gineering challenges with optimized problem-solving skills.

e. Course Learning Objectives:

CLOBJ 1 Develop a comprehensive understanding of definite and improper integrals,

including the application of integration techniques to find areas and volumes
in both Cartesian and Polar coordinates.
CLOBJ 2 Utilize differential equations to model and solve practical scenarios, demon-
strating proficiency in various solution techniques.
CLOBJ 3 Analyze the convergence and divergence of sequences and series, employing
tests such as the Alternating Series Test and Ratio Test.
CLOBJ 4 Analyze matrix operations and determinants, exploring their properties and
applications in solving systems of linear equations.
CLOBJ 5 Apply Fourier series for representing periodic functions, verifying Dirichlet’s
conditions.
CLOBJ 6 Solve optimization problems using multivariable calculus concepts, such as
Lagrange’s multiplier.

f. Course Learning Outcomes:

CLO 1 Develop understanding of fundamental mathematical concepts.

CLO 2 Formulate and solve mathematical models for real-world engineering prob-
lems.

CLO 3 Integrate knowledge from different mathematical topics to analyze and solve
complex engineering problems.

CLO 4 Critically analyze mathematical results, interpret their engineering signifi-

cance, and make informed decisions based on mathematical outcomes, fos-
tering a deeper understanding of the subject.

CLO 5 Clearly and effectively communicate mathematical ideas, solutions, and rea-
soning, both in written and oral formats, demonstrating effective communi-
cation skills.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

4 - - 4 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT 1: Improper Integral & Application of Def- 8% 5
inite Integral
Evaluation of definite and improper integrals, Beta and
Gamma functions and their properties. Area bounded
by curves in Cartesian and Polar form, Area of a region
bounded by function, Area of a region bounded by curves
in Parametric form, Volume by slicing, Volume of solid by
revolution.
2 UNIT 2: First Order Ordinary Differential Equa- 15% 9
tion
Exact, linear and Bernoulli’s equations, Euler’s equations,
Equations not of first degree: equations solvable for p,
equations solvable for y, equations solvable for x and
Clairaut’s type, Applications.
3 UNIT 3: Matrices 25% 15
Matrices & Determinants with Properties, Linear Inde-
pendence, Rank of Matrix, System of Linear Equations,
Consistency of System, Solution of system of Linear Equa-
tions by Gauss Jordan and Gauss-Elimination Method,
Eigenvalues, Eigenvectors, Symmetric, Skew-symmetric,
and orthogonal Matrices, Eigenbases, Diagonalization,
Cayley Hamilton Theorem and its Applications, Diago-
nalization, Orthogonal Transformation, Quadratic form.
4 UNIT 4: Sequences and Series 17% 10
Basics of Sequences, Bounded and Monotonic Sequences,
Series, Convergence of sequence and series, Geometric se-
ries, P-series, Cauchy’s Integral Test, Comparison Test,
Alternating Series, Absolute and Conditional convergence,
Ratio test, Cauchy’s Root Test, Power series, Taylor’s and
Maclaurin’s series.
5 UNIT 5: Fourier Series 10% 6
Fourier Series of 2 periodic functions, Dirichlet’s condi-
tions for representation by a Fourier series, Fourier Series
of a function of period 2, Fourier Series of even and odd
functions, Half range series.
6 UNIT 6: Multivariable Calculus (Differentiation) 25% 15
Functions of Several Variables, Limit, Continuity, Partial
Derivatives, Homogeneous function, Euler’s Theorem for
homogeneous function, Modified Euler’s Theorem, Chain
Rule, Implicit function, Jacobian, Tangent plane and Nor-
mal line, Maximum and Minimum Values, Lagrange’s
Multiplier, Taylor’s and Maclaurin’s Series for functions
of two variables.

i. Text Book and Reference Book:

1. Calculus and Analytic Geometry (TextBook)

By G.B. Thomas and R.L. Finney — Addison Wesley
2. Calculus with early transcendental functions
By James Stewart — Cengage Learning
3. Higher Engineering Mathematics
By B. S. Grewal — Khanna Publications
4. Elementary Linear Algebra (Text Book)
By Howard Anton, Chris Rorres — Willy India Edition — 9th Edition
5. Advanced Engineering Mathematics (Text Book)
By Erwin Kreyszig — Willey India Education
6. A textbook of Engineering Mathematics
By N.P. Bali and Manish Goyal — Laxmi Publications
 Semester 1-3
a. Course Name: Open-Source Software

b. Course Code: 303105103

c. Prerequisite: Basic knowledge of software applications.

d. Rationale: Open Source has acquired a prominent place in software industry.

Having knowledge of Open Source and its related technologies is an essential for
Computer Science student. This course introduces Open-Source methodologies and
ecosystem to students.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with Principles of OSS, Open-Source Standards, Re-

quirements for Software, OSS success, Free Software, Examples, Licens-
ing, Free Vs. Proprietary Software, Free Software Vs. Open- Source
Software, Public Domain.
CLOBJ 2 Acquire Knowledge regarding Open-Source History, Open Source Initia-
tives, Open Standards Principles, Methodologies, Philosophy, Software
freedom, Open-Source Software Development, Licenses, Copyright vs.
Copy left, Patents, Zero marginal cost, Income-generation Opportuni-
ties, Internationalization
CLOBJ 3 Acquire knowledge of Community and Communication, Contributing
to Open-Source Projects Introduction to GitHub, interacting with the
community on GitHub, Communication and etiquette, testing open-
source code, reporting issues, contributing code. Introduction to
Wikipedia, contributing to Wikipedia or contributing to any promi-
nent open-source project of student’s choice. Open-Source Ethics and
Social Impact: Open source vs. closed source, Open-source Govern-
ment, Ethics of Open Source,
CLOBJ 4 Understand GNU/Linux, Android, Free BSD, Open Solaris. Open-
Source Hardware, Virtualization Technologies, Containerization Tech-
nologies: Docker, Development tools, IDEs, Debuggers, Programming
languages, LAMP, Open-Source Database technologies.
CLOBJ 5 Demonstrate Apache Web server, BSD, GNU/Linux, Android, Mozilla
(Firefox), Wikipedia, Drupal, WordPress, Git, GCC, GDB, GitHub,
Open Office, Libre Office Study.
 f. Course Learning Outcomes:

CLO 1 Differentiate between Open Source and Proprietary software and Li-
censing.
CLO 2 Recognize the applications, benefits, and features of Open-Source Tech-
nologies.
CLO 3 Gain knowledge to start, manage open-source projects.
CLO 4 Worked with Open-Source ecosystem, its use, impact, and importance.
CLO 5 Learn Open-Source methodologies, case studies with real life examples.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

1 0 2 2 20 20 20 60 30 150
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Introduction to Open-Source: 15% 1
Open Source, Need and Principles of OSS, Open-Source
Standards, Requirements for Software, OSS success, Free
Software, Examples, Licensing, Free Vs. Proprietary Soft-
ware, Free Software Vs. Open-Source Software, Public
Domain. History of free software, Proprietary Vs Open-
Source Licensing Model, use of Open- Source Software,
FOSS does not mean no cost. History: BSD, The Free
Software Foundation and the GNU Project.
2 UNIT-II: Open-Source Principles and Methodol- 20% 3
ogy
Open-Source History, Open Source Initiatives, Open Stan-
dards Principles, Methodologies, Philosophy, Software
freedom, Open-Source Software Development, Licenses,
Copyright vs. Copy left, Patents, Zero marginal cost,
Income- generation Opportunities, Internationalization.
Licensing: What Is A License, How to create your own
Licenses, Important FOSS Licenses (Apache, BSD, PL,
LGPL), copyrights and copy lefts, Patent.
3 UNIT-III: Open-Source projects: 20% 3
Starting and maintaining own Open- Source Project,
Open-Source Hardware, Open-Source Design, Open-
source Teaching, and Open Source media. Collabora-
tion: Community and Communication, Contributing to
Open Source Projects Introduction to GitHub, interact-
ing with the community on GitHub, Communication and
etiquette, testing open-source code, reporting issues, con-
tributing code. Introduction to Wikipedia, contributing to
Wikipedia or contributing to any prominent open-source
project of student’s choice. Open-Source Ethics and So-
cial Impact: Open source vs. closed source, Open-source
Government, Ethics of Open source, Social and Finan-
cial impacts of open-source technology, Shared software,
Shared source, Open Source as a Business Strategy.
4 UNIT-IV: Understanding Open-Source Ecosys- 20% 4
tem:
Open-Source Operating Systems: GNU/Linux, Android,
Free BSD, Open Solaris. Open-Source Hardware, Vir-
tualization Technologies, Containerization Technologies:
Docker, Development tools, IDEs, Debuggers, Program-
ming languages, LAMP, Open-Source Database technolo-
gies.
5 UNIT-V: Case Studies 25% 4
Example Projects Apache Web server, BSD, GNU/Linux,
Android, Mozilla (Firefox), Wikipedia, Drupal, Word-
Press, Git, GCC, GDB, GitHub, Open Office, Libre Office
Study: Understanding thedevelopmental models, licens-
ing, mode of funding, commercial/non- commercial use.

i. Text Books:

1. Open-Source Technology”, Kailash Vadera & Bhavyesh Gandhi, University

Science Press, Laxmi Publications, 2009, Software Engineering, Sommerville
(TextBook)
2. Open-Source Technology and Policy”, Fadi P. Deek and James A. M. McHugh,
Cambridge University Press, 2008 Software Engineering; Wiley India
 3. Perspectives on Free and Open-Source Software”, Clay Shirky and Michael
Cusumano, MIT press.

j. List of Practicals:

1. Demonstration of Basic Linux commands.

2. Execute C Program using gcc compiler.
3. Demonstration of gprof command using Linux.
4. Create and Edit documents using Google Docs.
5. Create Presentation using Google Slides.
6. Demonstration of different Arithmetic and Logical Formulas using OpenOffice
Calc.
7. Use of HTML to create simple web page.
8. Demonstration of MathML – a markup language for describing mathematical
notation.
9. Demonstration of virtualization using Docker Container..
10. Demonstration GitHub Facility.
 Semester 1-4
a. Course Name: Communication Skill

b. Course Code: 303193103

c. Prerequisite: Knowledge of English Language studied till 12th standard

d. Rationale: Basic Communication Skills are essential for all Engineers.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with electrical current, potential difference, power and
energy, sources of electrical energy and elements of electrical circuit.
CLOBJ 2 Solve problems related to Alternating current, alternating voltage, etc,
Demonstrate a clear understanding of Pure R, L C circuit and combi-
nation of RLC, Series and Parallel combination of R, L and C, etc.
CLOBJ 3 Acquire knowledge of the resistor, capacitor, and inductor and their
performance characteristics for series and parallel connections.
CLOBJ 4 Understand different single phase and three phase circuits.
CLOBJ 5 Demonstrate a clear understanding of the basic concepts, working prin-
ciples and applications of transformer, DC machines and AC machines.
CLOBJ 6 Study the use of LT Switchgear, Fuse, MCB, ELCB etc.

f. Course Learning Outcomes:

CLO 1 Understand the importance of creative and critical thinking.

CLO 2 Expand vocabulary with proper pronunciation.
CLO 3 Comprehend the basics of English grammar.
CLO 4 Read & write effectively for a variety of contexts.
CLO 5 Develop confidence in speaking skills.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

0 2 0 2 0 100 0 0 0 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Crazy Scientist: 5% 2
The students will be taught the importance of invention
and innovation using some examples that changed the
world the way it worked.
2 UNIT-II: Phonetics 10% 4
IPA Introduction (listening racks), Phonic Sounds Pro-
nunciation Practice including transcription.
3 UNIT-III: Vocabulary Building & Word Forma- 10% 2
tion Process
Compounding, clipping, blending, derivation, creative re-
spelling, coining and borrowing Prefixes & suffixes, syn-
onyms & antonyms, standard abbreviations (related ac-
tivities will be provided) .
4 UNIT-IV: Speaking Activity: Role play on Critical 10% 4
Thinking (Life boat)
This activity topic gears towards making students do role
play based on various scenarios. It involves giving them
a scenario and asking them to further develop the idea in
a very interesting manner, then going on to enact it. It
aims to improve students’ convincing skills.
5 UNIT-V: Picture Description & Picture Connec- 15% 2
tor
Enable students to use vocabulary and useful expression
to describe the picture. In this class the students will
be trained to form logical connections between a set of
pictures which will be shared with them. This geared
towards building creativity and presentation skills.
6 UNIT-VI: Mine Activity: Usage of Preposition: 8% 2
Students will learn to use proper propositions by active
participation in the activity.
7 UNIT-VII: Worksheets on Identifying Common 12% 2
Errors in Writing:
Sentence structure, Punctuations, Subject-Verb Agree-
ment, Noun-Pronoun Agreement
8 UNIT-V: Reading Skills 10% 2
The art of effective reading and its various strategies to
be taught to the learners and practice exercises be given
on reading comprehension.
9 UNIT-IX: Speech and spoken Exchanges; Extem- 10% 4
pore:
Students will learn the correct usage of spoken language as
different from the written form. It will help the students
in extempore speech. This will be done by making the
students give variety of impromptu speeches in front of
the class: 1 minute talk on simple topics. To change the
average speakers in the class to some of the best Orator.
10 UNIT-X: Book Review 10% 4
The learners will identify the central idea of the book,
author’s style and approach towards the book. This will
enable the learners to express their point of view and hone
their creativity and writing skills.

11 UNIT-V: Activity Session 0% 2

This will enhance the creative thinking among students.
To develop their interpersonal communication skills.

*Continuous Evaluation:It consists of Assignments/Seminars/Presentations/Quizzes/

Surprise Tests (Summative/MCQ) etc.

i. Text Books:

1. Understanding and Using English Grammar Betty Azar & Stacy Hagen; Pear-
son Education.
2. Business Correspondence and Report Writing SHARMA, R. AND MOHAN,
K.
3. Communication Skills Kumar S and Lata P; New Delhi Oxford University
Press.
4. Technical Communication: Principles and Practice, Sangeetha Sharma, Meenakshi
Raman; Oxford University Press.
5. Practical English Usage MICHAEL SWAN.
6. A Remedial English Grammar for Foreign Student F.T. WOOD.
7. On Writing Well, William Zinsser; Harper Paperbacks,2006; 30th anniversary
edition.
8. Oxford Practice Grammar, John Eastwood; Oxford University Press.
 Semester 1-5
a. Course Name: Computational Thinking for Structured Design-1
b. Course Code: 303105104
c. Prerequisite: Requires Basic Knowledge of Computer.
d. Rationale: This course is design to provide basic ideas of computer programming.
This course also makes help to understand programming language. It will help to
develop their logical abilities.
e. Course Learning Objectives:

CLOBJ 1 Programming basics and the fundamentals of C.

CLOBJ 2 Data types in C.
CLOBJ 3 Mathematical and logical operations.
CLOBJ 4 Using if statement and loops.
CLOBJ 5 Arranging data in arrays.
CLOBJ 6 AImplementing pointers.

f. Course Learning Outcomes:

CLO 1 Able to understand the basic knowledge of Computer fundamental and

its application in computers.
CLO 2 Able to understand the basic concepts of C programming language.
CLO 3 Able to design and develop various programming problems using C
programming concepts.
CLO 4 Able to Implement advance C programming concepts like function,
pointer, structure and union etc.
CLO 5 Able to understand the file handling using C Programming language.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination
h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Introduction to C language 10% 3
History of C language, Program Development Steps,
Structure of C program
2 UNIT-II: Data Types, User I/O and Operators 10% 6
Data Types
Extended and Derived Data types, Variables User I/O :
Formatted, predefined Functions of stdio.h header file Op-
erators: Types of operators, Precedence, Associativity.
3 UNIT-III: Conditional Flow Statements: 15% 9
Iterative Statements, Jumping Statements and
Pointors:Conditional Flow Statements: Simple
if,ifelse,else-if ladder,switch case Decision Making using
conditional statements Iterative Statements: Control
Entry and Control Exit Loops Jumping Statements:
break, continue , forward and backward goto. Pointers:
Typed:single double,triple..wild, NULL,Const, untyped,
void.
4 UNIT-IV: Functions: 30% 10
Functions :Call by value, call by references, Types of Func-
tions. Pointer Functions: Calling A function through
function pointer, Passing A function’s address as an Ar-
gument to other function, Types of Pointer function Cre-
ation. Recursion : Types of Recursions : Direct Recur-
sion, Indirect Recursion, Tail Recursion, No tail/Head
Recursion, Tree Recursion, Nested Recursion. Storage
classes : Auto, register, static and Extern.
5 UNIT-V: Arrays: 35% 14
Arrays: Types of arrays, Declaration and Defining an ar-
ray Pointer and Arrays: Types of Accessing Array el-
ements Subscripting pointer variables Pointer to an ar-
ray, Array of pointers, Pointers and two dimensional ar-
rays Subscripting pointer To an array, Array of Func-
tions : Strings: Strings v/s character arrays, Initializing
strings, Reading and Displaying string Types of string for-
mat Specifiers. puts() functions, Multi Line string Input
String pointers, Two-dimensional character arrays or ar-
ray of string Array of pointers to strings, String handling
functions.

i. Text Books:

1. C Programing by Bala Guru Swamy (TextBook)

2. C for all by s.Thammarai Selvi ,R Murugesan, Anuradha Publications.
3. Programing in C Ajay Mittal, Pearson.
j. List of Practicals:

1. Installation C IDE, Basic Structure of C program. Format Specifiers, Escape

Character. Run time input/Output Programs.
2. Write a c program to calculate Area of Rectangle,Perimeter of a Rectangle
and Diagonal of a Rectangle.
3. The total distance traveled by vehicle in ‘t seconds is given by distance s =
ut+1/2at? where ‘u’ and ‘a’ are the initial velocity (m/sec.) and acceler-
ation(m/sec?). Write a C program to find the distance traveled at regular
intervals of time given the values of ‘u’ and ‘a’. The program should pro-
vide the flexibility to the user to select his own time intervals and repeat the
calculations for different values of ‘u’ and ‘a’.
4. Write a C program to find the sum of individual digits of a positive integer.
5. A Fibonacci sequence is defined as follows: the first and second terms in the
6. Write a C program to find the roots of a quadratic equation.
7. Write C programs that use both recursive and non-recursive functions. 1. To
find the factorial of a given integer.
8. To find the GCD (greatest common divisor) of two given integers.
9. Write a C program to find the largest integer in a list of integers,
10. Write a C program that displays the position or index in the string S where
the string T begins, or -1 if S doesn’t contain T
11. Write a C program to generate Pascal’s triangle.
12. Write a C program to convert a Roman numeral to its decimal Equivalent.
13. Write a c program to take multiline string input and print individual string
length .
14. Write a c program to reverse the individual word of a given string Explana-
tion:input : Welcome To Bytexl output: emocleW oT lxetyB.
 Semester 1-6
a. Course Name: Environmental Science

b. Course Code: 303104105

c. Prerequisite: Knowledge of Physics, Chemistry and Mathematics up to 12th sci-

ence level and Biology up to 10th science level

d. Rationale: Basic knowledge of the environment is essential for all human beings
for a good life and sustainable existence.

e. Course Learning Objectives:

CLOBJ 1 Apply systems thinking to analyze the city as a system, demonstrating

application.
CLOBJ 2 Evaluate the role of smart citizens and approaches for citizen engage-
ment.
CLOBJ 3 Identify sources and stressors of water resources, demonstrating under-
standing.
CLOBJ 4 Analyze the causes, effects, and control measures of population explo-
sion.

f. Course Learning Outcomes:

CLO 1 Understand the interrelation and interdependency of organisms and

their interactions with the environment.
CLO 2 Identify eco-friendly measures in engineering projects.
CLO 3 Understand preventive steps for environmental protection.
CLO 4 Act as a responsible individual who is aware of efficient usage of re-
sources and securing sustainable development.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

1 0 0 Audit - 50 - - - 50
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination
h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: ENVIRONMENTAL HEALTH, ECOL- 25% 7
OGY AND QUALITY OF LIFE
Environmental education: Objective and scope, Impact
of technology on the environment, Environmental disas-
ters: Case studies, Global environmental awareness to
mitigate stress on the environment, Structure and func-
tion of an ecosystem, Ecological pyramids, Pyramid of
number, Pyramid of energy and pyramid of biomass.
2 UNIT-II: POLLUTION PREVENTION 20% 6
Air & Noise pollution - Sources & their Effects, Case stud-
ies of Major Catastrophes, Structure and composition of
the atmosphere, Water, Soil, Marine, Thermal & Marine
Pollution: The story of fluoride contamination, Eutroph-
ication of lakes, control measures, Measuring water qual-
ity: Water quality index, Waste water treatment (gen-
eral) primary, secondary and tertiary stages, Municipal
Solid waste management: Sources and effects of munici-
pal waste, Biomedical waste, Hazardous waste.
3 UNIT-III: POPULATION GROWTH, GLOBAL 25% 7
ENVIRONMENTAL CHALLENGES & LATEST
DEVELOPMENTS
Population Explosion - Causes, Effects and Control, an
International initiative in population-related issues, Ur-
banization, Growth of the world’s large cities, Water re-
sources: Sources of water, Stress on water resources, Cli-
mate Change, Global Warming and Green House Effect,
Acid Rain, Depletion of Ozone layer, Variation in concen-
trations of GHG gases in ambient air during last millen-
nium, Role of Environmental Information System (EN-
VIS) in India and similar programs run by EPA(USA),
Role of soft tools like Quantum GIS, Autodesk Building
Information Modeling (BIM) and City Finance Approach
to Climate-Stabilizing Targets (C- FACT), Life Cycle As-
sessment, Bioinformatics and Optimization tools for sus-
tainable development.
4 UNIT-IV: SMART CITIES 30% 10
Introduction to smart cities - about smart cities, what is
a smart city, world urbanization, case studies of Songdo,
Rio De Janeiro, what makes cities smart.
City as a system of systems – Introduction, systems think-
ing, Milton Keynes Future Challenges, Rich picture as city
challenges, Wicked problems, Development of smart city
approach – core elements, open data, sustainability, pri-
vacy and ethics, development processes.
Smart Citizens – their role, engaging citizens, IES Cities,
Energy systems, Approaches for Citizen Engagement, co-
creating smart cities, cities unlocked, living labs, city
problems, crowdsourcing ideas, redesigning cities for citi-
zens, all age-friendly cities, mobility on demand, motion
maps,
Infrastructure, Technology and Data – urban infrastruc-
ture and its technology, future of lighting, IoT, connected
objects, sensing the city, NOx eating paints and air quality
sensors, safest, smart citizen kit, sensing your city, Sen-
sored City, Cyber security for data power, open, shared
and closed data, satellite data, open data revolution,
Smart City Project Data.
Innovation – smart innovations, smart city ecosystem,
data-driven innovations for smart cities.
Standards and Capacity Building – the role of Standard,
BSI smart city Standards, HyperCat, ITU Smart Sustain-
able cities, Smart City Readiness, Lessons Learnt from
Amsterdam.
Smart Measurements - metrics and indicators, city indi-
cators, WCCD data portal, value proposition, integrated
reporting, smart city learning and education, urban data
school.

i. Text Books:

1. Textbook of Environmental Studies For Undergraduate Courses (Text Book)

By Dr Erach Bharucha — Orient BlackSwan — Second Edition, Pub. Year
2013.
2. Basics of Environmental Studies By U K Khare — Tata McGraw Hill.
3. Environmental Studies By Anindita Basak — Drling Kindersley(India)Pvt.
Ltd Pearson.
4. Environmental Sciences By Daniel B Botkin & Edward A Keller — John Wiley
& Sons.
5. Air Pollution M N Rao , H .V N Rao — McGraw Hill Publishing Company
Limited, New Delhi.
 Semester 2 - 1
a. Course Name: Computational Thinking for Structured Design-2

b. Course Code: 303105151

c. Prerequisite: A foundational understanding of logic and problem-solving is a

prerequisite for computational thinking in structured design.

d. Rationale: Computational thinking is integral for structured design as it fosters a

systematic approach to problem-solving, breaking down complex issues into man-
ageable components. By applying computational thinking principles, individuals
can create well-organized and efficient structured designs, promoting clarity, main-
tainability, and scalability in software development. This methodology aligns with
the logical and stepby-step nature of structured design, enhancing the overall effec-
tiveness of the development process.

e. Course Learning Objectives:

CLOBJ 1 Develop a deep understanding of foundational computational thinking

concepts and their application in problem-solving.
CLOBJ 2 Demonstrate proficiency in creating structured designs using appropri-
ate programming constructs and methodologies.
CLOBJ 3 Apply algorithmic thinking to decompose complex problems into man-
ageable components, enhancing systematic problem-solving abilities.
CLOBJ 4 Evaluate and refine structured designs through critical analysis, pro-
moting clarity, efficiency, and scalability in software solutions.

f. Course Learning Outcomes:

CLO 1 Develop proficiency in breaking down complex problems into manage-

able components, demonstrating a mastery of foundational computa-
tional thinking concepts.
CLO 2 Apply structured design principles to create efficient and well-organized
algorithms, fostering a systematic approach to problem-solving in var-
ious domains.
CLO 3 Demonstrate the ability to design and implement structured programs
using appropriate programming languages, showcasing practical skills
in translating algorithms into executable code.
CLO 4 Cultivate a problem-solving mindset, emphasizing analytical thinking,
algorithmic reasoning, and code optimization for developing scalable
and maintainable software solutions.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I Dynamic Memory Allocation: 10% 6
malloc, calloc, realloc and free, Array of pointers, Pro-
graming Applications, Dangling Pointer
2 UNIT-II Preprocessor Directives: 10% 6
File Inclusion, Macros, Conditional Compilation and
Pragmas.
3 UNIT-III: Enumerators, Structures, Unions: 15% 15
Enumerators: Enumerator Types Structures: Decla-
ration Initialization Accessing Structures, Complex Struc-
tures, Structure and Functions Array of structures Arrays
within structures Anonymous structures Nested structures
pointers in structures Self-referential structures Structure
Padding Unions: Bit fields Typedef
4 UNIT-IV: Searching and Sorting: 30% 3
Selection sort, Bubble Sort, ,Insertion sort, Quick sort
and Merge Sort Linear and Binary Searching Techniques
5 UNIT-V: Data Structures: List- Linear List: : 35% 15
Singly Linked List - CRUD operations Double Linked
List -CRUD operations Circular Linked List- CRUD op-
erations

i. Text Books:

1. Fundamentals of Data Structures in C, 2ND eDITION, E.Horowitz, S,.Sahni

and Susan Anderson- Freed, Universities Press (TextBook)
2. Computer Programming & Data Structures - E. Balaguruswamy,4th Edition
TMH
3. C & Data Structures - P . Padmanabham,Third Edition,B.S Publications
4. Classic Data Structures - D.samanta
j. List of Practicals:

1. Write a c program to increase or decrease the existing size of an 1D array. 2.

Write a c program on 2D array to Increase & Decrease i) No of subarrays ii)
elements in the subarrays.
2. Write a to display present date and time using c language. 2. Write a c pro-
gram to demonstrate pre-processor directives i) Macros ii) Conditional Com-
pilation.
3. Write a C program that uses functions to perform the following Operations.
i) Reading a complex number ii) Writing a complex number iii) Addition of
two complex numbers iv) Multiplication of two complex numbers 2. Write a
c program to store records of n students based on roll no, name, gender and
5 subject marks i) Calculate percentage each student using 5 subjects. ii)
Display the student list according to their percentages.
4. Write a C program to store n employee records based on EMP ID,EMP
NAME,EMP DEPTID,EMP PHNO,EMP SALARY and display all the de-
tails of employees using EMP NAME in sorted order.
5. Write a c program to implement selection Sort & Bubble sort 2. Write a C
program to reverse the elements within a given range in a sorted list. Example
: input : 10 9 1 2 4 3 4 6 7 8 10 3 8 output: 1 2 8 7 6 4 4 3 9 10 the sorted list
of given array elements is 1 2 3 4 4 6 7 8 9 10 , after reversing the elements
with in the range 3 and 8 is 1 2 8 7 6 4 4 3 9 10.
6. Write a c program to implement Insertion sort & Quick sort
7. Write a c program to sort the given n integers and perform following operations
i) Find the products of every two odd position elements ii) Find the sum of
every two even position elements Explanation: Input : 9 1 9 8 3 5 4 7 2 6
Output: 3 15 35 63 6 10 14 The sorted list of given input is 1 2 3 4 5 6 7 8 9,
the product of alternative odd position elements is 1*3 = 3,3*5=15,5*7=35. . .
and the sum of two even position elements 2+4 =6,4+6=10.
8. Write a C Program to implement Merge Sort.
9. Write a c program to sort in ascending order and reverse the individual row
elements of an mxn matrix.
10. Write a c program to perform linear Search. 2. Write a c program to perform
binary search.
11. Write a c program to Create a single Linked list and perform Following Op-
erations A. Insertion At Beginning B. Insertion At End C. Insertion After a
particular node D. Insertion Before a particular node E. Insertion at specific
position F. Search a particular node G. Return a particular node H. Deletion
at the beginning I. Deletion at the end J. Deletion after a particular node K.
Deletion before a particular node L. Delete a particular node M. Deletion at
a specific position.
12. Write a program to Reverse a singly Linked list. 2. Write a c program to
check whether the created linked list is palindrome or not.
13. Write a c program to Create a Circular Linked list and perform Following
Operations A. Insertion At Beginning B. Insertion At End C. Insertion After
 a particular node. D. Insertion Before a particular node E. Insertion at specific
position F. Search a particular node G. Return a particular node H. Deletion
at the beginning I. Deletion at the end J. Deletion after a particular node K.
Deletion before a particular node L. Delete a particular node M. Deletion at
a specific position
14. Write a c program to Create a Circular single Linked list and perform Following
Operations A. Insertion After a particular node B. Insertion Before a particular
node C. Search a particular node D. Return a particular node E. Deletion
before a particular node F. Delete a particular node.
15. Write a c program to Create a Circular Double Linked list and perform Fol-
lowing Operations A. Insertion After a particular node B. Insertion Before a
particular node C. Search a particular node D. Return a particular node E.
Deletion before a particular node F. Delete a particular node.
 Semester 2 - 2
a. Course Name: ICT workshop

b. Course Code: 303107152

c. Prerequisite: Basic Computer Knowledge and Physics

d. Rationale: This course is design to provide basic knowledge of Electronics com-

ponents and computer components. This course helps in learning problem solving
process of Electronics circuits and Computer.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with identifying the Basic Electronic Components.

CLOBJ 2 Solve problems related to testing instruments such as Digital Multi
meter, CRO , and function generator, etc.
CLOBJ 3 Acquire knowledge of Different sensors.
CLOBJ 4 Understand and develop group projects using electronic components
and sensors.

f. Course Learning Outcomes:

CLO 1 Gain ability to understand the working of Electronics Components

CLO 2 Ability to understand the operating of various testing and measurement
instrumentation.
CLO 3 Ability to learn working and use of different IoT sensors
CLO 4 Ability to design electronic circuit for the specific applications.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

0 - 2 1 - - 20 - 30 50
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination
h. List of Practicals:

1. Identification and symbolic representation of electronics basic components.

(diode,zener diode, LED, transistor)
2. Verify the circuit analysis (voltage and current) using Digital Multimeter
3. Understanding of working and specifications of CRO and Function generator
4. Design 5V power supply using 7805.
5. Understanding soldering techniques and practicing proper soldering and de-
soldering.
6. Demonstrate the working of Temperature Sensor
7. Verify the functionality of water flow sensor
8. Verify the functionality of distance measurement sensor
9. Demonstrate the working of Rain detector Sensor.
10. Group Project based on electronics components and sensors
 Semester 2-3
a. Course Name: Electrical and Electronics Engineering

b. Course Code: 303106103

c. Prerequisite: Knowledge of Physics and Mathematics up to 12th science level.

d. Rationale: The course provides introductory treatment of the field of Electrical

Engineering to the students of various branches of engineering.

e. Course Learning Objectives:

CLOBJ 1 Master analysis techniques including Kirchhoff’s laws, simplification

methods, superposition, Thevenin’s, and Norton’s theorems for effective
DC circuit analysis.
CLOBJ 2 Solve problems related to Alternating current, alternating voltage, etc,
Demonstrate a clear understanding of Pure R, L C circuit and combi-
nation of RLC, Series and Parallel combination of R, L and C, etc.
CLOBJ 3 Understand different single phase and three phase circuits.
CLOBJ 4 Learn diode behaviours, rectification techniques, and transistor func-
tions as switches and amplifiers in electronic circuits.
CLOBJ 5 Understand sensors and transducers, their applications, and differenti-
ate between their types and functionalities in electronic systems.

f. Course Learning Outcomes:

CLO 1 UTo Illustrate basic concepts of various laws, principles and theorems
associated with DC circuits for networks analysis.
CLO 2 To apply concepts of sinusoidal voltages, power relationships and show-
casing knowledge of AC circuit theory using numerical and graphical
representation.
CLO 3 To Compare and apply diode and transistor fundamentals, including
characteristics, operation, and applications, demonstrating awareness
of electronics principles.
CLO 4 To design, and implement various types of voltage regulator circuits,
and understanding of power supply concepts and practical applications.
CLO 5 To adept, classify, and apply various electronic sensors and transducers,
for understanding of their principles and real-world applications.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: DC Circuits 10% 5
Electrical circuit elements (R, L and C), voltage and cur-
rent sources, Kirchhoff current and voltage laws, Mesh
and Node analysis, Simplifications of networks using se-
ries and parallel combinations and star-delta conversions.
Superposition, Thevenin and Norton Theorems..
2 UNIT-II: AC Circuits 30% 15
AC Circuits Sinusoidal voltages and currents, their math-
ematical and graphical representation, Concept of instan-
taneous, peak (maximum), average and R.M.S. values, fre-
quency, cycle, period, peak factor and form factor, phase
difference, lagging, leading and in phase quantities and
phasor representation. Rectangular and polar represen-
tation of phasors, pure inductance, pure capacitance and
corresponding voltage- current phasor diagrams and wave-
forms. Development of the concept of reactance, the
study of series R-L, R-C, R-L-C circuit and resonance,
study of parallel R-L, R-C and R-L-C circuit, concept of
impedance, admittance, conductance and susceptance, the
concept of active, reactive and apparent power and power
factor,. Voltages, currents and power relations three-phase
have balanced star-connected loads and delta-connected
loads along with phasor diagrams.
3 UNIT-III: Diode and Transistors 30% 15
Introduction to Ideal Diode, Effect of temperature Ideal
diodes, unbiased diode and Forward and reverse bias of
Diode. PIV, surge current, Diode as Uncontrolled switch.
Rectifiers: Half wave, Full wave, and bridge wave. Ripple
factor, PIV rating. Choke and Capacitor input filter rec-
tifiers, Clipper and Clamper circuits, Voltage multiplier:
Construction and working of BJT, Characteristics & spec-
ifications of BJT (PNP & NPN transistors), Biased and
unbiased BJT, Configuration of the transistor, the concept
of gain & BW, Operation of BJT in the cut-off, saturation
& active regions (DC analysis), BJT as a switch, Transis-
tor as an amplifier, Voltage divider bias and analysis, VDB
load line and Q point.
4 UNIT-IV: Voltage Regulator 15% 5
Lasers: Interaction of radiation with Matter, Absorption,
Spontaneous and Stimulated emission, Characteristics of
Lasers, Types of Lasers: Ruby Laser, Helium-Neon Laser,
Semiconductor Diode Laser, Applications of Lasers. Fiber
Optics: Principle and Structure of Optical Fiber, Numeri-
cal Aperture of fiber, Types of Optical Fibers, Attenuation
in Optical Fibers, Applications of Optical Fibers.
5 UNIT-V: Sensors and Transducers 15% 5
Introduction to sensors and Transducers, Comparison be-
tween sensors and Transducers, Applications of Sensors
and Transducers, Types of Electronic sensors, Types of
Transducers.

i. Text Books:

1. A text book of Electrical technology Vol2, By B.L.Theraja — S. Chand Pub-

lication.
2. Electrical Engineering Fundamentals (TextBook), By V. D. Toro — Prentice
Hall India — 2, Pub. Year 1989.
3. Electrical and Electronics Technology , By E. Hughes — Pearson — 10, Pub.
Year 2010.
4. Basic Electrical Engineering , By D. P. Kothari and I. J. Nagrath, — Tata
McGraw Hill — 3, Pub. Year 2010.
5. Basic Electrical Engineering, By D. C. Kulshreshtha — McGraw Hill — 1,
Pub. Year 2009.
6. Fundamentals of Electrical Engineering, By Leonard S. Bobrow — Oxford
University Press — 2, Pub. Year 1996.
j. List of Practicals:

1. To Study about Various Electrical and Electronics Symbols and demonstrate

various measuring instruments used in Basic electrical Engineering laboratory.
2. To Perform and Solve Electrical Networks with Series and Parallel Combina-
tions of Resistors Using Kirchhoff ’s Laws.
3. To Obtain Inductance, Power and Power Factor of the Series RL Circuit With
AC Supply Using Phasor Diagram.
4. To Obtain Capacitance, Power and Power Factor of the Series RC Circuit
With AC Supply Using Phasor Diagram.
5. To Obtain Inductance, Capacitance, Power and Power Factor of the Series
R-L-C Circuit With AC Supply Using Phasor Diagram.
6. Verification of superposition theorem with dc source.
7. Verification of Thevenin’s theorem with dc source.
8. Verification of Norton’s theorems in dc circuits.
9. Verification of Current and Voltage Relations in Three Phase Balanced Star
and Delta Connected Loads.
10. To study the cut-section of a dc machine, single phase induction machine and
three phase induction machine.
11. Find out the Efficiency and Voltage Regulation of Single Phase Transformer
by Direct Load Test.
12. To Plot V-I characteristics Diodes. (a) PN junction diode Characteristics, (b)
Zener Diode characteristics.
13. To Observe Rectifier Circuit (a) Half wave Rectifier without filter, (b) Full
wave rectifier without filter, (c) Half wave
14. To Observe Response of Clipping and Clamping circuits using diodes (a) Diode
Positive Clipper without and with Biased clipper, (b) Diode Negative Clipper
without and with Biased clipper, (c) Biased Positive Negative Clipper ( Com-
binational Clipper), and (d) Positive Clamper, and Negative Clamper.
15. Designing of power supply using IC regulator circuit. (a) Designing of +5
Volt DC Power Supply using 7805, (b) Designing of -5 Volt DC Power Supply
using 7905, (c) Designing of +12 Volt DC Power Supply using 7812, and (d)
Designing of -12 Volt DC Power Supply using 7912.
16. (a)To Plot and Study input-output characteristics of Common Base (B) con-
figuration of the Transistor and (b) To Plot and Study input-output charac-
teristics of common Emitter (CE) configuration of Transistor.
17. To study the Voltage divider bias circuit: (a) To observe the effect of change
in base current on the Q-operating point, and (b) To set Q point for operation
of a transistor amplifier in the linear region.
18. To plot characteristics of Schottky and Varactor diode.
19. Designing of Linear Adjustable Regulator using IC LM317.
20. Introduction to Sensors and Transducers.
 Semester 2 - 4
a. Course Name: Design Thinking

b. Course Code: 303105152

c. Prerequisite: Open mindedness, curiosity, empathy, collaboration, iteration, cre-

ative thinking.

d. Rationale: Design thinking is a human-centered approach to problem-solving that

emphasizes empathy, experimentation, and creativity. It is a framework for inno-
vation and problem-solving that was originally developed in the context of product
design but has since been applied to a wide range of fields and industries.

e. Course Learning Objectives:

CLOBJ 1 Develop a foundational understanding of design thinking, exploring its

fundamentals and recognizing its significance in the context of product
or service development.
CLOBJ 2 Master the skill of analyzing and interpreting the requirements of a
given problem, gaining insights into the essential elements that drive
effective problem-solving.
CLOBJ 3 Strategically plan and execute activities for problem resolution, em-
ploying techniques such as ideation and prototyping to foster innovative
solutions within a structured framework.
CLOBJ 4 Hone the ability to evaluate proposed solutions, incorporating customer
feedback into the iterative refinement process, ensuring that final out-
comes align closely with user needs and preferences.

f. Course Learning Outcomes:

CLO 1 Understand the basics of design thinking and its implications in product
or service development.
CLO 2 Understand and Analyze the requirements of a typical problem.
CLO 3 Plan the necessary activities towards solving the problem through
ideation and prototyping.
CLO 4 Evaluate the solution and refine them based on the customer feedback.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

2 - 2 3 20 20 20 60 30 150
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I Defining Needs, Ideation for solutions, 20% 2
Prototyping: Defining Needs:
Explain how PoV can be used in defining the design
problem, Use a structured approach to arrive at a PoV.
Ideation for Solutions: List the best practices for conduct-
ing a successful ideating session, Describe the techniques
for evaluating and prioritizing ideas, Prototyping: Define
prototyping, Explain how prototyping aids in communi-
cating ideas effectively, List various tools for prototyping
2 UNIT-II Testing the Solution, Problem Solving 20% 2
Mindset:
Testing the Solution: Define the steps of a successful
testing approach, Demonstrate the process of gathering
and responding to user feedback. Problem Solving Mind-
set: Understanding Problem Statements, Recapping De-
sign Principles, Design Thinking Toolsets, Formulating
approaches to Solutions, Applications of Design Thinking:
Case Study.
3 UNIT-III: Human Centered Design, Design for the 20% 8
Environment:
Human Centered Design: Services Development process
and lifecycle, Product Vs Services, Innovation in Services,
Service Experience Lifecycle, Human Computer Interac-
tion, Usability Engineering - Heuristic Evaluation. De-
sign for the Environment: Design Considerations, Envi-
ronmental Issues, Sustainable Development, Green De-
sign – Design for Process, Design for Product, Qualitative
and Quantitative Methods for DFE, Design for Disassem-
bly, Design for Recyclability, Design for Energy Efficiency.
The relevance of 4Rs - reduction, reuse, recycling and re-
covery in Environmental friendly design.
4 UNIT-IV: Design Thinking and Innovation Man- 20% 8
agement Culture:
Design Thinking and Innovation Management Culture:
Project Management - Project Planning, Business Plan,
Planning the resources, Effective Communication, Team
Management, Benchmarking the Development, Cost Es-
timation, Interpreting the Feedback and Troubleshooting,
Pitching the idea, Revenue Model.
5 UNIT-V: Design Thinking and Innovation Man- 20% 8
agement Culture:
Design Thinking and Innovation Management Culture:
Project Management - Project Planning, Business Plan,
Planning the resources, Effective Communication, Team
Management, Benchmarking the Development, Cost Es-
timation, Interpreting the Feedback and Troubleshooting,
Pitching the idea, Revenue Model.

i. Text Books:

1. The Design Thinking Playbook: Mindful Digital Transformation of Teams,

Products, Services, Businesses and Ecosystems (TextBook)

j. List of Practicals:

1. Introduction to design thinking: Introduce the concept of design thinking,

its benefits, and the overall process.
2. Empathy mapping exercise: Have participants conduct interviews with
potential users and create empathy maps to gain a deeper understanding of
their needs, wants, and pain points.
3. Define the problem statement: Based on the empathy mapping exercise,
have participants synthesize their findings and define a problem statement.
4. Ideation session: Have participants generate as many ideas as possible to
solve the problem statement. Encourage wild, unconventional, and innovative
ideas.
5. Prototyping session: Have participants select one or more ideas and create
a low-fidelity prototype to test their assumptions and validate their ideas.
6. Testing and feedback session: Have participants test their prototypes with
potential users and gather feedback on what works, what doesn’t, and what
could be improved.
7. Refine and iterate on prototype: Based on the feedback, have participants
refine and iterate on their prototype to improve its usability, functionality, and
appeal.
8. Presentation of final prototype: Have participants present their final pro-
totype to the rest of the group, explaining their design decisions, insights, and
learnings.
 Semester 2 - 5
a. Course Name: Mathematics-II

b. Course Code: 303191151

c. Prerequisite: Knowledge of Mathematics up to 12th science level

d. Rationale: The Mathematics I syllabus integrates fundamental calculus concepts,

advanced mathematical techniques, and matrix algebra, preparing students for en-
gineering challenges with optimized problem-solving skills.

e. Course Learning Objectives:

CLOBJ 1 Define and identify ordinary differential equations of higher order. Classify
ODEs based on homogeneity and linearity. Solve homogeneous linear ODEs
of higher order with constant coefficients, and variable coefficients.
CLOBJ 2 Solve homogeneous linear ODEs of higher order with constant coefficients,
variable coefficients
CLOBJ 3 Apply the Method of Undetermined Coefficients to solve nonhomogeneous
ODEs. Utilize the Solution by Variation of Parameters for solving nonho-
mogeneous ODEs. Explore applications of ODEs in real-world scenarios.
CLOBJ 4 Understand power series solutions for ordinary points and regular singular
points. Explore properties and applications of Legendre polynomials and
Bessel functions.
CLOBJ 5 Define Laplace transform and its inverse. Understand the linearity property
of Laplace transforms. Solve ordinary differential equations using Laplace
transforms.

f. Course Learning Outcomes:

CLO 1 Demonstrate the ability to translate physical or engineering problems into

mathematical equations and solve them.

CLO 2 Develop analytical and critical thinking skills through the process of solving
complex mathematical problems.

CLO 3 Understand and interpret mathematical solutions in the context of the given
problems.

CLO 4 Communicate mathematical concepts and solutions clearly and effectively,

both in written and verbal forms.

CLO 5 Present mathematical arguments and solutions in a logical and organized

manner.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

4 - - 4 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT 1: Higher order ordinary differential equa- 8% 5
tions:
Ordinary differential equations of higher orders, Homoge-
neous Linear ODEs of Higher Order, Homogeneous Lin-
ear ODEs with Constant Coefficients, Euler–Cauchy equa-
tions, Nonhomogeneous ODEs, Method of Undetermined
Coefficients, Solution by Variation of Parameters, Appli-
cations
2 UNIT 2 Power Series: 15% 9
Power series solutions at ordinary point and regular sin-
gular point; Legendre polynomials, Bessel functions of the
first kind and their property
3 UNIT 3 Laplace Transform: 25% 15
UNIT 3 Laplace Transform: Laplace Transform and in-
verse Laplace transform, Linearity, First Shifting Theo-
rem (s-Shifting), Transforms of Derivatives and Integrals,
ODEs, UNIT Step Function (Heaviside Function), Second
Shifting Theorem (t-Shifting), Laplace transform of peri-
odic functions, Short Impulses, Dirac’s Delta Function,
Convolution, Integral Equations, Differentiation and In-
tegration of Transforms, Solution of ordinary differential
equation by Laplace transform
4 UNIT 4 Fourier Integral : 17% 10
Fourier Integral, Fourier Cosine Integral and Fourier Sine
Integral
5 UNIT 5 Vector Calculus: 10% 6
Gradient of scalar field, Directional Derivative, Divergence
and curl of Vector field, Scalar line integrals, vector line
integrals, scalar surface integrals, vector surface integrals,
Theorems of Green, Gauss and Stokes.
6 UNIT 6 Multivariable Calculus (Integration): 25% 15
Multiple Integration: Double integrals (Cartesian),
change of order of integration in double integrals, Change
of variables (Cartesian to polar), Triple integrals (Carte-
sian)

i. Text Book and Reference Book:

1. Advanced Engineering Mathematics (TextBook) By Erwin Kreyszig — Willey

India Education
2. Calculus with early transcendental functions By James Stewart — Cengage
Learning
3. Higher Engineering Mathematics By B. S. Grewal — Khanna Publications
4. Calculus and Analytic Geometry (TextBook) By G.B. Thomas and R.L. Finney
— Addison Wesley A text book of Engineering Mathematics By N.P. Bali and
Manish Goyal — Laxmi Publications
 Semester 2 - 6
a. Course Name: Advanced Communication & Technical Writing

b. Course Code: 303193152

c. Prerequisite: Knowledge of English Language studied till 12th standard

d. Rationale: Communication confidence laced with knowledge of English grammar

is essential for all engineers.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with electrical current, potential difference, power and
energy, sources of electrical energy and elements of electrical circuit.
CLOBJ 2 Solve problems related to Alternating current, alternating voltage, etc,
Demonstrate a clear understanding of Pure R, L C circuit and combi-
nation of RLC, Series and Parallel combination of R, L and C, etc.
CLOBJ 3 Acquire knowledge of the resistor, capacitor, and inductor and their
performance characteristics for series and parallel connections.
CLOBJ 4 Understand different single phase and three phase circuits.
CLOBJ 5 Demonstrate a clear understanding of the basic concepts, working prin-
ciples and applications of transformer, DC machines and AC machines.
CLOBJ 6 Study the use of LT Switchgear, Fuse, MCB, ELCB etc.

f. Course Learning Outcomes:

CLO 1 Develop four basic skills

CLO 2 Construct grammatically correct sentences.
CLO 3 Develop and deliver professional presentation skills.
CLO 4 Develop the skills of critical thinking.
CLO 5 Compare different types of written communication.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

0 2 0 2 0 100 0 0 0 100
L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;
CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Developing Effective Listening Skills: 10% 2
To help students understand the meaning and importance
of good listening skills, learning the traits of being a good
listener through activity and listening audio tracks..
2 UNIT-II: Error analysis: 10% 4
To provide insights into the complicated processes of lan-
guage development as well as a systematic way for iden-
tifying, describing and explaining errors. (Tenses, Voices,
Reported speech)
3 UNIT-III: Delivering different types of speeches: 10% 2
Students will understand and use the different patterns
for structuring speeches, Welcome / Introductory speech
Vote of Thanks speeches, Farwell speeches .
4 UNIT-IV: Professional Presentations 10% 5
: Students will learn Combating stage fright, Preparing
power point presentation Delivering PPT.
5 UNIT-V: Essay writing 10% 4
: Students will overcome the common pitfalls in the task
of essay writing by understanding, Basics of Paragraph de-
velopment and paragraph jumble, Types of essays, Char-
acteristic features of essays, Guiding Principles.
6 UNIT-VI: Reading Comprehension: 10% 2
: Employing Different Reading Skills, Activity, Practice
7 UNIT-VII: Project Proposal: 5% 2
To equip students with the various elements required to
prepare a winning proposal.
8 UNIT-V: Misplaced Modifiers 5% 1
Students will understand how to place the improperly sep-
arated word, phrase or clause from the word it describes.
9 UNIT-IX: Movie Review: 10% 2
A movie show followed by writing a review. To provide an
exposure to students how to express their opinions about
some film or documentary with unbiased and objective
approach.
10 UNIT-X: Narrative Writing: 5% 2
Narrative writing helps them explore different characters
and settings. To help students clarify their thinking, and
teach them to express that in writing in an organized way.

11 UNIT-XI: Activity Session 10% 2

Process of writing,Order of writing,Final draft & checklist
for reports,Sample reports,Memorandum,Letter report
12 UNIT-XII: Critical Thinking 5% 1
Need, relevance and Significance of Critical Think-
ing,Logic in problem solving and decision mak-
ing(activities),Moral Reasoning (Case Studies)
13 UNIT-XIII: Activity Session (Presentation) 0% 1
An activity where the scene of a press conference is cre-
ated in the class. Students are encouraged to ask sharp
questions and in turn are invited to assume roles of famous
personalities, thus answering the questions posed.

*Continuous Evaluation:It consists of Assignments/Seminars/Presentations/Quizzes/

Surprise Tests (Summative/MCQ) etc.

i. Text Books:
1. Business Correspondence and Report Writing SHARMA, R. AND MO-
HAN, K.
2. Communication Skills Kumar S and Lata P; New Delhi Oxford University
Press Practical English Usage MICHAEL SWAN
3. A Remedial English Grammar for Foreign Student F.T. WOOD\
4. On Writing Well William Zinsser; Harper Paperbacks,2006; 30th anniver-
sary edition
5. Oxford Practice Grammar, John Eastwood; Oxford University Press Tech-
nical Communication : Principles And Practice Sangeetha Sharma, Meenakshi
Raman; Oxford University Press
 Semester 2-7
1.
a. Course Name: Global Certifications - Fundamentals (Azure)

b. Course Code: 303105153

c. Prerequisite: Possess a fundamental understanding of cloud computing concepts

and services. Familiarity with basic networking principles and a working knowledge
of operating systems is recommended.

d. Rationale: Azure provides a comprehensive cloud platform by Microsoft, offer-

ing scalable and flexible computing resources for businesses. With a vast array of
services, Azure facilitates seamless deployment, management, and scaling of appli-
cations. Its global presence and integration with various tools make it a versatile
and reliable choice for organizations seeking efficient cloud solutions.

e. Course Learning Objectives:

CLOBJ 1 Develop a foundational understanding of cloud computing principles, ex-

ploring key concepts such as virtualization, scalability, and resource provi-
sioning.

CLOBJ 2 Gain familiarity with a diverse range of Azure services, enabling the ability
to assess and leverage appropriate tools for different cloud-based scenarios.

CLOBJ 3 Acquire knowledge of Azure security features, including identity and access
management, encryption, and compliance, to ensure the implementation of
robust and secure cloud solutions.

CLOBJ 4 Understand Azure Service Level Agreements (SLAs) and the lifecycle of
Azure services, allowing for informed decision-making, efficient resource
management, and adherence to service quality commitments.

f. Course Learning Outcomes:

CLO 1 Understand the principles of cloud computing.

CLO 2 Familiarity with the various Azure services.

CLO 3 Understanding the Azure security features.

CLO 4 Understanding Azure Service Level Agreements (SLAs) and the Azure ser-
vice lifecycle.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

2 0 0 2 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Cloud Concepts: Understanding cloud computing prin- 15% 4
ciples, such as the different types of cloud models (pub-
lic, private, hybrid), infrastructure-as-a-service (IaaS),
platform-as-a-service (PaaS), and software-as-a-service
(SaaS).
2 Azure Services: Familiarity with the various Azure ser- 20% 6
vices and their common use cases. This includes ser-
vices like Azure Virtual Machines, Azure App Services,
Azure Storage, Azure Functions, Azure SQL Database,
and more.
3 Security, Privacy, Compliance, and Trust: Knowl- 20% 6
edge of Azure security features, identity and access man-
agement, Azure Active Directory, data protection, compli-
ance frameworks, and Azure governance methodologies.
4 Azure Pricing and Support: Understanding Azure 15% 4
subscription options, cost management, pricing models,
and the different support options available to Azure cus-
tomers.
5 Azure SLA and Service Lifecycles: Familiarity with 30% 10
Azure Service Level Agreements (SLAs) and the Azure
service lifecycle, including planned maintenance, updates,
and deprecation policies.

i. Reference Books:
1. ”Microsoft Azure Fundamentals: Understanding Azure” by Michael Collier and
Robin Shahan - 3rd Edition
2. ”Azure for Architects: Implementing cloud design, DevOps, containers, IoT, and
serverless solutions on your public cloud” by Ritesh Modi - 2nd Edition
3. ”Exam Ref AZ-900 Microsoft Azure Fundamentals” by Jim Cheshire - 2nd Edition
 Semester 3 - 1
a. Course Name: Design of Data Structure

b. Course Code: 303105201

c. Prerequisite: Computer Programming and Basic Syntaxes

d. Rationale: Data structure is a subject of primary importance in Information and

Communication Technology. Organizing or structuring data is important for im-
plementation of efficient algorithms and program development. Efficient problem
solving needs the application of appropriate data structure during program devel-
opment.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with Principles of OSS, Open-Source Standards, Require-

ments for Software, OSS success, Free Software, Examples, Licensing, Free
Vs. Proprietary Software, Free Software Vs. Open-Source Software, Public
Domain.

CLOBJ 2 Acquire Knowledge regarding Open-Source History, Open Source Initiatives,

Open Standards Principles, Methodologies, Philosophy, Software freedom,
Open-Source Software Development, Licenses, Copyright vs. Copy left,
Patents, Zero marginal cost, Income-generation Opportunities, Internation-
alization

CLOBJ 3 Acquire knowledge of Community and Communication, Contributing to

Opensource Projects Introduction to GitHub, interacting with the commu-
nity on GitHub, Communication and etiquette, testing open-source code,
reporting issues, contributing code. Introduction to Wikipedia, contribut-
ing to Wikipedia or contributing to any prominent open-source project of
student’s choice. Open-Source Ethics and Social Impact: Open source vs.
closed source, Open-source Government, Ethics of Opensource,

CLOBJ 4 Understand GNU/Linux, Android, Free BSD, Open Solaris. Open-

Source Hardware, Virtualization Technologies, Containerization Technolo-
gies: Docker, Development tools, IDEs, Debuggers, Programming lan-
guages, LAMP, Open-Source Database technologies

CLOBJ 5 Demonstrate apache Web server, BSD, GNU/Linux, Android, Mozilla (Fire-
fox), Wikipedia, Drupal, WordPress, Git, GCC, GDB, GitHub, Open Office,
LibreOffice Study
 f. Course Learning Outcomes:

CLO 1 Use different types of data structures, operations and algorithms.

CLO 2 Apply searching and sorting operations on files

CLO 3 Use stack, Queue, Lists, Trees and Graphs in problem solving.

CLO 4 Implement all data structures in a high-level language for problem solving.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 0 4 5 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Introduction: Data Structures, Classifications (Primi- 10% 6
tive & Non-Primitive), Data structure Operations, Re-
view of Arrays, Structures, Self-Referential Structures,
and Unions. Pointers and Dynamic Memory Allocation
Functions. Representation of Linear Arrays in Memory,
dynamically allocated arrays. Performance analysis of an
algorithm and space and time complexities
2 Stacks, Recursion and Queue: Stacks: Definition, 15% 8
Stack Operations, Array Representation of Stacks, Stacks
using Dynamic Arrays, Stack Applications: Polish no-
tation, Infix to postfix conversion, evaluation of postfix
expression. Recursion - Factorial, GCD, Fibonacci Se-
quence, Tower of Hanoi, Queues: Definition, Array Rep-
resentation, Queue Operations, Circular Queues, Circular
queues using Dynamic arrays, Deque, Priority Queues and
its problems
3 Linked Lists: Definition, Representation of linked lists in 10% 5
Memory, Memory allocation; Garbage Collection. Linked
list operations: Traversing, Searching, Insertion, and Dele-
tion. Doubly Linked lists, Circular linked lists, and header
linked lists. Linked Stacks and Queues. Applications of
Linked lists
4 Searching and Sorting: Interpolation Search Sorts: 10% 5
Selection Sort, Insertion Sort, Bubble Sort, Quick Sort,
Merge Sort, Radix Sort
5 Trees: Terminology, Binary Trees, Properties of Binary 10% 4
trees, Array and linked Representation of Binary Trees,
Binary Tree Traversals - In Order, Post Order, Pre Order;
Additional Binary tree operations. Threaded binary trees,
Binary Search Trees – Definition, Insertion, Deletion,
Traversal, Searching, Application of Trees-Evaluation of
Expression.
6 Red Black Trees and AVL Trees: Introduction- 15% 8
Operations on Red Black Trees, AVL tree Construction,
Operations on AVL Trees
7 Hashing: Hash Table organizations, Hashing Functions, 15% 3
Static and Dynamic Hashing
8 Graphs: Definitions, Terminologies, Matrix and Adja- 15% 5
cency List Representation of Graphs, Elementary Graph
operations, Traversal methods: Breadth First Search and
Depth First Search.

i. Text Book and Reference Book:

1. Fundamentals of Data Structures in C, 2ND EDITION, E.Horowitz, S,.Sahni

and Susan Anderson- Freed, Universities Press (TextBook)
2. Seymour Lipschutz, Data Structures Schaum’s Outlines, Revised 1st Ed, Mc-
Graw Hill, 2014.

j. List of Practicals:

1. Implement Stack and its operations like (creation push pop traverse peek
search) using linear data structure
2. Implement Infix to Postfix Expression Conversion using Stack.
3. Implement Postfix evaluation using Stack.
4. Implement Towers of Hanoi using Stack.
5. Implement queue and its operations like enqueue, dequeue, traverse, search.
6. Implement Single Linked lists and its operations(creation insertion deletion
traversal search reverse).
7. Implement Double Linked lists and its operations(creation insertion deletion
traversal search reverse).
 8. Implement binary search and interpolation search.
9. Implement Bubble sort, selection sort, Insertion sort, quick sort ,merge sort.
10. Implement Binary search Tree and its operations ( creation, insertion, dele-
tion).
11. Implement Traversals Preorder In-order Post-order on BST.
12. implement Graphs and represent using adjacency list and adjacency matrix
and implement basic operations with traversals (BFS and DFS).
 Semester 3-2
a. Course Name: Database Management System

b. Course Code: 303105203

c. Prerequisite: Basic Computer Knowledge

d. Rationale: The course will enable students to understand the different issues
involved in the design and implementation of a database system as well execute
various database queries using SQL.

e. Course Learning Objectives:

CLOBJ 1 Understand DBMS and FPS

CLOBJ 2 Study the use of DBMS language, SQL
CLOBJ 3 Acquire knowledge of the different types of Model and E-R Diagram.
CLOBJ 4 Understand different Data Models, Constraints and keys, and relational
algebra Model
CLOBJ 5 Study the use of transaction, database recovery, concurrency control and
deadlock
CLOBJ 6 Study the use of Query Processing
CLOBJ 7 Understand different relational database designs
CLOBJ 8 Acquire knowledge of the security
CLOBJ 9 Understand the PL/SQL practical

f. Course Learning Outcomes:

CLO 1 Understand basic concepts of Database

CLO 2 Understand Relational Models and their importance.

CLO 3 Build a properly structured database for a given problem or application.

CLO 4 Learn how various transactions are managed in real-time scenarios.

CLO 5 Understand the evaluation parameters of a query as well as the security

parameters of the database.

CLO 6 Implement SQL concepts to build dynamic database applications.

 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 0 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Introduction: Introduction and applications of DBMS, 10% 3
File Processing System and its limitations, ANSI/SPARC
Model, Data Independence, Client-Server Architecture,
Users & DBA, Database Architecture.
2 SQL: Data Definition Language (DDL) commands, Data 10% 4
Manipulation Language (DML) commands, Data Control
Language (DCL) commands, Transaction Control Lan-
guage (TCL) commands. Predicates & Clauses: Logi-
cal Operators (AND / OR), Relational Operators, BE-
TWEEN Predicate, IN & NOT IN Predicate, LIKE Pred-
icate. Functions in SQL: Aggregate Functions, Character
Functions, Arithmetic Functions, Date Functions, Conver-
sion Functions.
3 Data Models: Hierarchical Model, Network Model, Re- 10% 5
lational Model, Object-Oriented Model. E-R Diagram:
Introduction to E-R Diagram, Entities, Attributes & its
types, Relationships, Mapping Cardinalities, Participa-
tion Constraints, Weak Entity Sets, Specialization, Gen-
eralization, Aggregation.
4 Relational Data Model: Introduction, Degree, Cardi- 10% 4
nality. Constraints & Keys: Primary Key, Foreign Key,
Super Key, Candidate Key, Not Null Constraint, Check
Constraint. Relational Algebra Operations: Selec-
tion, Projection, Cross-Product, Rename, Joins (Natural
& Outer Join), Set Operators (Union, Intersection, Set
Difference), Aggregate Functions.
5 Relational Database Design: Functional Dependency 20% 6
– definition, trivial and non-trivial FD, Armstrong’s Ax-
ioms/Inference Rules, Closure of FD, Closure of At-
tributes, Candidate Key, Finding a Candidate Key, De-
composition (Lossy & Lossless), Database Anomalies,
Normalization – 1NF, 2NF, 3NF, BCNF, 4NF, 5NF.
6 Transaction: Introduction, ACID Properties, Transac- 20% 12
tion Life Cycle, Scheduling, Serial Schedule, Interleaved
Schedule, Transaction Operations, Serializability (View &
Conflict), Two-Phase Commit Protocol. Database Re-
covery: Introduction, Log Based Recovery, Shadow Pag-
ing, Checkpoints. Concurrency Control: Introduction,
Lock Based Protocol, Two Phase Lock Protocol, Inten-
tion Locking, Multiple Granularity, Time-based Protocol.
Deadlock: Introduction, Deadlock Detection, Deadlock
Recovery, Deadlock Prevention (Wait-Die, Wound-Wait &
Timeout-Based Approach).
7 Query Processing: Introduction, Layers of Query Pro- 10% 3
cessing, Measures of Query Cost, File Scans (Linear &
Binary Search), Materialized View, Pipelining. Query
Optimization: Introduction, Equivalence Rules, Cost-
Based Query Optimization.
8 Security: Data Security, Data Integrity, Authentication, 5% 2
Authorization, Encryption, Decryption, Access Control
(DAC, RBAC, MAC), Intrusion Detection, SQL Injection.
9 PL/SQL Concepts: Views, PL/SQL Block, Cursors, 5% 3
Triggers, Stored Procedures, Stored Functions.

i. Text Books:

1. Database System Concepts (TextBook) By Abraham Silberschatz, Henry Ko-

rth, S. Sudarshan — McGraw Hill International — 6th Edition
2. An Introduction to Database Systems By C. J. Date, A. Kannan, S. Swamy-
nathan — Pearson Education
3. SQL, PL/SQL

j. Practical List:

1. Create the following:

i. DBMS Concepts:
• Define DBMS (Database Management System). Explain the advan-
tages of DBMS over File Processing System (FPS).
• List 15 applications of Database. Explain any 2 applications and de-
scribe how a Database can be helpful in managing those applications.
ii. Database Creation:
• Create a database with the following details:
 A. Student Details: Create using Excel.
B. Employee Details: Create using MS Access.
C. Facebook: Create using Excel.
2. Create the following Tables:
• Important Instructions:
– Use varchar2(30) datatype for Alphanumeric Characters and Special
Symbols, number datatype for Numbers, date datatype for Date.
– Use same table and column name (Capital and Small Case) as men-
tioned in this file.
– Insert proper data (Capital and Small Case) as mentioned in this file.
• Employee
– Emp name Street City
– Adam Spring Pittsfield
– Brooks Senator Brooklyn
– Curry North Rye
– Demalo SunShine San Deago
3. Simple Queries:
i. Describe deposit, branch.
ii. Describe borrow, customers.
iii. List all data from table DEPOSIT.
iv. List all data from table BORROW.
v. List all data from table CUSTOMERS.
vi. List all data from table BRANCH.
vii. Give account no and amount of depositors.
viii. List all data from SAILORS.
ix. List Boat Name and its color.
x. List Employee name and its city.
xi. List all the details of Clients.
xii. Describe various products and its price.
xiii. Describe sailor’s name, age and its rating.
xiv. Describe the managers of various employees.
xv. Describe the details of Loan for customers.
xvi. Describe the date of travel of various sailors.
4. Simple Queries:
i. Give name of depositors having amount greater than 4000.
ii. List the employees having salary less than 22000.
iii. List the sailors having age more than 25.
iv. List the boats travelling on 10-Oct-98.
v. List the details of boat “Interlake”.
vi. List the details of the red colored boat.
vii. List the details of clients whose city is Mumbai.
 viii. List Client Name, due balance and city of the clients having balance
greater than 1500.
ix. Describe the details of products having selling price less than 500.
x. List the products for which quantity ordered is less than 120 and cost
price is greater than 250.
xi. Display account details having amount greater 2200.
xii. Display all the customers staying in Nagpur.
xiii. Display the names of sailors having rating greater than 7.
xiv. Display the orders made in the month of June.
xv. List all the accounts created in the month of March.
5. “Like” Queries:
i. Display all customers whose name start with ‘M’.
ii. Display all the customers whose name ends with ‘L’.
iii. Display all loan details whose branch starts with ‘A’.
iv. Display the details of sailors whose name is minimum 6 characters long.
v. Display the details of Employees whose address starts with ‘S’.
vi. List the details of the boat ending with ‘e’.
vii. List the details of clients having ‘h’ as a 3rd character in his/her name.
viii. List Client Name, due balance and city whose pin code starts with 4.
ix. List all customers whose city contains ‘a’ as second character.
x. List client names and city whose state has ‘a’ as fourth or fifth character.
6. “Aggregate Functions & DML” Queries:
i.List total deposit from deposit.
ii.Give Maximum loan given to a customer.
iii. Describe the average age of all the sailors.
iv. Count total number of customers.
v. Count total number of customer’s cities.
vi. Display total target for the salesman.
vii. Update the salary of the employee having 10000 to 11500.
viii. Update the city of client from Bangalore to Bengaluru.
ix. Give the 15% hike in the salary of all the Employees. Rename that column
to “New Salary”.
x. Increase the sell price of all products by 20% and label new column as
“New Sell Price”. (Do not update the table)
xi. Provide the count of customers staying in “Bombay”.
7. “Join” Queries:
i. Find the salary of Adam.
ii. Find the city where Brooks work.
iii. Display the sailor’s details whose boat is booked for 9th May, 98.
iv. Display the day of ride and sailor name for boat 103.
v. Display the sailor name and its age for Red colored and 101 boat.
 vi. Display the sailor details whose boat is never booked.
vii. Display the sailor name that has Red or Green Boat.
viii. Display all sailor details and boat details and who has Interlake boat.
ix. Display sailor’s rating with boat details or the trip on 10th October, 98.
x. Display the sailor id and name whose age is more than 42 or who has Blue
colored boat.
xi. Display name and rating of sailor whose boat name is Clipper.
xii. List products whose selling price is more than 500 and less than equal to
750.
xiii. Describe the second highest salary of an employee.
xiv. Display the date of travel and sailor’s name whose age is between 35 and
65.
xv. List all the employees working for “FBC”.
8. “Join” Queries:
i. Display all the employee name and the city where they work.
ii. Display the employee name and company’s name having salary more than
15000.
iii. Find the average rating and age of all sailors.
iv. List various products available.
v. Display the names of salesman who have salary more than 2850.
vi. Change the cost price of Trousers to 950.
vii. List all the clients having “a” as a second character in their names.
viii. List all the products whose QtyonHand is less than Reorderlvl.
ix. Print the description and total qty sold for each product.
x. Find out all the products which have been sold to “Ivan Bayross”.
xi. Find the names of all clients who have purchased Trousers.
xii. Find the products and their quantities for the orders placed by client
C00001 and C00002.
xiii. List the client details who place order no. O19001.
xiv. List the name of clients who have placed orders worth Rs. 10000 or more.
xv. Find the total of Qty ordered for each Order.
9. “Miscellaneous” Queries:
i. Find the average rate for each Order.
ii. Give the loan details of all the customers.
iii. List the customer name having loan account in the same branch city they
live in.
iv. Provide the loan details of all the customers who have opened their ac-
counts after August’95.
v. List the order information for client C00001 and C00002.
vi. List all the information for the order placed in the month of June.
vii. List the details of clients who do not stay in Maharashtra.
viii. Determine the maximum and minimum product price. Rename the output
as “Max Price” and “Min Price”.
 ix.Count the number of products having price less than or equal to 500.
x.List the order number and the day on which client placed an order.
xi.List the month and the date on which an order is to be delivered.
xii.List the date, 25 days after today’s date.
xiii.Find the total of all the billed orders in the month of June.
xiv. List the products and orders from customers who have ordered less than
5 units of “Pull Overs”.
xv. Find the list of products and orders placed by “Ivan Bayrosss” and “Mamta
Muzumdar”.
xvi. List the clients who placed order before June’04.
xvii. List all the clients who stays in “Bengaluru” or “Mangalore”.
10. PL/SQL Block:
i. Write a PL/SQL Block to Add 2 Numbers.
ii. Write a PL/SQL Block to find Area of Rectangle, Triangle, and Square.
iii. Write a PL/SQL Block to find Maximum of 3 numbers.
iv. Write a PL/SQL Block to print sum of N Numbers using For Loop.
v. Write a PL/SQL Block to generate Fibonacci series of N numbers.
 Semester 3 - 3
a. Course Name: Object Oriented Programming

b. Course Code: 303105205

c. Prerequisite: Basic knowledge of software applications

d. Rationale: This course provides a broad introduction to software engineering. The

various process models required to develop software are also described. Moreover,
the functional and non-functional requirements are also described.

e. Course Learning Objectives:

CLOBJ 1 Gain the Knowledge of the concept with the Object-oriented programming,
OOPs principles.

CLOBJ 2 Understand Data types, variables, operators.

CLOBJ 3 Understand the concept of Control statements.

CLOBJ 4 Demonstrate the use of Arrays, Array values, and memory storage Structure.

CLOBJ 5 Demonstrate the use of various OOPs concepts with the help of programs.

CLOBJ 6 Study the use of Inheritance with Examples.

CLOBJ 7 Understand the concept of Strings, Packages, and Interfaces.

CLOBJ 8 Demonstrate the Concept of Exception Handling.

CLOBJ 9 Gain the knowledge of multi-threading.

CLOBJ 10 Understand the knowledge of Collections Framework.

 f. Course Learning Outcomes:

CLO 1 Describe the procedural and object-oriented paradigm with concepts of

streams, classes, functions, data, and objects.

CLO 2 Understand dynamic memory management techniques using pointers, con-

structors, destructors, etc.

CLO 3 Describe the concept of function overloading, operator overloading, virtual

functions, and polymorphism.

CLO 4 Classify inheritance with the understanding of early and late binding, usage
of exception handling, and generic programming.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

2 0 2 3 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Design introduction: Object-oriented programming, 10% 3
OOPs principles, encapsulation, inheritance, and poly-
morphism; Java as an OOP & internet enabled language,
importance of Java, Java usage in industry, the byte code,
compiling, and running of simple Java program, JVM,
JDK, JRE.
2 Data types, variable, operators: Data types, vari- 10% 3
ables, dynamic initialization, scope and lifetime of vari-
ables, type conversion and casting, operators.
3 Control statements: Conditional Statements, Looping 10% 3
Statements, Jump Statements.
4 Arrays: Array, Array values and memory storage Struc- 8% 3
ture, Types of Arrays.
5 Object-oriented programming: Classes and objects: 18% 5
concepts of classes and objects, declaring objects, assign-
ing object reference variables, methods, constructors, ac-
cess control, garbage collection, usage of static with data
and methods, usage of final with data, overloading meth-
ods and constructors, parameter passing - call by value,
recursion, nested classes.
6 Inheritance: Inheritance Basics, member access rules, 8% 2
Usage of super key word, forms of inheritance, Method
Overriding, Abstract classes, Dynamic method dispatch,
Using final with inheritance.
7 Strings, Packages and Interfaces: String handling 12% 4
functions, Packages, Class path, importing packages, dif-
ferences between classes and interfaces, Implementing &
Applying interface, enumerations in Java.
8 Exception Handling: Exceptions, Types of Exceptions, 8% 2
Handling of Exceptions.
9 Multi Threading: Thread, Usage of threads, Types of 10% 3
threads, Handling Threads.
10 Collections Framework: Functional Programming, 6% 2
Collections, Hierarchy of collections.

i. Text Books:

1. Introduction to Java Programming (Comprehensive Version) Daniel Liang;

Pearson (TextBook)
2. Core Java Volume-II Fundamentals Horstmann & Cornell; Pearson
3. Complete Reference Java 2 Herbert Schildt; TMH

j. List of Practicals:

1. Write a program to display Hello World message in the console window.

2. Write a program to perform arithmetic and bitwise operations in a single source
program without object creation.
3. Write a program to perform arithmetic and bitwise operations by creating
individual methods and classes, then create an object to execute the individual
methods of each operation.
4. Write a Java program to display the employee details using Scanner class.
5. Write a Java program that prints all real solutions to the quadratic equation
ax2 + bx + c = 0. Read in a, b, c and use the quadratic formula. If the
discriminant b2 − 4ac is negative, display a message stating that there are no
real solutions.
6. The Fibonacci sequence is defined by the following rule: The first 2 values
in the sequence are 1, 1. Every subsequent value is the sum of the 2 values
preceding it. Write a Java program that uses both recursive and non-recursive
functions to print the nth value of the Fibonacci sequence.
 7. Write a Java program that prompts the user for an integer and then prints
out all the prime numbers up to that integer.
8. Write a Java program to multiply two given matrices.
9. Write a Java program for sorting a given list of names in ascending order.
10. Write a Java program for Method overloading and Constructor overloading.
11. Write a Java program to represent Abstract class with an example.
12. Write a program to implement multiple Inheritances.
13. Write a program to demonstrate method overriding and super keyword.
14. Write a Java program to implement Interface using extends keyword.
15. Write a Java program to create inner classes.
16. Write a Java program to create a user-defined package.
17. Write a Java program that displays the number of characters, lines, and words
in a text.
18. Write a Java program that checks whether a given string is a palindrome or
not. E.g., MADAM is a palindrome.
19. Write a Java program that reads a line of integers and then displays each
integer and the sum of all integers. (Use StringTokenizer class).
20. Write a Java program for creating a single try block with multiple catch blocks.
21. Write a program for multiple try blocks and multiple catch blocks including
finally.
22. Write a program to create a user-defined exception.
23. Write a Java program for producer and consumer problem using Threads.
24. Write a Java program that implements a multi-threaded application with three
threads. The first thread generates a random integer every 1 second, and if
the value is even, the second thread computes the square of the number and
prints it. If the value is odd, the third thread will print the value of the cube
of the number.
25. Write a program to create a dynamic array using ArrayList class and print the
contents of the array object.
26. Write programs to implement add, search, and remove operations on ArrayList
object.
 Semester 3 - 4
a. Course Name: Computer Organization and Microprocessor

b. Course Code: 303105210

c. Prerequisite: Basic understanding of computer system

d. Rationale: This course provides detail of computer system’s functional compo-

nents, their characteristics, performance and interactions including system bus,
different types of memory and input/output organization and CPU. This course
also covers the architectural issues such as instruction set program and data types.
On top that, the students are also introduced to the increasingly important area
of parallel organization. This course also serves as a basic to develop hardware-
related projects. And hence it is an important course for all students of computer
engineering branch.

e. Course Learning Objectives:

CLOBJ 1 Understand the Introduction to Microprocessor 8085.

CLOBJ 2 Study the Microprocessor architecture and interfacing.

CLOBJ 3 Demonstrate the Programming methods with Instructions of 8085.

CLOBJ 4 Learn different Additional Programming techniques.

CLOBJ 5 Understand 8085 Interrupts.

CLOBJ 6 Use different Computer Organization - Register Transfer and Basic Com-
puter Design Register.

CLOBJ 7 Work on different Computer Organization - Assembler and Memory Orga-

nization Assembler.

f. Course Learning Outcomes:

CLO 1 Explain 8085 microprocessor architecture.

CLO 2 Design assembly language programs for the 8085 microprocessor.

CLO 3 Design interfacing with various hardware using the 8085 microprocessor.

CLO 4 Debug programs written in assembly language.

 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Introduction to Microprocessor 8085 10% 4
Introduction to Microprocessor 8085, Instruction set and
computer languages, 8085 Programming Model, Instruc-
tion Data Format and storage.
2 UNIT-II: Microprocessor Architecture and Inter- 20% 8
facing
Microprocessor architecture and its operations, Memory
and I/O devices, Memory interfacing, Interfacing I/O De-
vices.
3 UNIT-III: Programming Methods with Instruc- 15% 5
tions
8085 Instructions, Looping, Counting and Indexing, Logic
operations, Rotate and Compare.
4 UNIT-IV: Additional Programming Techniques 15% 8
Counter, Time delay, Stack & Subroutines, Restart, Call
and Return Instructions, Code conversion.
5 UNIT-V: 8085 Interrupts 10% 5
Interrupt structure of 8085 microprocessor, Processing of
vectored and non-vectored interrupts, Latency time and
response time; Handling multiple interrupts.
6 UNIT-VI: Computer Organization - Register 15% 8
Transfer and Basic Computer Design
Register Transfer: Register Transfer language, Bus design
using multiplexer and Tri-state buffer, Memory Transfers,
Arithmetic Micro-Operations, Logic Micro-Operations,
Shift Micro-Operations, Arithmetic Logical Shift Unit.
Basic Computer Design: Memory-Reference Instructions,
Register Reference Instructions, I/O Reference Instruc-
tions, Interrupt, Design of Accumulator Unit.
7 UNIT-VII: Computer Organization - Assembler 15% 8
and Memory Organization
Assembler: Machine Language, Assembly Language, As-
sembler, Program loops, Programming Arithmetic and
Logic operations, Subroutines, I/O Programming. Mem-
ory Organization: Memory hierarchy, Main memory, Aux-
iliary memory, Flash memory, Associative memory, Cache
memory, Virtual memory.

i. Text Books:

(a) Microprocessor Architecture, Programming, and Applications with the 8085

(Text Book)
(b) Computer System Architecture By M.Morris Mano — PHI — 3rd Edition
(c) Microprocessor 8085 and its Interfacing By Sunil Mathur — PHI Learning
Pvt. Ltd
(d) 8085 Microprocessor And its Applications By A. NagoorKani — TMH Edu-
cation Pvt. Ltd

j. List of Practicals:

1. Introduction to Microprocessor 8085 Microprocessor, Instruction set and com-

puter languages, 8085 Programming Model, Instruction Data Format and stor-
age.
2. Microprocessor architecture and interfacing Microprocessor architecture and
its operations, Memory and I/O devices, Memory interfacing, Interfacing I/O
devices.
3. Programming methods with Instructions 8085 Instructions, Looping, Counting
and Indexing, Logic operations Rotate and Compare.
4. Additional Programming techniques Counter, Time delay, Stack Subroutines,
Restart, Call and Return Instructions, Code conversion.
5. 8085 Interrupts Interrupt structure of 8085 microprocessor, Processing of vec-
tored and non-vectored interrupts, Latency time and response time; Handling
multiple interrupts.
6. Computer Organization - Register Transfer and Basic Computer Design Regis-
ter Transfer: Register Transfer language, Bus design using multiplexer and Tri-
state buffer, Memory Transfers, Arithmetic Micro-Operations, Logic Micro-
Operations, Shift Micro-Operations, Arithmetic Logical Shift Unit. Basic
Computer Design: Instruction codes, Computer registers, Computer instruc-
tions, Timing and Control, Instruction cycle, Memory-Reference Instructions,
Register Reference Instructions, I/O Reference Instructions, Interrupt, Design
of Accumulator Unit.
7. Computer Organization - Assembler and Memory Organization Assembler:
Machine Language, Assembly Language, Assembler, Program loops, Program-
ming Arithmetic and Logic operations, Subroutines, I/O Programming. Mem-
ory Organization: Memory hierarchy, Main memory, Auxiliary memory, Flash
memory, Associative memory, Cache memory, Virtual memory.
 Semester 3 - 5
a. Course Name: Discrete Mathematics

b. Course Code: 303191202

c. Prerequisite: Knowledge of Mathematics up to 12th science level

d. Rationale: The Mathematics I, Mathematics-II syllabus integrates fundamental

calculus concepts, advanced mathematical techniques, and vector calculus, prepar-
ing students for engineering challenges with optimized problem-solving skills.

e. Course Learning Objectives:

CLOBJ 1 Apply mathematical techniques to solve diverse real-world problems across

different topics in Discrete Mathematics.

CLOBJ 2 Develop and apply analytical and critical thinking skills to understand, an-
alyze, and evaluate mathematical structures and proofs.

CLOBJ 3 Recognize and interpret mathematical solutions within the context of spe-
cific problems, demonstrating practical applications in various fields.

CLOBJ 4 Clearly and effectively communicate mathematical concepts and solutions

in both written and verbal forms, adapting to diverse topics.

CLOBJ 5 Present mathematical arguments and solutions in a unified, logical, and

organized manner, emphasizing clarity, coherence, and precision.

CLOBJ 6 Establish a comprehensive foundation for more advanced courses in mathe-

matics and related disciplines by demonstrating a thorough understanding
of fundamental concepts.
 f. Course Learning Outcomes:

CLO 1 Demonstrate proficient problem-solving skills, translating real-world prob-

lems into mathematical formulations and applying appropriate techniques
for solutions.

CLO 2 Develop integrated analytical and critical thinking skills by engaging with
a wide range of mathematical structures, proofs, and problem-solving tech-
niques presented throughout the entire syllabus.

CLO 3 Understand and interpret mathematical solutions within the context of spe-
cific problems, recognizing the practical applications of discrete mathematics
in diverse fields covered in all units.

CLO 4 Communicate mathematical concepts and solutions clearly and effectively,

both in written and verbal forms, adapting communication styles to the
diverse topics covered in each unit.

CLO 5 Present mathematical arguments and solutions in a unified, logical, and

organized manner, emphasizing clarity, coherence, and precision across all
units.

CLO 6 Lay a solid foundation for more advanced courses in mathematics and re-
lated disciplines.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

4 - - 4 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination
h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT 1: Sets, Relation and Function 11% 6
Cartesian Products, Binary Relation, Partial Ordering
Relation, Equivalence Relation, Size of a Set, Finite
and Infinite Sets, Countable and Uncountable Sets, Can-
tor’s Diagonal Argument and The Power Set Theorem,
Schroeder-Bernstein Theorem.
2 UNIT 2: Principles of Mathematical Induction 9% 5
The Well-Ordering Principle, Recursive Definition, The
Division Algorithm: Prime Numbers, The Greatest Com-
mon Divisor: Euclidean Algorithm, The Fundamental
Theorem of Arithmetic. Basic Counting Techniques: In-
clusion and Exclusion, Pigeon-Hole Principle, Permuta-
tion and Combination.
3 UNIT 3: Propositional Logic 18% 11
Syntax, Semantics, Validity and Satisfiability, Basic Con-
nectives and Truth Tables, Logical Equivalence: The Laws
of Logic, Logical Implication, Rules of Inference, The Use
of Quantifiers. Proof Techniques: Some Terminology,
Proof Methods and Strategies, Forward Proof, Proof by
Contradiction, Proof by Contraposition, Proof of Neces-
sity and Sufficiency.
4 UNIT 4: Algebraic Structures and Morphism 40% 24
Algebraic Structures with One Binary Operation: Semi
Groups, Monoids, Groups, Congruence Relation and Quo-
tient Structures, Free and Cyclic Monoids and Groups,
Permutation Groups, Substructures, Normal Subgroups.
Algebraic Structures with Two Binary Operations: Rings,
Integral Domain and Fields. Boolean Algebra and
Boolean Ring, Identities of Boolean Algebra, Duality,
Representation of Boolean Function, Disjunctive and Con-
junctive Normal Form.
5 UNIT 5: Graphs and Trees 22% 14
Graphs and Their Properties: Degree, Connectivity, Path,
Cycle, Sub Graph, Isomorphism, Eulerian and Hamilto-
nian Walks, Graph Colouring, Colouring Maps and Pla-
nar Graphs, Colouring Vertices, Colouring Edges, List
Colouring, Perfect Graph: Definition, Properties and Ex-
ample. Rooted Trees, Trees and Sorting, Weighted Trees
and Prefix Codes, Bi-connected Component and Articu-
lation Points, Shortest Distances.
i. Text Books and Reference Books:

1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw

– Hill
2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and Its Ap-
plication to Computer Science, Tata McGraw-Hill
3. Susanna S. Epp, Discrete Mathematics with Applications, 4th Edition, Wadsworth
Publishing Co. Inc.
4. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics: A Computer-
Oriented Approach, 3rd Edition, Tata McGraw – Hill.
 Semester 4 - 1
a. Course Name: Operating System

b. Course Code: 303105251

c. Prerequisite: Fundamentals of Computer Systems

d. Rationale: This course is an introduction to the theory and practice behind mod-
ern computer operating systems. Topics will include what an operating system does
(and doesn’t) do, system calls and interfaces, processes, concurrent programming,
resource scheduling and management, virtual memory, deadlocks, algorithms, pro-
gramming, and security. The approach of the subject is from both a theoretical
perspective as well as a practical one.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with the generation of Operating System, types of operating
System, and the concept of a virtual machine.

CLOBJ 2 Solve problems related to Scheduling Algorithm and concepts of threading,

multi-threading, etc.

CLOBJ 3 Acquire knowledge of Critical Section, Race Conditions, Mutual Ex-

clusion, Hardware Solution, and Strict Alternation, Peterson’s Solution,
Semaphores, Event Counters, Monitors, Message Passing, and Classical IPC
Problems.

CLOBJ 4 Understand Deadlock, Deadlock Prevention, Deadlock Avoidance: Banker’s

algorithm, Deadlock detection, and Recovery.

CLOBJ 5 Demonstrate a clear understanding of Memory Management, Memory allo-

cation, and Paging.

CLOBJ 6 Study Hardware: I/O devices, Device controllers, Direct memory access,
Principles of I/O Software: Goals of Interrupt handlers, Device drivers,
Device-independent I/O software, etc.
 f. Course Learning Outcomes:

CLO 1 Distinguish different styles of operating system design.

CLO 2 Understand device and I/O management functions in operating systems as

part of a uniform device abstraction.

CLO 3 Understand disk organization and file system structure.

CLO 4 Give the rationale for virtual memory abstractions in operating systems.

CLO 5 Understand the main principles and techniques used to implement processes
and threads as well as the different algorithms for process scheduling.

CLO 6 Understand the main mechanisms used for inter-process communication.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
T CE P Theory P

3 - 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Content Weightage Teaching
No. Hours
1 INTRODUCTION: Concept of Operating Systems, 5% 3
Generations of Operating Systems, Types of Operating
Systems, OS Services, System Calls, Structure of an
OS-Layered, Monolithic, Microkernel Operating Systems,
Concept of Virtual Machine.
2 PROCESSES, THREAD & PROCESS 20% 9
SCHEDULING: Processes: Definition, Process
Relationship, Different states of a Process, Process
State transitions, Process Control Block (PCB), Context
switching. Thread: Definition, Various states, Benefits of
threads, Types of threads, Concept of multithreads. Pro-
cess Scheduling: Foundation and Scheduling objectives,
Types of Schedulers, Scheduling criteria: CPU utilization,
Throughput, Turnaround Time, Waiting Time, Response
Time; Scheduling algorithms: Pre-emptive and Non
pre-emptive, FCFS, SJF, RR.
3 INTER-PROCESS COMMUNICATION: Critical 15% 6
Section, Race Conditions, Mutual Exclusion, Hardware
Solution, Strict Alternation, Peterson’s Solution, The
Producer/Consumer Problem, Semaphores, Event Coun-
ters, Monitors, Message Passing, Classical IPC Problems:
Reader’s & Writer Problem, Dining Philosopher Problem
etc.
4 DEADLOCKS: Definition, Necessary and sufficient con- 10% 5
ditions for Deadlock, Deadlock Prevention, Deadlock
Avoidance: Banker’s algorithm, Deadlock detection and
Recovery.
5 MEMORY MANAGEMENT & VIRTUAL MEM- 30% 13
ORY: Memory Management: Basic concept, Logical and
Physical address map, Memory allocation: Contiguous
Memory allocation-Fixed and variable partition, Inter-
nal and External fragmentation and Compaction; Paging:
Principle of operation-Page allocation, Hardware support
for paging, Protection and sharing, Disadvantages of pag-
ing. Virtual Memory: Basics of Virtual Memory, Hard-
ware and control structures, Locality of reference, Page
fault, Working Set, Dirty page/Dirty bit, Demand paging,
Page Replacement algorithms: Optimal, First in First Out
(FIFO), Second Chance (SC), Not recently used (NRU)
and Least Recently used (LRU).
6 I/O SYSTEMS, FILE & DISK MANAGEMENT: 20% 9
I/O Hardware: I/O devices, Device controllers, Direct
memory access Principles of I/O Software: Goals of
Interrupt handlers, Device drivers, Device independent
I/O software. File Management: Concept of File, Ac-
cess methods, File types, File operation, Directory struc-
ture, File System structure, Allocation methods (contigu-
ous, linked, indexed), Free-space management (bit vec-
tor, linked list, grouping), directory implementation (lin-
ear list, hash table), efficiency and performance. Disk
Management: Disk structure, Disk scheduling algorithms
- FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk for-
matting, Boot-block, Bad blocks.

i. Text Book and Reference Book:

1. Operating System Concepts Essentials (TextBook) By Avi Silberschatz, Peter

Galvin, Greg Gagne — 9th Edition Wiley Asia Student Edition.
2. Operating Systems Internals and Design Principles, By William Stallings —
PHI — 5th Edition
3. Operating System: A Design-oriented Approach By Charles Crowley — 1st
Edition - Irwin Publishing
4. Operating Systems: A Modern Perspective By Gary J. Nutt — Addison-
Wesley — 2nd Edition
5. Design of the Unix Operating Systems By Maurice Bach — Prentice-Hall of
India — 8th Edition
6. Understanding the Linux Kernel By Daniel P. Bovet, Marco Cesati — O’Reilly
and Associates — 3rd Edition

j. Practical List

1. Study of Basic commands of Linux.

2. Study the basics of shell programming.
3. Write a Shell script to print given numbers sum of all digits.
4. Write a shell script to validate the entered date (e.g., Date format: dd-mm-
yyyy).
5. Write a shell script to check if the entered string is a palindrome or not.
6. Write a Shell script to say ”Good morning”, ”Good afternoon”, or ”Good
evening” as you log in to the system.
7. Write a C program to create a child process.
8. Find the largest number from three numbers supplied as command line argu-
ments.
9. Print patterns using a for loop in C.
10. Write a Shell script to determine whether a given file exists or not.
11. Write a C program for process creation using the gcc compiler.
12. Implement the First-Come-First-Served (FCFS) Scheduling Algorithm and
Round Robin Scheduling Algorithm.
13. Implement the Banker’s Algorithm.
 Semester 4 - 2
a. Course Name: Software Engineering

b. Course Code: 303105253

c. Prerequisite: Basic knowledge of software applications

d. Rationale: This course provides a broad introduction to software engineering. The

various process models required to develop software are also described. Moreover,
the functional and non-functional requirements are also described.

e. Course Learning Objectives:

CLOBJ 1 Student will be able to understand about Software.

CLOBJ 2 Student will be able to create some Software.

CLOBJ 3 Student will be able to create some design about WAN or LAN.

CLOBJ 4 Understand different types of software.

CLOBJ 5 Demonstrate a software for testing purposes.

CLOBJ 6 Study about the Use Case study, CASE Tools, and Advanced Practices of
System Dependability and Security.

f. Course Learning Outcomes:

CLO 1 Prepare and perform Software Requirement Specification and Software

Project Management Plan.

CLO 2 Ensure the quality of software product, different quality standards, and
software review techniques.

CLO 3 Apply the concept of Functional Oriented and Object-Oriented Approach

for Software Design.

CLO 4 Understand modern Agile Development and Service Oriented Architecture

Concept of Industry.

CLO 5 Analyze, design, verify, validate, implement, and maintain software systems.

CLO 6 Execute a Project Management Plan, tabulate Testing Plans, and reproduce
effective procedures.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Content Weightage Teaching
No. Hours
1 Introduction: Study of Different Models, Software Char- 10% 6
acteristics, Components, Applications, Layered Technolo-
gies, Processes, Methods and Tools, Generic View Of Soft-
ware Engineering, Process Models - Waterfall model, In-
cremental, Evolutionary process models - Prototype, Spi-
ral And Concurrent Development Model; Agile Devel-
opment: Agility and Agile Process model, Extreme Pro-
gramming, Other process models of Agile Development
and Tools.
2 Software Project Management: Management Spec- 10% 5
trum, People – Product – Process – Project, W5HH Prin-
ciple, Importance of Team Management; Planning a Soft-
ware Project: Scope and Feasibility, Effort Estimation,
Schedule and Staffing, Quality Planning, Risk Manage-
ment - Identification, Assessment, Control, Project Mon-
itoring Plan, Detailed Scheduling.
3 Requirements Engineering: Problem Recognition, Re- 10% 5
quirement Engineering Tasks, Processes, Requirements
Specification, Use Cases and Functional Specification, Re-
quirements Validation, Requirements Analysis.
4 Structured System Design: Design Concepts, Design 15% 5
Model, Software Architecture, Data Design, Architectural
Styles and Patterns, Architectural Design, Alternative Ar-
chitectural Designs, Modeling Component Level Design
and Its Modeling, Procedural Design, Object-Oriented
Design. Data Oriented Analysis & Design: Difference
between Data and Information, E-R Diagram, Dataflow
Model, Control Flow Model, Control and Process Specifi-
cation, Data Dictionary.
5 Coding and Unit Testing: Programming Principles 10% 4
and Guidelines, Programming Practices, Coding Stan-
dards, Incremental Development of Code, Management
of Code Evaluation, Unit Testing - Procedural Units,
Classes, Code Inspection, Metrics - Size Measure, Com-
plexity Metrics, Cyclomatic Complexity, Halstead Mea-
sure, Knot Count, Comparison of Different Metrics.
6 Software Testing and Quality Assurance: Concepts, 15% 7
Psychology of Testing, Levels of Testing, Testing Pro-
cess - Test Plan, Test Case Design, Execution, Black-Box
Testing – Boundary Value Analysis – Pairwise Testing
– State Based Testing, White-Box Testing Criteria and
Test Case Generation and Tool Support; Quality Assur-
ance: Quality Control, Assurance, Cost, Reviews, Soft-
ware Quality Assurance, Approaches to SQA, Reliability,
Quality Standards - ISO9000 and 9001.
7 CASE Tools and Advanced Practices of System 15% 5
Dependability and Security: Computer Aided Soft-
ware Engineering Tools, SCRUM Developments, Depend-
able System, Reliability Engineering, Safety Engineering,
Security Engineering, Resilience Engineering.
8 Advanced Software Engineering: Software Reuse, 15% 5
Component Based Software Engineering, Distributed
Software Engineering, Service-Oriented Software Engi-
neering, Real-Time Software Engineering, Systems Engi-
neering, Systems of System.

i. Text Books and Reference Books:

1. Software Engineering (Text Book) R.Pressman; 6th Edition

2. Internetworking with TCP/IP Principles, Protocols and Architecture
3. Software Engineering By Sommerville
4. Data Communication and Networking

j. List of Practicals:

1. Project Definition and objective of the specified module and Perform Require-
ment Engineering Process.
2. Identify Suitable Design and Implementation model from the different software
engineering models.
3. Prepare Software Requirement Specification (SRS) for the selected module.
4. Develop Software Project Management Planning (SPMP) for the specified
module.
5. Do Cost and Effort Estimation using different Software Cost Estimation mod-
els.
 6. Prepare System Analysis and System Design of identified Requirement Spec-
ification using structure design as DFD with data dictionary and Structure
Chart for the specific module.
7. Designing the module using Object-Oriented approach including Use Case Di-
agram with scenarios, Class Diagram, State Diagram, Collaboration Diagram,
Sequence Diagram, and Activity Diagram.
8. Defining Coding Standards and walkthrough.
9. Write the test cases for the identified module.
10. Demonstrate the use of different Testing Tools with comparison.
11. Define security and quality aspects of the identified module.
 Semester 4 - 3
a. Course Name: Computer Network

b. Course Code: 303105255

c. Prerequisite: Knowledge of Computer and Information system

d. Rationale: This course is designed to provide basic knowledge about data & sig-
nals. It also provides basic concepts of computer networks and a firm foundation
for understanding how data communication occurs in the Transmission Medium. It
will help to develop logical abilities and practically set up the network.

e. Course Learning Objectives:

CLOBJ 1 Student will be able to understand about network.

CLOBJ 2 Student will be able to create some network connection.

CLOBJ 3 Student will be able to create some design about some WAN or LAN.

CLOBJ 4 Understand different types of switching, routers, and their tables.

CLOBJ 5 Demonstrate addressing mapping with the network.

CLOBJ 6 Study the use of TCP/IP protocol, etc.

f. Course Learning Outcomes:

CLO 1 Draw the functional block diagram of wide-area networks (WANs), local area
networks (LANs), and Wireless LANs (WLANs) and describe the function
of each block.

CLO 2 Understand the functions of the different layers of the OSI Protocol.

CLO 3 Understand and design for a given requirement (small scale) of wide-
area networks (WANs), local area networks (LANs), and Wireless LANs
(WLANs) based on available market components.

CLO 4 Learn to address problem-related TCP/IP protocol developed for network

programming.

CLO 5 Configure DNS, DDNS, TELNET, EMAIL, FTP, WWW, HTTP, SNMP,
Bluetooth, and Firewalls using open-source available software and tools.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 DATA COMMUNICATION COMPONENTS: 25% 11
Representation of data and its flow Networks, Various
Connection Topology, Protocols and Standards, OSI
model, Transmission Media, LAN: Wired LAN, Wireless
LANs, Connecting LAN and Virtual LAN, Techniques for
Bandwidth utilization: Multiplexing - Frequency division,
Time division and Wave division, Concepts on spread
spectrum
2 DATA LINK LAYER AND MEDIUM ACCESS 25% 11
SUB LAYER: Error Detection and Error Correction -
Fundamentals, Block coding, Hamming Distance, CRC;
Flow Control and Error control protocols - Stop and Wait,
Go back N ARQ, Selective Repeat ARQ, Sliding Window,
Piggybacking, Random Access, Multiple access protocols -
Pure ALOHA, Slotted ALOHA, CSMA/CD, CDMA/CA.
3 Network Layer: Switching, Logical addressing - IPV4, 20% 8
IPV6; Address mapping - ARP, RARP, BOOTP and
DHCP - Delivery, Forwarding and Unicast Routing pro-
tocols
4 Transport Layer: Process to Process Communication, 15% 6
User Datagram Protocol (UDP), Transmission Control
Protocol (TCP), SCTP Congestion Control; Quality of
Service, QoS improving techniques: Leaky Bucket and To-
ken Bucket algorithm.
5 Application Layer: Domain Name Space (DNS), 15% 6
DDNS, TELNET, EMAIL, File Transfer Protocol (FTP),
WWW, HTTP, SNMP, Bluetooth, Firewalls, Basic con-
cepts of Cryptography.
i. Text Books and Reference Books:

1. Computer Networks (Text Book) by Andrew S. Tanenbaum and David J.

Wetherall — PEARSON Edition
2. Internetworking with TCP/IP Principles, Protocols, and Architecture by Dou-
glas E. Comer
3. Basic Electrical Engineering, By D. C. Kulshreshtha, McGraw Hill, Pub. Year
2009
4. Electrical and Electronics Technology, By E. Hughes Pearson, Pub. Year 2010

j. List of Practicals:

1. Experiments on Simulation Tools: (CISCO PACKET TRACER).

2. Experiments of Packet capture tool: Wireshark.
3. To study the behavior of generic devices used for networking: (CISCO PACKET
TRACER).
4. Data Link Layer (Error Correction).
5. Virtual LAN.
6. Wireless LAN.
7. Inter networking with routers: 1: Experiment on same subnet 2: Perform
Experiment across the subnet and observe functioning of Router via selecting
suitable pair of Source and destination.
8. Implementation of SUBNETTING.
9. Routing at Network Layer.
10. Experiment on Transport Layer.
 Semester 4 - 4
a. Course Name: Programming in Python with Full Stack Development

b. Course Code: 303105257

c. Prerequisite: Basic knowledge of Programming and web applications

d. Rationale: This course provides a broad introduction to Python programming and

development of web applications. Developing and using Python as a scripting lan-
guage for automating tasks and data processing. Moreover, building and deploying
web applications using popular Python frameworks such as Django and Flask.

e. Course Learning Objectives:

CLOBJ 1 Gain familiarity with the fundamental concepts of web development and
basic Python programming concepts.

CLOBJ 2 Gain knowledge to define functions in Python. Acquire knowledge of OOPS

concepts.

CLOBJ 3 Acquire knowledge of how to work with modules and packages in Python.

CLOBJ 4 Understand and use the Flask framework.

CLOBJ 5 Understand and use the Django framework.

CLOBJ 6 Study the use of RESTful APIs.

f. Course Learning Outcomes:

CLO 1 Understand the fundamental concepts of web development.

CLO 2 Create and manipulate data using a variety of databases, including SQL
and NoSQL.

CLO 3 Build and deploy web applications using a popular Python web framework,
such as Django or Flask.

CLO 4 Design and implement APIs (application programming interfaces) that en-
able different applications to communicate with each other.

CLO 5 Test and debug web applications, and deploy them to production environ-
ments.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 0 2 4 20 20 20 60 30 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT-I: Introduction to Python Programming 15% 6
Introduction to Python and basic programming concepts,
variables, data types, conditional statements and loops,
Lists, Sets, Tuples, Dictionaries: Working with strings,
lists, sets, tuples and dictionaries, including common op-
erations and built-in functions.
2 UNIT-II: Functions and OOPS Concepts 20% 5
Defining and using functions, including the use of ar-
guments and return values. OOPS Concepts: Object,
class, abstraction, encapsulation, polymorphism, Inheri-
tance. Exceptions and File handling: Handling exceptions
and working with files.
3 UNIT-III: Modules and Packages 15% 5
Working with modules and packages in Python. Introduc-
tion to popular Python libraries for specific tasks, such as
data analysis, web development, or game development.
PyCharm IDE: GIT- Git Integration with PyCharm IDE,
PyTests. Python connectivity with Databases MYSQL,
MongoDB CRUD operations.
4 UNIT-IV: Flask Framework 20% 10
Introduction to Flask and web development with Python,
Installation in Virtual Environment. Creation Routing
App Settings URL Building HTTP methods Templates
Working with Static, Media Files. Sending Form Data to
Template. Flask App with Database connectivity Sqlite3,
MySQL. Handling Exceptions and Errors Flash Message
Working with Mails. Authenticating and authorizing
users with Flask-Login, Deploying a Flask application to
a web server.
5 UNIT-V: Django Framework 20% 10
Introduction to Django framework, Django Project Instal-
lation in Virtual Environment. Phases in Django Project
Creation Create a Project. Creation of Apps and their
Structure. Working with ADMIN Console. Creating
Views URL Mapping. Template System Working with
Models. Form Processing static, media files, Django App
Deployment.
6 UNIT-VI: RESTful APIs 10% 6
Introduction to RESTful APIs and the REST architec-
tural style, Understanding the HTTP protocol and its role
in RESTful APIs, Designing and implementing REST-
ful APIs using common HTTP methods, such as GET,
POST, PUT, and DELETE, Using URLs and resource
representations to identify and transfer data in RESTful
APIs, Implementing best practices for designing and im-
plementing RESTful APIs, such as using HTTP status
codes, versioning, and error handling, Consuming REST-
ful APIs using common tools and libraries, such as cURL,
Postman, and the requests library in Python, Building
scalable and secure RESTful APIs using common frame-
works and libraries Flask or FastAPI.

i. Text Books and Reference Books:

1. Fluent Python, 2nd Edition by Luciano Ramalho (TextBook)

2. Learn Python3 the Hard Way By Zed Shaw
3. Django for Beginners: Build websites with Python and Django by William S.
Vincent.
4. Learning Django Web Development by Samuli Natri.
5. Flask Web Development with Python by Miguel Grinberg.
6. Mastering Flask by Jack Stouffer.
7. Building RESTful Python Web Services by Gastón C. Hillar.
8. Building Web APIs with FastAPI by Samuel Colvin.

j. List of Practicals:

1. Set-1
1. A program that converts temperatures from Fahrenheit to Celsius and
vice versa.
2. A program that calculates the area and perimeter of a rectangle.
3. A program that generates a random password of a specified length.
4. A program that calculates the average of a list of numbers.
5. A program that checks if a given year is a leap year.
 6. A program that calculates the factorial of a number.
7. A program that checks if a given string is a palindrome.
8. A program that sorts a list of numbers in ascending or descending order.
9. A program that generates a multiplication table for a given number.
10. A program that converts a given number from one base to another.
2. Set-2
1. A program that models a bank account, with classes for the account, the
customer, and the bank.
2. A program that simulates a school management system, with classes for
the students, the teachers, and the courses.
3. A program that reads a text file and counts the number of words in it.
4. A program that reads a CSV file and calculates the average of the values
in a specified column.
5. A program that reads an Excel file and prints the data in a tabular format.
3. Set-3
1. A program that creates a simple web server and serves a static HTML
page.
2. A program that creates a web application that allows users to register and
login.
3. A program that creates a web application that allows users to upload and
download files.
4. A program that creates a web application that displays data from a
database in a tabular format.
5. A program that creates a web application that accepts user input and
sends it to a server-side script for processing.
4. Set-4
1. A program that creates a web application that uses a template engine to
generate dynamic HTML pages.
2. A program that creates a web application that supports AJAX requests
and updates the page without reloading.
3. A program that creates a web application that uses Django’s built-in de-
bugging features to troubleshoot errors and exceptions.
4. A program that creates a web application that implements user authenti-
cation and authorization.
5. A program that creates a web application that integrates with third-party
APIs to provide additional functionality.
5. Set-5
1. A program that creates a simple RESTful API that returns a list of users
in JSON format.
2. A program that creates a RESTful API that allows users to create, read,
update, and delete resources.
3. A program that creates a RESTful API that authenticates users using a
JSON Web Token.
4. A program that creates a RESTful API that paginates the results of a
query to improve performance.
5. A program that creates a RESTful API that supports data validation and
error handling.
 Semester 4 - 5
a. Course Name: Competitive Coding

b. Course Code: 303105259

c. Prerequisite: Computer Programming and Basic Syntaxes

d. Rationale: Competitive coding enhances problem-solving abilities by exposing

individuals to a wide range of algorithmic challenges. It fosters critical thinking
and quick decision-making skills, crucial for real-world problem-solving in computer
science and software development. Engaging in competitive coding also promotes
continuous learning and improvement, as participants strive to optimize solutions
and compete against global coding communities.

e. Course Learning Objectives:

CLOBJ 1 Analyze and assess time complexity in algorithmic solutions, enabling the
ability to make informed judgments during problem-solving processes.

CLOBJ 2 Demonstrate proficiency in the application of various sorting algorithms,

employing them effectively to organize and manipulate data structures for
problem-solving purposes.

CLOBJ 3 Evaluate problem requirements and make informed decisions on selecting

the most suitable data structure to optimize solution efficiency and address
specific problem constraints.

CLOBJ 4 Employ diverse problem-solving techniques to effectively tackle a range of

challenges, showcasing adaptability and resourcefulness in approaching and
resolving different types of problems.

f. Course Learning Outcomes:

CLO 1 Judge time complexity rules during problem solving.

CLO 2 Apply sorting algorithms to data structures to solve problems.

CLO 3 Select the best data structure to solve the given problem.

CLO 4 Solve given problems using different Problem-Solving Techniques.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
T P CE Theory P

- - 4 2 - 20 - - 30 50

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. List of Practicals:

1. Write a program for implementing a MINSTACK which should support oper-

ations like push, pop, overflow, underflow, display.
i. Construct a stack of N-capacity
ii. Push elements
iii. Pop elements
iv. Top element
v. Retrieve the min element from the stack
2. Write a program to deal with real-world situations where Stack data structure
is widely used. Evaluation of expression: Stacks are used to evaluate expres-
sions, especially in languages that use postfix or prefix notation. Operators
and operands are pushed onto the stack, and operations are performed based
on the LIFO principle.
3. Write a program for finding the Next Greater Element (NGE) from an array.
4. Write a program to design a circular queue (k) which should implement the
following functions:
i. Enqueue
ii. Dequeue
iii. Front
iv. Rear
5. Write a program for an infix expression, and convert it to postfix notation. Use
a queue to implement the Shunting Yard Algorithm for expression conversion.
6. Write a program for finding the Product of the three largest Distinct Elements.
Use a Priority Queue to efficiently find and remove the largest elements.
7. Write a program to Merge two sorted linked lists.
8. Write a program to find the Merge point of two sorted linked lists.
9. Write a program to Swap Nodes pairwise in a linked list.
10. Write a program for building a function ISVALID to validate a Binary Search
Tree (BST).
 11. Write a program to Build a BST.
12. Write a program to determine the depth of a given Tree by implementing
MAXDEPTH.
13. Write a program to understand and implement Tree traversals, i.e., Pre-Order,
Post-Order, In-Order.
14. Write a program to perform Boundary Traversal on a BST.
15. Write a program for Lowest Common Ancestors (LCA) in a BST.
16. Write a program to verify and validate mirrored trees.
17. Write a program for a basic hash function in a programming language of your
choice. Demonstrate its usage to store and retrieve key-value pairs.
18. Implement a hash table using separate chaining for collision handling. Perform
operations like insertion, deletion, and search on the hash table.
19. Write a program to implement Two Sums using a HashMap.
20. Write a program to implement search, insert, and remove operations in a Trie.
21. Write a program to implement Huffman coding.
22. Write a program to find distinct substrings in a string.
23. Write a program to find the number of words in a Trie.
24. Write a program to view a tree from the left view.
25. Write a program to traverse a tree using Level Order Traversal.

i. Text Books:

1. Robert Sedgewick and Kevin Wayne, Algorithms, Part I and II, Addison-
Wesley.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
Introduction to Algorithms, MIT Press.
3. Steven S. Skiena, The Algorithm Design Manual, Springer.
4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Addison-
Wesley.
5. Sahni, A. and Horowitz, E., Fundamental Data Structures, McGraw-Hill.
 Semester 4 - 6
a. Course Name: Probability Statistics and Numerical Method

b. Course Code: 303191251

c. Prerequisite: Knowledge of Mathematics up to 12th science level

d. Rationale: The Mathematics I, Mathematics-II syllabus integrates fundamental

calculus concepts, advanced mathematical techniques, and vector calculus, prepar-
ing students for engineering challenges with optimized problem-solving skills.

e. Course Learning Objectives:

CLOBJ 1 Understand fundamental concepts of probability, probability spaces, condi-

tional probability, and Bayes’ Rule for making informed statistical decisions.

CLOBJ 2 Analyze discrete and continuous random variables, compute expectations

and variances, and explore key distributions such as Binomial, Poisson, and
Normal.

CLOBJ 3 Develop skills in hypothesis testing, including large sample tests for propor-
tions, means, standard deviations, and chi-square tests for goodness of fit
and independence.

CLOBJ 4 Demonstrate proficiency in numerical methods for solving linear equations,

finding roots of algebraic and transcendental equations using techniques like
Gauss-Jacobi, Gauss-Seidel, Bisection, Newton-Raphson, and Regula-Falsi.

CLOBJ 5 Master the concepts of finite differences, interpolation using Newton’s For-
ward and Backward Difference Formula, Newton’s Divided, and Lagrange’s
Formula for Unequal Intervals.

CLOBJ 6 Gain expertise in numerical integration techniques such as the Trapezoidal

rule, Simpson’s 1/3rd and 3/8th Rules, Gaussian Quadrature, and solve or-
dinary differential equations using methods like Taylor’s series, Euler, Mod-
ified Euler, and Runge-Kutta of the fourth order for first and second-order
equations.
 f. Course Learning Outcomes:

CLO 1 Demonstrate proficient problem-solving skills, translating real-world prob-

lems into mathematical formulations and applying appropriate techniques
for solutions.

CLO 2 Develop integrated analytical and critical thinking skills by engaging with
a wide range of mathematical structures, proofs, and problem-solving tech-
niques presented throughout the entire syllabus.

CLO 3 Understand and interpret mathematical solutions within the context of spe-
cific problems, recognizing the practical applications of discrete mathematics
in diverse fields covered in all units.

CLO 4 Communicate mathematical concepts and solutions clearly and effectively,

both in written and verbal forms, adapting communication styles to the
diverse topics covered in each unit.

CLO 5 Present mathematical arguments and solutions in a unified, logical, and

organized manner, emphasizing clarity, coherence, and precision across all
units.

CLO 6 Lay a solid foundation for more advanced courses in mathematics and re-
lated disciplines.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

4 - - 4 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination
h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 UNIT 1: Correlation, Regression and Curve Fit- 18% 8
ting
Correlation and Regression – Rank correlation, Curve Fit-
ting by The Method of Least Squares- Fitting of Straight
Lines, Second Degree Parabolas and More General Curves.
2 UNIT 2: Probability and Probability Distribu- 23% 10
tions
Probability Spaces, Conditional Probability, Bayes’ Rule,
Discrete and Continuous Random Variables, Indepen-
dent Random Variables, Expectation and Variance of Dis-
crete and Continuous Random Variables, Distribution and
Their Properties: Binomial Distribution, Poisson Distri-
bution, Normal Distribution.
3 UNIT 3: Testing of Hypothesis 25% 15
Test of significance: Large sample test for single propor-
tion, difference of proportions, single mean, difference of
means, and difference of standard deviations. Test for sin-
gle mean, difference of means, Test for ratio of variances,
Chi-square test for goodness of fit and independence of
attributes.
4 UNIT 4: Solution of a System of Linear Equations, 18% 10
Roots of Algebraic and Transcendental Equations
Gauss-Jacobi and Gauss-Seidel Methods, Solution of Poly-
nomial and Transcendental Equations: Bisection Method,
Newton-Raphson Method and Regula-Falsi Method.
5 UNIT 5: Finite Differences and Interpolation 10% 6
Finite Differences, Relation between Operators, Interpo-
lation using Newton’s Forward and Backward Difference
Formula. Newton’s Divided and Lagrange’s Formula for
Unequal Intervals.
6 UNIT 6: Numerical Integration 6% 2
Trapezoidal rule, Simpson’s 1/3rd and 3/8th Rules, Gaus-
sian Quadrature Formulae.

i. Text Books:

1. B. S. Grewal, “Numerical Methods in Engineering & Science with Programs

in C and C++”, Khanna Publishers.
2. C.E. Froberg, “Introduction to Numerical Analysis”, Addison-Wesley.
3. P. G. Hoel, S. C. Port and C. J. Stone, “Introduction to Probability Theory”,
Universal Book Stall, 2003 (Reprint).
4. S.C. Gupta and V. K. Kapoor, “Fundamentals of Mathematical Statistics”,
Sultan Chand & Sons
 Semester 4 - 7
a. Course Name: Professional Grooming & Personality Development

b. Course Code: 203193252

c. Prerequisite: Knowledge of English language in practical life

d. Rationale: Knowledge and application of English, Aptitude, and Management

Skills are crucial for better employability as well as professionalism.

e. Course Learning Objectives:

CLOBJ 1 Students will be able to demonstrate the ability to communicate clearly and
persuasively in oral presentations.

CLOBJ 2 Students will practice active listening techniques to enhance understanding

in professional interactions.

CLOBJ 3 Students will write professional emails, memos, and reports with clarity and
conciseness.

CLOBJ 4 Students will understand and practice time management strategies effec-
tively.

CLOBJ 5 Students will be able to demonstrate skills in resolving conflicts and nego-
tiating effectively.

CLOBJ 6 Students will use digital communication tools and platforms effectively.

f. Course Learning Outcomes:

CLO 1 Identify and develop soft skills required for personal and professional growth.

CLO 2 Develop professional etiquette & desired behavior at the workplace.

CLO 3 Speak and participate effectively in oral organizational communication.

CLO 4 Improve comprehensive skills for reading.

CLO 5 Know how to be assertive in a professional environment.

 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

0 1 0 1 0 100 0 0 0 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Self Development and Assessment: Various self- 25% 4
assessments for personal and professional development
skills that are relevant to career development:
Change, Grow, Persist, Prioritize, Read, Learn, Listen,
Record, Remember, Guess, Think, Communicate, Relate,
and Dream.
2 Corporate Etiquette: Tips and guide to develop per- 25% 4
sonality and gain various etiquettes manners, case studies,
and activities.
Telephone etiquette
Etiquette for foreign business trips
Etiquette for small talks
Respecting privacy
Learning to say ‘No’
3 Public Speaking: It’s process of communicating infor- 20% 4
mation to an audience and is helpful in career advance-
ment. Effective Public speaking skills includes:
Choosing appropriate pattern
Selecting appropriate method
Art of persuasion
Making speeches effective
Delivering different types of speeches
4 Reading Skills Activity & Reading Comprehen- 15% 2
sion: Aims to improve students’ comprehensive skills in
English Language by getting them involved in reading ac-
tivity and providing practice for reading comprehension.
5 Listening Skills- Inquiry Based Listening Ques- 15% 1
tions: Aims to improve students’ listening skills in En-
glish Language providing them practice of various types
of inquiry based listening tracks. Students will listen and
will be able to find out details from the conversations.

*Continuous Evaluation: It consists of Assignments/Seminars/Presentations/Quizzes/Surprise

Tests (Summative/MCQ) etc.

i. Reference Books:

1. Business Correspondence and Report Writing SHARMA, R. AND MOHAN,

K.
2. Communication Skills Kumar S and Lata P; New Delhi Oxford University
Press
3. Practical English Usage MICHAEL SWAN
4. A Remedial English Grammar for Foreign Student F.T. WOOD
 Semester 5-1
a. Course Name: Design and Analysis of Algorithm

b. Course Code: 303105218

c. Prerequisite: Data structures, Fundamentals of programming

d. Rationale: Analyze the asymptotic performance of algorithms. Write rigorous

correctness proofs for algorithms. Demonstrate a familiarity with major algorithms
and data structures. Apply important algorithmic design paradigms and methods
of analysis. Synthesize efficient algorithms in common engineering design situations.

e. Course Learning Objectives:

CLOBJ 1 Develop the ability to analyze the running time of any given algorithm using
asymptotic analysis and prove the correctness of basic algorithms.

CLOBJ 2 Design efficient algorithms for computational problems, using various algo-
rithm design techniques taught in the course.

CLOBJ 3 Explain the major graph algorithms and their analyses. Employ graphs to
model engineering problems, when appropriate.

CLOBJ 4 Analyze String matching algorithms.

CLOBJ 5 Explain the complexity classes P, NP, and NP-Complete, and demonstrate
the NP-Completeness of a specific problem.

f. Course Learning Outcomes:

CLO 1 Develop the ability to analyze the running time of any given algorithm using
asymptotic analysis and prove the correctness of basic algorithms.

CLO 2 Design efficient algorithms for computational problems, using various algo-
rithm design techniques taught in the course.

CLO 3 Explain the major graph algorithms and their analyses. Employ graphs to
model engineering problems, when appropriate.

CLO 4 Analyze String matching algorithms.

CLO 5 Explain the complexity classes P, NP, and NP-Complete, and demonstrate
the NP-Completeness of specific problems.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 4 5 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. (%) Hours
1 Introduction and Analysis of Algorithms: 20% 10
Algorithm: Definition, Properties, Types of Algorithms,
Writing an Algorithm, Analysis: Parameters, Design
Techniques of Algorithms
Asymptotic Analysis: Big Oh, Big Omega & Big Theta
Notations, Lower Bound, Upper Bound and Tight Bound,
Best Case, Worst Case, Average Case, Analyzing control
statement, Loop invariant and the correctness of the al-
gorithm, Recurrences-substitution method, recursion tree
method, master method. Sorting Techniques with analy-
sis: Bubble Sort, Selection Sort, Insertion Sort.
2 Divide & Conquer Algorithms: Structure of divide-and- 20% 6
conquer algorithms, Examples: Binary search, Quick sort,
Merge sort, Strassen’s Multiplication, Max-Min problem.
3 Greedy Algorithms: Introduction, Elements of Greedy 20% 8
Strategy, Minimum Spanning Tree: Kruskal’s & Prim’s
Algorithm, Dijkstra’s Algorithm, Knapsack Problem, Ac-
tivity Selection Problem, Huffman Codes.
4 Dynamic Programming: Principle of Optimality, 0/1 20% 8
Knapsack Problem, Making Change Problem, Chain Ma-
trix Multiplication, Longest Common Subsequence, All
Pair Shortest Paths: Warshall’s and Floyd’s Algorithms.
5 Exploring Graphs: An introduction using graphs and 5% 3
games, Undirected Graph, Directed Graph, Traversing
Graphs, Depth First Search, Breadth First Search, Topo-
logical Sort.
6 Backtracking and Branch & Bound: Introduction to Back- 5% 4
tracking, Introduction to Branch & Bound, 0/1 Knapsack
Problem, N-Queens Problem, Travelling Salesman Prob-
lem.
7 String Matching & NP Completeness: String Matching: 10% 6
Introduction to String Matching, Naive String Matching,
Rabin-Karp Algorithm, Kruth-Morris-Pratt Algorithm,
String Matching using Finite Automata. NP Complete-
ness: Introduction to NP Completeness, P Class Prob-
lems, NP Class Problems, Hamiltonian Cycle.

i. Reference Books:
1. ”Introduction to Algorithms, 4TH Edition” by Thomas H. Cormen, Charles
E. Leiserson, Ronald L. Rivest, and Clifford Stein, MIT Press/McGraw-Hill.
(TextBook)
2. ”Fundamentals of Algorithms” by E. Horowitz et al. (TextBook)
3. ”Algorithm Design, 1ST Edition” by Jon Kleinberg and Éva Tardos, Pearson.
4. ”Algorithm Design: Foundations, Analysis, and Internet Examples, Second
Edition” by Michael T. Goodrich and Roberto Tamassia, Wiley.
5. ”Algorithms—A Creative Approach, 3RD Edition” by Udi Manber, Addison-
Wesley, Reading, MA.
j. List of Practical:
1. Write a program to determine whether the given number is Prime or not.
2. Given a sorted array and a target value, return the index if the target is found.
If not, return the index where it would be if it were inserted in order.
3. There are N children standing in a line with some rating value. You want to
distribute a minimum number of candies to these children such that:
• Each child must have at least one candy.
• The children with higher ratings will have more candies than their neigh-
bours.
You need to write a program to calculate the minimum candies you must give.
4. There is a new barn with N stalls and C cows. The stalls are located on a
straight line at positions x1 , xN (0 ≤ xi ≤ 1, 000, 000, 000). We want to assign
the cows to the stalls, such that the minimum distance between any two of
them is as large as possible. What is the largest minimum distance?
5. Given an undirected graph with V vertices and E edges, check whether it
contains any cycle or not.
6. There are n servers numbered from 0 to n–1 connected by undirected server-to-
server connections forming a network where connections[i] = [ai , bi ] represents
a connection between servers ai and bi . Any server can reach other servers
directly or indirectly through the network. A critical connection is a connection
that, if removed, will make some servers unable to reach some other servers.
Return all critical connections in the network in any order.
7. Given a grid of size N × M (N is the number of rows and M is the number
of columns in the grid) consisting of ‘0’s (Water) and ‘1’s (Land). Find the
number of islands.
 8. Given a grid of dimension N × M where each cell in the grid can have values
0, 1, or 2 which has the following meaning:
• 0: Empty cell
• 1: Cells have fresh oranges
• 2: Cells have rotten oranges
We have to determine what is the minimum time required to rot all oranges.
A rotten orange at index [i, j] can rot other fresh oranges at indexes [i − 1, j],
[i + 1, j], [i, j − 1], [i, j + 1] (up, down, left and right) in unit time.
9. Given two strings str1 and str2 and below operations that can be performed
on str1. Find the minimum number of edits (operations) required to convert
‘str1’ into ‘str2’.
• Insert
• Remove
• Replace
All of the above operations are of equal cost.
10. The ”Minimum Path Sum” problem states that given an n × m grid consisting
of non-negative integers, we need to find a path from top-left to bottom-right,
which minimizes the sum of all numbers along the path.
11. Given string num representing a non-negative integer num, and an integer k,
return the smallest possible integer after removing k digits from num.
12. There is a robot on an m × n grid. The robot is initially located at the top-left
corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner
(i.e., grid[m − 1][n − 1]). The robot can only move either down or right at any
point in time. Given the two integers m and n, return the number of possible
unique paths that the robot can take to reach the bottom-right corner.
 Semester 5 - 2
a. Course Name: Artificial Intelligence

b. Course Code: 303105307

c. Prerequisite: Data structure, Formal Languages and automata Theory, Mathe-

matics

d. Rationale: This course provides a broad introduction to Artificial Intelligence.

AI techniques for search and knowledge representation also Apply knowledge of AI
planning and machine learning techniques to real-world problems.

e. Course Learning Objectives:

CLOBJ 1 Students will explore the foundational concepts of Artificial Intelligence,

including problem-solving, search strategies, knowledge representation, and
reasoning.

CLOBJ 2 Students will apply AI techniques such as machine learning, natural lan-
guage processing, and expert systems to solve real-world problems.

CLOBJ 3 Students will design intelligent agents capable of perceiving, reasoning, and
acting autonomously in dynamic environments.

CLOBJ 4 Students will evaluate and compare AI algorithms based on performance

metrics, ethical implications, and applicability to various domains.

f. Course Learning Outcomes:

CLO 1 . Discuss AI fundamentals, history, and future trends to develop solutions

for problem-solving, inference, perception, knowledge representation, and
learning tasks.

CLO 2 Utilize knowledge representation methods like propositional logic, predicate

logic, and frame notation to effectively represent knowledge within AI sys-
tems.

CLO 3 Discover methods for solving AI problems, including diverse search algo-
rithms and techniques like non-monotonic reasoning, probability theory,
Bayesian networks, and fuzzy logic for effective decision-making in uncer-
tain scenarios.

CLO 4 Apply Natural Language Processing (NLP), Neural Networks and Expert
Systems technologies effectively in real-world scenarios
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 - 2 4 20 20 20 60 30 150

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Introduction: Definition of an AI, Major Areas of Ar- Medicine), 25%
tificial Intelligence, AI Techniques, History, AI prob- AI Repre-
lems, Production Systems, Problem characteristics, In- sentation,
telligent Agents, Agent Architecture, AI Application (E- Properties
Commerce, of internal
represen-
tation,
Future
scope of
AI, Is-
sues in
the design
of search
algorithms.
Introduc-
tion to AI
Problems
and Ap-
plications,
Defining
Problems
as a State
Space
Search,
Problem
Charac-
teristics,
Production
Systems.
11
2 2 Search techniques: Generate-And-Test, Hill Climb- 25% 11
ing, Best-First Search, Problem Reduction, Constraint
Satisfaction, Means-Ends Analysis. Heuristic search, Hill
Climbing, Best first search, mean and end analysis, Con-
straint Satisfaction, A*, and AO* Algorithm, Knowl-
edge Representation: Basic concepts, Knowledge repre-
sentation Paradigms, Propositional Logic, Inference Rules
in Propositional Logic, Knowledge Representation using
Predicate Logic, Predicate Calculus, Predicate and argu-
ments, ISA hierarchy, Frame notation, Resolution, Natu-
ral Deduction
3 3 Knowledge Representation: Knowledge Represen- 20% 8
tation – Representation and Mappings, Different Ap-
proaches, Issues in knowledge representation. Predicate
Logic - Representation Simple Facts in Logic, Represent-
ing Instance and Isa Relationships, Computable Functions
and Predicates, Resolution. Propositional Logic: Rep-
resentation, Inference, Reasoning Patterns, Resolution,
First-order Logic: Representation, Inference, Reasoning
Patterns, Resolution
4 Uncertainty: Non-Monotonic Reasoning, Logics for 15% 6
Non-Monotonic Reasoning, Forward rules, and Backward
rules, Justification based Truth Maintenance Systems, Se-
mantic Nets Statistical Reasoning, Probability and Bayes’
theorem, Bayesian Network, Markov Networks, Hidden
Markov Model, Basis of Utility Theory, Utility Functions.
5 Fuzzy Sets and Fuzzy Logic: Fuzzy Set Opera- 15% 6
tions, Membership Functions, Fuzzy Logic, Hedges, Fuzzy
Proposition and Inference Rules, Fuzzy Systems
6 Natural Language Processing: Introduction, Syn- 15% 6
tactic Processing, Semantic Analysis, Semantic Analysis,
Discourse and Pragmatic Processing, Spell Checking.
Systems
7 Neural Networks and Expert systems: Introduc- 15% 6
tion to neural networks and perception-qualitative Anal-
ysis, Neural net architecture and applications, Utilization
and functionality, the architecture of the expert system,
knowledge representation, two case studies on expert sys-
tems
i. Text Books and Reference Books:

1. Artificial Intelligence: A New Synthesis, Harcourt Publishers (TextBook) By

N. J. Nilsson — Harcourt Publishers
2. Artificial Intelligence (TextBook) By Elaine Rich and Kevin Knight — TMH
3. Artificial Intelligence-Structures and Strategies For Complex Problem Solving
By George F. Luger — Pearson Education / PHI
4. Artificial Intelligence-A Modern Approach By Stewart Russell and Peter Norvig
— Pearson Education/ Prentice Hall of India — 2
5. Artificial Intelligence – A Practical Approach By Patterson — Tata McGraw
Hill — 3

j. List of Practicals:

1. Develop an AI-based medical diagnosis system using expert systems architec-

ture and knowledge representation techniques.
2. Build an intelligent agent for optimizing e-commerce inventory management
using search algorithms like hill climbing and best-first search.
3. Implement a constraint satisfaction algorithm to solve scheduling problems in
healthcare facilities
4. Create a recommendation system for personalized learning using means-end
analysis and heuristic search techniques.
5. Develop a problem-solving agent for optimizing resource allocation in logistics
using A* and AO* algorithms
6. Develop a fuzzy logic-based system for predicting stock market trends consid-
ering uncertain market conditions.
7. Write a program to implement BFS (Water Jug problem or any AI search
problem) 2: Write a program to implement DFS (Water Jug problem or any
AI search problem).
8. Define a predicate brother(X,Y) which holds iff X and Y are brothers. 2:
Define a predicate cousin(X,Y) which holds iff X and Y are cousins. 3:Define
a predicate grandson(X,Y) which holds iff X is a grandson of Y. 4:Define a
predicate descendent(X,Y) which holds iff X is a descendent of Y
Consider the following genealogical tree: father(a,b). father(a,c). father(b,d).
father(b,e). father(c,f). Say which answers, and in which order, are generated
by your definitions for the following queries in Prolog: ?- brother(X,Y). ?-
cousin(X,Y). ?- grandson(X,Y). ?- descendent(X,Y)
9. Write a program to implement Tic-Tac-Toe game using python.
10. Create a spell-checking application utilizing natural language processing (NLP)
techniques, including syntactic and semantic analysis.
11. Design a neural network architecture for pattern recognition in medical imag-
ing for disease diagnosis.
 Semester 5-3
a. Course: Professionalism & Corporate Ethics

b. Course Code: 303193304

c. Prerequisite: Knowledge of English language in practical life

d. Rationale: This course aims to provide students with a solid understanding of

ethics in engineering, professionalism, and corporate ethics. It will help students
develop communication skills, prepare for business school entrance exams, and im-
prove their ability to make ethical decisions in a professional setting.

e. Course Learning Objectives:

CLO 1 Understand the scope and significance of engineering ethics and profes-
sionalism.
CLO 2 Apply ethical decision-making skills in resolving dilemmas in profes-
sional settings.
CLO 3 Develop communication and listening skills essential for professional
environments.
CLO 4 Prepare for management entrance exams such as GMAT and CAT, and
improve verbal communication.
CLO 5 Learn to effectively prepare business documents, such as brochures and
minutes of meetings.

f. Course Outcome:

CO No. Course Outcome Description

CO 1 Identify and evaluate ethical issues in engineering and corporate sce-
narios.
CO 2 Communicate effectively in both written and oral forms in professional
settings.
CO 3 Analyze and solve ethical dilemmas in corporate contexts.
CO 4 Prepare and present professional documents and communications.
CO 5 Demonstrate critical thinking in analyzing case studies and real-world
scenarios.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

0 1 0 1 0 100 0 0 0 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. (%) Hours
1 Ethics in Engineering: Scope of engineering ethics, ac- 20% 5
cepting and sharing responsibility, resolving ethical dilem-
mas, case studies.
2 Group Discussion: Communication core, definition, 10% 3
types, process, guidelines, mock round-1.
3 Introduction to B-School Tests: Students will be able 15% 2
to solve verbal questions from the GMAT, CAT, and dis-
tinguish between national & international levels of Man-
agement exams.
4 Listening Skills - Advanced Level: Demonstrate abil- 10% 1
ity to listen to more than two minutes of audio clips and
solve questions based on it.
5 Preparing Brochures: Establishing the purpose of writ- 15% 2
ing and determining the audience for whom the brochure
is written.
6 Agenda & Minutes of Meeting: Explaining what an 10% 1
agenda and minutes of meeting are and their usefulness.
7 Reading Comprehension - Intermediate Level: 20% 8
Skim for main ideas, make use of contextual clues, and
solve related questions.
 Semester 5-4
a. Course: Quant and Reasoning

b. Course Code: 303105311

c. Prerequisite: Good fundamentals in calculations and ability to think logically.

d. Rationale: The course focuses on building core aptitude and reasoning skills.
These include analytical thinking, problem-solving, and logical decision-making
abilities—vital for engineers in real-world scenarios such as software development,
project analysis, and competitive assessments.

e. Course Learning Objectives:

CLO 1 Understand core mathematical concepts related to number systems, aver-

ages, ratios, and profit/loss.
CLO 2 Apply logical reasoning techniques to problems involving directions, seating
arrangements, syllogisms, clocks, and calendars.
CLO 3 Develop speed and accuracy in solving aptitude problems through practice
and structured approaches.
CLO 4 Solve real-world problems using quantitative methods like permutations,
combinations, and probability.
CLO 5 Prepare for competitive exams and placement tests by strengthening ana-
lytical and reasoning abilities.

f. Course Outcome:

CO 1 Apply logic and critical thinking skills to analyze information and draw
logical conclusions.
CO 2 Solve complex problems by breaking them into manageable parts and cre-
ating effective solutions.
CO 3 Demonstrate the ability to approach problem-solving from different perspec-
tives.
CO 4 Master foundational quantitative techniques for competitive and academic
aptitude tests.
CO 5 Evaluate and solve diverse analytical puzzles and reasoning scenarios confi-
dently.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

3 0 0 3 20 20 0 60 0 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination
h. Course Content:
Sr. Topics Weightage Teaching
No. (%) Hours
1 UNIT-1: 9% 4
Number system, LCM & HCF simplifications and approx-
imations
2 UNIT-2: 9% 4
Averages, progressions
3 UNIT-3: 12% 5
Ratio and proportion, Problems on Ages, Percentages
4 UNIT-4: 12% 5
Profit & loss, partnerships, S.I & C.I
5 UNIT-5: 18% 8
Time & work, pipes and cisterns, Time speed and dis-
tance, Problems on train crossings, Boats & streams
6 UNIT-6: 11% 5
Permutations & combinations, probability
7 UNIT-7: 4% 2
Directions, seating arrangements
8 UNIT-8: 6% 3
Clocks, calendars
9 UNIT-9: 9% 4
Cubes & Dice, syllogisms
10 UNIT-10: 5% 2
Blood Relations
11 UNIT-11: 5% 3
Series, Analogy, odd man out, coding and Decoding

i. Reference Books:
1. ”Quantitative Aptitude for CAT” by Arun Sharma (TextBook)
2. ”Logical Reasoning for CAT” by Arun Sharma
3. ”Quantitative Aptitude” by Abhijit Guha
 Semester 5-5
a. Course: AWS Fundamentals

b. Course Code: 303105301

c. Prerequisite: Basic understanding of computer concepts and basic programming

d. Rationale: This course provides a broad introduction to AWS cloud infrastructure,

services, security and compliance, as well as billing, pricing, and support plans.

e. Course Learning Objectives:

CLOBJ 1 Describe the architecture of AWS global infrastructure including Regions,

Availability Zones, and Edge Locations.
CLOBJ 2 Analyze the core AWS services in the areas of compute, storage, database,
application integration, and DevOps, and evaluate their application in de-
signing reliable and scalable cloud solutions.
CLOBJ 3 Analyze AWS security mechanisms including identity and access manage-
ment, encryption, and compliance frameworks, to assess their effectiveness
in maintaining secure and compliant cloud environments.
CLOBJ 4 Analyze AWS pricing strategies, support tiers, and budgeting tools to un-
derstand cost optimization in cloud environments.
CLOBJ 5 Apply knowledge of AWS SLAs, service lifecycle, and the Well-Architected
Framework to assess and design resilient, efficient, and secure cloud archi-
tectures.

f. Course Outcome:

CO 1 Describe the architecture of AWS global infrastructure including Regions,

Availability Zones, and Edge Locations.

CO 2 Analyze the core AWS services in the areas of compute, storage, database,
application integration, and DevOps, and evaluate their application in de-
signing reliable and scalable cloud solutions.

CO 3 Analyze AWS security mechanisms including identity and access manage-

ment, encryption, and compliance frameworks, to assess their effectiveness
in maintaining secure and compliant cloud environments.

CO 4 Analyze AWS pricing strategies, support tiers, and budgeting tools to un-
derstand cost optimization in cloud environments.

CO 5 Apply knowledge of AWS SLAs, service lifecycle, and the Well-Architected

Framework to assess and design resilient, efficient, and secure cloud archi-
tectures.
 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

2 0 0 2 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination

h. Course Content:
Sr. Topics Weightage Teaching
No. (%) Hours
1 Cloud Concepts: 15% 5
Introduction to Cloud Computing, Benefits of Cloud
Adoption, Cloud Deployment Models: Public Cloud, Pri-
vate Cloud, Hybrid Cloud, Cloud Service Models: Infras-
tructure as a Service (IaaS), Platform as a Service (PaaS),
Software as a Service (SaaS), AWS Global Infrastructure:
Regions, Availability Zones, and Edge Locations.
2 AWS Core Services: 20% 7
Compute Services: Amazon EC2 (Elastic Compute
Cloud), AWS Lambda (serverless), Auto Scaling and Elas-
tic Load Balancing, Storage Services: Amazon S3 (Sim-
ple Storage Service), Amazon EBS (Elastic Block Store),
Amazon EFS (Elastic File System), Database Services:
Amazon RDS (Relational Database Service), Amazon Dy-
namoDB (NoSQL), Amazon Aurora, Application Integra-
tion: Amazon SQS (Simple Queue Service), Amazon SNS
(Simple Notification Service), AWS Step Functions, De-
veloper Tools & DevOps: AWS CodeBuild, CodeDeploy,
CodePipeline.
3 Security, Privacy, Compliance, and Trust: 25% 7
Identity and Access Management (IAM): Users, Groups,
Roles, and Policies, Data Protection and Encryption:
AWS Key Management Service (KMS), AWS Certificate
Manager (ACM), Compliance Programs and Frameworks:
GDPR, HIPAA, SOC, ISO, etc., Shared Responsibility
Model, AWS Organizations & Service Control Policies
(SCPs).
4 AWS Pricing and Support: 15% 5
AWS Pricing Models: On-Demand, Reserved, and Spot
Instances, Free Tier Overview, Cost Management Tools:
AWS Pricing Calculator, AWS Cost Explorer, AWS Bud-
gets, Support Plans: Basic, Developer, Business, and En-
terprise Support, Billing Dashboard & Alerts.
5 AWS SLA and Service Lifecycle: 25% 6
AWS Service Level Agreements (SLAs): Uptime Guar-
antees for Key Services, AWS Well-Architected Frame-
work: Operational Excellence, Reliability, Performance
Efficiency, Cost Optimization, Security, AWS Service Life-
cycle: Preview, General Availability (GA), Deprecation,
Change Management: Communication around service up-
dates and maintenance via AWS Health Dashboard.

i. Reference Books:

1. ”AWS Basics: Beginners Guide” by Gordon Wong

2. ”A Hands-On Guide to the Fundamentals of AWS Cloud” by Mark Wilkins
3. ”Amazon Web Services in Action” by Andreas Wittig Michael Wittig
 Semester 5-6
a. Course Name: Enterprise Programming using Java

b. Course Code: 303105309

c. Prerequisite: Basic knowledge of software applications.

d. Rationale: This course introduces the fundamentals of enterprise-level program-

ming in Java. It covers database connectivity, server-side development, and modern
frameworks to build scalable web applications.

e. Course Learning Objectives:

CLOBJ 1 Understand JDBC and connect Java applications with Oracle and MySQL
databases.
CLOBJ 2 Learn servlet lifecycle and session management concepts.
CLOBJ 3 Perform CRUD operations using JSP, Hibernate, and Spring Boot.
CLOBJ 4 Develop modern Java-based web applications using the Spring Boot frame-
work.

f. Course Learning Outcomes:

CLO 1 Analyze and implement JDBC connectivity with Oracle and MySQL.

CLO 2 Use Servlet Configuration and Context effectively in Java web applications.

CLO 3 Apply CRUD operations using JSP and Hibernate for efficient data han-
dling.

CLO 4 Design and deploy web applications using Spring Boot.

g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE

Total
MSE CE P Theory P

2 0 0 2 20 20 - 60 - 100

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;

CE- Continuous Evaluation; ESE- End Semester Examination
h. Course Content:
Sr. Topics Weightage Teaching
No. Hours
1 Foundation of Enterprise Programming: JDBC, ar- 10% 3
chitecture, Oracle, MySQL, Maven integration
2 Servlets: Lifecycle, API, annotations, context, session 15% 4
tracking, CRUD operations
3 JSP: Scripting, directive elements, CRUD operations 15% 4
4 Hibernate (ORM): Architecture, JPA, transactions, 20% 6
annotations, CRUD operations
5 Spring: Architecture, modules, DI, autowiring, MVC, 20% 7
CRUD operations
6 Spring Boot: Web apps, DI, AOP, Spring REST 20% 6

i. Text Books:

1. Java Enterprise in a Nutshell – Jim Farley, William Crawford, David Flanagan

(TextBook)
2. Java EE 8 Design Patterns and Best Practices – Rhuan Rocha
3. Java EE and HTML5 Enterprise App Dev – John Brock, Arun Gupta, Geertjan
Wielenga
4. Java 8 Programming Black Book
 Semester 5 - 7
a. Course Name: Theory of Computation

b. Course Code: 303105306

c. Prerequisite: Calculus, Data Structures, and Algorithms

d. Rationale: Formal Language and Automata Theory helps in natural language

processing to solve problems on a model of computation using algorithms. It enables
learners to understand how machines can be made to simulate thinking.

e. Course Learning Objectives:

CLOBJ 1 Understand the fundamental concepts of formal languages, grammars, and

automata theory.

CLOBJ 2 Apply regular expressions, DFA, NFA, and their conversions to solve com-
putational problems.

CLOBJ 3 Solve computational problems using context-free grammar and pushdown

automata.

CLOBJ 4 Design Turing machines and understand their role in computation and lan-
guage recognition.

CLOBJ 5 Explore the concepts of decidability, undecidability, and computability

through Turing machines and formal proofs.

f. Course Learning Outcomes:

CLO 1 Recognize the basic concepts and applications of Theory of Computation.

CLO 2 Solve computational problems using regular languages and finite automata.

CLO 3 Solve computational problems using context-free grammar and pushdown

automata.

CLO 4 Design Turing machines for simple computational problems.

CLO 5 Analyze various concepts of undecidability and computable functions.

 g. Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C MSE CE P Theory P Total

3 - - 3 20 20 - 60 - 100

L - Lectures; T - Tutorial; P - Practical; C - Credit; MSE - Mid-Semester

Evaluation; CE - Continuous Evaluation; ESE - End Semester Examination

h. Course Content:
Sr. Content Weightage Teaching
No. Hours
1 Introduction: Alphabet, languages and grammars, pro- 5% 2
ductions and derivation, Chomsky hierarchy of languages
2 Regular languages and finite automata: Regular 30% 12
expressions and languages, deterministic finite automata
(DFA) and equivalence with regular expressions, Moore
machines and Mealy machines, conversion from Mealy to
Moore and vice versa, nondeterministic finite automata
(NFA) and equivalence with DFA, regular grammars and
equivalence with finite automata, properties of regular lan-
guages, pumping lemma for regular languages, minimiza-
tion of finite automata.
3 Grammars: Context-free grammars (CFG) and lan- 35% 15
guages (CFL), Chomsky normal forms, nondeterminis-
tic pushdown automata (PDA) and equivalence with
CFG, parse trees, ambiguity in CFG, pumping lemma for
context-free languages, deterministic pushdown automata,
closure properties of CFLs. Context-sensitive languages:
Context-sensitive grammars (CSG) and languages.
4 Turing machines: The basic model for Turing machines 25% 10
(TM), Turing-recognizable (recursively enumerable) and
Turing-decidable (recursive) languages and their closure
properties, variants of Turing machines, nondeterminis-
tic TMs and equivalence with deterministic TMs, unre-
stricted grammars and equivalence with Turing machines,
TMs as enumerators.
5 Undecidability: Church-Turing thesis, universal Turing 5% 6
machine, the universal and diagonalization languages.

i. Text Books and Reference Books:

1. Introduction to Automata Theory, Languages and Computation by John E.

Hopcroft, Rajiv Motwani, and Jeffrey D. Ullman – Pearson
2. Elements of the Theory of Computation by Harry R. Lewis and Christos H.
Papadimitriou – Pearson Education Asia
3. Introduction to the Theory of Computation by Michael Sipser – PWS Publish-
ing
4. Introduction to Languages and the Theory of Computation by John C. Martin
– McGraw Hill
5. Automata and Computability by Dexter C. Kozen – Undergraduate Texts in
Computer Science, Springer