COURSES SCHEME & SYLLABUS

B.E. (COMPUTER ENGINEERING)

 SEMESTER-I
S.N CODE TITLE L T P CR
O.
1 UMA003 MATHEMATICS-I 3 1 0 3.5
2. UTA007 COMPUTER PROGRAMMING-I 3 0 2 4.0
3. UCB008 APPLIED CHEMISTRY 3 1 2 4.5
4. UEC001 ELECTRONIC ENGINEERING 3 1 2 4.5
5. UES009 MECHANICS 2 1 2* 2.5
6. UEN002 ENERGY AND ENVIRONMENT 3 0 0 3.0
TOTAL 17 4 6 22.0

MECHANICS (2*): 2HOURS LAB ONCE IN SEMESTER

SEMESTER-II
S.N CODE TITLE L T P CR
O.
1. UMA004 MATHEMATICS-II 3 1 0 3.5
2. UTA009 COMPUTER PROGRAMMING-II 3 0 2 4.0
3. UPH004 APPLIED PHYSICS 3 1 2 4.5
4. UEE001 ELECTRICAL ENGINEERING 3 1 2 4.5
5. UHU003 PROFESSIONAL COMMUNICATION 2 0 2 3.0
6. UTA008 ENGINEERING DESIGN-I 2 4 0 4.0
TOTAL 16 7 8 23.5

SEMESTER-III
S.N CODE TITLE L T P CR
O.
1. UMA007 NUMERICAL ANALYSIS 3 1 2 4.5
2. UES012 ENGINEERING MATERIALS 3 1 2 4.5
3. UTA010 ENGINEERING DESIGN-II (6 SELF EFFORT
1 0 2 5.0
HOURS)
4. UCS405 DISCRETE MATHEMATICAL STRUCTURES 3 1 0 3.5
5. UCS303 OPERATING SYSTEMS 3 0 2 4.0
6. UCS520 COMPUTER NETWORKS 3 0 2 4.0
7. UCS310 DATABASE MANAGEMENT SYSTEM 3 0 2 4.0
TOTAL 19 3 12 29.5
 SEMESTER-IV
S.N CODE TITLE L T P CR
O.
1. UMA031 OPTIMIZATION TECHNIQUES 3 1 0 3.5
2. UES010 SOLIDS AND STRUCTURES 3 1 2 4.5
3. UES011 THERMO-FLUIDS 3 1 2 4.5
4. UTA002 MANUFACTURING PROCESSES 2 0 3 3.5
5. UCS406 DATA STRUCTURES & ALGORITHMS (4
3 0 2 6.0
SELF EFFORT HOURS)
6. UTA019 ENGINEERING DESIGN-III (6 SELF EFFORT 1 0 4 6.0
HOURS)
7. UCS407 INVENTIONS & INNOVATIONS IN
2 0 0 2.0
COMPUTING
TOTAL 17 3 13 30.0

SEMESTER-V
S.N CODE TITLE L T P CR
O.
1. UCS616 ADVANCED DATA STRUCTURES AND
3 0 2 4.0
ALGORITHMS
2. UCS503 SOFTWARE ENGINEERING 3 0 2 4.0
3. UCS507 COMPUTER ARCHITECTURE AND
3 0 2 4.0
ORGANIZATION
4. UCS701 THEORY OF COMPUTATION 3 1 0 3.5
5. UCS521 ARTIFICIAL INTELLIGENCE 3 1 0 3.5
6. UCS525 PROFESSIONAL PRACTICES #
0 1 2 1.5
7. ELECTIVE-I 3 0 2 4.0
TOTAL 18 3 10 24.5
#
THE COURSE WOULD CONSIST OF TALKS BY WORKING PROFESSIONALS FROM
INDUSTRY, GOVERNMENT, ACADEMIA AND RESEARCH ORGANISATION.

SEMESTER-VI
S.N CODE TITLE L T P CR
O.
1. UCS617 MICROPROCESSOR-BASED SYSTEMS
3 0 2 4.0
DESIGN
2. UCS614 EMBEDDED SYSTEMS DESIGN 3 0 2 4.0
3. UCS615 IMAGE PROCESSING 3 0 2 4.0
4. ELECTIVE-II 3 0 2 4.0
5. ELECTIVE-III 3 0 2 4.0
6. UTA012 INNOVATION AND ENTREPRENEURSHIP (5
1 0 2 4.5
SELF EFFORT HOURS)
7. UCS794 CAPSTONE PROJECT* (STARTS) SEH-6 0 0 2 -
TOTAL 16 0 14 24.5
*
DESIGN / FABRICATION / IMPLEMENTATION WORK UNDER THE GUIDANCE OF A
FACULTY MEMBER. PRIOR TO REGISTRATION, A DETAILED PLAN OF WORK
SHOULD BE SUBMITTED BY THE STUDENT TO THE COURSE COORDINATOR FOR
APPROVAL.

SEMESTER-VII
S.N CODE TITLE L T P CR
O.
1. UCS802 COMPILER CONSTRUCTION 3 0 2 4.0
2. ELECTIVE-IV 3 0 2 4.0
3. UCS781 INDEPENDENT STUDY 0 2 0 1.0
4. UHU005 HUMANITIES FOR ENGINEERS 2 0 2 3.0
5. UCS794 CAPSTONE PROJECT (14 SELF EFFORT
0 0 2 12.0
HOURS)
TOTAL 8 2 8 24.0

SEMESTER-VIII
S.N CODE TITLE L T P CR
O.
1. UCS895 PROJECT SEMESTER 20.0
OR
2. UCS897 START-UP SEMESTER 20.0
OR
3. UCS896 CAPSTONE PROJECT-II (20 SELF EFFORT
0 0 4 12.0
HOURS)
4. UCS801 SOFTWARE PROJECT MANAGEMENT 3 0 2 4.0
5. UCS806 ETHICAL HACKING 3 0 2 4.0
TOTAL 6 0 8 20.0
 LIST OF ELECTIVES

Based on choice of Elective Focus: High Performance Computing, Computer Animation and
Gaming, Machine Learning and Data Analytics, Information and Cyber Security, Software
Engineering

ELECTIVE-I

S.N CODE TITLE L T P CR

O.
1 UCS608 PARALLEL AND DISTRIBUTED
3 0 2 4.0
COMPUTING
2. UCS522 COMPUTER VISION 3 0 2 4.0
3. UML501 MACHINE LEARNING 3 0 2 4.0
4. UCS523 COMPUTER AND NETWORK SECURITY 3 0 2 4.0
5. UCS524 ENGINEERING SOFTWARE AS A SERVICE 3 0 2 4.0

ELECTIVE-II
S.N CODE TITLE L T P CR
O.
1 UCS631 GPU COMPUTING 3 0 2 4.0
2. UCS632 3D MODELLING AND ANIMATION 3 0 2 4.0
3. UCS633 DATA ANALYTICS AND VISUALIZATION 3 0 2 4.0
4. UCS634 SECURE CODING 3 0 2 4.0
5. USE401 SOFTWARE METRICS AND QUALITY
3 0 2 4.0
MANAGEMENT

ELECTIVE-III

S.N CODE TITLE L T P CR

O.
1 UCS641 CLOUD COMPUTING 3 0 2 4.0
2. UCS642 AUGMENTED AND VIRTUAL REALITY 3 0 2 4.0
3. UML602 NATURAL LANGUAGE PROCESSING 3 0 2 4.0
4. UCS643 CYBER FORENSICS 3 0 2 4.0
5. UCS644 SOFTWARE VERIFICATION AND
3 0 2 4.0
VALIDATION
ELECTIVE-IV

S.N CODE TITLE L T P CR

O.
1 UCS741 SIMULATION AND MODELLING 3 0 2 4.0
2. UCG731 GAME DESIGN AND DEVELOPMENT 3 0 2 4.0
3. UCS742 DEEP LEARNING 3 0 2 4.0
4. UCS743 ADVANCED COMPUTER NETWORKS 3 0 2 4.0
5. UCS709 ADVANCED TOPICS IN SOFTWARE
3 0 2 4.0
ENGINEERING
 Course Syllabi: UMA003 MATHEMATICS-I (L: T: P :: 3: 1: 0)

1. Course number and name: UMA003; MATHEMATICS-I

2. Credits and contact hours: Credits: 3.5; Hours: 4
3. Instructor’s or course coordinator’s name: Faculty from School of Mathematics
4. Text Books (author, title, publisher and year):
● Thomas B. G. and Finney L. R., Calculus and Analytic Geometry, Pearson Education
(2007) 9th ed.
● Stewart J., Essential Calculus, Thomson Publishers (2007)6th ed.
● Apostol M. T., Calculus, Vol I: One-Variable Calculus, with an introduction to Linear
Algebra, John Wiley (2003) 2nd ed.
● Apostol M. T., Calculus, Vol II: Multi Variable Calculus and Linear Algebra, with
applications to Differential Equations and Probability, John Wiley (2003) 2nd ed.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Course Objectives: To provide students with skills and knowledge in sequence and
series, advanced calculus and calculus of several variables which would enable them to
devise solutions for given situations they may encounter in their engineering profession.
Applications of Derivatives: Mean value theorems and their geometrical interpretation,
Cartesian graphing using first and second order derivatives, Asymptotes and dominant
terms, Graphing of polar curves, Applied minimum and maximum problems.
Sequences and Series: Introduction to sequences and Infinite series, Tests for
convergence/divergence, Limit comparison test, Ratio test, Root test, Cauchy integral
test, Alternating series, Absolute convergence and conditional convergence.
Series Expansions: Power series, Taylor series, Convergence of Taylor series, Error
estimates, Term by term differentiation and integration.
Partial Differentiation: Functions of several variables, Limits and continuity, Chain
rule, Change of variables, Partial differentiation of implicit functions, Directional
derivatives and its properties, Maxima and minima by using second order derivatives.
Multiple Integrals: Change of order of integration, Change of variables, Applications
of multiple integrals.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
 Required

6. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Apply the knowledge of calculus to plot graphs of functions and solve the problem
of maxima and minima.
● Determine the convergence/divergence of infinite series, approximation of
functions using power and Taylor’s series expansion and error estimation.
● Evaluate multiple integrals and their applications to engineering problems.
● Examine functions of several variables, define and computer partial derivatives,
directional derivatives and their use in finding maxima and minima.
● Analyze some mathematical problems encountered in engineering applications.
 Course Syllabi: UTA007 COMPUTER PROGRAMMING-I (L: T: P :: 3: 0: 2)

1. Course number and name: UTA007; COMPUTER PROGRAMMING-I

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Seema Bawa
4. Text Books (author, title, publisher and year):
 Schildt H., C++: The Complete Reference, Tata Mcgraw Hill (2003) 4th ed.
 Lippman B. S., Lajoie J., and Moo E. B., C++ Primer, Addison-Wesley Professional
(2013) 5th ed.

5. Reference book, title, author, and year

 Lafore R., Object-Oriented Programming in C++, Pearson Education (2002) 4th ed.
 Stroustrup B., The C++ programming language, Pearson Education India (2013) 4th
ed.

6. Specific course information

Introduction to ‘C++’ programming: Fundamentals, Structure of a C++ program,
Compilation and linking processes.
Expressions and Console I/O: Basic Data types, Identifier Names, Variables, Scope,
Type qualifiers, Storage class specifier, Constants, Operators, Reading and writing
characters, Reading and writing strings, Formatted and console I/O, cin(), cout(),
Suppressing input.
Statements: True and False, Selection statements, Iteration statements, Jump
statements, Expression statements, Block statements.
Arrays and Strings: Single dimension array, two-dimension array, Strings, Array of
strings, Multi-dimension array, Array initialization, Variable length arrays.
Structures, Unions, Enumerations, and Typedef: Structures, Array of structures,
passing structures to functions, Structure pointers, Arrays and structures within
structures, Unions, Bit-fields, Enumerations, typedef.
Introduction to Object Oriented Programming with C++: Objects and Classes,
basic concepts of OOPs (Abstraction, Encapsulation, Inheritance, Polymorphism),
Constructors/Destructor, Copy constructor, Dynamic Constructor, Overloading
(Function and Operator).
Pointers: Pointer variables, Pointer operators, Pointer expressions, Pointers and arrays,
multiple indirection, Pointer initialization, Pointers to arrays, dynamically allocated
arrays, Problems with pointers, Pointers and classes, pointer to an object, this pointer.
Functions: General form of a function, understanding scope of a function, Function
arguments, Command line arguments, Return statement, Recursion, Function
prototype, Pointers to functions, Friend function and class.
Pre-processor and Comments: Pre-processor, #define, #error, #include, Conditional
compilation directives, #undef, Single line and multiple line comments.
File I/O: Streams and files, File system basics, fread() and fwrite(), fseek() and random
access I/O, fprintf() and fscanf(), Standardstreams.
Laboratory Work:
 To implement Programs for various kinds of programming constructs in C++
Language.
a. prerequisites or co-requisites
● None
b. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of
instruction:
After the completion of the course the student will be able to:
● Comprehend the concepts of structures and classes: declaration, initialization and
implementation.
● Apply basics of object oriented programming, polymorphism and inheritance.
● Use the file operations, character I/O, string I/O, file pointers, pre-processor
directives and create/update basic data files.
● Write, compile and debug programs in C++language.
 Course Syllabi: UCB008 APPLIED CHEMISTRY (L: T: P :: 3: 1: 2)

1. Course number and name: UCB008; APPLIED CHEMISTRY

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: Faculty from School of Chemistry &
Biochemistry
4. Text Books (author, title, publisher and year):
● Ramesh S. and Vairam S., Engineering Chemistry, Wiley India (2012) 1st ed.
● Jain C. P. and Jain M., Engineering Chemistry, DhanpatRai Publishing Co. (2005)
15thed.
● Puri R.B., Sharma R. L. and Pathania S. M., Principles of Physical Chemistry, M.S.
Vishal Publishing Co. (2008).
● Brown S. L. and Holme A. T., Chemistry for engineering students, Cengagae Learning
(2009) 2nd ed.
● Shultz M.J.,Chemistry for Engineers, Cengage Learnings, (2007) 1sted.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Electrochemistry: Specific, equivalent and molar conductivity of electrolytic
solutions, Migration of ions, Transference number and its determination by Hittorf`s
method, Conductometric titrations, types of electrodes, concentration cells, Liquid
junction potential.
Phase Rule: States of matter, Phase, Component and Degree of freedom, Gibbs
phase rule, One component and two component systems.
Water Treatment and Analysis: Hardness and alkalinity of water: Units and
determination,External and internal method of softening of water: carbonate,
phosphate, calgon and colloidal conditioning, Lime-soda Process, Zeolite
process,Ion exchange process, mixed bed deionizer, Desalination of brackish water.
Fuels: Classification of fuels, Calorific value, Cetane and Octane number, fuel
quality, Comparison of solid liquid and gaseous fuels, properties of fuel, alternative
fuels: biofuels, power alcohol, synthetic petrol.
Chemistry of Polymers: Overview of polymers, types of polymerization, molecular
weight determination, tacticity of polymers, catalysis in polymerization, conducting,
biodegradable polymers and inorganic polymers.
Atomic spectroscopy: Introduction to atomic spectroscopy, atomic absorption
spectrophotometry and flame photometry.
Molecular Spectroscopy: Beer-Lambert`s Law, molecular spectroscopy, principle,
instrumentation and applications of UV-Vis and IR spectroscopy.
Laboratory Work:
Electrochemical measurements: Experiments involving use of pH meter,
conductivity meter, potentiometer.
Acid and Bases: Determination of mixture of bases.
Spectroscopic techniques: Colorimeter, UV-Vis spectrophotometer.
Water and its treatment: Determination of hardness, alkalinity, chloride,
 chromium, iron and copper in aqueous medium.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

6. Specific goals for the course:

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Determine ionic mobility, conductivity of electrolytes and application of
electrodes.
● Interpret phase diagram of one and two component systems.
● Determine water and fuel quality parameters.
● Analyse tacticity and determine the molecular weight of polymers.
● Analyse atomic/conjugated systems/functional groups using atomic/UV-
Vis/IR spectroscopic techniques.
● Carry out chemical analyses through volumetric and instrumental techniques.
 Course Syllabi: UEC001 ELECTRONIC ENGINEERING (L: T: P :: 3: 1: 2)

1. Course number and name: UEC001; ELECTRONIC ENGINEERING

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: Faculty from Department of Electronics &
Communication Engineering
4. Text Books (author, title, publisher and year):
● Mano M. M. and Ciletti D. M., Digital Design, Pearson Prentice Hall (2013) 5th ed.
● Milliman J., Halkias C.C. and Jit S., Electronic Devices and Circuits, Tata McGraw
Hill, 2007 (2015) 4th ed.
● Givone D. D., Digital Principles and Design, McGraw-Hill (2003) 1st ed.
● Wakerly F. J., Digital Design: Principles and Practices, Pearson (2006) 4th ed.
● Storey N., Electronics: A Systems Approach, Pearson, Prentice Hall (2009) 4th ed.
● Boylestad L. R. and Nashelsky L., Electronic Devices & Circuit Theory,Pearson(2009)
(2013) 11th ed.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Semiconductor Devices: p- n junction diode: Ideal diode, V-I characteristics of diode,
Diode small signal model, Diode switching characteristics, Zener diode
Electronics Devices and Circuits: PN Diode as a rectifier, Clipper and clamper,
Operation of Bipolar Junction Transistor and Transistor Biasing, CB, CE, CC
(Relationship between α, β, γ) circuit configuration Input-output characteristics,
Equivalent circuit of ideal and real amplifiers, Low frequency response of amplifiers,
Introduction to Field Effect Transistor and its characteristics
Operational Amplifier Circuits: The ideal operational amplifier, The inverting, non-
inverting amplifiers, Op-Amp Characteristics, Frequency response of op-amp,
Application of op-amp
Digital Systems and Binary Numbers: Introduction to Digital signals and systems,
Number systems, Positive and negative representation of numbers, Binary arithmetic,
Definitions and basic theorems of boolean Algebra, Algebraic simplification, Sum of
products and product of sums formulations (SOP and POS), Gate primitives, AND,
OR, NOT and Universal Gate, Minimization of logic functions, Karnaugh maps.
Combinational and Sequential Logic: Code converters, multiplexors, decoders,
Addition circuits and priority encoder, Master-slave and edge-triggered flip-flops,
Synchronous and Asynchronous counters, Registers
Logic families: N and P channel MOS transistors, CMOS inverter, NAND and NOR
gates, General CMOS Logic, TTL and CMOS logic families, and their interfacing
Laboratory Work: Familiarization of CRO and Electronic Components, Diodes
characteristics Input-Output and Switching characteristics, BJT and MOSFET
Characteristics, Zener diode as voltage regulator, Transistorized Series voltage
regulator. Half and Full wave Rectifiers with and without filter circuit, Half and full
adder circuit implementation, Decoder, DMUX and MUX, Binary/BCD up/down
counters.
b. prerequisites or co-requisites
● None
 c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

6. Specific goals for the course

a. specific outcomes of instruction :
After the completion of the course the student will be able to:
● Demonstrate the use of semiconductor diodes in various applications.
● Discuss and explain the working of transistors and operational amplifiers, their
configurations and applications.
● Recognize and apply the number systems and Boolean Algebra.
● Reduce Boolean Expressions and implement them with Logic Gates.
● Analyze, design and implement combinational and sequential circuits.
● Analyze and differentiate logic families, TTL and CMOS.
 Course Syllabi: UES009 MECHANICS (L: T: P :: 2: 1: 0)

1. Course number and name: UES009; MECHANICS

2. Credits and contact hours: Credits: 2.5; Hours: 3
3. Instructor’s or course coordinator’s name: Faculty from Department of Civil
Engineering
4. Text Books (author, title, publisher and year):
● ShamesH. I., Engineering Mechanics: Dynamics, Pearson Education India(1996) 4th
ed.
● Beer P. F., Johnston R. E. and Clausen E. W., Vector Mechanics for Engineers-
Dynamics, McGraw-Hill Higher Education(2004) 7th ed.
● Hibler C. R., Engineering Mechanics: Statics and Dynamics, Prentice Hall(2012) 11th
ed.
● Timoshenko S., Young H. D, Rao V. J. and Pati S., Engineering Mechanics, Tata
McGraw Hill Education Private Limited(2000).
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Equilibrium of bodies: Free-body diagrams, conditions of equilibrium, torque due to
a force, statistical determinacy.
Plane trusses: Forces in members of a truss by method of joints and method of
sections.
Friction: Sliding, belt, screw and rolling.
Properties of plane surfaces: First moment of area, centroid, second moment of area
etc.
Virtual work: Principle of virtual work, calculation of virtual displacement and virtual
work.
Work and energy: Work and energy, work-energy theorem, principle of conservation
of energy, collisions, principles of momentum etc.
Dynamics of Rigid Bodies: Newton’s Laws, D’Alembert’s Principle, Energy
Principles.
Experimental project assignment/ Micro project: Students in groups of 4/5 will do
project on Model Bridge Experiment: This will involve construction of a model bridge
using steel wire and wood.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required
6. Specific goals for the course
a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Determine resultants in plane force systems.
● Identify and quantify all forces associated with a static framework.
● Solve problems in kinematic and dynamic systems.
 Course Syllabi: UEN002 ENERGY AND ENVIRONMENT (L: T: P :: 3: 0: 0)

1. Course number and name: UEN002; ENERGY AND ENVIRONMENT

2. Credits and contact hours: Credits: 3; Hours: 3
3. Instructor’s or course coordinator’s name: Faculty from School of Energy and
Environment
4. Text Books (author, title, publisher and year):
● Bharucha E., Textbook for Environmental Studies, Universities Press (2005).
● Chapman L. J. and Reiss J. M., Ecology- Principles and Application, Cambridge
University Press (LPE)(1999) 2nd ed.
● Joseph B., Environmental Studies, Tata McGraw-Hill (2009) 2nd ed.
● Eastop D. T. and Croft R. D., Energy Efficiency for Engineers and Technologists,
Pearson Education (2006).
● Miller T. G., Environmental Science- Working with Earth, Thomson Learning (2006)
11th ed.
● Wright T. R. and Boorst F. D., Environmental Science-Towards a sustainable Future,
Pearson Prentice Hall (2017) 13thed.
● O’Callagan W. P., Energy Management, McGraw Hill Book Co. Ltd.(1993).
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Environment pollution, global warming and climate change: Air pollution
(local, regional and global); Water pollution problems; Land pollution and food
chain contaminations; Carbon cycle, greenhouse gases and global warming; Climate
change – causes and consequences; Carbon footprint; Management of greenhouse
gases at the source and at the sinks
Ecology, Structure and functioning of natural ecosystems: Ecology, ecosystems
and their structure, functioning and dynamics; Energy flow in ecosystems;
Biogeochemical cycles and climate; Population and communities
Natural resources: Human settlements and resource consumption; Biological,
mineral and energy resources; Land, water and air; Natural resources vis-à-vis
human resources and technological resources; Concept of sustainability;
Sustainable use of naturalresources
Agricultural, industrial systems and environment: Agricultural and industrial
systems vis-à-vis natural ecosystems; Agricultural systems, and environment and
natural resources; Industrial systems and environment
Energy technologies and environment: Electrical energy and steam energy; Fossil
fuels, hydropower and nuclear energy; Solar energy, wind energy and biofuels;
Wave, ocean thermal, tidal energy and ocean currents; Geothermal energy; Future
energy sources; Hydrogen fuels; Sustainable energy
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required
6. Specific goals for the course
a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Correlate major local and regional environmental issues with changes in ecology
and human health
● Monitor and document the development and dynamics of ecosystems in
experimental or natural microcosms
● Define and document local resource consumption patterns and conservation
strategies
● Define opportunities available for energy conservation and for use of renewable
energy resources in local and regional entities.
 Course Syllabi: UMA004 Mathematics-II (L: T: P :: 3: 1: 0)

1. Course number and name: UMA004; Mathematics-II

2. Credits and contact hours: Credits: 3.5; Hours: 4
3. Instructor’s or course coordinator’s name: Faculty from School of Mathematics
4. Text book (author, title, publisher, and year)
● Simmons F. G., Differential Equations: With Applications and Historical Notes,
CRC Press (2016) 3rd ed.
● Krishnamurthy V., Mainra P. V. and Arora L. J., An introduction to Linear
Algebra, Affiliated East West Press(1976).
● Kasana S. H., Complex Variables: Theory and Applications, Prentice Hall of
India (2005) 2nded.
● Kreyszig E., Advanced Engineering Mathematics, John Wiley (2011) 10thed.
● Babu R., Engineering Mathematics, Pearson Education (2009).
● Apostol M. T., Calculus, Vol I: One-Variable Calculus, with an introduction to
Linear Algebra, John Wiley (2003)1967 2nd ed.
● Apostol M. T., Calculus, Vol II: Multi Variable Calculus and Linear Algebra,
with applications to Differential Equations and Probability, John Wiley
(2003)1969 2nd ed.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Linear Algebra: Row reduced echelon form, Solution of system of linear equations,
Matrix inversion, Linear spaces, Subspaces, Basis and dimension, Linear
transformation and its matrix representation, Eigen-values, Eigen-vectors and
Diagonalisation, Inner product spaces and Gram-Schmidt orthogonalisation process.
Ordinary Differential Equations: Review of first order differential equations, Exact
differential equations, Second and higher order differential equations, Solution
techniques using one known solution, Cauchy - Euler equation, Method of
undetermined coefficients, Variation of parameters method, Engineering applications
of differential equations.
Laplace Transform: Definition and existence of Laplace transforms and its inverse,
Properties of the Laplace transforms, Unit step function, Impulse function,
Applications to solve initial and boundary value problems.
Fourier Series: Introduction, Fourier series on arbitrary intervals, Half range
expansions, Applications of Fourier series to solve wave equation and heat equation.
b. prerequisites or co-requisites
● Mathematics-I
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required
6. Specific goals for the course
a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Solve the differential equations of first and 2nd order and basic application
problems described by these equations.
● Find the Laplace transformations and inverse Laplace transformations for various
functions. Using the concept of Laplace transform students will be able to solve
the initial value and boundary value problems.
● Find the Fourier series expansions of periodic functions and subsequently will be
able to solve heat and wave equations.
● Solve systems of linear equations by using elementary row operations.
● Identify the vector spaces/subspaces and to compute their bases/orthonormal
bases. Further, students will be able to express linear transformation in terms of
matrix and find the Eigen values and Eigenvectors.
 Course Syllabi: UTA009 COMPUTER PROGRAMMING-II (L: T: P :: 3: 0: 2)

1. Course number and name:UTA009; COMPUTER PROGRAMMING-II

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Rajesh Kumar
4. Text book (author, title, publisher, and year)
● Deitel H. and Deitel P., JAVA - How to Program, Pearson Education (2018)11th ed.
● Hortsmann S. C., Cornell G., Core Java Volume I-Fundamentals, Prentice Hall (2012)
9th ed.
● Lafore R., Data Structures & Algorithms in Java, Pearson Education (2003) 2nd ed.
a. Other supplemental materials
● Nil.
5. Reference book, title, author, and year
● Schildt H., Java: A Beginner's Guide, McGraw-Hill Education (2018) 7thed.
● Eckel B., Thinking in Java, Pearson Education (2006)4thed.
a. Other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction to Java: History and evolution of Java, Java vs other popular languages,
Java programming environment, fundamental of Java programming language,
primitive data types and variables, floating point types, literals, variables, type
conversion and casting, arithmetic operators, bit wise operators, relational, Boolean
expressions, statements and blocks, control flow statements selection, iteration and
jump statements.
Object Oriented Programming Concepts in Java: Objects and classes, declaring
objects, constructors, this keyword, method overloading and constructor overloading,
nested classes.
Inheritance and Exception Handling: Defining, applying and implementing
interfaces; method overriding, super and final keywords, polymorphism, generics,
defining, finding and importing packages, exceptions handling with try, catch, throw,
throws and finally keywords, wrapper classes.
I/O and Threads: Binary I/O, file handling, thread model, creating a thread,
synchronization, inter thread communication, and thread lifecycle.
Data Structures in Java: Arrays, the use of classes to encapsulate data storage
structures and the class interface. Searching, insertion, and deletion in arrays and
ordered arrays.Linear searching and binary searching. Simple Sorting: the bubble sort,
selection sort, and insertion sort. Stacks and Queues: the stack, queue, and priority
queue. Linked Lists: linked lists, including doubly linked lists and double- ended lists.
Recursion: Towers of Hanoi puzzle and the merge sort.
Laboratory Work: Main focus is on implementing basic concepts of object oriented
programming and to enhance programming skills to solve specific problems.
b. prerequisites or co-requisites
● Computer Programming-I
 c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Comprehend the concepts of Object Oriented Computing in Java.
 Implement decision statements and looping statements.
 Grasp the concepts of input and output handling from console and files.
 Develop applications to demonstrate use of data structures.
 Course Syllabi: UPH004 APPLIED PHYSICS (L: T: P :: 3: 1: 2)

1. Course number and name:UPH004; APPLIED PHYSICS

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: Faculty from School of Physics and Material
Science
4. Text book (author, title, publisher, and year)
● BeiserA., Concept of Modern Physics, Tata McGraw Hill (2003) 6thed.
● Griffiths J. D., Introduction to Electrodynamics, Prentice Hall of India (1999) 3rded.
● Jenkins A. F. and White E. H., Fundamentals of Optics, McGraw Hill (2001) 4thed.
● WehrR. M., Richards A. J. and AdairW. T., Physics of The Atom, Narosa Publishing
House (1990) 4thed.
● Verma K. N., Physics for Engineers, Prentice Hall of India (2017) 2nd ed.
● Pedrotti L. F., Pedrotti S. L. and Pedrotti M. L., Introduction to Optics,Pearson
Education (2007) 3rded.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Oscillations and Waves: Oscillatory motion and damping, Applications -
Electromagnetic damping – eddy current; Acoustics: Reverberation time, absorption
coefficient, Sabine’s and Eyring’s formulae (Qualitative idea), Applications -
Designing of hall for speech, concert, and opera; Ultrasonics: Production and
Detection of Ultrasonic waves, Applications - green energy, sound signaling,
dispersion of fog, remote sensing, Car’s airbag sensor.
Electromagnetic Waves: Scalar and vector fields; Gradient, divergence, and curl;
Stokes’ and Green’s theorems; Concept of Displacement current; Maxwell’s equations;
Electromagnetic wave equations in free space and conducting media, Application -
skindepth.
Optics: Interference: Parallel and wedge-shape thin films, Newton rings, Applications
as Non- reflecting coatings, Measurement of wavelength and refractive index.
Diffraction: Single and Double slit diffraction, and Diffraction grating, Applications -
Dispersive and Resolving Powers. Polarization: Production, detection, Applications –
Anti-glare automobile headlights, Adjustable tint windows. Lasers: Basic concepts,
Laser properties,Ruby, HeNe, and Semiconductor lasers, Applications – Optical
communication and Optical alignment.
Quantum Mechanics: Wave function, Steady State Schrodinger wave equation,
Expectation value, Infinite potential well, Tunneling effect (Qualitative idea),
Application - Quantum computing.
Laboratory Work:
● Determination of damping effect on oscillatory motion due to various media.
● Determination of velocity of ultrasonic waves in liquids by stationary wave
method.
● Determination of wavelength of sodium light using Newton’s rings method.
● Determination of dispersive power of sodium-D lines using diffraction grating.
 ● Determination of specific rotation of cane sugar solution.
● Study and proof of Malus’ law in polarization.
● Determination of beam divergence and beam intensity of a given laser.
● Determination of displacement and conducting currents through a dielectric.
● Determination of Planck’s constant
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

6. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Understand damped and simple harmonic motion, the role of reverberation in
designinga hall and generation and detection of ultrasonicwaves.
● Use Maxwell’s equations to describe propagation of EM waves in amedium.
● Demonstrate interference, diffraction and polarization oflight.
● Explain the working principle ofLasers.
● Use the concept of wave function to find probability of a particle confined in abox.
 Course Syllabi: UEE001 ELECTRICAL ENGINEERING (L: T: P :: 3: 1: 2)

1. Course number and name:UEE001; ELECTRICAL ENGINEERING

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: From the Department of Electrical and
Instrumentation Engineering.
4. Text book (author, title, publisher, and year)
● Hughes E., Smith M. I., Hiley J. and Brown K., Electrical and Electronic
Technology, Pearson Prentice Hall(2008) 10th ed.
● Nagrath J. I. and Kothari P. D., Basic Electrical Engineering, Tata McGraw Hill
(2010) 3rd ed .
● Naidu S. M. and Kamashaiah, S., Introduction to Electrical Engineering, Tata
McGraw Hill(2007).
● Chakrabarti A., Nath S.and Chanda K. C., Basic Electrical Engineering, Tata
McGrawHill (2009).
● ToroD. V., Electrical Engineering Fundamentals, PrenticeHall of IndiaPrivate
Limited (2009) 2nd ed.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
DC Circuits: Kirchhoff’s voltage and current laws; power dissipation; Voltage source
and current source; Mesh and Nodal analysis; Star-delta transformation; Superposition
theorem; Thevenin’s theorem; Norton’s theorem; Maximum power transfer theorem;
Millman’s theorem and Reciprocity theorem; Transient response of series RL and RC
circuits.
Steady state analysis of DC Circuits: The ideal capacitor, permittivity; the multi-plate
capacitor, variable capacitor; capacitor charging and discharging, current-voltage
relationship, time-constant, rise-time, fall-time; inductor energisation and de-
energisation, inductance current-voltage relationship, time-constant; Transient response
of RL, RC and RLC Circuits.
AC Circuits: Sinusoidal sources, RC, RL and RLC circuits, Concept of Phasors, Phasor
representation of circuit elements, Complex notation representation, Single phase AC
Series and parallel circuits, power dissipation in AC circuits, power factor correction,
Resonance in series and parallel circuits, Balanced and unbalanced 3-phase circuit -
voltage, current and power relations, 3-phase power measurement, Comparison of single
phase and three phase supplysystems.
Electromagnetism: Electromagnetic induction, Dot convention, Equivalent
inductance, Analysis of Magnetic circuits, AC excitation of magnetic circuit, Iron
Losses, Fringing and stacking, applications: solenoids andrelays.
Single Phase Transformers: Constructional features of transformer, operating
principle and applications, equivalent circuit, Phasor analysis and calculation of
performance indices.
Motors and Generators: DC motor operating principle, construction, energy transfer,
speed- torque relationship, conversion efficiency, applications, DC generator operating
 principle, reversal of energy transfer, emf and speed relationship, applications.
Laboratory Work: Network laws and theorems, Measurement of R,L,C parameters,
A.C. series and parallel circuits, Measurement of power in 3 phase circuits, Reactance
calculation of variable reactance choke coil, open circuit and short circuit tests on single
phase transformer, Starting of rotating machines, Magnetization curve of DC generator.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

6. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Learn about applications of networks laws and theorems to solve electric circuits
● Represent AC quantities through Phasor and compute AC system behaviour during
steady state.
● Learn about principle, construction, characteristics and application of Electro-
Mechanical energy conversion devices.
 Course Syllabi: UHU003 Professional Communication (L: T: P :: 2: 0: 2)

1. Course number and name:UHU003; Professional Communication

2. Credits and contact hours: Credits: 3; Hours: 4
3. Instructor’s or course coordinator’s name: From School of Humanities and Social
Science
4. Text book (title, author, and year):
● LesikarV. R. and FlatelyM. E., Basic Business Communication Skills for the
Empowering the Internet Generation, Tata Mc Graw Hill, New Delhi(2006).
● Raman M& Sharma S.,Technical Communication Principles and Practice, Oxford
University Press, New Delhi (2015) 3rd ed.
● Mukherjee S. H.,Business Communication-Connecting at Work, Oxford University
Press, New Delhi (2013).
● Butterfield J.,Soft Skills for everyone,Cengage Learning NewDelhi (2011) 1st ed.
● Robbins P. S. and Hunsaker L. P.,Training in Interpersonal Skills,Pearson
Prentice Hallof India(2012) 6th ed.
● DiSanzaJ.andLeggeJ. N., Business and Professional Communication,Pearson
Education India(2012) 5th ed.
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Effective communication: Meaning, Barriers, Types of communication and
Essentials. Interpersonal Communication skills.
Effective Spoken Communication: Understanding essentials of spoken
communication, Public speaking, Discussion Techniques, Presentation strategies.
Effective Professional and Technical writing: Paragraph development, Forms of
writing, Abstraction and Summarization of a text; Technicalities of letter writing,
internal and external organizational communication. Technical reports, proposals and
papers.
Effective non verbal communication: Knowledge and adoption of the right non
verbal cues of body language, interpretation of the body language in professional
context. Understanding Proxemics and other forms of non verbal communication.
Communicating for Employment: Designing Effective Job Application letter and
resumes; Success strategies for Group discussions and Interviews.
Communication Networks in organizations: Types, barriers and overcoming the
barriers.
Laboratory Work:
● Needs-assessment of spoken and written communication and feedback.
● Training for Group Discussions through simulations and role plays.
● Training for effective presentations.
● Project based team presentations.
● Proposals and papers-review and suggestions.
 Minor Project (if any):
Team projects on technical report writing and presentations.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

6. Specific goals for the course

a. specific outcomes of instruction :
After the completion of the course the student will be able to:
● Understand and appreciate the need of communication training.
● Use different strategies of effective communication.
● Select the most appropriate mode of communication for a given situation.
● Speak assertively and effectively.
● Correspond effectively through different modes of written communication.
● Write effective reports, proposals and papers.
● Present himself/ herself professionally through effective resumes and interviews.
 Course Syllabi: UTA008 ENGINEERING DESIGN-I (L: T: P :: 2 : 4 : 0)

1. Course number and name:UTA008; ENGINEERING DESIGN-I

2. Credits and contact hours: Credits: 4.0; Hours: 6
3. Instructor’s or course coordinator’s name: From the Department of Mechanical
Engineering.
4. Text books (title, author, and year):
● Jolhe A.D., Engineering Drawing, Tata McGraw Hill,2008
● Davies L. B., Yarwood A. and Davis B., Engineering Drawing and Computer
Graphics, Van Nostrand Reinhold (UK),1986.

5. Reference Books (author, title, publisher and year)::

● Gill S. P., Geometrical Drawings, S.K. Kataria& Sons, Delhi (2008).
● Mohan R. K.., Engineering Graphics, Dhanpat Rai Publishing Company (P) Ltd,
Delhi (2002).
● French E. T. and Vierck J. C., Fundamental of Engineering Drawing & Graphics
Technology, McGraw Hill Book Company, New Delhi(1986).
● Rowan J. and Sidwell E. H., Graphics for Engineers, Edward Arnold, London (1968).
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Course Objectives: This module is dedicated to graphics and includes two sections:
manual drawing and AutoCAD. This course is aimed at to make the student understand
dimensioned projections, learn how to create two-dimensional images of objects using
first and third angle orthographic projection as well as isometric, perspective and
auxiliary projection, to interpret the meaning and intent of toleranced dimensions and
geometric tolerance symbolism and to create and edit drawings using drafting software
AutoCAD.
Engineering Drawing
1. Introduction
2. Orthographic Projection: First angle and third angle projectionsystem
3. IsometricProjections
4. AuxiliaryProjections
5. PerspectiveProjections
6. Introduction to MechanicalDrawing
7. Sketching engineeringobjects
8. Sections, dimensions andtolerances
AutoCAD
1. Management of screen menuscommands
2. Introduction to drawing entities
3. Co-ordinate systems: Cartesian, polar and relativecoordinates
4. Drawing limits, units of measurement andscale
5. Layering: organizing and maintaining the integrity ofdrawings
 6. Design of prototype drawings astemplates.
7. Editing/modifying drawing entities: selection of objects, object snap modes,
editing commands,
8. Dimensioning: use of annotations, dimension types, properties and placement,
adding text to drawing
Micro Projects /Assignments:
1. Completing the views - Identification and drawing of missing lines in the
projectionof objects
2. Missing views – using two views to draw the projection of the object in the
thirdview, primarily restricting to Elevation, Plan and Profileviews
3. Projects related to orthographic and isometricprojections
a. Using wax blocks or soap bars to develop three dimensional object from given
orthographicprojections
b. Using wax blocks or soap bars to develop three dimensional object, section it
and color thesection
c. Use of AUTOCAD as a complementary tool for drawing the projections ofthe
objects created in (1) and(2).
4. Develop the lateral surface of different objects involving individual or a
combinationof solids like Prism, Cone, Pyramid, Cylinder, Sphereetc.
5. To draw the detailed and assembly drawings of simple engineering objects/systems
with due sectioning (where ever required) along with bill of materials.e.g. Rivet
joints, simple bearing, wooden joints, Two plates connected with nut and bolt etc.
b. prerequisites or co-requisites
● Computer Programming-I
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction :
After the completion of the course the student will be able to:
● Creatively comprehend geometrical details of common engineering objects
● Draw dimensioned orthographic and isometric projections of simple engineering
objects.
● Interpret the meaning and intent of tolerance dimensions and geometric tolerance
symbolism.
● Create the engineering drawings for simple engineering objects using AutoCAD
● Manage screen menus and commands using AutoCAD.
● Operate data entry modes and define drawings geometrically in terms of
Cartesian, polar and relative coordinates in AutoCAD.
● Create and edit drawings making selections of objects, discriminating by layering
and using entities, object snap modes, editing commands, angles and displacements
using AutoCAD.
Course Syllabi: UMA007 NUMERICAL ANALYSIS (L: T: P :: 3: 1: 2)

1. Course number and name: UMA007; NUMERICAL ANALYSIS

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: Faculty from School of Mathematics
4. Text Books (author, title, publisher and year):
● Gerald F. C. and Wheatley O. P., Applied Numerical Analysis, Pearson, (2003)
7thEdition,
● Jain K. M., Iyengar K. R. S. and Jain K. R., Numerical Methods for Scientific and
Engineering Computation, New Age International Publishers (2012), 6thedition.
● Steven C. Chappra, Numerical Methods for Engineers, McGraw-Hill Higher
Education; 7thedition (1 March 2014)
● Mathew H. J., Numerical Methods for Mathematics, Science and Engineering, Prentice
Hall, (1992) 2ndedition,
● Burden L. R. and Faires D. J. Numerical Analysis, Brooks Cole (2011), 9thedition.
● Atkinson K. and Han H., Elementary Numerical Analysis, John Willey & Sons (2004),
3rdEdition
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Floating-Point Numbers: Floating-point representation, rounding, chopping, error
analysis, conditioning and stability.
Non-Linear Equations: Bisection, secant, fixed-point iteration, Newton method for
simple and multiple roots, their convergence analysis and order of convergence.
Linear Systems and Eigen-Values: Gauss elimination method using pivoting strategies,
LU decomposition, Gauss-Seidel and successive-over-relaxation (SOR) iteration methods
and their convergence, ill and well conditioned systems, Rayleigh's power method for
Eigen-values and Eigen-vectors.
Interpolation and Approximations: Finite differences, Newton’s forward andbackward
interpolation, Lagrange and Newton's divided difference interpolationformulas with error
analysis, least square approximations.
Numerical Integration: Newton-Cotes quadrature formulae (Trapezoidal and Simpson's
rules) and their error analysis, Gauss-Legendre quadrature formulae.
Differential Equations: Solution of initial value problems using Picard, Taylor series,
Euler's and Runge-Kutta methods (up to fourth-order), system of first-order differential
equations.
Laboratory Work: Lab experiments will be set in consonance with materials covered in
the theory. Implementation of numerical techniques using MATLAB.
b. prerequisites or co-requisites
● Mathematics-II
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in the
program
● Required
6. Specific goals for the course
a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Understand the errors, source of error and its effect on any numerical computations
and also analysis the efficiency of any numerical algorithms.
● Learn how to obtain numerical solution of nonlinear equations using bisection,
secant, newton, and fixed-point iteration methods.
● Solve system of linear equations numerically using direct and iterative methods.
● Understand how to approximate the functions using interpolating polynomials.
● Learn how to solve definite integrals and initial value problems numerically.
 Course Syllabi: UES012 ENGINEERING MATERIALS (L: T: P :: 3: 1: 2)

1. Course number and name: UES012; ENGINEERING MATERIALS

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: Faculty from School of Physics and
Material Science
4. Text Books (author, title, publisher and year):
● Callister D. W and Rethwisch G. D., Materials Science and Engineering; John Wiley
& Sons, Singapore (2013) 9th Edition.
● Smith F. W., Principles of Materials Science and Engineering: An Introduction; Tata
Mc-Graw Hill, (2008) 3rd Edition.
● Raghavan V., Introduction to Materials Science and Engineering, Prentice Hall (2015)
6th Edition.
a. other supplemental materials
 Nil.
5. Reference Book, title, author, and year
● Kasap S., Principles of Electronic Engineering Materials; Tata Mc-Graw Hill, 2007.
● Vlack V. H. L., Elements of Material Science and Engineering, Pearson, India, (1989)
6th Edition.
● Budinski G. K. and Budinski K. M., Engineering Materials – Properties and selection,
Prentince Hall India (2002) 7th Edition.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Structure of solids: Classification of engineering materials, Structure-property
relationship in engineering materials, Crystalline and non-crystalline materials, Miller
Indices, Crystal planes and directions, Determination of crystal structure using X-rays,
Inorganic solids, Silicate structures and their applications.Defects; Point, line and
surface defects.
Mechanical properties of materials: Elastic, Inelastic and Viscoelastic behaviour,
Engineering stress and engineering strain relationship, True stress - true strain
relationship, review of mechanical properties, Plastic deformation by twinning and slip,
Movement of dislocations, Critical shear stress, Strengthening mechanism and Creep.
Equilibrium diagram: Solids solutions and alloys, Gibbs phase rule, Unary and binary
eutecticphase diagram, Examples and applications of phase diagrams like Iron - Iron
carbide phase diagram.
Electrical and magnetic materials: Conducting and resistor materials, and their
engineering application; Semiconducting materials, their properties and applications;
Magnetic materials, Soft and hard magnetic materials and applications;
Superconductors; Dielectric materials, their properties and applications. Smart
materials: Sensors and actuators, piezoelectric, magnetostrictive and electrostrictive
materials.
 Corrosion process: Corrosion, Cause of corrosion, Types of corrosion, Protection
against corrosion.
Materials selection: Overview of properties of engineering materials, Selection of
materials for different engineering applications.
Laboratory Work and Micro-Project:
Note: The micro-project will be assigned to the group(s) of students at the beginning
of the semester. Based on the topic of the project the student will perform any of the
six experiments from the following list:
 To determine Curie temperature of a ferrite sample and to study temperature
dependence of permeability in the vicinity of Curie temperature.
 To study cooling curve of a binary alloy.
 Determination of the elastic modulus and ultimate strength of a given fiber
strand.
 To determine the dielectric constant of a PCB laminate.
 Detection of flaws using ultrasonic flaw detector (UFD).
 To determine fiber and void fraction of a glass fiber reinforced composite
specimen.
 To investigate creep of a given wire at room temperature.
 To estimate the Hall coefficient, carrier concentration and mobility in a
semiconductor crystal.
 To estimate the band-gap energy of a semiconductor using four probe
technique.
 To measure grain size and study the effect of grain size on hardness of the given
metallic specimens.

b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Classify engineering materials based on its structure.
● Draw crystallographic planes and directions.
● Distinguish between elastic and plastic behavior of materials.
● Distinguish between isomorphous and eutectic phase diagram.
● Classify materials based on their electrical and magnetic properties.
● Propose a solution to prevent corrosion.
 Course Syllabi: UTA010 ENGINEERING DESIGN-II (L: T: P :: 1: 0: 2)

1. Course number and name: UTA010; ENGINEERING DESIGN-II

2. Credits and contact hours: Credits: 5; Hours:3
3. Instructor’s or course coordinator’s name: Faculty from Department of Mechanical
Engineering and Electronics & Communication Engineering
4. Text Books (author, title, publisher and year):
● McRoberts M., Beginning Arduino, APress (2013) 2nd Edition.
● Smith G. A., Introduction to Arduino: a piece of cake, CreateSpace Independent
Publishing Platform (2011).
a. other supplemental materials
● Nil.

5. Specific course information

a. brief description of the content of the course (catalog description)
Course Objectives: To develop design skills according to a Conceive-Design-
Implement-Operate (CDIO) compliant methodology. To apply engineering sciences
through learning bydoing project work. To provide a framework to encourage creativity
and innovation.To develop team work and communication skills through group-based
activity.To foster self-directed learning and critical evaluation.
To provide a basis for the technical aspects of the project a small number of lectures
are incorporated into the module. As the students would have received little in the way
of formal engineering instruction at this early stage in the degree course, the level of
the lectures is to be introductory with an emphasis on the physical aspects of the subject
matter as applied to the ‘Mangonel’ project. The lecture series include subject areas
such as Materials, Structures, Dynamics and Digital Electronics delivered by experts
in the field.
This module is delivered using a combination of introductory lectures and participation
by the students in 15 “activities”. The activities are executed to support the syllabus of
the course and might take place in specialised laboratories or on the open ground used
for firing the Mangonel. Students work in groups throughout the semester to encourage
teamwork, cooperation and to avail of the different skills of its members. In the end the
students work in sub-groups to do the Mangonel throwing arm redesign project. They
assemble and operate a Mangonel, based on the lectures and tutorials assignments of
mechanical engineering they experiment with the working, critically analyse the effect
of design changes and implement the final project in a competition. Presentation of the
group assembly, redesign and individualreflection of the project is assessed in the end.

Breakup of lecture details to be taken up by MED:

Lec No. Topic Contents

Lec 1 Introduction The Mangonel Project. History. Spreadsheet.

Lec 2 PROJECTILE no DRAG, Design spread sheet simulator for it.

 MOTION

Lec 3 PROJECTILE with DRAG, Design spread sheet simulator for it.

MOTION

Lec 4 STRUCTURES STATIC LOADS

FAILURE

Lec 5 STRUCTURES DYNAMIC LOADS

FAILURE

Lec 6 REDESIGNING Design constraints and limitations of materials

THEMANGONEL forredesigning the Mangonel for competition as
a group.

Lec 7 MANUFACTURING Manufacturing and assembling the Mangonel.

Lec 8 SIMULATION IN Simulation as an Analysis Tool in Engineering

sDesign.
ENGINEERING

DESIGN

Lec 9 ROLE OF The Role of Modelling in Engineering Design.

MODELLING&

PROTOTYPING

Breakup of lecture details to be taken up by ECED:

Lec No. Topic Contents

Lec 1-5 Digital Prototype, Architecture, Using the Integrated Development

Electroni Environment (IDE) to Prepare an Arduino Sketch, structuring

cs anArduino Program, Using Simple Primitive Types
(Variables),Simple programming examples. Definition of a
sensor and

actuator.
 Tutorial Assignment / Laboratory Work:
Associated Laboratory/Project Program: T- Mechanical Tutorial, L- Electronics
Laboratory, W- Mechanical Workshop of “Mangonel” assembly, redesign,
operation and reflection.
Title for the weekly work in 15 weeks Code

Using a spread sheet to develop a simulator T1

Dynamics of projectile launched by a Mangonel - No Drag T2

Dynamics of projectile launched by a Mangonel - With Drag T3

Design against failure under static actions T4

Design against failure under dynamic actions T5

Electronics hardware and Arduino controller L1

Electronics hardware and Arduino controller L2

Programming the Arduino Controller L3

Programming the Arduino Controller L4

Final project of sensors, electronics hardware and programmed L5

Arduinocontroller based measurement of angular velocity of the
“Mangonel” throwingarm.

Assembly of the Mangonel by group W1

Assembly of the Mangonel by group W2

Innovative redesign of the Mangonel and its testing by group W3

Innovative redesign of the Mangonel and its testing by group W4

Final inter group competition to assess best redesign and W5

understanding of the “Mangonel”.

b. prerequisites or co-requisites
● Electronic Engineering
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

6. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Simulate trajectories of a mass with and without aerodynamic drag using a
spreadsheetbased software tool to allow trajectories be optimized.
 Perform a test to acquire an engineering material property of strength in bending
andanalyze the throwing arm of the “Mangonel” under conditions of static and
dynamic loading.
 Develop and test software code to process sensor data.
 Design, construct and test an electronic hardware solution to process sensor data.
 Construct and operate a Roman catapult “Mangonel” using tools, materials
andassembly instructions, in a group, for a competition.
 Operate and evaluate the innovative redesign of elements of the “Mangonel”
forfunctional and structural performance
Course Syllabi: UCS405 DISCRETE MATHEMATICAL STRUCTURES (L: T:P::3: 1: 0)

1. Course number and name:UCS405; DISCRETE MATHEMATICAL STRUCTURES

2. Credits and contact hours: Credits: 3.5; Hours: 4
3. Instructor’s or course coordinator’s name: Ms. Rajanpreet Chahal
4. Text book (author, title, publisher, and year)
● RosenH. K., Discrete Mathematics and its Applications, McGraw Hill (2011) 7thed.
● Tremblay P. J. and Manohar, R., Discrete Mathematical Structures with Applications
to Computer Science, Tata McGraw Hill (2008).
b. other supplemental materials
● Nil.

5. Reference Book (author, title, publisher and year):

● Gallian A. J., Contemporary Abstract Algebra, Cengage Learning (2017) 9th ed.
● Lipschutz S., Lipson M., Discrete Mathematics, McGraw-Hill (2007) 3rded.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Sets, Relations, and Functions: Sets: Operations on set, Inclusion-exclusion principle,
Representation of Discrete Structures, Fuzzy set, Multi-set, bijective function, Inverse
and Composition of functions, Floor and Ceiling functions, Growth of functions: Big-
O notation, Big-Omega and Big-Theta Notations, Determining complexity of a
program, Hashing functions, Recursive function, Functions applications.
Relations: Reflexivity, symmetry, transitivity, Equivalence and partial-ordered
relations, Asymmetric, Irreflexive relation, Inverse and complementary relations,
Partition and Covering of a set, N-ary relations and database, Representation relation
using matrices and digraph, Closure of relations, Warshall’s algorithm, Lexicographic
ordering, Hasse diagram, Lattices, Boolean algebra, Application of transitive closure
in medicine and engineering. Application: Embedding a partial order.
Graphs Theory: Representation, Type of Graphs, Paths and Circuits: Euler Graphs,
Hamiltonian Paths & Circuits; Cut-sets, Connectivity and Separability, Planar Graphs,
Isomorphism, Graph Coloring, Covering and Partitioning, Max flow: Ford-Fulkerson
algorithm, Application of Graph theory in real-life applications.
Basic Logic: Propositional logic, Logical connectives, Truth tables, Normal forms
(conjunctive and disjunctive), Validity of well-formed formula, Propositional inference
rules (concepts of modus ponens and modus tollens), Predicate logic, Universal and
existential quantification.
Proof Techniques and counting: Notions of implication, equivalence, converse,
inverse, contra positive, negation, and contradiction, The structure of mathematical
proofs, Direct proofs, Disproving by counter example, Proof by contradiction,
Induction over natural numbers, Structural induction, Weak and strong induction, The
pigeonhole principle, Solving homogenous and heterogeneous recurrence relations.
 Algebraic Structures: Group, Semi group, Monoids, Homomorphism, Congruencies,
Ring, Field, Homomorphism, Congruencies, Applications of algebra to control
structure of a program, the application of Residue Arithmetic to Computers.
b. prerequisites or co-requisites.
● Mathematics-II
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program.
● Required

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Perform operations on various discrete structures such as set, function and relation.
● Apply basic concepts of asymptotic notation in analysis of algorithm.
● Illustrate the basic properties and algorithms of graphs and apply them in modeling
and solving real-world problems.
● Comprehend formal logical arguments and translate statements from a natural
language into its symbolic structures in logic.
● Identify and prove various properties of rings, fields and group.
 Course Syllabi: UCS303 OPERATING SYSTEMS (L: T: P :: 3: 0: 2)

1. Course number and name:UCS303; OPERATING SYSTEMS

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Vinay Arora
4. Text book (author, title, publisher, and year)
 Silberschatz A., Galvin B. P. and Gagne G., Operating System Concepts, John Wiley
& Sons Inc (2013) 9th ed.
 Stallings W., Operating Systems Internals and Design Principles, Prentice Hall (2018)
9th ed.
5. Reference Books (author, title, publisher and year)::
● Bovet P. D., Cesati M., Understanding the Linux Kernel, O'Reilly Media (2006), 3rd ed.
● Kifer M., Smolka A. S., Introduction to Operating System Design and Implementation:
The OSP 2 Approach, Springer (2007).

6. Specific course information

a. brief description of the content of the course (catalog description)
Operating System Principles: Structuring methods (monolithic, layered, modular,
microkernel models), processes, and resources, Concepts of APIs, Device organization,
interrupts: methods and implementations, Concept of user/system state and protection,
transition to kernel mode.
Concurrency: Implementing synchronization primitives, Multiprocessor issues (spin
locks, reentrancy).
Scheduling and Dispatch: Dispatching and context switching, Preemptive and non-
preemptive scheduling, Schedulers and policies, Processes and threads.
Memory Management: Review of physical memory and memory management
hardware, Working sets and thrashing, Caching, Paging and virtual memory, Virtual
file systems.
File Systems: Files: data, metadata, operations, organization, buffering, sequential,
non-sequential, Directories: contents and structure, Naming, searching, access,
backups, Journaling and log-structured file systems.
Deadlock: Introduction, Analysis of conditions, Prevention & avoidance, Detection &
recovery.
Security and Protection: Overview of system security, Security methods and devices,
Protection, access control, and authentication.
Virtual Machines: Types of virtualization (including Hardware/Software, OS, Server,
Service, Network).
Device Management: Characteristics of serial and parallel devices, Buffering
strategies, Direct memory access, Disk structure, Disk scheduling algorithms.

Laboratory work: To explore different operating systems like Linux, Windows etc.
To implement main algorithms related to key concepts in the operating systems.
 Detailed architecture of Linux commands and flow of command execution.
 Detailed commands related to basics of Linux, file handling, process
management.
  Shell program having sequential, decision and loop control constructs.
 CPU Scheduling Algorithms
 Threaded programming in Linux (Eg. POSIX threads in LINUX)
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program.
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Explain basic operating system concepts such as overall architecture, interrupts,
APIs, user mode and kernel mode.
● Explication of the concepts related to concurrency including, synchronization
primitives, race conditions, critical sections and multi-threading.
● Analyze and apply CPU scheduling algorithms, deadlock detection and prevention
algorithms.
● Explicate various memory management techniques like caching, paging,
segmentation, virtual memory, and thrashing.
● Untangle operating systems concepts such as file systems, security, protection,
virtualization and device-management, disk-scheduling algorithms and various file
systems.
 Course Syllabi: UCS520 COMPUTER NETWORKS (L: T: P :: 3: 0: 2)

1. Course number and name:UCS520;COMPUTER NETWORKS

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Sharad Saxena
4. Text book (author, title, publisher, and year)
 Forouzan A. B., Data communication and Networking, McGraw Hill (2012) 5thed.
 Tanenbaum S. A. and Wetherall J. D.,Computer Networks, Prentice Hall (2013)5thed.
5. Reference Books (author, title, publisher and year)
 Kurose J. and Ross K., Computer Networking: A Top Down Approach, Perason (2017)
7thed.
 Stallings W., Computer Networking with Internet Protocols and Technology, Pearson
(2004).

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Organization of the Internet, ISP, Network criteria, Categories of
networks, Network performance and Transmission Impairments. Network Devices,
OSI Model, TCP/IP Protocol Suite, Layering principles, Line Encoding, Switching
technique and Multiplexing.
Local Area Networks: LAN topologies: Bus topology, Ring topology, Token passing
rings, FDDI, Star topologies, Asynchronous transfer mode, Ethernet, IEEE standards
802.3, 802.5. Wireless LANs: IEEE 802.11 and Bluetooth, introduction to Virtual
circuit switching including frame relay, X.25, and ATM.
Reliable Data Delivery: Error control (retransmission techniques, timers), Flow
control (Acknowledgements, sliding window), Multiple Access, Performance issues
(pipelining).
Routing and Forwarding: Routing versus forwarding, Static and dynamic routing,
Unicast and Multicast Routing. Distance-Vector, Link-State, Shortest path
computation, Dijkstra's algorithm, Network Layer Protocols (IP, ICMP), IP addressing,
IPV6, Address binding with ARP, Scalability issues (hierarchical addressing).
Process-to-Process Delivery: UDP, TCP and SCTP, Multiplexing with TCP and UDP,
Principles of congestion control, Approaches to Congestion control, Quality of service,
Flow characteristics, Techniques to improve QoS.
Network Applications: Naming and address schemes (DNS, IP addresses, Uniform
Resource Identifiers, etc.), Distributed applications (client/server, peer-to-peer, cloud,
etc.), HTTP as an application layer protocol, Electronic mail, File transfer, Remote
login.
Laboratory work: To design conceptual networks using E-Draw, Visual Studio etc.
and to implement topologies BUS, RING, STAR, Mesh and configuring Router using
Packet tracer or GNS3 platform.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program.
 ● Required

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
 Conceptualise and explain the functionality of the different layers within
a network architecture
 Analyze the requirements for a given organizational structure and select the
most appropriate networking architecture and technologies, subnetting and
routing mechanism.
 Demonstrate the operation of various routing protocols and their performance
analysis.
 Illustrate design and implementation of data link, transport and network layer
protocols within a simulated/real networking environment.
Course Syllabi: UCS310 DATABASE MANAGEMENT SYSTEM (L: T: P :: 3: 0: 2)

1. Course number and name:UCS310;DATABASE MANAGEMENT SYSTEM

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Parteek Kumar
4. Text books (title, author, and year):
● Silverschatz A., Korth F. H. and Sudarshan S., Database System Concepts, Tata
McGraw Hill (2010) 6th ed.
● Elmasri R. and Navathe B. S., Fundamentals of Database Systems, Pearson (2016) 7th
ed.
a. other supplemental materials
● Nil.
5. Reference Books (author, title, publisher and year):
 Bayross I., SQL, PL/SQL the Programming Language of Oracle, BPB Publications
(2009) 4th ed.
 HofferJ., Venkataraman, R. and Topi, H., Modern Database Management, Pearson
(2016) 12thed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Data, data processing requirement, desirable characteristics of an ideal
data processing system, traditional file based system, its drawback, concept of data
dependency, Definition of database, database management system, 3-schema
architecture, database terminology, benefits of DBMS, Database development process
- conceptual data modeling, logical database design, physical database design, database
implementation, database maintenance.
Database Analysis: Conceptual data modeling using E-R data model -entities,
attributes, relationships, generalization, specialization, specifying constraints. 5 – 6
practical problems based on E-R data model.
Relational Database: Relational data model: Introduction to relational database
theory: definition of relation, relational model integrity rules, relational algebra and
relational calculus.
Relational Database Design: Normalization- 1NF, 2NF, 3NF, BCNF, 4NF and 5NF.
Concept of De-normalization and practical problems based on these forms.
Indexing of Data: Impact of indices on query performance, basic structure of an index,
creating indexes with SQL, Types of Indexing and its data structures.
Database Implementation: Introduction to SQL, DDL aspect of SQL, DML aspect of
SQL – update, insert, delete & various form of SELECT- simple, using special
operators, aggregate functions, group by clause, sub query, joins, co-related sub query,
union clause, exist operator. PL/SQL - cursor, stored function, stored procedure,
triggers, error handling, and package.
Laboratory work: Students will learn SQL and other database concepts. One project,
which should include database designing & implementation.
 Project: It will contain a Project which should include database designing &
implementation, should be given to group of 2-4 students. While doing projects
emphasis should be more on back-end programming like use of SQL, concept of stored
procedure, function, triggers, cursors, package etc. Project should have continuous
evaluation and should be spread over different components. There should be a formal
project report. Evaluation components may include a poster, video presentation as well
as concept of peer evaluation and reflection component.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program.
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Analyze the Information Systems as socio-technical systems, its need and
advantages as compared to traditional file-based systems.
● Comprehend architecture of DBMS, conceptual data modelling, logical database
design and physical database design.
● Analyze and design database using E-R data model by identifying entities,
attributes and relationships.
● Apply and create Relational Database Design process with Normalization and De-
normalization of data.
● Demonstrate use of SQL and PL/SQL to implementation database applications.
 Course Syllabi: UMA031 OPTIMIZATION TECHNIQUES (L: T: P :: 3: 1: 0)

1. Course number and name: UMA031; OPTIMIZATION TECHNIQUES

2. Credits and contact hours: Credits: 3.5; Hours: 4
3. Instructor’s or course coordinator’s name: Faculty from School of Mathematics
4. Text Books (author, title, publisher and year):
● Chandra S., Jayadeva, Mehra A., Numerical Optimization and Applications, Narosa
Publishing House, (2013).
● Taha A. H., Operations Research-An Introduction, Pearson (2013) 9th Edition.
a. other supplemental materials
● Nil.

5. Reference, title, author, and year

● Pant C. J., Introduction to optimization: Operations Research, Jain Brothers (2004)
7th Edition.
● Bazaarra S. M., Jarvis J. J. and Shirali D. H., Linear Programming and Network flows,
John Wiley and Sons (2010) 4th Edition.
● Taha A. H., Operations Research-An Introduction, Pearson (2016) 10thedition.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Scope of Operations Research: Introduction to linear and non-linear programming
formulation of different models.
Linear Programming: Geometry of linear programming, Graphical method, Linear
programming (LP) in standard form, Solution of LP by simplex method, Exceptional
cases in LP, Duality theory, Dual simplex method, Sensitivity analysis.
Integer Programming: Branch and bound technique.
Transportation and Assignment Problem: Initial basic feasible solutions of balanced
and unbalanced transportation/assignment problems, Optimal solutions.
Project Management: Construction of networks, Network computations, Floats (free
floats and total floats), Critical path method (CPM), Crashing.
Game Theory: Two person zero-sum game, Game with mixed strategies, Graphical
method and solution by linear programming.
b. prerequisites or co-requisites
● Numerical Analysis
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Formulate and solve linear programming problems.
● Solve the transportation and assignment problems
● Solve the Project Management problems using CPM
● Solve two person zero-sum games
 Course Syllabi: UES010 Solids and Structures (L: T: P :: 3: 1: 2)

1. Course number and name: UES010; SOLIDS AND STRUCTURES

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: Faculty from Department of Civil
Engineering
4. Text Books (author, title, publisher and year):
 Popov P. E. and Balan T.A., Engineering Mechanics of Solids, Prentice Hall of India
(2012) 2nd Edition.
 Singh K. D., Mechanics of Solids, Pearson Education (2008).
a. other supplemental materials
 Nil.
5. Reference, title, author, and year
 Shames H. I. and Pitarresi M. J., Introduction to Solid Mechanics, Prentice Hall of
India (2015) 3rd Edition.
 Crandall H.S., Dahl C.N., Lardner J.T. and Sivakumar S. M., An Introduction to
Mechanics of Solids, McGraw Hill International, Tokyo (2012) 3rd Edition.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Elastic Plastic Behavior
Axial Stress and Strain: Concept of stress, strain, elasticity and plasticity; one-
dimensional stress-strain relationships; Young’s modulus of elasticity, shear modulus
and Poisson’s ratio; two-dimensional elasticity; isotropic and homogeneous materials;
ductile and brittle materials; statically determinate and indeterminate problems,
compound and composite bars; thermal stresses. Torsion of shafts; buckling of
struts, concept of factor of safety.
Shear Force and Bending Moment Diagrams: Types of load on beams,
classification of beams; axial, shear force and bending moment diagrams: simply
supported, overhung and cantilever beams subjected to any combination of point
loads, uniformly distributed and varying load and moment, equation of condition,
load function equation, qualitative analysis for two-dimensional frames.
Bending & Shear Stresses in beams: Derivation of flexural formula for straight
beams, concept of second moment of area, bending stress calculation for beams of
simple and built up sections, Flitched beams. Shear stress formula for beams,
shear stress distribution in beams.
Transformation of Stress and Strain: Transformation equations for plane stress and
plane strain, Mohr’s stress circle, relation between elastic constants, strain
measurements, strain rosettes.
Deformations: Governing differential equation for deflection of straight beams
having constant flexural rigidity, double integration and Macaulay’s methods for
slopes and deflection, unit load method for deflection of trusses.
Laboratory Work:
  Experimental Project Assignment: Students in groups of 4/5 will do projects:
 Calculation of tensile strength using UTM.
 Buckling of struts.
 Experimental verification of Theory of bending (calculation of bending stress
and deflections at various points in the beam theoretically and verifying the
same experimentally) and indirect evaluation of the modulus of elasticity.
 Torsion: Study the behavior of circular shafts under torsion and analysis of
failure and indirect evaluation of the modulus of rigidity.

Micro Project:
Model Bridge Experiment: This will involve construction of a model bridge using
steel wire and wood.
b. prerequisites or co-requisites
● Mechanics
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction :
After the completion of the course the student will be able to:
● Evaluate axial stresses and strains in various determinate and indeterminate
structural systems.
● Draw shear force diagram and bending moment diagram in various kinds of beams
subjected to different kinds of loads.
● Calculate load carrying capacity of columns and struts and their buckling strength.
● Evaluate various kinds of stresses (axial, bending, torsional and shearing) in various
structural elements due to different type of external loads.
● Determine deformations and deflections in various kinds of beams and trusses.
 Course Syllabi:UES011 THERMO-FLUIDS (L: T: P :: 3: 1: 2)

1. Course number and name: UES011; THERMO-FLUIDS

2. Credits and contact hours: Credits: 4.5; Hours: 6
3. Instructor’s or course coordinator’s name: From the Department of Chemical
Engineering
4. Text Books (author, title, publisher and year)::
● Kumar S. D, Fluid Mechanics and Fluid Power Engineering, S. K. Kataria (2009)
● Cengel Y. and Boles M., Thermodynamics: an Engineering Approach, McGraw-Hill
(2014) 8th Edition.
5. Reference, title, author, and year:
● Jain K. A., Fluid Mechanics: including Hydraulic Machines, Khanna Publishers
(2003)
● Rao C. V. Y, An Introduction to Thermodynamics, Universities Press (2004)
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Fluid Mechanics
● Introduction: Definition of a fluid and its properties
● Hydrostatics: Measurement of pressure, thrust on submerged surfaces
● Principles of Fluid Motion: Description of fluid flow; continuity equation;
Euler and Bernoulli equations; Pitot total head and static tubes, venturi-meter,
orifice-meter, rotameter; Momentum equation and its applications
● Pipe Flow: Fully developed flow; laminar pipe flow; turbulent pipe flow, major
and minor losses; Hydraulic gradient line (HGL) and total energy line (TEL)
● Boundary Layer: Boundary layer profile; displacement, momentum and
energy thickness
Thermodynamics
● Introduction: Properties of matter, the state postulate, energy, processes and
thermodynamic systems;
● Properties of Pure Substances: property tables, property diagrams, phase
change, equations of state (ideal gas);
● Energy: Energy transfer by heat, work and mass;
● First Law of Thermodynamics: Closed system, open system, steady-flow
engineering devices;
● Second Law of Thermodynamics: Statements of the Second Law, heat
engines, refrigeration devices, reversible versus irreversible processes, the
Carnot cycle.

Laboratory/Project programme List of Experiments

 Verification of Bernoulli’s theorem
 Determination of hydrostatic force and its location on a vertically immersed
surface
  Determination of friction factor for pipes of different materials
 Determination of loss coefficients for various pipe fittings
 Verification of momentum equation
 Visualization of laminar and turbulent flow, and rotameter
 Calibration of a venturi-meter
 Boundary layer over a flat plate

Sample List of Micro-Projects

Students in a group of 4/5 members will be assigned a micro project.
 Design a physical system to demonstrate the applicability of Bernoulli’s
equation.
 Determine the pressure distribution around the airfoil body with the help of
wind tunnel.
 Demonstrate the first law of thermodynamics for an open system, for example:
a ordinary hair dryer.
 Develop a computer program for solving pipe flow network.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Analyze and solve problems of simple fluid based engineering systems including
pressures and forces on submerged surfaces
● Analyze fluid flow problems with the application of the mass, momentum and
energy equations
● Evaluate practical problems associated with pipe flow systems
● Conceptualize and describe practical flow systems such as boundary layers and
their importance in engineering analysis
● Estimate fluid properties and solve basic problems using property tables, property
diagrams and equations of state
● Analyze and solve problems related to closed systems and steady-flow devices by
applying the conservation of energy principle
● Analyze the second law of thermodynamics for various systems and to evaluate the
performance of heat engines, refrigerators and heat pumps.
 Course Syllabi:UTA002 MANUFACTURING PROCESSES (L: T: P :: 2: 0: 3)

1. Course number and name: UTA002; MANUFACTURING PROCESSES

2. Credits and contact hours: Credits: 3.5; Hours: 5
3. Instructor’s or course coordinator’s name: From the Department of Mechanical
Engineering
4. Text Books (author, title, publisher and year):
● Degarmo E. P., Kohser, A. R. and Black, T. J., Materials and Processes in
Manufacturing, Wiley (2010) 10th Edition.
● Kalpakjian S. and Schmid S. R., Manufacturing Processes for Engineering Materials,
Pearson Education Asia (2007) 5th Edition.
5. Reference, title, author, and year:
● Chapman J. A. W., Workshop Technology Part 1, CBS Publishers (2001) 5th Edition.
● Zimmer W. E. and Groover P. M., Computer Aided Designing and Manufacturing,
Pearson (2003) 1st Edition.
● Pandey C. P. and Shan, S. H., Modern Machining Processes, Tata McGraw Hill
(2004).
● Mishra K. P., Non Conventional Machining, Narosa Publications (2006).
● Campbell S. J., Principles of Manufacturing, Materials and Processes, Tata McGraw
Hill Company (1995).
● Lindberg A. R., Process and Materials of Manufacture, Prentice Hall of India (2015)
4th Edition.
a. other supplemental materials
 Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Common engineering materials and their important mechanical and
manufacturing properties, General classification of manufacturingprocesses.
Metal Casting: Principles of metal casting, Patterns, Their functions, Types,
Materials and pattern allowances, Characteristics of molding sand, Types of cores,
Chaplets and chills, their materials and functions, Moulds and their types, Requisites
of a sound casting, Introduction to DieCasting.
Metal Forming and Shearing: Forging, Rolling, Drawing, Extrusion, Bending,
Spinning, Stretching, Embossing and Coining, Die and Punch operation in press
work, Shearing, Piercing and blanking, Notching, Lancing.
Machining Processes: Principles of metal cutting, Cutting tools, their materials and
applications, Geometry of single point cutting tool, Cutting fluids and their functions,
Basic machine tools and their applications, Introduction to non-traditional machining
processes (EDM, USM, CHM, ECM, LBM, AJM, andWJM).
Joining Processes: Electric arc, Gas, Resistance and Thermit welding, Soldering,
Brazing and Braze welding, Adhesive bonding, Mechanical fastening (Riveting,
Screwing, Metal stitching, Crimping etc.).
Plastic Processing: Plastics, their types and manufacturing properties, Compression
molding, Injection molding and Blow molding, Additives in Plastics.
 Modern Trends In Manufacturing: Introduction to numerical control (NC) and
computerized numerical control (CNC) machines.
Laboratory Work: Relevant Shop Floor Exercises Involving Practice in Pattern
Making, Sand Casting, Machining, Welding, Sheet Metal Fabrication Techniques,
Fitting Work, and Surface Treatment of Metals. Demonstration of Forge Welding,
TIG/MIG/GAS/Spot/Flash Butt Welding, Demonstration on Shaper, Planer, and
Milling Machine.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction :
After the completion of the course the student will be able to:
 Analyze various machining processes and calculate relevant quantities such as
velocities, forces, powers etc.;
 Suggest appropriate process parameters and tool materials for a range of different
operations and workpiece materials;
 Understand the basic mechanics of the chip formation process and how these are
related to surface finish and process parameters;
 Recognize cutting tool wear and identify possible causes and solutions;
 Develop simple CNC code, and use it to produce components while working in
groups.
 Perform calculations of the more common bulk and sheet forming, casting and
welding processes and given a particular component.
 Select the most appropriate manufacturing process to achieve product quality
through the efficient use of materials, energy and process.
Course Syllabi:UCS406 DATA STRUCTURES AND ALGORITHMS (L: T: P :: 3: 0: 2)

1. Course number and name: UCS 406; DATA STRUCTURES AND ALGORITHMS
2. Credits and contact hours: Credits: 6.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Rajeev Kumar
4. Text Books (author, title, publisher and year):
● Cormen H. T., Leiserson E. C., Rivest L. R., and Stein C., Introduction to Algorithms,
MIT Press (2009) 3rd ed.
● Sahni S., Data Structures, Algorithms and Applications in C++, Universities
Press(2005) 2nd ed.
5. Reference book, title, author, and year
● Karumanchi N., Data Structures and Algorithms Made Easy, CareerMonk
Publications (2017) 5th ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Linear Data Structures: Arrays, Records, Strings and string processing, References
and aliasing, Linked lists, Strategies for choosing the appropriate data structure,
Abstract data types and their implementation: Stacks, Queues, Priority queues, Sets,
Maps.
Basic Analysis: Differences among best, expected, and worst case behaviours of an
algorithm, Asymptotic analysis of upper and expected complexity bounds, Big O
notation: formal definition and use, Little o, big omega and big theta notation ,
Complexity classes, such as constant, logarithmic, linear, quadratic, and exponential,
Time and space trade-offs in algorithms, Recurrence relations , Analysis of iterative
and recursive algorithms.
Searching and Sorting: Linear Search, Binary Search, Bubble Sort, Selection Sort,
Insertion Sort, Shell Sort, Quick Sort, Heap Sort, Merge Sort, Counting Sort, Radix
Sort.
Algorithmic Strategies with examples and problem solving:Brute-force algorithms
with examples, Greedy algorithms with examples, Divide-and-conquer algorithms
with examples, Recursive backtracking, Dynamic Programming with examples,
Branch-and-bound with examples, Heuristics, Reduction: transform-and-conquer with
examples.
Non-Linear Data Structures And Sorting Algorithms:Hash tables, including
strategies for avoiding and resolving collisions, Binary search trees, Common
operations on binary search trees such as select min, max, insert, delete, iterate over
tree, Graphs and graph algorithms, Representations of graphs, Depth- and breadth-first
traversals, Heaps,Graphs and graph algorithms, Shortest-path algorithms (Dijkstra and
Floyd), Minimum spanning tree (Prim and Kruskal)
Problem Clauses: P, NP, NP- Hard and NP-complete, deterministic and non-
deterministic polynomial time algorithm approximation and algorithm for some NP
complete problems. Introduction to parallel algorithms, Genetic algorithms, intelligent
algorithms.
 Laboratory work: Implementation of Arrays, Recursion, Stacks, Queues, Lists,
Binary trees, Sorting techniques, Searching techniques. Implementation of all the
algorithmic techniques.

Project: It will contain a Project which should include designing a new data
structure/algorithm/ language/tool to solve new problems & implementation. It can
also involve creating visualizations for the existing data structures and algorithms.
Quantum of project should reflect at least 60 hours of Work excluding any learning for
the new techniques and technologies. It should be given to group of 2-4 students.
Project should have continuous evaluation and should be spread over different
components. There should be a formal project report. Evaluation components may
include a poster, video presentation as well as concept of peer evaluation and reflection
component.
b. prerequisites or co-requisites
● Computer Programming-II, Discrete Mathematical Structures
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction :
After the completion of the course the student will be able to:
● Implement the basic data structures and solve problems using fundamental
algorithms.
● Implement various search and sorting techniques.
● Analyze the complexity of algorithms, to provide justification for that selection,
and to implement the algorithm in a particular context.
● Analyze, evaluate and choose appropriate data structure and algorithmic technique
to solve real-world problems.
 Course Syllabi: UTA019 ENGINEERING DESIGN-III (L: T: P :: 1: 0: 4)

1. Course number and name: UTA019; ENGINEERING DESIGN-III

2. Credits and contact hours: Credits: 6 and Hours: 5
3. Instructor’s or course coordinator’s name: Faculty from Department of Electronics
and Communication Engineering
4. Text Books (author, title, publisher and year):
 McRoberts M., Beginning Arduino, APress (2013) 2nd Edition.
 Smith G. A., Introduction to Arduino: a piece of cake, CreateSpace Independent
Publishing Platform (2011)
 Boxall J., Arduino Workshop - a Hands-On Introduction with 65 Projects, No Starch
Press; 1st edition (2013).
5. Reference book, title, author, and year
a. Other supplemental materials
 Nil
6. Specific course information
a. brief description of the content of the course (catalog description)
Hardware overview of Arduino:
 Introduction to Arduino Board: Technical specifications, accessories and
applications.
 Introduction to Eagle (PCB layout tool) software.
Sensors and selection criterion:
 Concepts of sensors, their technical specifications, selection criterion, working
principle and applications such as IR sensors, ultrasonic sensors.

Active and passive components:

 Familiarization with hardware components, input and output devices, their
technical specifications, selection criterion, working principle and applications
such as-
 Active and passive components: Transistor (MOSFET), diode (LED), LCD,
potentiometer, capacitors, DC motor, Breadboard, general PCB etc.
 Instruments: CRO, multimeter, Logic probe, solder iron, desolder iron
 Serial communication: Concept of RS232 communication ,Xbee
 Introduction of ATtiny microcontroller based PWM circuit programming.

Programming of Arduino:
 Introduction to Arduino: Setting up the programming environment and basic
introduction to the Arduino micro-controller
 Programming Concepts: Understanding and Using Variables, If-Else Statement,
Comparison Operators and Conditions, For Loop Iteration, Arrays, Switch Case
Statement and Using a Keyboard for Data Collection, While Statement, Using
Buttons, Reading Analog and Digital Pins, Serial Port Communication,
Introduction programming of different type of sensors and communication
modules, DC Motors controlling.

Basics of C#:
  Introduction: MS.NET Framework Introduction, Visual Studio Overview and
Installation
 Programming Basics: Console programming, Variables and Expressions,
Arithmetic Operators, Relational Operators, Logical Operators, Bitwise
Operators, Assignment Operators, Expressions, Control Structures, Characters,
Strings, String Input, serial port communication: Read and write data using serial
port.
 Software code optimization, software version control

Laboratory work:
List of Experiments (ECE Lab)

Experiment-1
a. To design a schematic circuit diagram of PWM Transmitter for Gantry using
Eagle software tool.
b. To design a Printed Circuit Board layout of PWM Transmitter for Gantry using
Eagle software tool.

Experiment-2
a. To design a schematic circuit diagram of PWM Receiver for Gantry using Eagle
software tool.
b. To design a Printed Circuit Board layout of PWM Receiver for Gantry using Eagle
software tool.

Experiment-3
Design and testing of IR transmitter circuit which generates rectangular pulses of
specific pulse width for corresponding Gantry.
a. To solder IR transmitter circuit on a general purpose PCB.
b. To write a Program and upload it on the ATtiny based microcontroller through
Arduino boot-loader circuit.
c. To test the output pulses on CRO generated through IR transmitter circuit.
Experiment-4
Design and testing of IR receiver circuit which can sense the signal of a specific pulse
width and able to recognize the corresponding Gantry.
a. To solder IR receiver circuit on a general purpose PCB.
b. To test the combined module of IR transmitter and receiver circuits on Buggy
Track with Gantry provision through supervisory control mode for Bronze and
silver level.
List of Experiments (CSE LAB)
1. Introduction to Arduino Microcontroller.
2. Write a program in Arduino to blink a LED.
3. Write a program to design a pattern from sequence of multiple LED using for loop
in Arduino.
4. Write a program to demonstrate sending data from the computer to the Arduino
board and control brightness of LED.
 5. Write a program to demonstrate control of DC Motor using forward, backward,
left, right turn motion and clock-wise/anti clock- wise rotation.
6. Write a program to read values of IR Sensor using analog and digital read and
convert buggy into normal line follower robo car.
7. To demonstrate the use of ultrasonic sensor by integrating line follower robo car
with obstacle avoidance capability.
8. Write a program to read the pulse width of gantry transmitter and trigger
stop_buggy function by detecting individual gantry.
9. Write a C# Sharp program that takes three letters as input and display them in
reverse order on console.
10. Write a program to demonstrate Xbee module communication between two PCs
using C#.
11. Write a program to read IR sensors value from buggy using serial port
communication using C#.
12. Write a program to displaying gantry identification number using serial port
communication and C#.
13. Write a program to control buggy into full supervisory mode using serial
communication and C#.
14. Bronze Challenge: Single buggy around track twice in clockwise direction, under
full supervisory control. Able to detect an obstacle. Parks safely. Able to
communicate state of the track and buggy at each gantry stop to the console.
15. Silver Challenge: Two buggies, both one loop around, track in opposite directions
under full supervisory, control. Able to detect an obstacle. Both park safely. Able
to communicate state of the track and buggy at each gantry stop with console.
16. Gold Challenge: Same as silver but user must be able to enter the number of loops
around the track beforehand to make the code generalized.
b. prerequisites
 Electrical Engineering, Applied Physics, Engineering Design Project-II
c. indicate whether a required elective or selected elective (as per Table 5-1) coursein the
program
 Required

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course, the students will be able to:
 Recognize issues to be addressed in a combined hardware and software system
design.
 Draw the schematic diagram of an electronic circuit and Design its PCB layout
using CAD Tools.
 Develop practical experimental skills in electronic circuit testing.
 Clearly demonstrate group working, including task sub-division and integration of
individual contributions from the team.
 Develop practical experimental skills by coding and debugging different
challenges.
 Implement project tracking and code version control.
 Course Syllabi: UCS407 INVENTIONS & INNOVATIONS IN COMPUTING
(L: T: P :: 2: 0: 0)

1. Course number and name:UCS407: INVENTIONS & INNOVATIONS IN

COMPUTING
2. Credits and contact hours: Credits: 2.0; Hours: 2
3. Instructor’s or course coordinator’s name: Mr. Shatrugan Modi
4. Text Books (author, title, publisher and year):
 Raum E., The History of the Computer, Heinemann-Raintree (2007).
 Woodford C., Communication and Computers, Facts on File Inc. (2004).
5. Reference book, title, author, and year
 Ahmad I. and Ranka S., Handbook of Energy-Aware and Green Computing, CRC Press
(2012) 1st ed.
 Fortino G. and Trunfio P., Internet of things based on smart objects, Springer Science
& Business Media (2014).
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
The passion for invention - profile of great inventors in computing history, their
creations and impacts, Technological creativity in idea generation, Creating ideas based
on needs (Application Pull), Creating ideas based on observation of phenomena
(Technology Push), Understanding the role and use of Space, Time, Matter, and Energy
in invention, Recognition and effective use of Resources in invention, Using analogy
and feature transfer for invention, Recognition of patterns of technological evolution
and their use in invention, Turning ideas into meaningful inventions.
Computing devices, The Language Before the Hardware, The Earliest Processors,
Dawn of Modern Computers, Transitioning Toward Transistors, Invention of
semiconductor materials; Examples of simple and complex CPUs.
Programming Paradigms and Languages, Compilers and Algorithms
Operating Systems; Internet and distributed computing; Social networks; Numerical
methods for the approximate computer solution of otherwise intractable problems;
Databases; Data Analytics; Computer graphics and animation; Graphics Processor
Unit;
Computer and data security; Program Verification, Testing, Reliability and
Correctness.
Top Computing machines,Top Green Computing machines, their ranking system.
Internet of Things, Smart devices, Smart cities (requirement, design and
implementations), Case study: Smart street lighting and smart traffic management, use
of technology and open data, Interpreting Technology Hype, five key phases of a
technology's life cycle.
b. prerequisites or co-requisites
● None
 c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Generalize the important inventions in computing and technological evolution.
● Demonstrate the trade-off of time, space and technology used in invention.
● Summarizes the chronological development in computing in terms of hardware and
software.
● Relate computing to technology advancement
Course Syllabi: UCS616 ADVANCED DATA STRUCTURES AND ALGORITHMS
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS616; ADVANCED DATA STRUCTURES AND

ALGORITHM
2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Rajiv Kumar
4. Text Books (author, title, publisher and year):
● Cormen H. T., Leiserson E. C., Rivest L. R., and Stein C., Introduction to Algorithms,
MIT Press (2009) 3rd ed.
● Goldberg E. D., Genetic Algorithms, Pearson education 1989 (2009) 1st ed.
a. other supplemental materials
Nil.
5. Reference book, title, author, and year
 Sedgewick R. and Wayne K., Algorithms, Addison-Wesley Professional (2011), 4th ed.
 Sahni S., Data Structures, Algorithms and Applications in C++, Universities
Press(2005), 2nd ed.
a. other supplemental materials
 Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Advanced Data Structures: Importance and need of good data structures and
algorithms Heaps, AVL Trees (Search, Insertion, Deletion) Red-Black Trees(Search,
Insertion and Deletion), Splay Trees( Search, Insertion and Deletion),B-trees, B+ Trees
( Search, Insertion and Deletion), Fibonacci heaps, Data Structures for Disjoint Sets,
Augmented Data Structures, Self-Adjusting Data Structures, Temporal data structures,
Succinct data structures, Dictionaries and cuckoo hashing.
Algorithms Complexity and Analysis: Probabilistic Analysis with example,
Amortized Analysis with example, Competitive Analysis wit example, Internal and
External Sorting algorithms like external merge sort, distribution sorts.
Graphs & Algorithms: Representation, Type of Graphs, Paths and Circuits: Euler
Graphs, Hamiltonian Paths & Circuits; Cut-sets, Connectivity and Separability, Planar
Graphs, Isomorphism, Graph Coloring, Covering and Partitioning, Topological sort,
Max flow: Ford-Fulkerson algorithm, max flow – min cut, Dynamic Graphs, Few
Algorithms for Dynamic Graphs, Union-Find Algorithms.
String Matching Algorithms: Suffix arrays, Suffix trees, tries, Rabin-Karp, Knuth-
Morris-Pratt, Boyer Moore algorithm.
Approximation algorithms: Need of approximation algorithms: Introduction to P,
NP, NP-Hard and NP-Complete; Deterministic, non-Deterministic Polynomial time
algorithms; Knapsack, TSP, Set Cover, Open Problems.
Randomized algorithms: Introduction, Type of Randomized Algorithms, Quick Sort,
Min- Cut, 2-SAT; Game Theoretic Techniques, Random Walks.
Online Algorithms: Introduction, Online Paging Problem, Adversary Models, k-
server Problem.
 Genetic Algorithm: Introduction to GA, implementation in Python, problem solving
using GA such as subset problem, TSP, Knapsack.
Advance Data Structure in Python: List, Tuple, Dictionary, Set, Stack.
Laboratory work: Implementation of various advanced data structures and algorithms
for the problems like MAZE etc. Implementation of various advanced data structures
with Graphs and GUI based results to explore the use of formal verification algorithms
and verification tools.
b. prerequisites or co-requisites
● Data Structures and Algorithms
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Implement the different tree structures algorithm and analyze in context of
asymptotic notation.
● Identify basic properties of graphs and apply their algorithms to solve real life
problems.
● Demonstrate the usage of algorithms under several categories like string matching,
randomized algorithms and genetic algorithms.
● Implement various advanced data structures using C/Java/Python or related
languages.
 Course Syllabi: UCS503 SOFTWARE ENGINEERING (L: T: P :: 3: 0: 2)

1. Course number and name: UCS503; SOFTWARE ENGINEERING

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Seema Bawa
4. Text Books (author, title, publisher and year):
 Pressman S. R. andMaxim R. B., Software Engineering, A Practitioner’s
Approach, McGraw Hill International (2015) 8th Edition.
 Sommerville I., Software Engineering, Addison-Wesley Publishing Company (2011)
9th Edition.
a. other supplemental materials
 Nil.

5. Reference Book, title, author, and year

 Foster C. E., Software Engineering: A Methodical Approach, Apress(2014)1st ed.
 Booch G., RambaughJ., JacobsonI., The Unified Modeling Language User Guide
(2005) 2nd Edition.
a. other supplemental materials
 Nil

6. Specific course information

a. brief description of the content of the course (catalog description)
Software Engineering and Processes: Introduction to Software Engineering,
Software Evolution, Software Characteristics, Software Crisis: Problem and Causes,
Software process models (Waterfall, Incremental, and Evolutionary process models
and Agile), Software quality concepts, process improvement, software process
capability maturity models, Personal Software process and Team Software Process,
Overview of Agile Process.
Requirements Engineering: Problem Analysis, Requirement elicitation and
Validation, Requirements modeling: Scenarios, Information and analysis classes, flow
and behavioral modeling, documenting Software Requirement Specification (SRS).
Software Design and construction: System design principles: levels of abstraction
(architectural and detailed design), separation of concerns, information hiding,
coupling and cohesion, Structured design (top-down functional decomposition), object-
oriented design, event driven design, component-level design, test driven design, data-
structured centered, aspect oriented design , function oriented, service oriented, Design
patterns, Coding Practices: Techniques, Refactoring, Integration Strategies, Internal
Documentation.
Software Verification and Validation: Levels of Testing, Functional Testing,
Structural Testing, Test Plan, Test Case Specification, Software Testing Strategies,
Verification & Validation, Unit, Integration Testing, Top Down and Bottom Up
Integration Testing, Alpha & Beta Testing, White box and black box testing techniques,
System Testing and Debugging.
 Software Project Management: SP Estimation of scope(LOC,FP
etc),time(PERT/CPM Networks), and cost(COCOMO models), Quality Management,
Plan for software Quality Control and Assurance, Earned Value Analysis.
Advanced Topics: Formal specification, CASE Tools, Software Business Process
Reengineering, Configuration Management.
Laboratory work: Implementation of Software Engineering concepts and exposure to
CASE tools like Rational Software suit, Turbo Analyst, Silk Suite. Follow entire SDLC
depending on project domain.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course:

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Analyze software development process models, including agile models and
traditional models like waterfall.
 Demonstrate the use of software life cycle through requirements gathering, choice
of process model and design model.
 Apply and use various UML models for software analysis, design and testing.
 Acquire knowledge about the concepts of application of formal specification, case
tools and configuration management for software development.
 Analysis of software estimation techniques for creating project baselines.
Course Syllabi: UCS507 COMPUTER ARCHITECTURE AND ORGANIZATION
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS507; COMPUTER ARCHITECTURE AND

ORGANIZATION
2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Anju Bala
4. Text Books (author, title, publisher and year):
● Mano M. M., Computer System Architecture, Pearson (2007) 3rd ed.
● Hayes, P.J., Computer Architecture and Organization, McGraw Hill (1998) 3rd ed.
a. other supplemental materials
● Nil.

5. Reference book, title, author, and year

● Hennessy, L. J. and Patterson A. D., Computer Architecture: A Quantitative Approach,
Elsevier (2007) 4rth ed.
● Leigh E. W. and Ali L. D., System Architecture: software and hardware concepts, South
Western Publishing Co. (1988).
a. other supplemental materials
 Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Basics of Computer Architecture: Codes, Number System, Logic gates, Flip flops,
Registers, Counters, Multiplexer, Demultiplexer, Decoder, Encoder etc.
Register Transfer and Micro operations: Register transfer Language, Register
transfer, Bus & memory transfer, Logic micro operations, Shift micro operation.
Basic Computer Organization: Instruction codes, Computer instructions, Timing &
control, Instruction Cycles, Memory reference instruction, Input/output and Interrupts,
Complete computer description & design of basic computer.
ARM Processor Fundamentals: ARM core data flow model, Architecture, ARM
General purpose Register set, Exceptions, Interrupts, Vector Table, ARM processors
family.
Central Processing Unit: General register organization, Stack organization,
Instruction format, Data transfer & manipulation, Program control, RISC, CISC.
Computer Arithmetic: Addition & subtraction, Multiplication Algorithms, Division
algorithms.
Input-Output Organization: Peripheral devices, I/O interface Data transfer schemes,
Program control, Interrupt, DMA transfer, I/O processor.
Memory Unit: Memory hierarchy, Processor vs. memory speed, High-speed
memories, Cache memory, Associative memory, Interleave, Virtual memory, Memory
management.
Introduction to Parallel Processing: Pipelining, Characteristics of multiprocessors,
Interconnection structures, Interprocessor arbitration, Interprocessor communication &
synchronization.
 Laboratory work: Installing software development toolkit for ARM processor-based
microcontrollers, Assembly language programming for ARM processors.
b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Illustrate various elementary concepts of computer architecture including syntax of
register transfer language, micro operations, instruction cycle, and control unit.
 Comprehend the design of basic computer using instruction formats & addressing
modes.
 Identify various memory management techniques and algorithms for performing
addition, subtraction and multiplication etc.
 Acquire the knowledge about pipelining, multiprocessors, and input-output
organization.
 Course Syllabi: UCS701 THEORY OF COMPUTATION (L: T: P :: 3: 1: 0)

1. Course number and name: UCS701; THEORY OF COMPUTATION

2. Credits and contact hours: Credits: 3.5; Hours: 4
3. Instructor’s or course coordinator’s name: Dr. Ajay Kumar
4. Text Books (author, title, publisher and year):
● Hopcroft E. J., Ullman D. J. and Motwani R., Introduction to Automata Theory,
Languages and Computation, Pearson Education (2007) 3rd ed.
● Martin C. J., Introduction to Languages and the Theory of Computation, McGraw-Hill
Higher Education (2011) 4th ed.
● Lewis R. H., Papadimitriou H. C., Elements of the Theory of Computation, Prentice
Hall (1998) 2nd ed.
a. other supplemental materials
Nil.
5. Reference Books (author, title, publisher and year):
● Cohen A. I. D., Introduction to Computer Theory, Wiley (1997) 2nd ed.
● Sipser M., Introduction to the Theory of Computation, Cengage Learning (2013) 3rd
ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Regular Languages: Alphabets, Language, Regular Expression, Definitions of Finite
State Machine, Transition Graphs, Deterministic & Non-deterministic Finite State
Machines, Regular Grammar, Thompson’s Construction to Convert Regular Expression
to NDFA & Subset Algorithm to convert NDFA to DFA, Various recent development
in the Conversion of Regular Expression to NFA, Minimization of DFA, Finite State
Machine with output- Moore machine and Melay Machine, Conversion of Moore
machine to Melay Machine & Vice-Versa.
Properties of Regular languages: Conversion of DFA to Regular Expression, Pumping
Lemma, Properties and Limitations of Finite state machine, Decision properties of
Regular Languages, Application of Finite Automata.
Context Free Grammar and Push Down Automata: Context Free Grammar,
Derivation tree and Ambiguity, Application of Context free Grammars, Chomsky and
Greibach Normal form, Properties of context free grammar, CKY Algorithm, Decidable
properties of Context free Grammar, Pumping Lemma for Context free grammar, Push
down Stack Machine, Design of Deterministic and Non-deterministic Push-down stack.
Turing Machine: Turing machine definition and design of Turing Machine, Church-
Turing Thesis, Variations of Turing Machines, combining Turing machine, Universal
Turing Machine, Post Machine, Chomsky Hierarchy, Post correspondence problem.
Uncomputability: Halting Problem, Turing enumerability, Turing Acceptability and
Turing decidabilities, unsolvable problems about Turing machines, Rice’s theorem.
b. prerequisites or co-requisites
 ● Discrete Mathematical Structures
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Comprehend regular languages and finite automata and develop ability to provide
the equivalence between regular expressions, NFAs, and DFAs.
 Disambiguate context-free grammars by understanding the concepts of context-free
languages and push-down automata.
 Apply the concepts of recursive and recursively enumerable languages and design
efficient Turing Machines.
 Solve analytical problems in related areas of theory in computer science
 Course Syllabi: UCS521 ARTIFICIAL INTELLIGENCE (L: T: P :: 3: 1: 0)

1. Course number and name: UCS521; ARTIFICIAL INTELLIGENCE

2. Credits and contact hours: Credits: 3.5; Hours: 4
3. Instructor’s or course coordinator’s name: Ms. Shanky Goel
4. Text Books (author, title, publisher and year):
● Rich E., Knight K. and Nair B. S., Artificial Intelligence, Tata McGraw Hills (2009)
3rded.
● Luger F. G., Artificial Intelligence: Structures and Strategies for Complex Problem
Solving, Pearson Education Asia (2009) 6thed.
a. other supplemental materials
● Nil.

5. Reference Book, title, author, and year

● Patterson W. D., Introduction to Artificial Intelligence and Expert Systems, Pearson
(2015) 1sted.
● RusselS., Norvig P., Artificial Intelligence: A Modern Approach, Prentice Hall (2014)
3rd Ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Overview: foundations, scope, problems, and approaches of AI.
Intelligent agents: reactive, deliberative, goal-driven, utility-driven, and learning
agents
Problem-solving through Search: forward and backward, state-space, blind,
heuristic, problem-reduction, A, A*, AO*, minimax, constraint propagation, neural,
stochastic, and evolutionary search algorithms, sample applications.
Knowledge Representation and Reasoning: ontologies, foundations of knowledge
representation and reasoning, representing and reasoning about objects, relations,
events, actions, time, and space; predicate logic, situation calculus, description logics,
reasoning with defaults, reasoning about knowledge, sample applications.
Planning: planning as search, partial order planning, construction and use of planning
graphs
Representing and Reasoning with Uncertain Knowledge: probability, connection to
logic, independence, Bayes rule, Bayesian networks, probabilistic inference, sample
applications.
Decision-Making: basics of utility theory, decision theory, sequential decision
problems, elementary game theory, sample applications.
Machine Learning and Knowledge Acquisition: learning from memorization,
examples, explanation, and exploration. Learning nearest neighbour, naive Bayes, and
decision tree classifiers, Q-learning for learning action policies, applications.
 Languages for AI problem solving: Introduction to PROLOG syntax and data
structures, representing objects and relationships, built-in predicates. Introduction to
LISP- Basic and intermediate LISP programming
Expert Systems: Architecture of an expert system, existing expert systems like
MYCIN, RI, Expert system shells.
Laboratory work: Programming in C/C++/Java/LISP/PROLOG: Programs for
Search algorithms- Depth first, Breadth first, Hill climbing, Best first, A* algorithm,
Implementation of games: 8-puzzle, Tic-Tac-Toe, tower of Hanoi and water jug
problem using heuristic search, Designing expert system using logic in PROLOG,
Implementing an intelligent agent.
b. prerequisites or co-requisites
● Data Structures and Algorithms, Optimization Techniques
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Learn the basics and applications of artificial intelligence and categorize various
problem domains, basic knowledge representation and reasoning methods.
● Analyze basic and advanced search techniques including game playing,
evolutionary search algorithms, constraint satisfaction.
● Learn and design intelligent agents for concrete computational problems.
● Understand and implement the basic concepts of programming languages like
Prolog and LISP.
● Acquire knowledge about the architecture of an expert system and design new
expert systems for real life applications.
 Course Syllabi: UCS525 PROFESSIONAL PRACTICES (L: T: P :: 0: 1: 2)

1. Course number and name: UCS525; PROFESSIONAL PRACTICES

2. Credits and Contact Hours: Credits:1.5; Hours: 3
3. Instructor’s or course coordinator’s name: Dr. Neeraj Kumar
4. Specific course information
a. Brief description of the content of the course (catalog description)
Course Objective: To provide the students with an insight into recent professional and
technical practices being followed in industry and academia. The learning requires
students to attend lectures delivered by industry experts and academicians and gain an
understanding of recent developments happening in the world of computing and
technology.
Course Description: The course is directed at tapping the experience and research of
resource persons with the objective of expanding the horizons of students’ knowledge.
The course is offered to fifth semester students, enabling them to use the gained
knowledge set in finding solutions to the research problems and projects undertaken as
part of the programme curriculum. Students are addressed by experts from the industry
and academic institutions which apprise them with the current professional practices,
tools, technologies and methodologies being followed in industries.
b. prerequisites
● Professional Communication, Inventions and Innovations in Computing
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
 Required

5. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course, the students will be able to:
● Develop and refine skills to understand the problem and identify approach to solve
that problem through research and analysis.
● Gain knowledge about the professional practices adopted in industry.
● Achieve life-long learning through expert lectures on latest tools and technology.
● Gain an insight into contemporary issues related to computing technology.
 Course Syllabi: UCS617 MICROPROCESSOR BASED SYSTEMS DESIGN
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS617; MICROPROCESSOR BASED SYSTEMS

DESIGN
2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Anju Bala
4. Text Books (author, title, publisher and year):
● Gaonkar R., Microprocessor Architecture, Programming and Applications with the
8085, Penram International Publishing India Pvt. Ltd. (2013) 6th ed.
● Hall V. D. and Rao S., Microprocessor and Its Interfacing, Tata McGraw Hill
Publishing Company (2012) 3rd ed.
● Furber S., ARM System on Chip Architecture, Pearson Education (2000) 2nd Edition.
a. other supplemental materials
● Nil.

5. Reference, title, author, and year:

● Liu Y. and Gibson A. G., Microcomputer Systems: The 8086/8088 Family Architecture
Programming and Design, Pearson (2006) 2nd ed.
● Sloss N. A., Symes D. and Wright C., ARM System Developer’s Guide, Morgan
Kaufmann publications (2004).
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction to Microprocessors: Need for Flexible Logic and Evolution of
Microprocessors, Applications, Generic Architecture of a Microprocessor, Overview
of 8085 microprocessor, Architecture, Instruction Set, Interrupts and Programming
Examples.
INTEL 8086 Microprocessor: Pin Functions, Architecture, Characteristics and Basic
Features of Family, Segmented Memory, Interrupt Structures, INTEL 8086 System
Configuration, Description of Instructions, Addressing Modes, Assembly directives.
Assembly software programs with algorithms, Loops, Nested loops, Parameter Passing
etc.
Interfacing with 8086: Interfacing of RAMs and ROMs along with the explanation of
timing diagrams. Interfacing with peripheral ICs like 8255, 8254, 8279, 8259, 8251 etc.
ARM Processor Fundamentals: ARM core data flow model, Architecture, ARM
General purpose Register set and GPIO’s, CPSR, Pipeline, Exceptions, Interrupts,
Vector Table, ARM processors family, ARM instruction set and Thumb Instruction set.
ARM programming in Assembly: Writing code in assembly, Instruction Scheduling,
Register Allocation, Conditional Execution, Looping Constructs, Bit Manipulation,
Efficient Switches, Optimized Primitives: Double-Precision Integer Multiplication,
Integer Normalization and Count Leading Zeros, Division, Square Roots,
Transcendental Functions like log, exp, sin, cos, Endian Reversal and Bit Operations,
 Saturated and Rounded Arithmetic, Random Number Generation, Exception and
Interrupt Handling.
Laboratory Work: Introduction to INTEL kit, Programming examples of 8086 and
ARM based processors. Interfacing of LED seven segment display, ADC, DAC,
stepper motor etc. Microprocessor based projects.
Projects: ARM based projects to be allocated by concerned faculty.
b. prerequisites or co-requisites
● Computer Architecture and Organization

c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Acquire knowledge about the basic concepts of 8085 Microprocessor and its
programming.
● Comprehend the internal architecture of 8086 and its programming using
instruction set.
● Interface different peripheral devices with 8086 microprocessors.
● Know the internal architecture of ARM processor and its instruction set.
● Write the programs using ARM processors.
 Course Syllabi: UCS614 EMBEDDED SYSTEMS DESIGN (L: T: P :: 3: 0: 2)

1. Course number and name: UCS614; EMBEDDED SYSTEMS DESIGN

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Mr. Abhishek Jain
4. Text Books (author, title, publisher and year):
● Das B. L., Embedded Systems: An Integrated Approach, Pearson (2012) 1st ed.
a. other supplemental materials
● Nil.
5. Reference book, title, author, and year
● Kamal R., Embedded Systems Architecture, Programming and Design, Tata Mcgraw
Hill (2014) 3rd ed.
● Marwedel P., Embedded System Design, Springer International Publishing (2018) 3rd
Edition.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Basics of computer architecture and the binary number system: Basics of
computer architecture, Computer languages, RISC and CISC architectures, Number
systems, Number format conversions, Computer arithmetic, Units of memory capacity.
Introduction to Embedded systems: Application domain of embedded systems,
Desirable features and general characteristics of embedded systems, Model of an
Embedded System, Microprocessor vs Micro-controller, Example of a Simple
embedded system, Figures of merit for an embedded system, Classification of Scum :
4/8/16/32 Bits, History of embedded systems, Current trends.
Embedded Systems – The hardware point of view: Micro-controllerUnit(MCU), A
Popular 8-bit MCU, Memory for embedded systems, Low power design, Pull-up and
pull-down resistors.
Sensors, ADCs and Actuators: Sensors, Analog to Digital Converters, Actuators.
Examples of Embedded Systems: Mobile Phone, Automotive Electronics, Radio
frequency identification(RFID), Wireless sensor networks(WISENET), Robotics,
Biomedical Applications,Brain machine interface
Real – time Operating Systems: Real-time tasks, Real-time systems, Types of Real-
time tasks, Real-time operating systems, Real- time scheduling algorithms, Rate
Monotonic Algorithm, The Earliest deadline first algorithm, Qualities of a Good
RTOS.
Automated design of Digital IC’s:History of integrated circuit(IC) design, Types of
Digital IC’s, ASIC design, ASIC design: the complete sequence.
Hardware Software Co-design and Embedded Product development
lifestyle management: Hardware Software Co-design, Modeling of Systems,
Embedded Product Development Lifestyle Management, Lifestyle Models.
Embedded Design-A Systems Perspective: A typical Example, Product Design, The
Design Process, Testing, Bulk Manufacturing.
 Internet of Things: Sensing and Actuation from Devices, Communication
Technologies, Multimedia Technologies, Circuit Switched Networks, Packet Switched
Networks.
Laboratory Work: To design and simulate list of combinational and
sequential digital circuits using Modelsim& Xilinx –
Verilog language. To design and simulate the operations of systems like
verilog using Modelsim& Toggle, Bitwise, Delay and
any Control Logic Design in 8051.

b. prerequisites or co-requisites
● Computer Architecture and Organization
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course I in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Identify the need and usage of Embedded System.
● Compare and contrast a Real Time Embedded System from other systems.
● Describe the kind of memory and processor.
● Identify and define Bus, Wires and Ports , Basic Protocols of data transfer , Bus
arbitration, ISA bus signals, and handshaking , Memory mapped I/O and simple
I/O, Parallel I/O and Port Based I/O , examples of interfacing memory to the ports
of 8051.
● Discuss field programmable gate array (FPGA) and its application.
● Outline the concept of Internet of Things.
 Course Syllabi: UCS615: IMAGE PROCESSING ( L: T: P:: 3: 0: 2)

1. Course number and name: UCS615; IMAGE PROCESSING

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Rupali Bhardwaj
4. Text Books (author, title, publisher and year):
● Gonzalez C. R., Woods E. R., Digital Image Processing, Pearson Education (2008) 3rd
ed.
● Sonka M., Hlavac V. and Boyle R., Image Processing, Analysis and Machine Vision,
Thomson Learning, (1993)1sted.
a. other supplemental materials
 Nil.
5. Reference book, title, author, and year
● McAndrew A., Introduction to Digital Image Processing with Matlab, Thomson Course
Technology (2004)
● Low A., Introductory Computer Vision and Image Processing, McGraw-Hill (1991),
1sted.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Examples of fields that use digital image processing, fundamental steps
in digital image processing, components of image processing system. Digital Image
Fundamentals: A simple image formation model, image sampling and quantization,
basic relationships between pixels.
Image enhancement in the spatial domain: Basic gray-level transformation,
histogram processing, enhancement using arithmetic and logic operators, basic spatial
filtering, smoothing and sharpening spatial filters, combining the spatial enhancement
methods.
Image restoration: A model of the image degradation/restoration process, noise
models, and restoration in the presence of noise–only spatial filtering, Weiner filtering,
constrained least squares filtering, geometric transforms; Introduction to the Fourier
transform and the frequency domain, estimating the degradation function.
Color Image Processing: Color fundamentals, color models, pseudo color image
processing, basics of full–color image processing, color transforms, smoothing and
sharpening, color segmentation.
Image Compression: Fundamentals, image compression models, error-free
compression, lossy predictive coding, image compression standards.
Morphological Image Processing: Preliminaries, dilation, erosion, open and closing,
hit or miss transformation, basic morphologic algorithms.
Image Segmentation: Detection of discontinuous, edge linking and boundary
detection, thresholding, region–based segmentation.
 Object Recognition: Patterns and patterns classes, recognition based on decision–
theoretic methods, matching, optimum statistical classifiers, neural networks, structural
methods – matching shape numbers, string matching.
Laboratory work: Demonstrate the use of Image Processing Toolbox on MATLAB
to create interactive image processing applications like image enhancement, image
compression, image segmentation, feature extraction etc.
b. prerequisites or co-requisites
● Numerical Analysis, Advanced Data Structures and Algorithms
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course
in the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Comprehend the need and usage of concepts of image processing.
 Enhance the visual quality of given grey/color image using well known
transformations and filters.
 Distinguish between lossy and lossless image compression prototypes.
 Segment the regions of given image using various feature extraction algorithms in
order to recognize object.
 Demonstrate the use of MATLAB to create correlative image processing
applications.
 Course Syllabi: UTA012 INNOVATION AND ENTREPRENEURSHIP
(L: T: P :: 1: 0: 2)

1. Course number and name: UTA012; INNOVATION AND ENTREPRENEURSHIP

2. Credits and contact hours: Credits: 4.5; Hours: 3
3. Instructor’s or course coordinator’s name: Faculty from Department of Mechanical
Engineering
4. Text Books (author, title, publisher and year):
● Ries E., The lean Start-up, Penguin Books Limited (2011).
● Blank S., and Dorf B., The Startup Owner’s Manual: The Step by Step Guide for
Building a Great Company, K&S Ranch (2013).
● Carter S. and Evans J. D., Enterprise and small business- Principal Practice and
Policy, Emerald Group Publishing Limited (2013) 2nd Edition.
a. other supplemental materials
● Nil.

5. Reference book, title, author, and year

● Byers H. T., Dorf C. R. and Nelson J. A., Technology Ventures: From Idea to
Enterprise, McGraw Hill (2014) 4th Edition.
● Osterwalder A. and Pigneur Y., Business Model Generation, Wiley (2010).
● Bagchi S., Go Kiss the World: Life Lessons For the Young Professional, Portfolio
Penguin (2008).
● Bagchi S., MBA At 16: A Teenager’s Guide to Business, Penguin Books, (2012).
● Bansal R., Stay Hungry Stay Foolish, CIIE IIM Ahmedabad (2008).
● Abrams R., Six-week Start-up, Prentice-Hall of India (2004).
● Verstraete T. and Laffitte E. J., A Business Model of Entrepreneurship Edward Elgar
Publishing(2013)
● Johnson S., Where Good Ideas comes from, Penguin Books Limited (2011).
● Michael E. G., Awakening the Entrepreneur Within, Gabor, Primento (2013).
● Guillebeau C., The $100 startup, Macmillan (2012).
● Kelley T., The ten faces of innovation, Currency Doubleday (2005).
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction to Entrepreneurship: Entrepreneurs; entrepreneurial personality and
intentions - characteristics, traits and behavioural; entrepreneurial challenges.
Entrepreneurial Opportunities: Opportunities- discovery/ creation, Pattern
identification and recognition for venture creation: prototype and exemplar model,
reverse engineering.
Entrepreneurial Process and Decision Making: Entrepreneurial ecosystem ,
Ideation, development and exploitation of opportunities; Negotiation, decision making
process and approaches, - Effectuation and Causation.
 Crafting business models and Lean Start-ups: Introduction to business models;
Creating value propositions - conventional industry logic, value innovation logic;
customer focused innovation; building and analysing business models; Business model
canvas , Introduction to lean startups, BusinessPitching.
Organizing Business and Entrepreneurial Finance: Forms of business
organizations; organizational structures; Evolution of organisation, sources and
selection of venture finance options and its managerial implications.Policy Initiatives
and focus; role of institutions in promoting entrepreneurship.
b. prerequisites or co-requisites
● Inventions and Innovations in Computing
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Define the fundamentals of entrepreneurship.
● Explain the role of entrepreneurial process and entrepreneurial decision making.
● Describe various business models and design a business model canvas.
● Evaluate various forms of enterprises and sources of raising finance for start-up
ventures.
● Articulate the latest developments and challenges in the entrepreneurship.
 Course Syllabi: UCS802 COMPILER CONSTRUCTION (L: T: P :: 3: 0: 2)

1. Course number and name: UCS802; COMPILER CONSTRUCTION

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Karun Verma
4. Text book (title, author, and year)
 AhoV. A., Ullman D. J., Sethi R. and Lam S. M., Compilers Principles, Techniques
and Tools, Pearson Education (2007), 2nd ed.
 Levine J., Mason T., Brown D., Lex and Yacc, O’Reilly (2012), 2nd ed.

5. Reference book (title, author, and year)

 Kenneth C. L., Compiler Construction and Practices, Thomson Publication (1997), 2nd
ed.
 Dhamdhere, Compiler Construction, Macmillan Publication (2008), Edition 2nd.

6. Specific course information

a. Brief description of the content of the course (catalog description)
Introduction to compiling: Compilers, Analysis of the source program, the phases of
Compiler, Compilation and Interpretation, Bootstrapping and Cross compiler.
Lexical Analysis: Need of Lexical analyzer, Tokens and regular expressions,
Generation of lexical analyzer from DFA, Introduction to LEX and program writing in
LEX.
Syntax Analysis: Need for syntax analysis and its scope, Context free grammar, Top
down parsing, bottom up parsing, backtracking and their automatic generation, LL(1)
Parser, LR Parser, LR(0) items, SLR(1), LALR(1), Canonical Parsing, Introduction to
YACC and Integration with LEX.
Error Analysis: Introduction to error analysis, detection, reporting and recovery from
compilation errors, Classification of error-lexical, syntactic and semantic with
examples, Detection of syntactic error in LL and LR parsers, panic mode error recovery
and error recovery in YACC tool.
Static semantics and Intermediate Code generation: Need for various static semantic
analyses in declaration processing, name and scope analysis, S-attribute def. and their
evaluation in different parsing, Semantic analysis through S-attribute grammar, L-
attribute def. and their evaluation.
Run time Environment: Need for runtime memory management, Address resolution
of runtime objects at compile time, Type checking, Language features influencing run
time memory management, Parameter passing mechanism, Division of memory into
code, stack, heap and static, Activation record, Dynamic memory management, garbage
collection.
Code Generation: Code generation for expressions, Issues in efficient code generation,
Sethi Ullman algorithm, Dynamic programming approach for optimal code generation
tree, Introduction to retargetable code generation, Code generation for control
structures.
 Code Optimization: Need for code optimizations, Local and global optimization,
Control flow analysis, Data flow analysis, performing global optimizations, Graph
coloring in optimization, Live ranges of run time values.
Laboratory work: Construct a lexical analyzer using Flex. Construct a parser using
Prison Bison. Build simple compilers from parsing to intermediate representation to
code generation and simple optimization.
b. prerequisites
● Theory of Computation
c. indicate whether a required elective or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● In-depth knowledge of working of major phases of compiler.
● Parser construction using top-down and bottom-up parsing techniques.
● Classify various parameters passing scheme, explain memory management
techniques.
● Apply code optimization techniques on HLL.
 Course Syllabi: UCS781 INDEPENDENT STUDY (L: T: P :: 0: 2: 0)

1. Course number and name:UCS781; INDEPENDENT STUDY

2. Credits and contact hours Credits: 1; Hours: 2
3. Instructor’s or course coordinator’s name: Dr. Sunita Garhwal
4. Specific course information
a. Brief description of the content of the course (catalog description)
Course Objective:This course has been designed in order to develop a high level of
self-directed learning among the undergraduate students by exposing them to a variety
of spectrum involving latest research topics.
Course Description: This learning requires students to form groups of three or four.
Each group has to read research papers, study project reports, and to conduct research.
This work is a blend of experiential, directed reading or independent research
supervised by a faculty member. This course is offered in the seventh semester and
during the period they have to find a particular problem to work on, make a poster and
write a research paper along with the results analysis by actually applying the
techniques on the primary or secondary datasets.
b. prerequisites
● Elective-I, Elective-II, Elective-III, Professional Communication
c. Indicate a required regular (as per Table 5-1) course in the program
● Required

5. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course, the students will be able to:
● Apply knowledge, skills and creative ideas to a self-selected topic.
● Develop research know how to analyze and investigate a problem in a self-
directed manner.
● Understand the problem formulation, its hypothesis and research to draw
conclusions
 Course Syllabi: UHU005 HUMANITIES FOR ENGINEERS (L: T: P :: 2: 0: 2)

1. Course number and name: UHU005; HUMANITIES FOR ENGINEERS

2. Credits and contact hours: Credits: 3.0; Hours: 4
3. Instructor’s or course coordinator’s name: Faculty from School of Humanities and
Social Sciences
4. Text Books (author, title, publisher and year):
● Morgan C. T., King R. A., Weisz J. R. &Schopler J., Introduction to Psychology,
McGraw Hill Book Co. (2001) 7th Edition..
● Krugman P. and Robin W., Economics, Worth Publisher (2013) 3rd Edition.
● Pindyck S. R., and Rubinfeld L. D., Microeconomic, Pearson Education (2013) 8th
Edition.
● Samuelson A. P. and Nordhaus D. W., Economics, McGraw Hill, (2009) 19th Edition.
● Mankiw G. N., Principles of Macroeconomics, South-Western (2014) 7th Edition.
● Gregory R. P. and Stuart C. R., The Global Economy and Its Economic Systems,
(2013) South-Western (2014).
5. Reference Books, title, author, and year
● Berne E., Games People Play – The Basic Hand Book of Transactional Analysis. New
York: Ballantine Books (1992).
● Ferrell C. O., Fraedrich J. and Ferrell, Business Ethics: Ethical Decision Making &
Cases, Cengage Learning (2017) 11th Edition.
● Schultz P. D. and Schultz E. S., Theories of Personality, Cengage Learning, (2017)
11th Edition.
● Saleem S., Business Environment, Pearson (2015) 3rd Edition.
● Chernilam F., International Buisness-Text and Cases, Prentice Hall (2010) 5th
Edition.
● Peterson H. C., Lewis C. W. and Jain K. S., Managerial Economics, Pearson (2005)
4th Edition.
6. Specific course information
a. brief description of the content of the course (catalog description)
Course Objectives: The objective of the course is to understand the interplay between,
psychological, ethical and economic principles in governing human behavior. The
course is designed to help the students to understand the basic principles underlying
economic behavior, to acquaint students with the major perspectives in psychology to
understand human mind and behavior and to provide an understanding about the how
ethical principles and values serve as a guide to behavior on a personal level and within
professions.

PSYCHOLOGICAL PERSPECTIVE

Introduction to Psychology: Historical Background, Psychology as a science.

Different perspectives in Psychology.

Perception and Learning: Determinants of perception, Learning theories, Behavior

Modification.
Motivational and Affective basis of Behavior: Basic Motives and their applications
at work. Components of emotions, Cognition and Emotion. Emotional Intelligence.
Group Dynamics and Interpersonal relationships.
Development of self and personality.
Transactional Analysis.
Culture and Mind.

Practicals:
 Experiments on learning and behavior modification.
 Application of Motivation Theories: Need based assessment.
 Experiments on understanding Emotions and their expressions.
 Personality Assessment.
 Exercises on Transactional analysis.
 Role plays, case studies, simulation tests on human behavior.

HUMAN VALUES AND ETHICAL PERSPECTIVE

Values: Introduction to Values, Allport-Vernon Study of Values, Rokeach Value

Survey, Instrumental and Terminal Values.

Value Spectrum for a Good Life: Role of Different Types of Values such as
Individual, Societal, Material, Spiritual, Moral, and Psychological in living a good life.

Moral and Ethical Values: Types of Morality, Kant's Principles of Morality, Factors
for taking ethical decisions, Kohlberg's Theory of Moral Development. Analyzing
Individual human values such as Creativity, Freedom, Wisdom, Love and Trust.
Professional Ethics and Professional Ethos, Codes of Conduct, Whistle-blowing,
Corporate Social Responsibility.

Laboratory Work:
Practical application of these concepts by means of Discussions, Role-plays and
Presentations, Analysis of Case studies on ethics in business and CSR.

ECONOMIC PERSPECTIVE Basics of Demand and Supply, Production and cost

analysis.
Market Structure: Perfect and Imperfect Markets.

Investment Decisions: capital Budgeting, Methods of Project Appraisal.

Macroeconomic Issues: Gross domestic product (GDP), Inflation and Financial

Markets.

Globalisation: Meaning, General Agreement on Trade and tariffs (GATT), World

Trade Organisation (WTO). Global Liberalisation, and its impact on Indian Economy.
 Laboratory Work:
The practicals will cover numerical on demand, supply, market structures and capital
budgeting, Trading games on financial markets, Group discussions and presentations
on macroeconomic issues. The practicals will also cover case study analysis on
openness and globalisation and the impact of these changes on world and Indian
economy.

Micro Project: Global Shifts and the impact of these changes on world and Indian
economy.

b. prerequisites or co-requisites
● None
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course, the students will be able to:
 Improve the understanding of human behavior with the help of interplay of
professional, psychological and economic activities.
 Able to apply the knowledge of basic principles of psychology, economics and
ethics for the solution of engineering problems.
 Explain the impact of contemporary issues in psychology, economics and ethical
principles on engineering.
 Course Syllabi: UCS794 CAPSTONE PROJECT (L: T: P :: 0: 0: 2)

1. Course number and name: UCS794 CAPSTONE PROJECT

2. Credits and contact hours Credits: 12; Hours: 2
3. Instructor’s or course coordinator’s name: Dr Inderveer Chana
4. Specific course information
a. brief description of the content of the course (catalog description)
Course Objective: To facilitate the students learn and apply an engineering design
process in electrical engineering, including project resource management. As a part of
a team, the students will make a project, that emphasizes, hands-on experience, and
integrates analytical and design skills. The idea is to provide an opportunity to the
students to apply what they have learned throughout the course of graduate program by
undertaking a specific problem.

Course Description Capstone Project is increasingly interdisciplinary, and requires

students to function on multidisciplinary teams. It is the process of devising a system,
component or process to meet desired needs. It is a decision-making process (often
iterative), in which the basic sciences, mathematics, and the engineering sciences are
applied to convert resources optimally to meet these stated needs.” It typically includes
both analysis and synthesis performed in an iterative cycle. Thus, students should
experience some iterative design in the curriculum. As part of their design experience,
students have an opportunity to define a problem, determine the problem scope and To
list design objectives. The project must also demonstrate that students have adequate
exposure to design, as defined, in engineering contexts. Engineering standards and
realistic constraints are critical in engineering design. The program must clearly
demonstrate where standards and constraints are taught and how they are integrated
into the design component of the project. Each group will have 4-5 students. Each
group should select their team leader and maintain daily diary. Each Group will work
under mentorship of a Faculty supervisor. Each group must meet the assigned
supervisor (2hrs slot/week) till the end of the semester (record of attendance will be
maintained), as per the time slot which will be provided to them by the respective
supervisor. This is mandatory requirement for the fulfillment of the attendance as well
as the successful completion of the project. The faculty supervisor of the project will
continuously assess the progress of the works of the assigned groups.
b. prerequisites
● None
c. indicate whether a required elective or selected elective (as per Table 5-1) course in
the program
● Required

5. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Develop skills necessary for structuring, managing, and executing the projects.
● Design, develop, debug, document, and deliver a project and learn to work in a
team environment.
● Develop written and oral communication skills.
● Become proficient with software development tools and environments.
● Apply interdisciplinary knowledge to engineering design solutions, taking into
account professional and ethical issues.
 Course Syllabi: UCS895 PROJECT SEMESTER

1. Course number and name: UCS895; PROJECT SEMESTER

2. Credits and contact hours: Credits: 20
3. Instructor’s or course coordinator’s name: Dr. Vinay Arora
4. Specific course information
a. brief description of the content of the course (catalog description)
Course Objective: The project semester is aimed at developing the undergraduate
education programme in engineering to include a practical training in a professional
engineering setting (a company, top educational institution, research institute, etc.)
hereafter referred to as “host organization” as deemed appropriate. The participating
organizations are ones that are either already visiting Thapar Institute of Engineering
& Technology for placement or are forming new relationships for mutual benefit. The
project semester gives the student an opportunity to translate engineering theory into
practice in a professional engineering environment. The technical activity should be
related to both the student’s engineering studies and to the host organization’s. It should
involve tasks and methods that are more appropriately completed in a professional
engineering environment and should, where possible, make use of human and
technology resources provided by the organization. It consolidates the student’s prior
learning and provides a context for later research studies.
The purpose of the project semester is to further develop the understanding related to
the implementation, design and theoretical aspects of the computer science and its
application to the practical problems. Many of the subjects that a student had studied
in the university have a direct impact on what the student will be doing in the software
industry. Student will extend and deepen the knowledge of computer science &
engineering while working within the span of project semester.

Assessment Details: Each student is assigned a faculty mentor from CSED, Thapar
Institute of Engineering & Technology, who during the tenure of project semester,
visits the workplace of the student twice. Faculty mentor provides 20 marks for goal
report and mid-way report both. Industrial mentor evaluates the students on the basis
of set parameters and provides marks out of 20. Five marks are for peer review, where
a student is judged by his/her peers. Finally, a panel of three faculty members from
CSED will evaluate each student during their presentations and viva. Here, the total
marks are 55. The final grading is performed on the consolidated marks, i.e. 100.
b. prerequisites
● None
c. indicate whether a required elective or selected elective (as per Table 5-1) course in the
program
● Required
5. Specific goals for the course
a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Identify, formulate and analyze existing problem in the (non-automated) work flow
for performing a specific task.
● Design and implement automated solutions for the assigned/identified real world
problems.
● Write technical reports.
● Practice and develop skills in time management and reporting within an industrial
or research laboratory setting.
● Contribute to an ethical and professional work culture and also to learn to work in
diverse teams
 Course Syllabi: UCS896 CAPSTONE PROJECT-II (L: T: P :: 0: 0: 4)

1. Course number and name: UCS 896; Capstone Project-II

2. Credits and contact hours Credits: 12; Hours: 4
3. Instructor’s or course coordinator’s name: Dr. Vinay Arora
4. Specific course information
a. brief description of the content of the course (catalog description)
Course Objective: To facilitate the students learn and apply their earned skill set for
the system development life cycle in Computer Engineering. As a part of a team, the
students will make a project, which emphasizes hands-on experience, and integrates
analytical, design, and development skills. The idea is to provide an opportunity to the
students to apply what they have learned throughout the course of graduate program by
undertaking a specific problem.

Course Description: This course is taken by the students who are doing their alternate
semester here at CSED Thapar, instead of opting project semester at some software
company or research institute. Capstone Project is increasingly interdisciplinary, and
requires students to function on multidisciplinary teams. It is the process of devising a
system, component or process to meet desired needs. It is a decision-making process,
in which the basic sciences, mathematics, and the engineering are applied to convert
resources optimally to meet the stated needs. It typically includes both analysis and
synthesis performed in an iterative cycle. As part of their design experience, students
have an opportunity to define and determine the problem and its scope. The project
demonstrates that students have adequate exposure to design, as defined, in engineering
contexts. The program must clearly demonstrate where standards and constraints are
taught and how they are integrated into the design component of the project. Each group
will have 2-3 students, with one team leader. Team lead is having an additional
responsibility for maintaining the daily diary. Each Group will work under mentorship
of a faculty supervisor as assigned by the department.
Each group must meet the assigned supervisor till the end of the semester (record of
attendance will be maintained), as per the time slot which will be provided to them by
the respective supervisor. This is mandatory requirement for the fulfillment of the
attendance as well as the successful completion of the project. The faculty supervisor
of the project will continuously judge the development of the workings of the assigned
groups.

b. prerequisites
● None
c. indicate whether a required elective or selected elective (as per Table 5-1) course in
the program
● Required
5. Specific goals for the course
a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Develop skills necessary for time management, reporting and carrying out projects
within an organization/industry.
● Design, develop, debug, document, and deliver automated solutions for real world
problems and learn to work in a team environment.
● Develop technical report writing and verbal communication skills.
● Experience contemporary computing systems, tools and methodologies and apply
experimental and data analysis techniques to the software projects.
● Apply interdisciplinary fundamentals to the software projects taking into account
professional and ethical issues.
Course Syllabi: UCS801 SOFTWARE PROJECT MANAGEMENT (L: T: P :: 3: 0: 2)

1. Course number and name: UCS801; Software Project Management

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Inderveer Chana
4. Text book (title, author, and year)
 Hughes B. and Cotterell M. and Mall R., Software Project Management, Tata McGraw
Hill (2011) 5th Ed.
 Pressman R., A practitioner’s Guide to Software Engineering, Tata McGraw Hill
(2014) 7th Ed.
5. Reference Books (author, title, publisher and year):
 Stellman A., Greene J., Applied Software Project Management, O'Reilly Media, Inc.
(2008).
 Futrell T. R., Shafer F. D. and Shafer I. L., Quality Software Project Management,
Prentice Hall (2002).

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction to Project Management: The characteristics of software projects,
Objectives of project management: time, cost and quality, Basics of Project
Management, Stakeholders, Stages of Project, The Feasibility Study, Cost-benefit
Analysis, Planning, Project Execution, Project and Product Life Cycles, Project
Management Knowledge areas, Project Management Tools & Techniques, Project
success factors, role of project manager.
Project Management and Planning: System view of project management,
Understanding organizations, stakeholder’s management, project phases and project’s
life cycles. Introduction to Agile software, Why planning is necessary, Iterative steps
for planning, Project Plan documentation methods, Software Requirement
Specification.
Measurement and Control: Measurements for project monitoring, what and when to
measure, Plan versus Control, managing the plan, The Deadline Effect. Reviews,
feedback and reporting mechanisms, revisiting the plan.
Project Scope Management: Scope Planning & Scope management plans, Function
point calculation, Scope definitions & project scope statement, Work Breakdown
Structure (WBS), WBS dictionary, scope verification, scope control.
Time Management: Project time management, activities sequencing, network
diagrams, activity recourse estimation, activity duration estimation, schedule
development, Gantt Charts, Critical path method, Programme evaluation & review
technique (PERT) and CPM, concept of slack time, schedule control.
Project Cost management: Basis principles of cost management, Cost estimating,
type of cost estimate, cost estimate tools & techniques, COCOMO, Putnam/ SLIM
model Estimating by Analogy, cost budgeting, cost control, earned value management,
project portfolio management
 Project Quality Management: Quality Planning, quality Assurance, Quality control,
Tool &techniques for quality control, Pareto Analysis, Six Sigma, CMM, ISO
Standards, Juran Methodology

Project Human Resource Management: Human resource planning, project

organizational charts, responsibility assignment metrics, acquiring project team,
resource assignment, resource loading, resource levelling, Different team structures
developing project teams.
Project Communication Management: Communication Planning, Performance
reporting, managing stakeholders, improving project communication
Project risk management: Risk Management planning, common sources of risk, risk
identification, risk register, qualitative risk analysis, using probability impact matrixes,
expert judgement, qualitative risk analysis, decision trees & expected monetary value,
simulation, sensitivity analysis, risk response planning, risk monitoring & control.
Project procurement management: Procurement management plans, contract
statement of work, planning contracts, requesting seller responses, selecting sellers,
administrating the contract, closing the contract
Software Configuration Management: Why versions exist, why retain versions, SCI,
Releases vs. version. Change Control and Management.
Laboratory work: Using Function Point calculation tools for estimation, comparing
with COCOMO estimates, Implementation of various exercises using PERT, CPM
methods, Preparing schedule, resource allocation etc. using MS Project or Fissure. sim
or VENSIM can also be used, Preparing an RMMM Plan for a case study, Preparing
Project Plan for a Software Project for Lab Project or case study. Exploring about
PMBOK (Project Management Body of Knowledge) and SWEBOK(Software
Engineering Body of Knowledge) from related website, Implementation of software
project management concepts using related tools and technologies.

b. prerequisites
● Software Engineering
c. indicate whether a required elective or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Describe and apply basic concepts related to software project planning, scope and
feasibility.
● Analyze various project estimation techniques.
● Comprehend the concept of team structure and project communication
management.
● Acquire knowledge about quality assurance, quality control, and risk management.
● Describe various project management activities such as tracking, project
procurement, configuration management, monitoring.
 Course Syllabi: UCS806 ETHICAL HACKING (L: T: P :: 3: 0: 2)

1. Course number and name: UCS806; ETHICAL HACKING

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. A.K Verma
4. Text book (title, author, and year)
 Simpson T. M., Backman K., Corley J., Hands-On Ethical Hacking and Network
Defense, Delmar Cengage Learning (2011) 2nd ed.
 Fadia A. and Zacharia M., Network intrusion alert: an ethical hacking guide to
intrusion detection, Boston, MA: Thomas Course Technology (2008).
5. Reference book (title, author, and year)
 Mathew T., Ethical Hacking, OSB Publication (2003).
 McClure S., Scambray J. and Kurtz G., Hacking Exposed 7: Network Security Secrets
and Solutions, McGrawHill (2012) 7thEdition
6. Specific course information:
a. brief description of the content of the course (catalog description)
Introduction: Understanding the importance of security, Concept of ethical hacking
and essential Terminologies-Threat, Attack, Vulnerabilities, Target of Evaluation,
Exploit. Phases involved in hacking
Footprinting: Introduction to footprinting, Understanding the information gathering
methodology of the hackers, Tools used for the reconnaissance phase.
Scanning: Detecting live systems-on the target network,- Discovering services running
listening on target systems, Understanding port scanning techniques, Identifying TCP
and LIDP services running on the target network, Understanding active and passive
fingerprinting..
System-Hacking-Aspect of remote password-guessing Role of-eavesdropping,
Various methods of password cracking, Keystroke Loggers, Understanding Sniffers,
Comprehending Active and Passive Sniffing, ARP Spoofing and Redirection, DNS and
IP Sniffing, HTTPS Sniffing.
Session Hijacking: Understanding Session Hijacking, Phases involved in Session
Hijacking, Types of Session Hijacking, and Session Hijacking Tools.
Hacking Wireless Networks: Introduction to 802.1I, Role of WEP, Cracking WEP
Keys, Sniffing Traffic, Wireless DOS attacks, WLAN Scanners, WLAN Sniffers,
Hacking Tools, Securing Wireless Networks.
Cryptography: Understand the use of Cryptography over the Internet through PKI,
RSA, MD5, Secure Hash Algorithm and Secure Socket Layer.
Laboratory Work: Lab Exercises including using scanning tools like IPEYE,
IPsecScan, SuperScan etc. and Hacking Tools likes Trinoo, TFN2K, Zombic, Zapper
etc.
b. prerequisites
● Computer Networks
c. indicate whether a required elective or selected elective (as per Table 5-1) course in
the program
● Required

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Review and summarization of scan, test, hack, and securing own system.
● Apply in depth knowledge and practical experience in current essential security
systems.
● Analysis of perimeter defenses work (no real network is harmed).
● Evaluation of intruder mechanism and securing a system.
● Synthesize Intrusion Detection policy, Social Engineering, DDoS attacks,
buffer Overflow and Virus Creation.
 Course Syllabi: UCS608: PARALLEL AND DISTRIBUTED COMPUTING
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS608; PARALLEL AND DISTRIBUTED COMPUTING

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Ms. Navneet
4. Text Books (author, title, publisher and year):
● Lin, C. and Snyder, L., Principles of Parallel Programming. USA, Addison-Wesley
(2009) 1st Edition.
● Grama, A., Gupta, A., Karypis, G. and Kumar. V., Introduction to Parallel Computing,
Addison Wesley (2003) 2nd Edition.
5. Reference book, title, author, and year
● Gaster, R., B., Howes, L., Kaeli, D., Mistry, P., and Schaa. D., Heterogeneous
Computing With Opencl. Morgan Kaufmann and Elsevier (2012) 2nd Edition.
● Mattson, T., Sanders, B., and Massingill. B., Patterns for Parallel Programming,
Addison-Wesley and ACM (2013) 1st Edition.
● Quinn, M., J., Parallel Programming in C with MPI and OpenMP, McGraw-Hill
(2004) 1st Edition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Parallelism Fundamentals: Scope and issues of parallel and distributed computing,
Parallelism, Goals of parallelism, Parallelism and concurrency, Multiple simultaneous
computations, Programming Constructs for creating Parallelism, communication, and
coordination. Programming errors not found in sequential programming like data races,
higher level races, lack of liveness.
Parallel Architecture: Architecture of Parallel Computer, Communication Costs,
parallel computer structure, architectural classification schemes, Multicore processors,
Memory Issues : Shared vs. distributed, Symmetric multiprocessing (SMP), SIMD,
vector processing, GPU, co-processing, Flynn’s Taxonomy, Instruction Level support
for parallel programming, Multiprocessor caches and Cache Coherence, Non-Uniform
Memory Access (NUMA)
Parallel Decomposition and Parallel Performance: Need for communication and
coordination/synchronization, Scheduling and contention, Independence and
partitioning, Task-Based Decomposition, Data Parallel Decomposition, Actors and
Reactive Processes, Load balancing, Data Management, Impact of composing multiple
concurrent components, Power usage and management. Sources of Overhead in
Parallel Programs, Performance metrics for parallel algorithm implementations,
Performance measurement, The Effect of Granularity on Performance Power Use and
Management, Cost-Performance trade-off;
Distributed Computing: Introduction: Definition, Relation to parallel systems,
synchronous vs asynchronous execution, design issues and challenges, A Model of
Distributed Computations , A Model of distributed executions, Models of
communication networks, Global state of distributed system, Models of process
communication.
 Communication and Coordination: Shared Memory, Consistency, Atomicity,
Message-Passing, Consensus, Conditional Actions, Critical Paths, Scalability, cache
coherence in multiprocessor systems, synchronization mechanism.
CUDA programming model: Overview of CUDA, Isolating data to be used by
parallelized code, API function to allocate memory on the parallel computing device,
API function to transfer data to parallel computing device, Concepts of Threads,
Blocks, Grids, Developing kernel function that will be executed by threads in the
parallelized part, Launching the execution of kernel function by parallel threads,
transferring data back to host processor with API function call.
Parallel Algorithms design, Analysis, and Programming: Parallel Algorithms,
Parallel Graph Algorithms, Parallel Matrix Computations, Critical paths, work and
span and relation to Amdahl’s law, Speed-up and scalability, Naturally parallel
algorithms, Parallel algorithmic patterns like divide and conquer, map and reduce,
Specific algorithms like parallel Merge Sort, Parallel graph algorithms, parallel shortest
path, parallel spanning tree, Producer-consumer and pipelined algorithms.
Laboratory work: To implement parallel programming using CUDA with emphasis
on developing applications for processors with many computation cores, mapping
computations to parallel hardware, efficient data structures, paradigms for efficient
parallel algorithms.
b. prerequisites
● Operating Systems, Computer Networks, Optimization Techniques, Numerical
Analysis
c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Apply the fundamentals of parallel and distributed computing including parallel
architectures and paradigms.
● Apply parallel algorithms and key technologies.
● Develop and execute basic parallel and distributed applications using basic
programming models and tools.
● Analyze the performance issues in parallel computing and trade-offs.
 Course Syllabi: UCS522 COMPUTER VISION (L: T: P :: 3: 0: 2)

1. Course number and name: UCS522 ; COMPUTER VISION

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Shailendra Tiwari
4. Text Books (author, title, publisher and year):
● Szeliski, R., Computer Vision: Algorithms and Applications, Springer-Verlag London
Limited (2011), 1st Edition.
● Forsyth, A., D. and Ponce, J., Computer Vision: A Modern Approach, Pearson
Education (2012) 2nd Edition.
5. Reference book, title, author, and year
● Hartley, R. and Zisserman, A., Multiple View Geometry in Computer Vision Cambridge
University Press (2003) 2nd Edition.
● Fukunaga, K., Introduction to Statistical Pattern Recognition, Academic Press,
Morgan Kaufmann (1990) 2nd Edition.
● Gonzalez, C., R. and Woods, E., R. Digital Image Processing, Addison- Wesley (2018)
4th Edition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Digital Image Formation and low-level processing: Overview and State-of-the-art,
Fundamentals of Image Formation, Transformation: Orthogonal, Euclidean, Affine,
Projective, etc; Fourier Transform, Convolution and Filtering, Image Enhancement,
Restoration, Histogram Processing.
Depth estimation and Multi-camera views: Perspective, Binocular Stereopsis:
Camera and Epipolar Geometry; Homography, Rectification, DLT, RANSAC, 3-D
reconstruction framework; Auto-calibration.
Feature Extraction: Edges - Canny, LOG, DOG; Line detectors (Hough Transform),
Corners - Harris and Hessian Affine, Orientation Histogram, SIFT, SURF, HOG,
GLOH, Scale-Space Analysis- Image Pyramids and Gaussian derivative filters, Gabor
Filters and DWT.
Image Segmentation: Region Growing, Edge Based approaches to segmentation,
Graph-Cut, Mean-Shift, MRFs, Texture Segmentation; Object detection.
Pattern Analysis: Clustering: K-Means, K-Medoids, Mixture of Gaussians,
Classification: Discriminant Function, Supervised, Un-supervised, Semi-supervised;
Classifiers: Bayes, KNN, ANN models; Dimensionality Reduction: PCA, LDA, ICA;
Non-parametric methods.
Motion Analysis: Background Subtraction and Modeling, Optical Flow, KLT, Spatio-
Temporal Analysis, Dynamic Stereo; Motion parameter estimation.
Shape from X: Light at Surfaces; Phong Model; Reflectance Map; Albedo estimation;
Photometric Stereo; Use of Surface Smoothness Constraint; Shape from Texture, color,
motion and edges.
Miscellaneous: Applications: CBIR, CBVR, Activity Recognition, computational
photography, Biometrics, stitching and document processing; Modern trends - super-
resolution; GPU, Augmented Reality; cognitive models, fusion and SR&CS.
 Laboratory Work: To implement various techniques and algorithms studied during
course.
b. prerequisites
● Operating Systems, Computer Networks, Optimization Techniques, Numerical
Analysis
c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective
7. Specific goals for the course
a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Understand the fundamental problems of computer vision.
● Implement various techniques and algorithms used in computer vision.
● Analyze and evaluate critically the building and integration of computer vision
algorithms and systems.
● Demonstrate awareness of the current key research issues in computer vision.
 Course Syllabi: UML501 MACHINE LEARNING (L: T: P :: 3: 0: 2)

1. Course number and name: UML501; MACHINE LEARNING

2. Credits and contact hours: Credits:4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Singara Singh
4. Text Books (author, title, publisher and year):
● Mitchell M., T., Machine Learning, McGraw Hill (1997) 1st Edition.
● Alpaydin E., Introduction to Machine Learning, MIT Press (2014) 3rd Edition.
5. Reference book, title, author, and year
● Bishop M., C., Pattern Recognition and Machine Learning, Springer-Verlag (2011) 2nd
Edition.
● Michie D., Spiegelhalter J. D., Taylor C. C., Campbell, J., Machine Learning, Neural
and Statistical Classification. Overseas Press (1994).

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Well-Posed learning problems, Basic concepts, Designing a learning
system, Issues in machine learning. Types of machine learning: Learning associations,
Supervised learning (Classification and Regression Trees, Support vector machines),
Unsupervised learning (Clustering), Instance-based learning (K-nearest Neighbor,
Locally weighted regression, Radial Basis Function), Reinforcement learning
(Learning Task, Q-learning, Value function approximation, Temporal difference
learning).
Decision Tree Learning: Decision tree representation, appropriate problems for
decision tree learning, Univariate Trees (Classification and Regression), Multivariate
Trees, Basic Decision Tree Learning algorithms, Hypothesis space search in decision
tree learning, Inductive bias in decision tree learning, Issues in decision tree learning.
Bayesian Learning: Bayes theorem and concept learning, Bayes optimal classifier,
Gibbs algorithms, Naive Bayes Classifier, Bayesian belief networks, The EM
algorithm.
Artificial Neural Network: Neural network representation, Neural Networks as a
paradigm for parallel processing, Linear discrimination, Pairwise separation, Gradient
Descent, Logistic discrimination, Perceptron, Training a perceptron, Multilayer
perceptron, Back propagation Algorithm. Recurrent Networks, Dynamically
modifying network structure.
Genetic Algorithms: Basic concepts, Hypothesis space search, Genetic programming,
Models of evolution and learning, Parallelizing Genetic Algorithms.
Inductive and Analytical Learning: Learning rule sets, Comparison between
inductive and analytical learning, Analytical learning with perfect domain theories:
Prolog-EBG. Inductive-Analytical approaches to learning, Using prior knowledge to
initialize hypothesis (KBANN Algorithm), to alter search objective (TangentProp and
EBNN Algorithm), to augment search operators (FOCL Algorithm).
Design and Analysis of Machine Learning Experiments: Guidelines for machine
learning experiments, Factors, Response, and Strategy of experimentation, Cross-
Validation and Resampling methods, measuring classifier performance, Hypothesis
testing, Assessing a classification algorithm's performance, Comparing two
 classification algorithms, Comparing multiple algorithms: Analysis of variance,
Comparison over multiple datasets.
Laboratory Work: It is concerned with the design, analysis, implementation, and
applications of programs that learn from experience. Learning algorithms can also be
used to model aspects of human and animal learning.

b. prerequisites
● Operating Systems,ComputerNetworks, Optimization
Techniques,NumericalAnalysis
c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to
● Analyze methods and theories in the field of machine learning and provide an
introduction to the basic principles, techniques, and applications of machine
learning, classification tasks, decision tree learning.
● Apply decision tree learning, Bayesian learning and artificial neural network in
real world problems.
● Understand the use of genetic algorithms and genetic programming.
● Apply inductive and analytical learning with related domain theories.
● Compare different learning models and algorithms and utilize existing machine
learning algorithms to design new algorithms.
Course Syllabi: UCS523 COMPUTER & NETWORK SECURITY (L: T: P :: 3: 0: 2)

1. Course number and name: UCS523; COMPUTER & NETWORK SECURITY

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Hemant Gianey
4. Text Books (author, title, publisher and year):
● Stallings, W., Network Security Essentials, Prentice Hall (2017) 6th Edition.
● Cheswick, R., W., Bellovin, M., S., and Rubin, D., A., Firewalls and Internet Security,
Addison-Wesley Professional (2003) 2nd Edition.
5. Reference book, title, author, and year
● Graves, K., Certified Ethical Hacking Study Guide,Sybex (2010) 1st Edition.
● Stallings, W., Cryptography and Network Security, Prentice Hall (2013), 6th Edition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Security Attacks, Security Services, Security Mechanisms and
Principles, Security goals, Malicious software, Worms, Viruses, Trojans, Spyware,
Botnets
Basic of Cryptography: Symmetric and asymmetric cryptography, cryptographic
hash functions, authentication and key establishment, Message Authentication Codes
(MACs), digital signatures, PKI.
Security Vulnerabilities: DoS attacks, Buffer Overflow, Race Conditions, Access
Control Problems, Spoofing and Sniffing attacks, ARP Poisoning, Social Engineering
and countermeasures.
Internet Security: TCP/IP Security, Secure Sockets Layer (SSL), Transport Layer
Security (TLS), HTTPS, Secure Shell (SSH), IPsec, Email Security, DNS Security,
DNSSEC, Authentication Protocols
Web Security: Phishing attack, SQL Injection, Securing databases and database
access, Cross Site Scripting Attacks, Cookies, Session Hijacking, E-commerce
security
System Security: Firewalls, Types: Packet filter (stateless, stateful), Application layer
proxies, Firewall Location and Configurations, Intruders, Intrusion Detection System,
Anomaly and misuse detection.
Wireless Network Security: IEEE 802.11i Wireless LAN Security, Wireless
Application Protocol Overview, Wireless Transport Layer Security, WAP End-to-End
Security
Laboratory work: Insert malicious shell code into a program file and check its
malicious or benign status, create Client Server program to send data across systems
as two variants clear text data and encrypted data with different set of encryption
algorithms, demonstrate Buffer Overflow and showcase EIP and other register status,
perform ARP poisoning, SQL Injection and demonstrate its countermeasure methods,
implement stateful firewall using IPTables, showcase different set of security protocol
implementation of Wireless LAN.

b. prerequisites
 ● Operating Systems, Computer Networks, Optimization Techniques, Numerical
Analysis
c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to
● Comprehend and implement various cryptographic algorithms to protect the
confidential data.
● Identify network vulnerabilities and apply various security mechanisms to protect
networks from security attacks.
● Apply security tools to locate and fix security leaks in a computer
network/software.
● Secure a web server and web application.
● Configure firewalls and Intrusion Detection System.
Course Syllabi: UCS524 ENGINEERING SOFTWARE AS A SERVICE (L: T: P :: 3: 0: 2)

1. Course number and name: UCS524 ; ENGINEERING SOFTWARE AS A SERVICE

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Anoop Jacob Thomas
4. Text Books (author, title, publisher and year):
● Fox, A., Patterson, D. and Joseph, S., Engineering Software as a Service: An Agile
Approach Using Cloud Computing (2013), 1st Edition.

5. Specific course information

a. brief description of the content of the course (catalog description)
Introduction to SaaS and Agile Development: Introduction, Software Development
Processes: Plan and Document, Software Development Processes: The Agile
Manifesto, Service Oriented Architecture, Software as a Service, Cloud Computing,
Beautiful vs. Legacy Code, Productivity: Conciseness, Synthesis, Reuse and Tools
The Architecture of SaaS Applications: Client-Server Architecture,
Communication---HTTP and URIs, Template Views,3-Tier Architecture & Horizontal
Scaling, Model-View-Controller Architecture, Active Record for Models, Routes,
Controllers, and REST, Representation---HTML and CSS
SaaS Framework: Introduction to Ruby: Overview and Three Pillars of Ruby,
Classes, Methods, and Inheritance, Metaprogramming, Blocks: Iterators, Functional
Idioms, and Closures, Mix-ins and Duck Typing, Make Your Own Iterators Using
Yield, Fallacies and Pitfalls, Idiomatic Language Use
SaaS Framework: Introduction to Rails: Rails Basics: From Zero to CRUD,
Databases and Migrations, Models: Active Record Basics, Controllers and Views,
Debugging, Form Submission: New and Create, Redirection and the Flash, Finishing
CRUD: Edit/Update and Destroy, Designing for SOA, Perspectives on SaaS and SOA
SaaS Framework: Advanced Rails: DRYing Out MVC: Partials, Validations and
Filters, Single Sign-On and Third-Party Authentication, Associations and Foreign
Keys, Through-Associations, RESTful Routes for Associations, Composing Queries
With Reusable Scopes
SaaS Client Framework: JavaScript Introduction: JavaScript: The Big Picture,
Client-Side JavaScript for Ruby Programmers, Functions and Constructors, The
Document Object Model and jQuery, Events and Callbacks, AJAX, Testing JavaScript
and AJAX, Single-Page Apps and JSON APIs
Requirements: BDD and User Stories: Introduction to Behavior-Driven Design and
User Stories, Points, Velocity, and Pivotal Tracker, SMART User Stories, Lo-Fi User
Interface Sketches and Storyboards
Testing: Test-Driven Development: A RESTful API and a Ruby Gem, FIRST, TDD,
and Red--Green—Refactor, Seams and Doubles, Expectations, Mocks, Stubs, Setup,
Fixtures and Factories, Implicit Requirements and Stubbing the Internet, Coverage
Concepts and Unit vs. Integration Tests, Other Testing Approaches and Terminology
Maintenance: Legacy, Refactoring, and Agile: Exploring a Legacy Codebase,
Establishing Ground Truth With Characterization Tests, Comments, Metrics, Code
Smells, and SOFA, Method-Level Refactoring, The Plan-And-Document Perspective
 Laboratory Work: This includes introduction and assignments related to Ruby on
Rails, Ruby, ruby gems, jQuery and configuring database.
b. prerequisites
● Operating Systems Computer Networks, Optimization Techniques, Numerical
Analysis
c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective

6. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to
● Explain the Agile Software Development concepts, Software as a Cloud Service
and SaaS architecture.
● Construct a SaaS Application using Model–View–Controller (MVC) framework.
● Design SaaS Client Framework using Java Script.
● Demonstrate the use of Behavior Driven Design (BDD) and User Stories for
analyzing the requirements and designing the solution of Web Service.
● Apply Test Driven Development (TDD) approach to test the expected behavior of
the functionality.
 Course Syllabi: UCS631 GPU COMPUTING (L: T: P :: 3: 0: 2)

1. Course number and name: UCS631; GPU COMPUTING

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Mr. Rohit Ahuja
4. Text Books (author, title, publisher and year):
● Sanders, J. and Kandrot, E., CUDA by Example: An Introduction to General-Purpose
GPU Programming, Addison-Wesley Professional (2012) 4th Edition.
● Kirk, D. and Hwu, M., W., Programming Massively Parallel Processors: A Hands-on
Approach. Morgan Kaufmann (2016) 3rd Edition.
5. Reference book, title, author, and year
● Hwu, M., W., A GPU Computing Gems Emerald Edition (Applications of GPU
Computing Series), Morgan Kaufmann (2011) 1st Edition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Heterogeneous Parallel Computing, Architecture of a Modern GPU,
Speeding Up Real Applications, Parallel Programming Languages and Models.
History of GPU Computing: Evolution of Graphics Pipelines, The Era of Fixed-
Function Graphics Pipelines, Evolution of Programmable Real-Time Graphics, Unified
Graphics and Computing Processors, GPGPU, Scalable GPUs, Recent Developments,
Future Trends.
Introduction to Data Parallelism and CUDA C: Data Parallelism, CUDA Program
Structure, A Vector Addition Kernel, Device Global Memory and Data Transfer,
Kernel Functions and Threading.
Data-Parallel Execution Model: Cuda Thread Organization, Mapping Threads to
Multidimensional Data, Matrix-Matrix Multiplication—A More Complex Kernel,
Synchronization and Transparent Scalability, Assigning Resources to Blocks, Thread
Scheduling and Latency Tolerance.
CUDA Memories: Importance of Memory Access Efficiency, CUDA Device Memory
Types, A Tiled Matrix – À Matrix Multiplication Kernel, Memory as a Limiting Factor
to Parallelism.
An Introduction to OpenCL: Data Parallelism Model, Device Architecture, Kernel
Functions, Device Management and Kernel Launch, Electrostatic Potential Map in
OpenCL.
Parallel Programming with OpenACC: OpenACC Versus CUDA C, Execution
Model, Memory Model, Basic OpenACC Programs, Parallel Construct, Loop
Construct, Kernels Construct, Data Management, Asynchronous Computation and
Data Transfer.
Laboratory work: Practice programs using CUDA, OpenCL and OpenACC.
b. prerequisites
● Software Engineering, Computer Networks, Operating Systems
c. indicate whether a required elective or selected elective (as per Table 5-1) course in
the program
● Selected Elective
7. Specific goals for the course
a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Comprehend commonly used terms in parallel computing.
● Understand common GPU architectures and Programming Models.
● Implement algorithms efficiently for common application kernels.
● Develop efficient parallel algorithms to solve given problems.
 Course Syllabi: UCS632 3D MODELLING & ANIMATION (L: T: P :: 3: 0: 2)

1. Course number and name: UCS632; 3D MODELLING & ANIMATION

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Shailendra Tiwari
4. Text Books (author, title, publisher and year):
● House, H., D. and Keyser, C., J., Foundations of Physically Based Modeling and
Animation, CRCPress (2017) 1st Edition.
● Chopine, A., 3D Art Essentials: The Fundamentals of 3D Modeling, Texturing, and
Animation, Focal Press (2011) 1stEdition.
● Zeman, B., N., Essential Skills for 3D Modeling, Rendering, and Animation, A K
Peters/CRC Press (2017) 1st Edition.
5. Reference book, title, author, and year
● Villar, O., Learning Blender: A Hands-On Guide to Creating 3D Animated Characters,
Addison Wesley (2017) 2nd Edition.
● Kerlow, I., The Art of 3D Computer Animation and Effects, Wiley, (2009) 4th Edition.
● Flavell, L., Beginning Blender: Open Source 3D Modelling, Animation, and Game
Design, Apress, (2010) 1stEdition.
● Boardman, T., 3dsmax 7 Fundamentals, New Riders, (2005) 1stEdition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Definition of Computer-based Animation, Basic Types of Animation:
Real Time,Non-real-time, Definition of Modelling, Creation of 3D objects. Exploring
the Max Interface, Controlling & Configuring the Viewports, Customizing the Max
Interface & Setting Preferences, Working with Files, Importing & Exporting, Selecting
Objects & Setting Object Properties, Duplicating Objects, Creating & Editing Standard
Primitive & extended Primitives objects, Transforming objects, Pivoting, aligning etc.
2D Splines & Shapes& compound object: Understanding 2D Splines & shape,
Extrude & Bevel 2D object to 3D, Understanding Loft & terrain, Modeling simple
objects with splines, Understanding morph, scatter, conform, connect compound
objects, blobmesh, Boolean,Proboolean&procutter compound object.
3D Modelling: Modeling with Polygons, using the graphite, working with XRefs,
Building simple scenes, Building complex scenes with XRefs, using assets tracking,
deforming surfaces & using the mesh modifiers, modeling with patches & NURBS.
Keyframe Animation: Creating Keyframes, Auto Keyframes, Move & Scale
Keyframe on the timeline, Animating with constraints &simple controllers, animation
Modifiers & complex controllers, function curves in the track view, motion mixer etc..
Simulation & Effects: Bind to Space Warp object, Gravity, wind, displace force
object, deflectors, FFD space warp, wave, ripple, bomb, Creating particle system
through PArray, understanding particle flow user interface, how to particle flow works,
hair& fur modifier, cloth & garment maker modifiers etc.
Lighting & Camera: Configuring & Aiming Cameras, camera motion blur, camera
depth of field, camera tracking, using basic lights & lighting Techniques, working with
advanced lighting, Light Tracing, Radiosity, video post, mental ray lighting etc.
 Texturing with Max: Using the material editor & the material explorer, creating&
applying standard materials, adding material details with maps, creating compound
materials &material modifiers, unwrapping UVs & mapping texture, using atmospheric
& render effects etc.
Rendering with V-Ray: V-ray light setup, V-ray rendering settings, HDRI
Illumination, Fine-tuning shadows, Final render setting etc.
Laboratory Work: This course covers beginner to intermediate 3D Modeling and
Animation. In this Lab the students will be able to model the 3D character and objects,
its UV Mapping, Texture Painting, Rigging, and Animation. Evaluation will be mainly
via projects and assignments taking a creative approach to expressive 3D modelling
and Animation.
b. prerequisites
● Software Engineering, Computer Networks, Operating Systems

c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Describe Computer-based animation using 3D modeling tool (Blender/ Max).
● Develop the practical skills in 2D Splines, Shapes & compound objects.
● Illustrate the theoretical and practical aspects of 3D Modeling, Keyframe
Animation, Simulation and Effects.
● Demonstrate different types of animation and its effects in the real world.
● Analyse the different processes, post processes involved in computer animation
field.
Course Syllabi: UCS633 DATA ANALYTICS AND VISUALIZATION (L: T: P :: 3: 0: 2)

1. Course number and name: UCS633; DATA ANALYTICS AND VISUALIZATION

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Sushma Jain
4. Text Books (author, title, publisher and year):
● Han, J., Kamber, M. and Pei, J., Data Mining Concepts and Techniques, Morgan
Kaufmann (2011) 3rd Edition
● Peng, D., R., R Programming for Data Science, Lulu.com (2012).
5. Reference book, title, author, and year
● Hastie, T., Tibshirani, R. and Friedman, J., The Elements of Statistical Learning,
Springer (2009) 2nd Edition.
● Simon, P., The Visual Organization: Data Visualization, Big Data, and the Quest for
Better Decisions, John Wiley & Sons (2014).

6. Specific course information

a. brief description of the content of the course (catalog description)
Data Representation: Data Objects and Attribute Types: Nominal, Binary, Ordinal,
Numeric, Discrete and Continuous, Types of data: Record, Temporal, Spatial
Temporal, Graph, Unstructured and Semi structured data, Basic Statistical Descriptions
of Data.
Introduction to Data Analysis: Probability and Random Variables, Correlation,
Regression.
Data Analysis Pipeline: Data pre-processing- Attribute values, Attribute
transformation, Sampling, Dimensionality reduction: PCA, Eigen faces,
Multidimensional Scaling, Non-linear Methods, Graph-based Semi-supervised
Learning, Representation Learning Feature subset selection, Distance and Similarity
calculation.
Data Mining Techniques for Analysis: Classification: Decision tree induction, Bayes
classification, Rule-based classification, Support Vector Machines, Classification
Using Frequent Patterns, k-Nearest-Neighbor, Fuzzy-set approach Classifier,
Clustering:K-Means, k-Medoids, Agglomerative versus Divisive Hierarchical
Clustering Distance Measures in Algorithmic Methods, Mean-shift Clustering
Visualization:Traditional Visualization, Multivariate Data Visualization, Principles of
Perception, Color, Design, and Evaluation, Text Data Visualization, Network Data
Visualization, Temporal Data Visualization and visualization Case Studies.
Laboratory work: Implementation of various data analytics techniques such as
classification clustering on real world problems using R.

b. prerequisites
 Software Engineering, Computer Networks, Operating Systems

c. indicate whether a required elective or selected elective (as per Table 5-1) course
in the program
● Selected Elective
7. Specific goals for the course
a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Analyze and extract features of complex datasets.
● Evaluate and visualize inter-dependencies among variables in dataset.
● Apply techniques for classification and clustering in datasets.
● Develop and validate models for real life datasets.
 Course Syllabi: UCS634 SECURE CODING (L: T: P :: 3: 0: 2)

1. Course number and name: UCS634; SECURE CODING

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Maninder Singh
4. Text Books (author, title, publisher and year)::
● Howard, M. and LeBlanc, D., Writing Secure Code, Howard, Microsoft Press (2002)
2nd Edition.
● Deckard, J., Buffer Overflow Attacks: Detect, Exploit, Syngress (2005) 1st Edition.
5. Reference book, title, author, and year.
● Swiderski, F. and Snyder, W., Threat Modeling, Microsoft Professional, (2004) 1st
Edition.
● Salt, C., J., SQL Injection Attacks and Defence, Elsevier (2012), 2nd Edition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Security, CIA Triad, Viruses, Trojans, and Worms, Security Concepts-
exploit, threat, vulnerability, risk, attack.
Decipher journey starting from FQDN to html page getting served to browser,
Authoritative reply, revisit layer 2 and layer 3 of TCP/IP, DNS poisoning, ARP
poisoning, C language obsfuscation. ARP poisoning and its countermeasures. Buffer
Overrun- Stack overrun, Heap Overrun, Array Indexing Errors, Format String Bugs,
PE Code injection.
Malware Terminology: Rootkits, Trapdoors, Botnets, Key loggers, Honeypots.
Active and Passive Security Attacks. IP Spoofing, Tear drop, DoS, DDoS, XSS, SQL
injection, Smurf, Man in middle, Format String attack.
Types of Security Vulnerabilities: buffer overflows, Invalidated input, race
conditions, access-control problems, weaknesses in authentication, authorization, or
cryptographic practices. Access Control Problems.
Need for secure systems: Proactive Security development process, Secure Software
Development Cycle (SSDLC) , Security issues while writing SRS, Design phase
security, Development Phase, Test Phase, Maintenance Phase, Writing Secure Code –
Best Practices SD3 (Secure by design, default and deployment), Security principles and
Secure Product Development Timeline.
Threat modelling process and its benefits: Identifying the Threats by Using Attack
Trees and rating threats using DREAD, Risk Mitigation Techniques and Security Best
Practices. Security techniques, authentication, authorization. Defence in Depth and
Principle of Least Privilege.
Secure Coding Techniques: Protection against DoS attacks, Application Failure
Attacks, CPU Starvation Attack.
Database and Web-specific issues: SQL Injection Techniques and Remedies, Race
conditions, Time of Check Versus Time of Use and its protection mechanisms.
Validating Input and Interprocess Communication, Securing Signal Handlers and File
Operations. XSS scripting attack and its types – Persistent and Non persistent attack
XSS Countermeasures and Bypassing the XSS Filters.
 Laboratory Work: In this Lab, the student will be able to practically understand how
does all the security attacks has happened, as well as learn to recognize and remove
common coding errors that lead to vulnerabilities. This lab also gives an outline of the
techniques for developing a secure application code that consists of using network
monitoring tools, implementing different types of attacks and some protection schemes.
Evaluation will be mainly based on projects and assignments.
b. prerequisites
● Software Engineering, Computer Networks, Operating Systems

c. indicate whether a required elective or selected elective (as per Table 5-1)
course in the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to:
● Implement ARP poisoning attack and demonstrate countermeasure against these
for different operating environments.
● Implement DNS poisoning attack and demonstrate authoritative reply in this
context.
● Implement PE Code injection and demonstrate control hijacking via EIP
manipulation
● Demonstrate skills needed to deal with common programming errors and develop
secure applications.
● Demonstrate client side attacks and identify nature of threats to software and
incorporate secure coding practices throughout the planning and development of
software product.
● Demonstrate SQL, XSS attack and suggest countermeasures for the same.
Course Syllabi: USE401 SOFTWARE METRICS AND QUALITY MANAGEMENT (L:
T: P :: 3: 0: 2)

1. Course number and name: USE401; Software Metrics And Quality Management
2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Harkiran Kaur
4. Text Books (author, title, publisher and year):
● Horch, W., J., Practical Guide to Software Quality Management (Artech House
Computing Library), Artech House Publishers (2003) 2nd Edition.
● Weinberg, M., G., Quality Software Management, Volume 1: Systems Thinking, Dorset
House Publishing (2011).
5. Reference book, title, author, and year
● Kan, H., S., Metrics and Models in Software Quality Engineering, Addison-Wesley
Professional (2002) 2nd Edition.
● Jones, C., Applied Software Measurement, McGraw Hill Production (2008) 3rd Edition.

6. Specific course information

a. brief description of the content of the course (catalog description)
Software Metrics: Measurement in software engineering, software metrics, Metrics
data collection and analysis.
Measuring internal product attributes: Aspects of software size, length,
functionality and complexity, measuring structure, types of structural measures,
control-flow structure, and modularity and information flow attributes, data structures.
Measuring external product attributes: Modeling software quality, software
reliability, software reliability problem, parametric reliability growth models,
predictive accuracy, recalibration of software-reliability growth predictions,
importance of operational environment, and wider aspects of software reliability.
Metrics for object-oriented systems and component-based system: object-oriented
metrics and its characteristics various object-oriented, MOOD metrics; component-
based metrics and its characteristics and various component-based suites.
Dynamic Metrics: Runtime Software Metrics, Extent of Class Usage, Dynamic
Coupling, Dynamic Cohesion, and Data Structure Metrics.
Software Quality: Concepts of software quality, software quality control and software
quality assurance, evolution of SQA, major SQA activities and issues, zero defect
software.
Software Quality Assurance: SQA techniques; Management review process,
technical review process, walkthrough, software inspection process, configuration
audits, and document verification.
Error Reporting, Trend Analysis and Corrective Action: Identification, Analysis
and Correction of defect, implementation of correction, regression testing;
Categorization of defect w.r.t development phases; Error quantity, error frequency,
program unit complexity, compilation frequency; Corrective action and documenting
the corrective action, periodic review of actions taken.
Case Studies: CASE tools, Quality management standards, Quality standards with
emphasis on ISO approach, Capability Maturity Models-CMM and CMMI, TQM
Models, Bootstrap methodology, The SPICE project, ISO/IEC 15504, Six Sigma
 Concept for Software Quality.
Laboratory Work: To Work on small projects, build metrics and analyze, check the
quality of the projects and do a comparative study with other projects
b. prerequisites
● Software Engineering, Computer Networks, Operating Systems

c. indicate whether a required elective or selected elective (as per Table 5-1)
course in the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction
After the completion of the course the student will be able to
● Acquire basic knowledge of Software quality models.
● Exemplify Quality measurement and metrics, Quality plan and implementation
● Articulate Quality control and reliability of quality process and Quality
management system models
● Articulate Complexity metrics and Customer Satisfaction and International quality
standards.
● Control and manage the project and processes, apply configuration management on
the basis of collected metrics.
 Course Syllabi: UCS641 CLOUD COMPUTING (L: T: P :: 3: 0: 2)

1. Course number and name: UCS641; CLOUD COMPUTING

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Sharad Saxena
4. Text Books (author, title, publisher and year):
● Buyya K, R., Broberg J. and Goscinski M. A., Cloud Computing: Principles and
paradigms, MIT Press (2011) 4th ed.
● Miller M., Cloud Computing, Que Publishing (2008) 1st ed.
● Puttini R. and Mahmood Z., Cloud Computing: Concepts, Technology & Architecture,
Service Tech press (2013) 1st ed.
a. other supplemental materials
● Nil.
5. Reference Book, title, author, and year
● Velte A., Velte T., and Elsenpeter R., Cloud Computing: A practical Approach, Tata
McGrawHill (2009) 1sted.
● Hurwitz J., Bllor R., Kaufman M. and Halper F., Cloud Computing for dummies (2009)
1sted.
b. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction and Evolution of Computing Paradigms: Overview of Existing
Hosting Platforms, Cluster Computing, Grid Computing, Utility Computing,
Autonomic Computing, Green Computing, Cloud Computing, history and evolution,
practical applications of cloud computing for various industries, IoT, economics and
benefits of cloud computing, spot markets, pricing models, Supercomputing-on-
demand.
Cloud Issues and Challenges: Cloud computing issues and challenges like Security,
Elasticity, Resource management and Scheduling, QoS (Quality of Service) and
Resource Allocation, Cost Management, Big Data, Pre-reservation and Cloud bursting.
Data Center: Classic Data Center, Virtualized Data Center (Compute, Storage,
Networking and Application), Business Continuity in VDC.
Cloud Computing Architecture: Cloud Architecture model, Types of Clouds: Public
Private & Hybrid Clouds, Cloud based services: Iaas, PaaS and SaaS.
Classification of Cloud Implementations: Amazon Web Services, The Elastic
Compute Cloud (EC2), The Simple Storage Service (S3), The Simple Queuing
Services (SQS), Google AppEngine - PaaS, Windows Azure, Aneka, Hadoop, A
Comparison of Cloud Computing Platforms.
Virtualization: Virtualization, Advantages and disadvantages of Virtualization, Types
of Virtualization: Resource Virtualization i.e. Server, Storage and Network
virtualization, Migration of processes, VMware vCloud – IaaS
Cloud based Data Storage: Introduction No-SQL databases,Map- Reduce framework
for Simplified data processing on Large clusters using Hadoop, Design of data
 applications based on Map Reduce in Apache Hadoop, Task Partitioning, Data
partitioning, Data Synchronization, Distributed File system, Data Replication , Shared
access to weakly consistent to data stores.
Laboratory work: To implement Cloud, Apache and Hadoop framework and related
services. To understand various concepts practically about virtualization, data
storage.To implement few algorithms with the help of MapReduce and some high level
language.
b. prerequisites or co-requisites
● Numerical Analysis, Advanced Data Structures and Algorithms, Software
Engineering
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Explain the basic concepts along with evolution and features of cloud computing.
● Demonstrate the concept of existing cloud paradigms and platforms.
● Classify the issues of cloud computing in various cloud models.
● Apply the knowledge of virtualization through different virtualization technologies.
● Apply the concept of Map reduce framework using SQL and NO SQL databases.
Course Syllabi: UCS642 AUGMENTED AND VIRTUAL REALITY (L: T: P :: 3: 0: 2)

1. Course number and name: UCS642; AUGMENTED AND VIRTUAL REALITY

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Jhilik Bhattacharya
4. Text Books (author, title, publisher and year):
● Doug A. B., Kruijff E., LaViola J. J. and Poupyrev I. , 3D User Interfaces: Theory
and Practice , Addison-Wesley (2005,2011p) 2nded.
● Parisi T., Learning Virtual Reality, O’Reilly (2016) 1st ed.
● SchmalstiegD. and Hollerer T., Augmented And Virtual Reality, Addison-
Wesley(2016).
a. other supplemental materials
● Nil.
5. Reference Book, title, author, and year
● Whyte J., Virtual Reality and the Built Environment, Architectural Press (2002).
● Aukstakalnis S., Practical Augmented Reality: A Guide to the Technologies,
Applications, and Human Factors for AR and VR, Addison-Wesley (2016).
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction of Virtual Reality: Fundamental concept and components of Virtual
Reality, primary features and present development on Virtual Reality
Multiple Modals of Input and Output Interface in Virtual Reality: Input -- Tracker,
Sensor, Digital Glove, Movement Capture, Video-based Input, 3D Menus &
3DScanner etc. Output -- Visual /Auditory / Haptic Devices
Visual Computation in Virtual Reality: Fundamentals of computer graphics,
software and hardware technology on stereoscopic display, advanced techniques in
CG: Management of large scale environments & real time rendering
Environment Modeling in Virtual Reality: Geometric Modeling, Behavior
Simulation, Physically Based Simulation.
Interactive Techniques in Virtual Reality: Body Track, Hand Gesture, 3D Menus,
Object Grasp.
Introduction of Augmented Reality (AR): System structure of Augmented Reality,
key technology in AR.
Development Tools and Frameworks in Virtual Reality: Frameworks of software
development tools in VR, X3D Standard, Vega, MultiGen, Virtools etc.
Application of VR in Digital Entertainment: VR technology in film & TV
production, VR technology in physical exercises and games, demonstration of digital
entertainment by VR.
Laboratory Work: To implement various techniques studied during course.

b. prerequisites or co-requisites
 Numerical Analysis, Advanced Data Structures and Algorithms, Software
Engineering
 c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Analyze the components of AR and VR systems, its current and upcoming trends,
types, platforms, and devices.
● Assess and compare technologies in the context of AR and VR systems design.
● Implement various techniques and algorithms used to solve complex computing
problems in AR and VR systems.
● Develop interactive augmented reality applications for PC and Mobile based
devices using a variety of input devices.
● Demonstrate the knowledge of the research literature in augmented reality for both
compositing and interactive applications.
Course Syllabi: UML602 NATURAL LANGUAGE PROCESSING(L: T: P :: 3: 0: 2)

1. Course number and name: UML602; NATURAL LANGUAGE PROCESSING

1. Credits and contact hours: Credits: 4.0; Hours: 5
2. Instructor’s or course coordinator’s name: Mr. Jasmeet Singh
3. Text Books (author, title, publisher and year):
● Jurafsky D. and Martin H. J, Speech and Language Processing: An Introduction to
Natural Language Processing, Computational Linguistics and Speech Recognition,
Prentice Hall (2014), 2nded.
● Manning D. C. and Schütze H., Foundations of Statistical Natural Language
Processing MIT Press (1999) 1sted.
b. other supplemental materials
● Nil.
5. Reference Book, title, author, and year
● Dale R., Moisl H. and Somers H., Handbook of Natural Language Processing, CRC
Press (2010), 2nded.
● Bird S., Klein E. and Loper E., Natural Language Processing with Python, Oreilly
Publication (2009), 2nd ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Origin of Natural Language Processing (NLP), Challenges of NLP, NLP
Applications, Processing Indian Languages.
Words and Word Forms: Morphology fundamentals; Morphological Diversity of
Indian Languages; Morphology Paradigms; Finite State Machine Based Morphology;
Automatic Morphology Learning; Named Entities.
Phrase structure and constituency models: phrase structure grammar; dependency
grammar; formal language theory.
Parsing: Definite clause grammars; shift-reduce parsing; chart parsing' Shallow
Parsing, Statistical Parsing, Maximum Entropy Models; Random Fields, Scope
Ambiguity and Attachment Ambiguity resolution, Approaches to discourse,
generation.
Language Modeling and Part of Speech Tagging: Markov models, N-grams,
estimating the probability of a word, and smoothing, Parts-of-speech, examples and its
usage.
Machine Translation: Need of MT, Problems of Machine Translation, MT
Approaches, Direct Machine Translations, Rule-Based Machine Translation,
Knowledge Based MT System, Statistical Machine Translation.
Meaning: Lexical Knowledge Networks, WorldNet Theory; Indian Language Word
Nets and Multilingual Dictionaries; Semantic Roles; Word Sense Disambiguation;
WSD and Multilinguality; Metaphors.
 Other Applications: Sentiment Analysis; Text Entailment; Question Answering in
Multilingual Setting; NLP in Information Retrieval, Cross-Lingual IR. Text-
classification.
Laboratory Work: To implement Natural language concepts and computational
linguistics concepts using popular tools and technologies. To implement key algorithms
used in Natural Language Processing. To implement various machine translations
techniques for Indian languages.
b. prerequisites or co-requisites
 Numerical Analysis, Advanced Data Structures and Algorithms, Software
Engineering
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
 Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Comprehend the concept of natural language processing, its challenges and
applications.
 Comprehend the concepts of words form using morphology analysis.
 Acquire the knowledge of syntax and semantics related to natural languages.
 Ability to design and analyze various NLP algorithms.
 Acquire knowledge of machine learning techniques used in NLP.
.
 Course Syllabi: UCS643 CYBER FORENSICS (L: T: P :: 3: 0: 2)

1. Course number and name: UCS643; CYBER FORENSICS

1. Credits and contact hours: Credits: 4; Hours: 5
2. Instructor’s or course coordinator’s name: Dr. V.P. Singh
3. Text Books (author, title, publisher and year):
● Shinder L. D., Cross M., Scene of the Cybercrime, Syngress (2008) 2nded.
● Marcella J. A. and GuillossouF.,Cyber Forensics: From Data to Digital Evidence,
Wiley (2012).
a. other supplemental materials
 Nil.
4. Reference Book, title, author, and year
● Marcella J. A. and Menendez D., Cyber Forensics: A Field Manual for Collection,
Examining and preserving Evidence of computer crimes., Auerbach Publication (2010),
2nded.
b. other supplemental materials
● Nil.
5. Specific course information
a. brief description of the content of the course (catalog description)
Introduction to Cybercrime: Defining Cybercrime, Understanding the Importance of
Jurisdictional Issues, Quantifying Cybercrime, Differentiating Crimes That Use the Net
from Crimes That Depend on the Net, working toward a Standard Definition of
Cybercrime, Categorizing Cybercrime, Developing Categories of Cybercrimes,
Prioritizing Cybercrime Enforcement, Reasons for Cybercrimes
Understanding the People on the Scene: Understanding Cybercriminals, Profiling
Cybercriminals, Categorizing Cybercriminals, Understanding Cyber victims,
Categorizing Victims of Cybercrime, Making the Victim Part of the Crime-Fighting
Team, Understanding Cyber investigators, Recognizing the Characteristics of a Good
Cyber investigator, Categorizing Cyber investigators by Skill Set
Computer Investigation Process: Demystifying Computer/Cybercrime, Investigating
Computer Crime, How an Investigation Starts, Investigation Methodology, Securing
Evidence, Before the Investigation, Professional Conduct , Investigating Company
Policy Violations, Policy and Procedure Development , Policy Violations, Warning
Banners, Conducting a Computer Forensic Investigation, The Investigation Process,
Assessing Evidence, Acquiring Evidence, Examining Evidence, Documenting and
Reporting Evidence, Closing the Case
Acquiring, Duplicating and Recovering Deleted Files: Recovering Deleted Files and
Deleted Partitions, recovering "Deleted" and "Erased" Data, Data Recovery in Linux,
Recovering Deleted Files, Deleted File Recovery Tools, Recovering Deleted Partitions,
Deleted Partition Recovery Tools, Data Acquisition and Duplication, Data Acquisition
Tools, Recovering Data from Backups, Finding Hidden Data, Locating Forgotten
Evidence, Defeating Data Recovery Techniques
Collecting and Preserving Evidence: Understanding the Role of Evidence in a
Criminal Case, Defining Evidence, Admissibility of Evidence, Forensic Examination
Standards, Collecting Digital Evidence, Evidence Collection, Preserving Digital
 Evidence, Preserving Volatile Data, Special Considerations, Recovering Digital
Evidence, Deleted Files, Data Recovery Software and Documentation, Decrypting
Encrypted Data, Documenting Evidence, Evidence Tagging and Marking, Evidence
Logs, Documenting the Chain of Custody, Computer Forensic Resources, Computer
Forensic Training and Certification, Computer Forensic Equipment and Software,
Computer Forensic Services, Computer Forensic Information, Understanding Legal
Issues, Searching and Seizing Digital Evidence
Building the Cybercrime Case: Major Factors Complicating Prosecution, Difficulty
of Defining the Crime, Jurisdictional Issues, The Nature of the Evidence, Human
Factors, Overcoming Obstacles to Effective Prosecution, The Investigative Process,
Investigative Tools, Steps in an Investigation, Defining Areas of Responsibility
Laboratory Work: Hands with open source tools for forensic investigation process
models (from Item confiscated to submitting evidence for lawful action), such as FTK,
Sleuth Toolkit (TSK), Autopsy, etc.

c. prerequisites or co-requisites
 Numerical Analysis, Advanced Data Structures and Algorithms, Software
Engineering

d. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Selected Elective

6. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Familiarize with cyber crime& forensics ontology.
● Analyse & demonstrate the crime scene and criminology.
● Redesign the crime scene using digital investigation process.
● Recovery of evidence and creating document for judicial proceedings.
 Course Syllabi: UCS644 SOFTWARE VERIFICATION AND VALIDATION
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS644; SOFTWARE VERIFICATION AND

VALIDATION
2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Ajay Kumar
4. Text Books (author, title, publisher and year):
● Jorgensen C. P., Software Testing: A Craftsman's Approach, CRC Press (2014), 4 th
ed.
● Fisher S. M., Software Verification and Validation: An Engineering and Scientific
Approach, Springer(2007).
● other supplemental materials
● Nil.
5. Reference Book, title, author, and year
● Mathur P. A., Foundations of Software Testing, Pearson (2013), 2nd ed.
● Beizer B., Software Testing Techniques, Van Nostrand Reinhold (1983), 1sted.
● Rakitin R. S., Software Verification and Validation for Practitioners and Managers,
Artech House (2001), 2nd ed.
● other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: Terminology, evolving nature of area, Errors, Faults and Failures,
Correctness and reliability, Testing and debugging, Static and dynamic testing, Exhaustive
testing: Theoretical foundations: impracticality of testing all data, impracticality of testing
all paths, no absolute proof of correctness.
Software Verification and Validation Approaches and their Applicability: Software
technical reviews; Software testing: levels of testing - module, integration, system,
regression; Testing techniques and their applicability-functional testing and analysis,
structural testing and analysis, error-oriented testing and analysis, hybrid approaches,
integration strategies, transaction flow analysis, stress analysis, failure analysis,
concurrency analysis, performance analysis; Proof of correctness; simulation and
prototyping; Requirement tracing.
Test Generation: Test generations from requirements, Test generation pats, Data flow
analysis, Finite State Machines models for flow analysis, Regular expressions based
testing, Test Selection, Minimizations and Prioritization, Regression Testing.
Program Mutation Testing: Introduction, Mutation and mutants, Mutation operators,
Equivalent mutants, Fault detection using mutants, Types of mutants, Mutation operators
for C and Java.
Laboratory Work: To Use various verification and validation testing tools and to apply
these tools on few examples and case studies.
b. prerequisites or co-requisites
● Numerical Analysis, Advanced Data Structures and Algorithms, Software
Engineering
 c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
 Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Comprehend the theoretical foundations of testing.
 Comprehend software testing levels, testing techniques and their applicability.
 Generate test cases from software requirements, data flows and finite state
machines.
 Perform fault detection using mutants for operators of C and Java language.
 Course Syllabi: UCS741 SIMULATION AND MODELLING
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS741; SIMULATION AND MODELLING

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr Manju Khurana
4. Text Books (author, title, publisher and year):
● Payne A. J., Introduction to Simulation: Programming Techniques and Methods of
Analysis, McGraw Hill (1982).
● Gorden G., System Simulation, Prentice Hall publication (1978), 2nd ed.
a. other supplemental materials
● Nil.
5. Reference, title, author, and year
● Narsingh D., Systems Simulation with Digital Computer, PHI Publication (EEE)
(2004), 3rd ed.
● Banks J., Carson J. S., Nelson L. B., Nicol M. D, Discrete Event system Simulation,
Pearson Education, Asia (2010), 5th ed.
b. other supplemental materials
 Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction to Modeling and Simulation: Basic concept of Simulation,
Advantages, Disadvantages, Applications of simulation, limitation of simulation,
Model and types of models, modeling and simulation, Continuous and discrete
simulation, analog and digital simulation, System environment, components of a
system, steps in a simulation study, Simulation of Queuing and Inventory System.
Random Numbers generation: Pseudo-random generators, Testing of Pseudo-
random number generators, Generation of non-uniformly distributed random numbers
Parallel process modeling: Using Petri nets and finite automata in simulation,
Cellular automata and simulation.
Simulation Experiments: Run length of Static and Dynamic Stochastic Simulation
Experiments, Minimizing variability in simulators without increasing Number of
simulation Runs.
Design of Simulators: Design of Application Simulators for Multi-server Queuing
System, PERT, Optimizing Inventory Policy and Cost in Business environment.
Input Modeling: Data collection, Identification and distribution with data, parameter
estimation, Goodness of fit tests, Selection of input models without data, Multivariate
and time series analysis. Verification and Validation of Model: Model Building,
Verification, Calibration and Validation of Models.
Output Analysis: Types of Simulations with Respect to Output Analysis, Stochastic
Nature of output data, Measures of Performance and their estimation, Output analysis
of terminating simulation, Output analysis of steady state simulations. Simulation
Software’s: Selection of Simulation Software, Simulation packages, Trend in
Simulation Software.
 Laboratory Work: To carry out work on any simulation tools, Implementation of
various techniques to generate random numbers. Apply any simulation model in real
life applications.
b. prerequisites or co-requisites
● Optimization Techniques, Artificial Intelligence, Elective-II, Elective-III
b. indicate whether a required, elective, or selected elective (as per Table 5-1) course I
the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Describe the role of various elements of discrete event simulation and modeling
paradigm.
● Conceptualize real world situations related to systems development decisions,
originating from source requirements and goals.
● Generate and test random number variates and apply them to develop simulation
models.
● Interpret the model and apply the results to resolve critical issues in a real world
environment.
● Classify various simulation models and their usage in real-life applications.
Course Syllabi: UCG731 GAME DESIGN AND DEVELOPMENT(L: T: P :: 3: 0: 2)

1. Course number and name: UCG731; Game Design and Development

2. Credits and contact hours: Credits: 4.0; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Shivendra Shivani
4. Text Books (author, title, publisher and year):
● Eberly H. D., Game Physics ,Morgan Kaufmann Publisher (2010), 2nded.
● Bond G. J., Introduction to Game Design, Prototyping, and Development: From
Concept to Playable Game with Unity and C# , Addison-Wesley (2015), 2nd ed.
a. other supplemental materials
● Nil.

5. Reference, title, author, and year

● House H. D., Keyser C. J, Foundations of Physically Based Modeling and Animation,
CRC Press (2017), 1st ed.
● Okita. A., Learning C# Programming with Unity 3D, CRC Press (2014), 1st Ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Introduction: History of Video Games, Impact of Games on Society, Game Design,
Game types, Game genres, Game Writing, UI Layout, Asset Management, game state,
gamer services and Interactive Storytelling Understanding Hardware, Input Devices,
Output Devices, Network Requirements, Managing Game Performance, CPU vs.GPU,
and Graphics Networking Performance.
Game Design and Development Concepts: Mathematical concepts, Collision
Detection and resolution, Real-time game Physics, Graphics, Character Animation,
Animate basic characters, Transform objects, Artificial Intelligence Agents,
Architecture, and Techniques, Overview of Path finding, Audio Programming,
Networking and Multiplayer.
Audio Visual Design and Production: Visual Design, 3D Modeling using 3D Studio
Max, 3D Environments, 2D Textures and Texture mapping, Special Effects, Lighting,
Animation, Cinematography, Audio design and production using Autodesk Maya
Software.
Game Programming: Programming Fundamentals, Game Architecture, Memory and
I/O system, Debugging Games, Introducing Object Oriented Programming concepts
using C++ details, Number Systems, Programming: Basic Windows Programming,
GDI and Menus, Dialogs and Controls, Sprite Animation, AI Techniques
implementation.
Working with Unity and Scripting: Unity Demos, Courses Wiki, Lesson Files,
Managing Project, Interface and Assets, Unity Interfaces, Prototyping and Scripting
Basics, Collection, Inventory and HUD, Building Unity Game, Terrain, Unity Terrain
Assets, Camera, Layer, GUI, Curves, Surfaces, Visible Surface Identification, 2D
 Games, UVs Animation, Movie and Audio, Scene Modeling, Unity Optimization
Application and Techniques, Unity Deployment methods, character scripting.
Laboratory Work: 3D game development walkthrough on Unity 4.3 software, Maya,
Audio Listeners and Sources on Unity 4.3 software, Learning C++ with SDL library
and developing gaming programs and modules with C++.
b. prerequisites or co-requisites
● Optimization Techniques, Artificial Intelligence, Elective-II, Elective-III

c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Illustrate the basic concepts, requirements, and processes of Game design and
development.
● Understand the physics and mathematics behind the game engine.
● Discuss the elements contributing to the design of an advanced 3D game (AI
and Networking based game).
● Develop Windows and Android based 3D games using C#.
● Implement some advanced real-world components relevant to games using
AR and VR.
 Course Syllabi: UCS742 DEEP LEARNING (L: T: P :: 3: 0: 2)

1. Course number and name: UCS742; DEEP LEARNING

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Sushma Jain
4. Text Books (author, title, publisher and year):
● Goodfellow L., Bengio Y. and Courville A., Deep Learning, MIT Press (2016).
● Patterson J. and Gibson A., Deep Learning: A Practitioner's Approach, O’Reilly
(2017), 1st ed.
a. other supplemental materials
● Nil.

5. Reference book, title, author, and year

● Haykin S., Neural Network and Machine Learning, Prentice Hall Pearson (2009),
3rdEd.
● Geron A., Hands-on Machine Learning with Sci-kit and TensorFlow, O’Reilly Media
(2017).
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Machine Learning Basics: Learning, Underfitting, Overfitting, Estimators, Bias,
Variance, Maximum Likelihood Estimation, Bayesian Statistics, Supervised Learning,
Unsupervised Learning and Stochastic Gradient Decent.
Deep Feedforward Network: Feed-forward Networks, Gradient-based Learning,
Hidden Units, Architecture Design, Computational Graphs, Back-Propagation,
Regularization, Parameter Penalties, Data Augmentation, Multi-task Learning,
Bagging, Dropout and Adversarial Training and Optimization.
Convolution Networks: Convolution Operation, Pooling, Basic Convolution
Function, Convolution Algorithm, Unsupervised Features and Neuroscientific for
convolution Network.
Sequence Modelling: Recurrent Neural Networks (RNNs), Bidirectional RNNs,
Encoder-Decoder Sequence-to-Sequence Architectures, Deep Recurrent Network,
Recursive Neural Networks and Echo State networks.
Deep Generative Models: Boltzmann Machines, Restricted Boltzmann Machines,
Deep Belief Networks, Deep Boltzmann Machines, Sigmoid Belief Networks,
Directed Generative Net, Drawing Samples from Auto –encoders.
Laboratory Work: To implement models using python and google open source
library Tensorflow.

b. prerequisites or co-requisites
● Optimization Techniques, Artificial Intelligence, Elective-II, Elective-III
 c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Comprehend the advancements in learning techniques.
● Compare and explain various deep learning architectures and algorithms.
● Demonstrate the applications of deep learning in various fields.
● Apply deep learning specific open source libraries for solving real life problems.
Course Syllabi: UCS743 ADVANCED COMPUTER NETWORKS (L: T: P :: 3: 0: 2)

1. Course number and name: UCS743; ADVANCED COMPUTER NETWORKS

2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Neeraj Kumar
4. Text Books (author, title, publisher and year):
● Tanenbaum S. A., Computer Networks, PHI (2013), 5th ed.
● Forouzan A. B., Data Communication and Networking, TMH (2012), 5th ed.
a. other supplemental materials
● Nil.

5. Reference book, title, author, and year

● Peterson L. L. and Davie S. Bruce, Computer Networks- A Systems Approach, MK
Publisher (2011), 5th ed.
● Kurose J. and Ross K., Computer Networking,Pearson (2017),7th ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Review of Computer Networks, Devices and the Internet: Internet, Network edge,
Network core, Access Networks and Physical media, ISPs and Internet Backbones,
Delay and Loss in Packet-Switched Networks, Networking and Internet - Foundation
of Networking Protocols: 5-layer TCP/IP Model, 7-Layer OSI Model, Internet
Protocols and Addressing. Multiplexers, Modems and Internet Access Devices,
Switching and Routing Devices, Router Structure. The Link Layer and Local Area
Networks-Link Layer, Introduction and Services, Error- Detection and Error-
Correction techniques, Multiple Access Protocols, Link Layer Addressing, Ethernet,
Interconnections: Hubs and Switches, PPP: The Point-to-Point Protocol, Link
Virtualization
Data-link protocols: Ethernet, Token Ring and Wireless (802.11). Wireless Networks
and Mobile IP:Infrastructure of Wireless Networks, Wireless LAN Technologies, IEEE
802.11 Wireless Standard, Cellular Networks, Mobile IP, Wireless Mesh Networks
(WMNs), Multiple access schemes
Routing and Internetworking: Network–Layer Routing, Least-Cost-Path algorithms,
Non-Least-Cost-Path algorithms, Intra-domain Routing Protocols, Inter-domain
Routing Protocols, Congestion Control at Network Layer. Logical Addressing: IPv4
Addresses, IPv6 Addresses - Internet Protocol: Internetworking, IPv4, IPv6, Transition
from IPv4 to IPv6 – Multicasting Techniques and Protocols: Basic Definitions and
Techniques, Intra-domain Multicast Protocols, Inter-domain Multicast Protocols,
Node-Level Multicast algorithms.
Transport and Application Layer Protocols: Client-Server and Peer-To-Peer
Application Communication, Protocols on the transport layer, reliable communication.
Routing packets through a LAN and WAN. Transport Layer, Transmission Control
Protocol (TCP), User Datagram Protocol (UDP), Mobile Transport Protocols, TCP
 Congestion Control. Principles of Network Applications, The Web and HTTP, File
Transfer: FTP, Electronic Mail in the Internet, Domain Name System (DNS), P2P File
Sharing, Socket Programming with TCP and UDP, Building a Simple Web Server.

Laboratory Work: consists of creating simulated networks and passing packets

through them using different routing techniques.

b. prerequisites or co-requisites
 Optimization Techniques, Artificial Intelligence, Elective II, Elective III
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
 Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
 Analyze the functionality of the Network Models and the working of the Network
Devices.
 Identify various error detection and error correction techniques applied in
Computer Networks.
 Explore various IEEE Standards for wired and wireless Networks along with
Multiple Access schemes.
 Analyze the working of intra and inter domain routing protocols.
 Demonstrate the working of the Transport and Application layer Protocols.
 Course Syllabi: UCS709 ADVANCED TOPICS IN SOFTWARE ENGINEERING
(L: T: P :: 3: 0: 2)

1. Course number and name: UCS709; ADVANCED TOPICS IN SOFTWARE

ENGINEERING
2. Credits and contact hours: Credits: 4; Hours: 5
3. Instructor’s or course coordinator’s name: Dr. Ashima Singh
4. Text Books (author, title, publisher and year):
● Pressman S. R., and Maxim R. b., Software Engineering a Practitioners Approach,
McGraw-Hill Education (2015). 8th ed.
● Sommerville L., Software Engineering, Pearson Education (2016) 10thed.
a. other supplemental materials
● Nil.

5. Reference book, title, author, and year

● Bowen J., Formal Specification and Documentation using Z - A Case Study Approach,
International Thomson Computer Press (2003). 2nd ed.
● Oshana R. and Kraeling M., Software Engineering for Embedded Systems: Methods,
Practical Techniques, and Applications, Newnes Publisher (2013). 1st ed.
a. other supplemental materials
● Nil.

6. Specific course information

a. brief description of the content of the course (catalog description)
Formal Methods: Basic concepts, mathematical preliminaries, Applying
mathematical notations for formal specification, formal specification languages, using
Z to represent an example software component, the ten commandments of formal
methods, formal methods- the road ahead.
Cleanroom Software Engineering: approach, functional specification, design and
testing.
Component-Based Software Engineering: CBSE process, domain engineering,
component-based development, classifying and retrieving components, and economics
of CBSE.
Computer-Aided Software Engineering: Building blocks for CASE, taxonomy of
CASE tools, integrated CASE environments, integration architecture, CASE
repository, case Study of tools like TCS Robot.
Reengineering: Business process reengineering, software reengineering, reverse
reengineering, restructuring, forward reengineering, Economics of reengineering.
Web Engineering: Attributes of web-based applications, the WebE process, a
framework for Web Engineering, formulating, analyzing web-based systems, design
and testing for web-based applications, Management issues.
Mobile Development Process: Model View Controller, Presentation Abstraction
Control, UML based development, Use cases, Testing: Mobile infrastructure,
Validating use cases, Effect of dimensions of mobility on testing, Case study: IT
company, Requirements, Detailed design, Implementation.
 Software Engineering Issues in Embedded Systems: Characteristics of embedded
systems I/O, Embedded systems/real time systems. Embedded software architecture,
control loop, interrupts control system, co-operating multitasking, pre-emptive
multitasking, Domain analysis, Software element analysis, requirement analysis,
Specification, Software architecture, Software analysis design, implementation,
testing, validation, verification and debugging of embedded systems.
Laboratory Work: To implement the advance concepts in the lab using related tools
and to develop the project using related technologies..
b. prerequisites or co-requisites
● Optimization Techniques, Artificial Intelligence, Elective-II, Elective-III
c. indicate whether a required, elective, or selected elective (as per Table 5-1) course in
the program
● Selected Elective

7. Specific goals for the course

a. specific outcomes of instruction:
After the completion of the course the student will be able to:
● Comprehend concepts of formal methods and apply mathematical notations for
formal specification.
● Evaluate various approaches for software engineering, including cleanroom
software engineering and component-based software engineering.
● Demonstrate the use of various tools like CASE and TCS robot.
● Comprehend web engineering and create web-based application and apply re-
engineering concepts on traditional applications.
● Apply software engineering for Mobile Development Process and Embedded
Systems