JAIDEV EDUCATION SOCIETY’S

J D COLLEGE OF ENGINEERING AND MANAGEMENT

An Autonomous Institute, with NAAC "A" Grade
At: Khandala, Post- Valni, Kalmeshwar Road, Nagpur
Department of Computer Science & Engineering
“A Place to Learn, A Chance to Grow”
Session: 2020-21

Course Structure and Syllabus (Autonomous)

For

B. Tech. Computer Science & Engineering Programme

 JAIDEV EDUCATION SOCIETY’S
J D COLLEGE OF ENGINEERING AND MANAGEMENT
An Autonomous Institute, with NAAC "A" Grade
At: Khandala, Post- Valni, Kalmeshwar Road, Nagpur
Department of Computer Science & Engineering
“A Place to Learn, A Chance to Grow”
Session: 2020-21

INDEX

Sr. No. Particular

Vision & Mission of Institute & Department / Programm Educational
G Objectives(PEOs) / Program Outcomes (POs) / Program Specific
Outcomes (PSOs)
1. Syllabus Autonomy (I & II Sem, III & IV Sem)
2. Major domains CSE Autonomy
3. Subject description major domains CSE Autonomy
4.1 Syllabus major 1: Artificial Intelligence
4.2 Syllabus major 2: Data Science
4.3 Syllabus major 3: Programming
4.4 Syllabus major 4: Foundation of Computing
4.5 Syllabus major 5: System
5. Minor domains offered by CSE Autonomy
6. Subject description of minor domains CSE Autonomy
7. Syllabus of DBATU for Online courses for V sem
8. Syllabus DBATU (V& VI Sem, VII & VIII Sem)
 VISION AND MISSION OF INSTITUTE

VISION
To be a centre of excellence imparting professional education satisfying societal and global needs.

MISSION
Transforming students into lifelong learners through quality teaching, training and exposure to
concurrent technologies. Fostering conducive atmosphere for research and development through well-
equipped laboratories and qualified personnel in collaboration with global organizations.

VISION AND MISSION OF DEPARTMENT

VISION
To Produce Competent Professionals equipped with technical knowledge and commitment
for satisfying the needs of society.

MISSION
1. To impart advanced knowledge with an inclination towards Research with well equipped Lab.

2. To develop an ability to work ethically and Responsive towards the need of society.
 PROGRAM EDUCATIONAL OBJECTIVES (PEO’s)

PEOs ATTRIBUTES

PEO 1 Students will have In-depth knowledge of trending technologies, effective

communication skills, lifelong learning with leadership qualities in order to work in
any multidisciplinary areas in a team or individually.

PEO 2 Students will be able to interpret and analyze the requirements of the software
design and development to provide efficient engineering solutions with novel
product designs within the jurisdiction of humanity and social constraints

PEO 3 Students will have the attitude to pursue higher studies or research work or initiate

entrepreneurial activity
 PROGRAM OUTCOMES (PO’s)

POs ATTRIBUTES
1 An Understanding of IT architecture, software and hardware concepts, functionalities
and applications
2 An Ability to design, develop and test computer programs involving various
algorithms, methodology and programming languages.
3 Competency of business domains and functional processes that employ IT systems and
applications
4 Practical use of communication protocols and their applications in the field of internet
and world wide web.
5 Sound understanding of fundamentals of computer as the central enabling platform for
information management in 21st century .
6 An Ability to develop, integrate, maintain and innovate software applications deployed
in various multi-disciplinary domains.
7 Thought leadership to design and implement practical solutions for global industry
needs.
8 An Acumen to embrace and adopt futuristic IT technological developments.
9 Sound knowledge of entrepreneurship traits to succeed.
10 Adoption of practices that are ethical ensuring transparency and accountability.

11 Capability to provide solutions that are socially empowering and environment friendly.

12 Effective communication and collaboration techniques with stakeholders to achieve

best results.

PROGRAM SPECIFIC OUTCOMES (PSOS):

At the end of Electronics and Telecommunication program the student will have following Program
specific outcomes.
PSO1: The ability to understand, analyze and develop computer programs in the areas related to
algorithms, system software, multimedia, web design, big data analytics, and networking for
efficient design of computer-based systems of varying complexity

PSO2: The ability to apply standard practices and strategies in software project development using
open-ended programming environments to deliver a quality product for business success.

PSO3: The ability o employ modern computer languages, environments, and platforms in creating
innovative career paths to be an entrepreneur, lifelong learning & a zest for higher studies and also
acts as good citizen by inculcating in them moral values & ethics.

Recommendations for conducting one theory course of curriculum through online

Teaching / Learning

1. Only Swayam / NPTEL platform is allowed.

2. One defined subject per semester in online mode and BOS should declare that one subject for
online mode based on availability of NPTEL offering before commencement of the semester.

3. Student will be allowed to appear for NPTEL / Institute level / University Examination as
applicable.

4. In order to ensure learning, NPTEL lectures to be telecast in the class by including it in regular
time table if required.

5. 75% assignment submission is mandatory for these online classes also like regular lecture
attendance.

6. One faculty to be allotted for this subject, who will discuss and solve student’s doubts. Allot 3
hrs/week load to teacher who is allotted to work as facilitator of online course.

7. For Autonomy Students: For online mode the student should submit all assignment given by nptel
then his/her score has weightage of 40% for CA & MSE. And if student clear the nptel final exam and
producing certificate then 60% weightage should be given as ESE, otherwise he/she has to appear for
Makeup exam of Institute.

If student cannot enroll for NPTEL then he/she has to study online videos / material and these
students should appear for Mid Semester, CA-I , CA-II and End sem exams of the Institute.

8. For DBATU students: For online mode he has to appear for CA-I, CA-II, Mid sem exam of the
institute and End sem exam of University.

If student can’t enroll for NPTEL then he/she has to study online videos / material and these students
should appear for Mid Semester, CA-I , CA-II of the institute and End sem exams of the University.

10. If the credits of NPTEL/ SWAYAM courses do not match with the existing subject proper scaling
will be done)

This system will ensure real learning; avoid any problem arising due to cancellation of NPTEL exam
as it happened in this semester. At least for first year and in the unpredictable situation of covid
pandemic these provisions will avoid any last moment chaos.

Course Structure and Syllabus

For
B. Tech. Computer Science & Engineering Programme
Curriculum for Semester- I [First Year]
 1st Semester
Teaching Credi
Sr. Categor Evaluation Scheme
Course Scheme t
No y of Course Name
Code C MS ESE/Ext Tota
. Subject L T P A E . Pra. l
Introduction
to Computer
1 HSMC HU1T002 2 0 0 20 20 60 100 2
programmin
g
Engineering
MA1T00
2 BSC Mathematics 3 1 0 20 20 60 100 4
1
-I
Engineering
3 BSC IT1T005 3 1 0 20 20 60 100 4
Physics
Energy and
4 ESC IT1T006 Environment 3 0 0 20 20 60 100 3
Engineering
Introduction
to Computer
5 HSMC HU1L002 0 0 4 60 0 40 100 2
programmin
g Lab
Workshop
6 ESC WS1L001 0 0 4 60 0 40 100 2
Practices
Engineering
7 BSC IT1L005 0 0 2 60 0 40 100 1
Physics Lab
Induction
8     3 Weeks
Programme
Basic
Electrical
9 ESC IT1T007 and 2 0 0 10 15 25 50 Audit
Electronics
Engineering
        13 2 10         18

HU1T002 Introduction to Computer Programming 4 Credit

Course Objectives:
1. To understand the importance of Programming
2. To understand the application of C Programming.
3. To investigate the key concepts of C Programming.
4. To enable students build a applications based on C programming

Course Outcome:
CO1: Define the algorithms, flowcharts, array, pointer, structure, function, and python.
CO2: Discuss and differentiate between variables, operators, statements, loops, array dimensions.
CO3: Demonstrate working programs using functions, loops, conditional statements, array, pointer,
structure and files in C and python language.
CO4:Distinguish between different steps of programming and prioritize levels of programming.
CO5:Find errors and predict outcome in C and python programming.
CO6:Compose and develop any application using C and python programming.

Unit I: Basic of Programming Language [6 Hrs]

HLL, LLL, Language translator, Error checking, Debugging, Programming processes, Flowcharts,
Algorithms along with asymptotic notation.

Unit II: Types, Operators and Expressions in C language [6 Hrs]

Variable names, Data types, sizes, constants, declarations, arithmetic operators, relational and logical
operators, type conversions, increment and decrement operators, bitwise operators, assignment
operators and expressions, conditional expressions precedence and order of evaluation.

Unit III: Control Flow: [6 Hrs]

Statements and Blocks. If-else, else-if, switch, Loops: while and for, do-while break and continue go
to and Labels. Initializing arrays, Initializing character arrays, multidimensional arrays, Introduction
to pointers.

Unit IV: Functions and Pointers in Python [6 Hrs]

Functions and Program Structure: Basic of functions, functions returning non-integers external
variables scope rules.
Pointers in Python: Pointers to integers, characters, floats, arrays.
Unit V: [6 Hrs]
Structures in Python: Basics of structures, structures with functions, arrays of structures.
File handling in Python: Basics of file handling.

Text Books
1. Let Us C by Yashavant Kanetkar.
2. Let Us C Solutions by Yashavant Kanetkar
3. Data Structure through C by Yashavant Kanetkar.

Reference Books
1. C Programming: A Modern Approach (2nd Edition) - K. N. King (2008). A good book for
learning C.

2. Programming in C (4th Edition) - Stephen Kochan (2014). A good general introduction and
tutorial.

3. C Primer Plus (5th Edition) - Stephen Prata (2004)

4. A Book on C - Al Kelley/Ira Pohl (1998).

5. The C Book (Free Online) - Mike Banahan, Declan Brady, and Mark Doran (1991).
 MA1T001 Engineering Mathematics-1 4 Credit

COURSE OBJECTIVES
1. To understand the importance of Mathematics
2. To understand the application of Mathematics in engineering and in real life.
3. To investigate the key concepts of Mathematics.
4. To enable students to analyse a problem

COURSE OUTCOMES
At the end of the course students will be able to
1. Describe rank, Bernoulli’s theorem, Taylor’s and Maclaurin’s theorems for functions of two
variables, – Euler’s Theorem for functions containing two and three variables, Lagrange’s theorem
2. Illustrate the examples of ordinary differential equation, partial differential equation, matrices.
3. Solve questions related to ordinary differential equation, partial differential equation, matrices and
their applications.
4. Apply the knowledge of matrices, ordinary differential equation, partial differential equation, and
their applications to real world problems.
5. Interpret the results of matrices, ordinary differential equation, partial differential equation and
their applications.
6. Design a method or modal on matrices, ordinary differential equation, and partial differential
equation.

Unit 1: Linear Algebra- Matrices [09 Hours]

Determinants & Matrix, Inverse of Matrix by adjoin method, Inverse by partitioning method, solution
of system of linear equations, Rank of Matrix, Consistency of linear system of equation.

Unit 2: Ordinary Differential Equations of First Order and First Degree and Their
Applications [09 Hours]
Linear equations; Reducible to linear equations (Bernoulli’s equation); Exact differential equations;
Equations reducible to exact equations; Applications to orthogonal trajectories, mechanical systems
and electrical systems.

Unit3: Linear Differential Equations with Constant Coefficients [09 Hours]

Introductory remarks - complementary function, particular integral; Rules for finding complementary
functions and particular integrals; Method of variation of parameters; Cauchy’s homogeneous and
Legendre’s linear equations.

Unit 4:Partial Differentiation [09 Hours]

Partial derivatives of first and higher orders; Homogeneous functions – Euler’s Theorem for functions
containing two and three variables (with proofs); Total derivatives; Change of variables.

Unit 5:Applications of Partial differentiation [09 Hours]

Jacobians - properties; Taylor’s and Maclaurin’s theorems (without proofs) for functions of two
variables; Maxima and minima of functions of two variables; Lagrange’s method of undetermined
multipliers.

Text Books
1) Higher Engineering Mathematics by B. S. Grewal, Khanna Publishers, NewDelhi.
2) Advanced Engineering Mathematics by Erwin Kreyszig, John Wiley & Sons, NewYork.
3)A Course in Engineering Mathematics (Vol I) by Dr. B. B. Singh, Synergy Knowledgeware,
Mumbai.

4) A Text Book of Applied Mathematics (Vol I & II) by P. N. Wartikar and J. N. Wartikar, Pune
Vidyarthi Griha Prakashan, Pune.
5) Higher Engineering Mathematics by H. K. Das and Er. RajnishVerma, S. Chand & CO. Pvt.Ltd.,
New Delhi.

Reference Books
1) Higher Engineering Mathematics by B. V. Ramana, Tata McGraw-Hill Publications, New Delhi.

2) A Text Book of Engineering Mathematics by Peter O’ Neil, Thomson Asia Pte Ltd. , Singapore.

3) Advanced Engineering Mathematics by C. R. Wylie & L. C. Barrett, Tata Mcgraw-Hill Publishing

Company Ltd., New Delhi.
 ET1T005 Engineering Physics 4 Credit

COURSE OBJECTIVES:-
1. To provide a firm grounding in the basic physics principles and concept to resolve many
Engineering and technological problems.
2. To understand and study the Physics principles behind the developments of
Engineering materials.

COURSE OUTCOMES
At the end of the course students will be able to
1. Define the concept of laser, optical fiber, Hall effect, electron Ballistics, Bethe’s law,
Brewster law, polarization, electromagnetic wave.
2. Illustrate different types of laser, and optical fiber, Band-theory, Effect of electric and
magnetic fields, Electric and Magnetic focusing, Interference in thin films, Interference in
Wedge shape thin film and electromagnetic wave.
3. Apply the concept of Three and four level laser, pumping, population inversion, Numerical
aperture, Attenuation and dispersion, V-I characteristics of PN-junction diode, CRO,
Interference in thin films and electromagnetic waves.
4. Analyze the different types of laser and optical fiber, semiconductors, Motion of charged
particles in uniform electric and magnetic fields, polarization, relation between electric and
magnetic fields of an electromagnetic wave.
5. Interpret different types of laser, and optical fiber, PN- junction diode, Bipolar Transistor
action, Velocity filter, polarization, wave plate.
6. Develop models based on laser, optical fiber.

Unit-I: Laser & Optical Fibre [08 Hrs]

Interaction of radiation with matter, Population Inversion and Optical resonance cavity , Three and
four level laser, Ruby laser, He-Ne laser, Semiconductor laser , Properties and engineering
applications of laser.
Optical fibers: Propagation by total internal reflection, structure and classification (based on material,
refractive index and number of modes), Modes of propagation in fiber, Acceptance angle, Numerical
aperture, Attenuation and dispersion.. Applications: I) As a Sensors - i) Temperature Sensor ii)
Pollution / Smoke detector iii) Liquid level sensor. II) As a Detectors- i) PIN detector ii) Avalanche
Detector.
Unit-II: Semiconductor Physics [09Hrs]
Band-theory based classification of solids into insulators, semiconductors and conductors, Fermi-
Dirac distribution Function, Intrinsic semiconductors: Germanium and silicon; Fermi- energy, Typical
energy band diagram of an intrinsic semi-conductor, Extrinsic semiconductors, Current conduction in
semiconductors.
PN- junction diode; Unbiased, Forward biased& Reverse biased mode with Energy band diagram ,
Diode rectifier equation, Bipolar Transistor action, Hall effect, Hall coefficient & Hall Angle

Unit-III: Electron Ballistics [08 Hrs]

Lorentz force, Motion of charged particles in uniform electric and magnetic fields (parallel,
perpendicular and at an acute angle), Effect of electric and magnetic fields on kinetic energy of
charged particle, Crossed electric and magnetic field configurations, Velocity filter, Electrostatic and
magneto static deflection.
Bethe’s law, Electric and Magnetic focusing, Construction & working of Electrostatic lens, Devices:
CRT, CRO, Block Diagram, Function & working of each block.

Unit-IV: Wave Optics [08 Hrs]

Interference in thin films, Interference in Wedge shape thin film, Newton’s rings, Anti-reflection
coating, advanced applications of interference in thin film.
Polarization by reflection, Brewster’s law, polarization by double refraction, Nicol prism, elliptically
and circularly polarized light, Quarter wave plate and half wave plate.

Unit-V: Electromagnetic waves [06 Hrs]

The wave equation; Plane electromagnetic waves in vacuum, their transverse nature and polarization;
relation between electric and magnetic fields of an electromagnetic wave; energy carried by
electromagnetic waves and examples.

Text Books:
1. Fundamentals of Physics: David Halliday, Robert Resnick and Jerle Walker, John-WileyIndia
(8e, extended)
2. A text book of Engineering Physics: M. N. Avadhanulu, S. Chand & Co.
3. Nano the Essentials: Understanding Nanoscience and Nanotechnology, T.Praddep; TMH
Publications.
4. Introduction to Nanotechnology:Pooly& Owens; Willey Publication
5. Text Book of Optics: Brijlal and Subramanyam (S. Chand and Company)
 6. Laser: M. N. Avadhanulu, S. Chand & Co.

Reference Books:
1. LASERS: Theory and Applications: Thyagarajan K and Ghatak A.K.
2. Nanomaterials& Nanotechnologies and Design:M.F.Ashby, Paulo Ferreira and Daniel
L.Schodek, Elsevier Publications.
3. University Physics: Young and Freedman (Pearson Education).
4. Optics: Jenkins and White (Tata Mcgraw Hill)
 ET1L005 Engineering Physics Lab 1 Credit

List of Experiment
2. Newton’s rings - Determination of radius of curvature of Plano convex lens / wavelength of
light
3. Wedge Shaped film - Determination of thickness of thin wire
4. Laser - Determination of wavelength of He-Ne laser light
5. Magnetron Tube - Determination of ‘e/m’ of electron
6. Hall Effect - Determination of Hall Coefficient
7. Measurement of Band gap energy of Semiconductors
8. Study of I-V characteristics of P-N junction diode
9. Experiment on fibre optics
10. Input, output and current transfer characteristics of PNP/NPN transistor in CB and CE mode
11. Study of Cathode Ray Oscilloscope
 ET1T006 Energy and Environment Engineering 3 Credit

COURSE OBJECTIVES
1. To understand the importance of Energy and Environment
2. To understand the application of energy saving tool in real life.
3. To investigate the key concepts of Energy and Environment

COURSE OUTCOMES
At the end of the course students will be able to
1) Describe different kind of pollution eg. Water pollution, air pollution, soil pollution etc.
2) Understand the importance of ecosystem for human beings..
3) Discover innovative method of power generation.
4) Correlate the cost of various method of power generation.
5) Judge the quality of air.

Unit 1 [4 hrs]
Air Pollution: Environment and Human health - Air pollution, Particulate emission: sources- effects-
control measures -, air quality standards, and measurement of air pollution. Disposal of solid wastes,
Bio-medical wastes effects- control measures

Unit 2 [4 hrs]
Water Pollution and Conservation: Water pollution- types of pollutants, effects- control measures,
Water conservation and its methods, rainwater harvesting, methods of rainwater harvesting Surface
runoff harvesting, Rooftop rainwater harvesting, Noise pollution –effects and control measures,
-Thermal pollution – Soil pollution –Nuclear hazard.

Unit 3 [4 hrs]
Conventional Power Generation: Steam power station, Nuclear power plant – Gas turbine power
plant- Hydro power station: Schematic arrangement, advantages and disadvantages, Thermo electric
and thermionic generators, Environmental aspects for selecting the sites and locations of power
plants.
Unit 4 [4 hrs]
Renewable Power Generation: Solar, Wind, Biogas and Biomass, Ocean Thermal energy
conversion (OTEC), Tidal, Geothermal energy, Magneto Hydro Dynamics (MHD): Schematic
arrangement, advantages and disadvantages.

Unit 5 [4 hrs]
Energy conservation: Scope for energy conservation and its benefits Energy conservation Principle –
Maximum energy efficiency, Maximum cost effectiveness, Methods and techniques of energy
conservation in ventilation and air conditioners, refrigerator, compressors, pumps, fans and blowers,
Energy conservation in electric furnaces, ovens and boilers, lighting techniques. Tariffs and economic
aspects in power generation.

Reference/Text Books:
1. A Chakrabarti, M. L Soni, P. V. Gupta, U. S. Bhatnagar, A Text book of Power System
Engineering, DhanpatRai Publication.
2. Rai. G. D., Non-Conventional Energy Sources, Khanna Publishers, Delhi, 2006.
3. Rao S., Parulekar B.B., Energy Technology-Non conventional, Renewable and Conventional,
Khanna Publishers, Delhi, 2005.
4. Glynn Henry J., Gary W. Heinke, Environmental Science and Engineering, Pearson Education,
Inc, 2004.
5. J. M. Fowler, Energy and the Environment, McGraw-Hill, 2nd Edition, 1984.
6. Gilbert M. Masters, Introduction to Environmental Engineering and Science, 2nd Edition,
Prentice Hall, 2003.
 HU1L002 Introduction to Computer Programming Lab 2 Credit

List of Practical:-
1 A simple program to display a message “Hello World” on screen.
2 Write a Program to print addition, subtraction Multiplication and Division of a
entered number.
3 Write a Program to LCM of the entered number..
4 Write a program to find GCD of the entered number.
5 Write a program to find the greatest among three number.
6 Write a any menu driven program using if…else statement.
7 Write a any menu driven program using Switch case statement.
8 Write a program to find count of even no ,count of odd number , sum of even no
and sum of odd number between 1 to 50.
9 Write a Program to generate prime number up to inputted number.
10 Write a program to check entered no is Armstrong no or not.
11 Write a program to find transpose of a matrix.
12 Write a Program to find multiplication of a two matrix elements.
13 Write a Program to find length of a string.(with and without using a library
function)
14 Write a Program to find addition of two numbers using pointer.
15 Open ended Program. (How to execute C program on Linux operating system )
16 Write a Python program to print “Hello World”.
17 Write a Python program to display the current date and time.
18 Write a Python program which accepts the radius of a circle from the user and
compute the area.
19 Write a Python program to find reverse of the entered number.
20 Write a Python program to get the Python version you are using
 WS1L001 Workshop Practices 2 Credit

Instructions to the student:

Each student is required to maintain a „workshop journal‟ consisting of drawing / sketches of the jobs
and a brief description of tools, equipment, and procedure used for doing the job.

Contents:
a) Carpentry: Technical Terms related to wood working, Types of wood, Joining materials, Types of
joints - Mortise and Tenon, Dovetail, Half Lap, etc., Methods of preparation and applications, Wood
working lathe, safety precautions.
b) Welding: Arc welding - welding joints, edge preparation, welding tools and equipment, Gas
welding - types of flames, tools and equipment, Resistance welding - Spot welding, joint preparation,
tools and equipment, safety precautions.
c) Fitting: Fitting operation like chipping, filing, right angle, marking, drilling, tapping etc., Fitting
hand tools like vices, cold chisel, etc. Drilling machine and its operation.
e) Machine shop: Lathe machine, types of lathes, major parts, cutting tool, turning operations
(Demo), safety precautions

List of Practical:
1. Wood sizing exercises in planning, marking, sawing, chiselling and grooving to make half lap joint
and cross lap joint.
2. A job involving cutting, filing to saw cut, filing all sides and faces, corner rounding, drilling and
tapping on M. S. plates.
3. Exercise in Arc welding (MMAW) to make a square butt joint.
4. A demo job on turning of a Mild Steel cylindrical job using centre lathe.

Electrical workshop:-
1) To wire for a stair case arrangement using a two-way switch.
2) To measure electrical quantities-voltage current, power & power factor in RLC circuit.
 ET1T007 Basics of Electrical and Electronics Engineering Audit

COURSE OBJECTIVES
1. To provide a basic information and use of electrical and electronics components.
2. To understand and study the materials used for the preparation of electrical and electronics
components.
3. To provide basic knowledge of operation and functionality of electrical and electronics
components.

COURSE OUTCOMES:
CO1: Define fundamentals of electrical system and choose measuring instruments for measurement
of electrical quantities & describe the concept PN junction diode and its characteristics.
CO2: Classify wiring system and compare energy resources for electrical energy generation &
elaborate the transistor configuration in CE, CB & CC mode.
CO3: Plan and organize the utilization of energy resources of electrical system & apply transistor
characteristics to construct Amplifier devices.
CO4: Compare different sources of electrical system & distinguish various logic gates and simplify
the Boolean’s equations.
CO5: Justify the utilization of various electrical and electronics components into electrical and
electronics circuitries.
CO6: Construct various circuits using Resistors, capacitors, inductors, PN junction diode, Zener
diode, transformers, transistors and logic gates.

Unit 1: Elementary Electrical Concepts and Circuit Components [8 Hrs]

Fundamental of Electrical system: Potential difference, Ohm's law, Effect of temperature on
resister, resistance temperature coefficient, Electrical wiring system: Study of different wire gauges
and their applications in domestic and industry. Resistors: colour code, type of resistors, material
used for resistors, resistance wires, resistance standards, frequency errors in resistors. Capacitors:
Capacitance standards, variable capacitors, frequency errors in capacitors. Loss angle and power
factor of capacitors. Inductors: standards of inductance, mutual inductance, self-inductance, variable
inductance, inductors for high and low frequency work, frequency errors in inductors.
Unit 2: Measurement of Electrical Quantities, Measuring Instruments & Energy Resources
[7 Hrs]
Measurement of Voltage, Current, and Power (1ph and 3ph), Introduction to PMMC instrument,
Ohmmeter, galvanometer, potentiometers, power factor meter and frequency meters. Study of circuit
breakers & Actuators (MCB & Fuse, Power Contactors & Aux contactors, Electro-Mechanical &
Solid state Relays). Energy Resources and Utilization: Conventional and nonconventional energy
resources; Introduction to electrical energy generation from different resources, transmission,
distribution and utilization, Concept of Supply Demand, Power Factor, Need of unity factor.

Unit3: Introduction to diodes, diode circuit and Transducers [8 Hrs]

The P-N Junction Diode, V-I characteristics, Diode as Rectifier, specifications of Rectifier Diodes,
Half Wave, Full wave, Bridge rectifiers, Equations for IDC VDC VRMS, IRMS, Efficiency and
Ripple Factor for each configuration. Zener Diode, Characteristics, Specifications, Zener Voltage
Regulator, Types of Diodes: LED, Photodiode. Introduction to transducer, Classification of
transducers, characteristics and choice of transducers.

Unit 4: Semiconductor Devices and Applications: [7 Hrs]

Transistors: Introduction, Classification, CE, CB, and CC configurations, α, β, concept of gain and
bandwidth. Operation of BJT in cut-off, saturation and active regions (DC analysis). BJT as an
amplifier, biasing techniques of BJT, BJT as a switch.
Introduction to Digital Electronics: Number System, Basic logic Gates, Universal Gates, Boolean
Postulates, De-Morgan Theorems

Reference/Text Books:
1. V. N. Mittal and Arvind Mittal, Basic Electrical Engineering, McGraw-Hill Publication.
2. Brijesh Iyer and S. L. Nalbalwar, A Text book of Basic Electronics, Synergy
Knowledgeware Mumbai, 2017. ISBN:978-93-8335-246-3
3. Vincent DelToro, Electrical engineering Fundamentals, PHI Publication, 2nd Edition, 2011.
4. A Textbook of Basic Electrical and Electronics Engineering, J.B.Gupta, Katson Publication.
5. A Textbook of Basic Electrical Engineering by S.B. Bodkhe, N.M.Deskar, Professional
Publishing House Pvt. Ltd
6. D. P. Kothari and Nagrath, Theory and Problems in Electrical Engineering, PHI
Publication, 2011.
7. B. L. Theraja, Basic Electronics, S. Chand Limited, 2007.
 8. Millman Halkias, Integrated Electronics-Analog and Digital Circuits and Systems,
McGraw-Hill Publication, 2000.
9. Donald Neaman, Electronic Circuit Analysis and Design, McGraw-Hill Publication, 3rd
Edition.
10. Donald Neaman, Electronic Circuit Analysis and Design, McGraw-Hill Publication, 3rd
Edition.
11. Printed Circuit Boards Design & Technology, Walter C. Bosshart, McGraw-Hill
Publication.

Note: Students are advised to use internet resources whenever required

Curriculum for Semester- II [First Year]

2nd Semester
Teaching Credi
Sr. Categor Evaluation Scheme
Course Scheme t
No y of Course Name
Code C MS ESE/Ext Tota
. Subject L T P A E . Pra. l
HU2T00 Communicatio
1 HSMC 2 0 0 60 0 40 100 2
1 n Skills
Engineering
MA2T00
2 BSC Mathematics- 3 1 0 20 20 60 100 4
1
II
Engineering
3 BSC IT2T002 3 1 0 20 20 60 100 4
Chemistry
Engineering
4 ESC IT2T003 1 0 0 20 20 60 100 1
Graphics
HU2L00 Communicatio
5 HSMC 0 0 4 60 0 40 100 2
1 n Skills Lab.
Engineering
6 BSC IL2L002 0 0 2 60 0 40 100 1
Chemistry Lab
Engineering
7 ESC IT2L003 0 0 4 60 0 40 100 2
Graphics Lab
Societal
8     Internship/ Credit to be given in III Sem.
Field Training
Basic Civil
and
9 ESC IT2T004 2 0 0 10 15 25 50 Audit
Mechanical
Engineering
  1
      11 2         16
0
        23        
 HU2T001 Communication Skills 4 Credit

Course Objectives:
The main objective of the subject is to enhance the employability skills of engineering students as
well as communication skills at work place.
The sub-objectives are:
1) To develop students' reading skills and pronunciation.
2) To develop technical communication skills through drafting, letter writing, and précis writing.
3) To develop literary skills through essay writing.
4) To develop public speaking skills of the students.
5) To expose the students to the ethics of English language by teaching grammar

Course Outcomes:
At the end of the course students will be able to
1) Better reading comprehension, pronunciation, and functional English grammar.
2) Write letters and resumes
3) Organize their thoughts for effective presentation and writing.
4) Learn skills to present themselves well in an interview, and handle a Group Discussion

Unit 1: Communication and Communication Processes [06 hrs]

Introduction to Communication, Types and functions of Communication, Barriers to
Communication and overcoming them, Role of Communication Skills in Society
Reading: Introduction to Reading, Barriers to Reading, Types of Reading: Skimming, Scanning,
Intensive and Extensive, Strategies for Reading Comprehension.
Listening:Importance of Listening, Types of Listening, and Barriers to Listening.

Unit 2: Study of Sounds in English and Vocabulary Building [06 hrs]

Introduction to phonetics, Study of Speech Organs, Study of Phonemic Script, Articulation of
Different Sounds in English.
Vocabulary Building: The concept of Word Formation, Root words from foreign languages and their
use in English, Use of prefixes and suffixes from foreign languages in English to form derivatives,
Synonyms, antonyms, and standard abbreviations

Unit 3: English Grammar [06 hrs]

Grammar: Forms of Tenses, Articles, Prepositions, Use of Auxiliaries and Modal Auxiliaries,
Sentence Structures, Use of phrases and clauses in sentences, Importance of proper punctuation,
Common Errors. Misplaced modifiers

Unit 4: Professional Verbal Communication [06 hrs]

Components of an effective talk, Idea of space and time in public speaking, Tone of voice, Body
language, Timing and duration of speech, Audio-Visual Aids in speech. Presentation Skills, Group
Discussion and Job Interviews

Unit 5: Developing Business Writing Skills, Styles and Practice [06 hrs]
Writing Emails, Report Writing: Format, Structure and Types, Letter Writing: Types, Parts, Layouts,
Writing Job Application Letter and Resume.
Nature and Style of sensible Writing and Practice: Describing, Defining, Classifying, Providing
examples or evidence, writing introduction and conclusion, Writing Practices: Comprehension, Précis
Writing, Essay Writing

Text book:
Mohd. Ashraf Rizvi, Communication Skills for Engineers, Tata McGraw Hill

Reference Books:
1) Sanjay Kumar, PushpLata, Communication Skills, Oxford University Press, 2016
2) Meenakshi Raman, Sangeeta Sharma, Communication Skills, Oxford University Press, 2017
3) Teri Kwal Gamble, Michael Gamble, Communication Works, Tata McGraw Hill Education,
2010
4) Anderson, Kenneth. Joan Maclean and Tossny Lynch. Study Speaking: A Course in Spoken
English for Academic Purposes. Cambridge: CUP, 2004.
5) Aswalthapa, K. Organisational Behaviour, Himalayan Publication, Mumbai (1991).
6) Atreya N and Guha, Effective Credit Management, MMC School of Management, Mumbai
(1994).
7) Balan, K.R. and Rayudu C.S., Effective Communication, Beacon New Delhi (1996).
8) Bellare, Nirmala. Reading Strategies. Vols. 1 and 2. New Delhi. Oxford University Press,
1998.
9) Bhasker, W. W. S &Prabhu, N. S.: English through Reading, Vols. 1 and 2. Macmillan,
1975.
10) Black, Sam. Practical Public Relations, E.L.B.S. London (1972).
11) Blass, Laurie, Kathy Block and Hannah Friesan. Creating Meaning. Oxford: OUP, 2007.
12) BoveeCourtland,L and Thrill, John V. Business Communication, Today McGraw Hill, New
York, Taxman Publication (1989).
 MA2T001 Engineering Mathematics-II 4 Credit

COURSE OBJECTIVES
1. To understand the importance of Mathematics
2. To understand the application of Mathematics in engineering and in real life.
3. To investigate the key concepts of Mathematics.
4. To enable students to analyse a problem

COURSE OUTCOMES
At the end of the course students will be able to
1. Describe concept of complex numbers, integral calculus & multiple integrals, Fourier series &
transform, vector differential calculus, vector integral calculus.
2. Illustrate the concept of complex numbers, integral calculus & multiple integrals, Fourier series &
transform, vector differential calculus, vector integral calculus by using examples.
3. Apply the knowledge of complex numbers, integral calculus & multiple integrals, Fourier series &
transform, vector differential calculus, vector integral calculus to solve the engineering problems.
4. Analyse the problems and results of complex numbers, integral calculus & multiple integrals,
Fourier series & transform, vector differential calculus, vector integral calculus to solve the
engineering problems.
5. Evaluate the problems by using complex numbers, integral calculus & multiple integrals, Fourier
series & transform, vector differential calculus, vector integral calculus to solve the engineering
problems.
6. Create the methods or model by using complex numbers, integral calculus & multiple integrals,
Fourier series & transform, vector differential calculus, vector integral calculus to solve the
engineering problems.

Unit 1: Complex Numbers [09 Hrs]

Definition and geometrical representation; De-Moivre’s theorem (without proof); Roots of
Complex numbers by using De-Moivre’s theorem; Circular functions of complex variable –definition;
Hyperbolic functions; Relations between circular and hyperbolic functions; Real and Imaginary parts
of circular and hyperbolic functions; Logarithm of Complex quantities.
Unit 2: Integral calculus & Multiple Integrals [09 Hrs]
Beta, Gamma functions; tracing of the curves given in Cartesian, parametric & polar forms. Double
integration in Cartesian and polar co-ordinates; Evaluation of double integrals by changing the order
of integration and changing to polar form; Triple integral

Unit3: Fourier Series & Transform [09 Hrs]

Fourier Series , Definition and Properties (excluding FFT), Fourier Integral Theorem, Relation with
Laplace Transform, Applications of Fourier Transform to Solve Integral Equations.

Unit4: Vector Differential Calculus [09 Hrs]

General rules of vector Differentiation; Scalar and vector fields: Gradient, divergence and curl;
Solenoidal and irrotational vector fields; Vector identities

Unit5: Vector Integral Calculus [09 Hrs]

Vector Integration: line integral, surface integral and volume integral; Green’s lemma, Gauss’
divergence theorem and Stokes’ theorem (without proofs).

Text Books
1) Higher Engineering Mathematics by B. S. Grewal, Khanna Publishers, NewDelhi.
2) Advanced Engineering Mathematics by Erwin Kreyszig, John Wiley & Sons, NewYork.
3)A Course in Engineering Mathematics (Vol I) by Dr. B. B. Singh, Synergy Knowledgeware,
Mumbai.
4) A Text Book of Applied Mathematics (Vol I & II) by P. N. Wartikar and J. N. Wartikar, Pune
Vidyarthi Griha Prakashan, Pune.
5) Higher Engineering Mathematics by H. K. Das and Er. RajnishVerma, S. Chand & CO.
Pvt.Ltd., New Delhi.
Reference Books
1) Higher Engineering Mathematics by B. V. Ramana, Tata McGraw-Hill Publications, New
Delhi.
2) A Text Book of Engineering Mathematics by Peter O’ Neil, Thomson Asia Pte Ltd. ,
Singapore.
3) Advanced Engineering Mathematics by C. R. Wylie & L. C. Barrett, Tata Mcgraw-Hill
Publishing Company Ltd., NewDelhi.
 ET2T002 Engineering Chemistry 4 Credit

COURSE OBJECTIVES
1. To understand the importance of Chemistry
2. To understand the application of Chemistry in engineering and in real life.
3. To investigate the key concepts of Chemistry knowledge
4. To enable students to analyse a Chemistry problem so that appropriate problem solving techniques
may be applied

COURSE OUTCOMES
At the end of the course students will be able to
1. Describe various properties of water, fuel, transition metal ions and their magnetic properties,
Debye-Hückel theory, Quinonoid theory, various electrode, polymer and batteries
2. Illustrate the various types of water, Ostwald’s theory of acid-base indicator, polymer, various
batteries, and fuel cell.
3. Analyze the question on water characteristics, electrochemistry and various types of instrumental
titration, various batteries and fuel cell.
4. Apply the Knowledge of zeolite process, Ion exchange process, Hot Lime –Soda process, acid base
concept, fuel cell and batteries..
5. Develop a Modal on softening of water, standardization of acid and base by various instruments,
polymers, fuel cell and batteries..
6. Organize water as per quality, and fuel, types of electrodes, polymers and fuel cell and batteries.

Unit-1 [6 Hrs]
Water Treatment: Introduction, hard and soft water, softening of water – Zeolite process, Ion
exchange process, Hot Lime –Soda process, water characteristics- Hardness, Domestic water
treatment
Unit-2 [6 Hrs]
Fuels: Introduction, classification of fuel, essential properties of fuel, characteristics of good fuel,
solid fuel-Coal, Various types of Coal, Analysis of coal-Proximate and Ultimate analysis, liquid fuel-
Refining of Petroleum.
Unit-3 [8 Hrs]
Electrochemistry: Introduction-basic concepts, Transport number and its determination by Moving
Boundary method, Debye-Hückel theory, Conductometric titrations, Ostwald’s theory of acid-base
indicator, Quinonoid theory, Electrodes – Glass electrode, Quinhydrone electrode.

Unit-4 [8 Hrs]
Advanced Polymeric Materials: Introduction to reactions involving substitution, addition,
elimination, cyclization and ring opening. Liquid crystals and liquid crystal polymers (thermotropic
and lyotropic), phases of thermotropic polymers: nematic, smectic, cholesteric; advantages,
disadvantages and applications
Unit-5Battery Technology: [6 Hrs]
Classification of batteries: Primary, Secondary- Electricity storage density, power density, energy
efficiency, cycle life, shelf life. Rechargeable alkaline storage batteries, Ni-metal hydride,
Lithium ion batteries and H2-O2 Fuel cell.

Text Books:
1. A Text book of Engineering Chemistry, Dr. S. S. Dara, Dr. S. S. Umre, S. Chand and Company
Ltd., Twelfth/ 2011
2. Selected Topics in Inorganic Chemistry, Dr. Wahid U. Malik, Dr. G. D. Tuli and Dr. R. D.
Madan, S. Chand and Company Ltd., Seventh/2001

Reference Books:
Engineering Chemistry, P. C. Jain and Monika Jain, Dhanpatrai Publishing Company Ltd., 15 th Ed/
2009
Principles of Physical Chemistry, B. R. Puri, L. R. Sharma and Madan S. Pathania, Vishal Publishing
Company, First/2002
Chemistry, John E McMurry and Robert C Fay, Pearson, First/2008
ET2T003 Engineering Graphics 3 Credit

COURSE OBJECTIVES
1. To understand the concepts like dimensioning, conventions and standards related to engineering
graphics in order to become professionally efficient
2. To understand theory of projection and simple machine parts in first and third angle of projection
systems.
3. To understand the key concepts CAD software.
4. To enable students to analyze a 2-dimensional & 3-dimensional problem.
COURSE OUTCOMES:
1. Define various concepts like dimensioning, conventions and standards related to engineering
graphics in order to become professionally efficient.
2. Interpret drawings of simple machine component in first and third angle of projection systems
3. Apply theory of projections in projection of lines, projection of planes and projection of solid.
4. Classify solid geometry in different positions.
5. Assess the two dimensional and three dimensional drawing in CAD software.
6. Create the three dimensional engineering objects into two dimensional drawings and vice versa
using CAD software

Unit I Introduction to Computer Aided Drawing [03 Hrs]

Theory of CAD software, Demonstration knowledge, layout of the software, standard tool bar/menus
and description of most commonly used tools bars, Navigational tools. Creation of 2D/3D
environment. Commands and creation of co-ordinate points, lines, axes, polyline, square, rectangle,
polygons, splines, circles, ellipse, text, move, copy, offset, mirror, rotate, trim, extend, break,
chamfer, fillet, zoom, pan, curves, constraints viz. tangency, parallelism, inclination and
perpendicularity. Dimensioning, line conventions, lettering. Line properties, 3D modeling& topology
of engineering component.

Unit II Drawing standards & Orthographic Projections: [03 Hrs]

Drawing standard SP: 46, type of lines, lettering, dimensioning. Basic geometrical construction,
drawing of regular polygon, Theory of projection, introduction to orthographic projection, drawing of
orthographic views of objects from their isometric views by using first angle method of projection.

Unit III Projections of Points & Projections of Straight Lines: [03 Hrs]
Projection of point lying in four quadrants. Projections of lines parallel and perpendicular to one or
both planes, projections of lines inclined to one or both reference planes.

Unit IV Projections of Planes & Projections of Solids: [03 Hrs]

Projections of planes parallel and perpendicular to one or both planes, projection of planes inclined to
one or both planes.
Types of solids, Projection of solid when axis is perpendicular to one of the reference planes, when
axis is inclined to one and parallel to other reference plane, when axis is inclined to both the reference
planes

Unit V Isometric Projections [03 Hrs]

Isometric projections: Isometric scale, drawing of isometric projections from given orthographic
views.

Text Books:
1. N. D. Bhatt, Engineering Drawing, Charotar Publishing House, 46th Edition, 2003.
2. Dhananjay A. Jolhe, Engineering Drawing with an Introduction to AutoCAD, McGraw Hill
Education, 2017

Reference Books:
1. K. V. Natarajan, A text book of Engineering Graphic, Dhanalakshmi Publishers, Chennai,
2006.
2. K. Venugopal and V. Prabhu Raja, Engineering Graphics, New Age International (P) Ltd,
2008.
3.Engineering Drawing, R. K. Dhawan, S. Chand Publication, 1998.
4. Engineering Graphics, A. R. Bapat, Allied Publishers, 2004.
5. Fundamentals of Engineering Drawing, Luzadder& Duff, Eastern Economy, 11th Edition.
 HU2L001 Communication Skills Lab 1 Credit

List of Practical Sessions (Any 10 PR sessions can be conducted):

1) Pronunciation, Intonation, Stress and Rhythm(02 hrs)
2) Introduction to Phonemic symbols (02 hrs)
3) Articulation of sounds in English with proper manner (02 hrs)
4) Practice and exercises on articulation of sounds (02 hrs)
5) Read Pronunciations/transcriptions from the dictionary (02 hrs)
6) Practice and exercises on pronunciations of words (02 hrs)
7) Introduce yourself (02 hrs)
8) Importance of Business Communication with the help of a case study.(02hrs)
9) Listening Skills/ Comprehension(02 hrs)
10) Common Everyday Situations: Conversations and Dialogues(02 hrs)
11) Communication at Workplace(02 hrs)
12) Rapid reading sessions (02 hrs)
13) Draft Email(02 hrs)
14) Resume Writing(02hrs)
15) Drafting Business Letter(02 hrs)
16) Preparing technical paper using IEEE format(02 hrs)
17) Extempore (02 hrs)
18) Elocution (02 hrs)
19) Group discussion (02 hrs)
20) Participating in a debate (02 hrs)
21) Presentation techniques (02 hrs)
22) Interview techniques – Job Interviews, Telephonic Interviews(02hrs)
23) Mock interviews and practice sessions(02 hrs)
 EL2L002 Engineering Chemistry Lab 4 Credit

List of Experiments: (Perform any 8– 10 Experiments)

1. Determination of Hardness of water sample by EDTA method.
2. Determination of flash point by Pensky Martin Apparatus
3. Determination of Dissolve Oxygen by Iodometric method.
4. Determination of percent purity of Bleaching Powder.
5. pH – metric Titration (any one type of Acid Base titration)
6. Conductometric Titration (any one type of Acid Base titration)
7. Surface tension: Determination of relative surface tension of liquid with respect to water using
drop number method.
8. Viscosity:Determination of relative viscosity of liquid with respect to water using Ostwald’s
viscometer method.
9. To determine the normality in Normal term and Strength in gms/lit of HCl solution by titrating
with Na2CO3 solution.
10. To find out Morality, Normality and Strength of the given KMnO 4 solution by titrating against
N/10 Mohr’s solution.
11. Determination of Acid value of an oil sample.
12. Determination of Saponification value of an oil sample.

Reference Books:
1. Systematic experiments in Chemistry, A. Sethi, New Age International Publication, New
Delhi.
2. Practical Inorganic Chemistry, A. I. Vogel, ELBS Pub.
3. Practical in Engineering Chemistry, S. S. Dara.
 ET2L003 Engineering Graphics Lab 1 Credit

COURSE OBJECTIVES:
The objective of the course is to enable students to
1. Provide basic foundation in CAD software.
2. Understand the fundamentals used to create and manipulate geometric models.
3. Get acquainted with the basic CAD software for to design geometric modeling.

COURSE OUTCOMES:
1. Define basic structure of CAD workstation, CAD commands, Memory types, input/output
devices and display devices to become professionally efficient to operate CAD software.
2. Explain drawing of simple machine component in CAD software.
3. Acquire the knowledge of geometric modeling in CAD software.
4. Analyze the steps required in CAD software for 2-dimensional and 3-dimensional models.
5. Assess the two dimensional and three dimensional drawing in CAD software.
6. Create the three dimensional engineering objects into two dimensional drawings and vice
versa using CAD software.
List of Practical:
1. Introduction of CAD software and to study and practice basic draw commands exists in the
CAD software.
2. Lines, lettering and dimensioning. (Drafting work)
Identify the different types of Lines in the given object, draw lettering and give the
Required dimensions in the given object.
3. Geometric Construction. (Drafting work)
4. Orthographic projections first sheet. (Using CAD software)
5. Orthographic projections second sheet. (Using CAD software)
6. Projections of straight lines. (Drafting work)
7. Projections of planes & solids. (Drafting work)
8. Isometric Projections first sheet. (Using CAD software)
9. Isometric Projections second sheet. (Using CAD software)
10. Design of basic hardware components using CAD Software.
11. Design of advance hardware components using CAD Software.
12. Design of assembly drawing using CAD Software.
13. Design of assembly drawing with animation and rendering using CAD Software.
 ET2T004 Basic Civil and Mechanical Engineering Audit

COURSE OBJECTIVES (Basic Mechanical Engineering)

1. To understand the basic stream of Mechanical engineering and Civil Engineering.
2. To understand the concepts of product manufacturing, Energy engineering, design engineering,
Automobile engineering, construction technique and civil surveying.
3. To have basic knowledge of Casting, Machining, Designing, Manufacturing, different materials for
building construction and surveying.

COURSE OUTCOMES: (Basic Mechanical Engineering)

Students would be able to
1. Define basic stream of Mechanical & Civil Engineering.
2. Explain the concepts of product manufacturing, Energy engineering, design engineering,
Automobile engineering, construction technique and civil surveying.
3. Apply Basic knowledge of Casting, Machining, Designing, Manufacturing & Civil
Construction technique.
4. Analyzed the different mechanical system and properties of construction & surveying
material.
5. Interpret the problem in mechanical system and civil structure.
6. Solve the problem in mechanical system and civil structure.

Part I Basic Civil Engineering

Unit 1: Introduction to civil engineering
Various branches introduction to civil engineer in various construction activities basic engineer
properties and various materials: earth bricks timber, stone, sand Aggregate cement motor steel
bituminous glass FRP composite material.

Unit 2: Building component and planning material

Foundation and superstructure function of foundation type of shallow and deep foundation suitability
in different situation plinth wall lintels beam column slab roof staircase floor door window and study
of building plans ventilation and basic plumbing and sanitation

Unit 3: Surveying
Principal of surveying element of distance angular measurement plotting of area base line and off set
introduction of plane table survey introduction to levelling concept of bench mark reduce level and
counting

Part II Basic Mechanical Engineering

Unit 1: Introduction to Mechanical Engineering, Introduction to Laws of Thermodynamics with

simple examples pertaining to respective branches, IC Engines: Classification, Applications, Basic
terminology, 2 and 4 stroke IC engine working principle, Power Plant: Types of Power plant; Gas
power plant, Thermal power plant, Nuclear power plant, Automobiles: Basic definitions and
objectives
Unit 2: Design Basics, Machine and Mechanisms, Factor of safety, Engineering Materials: types and
applications, basics of fasteners, machining and machinability. Introduction to lathe machine, drilling
machine, milling machine, basics of machining processes such as turning, drilling and milling.
Introduction to casting

Text Books:
1. Anurag Kandya, “Elements of Civil Engineering”, Charotar Publishing, Anand
2. M. S. Palani Gamy, “Basic Civil Engineering”, Tata Mc-Graw Hill Publication
3. G. K. Hiraskar, “Basic Civil Engineering”, DhanpatRai Publications
4. Gopi Satheesh, “Basic Civil Engineering”, Pearson Education

Reference Books:
1. M. G. Shah, C. M. Kale, and S. Y. Patki, “Building Drawing”, Tata McGraw Hill
2. Sushil Kumar, “Building Construction”, Standard Publishers Distributors
3. Kanetkar T. P. and Kulkarni S. V., “Surveying and Levelling”, Vols. I, II and III, Vidyarthi
4. Gruh Prakashan, Pune
5. B. C. Punmia, “Surveying”, Vol.- I, Vol.-II, Vol.-III, Laxmi Publications
6. P. K. Nag “Engineering Thermodynamics”, Tata McGraw Hill, New Delhi 3rd ed. 2005
7. A. Ghosh, A K Malik, “Theory of Mechanisms and Machines”, Affiliated East West Press
 Pvt. Ltd. New Delhi.
8. Serope Kalpakaji and Steven R Schimd “A manufacturing Engineering and Technology”
Addison WsleyLaongman India 6th Edition 200
9. V. B. Bhandari, “Design of Machine Elements”, Tata McGraw Hill Publications, New Delhi.

Curriculum for Semester- III [Second Year]

Teaching
Sr. Category Course Evaluation Scheme
Course Name Scheme Credit
No. of Subject Code
 
     

L T P CA MSE ESE Total

Business
1 BSC CS3T001 2 0 0 20 20 60 100 2
Communication

2 BSC CS3T002 Mathematics-III 3 1 0 20 20 60 100 4

Programming for
3 ESC CS3T003 3 0 0 20 20 60 100 3
Problem Solving

4 ESC CS3T004 Basic Human Rights 2 0 0 15 10 25 50 Audit

Digital Electronics
5 PCC CS3T005 3 0 0 20 20 60 100 3
and Microprocessor

Data structure &

6 PCC CS3T006 3 1 0 20 20 60 100 4
Algorithms

7 PCC CS3T007 Operating System 3 0 0 20 20 60 100 3

Digital Electronics
8 PCC CS3L008 and Microprocessor 0 0 2 60 0 40 100 1
(Lab)

Data structure and

9 PCC CS3L009 0 0 2 60 0 40 100 1
Algorithms(Lab)

10 PCC CS3L010 Web Designing (Lab) 0 0 2 60 0 40 100 1

 11 PROJECT CS3P011 Internship 0 0 0 0 0 0 0 1

        19 2 6 315 130 505 950 23

CS3T001 Business Communication 2 Credit

COURSE OBJECTIVES:
1. To provide an overview of Prerequisites to Business Communication.
2. To put in use the basic mechanics of Grammar.
3. To provide an outline to effective Organizational Communication.
4. To underline the nuances of Business communication.
5. To impart the correct practices of the strategies of Effective Business writing

COURSE OUTCOMES:
At the end of this course, the students should be able to,

1 Student shall be able to identify key principles in business communication.

Student shall be able to describe different processes and considerations involved in
2
business.
Student shall be able to illustrate the appropriate use of different channels of written
3
communication in business
Student shall be able to Categorize traditional and online tools and methods to find,
4
evaluate, and process information
5 Students shall be able to evaluate various types of business reports.
Student shall be able to analyze on various types of business messages, including
6
informative messages, team-focused messages, criticism, and response messages.

Course Contents:

Unit 1 [6 Hrs]

Communication Skills: Fundamentals of Effective Communication, Public Speaking: fundamentals

of effective public speaking, types- Extempore speech, manuscript speech, and ways to enhance
public speaking skills, storytelling, oral review, types of communication- verbal and nonverbal
communication, barriers of communication.
Listening Skills:Law of nature, Importance of listening skills, Difference between listening and
hearing, types of listening.

Unit 2 [6 Hrs]
Interpersonal Skills: Team work, Team effectiveness, Group discussion, Decision making, Team
Communication. Team, Conflict Resolution, Team Goal Setting, Team Motivation Understanding
Team Development, Team Problem Solving, Building the team dynamics. Multicultural team activity.
Presentation Skills: PowerPoint presentations, Effective ways to structure the presentation,
importance of body language.

Unit 3 [6 Hrs]
Leadership Skills: Leader’s Role, Responsibilities and Skill Required: Understanding good
Leadership behaviours, Learning the difference between Leadership and Management, Gaining
insight into your Patterns, Beliefs and Rules, Defining Qualities and Strengths of leadership,
Determining how well you perceive what's going on around you, interpersonal Skills and
Communication Skills, Learning about Commitment and How to Move Things Forward, Making Key
Decisions, Handling Your and Other People's Stress, Empowering, Motivating and Inspiring Others,
Leading by example, effective feedback.
Team Building and Team Work: Aspects of team building- skills needed for teamwork –A model
of team building, Team vs. Group, Characteristics of effective team, Role of team leader, Inter group
collaboration, factors shaping inter-group collaboration

Unit 4 [6 Hrs]
Corporate / Business Etiquettes: Corporate grooming & dressing, etiquettes in social & office
Setting-Understand the importance of professional behaviour at the work place, Understand and
Implement etiquettes in workplace, presenting oneself with finesse and making others comfortable in
a business setting. Importance of first impression, Grooming, Wardrobe, Introduction to Ethics in
engineering and ethical reasoning, rights and responsibilities
Technology Etiquettes: Phone, Email, Social media, Video conferencing, Web interviews.

Unit 5 [6 Hrs]
Professional manners: Social skills, interacting with people. Politeness and amicability,
supportiveness, valuing time, respectfulness, Mobile manners, Table etiquettes. Professional
etiquettes: Etiquettes at meeting, dining.
Conflict management: Definition, types of conflict management, communication, emotional
Intelligence, creative problem solving, Empathy, Apologizing, Avoiding Punishments, Being Present,
Calmness, Impartiality, Intuitiveness, Ability to "Let It Go", Patience, Positivity, Ability to Prioritize
Relationships, Respecting Differences, Separating Yourself, Stress management, Ability to Take
Criticism, crises communication.

Unit 6 [6 Hrs]
Written Communication: Letter Writing –Formal and Informal letter writing, Application letters,
Report writing: academic and business report, Job application letter.
Business Correspondence: Writing business letters, Memos, placing orders, Invoice, quotations.
Exercise: Writing letters.

Text Books:
1. Business Communication Today by Bovee, Thill, Raina
2. Business Communication by K. K. Sinha, Taxmann
3. Introduction to Business: A Societal Approach by Walter W. Perlickand Raymond V. Lesikar,
Business Publications.

Reference Books:
1. "Negotiation and Conflict Management Essays on Theory and Practice" by I. William
Zartman available from Rakuten Kobo. 
2. “Strategic Writing: Multimedia Writing for Public Relations, Advertising and More”
by Charles Marsh , David W. Guth.
CS3T002 Mathematics-III 4 Credit

COURSE OBJECTIVES:

1. To understand the concept of Laplace Transform , Fourier transform, complex variables

Numerical Linear algebra, Stochastic calculus, Computational graph theory.
2. To understand the application of Mathematics in engineering and in real life.
3. To enable students to apply mathematical tool to solve problems in real life.
4. To enable students to apply mathematical tool to analyze problems in real life

COURSE OUTCOMES:

1. Describe the concept of Laplace Transform, Fourier transform, complex variables, Numerical
Linear Algebra, Stochastic calculus, Computational graph theory
2. Illustrate the concept of Laplace Transform, Fourier transform, complex variables, Numerical
Linear Algebra, Stochastic calculus, Computational graph theory by using examples.
3. Apply the concept of Laplace Transform, Fourier transform, complex variables, Numerical
Linear Algebra, Stochastic calculus, Computational graph theory to solve the problem.
4. Analyze the problem by using the concept of Laplace Transform, Fourier transform, complex
variables, Numerical Linear Algebra, Stochastic calculus, Computational graph theory.
5. Evaluate the problem base on the concept of Laplace Transform, Fourier transform, complex
variables, Numerical Linear Algebra, Stochastic calculus, Computational graph theory.
6. Create the new concept by using the theory of Laplace Transform, Fourier transform,
complex variables, Numerical Linear Algebra, Stochastic calculus, Computational graph
theory.

[Unit1] [6 Hrs]
Laplace transform: Definition ;Transforms of elementary functions; Properties of Laplace transform;
Inverse Laplace transform; Convolution Theorem for finding inverse Laplace transforms ; Applications of
Laplace transform to find the solutions differential equations. Introduction to Latex. Calculation of Laplace
transform by using software.

[Unit2] [6 Hrs]
Fourier transform: Definitions – Fourier transforms ; Properties of Fourier transforms ; Fourier
sine and cosine transforms ; Properties of Fourier transforms ; Parseval’s identity for Fourier
Transforms; Finite Fourier transform.
[Unit3] ]6 Hrs[
Functions of complex variables : Analytic functions; Harmonic functions in Cartesian form;
fundamental theorem of algebra; Cauchy’s integral theorem; Cauchy’s integral formula; Residues;
Cauchy’s residue theorem.

[Unit4] [6 Hrs]
Numerical linear algebra: Introduction to linear algebra; condition number of a matrix;
sensitivity analysis; Norm ; stability of numerical algorithms; stability of nonlinear system; SVD;
Power method; Google page rank algorithm.
Introduction about meta-heuristic method; Nature-inspired method : ant colony optimization .

[Unit5] [6 Hrs]
Stochastic calculus: Stochastic Processes: Definition and classification of random processes;
Discrete-time Markov chains; Poisson process; Continuous-time Markov chains; Stochastic
integration, Itôintegral , Itôformula. Stochastic differential equations. Application of stochastic
calculus in computer science.

[Unit6] [6 Hrs]

Computational graph theory : Basic terminology in graph theory; Invariant of a graph;

Adjacency matrix of a graph; Laplacian matrix of a graph; Algebraic connectivity of a graph;
Properties of eigenvalues and eigenvectors of an adjacency matrix and Laplacian matrix of a graph.

Text Books:
1. Higher Engineering Mathematics by B. S. Grewal, Khanna Publishers, New Delhi.
2. Advanced Engineering Mathematics by Erwin Kreyszig, John Wiley & Sons, New York.
3. A Course in Engineering Mathematics (Vol III) by Dr. B. B. Singh, Synergy Knowledgeware,
Mumbai.
4. A Text Book of Applied Mathematics (Vol I & II) by P. N. Wartikar and J. N. Wartikar,Pune
Vidyarthi Griha Prakashan, Pune.
5. Higher Engineering Mathematics by H. K. Das and Er. Rajnish Verma, S. Chand & CO.Pvt. Ltd.,
New Delhi.
6. D. S. Watkins, Fundamentals of Matrix Computations, John Wiley, 1991.
7. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd Edition, John Hopkins University
Press, 1996.
8. S.M. Ross, Stochastic Processes, 2nd Edition, Wiley, 1996.
9. J. Medhi, Stochastic Processes, New Age International, 1994.
10. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.North-Holland, 1976.
11. J. M. Aldous. Graphs and Applications. Springer, LPE, 2007.
12. D. M. Cvetkovic, M. Doob and H. Sachs, Spectra of Graphs: Theory and Applications, Academic
Press, 1980.
13. C. Godsil and G. Royale, Algebraic Graph Theory, Graduate Texts in Mathematics 207, Springer,
2001.
14. R. B. Bapat, Graphs and Matrices, Texts and Readings in Mathematics, Hindustan Book Agency,
New Delhi, 2010.
Reference Books:
1. Higher Engineering Mathematics by B. V. Ramana, Tata McGraw-Hill Publications, NewDelhi.
2. A Text Book of Engineering Mathematics by Peter O’ Neil, Thomson Asia Pte Ltd.,Singapore.
3. Advanced Engineering Mathematics by C. R. Wylie & L. C. Barrett, Tata Mcgraw-Hill Publishing
Company Ltd., New Delhi.
4. Integral Transforms and Their Engineering Applications by Dr. B. B. Singh, Synergy .Knowledge
ware, Mumbai.
5. Integral Transforms by I. N. Sneddon, Tata McGraw-Hill, New York.
6. L. N. Trefethen and D. Bau III, Numerical Linear Algebra, SIAM, 1997.
7. J. W. Demmel, Applied Numerical Linear Algebra, SIAM, 1997.
8. S. Shreve, Stochastic Calculus for Finance, Vol. 2, Springer, 2004.
9. J. M. Steele, Stochastic Calculus and Financial Applications, Springer, 2001
10. R. M. Patne, G. R. Avachar, note on an adjacency matrix of a graph G, Advances in Mathematics:
Scientific Journal, volume 9(3), 1281–1291,2020
11. D. Lamberton and B. Lapeyre, Introduction to Stochastic Calculus Applied to Finance, Chapmans &
Hall/CRC, 2000.
12. M. Baxter and A. Rennie, Financial Calculus, Cambridge University Press, 1996.
13. F. Harary: graph theory, addison-wesley reading, Massachusetts, 1996.

CS3T003 Programming for Problem Solving 3 Credit

COURSE OBJECTIVES:

1.To learn the fundamentals of computers.

2. To understand the various steps in program development.

3. To learn the syntax and semantics of C programming language.

4.To learn the usage of structured programming approach in solving problems

COURSE OUTCOMES: At the end of this course,

1.Student shall be able to learn and understand to formulate simple algorithms for arithmetic and
logical problems

2.Student shall be able to translate the algorithms to programs (in C language).

3.Student shall be able to test and execute the programs and correct syntax and logical errors

4.Student shall be able to implement conditional branching, iteration and recursion

5.Student shall be able to decompose a problem into functions and synthesize a complete program
using divide

6. Student shall be able to formulate simple algorithms for arithmetic and logical problems

Course Contents:
Unit 1 [6 Hrs]
Introduction to components of a computer system (disks, memory, processor, where a program is
stored and executed, operating system, compilers etc.), Idea of Algorithm: steps to solve logical and
numerical problems. Representation of Algorithm: Flowchart/Pseudocode with examples. From
algorithms to programs; source code, variables (with data types) variables and memory locations,
Syntax and Logical Errors in compilation, object and executable code

Unit 2 [6 Hrs]
Conditional Branching and Loops, Writing and evaluation of conditionals and consequent branching
,Iteration and loops

Unit 3 [6 Hrs]
Arrays (1-D, 2-D), Character arrays and Strings, Searching, Basic Sorting Algorithms (Bubble,
Insertion and Selection), Finding roots of equations, notion of order of complexity through example
programs (no formal definition required)

Unit 4 [6 Hrs]
Functions (including using built in libraries), Parameter passing in functions, call by value, Passing
arrays to functions: idea of call by reference, Recursion, as a different way of solving problems.
Example programs, such as Finding Factorial, Fibonacci series, Ackerman function etc. Quick sort or
Merge sort.

Unit 5 [6 Hrs]
Structures, Defining structures and Array of Structures,Pointers,Idea of pointers, Defining pointers,
Use of Pointers in self-referential structures, notion of linked list
Unit 6 [6 Hrs]
File handling and Its Implementation

Text Books:
1. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill
CS3T004 Basic Human Rights 2 Credit

COURSE OBJECTIVE:
1.In-depth insight into the constitutional, statutory and institutional aspects of human rights protection
in India.
2. Covers constitutional provisions dealing with human rights and special legislations dealing with
protection of vulnerable and marginalized groups. 
3. Discussion on institutional framework in India dealing with protection and enforcement of human
rights.

COURSE OUTCOMES:
1. Demonstrate a good understanding of the provisions under the Constitution of India dealing with
human rights. 
2. Display a good understanding of the nature and scope of special legislations dealing with protection
of human rights of marginalized and vulnerable sections. 
3. Demonstrate a good understanding of the practical application of human rights law to specific
human rights problems in India. 

Course Contents:

UNIT I [4 Hrs]
Introduction: Magna Carta, English bill of rights, American/French declaration, Universal declaration
of human rights: Background, Content and relevance, Theories/Justification/Perspectives on Human
Rights, Natural, Moral, Legal and human rights, Natural rights, Positivist, Liberal, Marxist, Feminist,
Asian perspectives.

UNIT II [4 Hrs]
Debates: Universality of rights, Rights vs. duties, Individual vs. group rights, Civil and political rights
vs. social, The notion of rights in various religious traditions (Hindu, Muslim, Buddhist traditions),
Western Influence (especially the impact of the British rule), National freedom movement, The roles
of Gandhi, Ambedkar and Nehru.

UNIT III [4 Hrs]

Constitutional provisions (especially fundamental rights vs. directive principles of state policy and
emergency), Intergovernmental Organization, The United Nations (study of specific UN agencies
related to human rights), Regional instruments.

UNIT IV [4 Hrs]
International NGO - Amnesty international: It’s working and impact on India, Case studies of
selected national NGOs, Case studies of selected regional NGOs, The government: Role of some of
its agencies including the army, Police and paramilitary forces.

UNIT V [4 Hrs]
National Human Rights Commission of India - Background, Structure and functioning, International
humanitarian law, International refugee law, The judiciary including public interest litigation, The
medical profession and human rights, The role of the media in human rights.

UNIT VI [4 Hrs]
Some Issues in Human Rights : Violence and terrorism, Women’s rights, Child rights, Dalit rights,
Minority rights, Tribal rights, Refugee rights, Capital punishment, Euthanasia, Rights of the elderly,
Gay Rights.

Text Books
1. D. D. Basu, V. R. Manohar, B. P. Banerjee, S.A. Khan, “Introduction to the Constitution
of India”, 20th Edition, Lexis NexisButterworths publication, 2008.
2. A. R. Desai, “Violation of Democratic Rights in India”, Bombay Popular Prakashan.

Reference Books:
1. M. Mohanty, P. N. Mukherji, O. Tornquist, “People’s Rights: Social Movements and the
State in the Third World”, New Delhi, Sage Publications, 1998.
2. Nirmal, J. Chiranjivi, “Human Rights in India: Historical, Social and Political
Perspectives”, New Delhi, Oxford University Press, 2000.
3. Kothari, Smitu, Harsh Sethi, “Rethinking Human Rights: Challenges for Theory and
Action”, Lokayan, Delhi, 1991.
4. A. J. M. Milne, “Human Rights and Human Diversity: An Essay in the Philosophy of
Human Rights”, New York State University of New York Press, 1986.

CS3T005 Digital Electronics & Microprocessor 3 Credit

COURSE OBJECTIVES:
1.To Understand the architecture and the instruction set of microprocessor
2.To study Assembly language programming as well as the design of various types of
digital and analog interfaces
3.To Understand the architecture of 8086
COURSE OUTCOMES:
1. Perform the conversion among different number systems
2.Design digital components including – decoders, multiplexers, arithmetic circuits.
3. Design of synchronous sequential circuits.
4. Illustrate how the different peripherals are interfaced with Microprocessor.
5. distinguish and analyze the properties of Microprocessors & Microcontrollers.

Course Contents:

Unit 1 [6 Hrs]
Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations,
Boolean algebra, examples of IC gates, Number Systems: binary, signed binary, octal hexadecimal
number, binary arithmetic, one’s and two’s complements arithmetic, codes, error detecting and
correcting codes.

Unit 2 ]6 Hrs]
Combinational Digital Circuits: Standard representation for logic functions, K-map representation,
simplification of logic functions using K-map, minimization of logical functions. Don’t care
conditions, Multiplexer, De-Multiplexer/Decoders, Adders, Subtractors, BCD arithmetic, carry look
ahead adder, serial adder, ALU, elementary ALU design, parity checker / generator.

Unit 3 [6 Hrs]
Sequential circuits and systems: A 1-bit memory, the circuit properties of Bistable latch, the clocked
SR flip flop, J- K - T and D-types flip flops, applications of flip flops, shift registers, applications of
shift registers, serial toparallel converter, parallel to serial converter, ring counter, sequence generator,
ripple(Asynchronous) counters, synchronous counters, counters design using flip flops, special
counter IC’s, asynchronous sequential counters, applications of counters.

Unit 4 [6 Hrs]
Fundamentals of Microprocessors: Fundamentals of Microprocessor, Comparison of 8-bit, (8085) 16-
bit (8086), and 32-bitmicroprocessors (80386). The 8086 Architecture: Internal Block Diagram, CPU,
ALU, address, data and control bus, Working registers, SFRs, Clock and RESET circuits, Stack and
Stack Pointer, Program Counter, I/O ports, Memory Structures, Data and Program Memory, Timing
diagrams and Execution Cycles.

Unit 5 [6 Hrs]
Memory Interfacing. I/O Interfacing. Direct Memory Access. (DMA). Interrupts in 8086.

Unit 6 [6 Hrs]

8086 Instruction Set and Programming: Addressing modes: Introduction, Instruction syntax, Data
types, Subroutines Immediate eaddressing, Register addressing, Direct addressing, Indirect
addressing, Relative addressing, Indexed addressing, Bit inherent addressing, bit direct addressing.
Instruction timings. Data transfer instructions, Arithmetic instructions, Logical instructions, Branch
instructions, Subroutine instructions, Bit manipulation instruction. Assembly language programs, C
language programs. Assemblers and compilers. Programming and debugging tools.

Text Books:
1.R. P. Jain, "Modern Digital Electronics", McGraw Hill Education, 2009.
2.M. M. Mano, "Digital logic and Computer design", Pearson Education India, 2016.
3.A. Kumar, "Fundamentals of Digital Circuits", Prentice Hall India, 2016.
4.Douglas Hall, Microprocessors and Interfacing, McGraw-Hill Publications.
CS3T006 Data Structure & Algorithms 4 Credit

Prerequisites: Basic knowledge of ‘C’ Language.

Course Objectives:
1. To understand the concepts of ADTs.
2. To learn linear data structures – lists, stacks, and queues
3. To understand sorting, searching and hashing algorithms.
4. To apply Tree and Graph structures.

Course Outcomes:
At the end of this course students will demonstrate the ability to
1. Student shall be able to Implement abstract data types for linear data structures.
2. Student shall be able to apply the different linear and non-linear data structures to problem
solutions
3. Student shall be able to critically analyze the various sorting algorithm.

Course Contents:
Unit 1 [6 Hrs]
Complexity Analysis: Time and Space complexity of algorithms, asymptotic analysis, big O and
other notations, importance of efficient algorithms, program performance measurement, data
structures and algorithms.

Unit 2 [6 Hrs]
ADT Array-Searching and sorting on arrays: Linear search, binary search on a sorted arrays.
Bubble sort, Insertion sort, merge sort and analysis; Emphasis on the comparison based sorting
model, Counting sort, Radix sort, and bucket sort

Unit 3 [6 Hrs]
Stacks and Queues: Abstract data types, sequential and linked implementations, exception handling
in classes, representative applications such as parenthesis matching, towers of Hanoi, wire routing in
a circuit, finding path in a maze, simulation of queuing systems, equivalence problem.
Unit 4 [6 Hrs]
Linked Lists: Abstract data type, sequential and linked representations, comparison of insertion,
deletion and search operations for sequential and linked lists, list and chain classes, exception and
iterator classes for lists, doubly linked lists, circular lists, linked lists through simulated pointers, lists
in STL, skip lists, applications of lists in bin sort, radix sort, sparse tables.

Unit 5 [6 Hrs]
Trees: Binary trees and their properties, terminology, sequential and linked implementations, tree
traversal methods and algorithms, heaps as priority queues, heap implementation, insertion and
deletion operations, heap sort, heaps in Huffman coding, leftist trees, tournament trees, use of winner
trees in merge sort as an external sorting algorithm, bin packing.

Unit 6 [6 Hrs]
Graphs: Breadth first search and connected components, Depth first search in directed and
undirected graphs.

Text Books:
1. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson
Education,1997.

Reference Books.
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to
Algorithms”, Second Edition, Mcgraw Hill, 2002.
2. Aho, Hopcroft and Ullman,Data Structures and Algorithms‖, Pearson Education,1983.
3. Stephen G. Kochan, :Programming in C‖, 3rd edition, Pearson Education.
4. Ellis Horowitz, SartajSahni, Susan Anderson-Freed, ―Fundamentals of Data Structures in C,
Second Edition, University Press, 2008.
 CS3T007 Operating System 3 Credit

Course Objective:
At the end of the Course, Student will be able to:

1 To understand the services provided by and the design of an operating system.

2 To understand the structure and organization of the file system.

To understand what a process is and how processes are synchronized and
3
scheduled.
4 To understand different approaches to memory management.
Students should be able to use system calls for managing processes, memory and
5
the file system.
Students should understand the data structures and algorithms used to implement an
6
OS.

Course Outcomes:

1 Identify the significance of operating system in computing devices.

Exemplify the communication between application programs and hardware devices
2
through system calls
3 Compare and illustrate various process scheduling algoritIhms
4 Apply appropriate memory and file management schemes
5 Illustrate various disk scheduling algorithms.
6 Understand the need of access control and protection in an operating system

Course Contents:

Unit 1 [6 Hrs]
Introduction: Evolution of OS, Types of OS, Basic h/w support necessary for modern operating
systems, services provided by OS, system programs and system calls, system design and
implementation, UNIX system introduction and commands.

Unit 2 [6 Hrs]
Processes and Threads: Process Concept, Process Scheduling, Operations on Processes,
Cooperating Processes, Interprocess Communication, Communication in Client – Server Systems,
Multithreading Models, Threading Issues.
CPU Scheduling: Scheduling Criteria, Scheduling Algorithms, Multiple-Processor Scheduling, Real-
Time Scheduling, Algorithm Evaluation, Process Scheduling Models.

Unit 3 [6 Hrs]
Process Synchronization: Synchronization Background, The Critical-Section Problem,
Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Critical Regions,
Monitors, OS Synchronization

Unit 4 [6 Hrs]
Deadlocks & Protection: Deadlock definition, Prevention, Avoidance, Detection and recovery,
Goals of Protection, access matrix, implementation, Security problem.

Unit 5 [6 Hrs]
Memory Management :Memory Management Background, Swapping, Contiguous Memory
Allocation, Paging, Segmentation, Segmentation with Paging, Basics of Virtual Memory – Hardware
and control structures – Locality of reference ,Paging: Principle of operation, Demand Paging,
Process Creation, Page Replacement, Allocation of Frames, Thrashing .

Unit 6 [6 Hrs]
File systems: File concept, Access methods, Disk space management and Allocation methods
strategies, Directory structures, Recovery, Log-structured File System, Disk arm scheduling
strategies.
Protection and security: Illustrations of security model of UNIX and other OSs. Examples of
attacks.

Textbook:
1. Abraham Silberschatz, Peter B. Galvin and Greg Gagne, Operating System Concepts,
Wiley Publication, 8th Edition, 2008.
2. Andrew S. Tanenbaum, Modern Operating System, PHI Publication, 4thEdition, 2015
3. Richard Stevens, Stephen Rago, Advanced Programming in the UNIX Environment,
Pearson Education, 2/e

Reference Books:
1. D. M. Dhamdhere, Systems Programming and Operating Systems, McGraw-Hill, 2ndEdition,
1996.
2. Garry Nutt, Operating Systems Concepts, Pearson Publication, 3rd Edition, 2003.
3. Harvey M. Deitel, An Introduction to Operating Systems, Addison-Wesley Publication, 2nd
Edition, 1990.
4. Thomas W. Doeppner, Operating System in Depth: Design and Programming, Wiley
5. M. J. Bach. Design of the Unix Operating System, Prentice Hall of India, 1986.Publication,
2011.
CS3L008 Digital Electronics & Microprocessor Lab 1 Credit

Course Objectives:
1.To acquire the basic knowledge of digital logic levels and application of knowledge to understand
digital electronics circuits.
2.To prepare students to perform the analysis and design of various digital electronic circuits.

Course Outcomes:
1. To understand and examine the structure of various number systems and its application in digital
design
2. To identify basic requirements for a design application and propose a cost effective solution.
3. To develop skill to build, and troubleshoot digital circuits

List of Experiments:
1. Simplification, realization of Boolean expressions using logic gates/universal gates.
2. Realization of half/full adder & half/full subtractors using logic gates.
3. Realization of parallel adder/subtractors using 7483 chip, BCD to Excess-3codeconversion
& vice versa.
4 .Realization of binary to gray code conversion & vice versa.
5 .MUX/DEMUX – use of 74153, 74139 for arithmetic circuits & code converter.
6.Realization of one/two bit comparator and study of 7485 magnitude comparator.
7. Use of a) Decoder chip to drive LED display & b) Priority encoder.
8. Truth table verification of flip-flops: i) JK Master Slave ii) T type iii) D type.
9. Realization of 3-bit counters as a sequential circuit & MOD-N counter design(7476, 7490,
74192, 74193).
10. Writing & testing of sequence generator.
11. Design of FSM: Moore machine, Mealy machine
 CS3L009 Data structure and Algorithms (Lab) 1 Credit

Course Objectives:
1. To develop skills to design and analyze simple linear and non linear data structures.
2. To identify and apply the suitable algorithm for the given real world problem.
3. To gain knowledge in practical applications of data structures and algorithms

Course Outcomes:
1. To design and analyze the time and space efficiency of the data structure
2. To identity the appropriate data structure for given problem
3. To apply the knowledge of data structures and algorithm to solve the problem

List of Experiments:

1. Write a program to implement stack using arrays.

2. Write a program to evaluate a given postfix expression using stacks.
3. Write a program to convert a given infix expression to postfix form using stacks.
4. Write a program to implement circular queue using arrays.
5. Write a program to implement double ended queue (de queue) using arrays.
6. Write a program to implement a stack using two queues such that the push operation runs in
constant time and the pop operation runs in linear time.
7. Write a program to implement a stack using two queues such that the push operation runs in
linear time and the pop operation runs in constant time.
8. Write a program to implement a queue using two stacks such that the enqueue operation runs
in constant time and dequeue operation runs in linear time.
9. Write a program to implement a queue using two stacks such that the enqueue operation runs
in linear time and dequeue operation runs in constant time.
10. Write programs to implement the following data structures:
(a) Single linked list
(b) Double linked list
11. Implement the following sorting algorithms:
(a) Insertion sort
(b) Merge sort
 (c) Quick sort
(d) Heap sort

CS3L010 Web Designing Lab 1 Credit

Course Objectives:
1. To learn the basics in web designing using HTML, CSS, and XML.
2. To develop web applications using JSP, servlet, PHP, and Net Beans.

Course Outcomes:
1. To Develop web pages using HTML, CSS, and XML
2. To Deploy real world applications using client side and server side scripting languages.
3. To Design web applications in Net Beans Environment
4. To Perform the Database Connectivity with MySQL using Java Servlets, JSP, and PHP.

List of Experiments

1) Designing static web pages using basics and important tags in HTML.
2) Designing dynamic web pages using different cascading style sheets.
3) Design an XML document to store information about a patient in a hospital. Information
contains first name, middle name, last name, aadhar no., age, address etc. Create CSS for the
above XML document.
4) Write a JavaScript to design a simple calculator to perform various arithmetic operations.
5) Programs using Java servlets and JSP.
6) Designing web applications using PHP.
7) File handling using PHP: Design a page to save the user input details to a text file and display
its contents.
8) Write a PHP code to display the number of visitors visiting the web page.
9) Designing web applications in Net Beans Environment.
10) Database Connectivity with MySQL using Java Servlets, JSP, and PHP.
 Curriculum for Semester- IV [Second Year]

Teaching
Sr. Category Evaluation Scheme
Course Scheme Credit
No. of Course Name 
Code 
  Subject 
L T P CA MSE ESE Total

Computer Architecture
1 PCC CS4T001 3 0 0 20 20 60 100 3
Organization

2 PCC CS4T002 Java Programming 3 0 0 20 20 60 100 3

3 PCC CS4T003 FLAT 3 1 0 20 20 60 100 4

4 PCC CS4T004 Computer Network 3 0 0 20 20 60 100 3

Database Management
5 PCC CS4T005 3 0 0 20 20 60 100 3
Systems
Discrete Mathematics
6 PCC CS4T006 3 0 0 20 20 60 100 3
& Graph Structures

7 PCC CS4L007 JAVA(Lab) 0 0 2 60 0 40 100 1

Computer
8 PCC CS4L008 0 0 2 60 0 40 100 1
Networks(Lab)

9 PCC CS4L009 DBMS(Lab) 0 0 2 60 0 40 100 1

10 MC CS4T010 Consumer Affairs 2 0 0 15 10 25 50 Audit

        18 1 8 320 120 510 950 22

CS4T001 Computer Architecture Organization 3 Credit

Course Objectives:
1. To understand the relationship between instruction set architecture, architecture, and system
architecture and their roles in the development of the computer.
2. To be aware of the various classes of instruction: data movement, arithmetic, logical and flow
control. Explain how interrupts are used to implement I/O control and data transfers..
3. To Understand how a CPU’s control unit interprets a machine –level instructions.
4. To Identify various types of buses in Computer systems.
5. To Understand memory hierarchy.
6. To Understand various peripheral devices.

Course outcomes:
Students will be able to:
Describe the fundamental organisation of a computer system
1

2 Interpret the functional architecture of computing systems. (Understanding)

3 Explain addressing modes, instruction formats and program control statements

4 Distinguishtheorganizationofvariouspartsofasystemmemoryhierarchy

Describe basic concept of parallel computing and Describe fundamentals concepts of pipeline
5
and vector processing
Identify, compare and assess issues related to ISA, memory, control and I/O functions.
6
(Applying, Analyzing, Evaluating)

Course Contents:

Unit 1 [8 Hrs]
Basic Structure of Computer: Hardware & Software, Addressing Methods, Program Sequencing,
Concept of Memory Locations & Address, Main Memory Operation, Instructions & Instruction
Sequencing, Number representation, Design of Fast Adders, Signed Addition and Subtraction.
Multiplication of Positive numbers, Floating-Point Numbers and related operations Basic I/O
Operations, Stacks, Queues & Subroutines.
Unit 2 [8 Hrs]
Processing Unit: Fundamental Concepts, Execution of a Complete Instruction, Hardwired Control,
Performance Consideration, Micro-programmed Control, Microinstructions, Micro-program
Sequencing, Microinstruction Pre-fetching, Emulation., Booth’s Algorithm, Integer Division.

Unit 3 [8 Hrs]
I/O Organization: Accessing I/O Devices, Interrupts, Addressing Modes, Direct Memory Access,
Bus arbitration, I/O Hardware, Processor Bus and Interfacing Circuits, Standard I/O Interfaces, SCSI
Bus, Backplane Bus Standard.

Unit 4 [8 Hrs]
Memory Unit: Basic Concepts, Semiconductor RAM Memories, Internal Organization, Static &
Dynamic RAMs, ROMs, Speed, Size& Cost Considerations. Cache Memories: Performance
considerations. Virtual Memories, Address Translation, Memory Management Requirements.

Unit 5 [8 Hrs]
Arithmetic: RISC philosophy, pipelining, basic concepts in pipelining, delayed branch, branch
prediction, data dependency, influence of pipelining on instruction set design, multiple execution
units, performance considerations.

Unit 6 [8 Hrs]
Computer Peripherals: Input-Output Devices like Video displays, Video terminals, Graphics input
devices, Printers. Online storage devices: Magnetic disks, Magnetic tape, Systems, CD-ROM
systems. Communication devices: Modems.

Text-Book:

1. V. Carl Hamacher& S. Zaky: Computer Organization, Fourth Edition, McGraw-Hill (ISE).

References:

1. Stallings. W: Computer Organization &Arcitecture, Fifth Edition, Pearson Education.

2. Tananbaum A. S: Structured Computer Organization, Fifth Edition, Pearson Education.
3. Hayes J. P: Computer Architecture & Organization, Fourth Edition, McGraw- Hill.
4. M. Mano&KimeLogie: Computer Design Fundamentals, Second Edition, Pearson
Education.

CS4T002 JAVA Programming 4 Credit

Course Objectives:

1 To learn the Advanced concepts in J2SE

To understand Web Application Development, Database Connectivity and its

2
Implementation using Servlets, JSP and JDBC
3 To introduce advanced Java frameworks for improving the web application design.

Course Outcomes:

1 Student shall be able to Understand and implement advanced Java concepts.

2 Student shall be able to Develop Java based Web applications using Servlets and JSP
Student shall be able to Incorporate cutting-edge frameworks in web application
3
development.

Course Contents:

Unit 1 [8 Hrs]
Introduction to Java Programming :Overview of Java, Fundamental Programming Structures,
Strings – Objects Classes and Methods - Inheritance - Packages and Interfaces - Exception handling,
Collections - Multithreading – Java I/O Streams, File Handling.
Exploring Core Java :Applets , Java GUI Programming and Event Handling, Java Networking,
RMI, Reflection, Collections, Generics, Java Auto boxing and Annotations.

Unit 2 [8 Hrs]
Java Networking :Network Basics and Socket overview, TCP/IP client sockets, URL, TCP/IP server
sockets, Datagrams, java.net package Socket, Server Socket, Inet Address, URL, URL Connection.
Introducing Java EE, Enterprise Java, Basic Application Structure, Using Web Containers, Creating
Servlets, Configuring Servlets, Understanding HTTP methods, Using Parameters and Accepting Form
Submissions, Using Init parameters, File Uploading, JDBC.
Unit 3 [8 Hrs]
JDBC Programming : The JDBC Connectivity Model, Database Programming: Connecting to the
Database, Creating a SQL Query, Getting the Results, Updating Database Data, Error Checking and
the SQL Exception Class, The SQL Warning Class, The Statement Interface, Prepared Statement,
Callable Statement The Result Set Interface, Updatable Result Sets, JDBC Types, Executing SQL
Queries, Result Set Meta Data, Executing SQL Updates, Transaction Management.

Unit 4 [8 Hrs]
Servlet API and Overview :Servlet Model, Overview of Servlet, Servlet Life Cycle, HTTP Methods
Structure and Deployment descriptor Servlet Context and Servlet Config interface, Attributes in
Servelt, Request Dispacher interface The Filter API: Filter, Filter Chain, Filter Config Cookies and
Session Management: Understanding state and session, Understanding Session Timeout and Session
Tracking, URL Rewriting.
Servlet API and Overview :Servlet Model, Overview of Servlet, Servlet Life Cycle, HTTP Methods
Structure and Deployment descriptor ServletContext and ServletConfig interface, Attributes in
Servelt, Request Dispacher interface The Filter API: Filter, Filter Chain, Filter Config Cookies and
Session Management: Understanding state and session, Understanding Session Timeout and Session
Tracking, URL Rewriting.
Unit 5 [8 Hrs]
Java Server Faces2.0 :Introduction to JSF, JSF request processing Life cycle, JSF Expression
Language, JSF Standard Component, JSFFacelets Tag, JSF Convertor Tag, JSF Validation Tag, JSF
Event Handling and Database Access, JSF Libraries: Prime Faces.
EJB: Enterprise bean architecture, Benefits of enterprise bean, types of beans, Accessing beans,
packaging beans.

Unit 6 [8 Hrs]
Hibernate 4.0: Overview of Hibernate, Hibernate Architecture, Hibernate Mapping Types, Hibernate
O/R Mapping, Hibernate Annotation, Hibernate Query Language.
Java Web Frameworks: Spring MVC, Overview of Spring, Spring Architecture, bean life cycle,
XML Configuration on Spring, Aspect – oriented Spring, Managing Database, Managing
Transaction.

Textbook:
 1) Herbert Schildt, The Complete Reference-Java, Tata Mcgraw-Hill Edition, Eighth Edition,
2014.
2) Nicholas S. Williams, Professional Java for Web Applications, Wrox Press, 2014.
3) Complete Reference J2EE by James Keogh mcgraw publication.

Reference Books:

1) Black Book “ Java server programming” J2EE, 1st ed., Dream Tech Publishers, 2008. 3.
Kathy walrath .
2) Core Java, Volume II: Advanced Features by Cay Horstmann and Gary Cornell Pearson
Publication.
3) Spring in Action 3rd edition , Craig walls, Manning Publication.
4) Hibernate 2nd edition, Jeff Linwood and Dave Minter, Beginning Après publication.
CS4T003 Formal Language and Automata Theory 4 Credit

Course Objectives:
1. To Introduce students to the mathematical foundations of computation including automata theory;
the theory of formal languages and grammars; the notions of algorithm, decidability, complexity, and
computability.
2. To Enhance/develop students' ability to understand and conduct mathematical proofs for
computation and algorithms

Course Outcomes:
1. Students shall able to Define the mathematical principles behind theoretical computer science.
2. Students shall able to Differentiate and give examples for the different types of automata like finite
automata, push down automata, linear bounded automata and turing machine
3. Students shall able to Correlate the different types of automata to real world applications
4. Students shall able to Choose and design appropriate automata for the different requirements
outlined by theoretical computer science
5. Students shall able to Identify the different computational problems and their associated
complexity.
Course Contents:
Unit 1 [8 Hrs]
Fundamentals : Strings, Alphabet, Language, Operations, Finite state machine, definitions,
finite automaton model, acceptance of strings, and languages, deterministic finite automaton and
nondeterministic finite automaton, transition diagrams and Language recognizers. 

Finite Automata: Introduction to Finite Automata, Structural Representations, Automata and

Complexity, Central Concepts of Automata Theory, DFA, NFA, and NFA & epsilon Machine.
Conversions and Equivalence: Equivalence between NFA with and without epsilon transitions, NFA
to DFA conversion, minimization of FSM, equivalence between two FSM’s, Finite Automata with
output- Moore and Melay machines.

Unit 2 [8 Hrs]
Regular Languages : Regular Expressions, Finite Automata and Regular Expressions, Applications
of Regular Expressions, Algebraic Laws for Regular Expressions, Properties of Regular Languages,
Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to
Regular expressions, Pumping Lemma for Regular Languages, Applications of the Pumping Lemma,
Closure Properties of Regular Languages, Decision Properties of Regular Languages.

Grammar Formalism: Regular grammars-right linear and left linear grammars, equivalence

between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees,
sentential forms, Right most and leftmost derivation of strings. 

Unit 3 [8 Hrs]
Context Free Grammars : Context-Free Grammars: Definition of Context-Free Grammars,
Derivations Using a Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar,
Sentential Forms, Parse Tress, Applications of Context-Free Grammars, Ambiguity in Grammars
and Languages.

Push-Down Automata: Push down automata, definition, model, acceptance of CFL, Acceptance

by final state and acceptance by empty state and its equivalence, Equivalence of CFL and
PDA, interconversion, Introduction to DCFL and DPDA. 

Unit 4 [8 Hrs]
Turing Machine :Definition of Recursive and Recursively Enumerable , Church’s Hypothesis ,
Computable Functions , Methods for Turing Machine Construction, Modifications of the Basic
Turing Machine Model, Multiple Tape , Multiple Tracks, Non-determinism, etc. Equivalence of the
different TM Models and the Basic TM Model.

Unit 5 [8 Hrs]
Computability Theory : Chomsky hierarchy of languages, linear bounded automata and
context sensitive language, LR(0) grammar, decidability of, problems, Universal Turing Machine,
undecidability, Posts Correspondence problem, Turing reducibility, Definition of P and NP problems,
NP complete and NP hard problems.

TEXT BOOKS : 
1. “Introduction to Automata Theory Languages and Computation”. Hopcroft H. E. and Ullman
J. D. Pearson Education.
 2. Introduction to Theory of Computation – Sipser 2nd edition Thomson .

REFERENCES BOOKS: 
1. Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan
Rama R.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley. 
3. Theory of Computation: A Problem - Solving Approach, Kavi Mahesh, Wiley India Pvt. Ltd.
4. “Elements of Theory of Computation”, Lewis H.P. &PapadimitionC.H. Pearson /PHI. 
Theory of Computer Science – Automata languages and computation -Mishra and
Chandrashekaran, 2nd edition, PHI.
CS4T004 Computer Network 3 Credit

Course Objectives:
1. Acquire the computer networking knowledge as well as the existing connectivity technologies
and the required infrastructure which comprises the key steps involved in the communication process.
2. Identify the key issues for the realization of the LAN/WAN/MAN network
3. Establish a solid knowledge of the layered approach that makes design, implementation and
operation of extensive networks possible. To learn the 7-layer OSI network model (each layer and its
responsibilities) and understand the TCP/IP suite of protocols and the networked applications
supported by it.
4. Establish a solid knowledge of the layered approach that makes design, implementation, and
operation of extensive networks possible.
5. Acquire the knowledge of the basic protocols involved in wired/wireless communication process
6. Acquire the computer networking knowledge as well as the existing connectivity technologies and
the required infrastructure which comprises the key steps involved in the communication process..

Course Outcomes:
1. Defining, using and implementing Computer Networks and the basic components of a Network
system, explain the importance of data communications, how communication works in data networks.
2. Evaluate data communication link considering elementary concepts of data link layer protocols
for error detection and correction.
3. Apply various network layer techniques for designing subnets and supernets and analyse packet
flow on basis of routing protocols.
4. Estimate the congestion control mechanism to improve quality of service of networking
application
5. Analyze the features and operations of various application layer protocols such as Http, DNS,
Telnet, FTP and SMTP.
Course Contents:
Unit 1 [8 Hrs]
Data and Signal: Define data, signal. Time domain and frequency domain representation of signal,
bandwidth of a signal and medium, Sources of impairment, Attenuation, distortion, noise, data rate
Limits and Nyquist bit rate, FDM and TDM, synchronous and asynchronous TDM.

Unit 2 [8 Hrs]
Introduction of LAN; MAN; WAN; PAN, Ad-hoc Network, Network Architectures: Client-
Server; Peer to Peer; OSI Model, TCP/IP Model, Topologies, Data Link Layer: Data Link Layer
Design Issues: Service provided to network layer Framing, Error Control, Flow Control, Error
Detection and Correction, Data Link Control, Multiple Access.

Unit 3 [8 Hrs]
Network Layer: Design issues, store and forward packet switching connection less and connection
oriented networks-routing algorithms-optimality principle, shortest path, flooding, Distance Vector
Routing, Control to Infinity Problem, Hierarchical Routing, Congestion control algorithms.

Unit 4 [8 Hrs]
Transport Layer: UDP, TCP, Connection establishment and termination, sliding window revisited,
flow and congestion control, timers, retransmission, TCP extensions, etc.

Unit 5 [8 Hrs]
Application Layer: Application protocols for email, ftp, web, DNS
Unit 6 [8 Hrs]
Advanced Networking: overview to network management systems; security threats and solutions –
Firewalls, Access Control Lists, IPSec, IDS

Textbook:
1. Data Communications and Networking - Behrouz A. Forouzan, Fifth Edition TMH, 2013.
2. Computer Networks - Andrew S Tanenbaum, 4th Edition, Pearson Education.
3. Kurose and Ross, "Computer Networking - A top-down approach", Seventh Edition, Pearson,
2017.
4. Peterson and Davie, "Computer Networks, A Systems Approach'', 5th ed., Elsevier, 2011.
Reference Book:
1. An Engineering Approach to Computer Networks - S. Keshav, 2nd Edition, Pearson
Education.
2. Understanding communications and Networks, 3rd Edition, W. A. Shay, Cengage Learning.

CS4T005 Database Management Systems Credit-3

Course Outcomes:
1. To Eliminate redundant data.
2. To Make access to the data easy for the user.
3. To Provide for mass storage of relevant data.
4. To Make the latest modifications to the data base available immediately.
5. To Protect data from physical harm and un-authorised systems.
6. To Allow multiple users to be active at one time..

Course Outcomes:
1. Student shall be able to learn and understand fundamentals of database management system
2. Student shall be able to exhibit the query development knowledge
3. Student shall be able to learn modeling and normalization of databases.
4. Student shall be able to learn query processing and optimization techniques.
5. Students shall be able to exhibit to File Organization, Indexing and Hashing
6. Student shall be able to exhibit the knowledge of transaction and concurrency control.

Course Contents:
Unit 1 [8 Hrs]
Introduction to Database Systems: Significance and advantages, Types of Databases, Limitations of
File processing system, the DBMS Environment, Data Abstraction, Data Independence, Data
DefinitionLanguage (DDL), Data Manipulation Language (DML).
Data models: Evolution of Data Models, Entity-relationship model, Relational integrity constraints,
data manipulation operations.

Unit 2 [8 Hrs]
Relational query languages: Relational algebra, Tuple and domain relational calculus,SQL3, DDL
and DML constructs, Open source and Commercial DBMS- MYSQL,ORACLE, DB2, SQL server.

Unit 3 [8 Hrs]
Relational database design: Normalization of Database Tables: Need and Significance, Domain and
data dependency, Armstrong's axioms, Normal Forms, Dependency preservation, Lossless design.

Unit 4 [8 Hrs]
Query processing: Evaluation of relational algebra expressions, Query equivalence, Join strategies.

Unit 5 [8 Hrs]
File Organization and Indexing: Indices, B-trees, hashing.

Unit 6 [8 Hrs]
Transaction processing: Concurrency control, ACID property, Serializability of scheduling, Locking
and timestamp based schedulers, Multi-version and optimistic Concurrency Control schemes,
Database recovery.

Text Books:
1. Henry Korth, Abraham Silberschatz& S. Sudarshan, Database System Concepts, McGraw-Hill
Publication, 6th Edition, 2011.
2. Bipin Desai, An Introduction to Database System, West Publishing Company, College & School
Division, 1990.
3. RaghuRamakrishnan, Johannes Gehrke, Database Management Systems, McGraw-Hill
Publication, 3rd Edition, 2003.

Reference Books:
1. Joel Murach, Murach's Oracle SQL and PL/SQL for Developers, Mike Murach& Associates, 2nd
Edition, 2014.
2. Wiederhold, Database Design, McGraw-Hill Publication, 2nd Edition, 1983.
3. Navathe, Fundamentals of Database System, Addison-Wesley Publication, 6th Edition, 2012.
4. J. D. Ullman, “Principles of Database and Knowledge – Base Systems”,Vol 1, Computer Science
Press.
 CS4L006 Discrete Mathematics & Graph Structures Credit-3

Course Objective:
1.To develop logical thinking and its application to computer science

2. The subject enhances one’s ability to reason and ability to present a coherent and mathematically
accurate argument

Course Outcomes:

1.Be able to construct simple mathematical proofs and possess the ability to verify them ABET

2. Acquire ability to describe computer programs (e.g. recursive functions) in a formal mathematical
manner

3. Be able to apply basic counting techniques to solve combinatorial problems

Course Contents:
Unit 1 [6 hrs]
Fundamental Structures and Basic Logic: Sets, Venn diagram, Cartesian product, Power sets,
Cardinality and countability, Propositional logic, Logical connectives, Truth tables, Normal forms,
Validity, Predicate logic, Limitations of predicate logic, Universal and existential quantification, First
order logic.
Principles of Mathematical Induction: The Well-Ordering Principle, Recursive definition, The
Division algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean Algorithm, The
Fundamental Theorem of Arithmetic.
Unit 2 [6 hrs]
Functions and Relations: Subjective, Injective, Bijective and inverse functions, Composition of
function, Reflexivity, Symmetry, Transitivity and equivalence relations.
Unit 3 [6 hrs]
Combinatorics: Counting, Recurrence relations, generating functions.
Unit 4 [6 hrs]
Graph Theory: Basic terminology, Multi graphs and weighted graphs, Paths and circuits, Shortest
path problems, Euler and Hamiltonian paths, Representation of graph, Isomorphic graphs, Planar
graphs, Connectivity, Matching Coloring.
Unit 5 [6 hrs]
Trees: Rooted trees, Path length in rooted tree, Binary search trees, Spanning trees and cut set,
Minimal spanning trees, Kruskal’s and Prim’s algorithms for minimal spanning tree.
Unit 6 [6 hrs]
Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, Semi
Groups, Monoids, Groups, Congruence Relation and Quotient79 Structures, Free and Cyclic
Monoids and Groups, Permutation Groups, Substructures, Normal Subgroups, Algebraic Structures
with two Binary Operation, Rings, Integral Domain and Fields. Boolean Algebra and Boolean Ring,
Identities of Boolean Algebra, Duality, Representation of Boolean Function, Disjunctive and
Conjunctive Normal Form
CS4L007 JAVA (Lab) Credit- 1

Course Objectives:

1 To learn the Advanced concepts in J2SE

To understand Web Application Development, Database Connectivity and its

2
Implementation using Servlets, JSP and JDBC
3 To introduce advanced Java frameworks for improving the web application design.

Course Outcomes:

1 Student shall be able to Understand and implement advanced Java concepts.

2 Student shall be able to Develop Java based Web applications using Servlets and JSP
Student shall be able to Incorporate cutting-edge frameworks in web application
3
development.

List of Experiments
1. Write a Servlet to display “Hello World” on browser.
2. Assume that the information regarding the marks for all the subjects of a student in the last exam
are available in a database, Develop a Servlet which takes the enrolment number of a student as a
request parameter and displays the mark sheet for the student.
3. Develop a Servlet which looks for cookies for username and password, and forwards to a home.jsp
in case the cookies are valid and forwards to login.jsp, in case the cookies are not found or the
cookies are not valid.
4. Develop a Servlet to authenticate a user, where the login id and password are available as request
parameters. In case the authentication is successful, it should setup a new session and store the user's
information in the session before forwarding to home.jsp, which displays the user's information like
full name, address, etc.
5. Create Servlet file which contains following functions:
1. Connect
 2. Create Database
3. Create Table
4. Insert Records into respective table
5. Update records of particular table of database
6. Delete Records from table.
7. Delete table and also database
6. User can create a new database and also create new table under that database. Once database has
been created then user can perform database operation by calling above functions. Use following Java
Statement interface to implement program:
a) Prepared Statement
b) Callable statement
7. Study and implement Hibernate.
8. Study and Implement MVC using Spring Framework.
 CS4L008 Computer Networks (Lab) Credit- 1

Course Objectives:
1. Acquire the computer networking knowledge as well as the existing connectivity technologies
and the required infrastructure which comprises the key steps involved in the communication process.
2. Identify the key issues for the realization of the LAN/WAN/MAN network
3. Establish a solid knowledge of the layered approach that makes design, implementation and
operation of extensive networks possible. To learn the 7-layer OSI network model (each layer and its
responsibilities) and understand the TCP/IP suite of protocols and the networked applications
supported by it.
4. Establish a solid knowledge of the layered approach that makes design, implementation, and
operation of extensive networks possible.
5. Acquire the knowledge of the basic protocols involved in wired/wireless communication process
6. Acquire the computer networking knowledge as well as the existing connectivity technologies and
the required infrastructure which comprises the key steps involved in the communication process..

Course Outcomes:
1. Defining, using and implementing Computer Networks and the basic components of a Network
system, explain the importance of data communications, how communication works in data networks.
2. Evaluate data communication link considering elementary concepts of data link layer protocols
for error detection and correction.
3. Apply various network layer techniques for designing subnets and supernets and analyse packet
flow on basis of routing protocols.
4. Estimate the congestion control mechanism to improve quality of service of networking
application
5. Analyze the features and operations of various application layer protocols such as Http, DNS,
Telnet, FTP and SMTP.
List of Experiment:-
1. Implement three nodes point – to – point network with duplex links between them. Set the
queue size, vary the bandwidth and find the number of packets dropped using NS
2. Implement transmission of ping messages/trace route over a network topology consisting
of 6 nodes and find the number of packets dropped due to congestion using NS
3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source / destination using NS
4. Implement and study the performance of CDMA on NS2/NS3 (Using stack called Call net)
or equivalent environment using NS
5. Write a Program for ERROR detecting code using CRC-CCITT (16bit).
6. Write a program to find the shortest path between vertices using bellman-ford algorithm
7. Study of Network simulator (NS) and simulation of Congestion Control Algorithms using
NS
8. Configure Host IP, Subnet Mask and Default Gateway in a System in LAN (TCP/IPConfiguration)

Course Objectives:
1. Acquire the computer networking knowledge as well as the existing connectivity technologies
and the required infrastructure which comprises the key steps involved in the communication process.
2. Identify the key issues for the realization of the LAN/WAN/MAN network
3. Establish a solid knowledge of the layered approach that makes design, implementation and
operation of extensive networks possible. To learn the 7-layer OSI network model (each layer and its
responsibilities) and understand the TCP/IP suite of protocols and the networked applications
supported by it.
4. Establish a solid knowledge of the layered approach that makes design, implementation, and
operation of extensive networks possible.
5. Acquire the knowledge of the basic protocols involved in wired/wireless communication process
6. Acquire the computer networking knowledge as well as the existing connectivity technologies and
the required infrastructure which comprises the key steps involved in the communication process..

Course Outcomes:
1. Defining, using and implementing Computer Networks and the basic components of a Network
system, explain the importance of data communications, how communication works in data networks.
2. Evaluate data communication link considering elementary concepts of data link layer protocols
for error detection and correction.
3. Apply various network layer techniques for designing subnets and supernets and analyse packet
flow on basis of routing protocols.
4. Estimate the congestion control mechanism to improve quality of service of networking
application
5. Analyze the features and operations of various application layer protocols such as Http, DNS,
Telnet, FTP and SMTP.
List of Experiment:-
1. Implement three nodes point – to – point network with duplex links between them. Set the
queue size, vary the bandwidth and find the number of packets dropped using NS
2. Implement transmission of ping messages/trace route over a network topology consisting
of 6 nodes and find the number of packets dropped due to congestion using NS
3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source / destination using NS
4. Implement and study the performance of CDMA on NS2/NS3 (Using stack called Call net)
or equivalent environment using NS
5. Write a Program for ERROR detecting code using CRC-CCITT (16bit).
6. Write a program to find the shortest path between vertices using bellman-ford algorithm
7. Study of Network simulator (NS) and simulation of Congestion Control Algorithms using
NS
8. Configure Host IP, Subnet Mask and Default Gateway in a System in LAN (TCP/IPConfiguration)
 CS4L009 Database Management Systems (Lab) Credit - 1

Course Objectives:
1. To Eliminate redundant data.
2. To Make access to the data easy for the user.
3. To Provide for mass storage of relevant data.
4. To Make the latest modifications to the data base available immediately.
5. To Protect data from physical harm and un-authorised systems.
6. To Allow multiple users to be active at one time..

Course Outcomes:
1. Student shall be able to learn and understand fundamentals of database management system
2. Student shall be able to exhibit the query development knowledge
3. Student shall be able to learn modeling and normalization of databases.
4. Student shall be able to learn query processing and optimization techniques.
5. Students shall be able to exhibit to File Organization, Indexing and Hashing
6. Student shall be able to exhibit the knowledge of transaction and concurrency control.

List of Experiments:
1. Defining schema for applications.
2. Creating tables, Renaming tables, Data constraints (Primary key, Foreign key, Not Null), Data
insertion into a table.
3. Grouping data, aggregate functions, Oracle functions (mathematical, character functions).
4. Sub-queries, Set operations, Joins.
5. Creation of databases, writing SQL and PL/SQL queries to retrieve information from the
databases.
6. Assignment on Triggers & Cursors.
7. Normal Forms: First, Second, Third and Boyce Codd Normal Forms.
 8. Assignment in Design and Implementation of Database systems or packages for applications
such as office automation, hotel management, hospital management.
9. Deployment of Forms, Reports Normalization, Query Processing Algorithms in the above
application project.
10. Large objects – CLOB, NCLOB, BLOB and BFILE.
11. Distributed data base Management, creating web-page interfaces for database applications
using servlet.

Recommendations for specialization B.Tech. with Honor (Major) and B. Tech. with Minor
Engineering Degree

1. The concept of Honor and Minors at B. Tech. level is introduced, to enhance learning skills of
students, acquisition of additional knowledge in domains and other than the discipline being
pursued by the student through online mode, to make the students better employable with
additional knowledge and encourage students to pursue cross-discipline research.

2. Eligibility Criteria and rules to award Honors

i) The Student should have Minimum CGPA of 7.5 up to 2nd Semester.

ii) Student willing to opt for honors has to register in 2nd year.
iii) The Student has to complete 6 to 7 additional advanced courses from the same discipline
specified in the curriculum. Total credits of these courses should be between 18 to 20. The
students should complete these credits before the end of last semester.
iv) Student to opt for the courses from NPTEL/SWAYAM platform as recommend by
concern BOS.
v) If the credits of NPTEL/ SWAYAM courses do not match then proper scaling will be
done).
Student complying with above criteria will be awarded B. Tech. with Honor Degree.
3. Eligibility Criteria and rules to award Minor Degree

i) The Student should have Minimum CGPA of 7.5 up to 2nd Semester.

ii) Student willing to opt for honors has to register in 2nd year.
iii) The Student has to complete 6-7 additional courses from other discipline of their interest,
which are specified in the respective discipline. These courses are of total 18-20 credits.
iv) Student to opt for the courses from NPTEL/SWAYAM platform as recommended by
concern BOS.
 v) If the credits of NPTEL/ SWAYAM courses do not match then proper scaling will be
done).
Student complying with above criteria will be awarded B. Tech. with Minor Degree.

4. Availability of course from MOOC platform will be reviewed by the Major and Minor committee
before beginning of semester.
 J D College of Engineering & Management
An Autonomous Institute
(Affiliated to Dr. Babasaheb Ambedkar Technological University, Lonere)
Bachelor of Technology in Computer Science & Engineering
With effect from the Academic Year 2020-2021
Course Mapping with NPTEL/SWAYAM Online Platform

LIST OF DOMAINS (Major)

(For Depts Autonomous)
Domain Name (4 Core + 2 Elective) Minimum of 30 Weeks

Sr.No Name Category

1 Artificial Intelligence Core
2 Data Science Core
3 Programming Core
4 Foundation of Computing Core
5 System Core
 J D College of Engineering & Management
An Autonomous Institute
(Affiliated to Dr. Babasaheb Ambedkar Technological University, Lonere)
Bachelor of Technology in Computer Science & Engineering
With effect from the Academic Year 2020-2021
Course Mapping with NPTEL/SWAYAM Online Platform

Subjects for Major Domain- Semester Wise (20 Credits)

1. Artificial Intelligence (4 Core + 2 Elective) Minimum of 60 Weeks (For Depts Autonomous)

Name of Duration of
Sr Semeste SME (Subject Matter
Title of SWAYAN - NPTEL Course Course ID Institute Course Credit(s) Category
No r Expert)
offering course (Weeks)
Artificial Intelligence : Search
01 III Prof. Deepak Khemani 106106126 12 weeks 3 Core
Methods For Problem solving IIT Madras
Artificial Intelligence: Knowledge
02 IV Prof. Deepak Khemani 106106140 IIT Madras 12 weeks 3 Core
Representation and Reasoning
Programming, Data Structures and Chennai
03 V Prof. Madhavan Mukund 106106145 Mathematical 8 weeks 2 Core
Algorithms in Python Institute
04 VI Introduction to Machine Learning Prof. Sudeshna Sarkar 106105152 IIT Kharagpur 8 weeks 2 Core
10610618
Deep Learning Prof. MiteshKhapra IIT Madras 12 weeks 3 Elective
05 VII 4
Reinforcement Learning Prof. Balaraman 10610614 IIT Madras 12 weeks 3 Elective
06 VIII Ravindran 3
10610615
AI:Constraint Satisfaction Prof. Deepak Khemani IIT Madras 8 weeks 2 Elective
8
Prof. Jayanta 10610521
(OR)Computer Vision IIT Kharagpur 12 weeks 3 Elective
Mukhopadhyay 6

(OR)Natural Language Processing Prof. Pawan Goyal 10610515 IIT Kharagpur 12 weeks 3 Elective
8
2. Data Science (4 Core + 2 Elective) Minimum of 60 Weeks
Name of Duration of
Sr Semeste SME (Subject Matter
Title of SWAYAN - NPTEL Course Course ID Institute Course Credit(s) Category
No r Expert)
offering course (Weeks)
Chennai
Programming, Data Structures and
01 III Prof. MadhavanMukund 106106145 Mathematical 8 weeks 2 Core
Algorithms in Python
Institute
Prof. NandanSudarsanam
02 IV Introduction to Data Analytics Prof. 110106072 IIT Madras 08 weeks 2 Core
BalaramanRavindran
03 V Introduction to Machine Learning Prof. Sudeshna Sarkar 106105152 IIT Kharagpur 8 weeks 2 Core
Deep Learning Prof. Mitesh Khapra 106106184 IIT Madras 12 weeks 3 Elective
04 VI Prof. Balaraman
Reinforcement Learning 106106143 IIT Madras 12 weeks 3 Elective
Ravindran
Artificial Intelligence:Search
Prof. Deepak Khemani 106106126 IIT Madras 12 weeks 3 Elective
methods for Problem solving
05 VII
Artificial Intelligence: Knowledge
Prof. Deepak Khemani 106106140 IIT Madras 12 weeks 3 Elective
Representation and Reasoning
Prof. Jayanta
Computer Vision 106105216 IIT Kharagpur 12 weeks 3 Elective
Mukhopadhyay
06 VIII
Natural Language Processing Prof. Pawan Goyal 106105158 IIT Kharagpur 12 weeks 3 Elective
3.Programming (4 Core + 2 Elective) Minimum of 60 Weeks
Name of Duration of
Sr Semeste Credit(s
Title of SWAYAN - NPTEL Course SME (Subject Matter Expert) Course ID Institute offering Course Category
No r )
course (Weeks)
Chennai
01 III Programming, Data Structures and
Prof. Madhavan Mukund 106106145 Mathematical 8 weeks 2 Core
Algorithms in Python
Institute
02 IV
Programming in C++ Prof. Partha Pratim Das 106105151 IIT Kharagpur 8 weeks 2 Core
03 V
Programming in Java Prof. Rajib Mall 106105191 IIT Kharagpur 12 weeks 3 Core

04 VI Database Management System Prof. Partha Pratim Das 106105175 IIT Kharagpur 8 weeks 2 Core
Prof. Ragunathan
Data Science for Engineers Rengasamy, Prof. Shankar 106106179 IIT Madras 8 weeks 2 Elective
Narasimhan
05
VII Cloud computing Prof. Soumya Kanti Ghosh 106105167 IIT Kharagpur 8 weeks 2 Elective

Introduction to Internet of Things Prof. Sudip Misra 106105166 IIT Kharagpur 12 weeks 3 Elective

Introduction to Machine Learning Prof. Sudeshna Sarkar 106105152 IIT Kharagpur 8 weeks 2 Elective

06 VIII Persistent
Prof. Aamod Sane, Prof.
OR Modern Application Computing
Abhijat Vichare, Prof. 106106222 12 weeks 3 Elective
Development Systems &
Madhavan Mukund
CMI
4. Foundation of Computing (4 Core + 2 Elective) Minimum of 60 Weeks
Name of Duration of
Sr SME (Subject Matter
Semester Title of SWAYAN - NPTEL Course Course ID Institute offering Course Credit(s) Category
No Expert)
course (Weeks)
Chennai
01 III
Discrete Mathematics Prof. SouravChakraborty 111106086 Mathematical 12 weeks 3 Core
Institute
Chennai
02 IV Design and Analysis of Algorithms Prof. MadhavanMukund 106106131 Mathematical 8 weeks 2 Core
Institute
Chennai
Programming, Data Structures and
03 V Prof. MadhavanMukund 106106145 Mathematical 8 weeks 2 Core
Algorithms in Python
Institute
04 VI Theory of Computation Prof. RaghunathTewari 106104148 IIT Kanpur 8 weeks 2 Core

Randomized Algorithms Prof. Benny George K 106103187 IIT Guwahati 12 weeks 3 Elective

05 VII Parallel Algorithms Prof. SajithGopalan 106103188 IIT Guwahati 12 weeks 3 Elective

Modern Algebra Prof. Manindra Agrawal 106104149 IIT Kanpur 8 weeks 2 Elective

Graph Theory Prof. SoumenMaity 111106102 IISER Pune 8 weeks 2 Elective

06 VIII
Computational Geometry Prof. Amit Kumar 106102011 IIT Delhi 12 weeks 3 Elective
 Arithmetic Circuit Complexity Prof. NitinSaxena 106104221 IIT Kanpur 12 weeks 3 Elective

Mathematical Logic Prof. Arindama Singh 111106052 IIT Madras 8 Weeks 2 Elective

5.System (4 Core + 2 Elective) Minimum of 60 Weeks

Sr Name of Duration of
Semeste
N Title of SWAYAN - NPTEL Course SME (Subject Matter Expert) Course ID Institute offering Course Credit(s) Category
r
o course (Weeks)

01 III Compiler Design Prof. Santanu Chattopadhyay 106105190 IIT Kharagpur 12 weeks 3 Core

02 IV Introduction to Operating Systems Prof. Chester Rebeiro 106106144 IIT Madras 12 weeks 3 Core

Computer Networks and Internet Prof. Soumya Kanti Ghosh

03 V 106105183 IIT Kharagpur 12 weeks 3 Core
Protocol & Prof. Sandip Chakraborty
04 VI Introduction to Database Systems Prof. Sreenivasa Kumar 106106220 IIT Madras 12 weeks 3 Core
Cloud computing Prof. Soumya Kanti Ghosh 106105167 IIT Kharagpur 8 weeks 2 Elective
Information Security - 5 - Secure
05 VII
Prof. Chester Rebeiro 106106199 IIT Madras 8 weeks 2 Elective
Systems Engineering
Introduction to Parallel Programming in
Prof. Yogish Sabharwal 106102163 IIT Delhi 4 weeks 1 Elective
OpenMP
06 VIII Introduction to Internet of Things Prof. Sudip Misra 106105166 IIT Kharagpur 12 weeks 3 Elective
MultiCore Computer Architecture- Prof. John Jose 106103183 IIT Guwahati 8 weeks 2 Elective
Storage and Interconnects
Internetwork Security Prof. Sourav Mukhopadhyay 106105162 IIT Kharagpur 12 weeks 3 Elective
Syllabus Major Domain: 1. Artificial Intelligence

1. Artificial Intelligence: Search Methods For Problem solving

Instructor Name: Artificial Intelligence : Search Type of Course : Core
Methods For Problem solving Course Duration: 12 weeks
Institute: IIT Madras Credit :3
Department: Computer Science

Pre Requisites : Nil

Industry Support: Any industry that is involved in development of AI applications. This not only
includes software companies (like Microsoft, Google, and Facebook) but also manufacturing companies
like Ford and General Electric, and retail companies like Amazon and Flipkart.
COURSE PLAN

Sr.No Week Module Name

.
Introduction and Historical Perspective: Mind, Reasoning, Computation,
1 1
Chess
2 2 State Space Search: Depth First Search, Breadth First Search, DFID

3 3 Heuristic Search: Best First Search, Hill Climbing, Beam Search

4 4 Traveling Salesman Problem, Tabu Search, Simulated Annealing

Population Based Search: Genetic Algorithms, Ant Colony Optimization
5 5

6 6 Branch & Bound, Algorithm A*, Admissibility of A*

7 7 Monotone Condition, IDA*, RBFS, Pruning OPEN and CLOSED in A*

8 8 Problem Decomposition, Algorithm AO*, Game Playing

9 9 Game Playing: Algorithms Minimax, AlphaBeta, SSS*

10 10 Rule Based Expert Systems, Inference Engine, Rete Algorithm

Planning: Forward/Backward Search, Goal Stack Planning, Sussman’s
11 11
Anomaly
12 12 Plan Space Planning, Algorithm Graphplan
 2.Artificial Intelligence: Knowledge Representation and Reasoning
Instructor Name: Prof. Deepak Khemani Type of Course : Core
Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Nil

Industry Support: Microsoft, Google, and Facebook
COURSE PLAN
Sr.No Week Module Name
.
1 1 Introduction
Propositional Logic Language,Semantics and Reasoning, Syntax and Truth
Values, Valid Arguments and Proof Systems, Rules of Inference and Natural
2 2
Deduction, Axiomatic Systems and Hilbert Style Proofs, The Tableau Method,
The Resolution Refutation Method
First Order Logic (FOL) Syntax, Semantics, Entailment and Models, Proof
Systems, Forward Chaining, Unification, Forward Chaining Rule Based
3 3 Systems, The Rete Algorithm, Programming in a Rule Based Language, The
OPS5 Expert System Shell
Representation in FOL Skolemization, Knowledge Representation, Properties
4 4 and Categories, Reification and Abstract Entities, Resource Description
Framework (RDF), The Event Calculus: Reasoning About Change
Mapping Natural Language to FOL Understanding = Fulfilling Expectations,
5 5 Conceptual Dependency (CD) Theory, Understanding Language, Conceptual
Analysis: Mapping English to CD Theory
Programming in Logic Deductive Retrieval in Backward Chaining, Logic
6 6 Programming, Prolog, Depth First Search and Efficiency Issues, Controlling
Search, The Cut Operator in Prolog
Theorem Proving in FOL Incompleteness of Forward and Backward Chaining,
7 7 The Resolution Refutation Method for FOL, Clause Form and The Resolution
Rule, FOLwith Equality, Complexity

Knowledge Structures Semantic Nets using Frames, Scripts, Script Applier

8 8 Mechanism (SAM), Goals, Plans and Actions, Plan Applier Mechanism
(PAM):Expectations and Recognition, PAM: Top Down and Bottom Up
Reasoning
Ontology and Description Logics A Description Logic, Normalisation,
9 9 Structure Matching, Classification, A-box Reasoning, Extensions, ALC,
Further Extensions
Inheritance Taxonomies and Inheritance, Beliefs, Credulous and Skeptical
10 10 Reasoning
 Default Reasoning Introduction to Default Reasoning, Circumscription,
11 11 Minimal Models, The Event Calculus Revisited, Default Logic, Autoepistemc
Logic
Reasoning in Multi-agent Systems Epistemic Logic:Kripke Semantics in a
12 12 MultiAgent Scenario, The Muddy Children Puzzle

3.Programming, Data Structures and Algorithms in Python

Instructor Name: Prof. Madhavan Mukund Type of Course : Core
Institute: Chennai Mathematical Institute Course Duration: 8 weeks
Department: Computer Science Credit :2
Pre
Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No Week Module Name

.
Informal introduction to programming, algorithms and data structures viagcd
1 1 Downloading and installing Python gcd in Python: variables, operations, control
flow - assignments, condition-als, loops, functions
Python: types, expressions, strings, lists, tuples
Python memory model: names, mutable and immutable values
List operations: slices etc Binary search
2 2 Inductive function denitions: numerical and structural induction
Elementary inductive sorting: selection and insertion sort
In-place sorting
Basic algorithmic analysis: input size, asymptotic complexity, O() notation
Arrays vs lists
3 3 Merge sort
Quicksort
Stable sorting
Dictionaries
More on Python functions: optional arguments, default values
4 4
Passing functions as arguments
Higher order functions on lists: map, lter, list comprehension
Exception handling
Basic input/output
5 5
Handling files
String processing
Backtracking: N Queens, recording all solutions
Scope in Python: local, global, nonlocal names
6 6 Nested functions
Data structures: stack, queue
Heaps
7 7 Abstract datatypes
Classes and objects in Python
"Linked" lists: find, insert, delete
Binary search trees: find, insert, delete
 Height-balanced binary search trees
Effcient evaluation of recursive denitions: memoization
Dynamic programming: examples
8 8
Other programming languages: C and manual memory management
Other programming paradigms: functional programming

4. Introduction to Machine Learning

Instructor Name: Prof. Sudeshna Sarkar Type of Course : Core
Institute: IIT Khagragpur Course Duration: 8 weeks
Department: Computer Science Credit :2

Pre Requisites : Basic programming skills (in Python), algorithm design, basics of probability &
statistics
Industry Support: Data science companies and many other industries value machine learning skills.
COURSE PLAN
Sr.No. Week Module Name
Introduction: Basic denitions, types of learning, hypothesis space and
1 1
inductive bias, evaluation, cross-validation

2 2 Linear regression, Decision trees, overtting

Instance based learning, Feature reduction, Collaborative ltering based
3 3
recommendation.
4 4 Probability and Bayes learning
Logistic Regression, Support Vector Machine, Kernel function and Kernel
5 5
SVM
Neural network: Perceptron, multilayer network, backpropagation,
6 6
introduction to deep neural network.
Computational learning theory, PAC learning model, Sample complexity,
7 7
VC Dimension, Ensemble learning
Clustering: k-means, adaptive hierarchical clustering, Gaussian mixture
8 8
model.
 5.Deep Learning
Instructor Name: Prof. MiteshKhapra Type of Course : Elective
Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Working knowledge of Linear Algebra, Probability Theory. It would be beneficial
if the participants have done a course on Machine Learning.
Industry Support: Any company in the data analytics/data science/big data domain would value this
course..

COURSE PLAN

Sr.No. Week Module Name

History of Deep Learning, Deep Learning Success Stories, McCulloch Pitts
1 1
Neuron, Thresholding Logic, Perceptrons, Perceptron Learning Algorithm.

Multilayer Perceptrons (MLPs), Representation Power of MLPs, Sigmoid

2 2
Neurons, Gradient Descent, Feedforward Neural Networks

3 3 FeedForward Neural Networks, Backpropagation.

Gradient Descent (GD), Momentum Based GD, Nesterov Accelerated GD,

4 4
Stochastic GD, AdaGrad, RMSProp.
Principal Component Analysis and its interpretations, Singular Value
5 5
Decomposition
Auto encoders and relation to PCA, Regularization in autoencoders, Denoising
6 6
auto encoders, Sparse auto encoders, Contractive autoencoders.
Regularization: Bias Variance Tradeo-, L2 regularization, Early stopping,
7 7
Dataset augmentation, Parameter sharing and tying.
Greedy Layerwise Pre-training, Better activation functions, Better weight
8 8
initialization methods, Batch Normalization
Convolution Neural Networks, LeNet, AlexNet, ZF-Net, VGGNet, GoogLeNet,
9 9
ResNet.

10 10 Learning Victoria Representations of Words.

11 11 Recurrent Neural Networks, Backpropagation through time.

12 12 Encoder Decoder Models, Attention Mechanism, Attention over images.
 6. Reinforcement Learning
Instructor Name: Prof. Balaraman Ravindran Type of Course : Elective
Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites :  Any interested learner

Industry Support: Data analytics/data science/robotics

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction
2 2 Bandit algorithms – UCB, PAC

3 3 Bandit algorithms –Median Elimination, Policy Gradient

4 4 Full RL & MDPs

5 5 Bellman Optimality

6 6 Dynamic Programming & TD Methods

7 7 Eligibility Traces

8 8 Function Approximation

9 9 Least Squares Methods

10 10 Fitted Q, DQN & Policy Gradient for Full RL

11 11 Hierarchical RL

12 12  POMDPs
7. AI:Constraint Satisfaction
Instructor Name: Prof. Deepak Khemani Type of Course : Elective
Institute: IIT Madras Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Artificial Intelligence: Search Methods for Problem Solving

Industry Support: Data analytics/data science/robotics
COURSE PLAN
Sr.No. Wee Module Name
k
1 1 Constraint satisfaction problems (CSP), examples.

2 2 Constraint networks, equivalent and projection networks

3 3 Constraint propagation, arc consistency, path consistency, inconsistency.

Directional consistency and graph ordering, backtrack free search, adaptive

4 4
consistency.
Search methods for solving CSPs, look ahead methods, dynamic variable and
5 5
value ordering
Loopback methods, Gasfhnig's backjumping, graph based backjumping, confift
6 6
directed back jumping. Combing look ahead with loopback, learning

7 7 Model based systems, model based diagnosis

8 8 Truth maintenance systems, planning as CSP. Wrapping up

8.Computer Vision

Instructor Name: Prof. Jayanta Mukhopadhyay Type of Course : Elective

Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3
Pre Requisites : Linear Algebra, Vector Calculus, Data Structures and Programming
Industry Support: Provide exposure to clustering, classification and deep learning techniques applied
in this area.
COURSE PLAN
Sr.No. Week Module Name
1 1 Fundamentals of Image Processing
2 2 2-D Projective Geometry and Homography

3 3 Properties of Homography

4 4 Camera Geometry

5 5 Stereo Geometry

6 6 Feature detection and description

7 7 Feature matching and model fitting

8 8 Color Processing

9 9 Range image processing

10 10 Clustering and classification

11 11 Dimensionality Reduction and Sparse Representation

12 12 Deep Neural Architecture and applications

 9.Natural Language Processing
Instructor Name: Prof. Pawan Goyal Type of Course : Elective
Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Basic knowledge of probabilities for the lectures and python for programming
assignment

Industry Support: Microsoft Research, Google, Adobe, Xerox, Flipkart, Amazon

COURSE PLAN

Sr. No. Week Module Name

1 1 Introduction and Basic Text Processing

2 2 Spelling Correction, Language Modeling
3 3 Advanced smoothing for language modeling, POS tagging
4 4 Models for Sequential tagging – MaxEnt, CRF
5 5 Syntax – Constituency Parsing

6 6 Dependency Parsing

7 7 Lexical Semantics

8 8 Distributional Semantics

9 9 Topic Models

10 10 Entity Linking, Information Extraction

11 11 Text Summarization, Text Classication

12 12 Sentiment Analysis and Opinion Mining

 Syllabus Major Domain: 2. Data Science

1.Programming, Data Structures and Algorithms in Python

Instructor Name: Prof. MadhavanMukund Type of Course : Core

Institute: Chennai Mathematical Institute Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

Informal introduction to programming, algorithms and data structures
viagcd
1 1 Downloading and installing Python
gcd in Python: variables, operations, control flow - assignments,
condition-als, loops, functions
Python: types, expressions, strings, lists, tuples
Python memory model: names, mutable and immutable values
List operations: slices etc Binary search
2 2 Inductive function denitions: numerical and structural induction
Elementary inductive sorting: selection and insertion sort
In-place sorting
Basic algorithmic analysis: input size, asymptotic complexity, O()
notation
3 3 Arrays vs lists
Merge sort
Quicksort
Stable sorting
Dictionaries
More on Python functions: optional arguments, default values
4 4
Passing functions as arguments
Higher order functions on lists: map, lter, list comprehension
Exception handling
Basic input/output
5 5
Handling files
String processing
Backtracking: N Queens, recording all solutions
Scope in Python: local, global, nonlocal names
6 6 Nested functions
Data structures: stack, queue
Heaps
7 7 Abstract datatypes
Classes and objects in Python
"Linked" lists: find, insert, delete
Binary search trees: find, insert, delete
 Height-balanced binary search trees
Effcient evaluation of recursive denitions: memoization
Dynamic programming: examples
8 8 Other programming languages: C and manual memory management
Other programming paradigms: functional programming
 2.Introduction to Data Analytics

Instructor Name1: Prof. Nandan Sudarsanam Type of Course : Core

Prof. Balaraman Ravindran Course Duration: 08 weeks
Institute: Studies IIT Madras Credit :2
Department: Department of Management

Pre Requisites :This course requires that you are familiar with high-school level linear algebra,
and calculus. Knowledge of probability theory, statistics, and programming is desirable.
Industry Support:

COURSE PLAN

Sr.No. Week Module Name

Descriptive Statistics Introduction to the course Descriptive Statistics
1 1
Probability Distributions
Inferential Statistics Inferential Statistics through hypothesis tests
2 2
Permutation & Randomization Test
3 3 Regression & ANOVA Regression ANOVA(Analysis of Variance)
Machine Learning: Introduction and Concepts Differentiating algorithmic
and model based frameworks Regression : Ordinary Least Squares, Ridge
4 4
Regression, Lasso Regression, K Nearest Neighbours Regression &
Classification
Supervised Learning with Regression and Classification techniques -1 Bias-
Variance Dichotomy NPTEL http://nptel.ac.in Management Pre-requisites:
This course requires that you are familiar with high-school level linear
algebra, and calculus. Knowledge of probability theory, statistics, and
programming is desirable. Coordinators: Dr. Balaraman Ravindran
5 5
Department of Computer Science and Engineering IIT Madras Dr. Nandan
Sudarsanam Department of Management StudiesIIT Madras Model
Validation Approaches Logistic Regression Linear Discriminant Analysis
Quadratic Discriminant Analysis Regression and Classification Trees
Support Vector Machines
Supervised Learning with Regression and Classification techniques -2
6 6
Ensemble Methods: Random Forest Neural Networks Deep learning
Unsupervised Learning and Challenges for Big Data Analytics Clustering
7 7
Associative Rule Mining Challenges for big data anlalytics
Prescriptive analytics Creating data for analytics through designed
8 8 experiments Creating data for analytics through Active learning Creating
data for analytics through Reinforcement learning

3.Introduction to Machine Learning

 Instructor Name: Prof. Sudeshna Sarkar Type of Course : Core
Institute: Dept of Computer Science and Course Duration: 08 weeks
Engineering IIT Kharagpur. Credit :2
Department: Computer Science

Pre Requisites :Basic programming skills (in Python), algorithm design, basics of probability &
statistics.
Industry Support: Data science companies and many other industries value machine learning skills.

COURSE PLAN

Sr.No. Week Module Name

Introduction: Basic denitions, types of learning, hypothesis space and
1 1 inductive bias, evaluation, cross-validation.
2 2 Linear regression, Decision trees, overtting.
Instance based learning, Feature reduction, Collaborative ltering based
3 3
recommendation
4 4 Probability and Bayes learning.
Logistic Regression, Support Vector Machine, Kernel function and
5 5
Kernel SVM.
Neural network: Perceptron, multilayer network, back propagation,
6 6 introduction to deep neural network.
Computational learning theory, PAC learning model, Sample
7 7
complexity, VC Dimension, Ensemble learning.
Clustering: k-means, adaptive hierarchical clustering, Gaussian mixture
8 8
model.

4.Deep Learning

Instructor Name: Prof. Mitesh Khapra Type of Course : Elective

Institute: IIT Madras & IIT Ropar Course Duration: 12 weeks
Department: Computer Science Credit :3
Pre Requisites :Working knowledge of Linear Algebra, Probability Theory. It would be
beneficial if the participants have done a course on Machine Learning.
Industry Support:
COURSE PLAN

Sr.No. Week Module Name

History of Deep Learning, Deep Learning Success Stories, McCulloch
1 1 Pitts Neuron, Thresholding Logic, Perceptrons, Perceptron Learning
Algorithm.
Multilayer Perceptrons (MLPs), Representation Power of MLPs,
2 2
Sigmoid Neurons, Gradient Descent, Feedforward Neural Networks.
3 3 FeedForward Neural Networks, Backpropagation.
Gradient Descent (GD), Momentum Based GD, Nesterov Accelerated
4 4
GD, Stochastic GD, AdaGrad, RMSProp.
Principal Component Analysis and its interpretations, Singular Value
5 5
Decomposition .
Auto encoders and relation to PCA, Regularization in autoencoders,
6 6 Denoisingautoencoders, Sparseautoencoders, Contractive
autoencoders.
Regularization: Bias Variance Tradeo-, L2 regularization, Early
7 7
stopping, Dataset augmentation, Parameter sharing and tying.
Greedy Layerwise Pre-training, Better activation functions, Better
8 8
weight initialization methods, Batch Normalization.
Convolutional Neural Networks, LeNet, AlexNet, ZF-Net, VGGNet,
9 9
GoogLeNet, ResNet.
10 10 Learning Vectorial Representations of Words.
11 11 Recurrent Neural Networks, Backpropagation through time.
Encoder Decoder Models, Attention Mechanism, Attention over
12 12
images.

5. Reinforcement Learning

Instructor Name: Prof. Balaraman Ravindran Type of Course : Elective

Institute: IIT Madras Course Duration: 12 weeks
Department: Dept of Computer Science and Credit :3
Engineering

Pre Requisites :
Industry Support(Applicable to): Data analytics/data science/robotics
COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction
2 2 Bandit algorithms – UCB, PAC
3 3 Bandit algorithms –Median Elimination, Policy Gradient
4 4 Full RL & MDPs
5 5 Bellman Optimality
6 6 Dynamic Programming & TD Methods
7 7 Eligibility Traces
8 8 Function Approximation
9 9 Least Squares Methods
10 10 Fitted Q, DQN & Policy Gradient for Full RL
11 11 Hierarchical RL
12 12 POMDPs

6. Artificial Intelligence: Search methods for Problem solving

Instructor Name: Prof. Deepak Khemani Type of Course : Elective

Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites :Exposure to data structures and programming and an ability to discuss algorithms
is the only pre-requisite.
Industry Support (Applicable to): Microsoft, Google, Facebook, Ford, General Electric, Amazon
and Flipkart.

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction: Overview and Historical Perspective, Turing Test,
 Physical Symbol Systems and the scope of Symbolic AI, Agents.
2 2 State Space Search: Depth First Search, Breadth First Search, DFID
3 3 Heuristic Search: Best First Search, Hill Climbing, Beam Search
4 4 Traveling Salesman Problem, Tabu Search, Simulated Annealing
Population Based Search: Genetic Algorithms, Ant Colony
5 5
Optimization
6 6 Branch & Bound, Algorithm A, Admissibility of A
7 7 Monotone Condition, IDA, RBFS, Pruning OPEN and CLOSED in A
8 8 Problem Decomposition, Algorithm AO, Game Playing
9 9 Game Playing: Algorithms Minimax, AlphaBeta, SSS
10 10 Rule Based Expert Systems, Inference Engine, Rete Algorithm
Planning: Forward/Backward Search, Goal Stack Planning, Sussman’s
11 11
Anomaly
12 12 Plan Space Planning, Algorithm Graphplan

7. Artificial Intelligence: Knowledge Representation and Reasoning

Instructor Name: Prof. Deepak Khemani Type of Course : Elective

Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites :Some exposure to formal languages, logic and programming

Industry Support:

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction

Propositional Logic Language,Semantics and Reasoning, Syntax and

Truth Values, Valid Arguments and Proof Systems, Rules of Inference
2 2
and Natural Deduction, Axiomatic Systems and Hilbert Style Proofs,
The Tableau Method, The Resolution Refutation Method
 First Order Logic (FOL) Syntax, Semantics, Entailment and Models,
Proof Systems, Forward Chaining, Unification, Forward Chaining Rule
3 3
Based Systems, The Rete Algorithm,Programming in a Rule Based
Language, The OPS5 Expert System Shell
Representation in FOL Skolemization, Knowledge Representation,
Properties and Categories, Reification and Abstract Entities, Resource
4 4
Description Framework (RDF), The Event Calculus: Reasoning About
Change
Mapping Natural Language to FOL Understanding = Fulfilling
5 5 Expectations, Conceptual Dependency (CD) Theory, Understanding
Language, Conceptual Analysis: Mapping English to CD Theory
Programming in Logic Deductive Retrieval in Backward Chaining,
Logic 3 NPTEL http://nptel.ac.in Computer Science and Engineering
Pre-requisites: Some exposure to formal languages, logic and
6 6
programming Coordinators: Prof. Deepak Khemani Department of
computer ScienceIIT Madras Programming, Prolog, Depth First Search
and Efficiency Issues, Controlling Search, The Cut Operator in Prolog
Theorem Proving in FOL Incompleteness of Forward and Backward
7 7 Chaining, The Resolution Refutation Method for FOL, Clause Form
and The Resolution Rule, FOL with Equality, Complexity
Knowledge Structures Semantic Nets using Frames, Scripts, Script
Applier Mechanism (SAM), Goals, Plans and Actions, Plan Applier
8 8
Mechanism (PAM):Expectations and Recognition, PAM: Top Down
and Bottom Up Reasoning
Ontology and Description Logics A Description Logic, Normalisation,
9 9 Structure Matching, Classification, A-box Reasoning, Extensions,
ALC, Further Extensions
Inheritance Taxonomies and Inheritance, Beliefs, Credulous and
10 10
Skeptical Reasoning
Default Reasoning Introduction to Default Reasoning, Circumscription,
11 11 Minimal Models, The Event Calculus Revisited, Default Logic,
Autoepistemc Logic
Reasoning in Multi-agent Systems Epistemic Logic:Kripke Semantics
12 12
in a MultiAgent Scenario, The Muddy Children Puzzle
 8. Computer Vision

Instructor Name: Prof. Jayanta Mukhopadhyay Type of Course : Elective

Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites :Linear Algebra, Vector Calculus, Data Structures and Programming
Industry Support:

COURSE PLAN

Sr.No. Week Module Name

1 1 Fundamentals of Image Processing
2 2 2-D Projective Geometry and Homography
3 3 Properties of Homography
4 4 Camera Geometry
5 5 Stereo Geometry
6 6 Feature detection and description
7 7 Feature matching and model fitting
8 8 Color Processing
9 9 Range image processing
10 10 Clustering and classification
11 11 Dimensionality Reduction and Sparse Representation
 12 12 Deep Neural Architecture and applications

9. Natural Language Processing

Instructor Name: Prof. Pawan Goyal Type of Course : Elective

Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Linear Algebra, Vector Calculus, Data Structures and Programming
Industry Support:

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction and Basic Text Processing
2 2 Spelling Correction, Language Modeling
3 3 Advanced smoothing for language modeling, POS tagging
4 4 Models for Sequential tagging – MaxEnt, CRF
5 5 Syntax – Constituency Parsing
6 6 Dependency Parsing
7 7 Lexical Semantics
8 8 Distributional Semantics
9 9 Topic Models
10 10 Entity Linking, Information Extraction
11 11 Text Summarization, Text Classication
12 12 Sentiment Analysis and Opinion Mining
Syllabus Major Domain: 3. Programming

1. Programming, Data Structures and Algorithms in Python

Instructor Name: Prof. Madhavan Mukund Type of Course : Core
Institute: Chennai Mathematical Institute Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

Informal introduction to programming, algorithms and data structures
viagcd, Downloading and installing Python, gcd in Python: variables,
1 1
operations, control flow - assignments, condition-als, loops, and
functions.
Python: types, expressions, strings, lists, tuples
Python memory model: names, mutable and immutable values
List operations: slices etc Binary search
2 2
Inductive function denitions: numerical and structural induction
Elementary inductive sorting: selection and insertion sort
In-place sorting
Basic algorithmic analysis: input size, asymptotic complexity, O()
notation
Arrays vs lists
3 3 Merge sort
Quick sort
Stable sorting
4 4 Dictionaries
More on Python functions: optional arguments, default values
Passing functions as arguments
 Higher order functions on lists: map, lter, list comprehension
Exception handling
Basic input/output
5 5
Handling files
String processing
Backtracking: N Queens, recording all solutions
Scope in Python: local, global, nonlocal names
6 6
Nested functions
Data structures: stack, queue,Heaps
Abstract data types
Classes and objects in Python
7 7 "Linked" lists: find, insert, delete
Binary search trees: find, insert, delete
Height-balanced binary search trees
Efficient evaluation of recursive denitions: memoization
Dynamic programming: examples
8 8
Other programming languages: C and manual memory management
Other programming paradigms: functional programming
2. Programming in C++
Instructor Name: Prof. Partha Pratim Das Type of Course : Core
Institute: IIT Kharagpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Basic knowledge of programming & Data structure, C Programming, Attending
a course on OOP with this course will help.
Industry Support: Programming in C++ is so fundamental that all companies dealing with systems
as well as application development (including web, IoT, embedded systems) have a need for the
same. These include – Microsoft, Samsung, Xerox, Yahoo, Google, IBM, TCS, Infosys, Amazon,
Flipkart, etc.

COURSE PLAN

Sr.No. Week Module Name

Programming in C++ is Fun : Build and execute a C program in C++,
1 1
Write equivalent programs in C++.
2 2 C++ as Better C: Procedural Extensions of C.
Overview of OOP in C++: Classes and basic Object-Oriented features
3 3
(encapsulation).
Overview of OOP in C++ : More OO features, overloading, namespace
4 4
and using struct and union.
Inheritance: Generalization / Specialization of Object Modeling in C+
5 5
+.
6 6 Polymorphism : Static and Dynamic Binding
Type Casting & Exceptions : C++ cast operators; C++ Exceptions &
7 7
standard exception classes
Templates & STL – Function and Class templates and using STL like
8 8
containers, algorithms
3. Programming in JAVA
Instructor Name: Prof. Debasis Samanta Type of Course : Core
Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : This course requires that the students are familiar with programming language
such as C/C++ and data structures, algorithms.
Industry Support: : All IT companies.
COURSE PLAN

Sr.No. Week Module Name

1 1 Overview of Object-Oriented Programming and Java.
2 2 Java Programming Elements
3 3 Input-Output Handling in Java

4 4 Encapsulation
5 5 Inheritance
6 6 Exception Handling
7 7 Multithreaded Programming

8 8 Java Applets and Servlets

9 9 Java Swing and Abstract Windowing Toolkit (AWT)

10 10 Networking with Java

11 11 Java Object Database Connectivity (ODBC)

12 12 Interface and Packages for Software Development

4. Database Management System
Instructor Name: Prof. Samiran Chattopadhyay, Type of Course : Core
Prof. Partha Pratim Das Course Duration: 08 weeks
Institute: IIT Kharagpur Credit :2
Department: Computer Science

Pre Requisites : Procedural and / or Object-Oriented Programming (C / C++ / Java / Python),

Data Structures, Algorithms.
Industry Support: DBMS is so fundamental that all companies dealing with systems as well as
application development (including web, IoT, embedded systems, data mining, machine learning)
have a need for the same. These include – Microsoft, Samsung, Xerox, Yahoo, Google, IBM, TCS,
Infosys, Amazon, Flipkart, etc.
COURSE PLAN
Sr.No. Week Module Name
1 1 Course Overview. Introduction to RDBMS
2 2 Structured Query Language (SQL)
3 3 Relational Algebra.Entity-Relationship Model

4 4 Relational Database Design

5 5 Application Development. Case Studies. Storage and File Structure
6 6 Indexing and Hashing. Query Processing
7 7 Query Optimization. Transactions (Serializability and Recoverability)

8 8 Concurrency Control. Recovery Systems. Course Summarization.

5. Data Science For Engineers

Instructor Name: Prof. Ragunathan Rengasamy, Type of Course : Core

Institute: IIT Madras Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : 10 hrs of pre-course material on R will be provided. Participants need to

practice this.
Industry Support: Honeywell, ABB, Ford, Gyan Data pvt. Ltd.

COURSE PLAN

Sr.No. Week Module Name

Linear algebra for data science (algebraic view - vectors, matrices,
1 1 product of matrix & vector, rank, null space, solution of over-
determined set of equations and pseudo-inverse) .

Linear algebra for data science (geometric view - vectors, distance,

2 2
projections, eigen value decomposition)

Statistics (descriptive statistics, notion of probability, distributions,

3 3
mean, variance, covariance, covariance matrix)

4 4 Optimization
Optimization; Typology of data Science problems and a solution
5 5
framework
Univariate and multivariate linear regression Model assessment
6 6
(including cross validation)
Verifying assumptions used in linear regression , Assessing
7 7
importance of different variables, subset selection
Introduction to classification and classification using logistic
8 8
regression ,Classification using various clustering techniques
6. Cloud computing

Instructor Name: Prof. Soumya Kanti Ghosh Type of Course : Core

Institute: IIT Kharagpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Basics of computer architecture and Organisation

Industry Support: IT Industries.

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction to Cloud Computing

2 2 Cloud Computing Architecture

3 3 Service Management in Cloud Computing

4 4 Data Management in Cloud Computing

5 5 Resource Management in Cloud

6 6 Cloud Security

7 7 Open Source and Commercial Clouds, Cloud Simulator

8 8 Research trend in Cloud Computing, Fog Computing

7. Introduction to Internet of Things

Instructor Name: Prof. Sudip Misra Type of Course : Core

Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Basic Programming Language

Industry Support: IT Industries.

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction to IoT, Sensing, Actuation, Basics of Networking

2 2 Basics of Networking, Communication Protocols.

3 3 Communication Protocols, Sensor Networks.

4 4 Sensor Networks, Machine-to-Machine Communications.

Interoperability in IoT, Introduction to Arduino Programming,
5 5
Integration of Sensors and Actuators with Arduino.
6 6 Introduction to Python programming, Introduction to Raspberry.

7 7 Implementation of IoT with Raspberry Pi, Introduction to SDN.

8 8 SDN for IoT, Data Handling and Analytics, Cloud Computing.

9 9 Cloud Computing, Sensor-Cloud.

10 10 Fog Computing, Smart Cities and Smart Homes.

11 11 Connected Vehicles, Smart Grid, Industrial IoT.

 Industrial IoT, Case Study: Agriculture, Healthcare, Activity
12 12
Monitoring.

8. Introduction to Machine Learning

Instructor Name: Prof. Sudeshna Sarkar Type of Course : Core

Institute: IIT Kharagpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Basic programming skills (in Python), algorithm design, basics of probability &
statistics
Industry Support: Data science companies and many other industries value machine learning skills.
COURSE PLAN

Sr.No. Week Module Name

Introduction: Basic denitions, types of learning, hypothesis space and
1 1
inductive bias, evaluation, cross-validation.

2 2 Linear regression, Decision trees, over fitting.

Instance based learning, Feature reduction, Collaborative ltering based

3 3
recommendation.

4 4 Probability and Bayes learning

Logistic Regression, Support Vector Machine, Kernel function and
5 5
Kernel SVM.
Neural network: Perceptron, multilayer network, back propagation,
6 6
introduction to deep neural network.
Computational learning theory, PAC learning model, Sample
7 7
complexity, VC Dimension, Ensemble learning.
Clustering: k-means, adaptive hierarchical clustering, Gaussian
8 8
mixture model.
9. Application Development

Instructor Name: MULTI-FACULTY Type of Course : Core

Institute: Course Duration: 12 weeks
Department: Credit :3

Pre Requisites : Undergraduate Programming Experience

Industry Support: All Industries that use Computing
COURSE PLAN

Sr.No. Week Module Name

1 1
From desktop application to internet application
2 2

3 3
Stateful applications
4 4

5 5
The front end
6 6

7 7
Databases and Simple files
8 8

9 9 Setting up a website

10 10 Using third party web services

11 11 Extended project
 12 12

Syllabus Major Domain: 4. Foundation of Computing

1.Discrete Mathematics
Instructor Name: Prof. Sourav Chakraborty Type of Course : Core
Institute: Chennai Mathematical Institute Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Introduction
o Course Introduction
o Sets, Relations and Functions
1 1 o Propositional Logic and Predicate Logic
o Propositional Logic and Predicate Logic (Part 2)
o Elementary Number Theory

 Proof Techniques (Part 1)

o Formal Proofs
o Direct Proofs
2 2 o Case Study
o Case Study (Part 2)
o Sets, Relations, Function and Logic

 Proof Techniques (Part 2)

o Proof by Contradiction (Part 1)
3 3 o Proof by Contradiction (Part 2)
o Proof by Contraposition
o Proof by Counter Example
 Proof Techniques (Part 3)
o Mathematical Induction (Part 1)
4 4 o Mathematical Induction (Part 2)
o Mathematical Induction (Part 3)
o Mathematical Induction (Part 4)
  Proof Techniques (Part 4)
o Mathematical Induction (Part 5)
5 5 o Mathematical Induction (Part 6)
o Mathematical Induction (Part 7)
o Mathematical Induction (Part 8)
 Introduction to Graph Theory
o Introduction to Graph Theory
6 6 o Handshake Problem
o Tournament Problem
o Tournament Problem (Part 2)
 Graph Theory (Part 2)
o Ramsey Problem
7 7 o Ramsey Problem (Part 2)
o Properties of Graphs
 Modeling of Problems using LP and Graph Theory
o Problem 1
8 8 o Problem 2
o Problem 3 & 4
 Combinatorics
o Counting for Selection
9 9 o Counting for Distribution
o Counting for Distribution (Part 2)
 Recurrence Relations
o Counting using Recurrence Relations
10 10 o Counting using Recurrence Relations (Part 2)
o Solving Recurrence Relations (Part 1)
 Asymptotic Relations
o Asymptotic Relations (Part 1)
11 11 o Asymptotic Relations (Part 2)
o Asymptotic Relations (Part 3)
 Generating Functions
12 o Generating Functions (Part 1)
12 o Generating Functions (Part 2)
o Generating Functions (Part 3)
o Generating Functions (Part 4)
2.Design and Analysis of Algorithms
Instructor Name: Prof. Madhavan Mukund Type of Course : Core
Institute: Chennai Mathematical Institute Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Introduction, Analysis of Algorithms
o Course Outline
o Example: Air Travel
o Example: Xerox shop
o Example: Document similarity
1 1
o Introduction and motivation
o Input size, worst case, average case
o Quantifying efficiency: O( ), Omega( ), Theta( )
o Examples: Analysis of iterative and recursive algorithms

 Searching and sorting

o Arrays and lists
o Searching in an array
o Selection Sort
o Insertion sort
2 2 o Merge sort
o Merge sort - analysis
o Quicksort
o Quicksort - analysis
o Sorting - Concluding remarks

3 3  Graphs
o Introduction to graphs
o Representing graphs
o Breadth first search (BFS)
 o Depth first search (DFS)
o Applications of BFS and DFS
o Directed acylic graphs: topological sort
o Directed acylic graphs: longest paths

 Weighted graphs
o Single source shortest paths: Dijkstras algorithm
o Dijkstras algorithm: analysis
o Negative edge weights: Bellman-Ford algorithm
4 4 o All pairs shortest paths
o Minimum Cost Spanning Trees
o Prims Algorithm
o Kruskals algorithm

 Data Structures: Union-Find and Heaps, Divide and

Conquer
o Union-Find using arrays
o Union-Find using pointers
o Priority queues
5 5
o Heaps
o Heaps: Updating values, sorting
o Counting inversions
o Closest pair of points

 Data Structures: Search Trees, Greedy Algorithms

o Binary Search Trees
o Balanced search trees
6 6 o Interval scheduling
o Scheduling with deadlines: minimizing lateness
o Huffman codes

 Dynamic Programming
o Introduction to dynamic programming
o Memoization
o Grid Paths
7 7
o Common subwords and subsequences
o Edit distance
o Matrix multiplication

 Linear Programming and Network Flows, Intractability

o Linear Programming
o LP modelling: Production Planning
o LP modelling: Bandwidth allocation
8 8 o Network Flows
o Reductions
o Checking Algorithms
o P and NP
 3.Programming, Data Structures and Algorithms in Python

Instructor Name: Prof. Madhavan Mukund Type of Course : Core

Institute: Chennai Mathematical Institute Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Introduction
o Lecture 1: Algorithms and programming: simple gcd
o Lecture 2: Improving naive gcd
1 1
o Lecture 3: Euclid's algorithm for gcd
o Lecture 4: Downloading and installing Python

 Basics of Python
o Lecture 1: Assignment statement, basic types - int, float,
bool
o Lecture 2: Strings
2 2 o Lecture 3: Lists
o Lecture 4: Control Flow
o Lecture 5: Functions
o Lecture 6: Examples
  Lists, inductive function definitions, sorting
o Lecture 1: More about range()
o Lecture 2: Manipulating lists
o Lecture 3: Breaking out of a loop
3 3 o Lecture 4: Arrays vs lists, binary search
o Lecture 5: Efficiency
o Lecture 6: Selection Sort
o Lecture 7: Insertion Sort
o Lecture 8: Recursion
 Sorting, Tuples, Dictionaries, Passing Functions, List
Comprehension

o Lecture 1: Mergesort
o Lecture 2: Mergesort, analysis
4 4 o Lecture 3: Quicksort
o Lecture 4: Quicksort analysis
o Lecture 5: Tuples and dictionaries
o Lecture 6: Function definitions
o Lecture 7: List Comprehension
 Exception handling, input/output, file handling, string
processing
o Lecture 1: Exception Handling
o Lecture 2:Standard input and output
5 5 o Lecture 3: Handling files
o Lecture 4: String functions
o Lecture 5:Formatting printed output
o Lecture 6: pass, del() and None
 Backtracking, scope, data structures; stacks, queues and
heaps
o Lecture 1: Backtracking, N queens
o Lecture 2: Global scope, nested functions
6 6 o Lecture 3: Generating permutations
o Lecture 4: Sets, stacks, queues
o Lecture 5: Priority queues and heaps

 Classes, objects and user defined datatypes

o Lecture 1: Abstract datatypes, classes and objects
7 7 o Lecture 2: Classes and objects in Python
o Lecture 3: User defined lists
o Lecture 4: Search trees
 Dynamic programming, wrap-up
o Lecture 1: Memoization and dynamic programming
o Lecture 2: Grid paths
8 8 o Lesson 3: Longest common subsequence
o Lecture 4: Matrix multiplication
o Lecture 5: Wrap-up, Python vs other languages
 4. Theory of Computation

Instructor Name: Prof. RaghunathTewari Type of Course : Core

Institute: IIT Kanpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

o Introduction to Finite Automata
o Basic Notation and Convention, DFA Edit Lesson
o Example of DFAs
1 1
o Computation by DFA and Regular operation
o Introduction to Nondeterminism

o NFA, definition and examples

o Equivalence of NFA and DFA, Closure properties
o Regular expressions
2 2
o Algebraic properties, RE to NFA conversion
o GNFA to RE conversion

3 3 o More closure properties of regular languages

o Non-regular languages and pumping lemma
o Examples of non-regular languages
o DFA minimization
 o Introduction to CFGs

o Examples of CFGs, Reg subset of CFL

o Parse tree, derivation, ambiguity
o Normal forms, Chomsky normal form
4 4
o Non-CFLs, pumping lemma
o Examples of non- CFLs

o Pushdown Automata
o Pushdown Automata - Definition and Example
o Pushdown Automata - Examples and Relation with
5 5 CFGs
o Closure Properties of CFLs
o Deterministic Context Free Languages

o Turing Machine
o More on Turing Machine
o Non deterministic Turing Machine Edit Lesson
6 6 o Configuration Graphs
o Closure Properties of Decidable and Turing
recognizable languages

o Decidability properties of Regular and Context Free

Languages
o Undecidability
7 7 o More on Undecidability
o Reduction
o Applications of Reduction

o Rice's theorem
o Introduction to Computational Complexity Theory
o More on the class NP
8 8
o NP-Completeness
o More on NP-Completeness
 5.Randomized Algorithms

Instructor Name: Prof. Benny George K Type of Course : Core

Institute: IIT Guwahati Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Introduction to Randomized Algorithms
o Introduction to Randomized Algorithms
1 1 o Randomized Mincut Algorithm
o Randomized Find

 Probability Review
o Probability Review
o Expectation of Random Variables
2 2
o Conditional Probability and Conditional Expectation2
o Birthday Paradox

 Moments and Deviations

3 3 o Markov and Chebychev's Inequalities
o Median Algorithm
 o Chernoff Bound
o Permutation Routing on a Hypercube
o Permutation Routing on a Hypercube(Analysis)

 Probabilistic Method
o Introduction to Probabilistic Method
4 4 o More Examples on Probabilistic Method
o Lovasz Local Lemma

 Markov Chains
o Introduction to Markov Chains
5 5 o 2-SAT and Markov Chains
o 3-SAT and Markov Chains

 Markov Chains-II
o Electrical Networks
6 6 o Cover Time
o Rapid Mixing

 Number Theoretic Algorithms

o Introduction to Computational Complexity
o Pratt's Certificate
7 7
o Primality Testing
o Miller Rabin Algorithm

 Graph Theoretic Algorithms

o All pair shortest path-I
8 8 o All pair shortest path-II
o Randomized MST

 Approximate Counting
o Introduction to approximate counting
o DNF counting
9 9 o Perfect Matching-I
o Perfect Matching-II
o Perfect Matching-III

 Randomization and Data Structures

o Treaps
10 10
o Hashing

 Computational Complexity
o Probabilistically checkable proofs - I
o Probabilistically checkable proofs - II
11 11
o Probabilistically checkable proofs - III
o LFKN Protocol
  Summery
12 12

6.Parallel Algorithms

Instructor Name: Prof. Sajith Gopalan Type of Course : Core

Institute: IIT Guwahati Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Models of Computation
o Shared Memory Models - 1
1 1 o Shared Memory Models - 2
o Interconnection Networks

 Performance of Parallel Algorithms and Basic Techniques

o Cost and Optimality
2 2 o Basic Techniques 1
o Basic Techniques 2
  Basic Techniques
o Basic Techniques 3
3 3 o Basic Techniques 4
o Basic Techniques 5

 Comparator Networks
o Odd Even Merge Sort (OEMS)
4 4 o OEMS, Bitonic-Sort-Merge Sort (BSMS)
o BSMS, Optimal List Colouring

 An Optimal List Ranking algorithm

o Description
5 5 o Analysis
o Applications

 An Optimal List Ranking algorithm, Expression Tree

Evaluation, Merging, Cole’s Merge Sort
o Applications
6 6
o Fast optimal merge algorithm
o High level Description

 Cole's Merge Sort; Sorting Lower Bound, Sorting Lower

bound; Connected Components
o Cole's Merge Sort: Details
7 7
o Analysis of Cole's Merge Sort; Lower bound for sorting
o Sorting Lower bound; Connected Components

 Connected Components
o Connected Components (CREW)
8 8 o Connected Components, Vertex Colouring
o Sorting on a 2D mesh

 Interconnection Networks Algorithms

o Sorting on a 2D mesh
9 9 o Sorting, Offline routing on a 2D mesh
o Sorting on a 3D mesh

 Interconnection Networks Algorithms

o Mesh of Trees, Hypercube
o Hypercube cont'd
10 10
o Hypercube cont'd, butterfly network
o Butterfly, CCC and Benes Networks

 Interconnection Networks Algorithms

o Butterfly, CCC and Benes Networks
11 11 o Shuffle Exchange Graphs, de Bruijn Graphs
o Interconnection Networks Algorithms

12 12  Parallel Complexity Theory

 o Circuit Value Problem is P-complete for NC-reductions
o Ordered DFS is P-complete for NC-reductions
o Max Flow is P-complete for NC-reductions

7. Modern Algebra

Instructor Name: Prof. Manindra Agrawal Type of Course : Core

Institute: IIT Kanpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

o Lecture 1 - Groups: Introduction to abstraction
1 1 o Lecture 2 - Groups: Subgroups and homomorphism

o Lecture 3 - Groups: Isomorphism

2 2 o Lecture 4 - Groups: Quotienting
 o Lecture 5 - Groups: Structure Theorem
3 3 o Lecture 6 - Groups: Applications

o Lecture 7 - Rings: Introduction

o Lecture 8 - Rings: Failure of Unique Factorization
4 4
o Lecture 9 - Rings: Birth of Ideals

o Lecture 10 - Rings: Ideal Arithmetic

5 5 o Lecture 11 - Rings: Special Ideals

o Lecture 12 - Rings: Dedekind Domains

6 6 o Lecture 13 - Rings: Quotient Rings

o Lecture 14 - Fields
o Lecture 15 - Cauchy sequences and real numbers
7 7
o Lecture 16 - Properties of Fields

o Lecture 17 - Finite Fields

8 8 o Lecture 18 - Application of Fields

8. Graph Theory

Instructor Name: Prof. SoumenMaity Type of Course : Core

Institute: IISCR Pune Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

o Basic Concepts
o Basic Concepts 1
1 1 o Eulerian and Hamiltonian Graph
o Eulerian and Hamiltonian Graph 1

2 2 o Bipartite Graph
 o Bipartite Graph
o Diameter of a graph; Isomorphic graphs
o Diameter of a graph; Isomorphic graphs

o Minimum Spanning Tree

o Minimum Spanning Trees (Cont.)
3 3 o Minimum Spanning Trees (Cont..)
o Minimum Spanning Trees (Cont...)

o Maximum Matching in Bipartite Graph

o Maximum Matching in Bipartite Graph 1
o Hall's Theorem and Konig's Theorem
4 4 o Hall's Theorem and Konig's Theorem 1
o Independent Set and Edge Cover
o Independent Set and Edge Cover 1

o Matching in General Graphs

o Proof of Halls Theorem
o Stable Matching
5 5 o Gale-Shapley Algorithm
o Graph Connectivity
o Graph Connectivity 1

o 2-Connected Graphs
o 2-Connected Graphs 1
o Subdivision of an edge; 2-edge-connected graphs
6 6 o Problems Related to Graphs Connectivity
o Flow Network
o Residual Network and Augmenting Path

o Augmenting Path Algorithm

o Max-Flow and Min-Cut
o Max-Flow and Min-Cut Theorem
7 7
o Vertex Colouring
o Chromatic Number and Max. Degree

o Edge Colouring
o Planar Graphs & Euler's Formula
8 8 o Characterization Of Planar Graphs
o Colouring of Planar Graphs
 9. Computational Geometry

Instructor Name: Prof. Amit Kumar Type of Course : Core

Institute: IIT Delhi Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Introduction using Basic Visibility Problems
o Introduction
o Visibility Problems
1 1
 The Maximal Points Problem
o 2D Maxima
  The Plane Sweep Technique and applications
o Line Sweep Method
2 2 o Segment Intersection Problem
o Line Sweep: Rectangle Union

 Convex Hull Different Paradigms and Quickhull

o Convex Hull
o Convex Hull Contd
3 3
o Quick Hull
o More Convex Hull Algorithms

 Dual Transformation and Applications

o Intersection of Half Planes and Duality
o Intersection of Half Planes and Duality Contd
4 4
 Lower Bounds on Algebraic tree model
o Lower Bounds

 Point Location and Triangulation

o Planar Point Location
5 5 o Point Location and Triangulation Contd...
o Triangulation of Arbitrary Polygon.

 Voronoi Diagram and Delaunay Triangulation

o Voronoi Diagram : Properties
6 6 o Voronoi Diagram Construction
o Delaunay Triangulation.

 Randomized Incremental Construction and Random Sampling

o Quick sort and Backward Analysis
7 7 o Generalized RIC
o RIC Continued

 Arrangements and Levels

o Arrangements
8 8 o Zone Theorem and Application
o Levels

 Range Searching
o Range Searching : Introduction
o Orthogonal Range searching
9 9 o Priority Search Trees
o Non - Orthogonal Range Searching
o Half - Plane Range Query

10 10  Clustering Point Sets using Quadtrees and Applications

o Well Separated Partitioning
o Quadtrees Epsilon -WSPD
o Construction of Epsilon - WSPD
 o Epsilon - WSPD to Geometric Spanner

 Epsilon-Nets VC Dimension and Applications

o Epsilon-Nets & VC Dimension
o Epsilon-Nets & VC Dimension contd
11 11
o Geometric Set Cover
o Geometric Set Cover (with Bounded VC Dimension)

 Shape Analysis and Shape Comparison

o Shape Representation
12 12
o Shape Comparison

10.Arithmetic Circuit Complexity

Instructor Name: Prof. NitinSaxena Type of Course : Core

Institute: IIT Kanpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

 Turing machines. Arithmetic circuits.
1 1 o Lecture 1: Turing Machines and Introduction to
Arithmetic Circuits
 o Lecture 2: Arithmetic complexity classes

 Newton's identity. Arithmetic branching program. Iterated

matrix multiplication.
o Lecture 3: Determinant is in VP
2 2
o Lecture 4: Determinant vs Arithmetic Branching
Programs (ABP)

 Arithmetic branching program vs. Determinant.

o Lecture 5: Determinant as signed sum of clow sequence
3 3 o Lecture 6: Determinant has small ABP and Strassen's
homogenization

 Basic depth reductions on arithmetic formulas and circuits

o Lecture 7 : Depth reduction for arithmetic formulas
4 4
Lecture 8 : Depth reduction for arithmetic circuits

 Constant depth reduction of arithmetic circuits

o Depth 4 reduction
5 5
o Depth 3 reduction

 Width reduction in ABP

o Lecture 11: Equivalence of Formulas and Width 3 ABP
6 6
o Lecture 12: Width-2 ABP Chasm

 Depth-3 over finite fields. Grigoriev-Karpinski measure.

o Lecture 13: Grigoriev-Karpinski Measure
7 7 o Lecture 14: Lower Bound of Depth-3 circuit over finite
fields

 Lower Bounds on Multilinear Circuits

o Lecture 15: Lower Bound for depth 3 Multilinear
Circuits
8 8
o Lecture 16: Lower Bound for Constant depth
Multilinear Circuits

 Lower Bound for constant depth multilinear circuits

o Lecture 17: Structural lemma for constant depth
9 9 multilinear circuits
o Lecture 18: Extending the proof for multilinear formulas

 Depth 4 Lower Bounds

o Lecture 19: Shifted Partial Derivative Measure
10 10 o Lecture 20: Exponential Lower Bound for General
depth-4 Circuits

 Depth 4 Circuit Lower Bounds

11 11 o Lecture 21: Lower Bound on Homogeneous Depth-4
circuits
 o Lecture 22: Introduction to PIT

 PIT vs Lower Bounds

o Lecture 23: Hitting Set and Hitting Set Generator
12 12
o Lecture 24: PIT vs Lower Bounds

11.Arithmetic Circuit Complexity

Instructor Name: Prof. Arindama Singh Type of Course : Core

Institute: IIT Madras Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites: 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.

COURSE PLAN

Sr.No. Week Module Name

1 1 Propositional Logic:
 Syntax, Unique parsing, Semantics, Equivalences, Consequences,
Calculations, Informal proofs.
Normal Forms and Resolution :
2 2
Clauses, CNF and DNF representations, Adequacy of calculations,
SAT, Resolution refutation, Adequacy of resolution.
Proof Systems
3 3
Axiomatic system PC, Adequacy of PC, Analytic tableau PT,
Adequacy of PT, Compactness of PL.
First Order Logic
4 4
Syntax of FL, Scope and binding, Substitutions, Semantics of FL,
Quantifier laws, Equivalences, Consequences.
Normal Forms in FL
5 5
Calculations, Informal proofs, Prenex forms, Skolem forms, Herbrand's
theorem, Skolem-Lowenheim theorem, Resoltion in FL
Proof Systems for FL
6 6
Axiomatic system FC, Analytic tableau FT, Adequacy of FC and FT,
Compactness in FL.
Axiomatic Theories
7 7
Undecidabilty of FL, Godel's incompleteness theorems.

8 8 FC, Semidecidability of FL, and Tableau, Analytic Tableau for FL,

Goedel's Incompleteness Theorems

Syllabus Major Domain: 5. System

1.Compiler Design
Instructor Name: Prof. Santanu Chattopadhyay Type of Course : Core
Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Nil.

Industry Support: All software industries
COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction

2 2 Lexical Analysis

3 3 Parsing – Part I, II, III

4 4 Parsing – Part I, II, III

5 5 Parsing – Part I, II, III

6 6 Syntax Directed Translation

7 7 Type Checking and Symbol Tables

8 8 Runtime Environment Management – Part I,II

9 9 Runtime Environment Management – Part I,II

10 10 Intermediate Code Generation – Part I,II,III

11 11 Intermediate Code Generation – Part I,II,III

12 12 Intermediate Code Generation – Part I,II,III

2.Introduction to Operating Systems

Instructor Name: Prof. Chester Rebeiro Type of Course : Core

Institute: IIT Madras Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Good knowledge of C, Computer Organization and Architecture, x86 Assembly
level programming.
Industry Support: All software industries

COURSE PLAN
 Sr.No. Week Module Name
1 1 Introduction

2 2 Memory Management

3 3 Processes

4 4 Interrupts and Context Switching

5 5 Scheduling

6 6 Synchronization

7 7 Deadlocks

8 8 Operating System Security

3. Computer Networks and Internet Protocol

Instructor Name: Prof. Soumya Kanti Ghosh & Type of Course : Core
Prof. Sandip Chakraborty Course Duration: 12 weeks
Institute: IIT Kharagpur Credit :3
Department: Computer Science

Pre Requisites : Nil

Industry Support: IT industries

COURSE PLAN

Sr.No. Week Module Name

 Introduction to Computer Networks History, Circuit Switching and
1 1
Packet Switching

2 2 TCPIP Protocol Stack – Basic Overview

3 3 Application Layer Services (HTTP, FTP, Email, DNS)

4 4 Transport Layer Primitives – Connection Establishment and Closure

5 5 Flow Control and Congestion Control at the Transport Layer

Transmission Control Protocol – Basic Features, TCP Congestion
6 6
Control
7 7 Network Layer Primitives – IP Addressing
IP Routing – Intra Domain Routing Protocols, Inter Domain Routing
8 8
Protocols (BGP)
9 9 IP Services – SNMP, ARP
Data Link Layer Service Primitives – Forwarding, Flow Control,
10 10
Error Control
11 11 Media Access Control - Channel Access Protocols, Framing

12 12 End to End Principles of Computer Networks

4. Introduction to Database Systems

Instructor Name: Prof. Sreenivasa Kumar Type of Course : Core
Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : B.Tech (computer science) 3rd year Discrete Mathematics and Data Structures
Industry Support: Any Interested Learners
COURSE PLAN

Sr.No. Week Module Name

 1 1 Introduction and part of E/R Model Module

2 2 ER Model Module

3 3 Relational Model Module

4 4 Relational Model Module(continued)

5 5 TRC Module and part of SQL Module

6 6 SQL Module

7 7 Indexes Module

8 8 Indexes Module + Query Processing Module

9 9 Normal Forms Module

10 10 Normal Forms Module (continued)

11 11 Transaction Processing Module

12 12 Transaction Processing Module (continued)

5. Cloud Computing
Instructor Name: Prof. Soumya Kanti Ghosh Type of Course : Elective
Institute: IIT Kharagpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Basics of computer architecture and Organisation

Industry Support: IT Industries
COURSE PLAN
 Sr.No. Week Module Name

1 1 Introduction to Cloud Computing

2 2 Cloud Computing Architecture

3 3 Service Management in Cloud Computing

4 4 Data Management in Cloud Computing

5 5 Resource Management in Cloud

6 6 Cloud Security

7 7 Open Source and Commercial Clouds, Cloud Simulator

8 8 Research trend in Cloud Computing, Fog Computing

6. Information Security :Secure Systems Engineering

Instructor Name: Prof. Chester Rebeiro Type of Course : Elective
Institute: IIT Madras Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : C programming must be strong Minimum understanding of digital logic

/operating systems / computer organization
Industry Support: All companies developing embedded products /IoT etc.
COURSE PLAN
Sr.No. Week Module Name

1 1 Introduction / gdb / bu-er overow

2 2 Preventing buffer overflow based malware

3 3 Integer overflow and buffer overread and heap overflow

4 4 More on heap overflow; software isolation and enclaves

5 5 Review of cryptography; fault injection attacks

6 6 Cache timing attacks and covert channels; Meltdown and Spectre

7 7 Power analysis attacks; Rowhammer

8 8 Hardware Trojans

7. Introduction to Parallel Programming in Open MP

Instructor Name: Prof. Yogish Sabharwal Type of Course : Elective
Institute: IIT Delhi Course Duration: 04 weeks
Department: Computer Science Credit :1

Pre Requisites : Students enrolling for this course should be comfortable with programming in C
Industry Support : IBM, Intel, Amazon, Google, Microsoft, Cray.
COURSE PLAN
Sr.No. Week Module Name

1 1 Single Processor Architecture and Basic OpenMP constructs &

functions

2 2 More OpenMP constructs & functions

Basic Linear Algebra using OpenMP and OpenMP tasks (Assignment

3 3 1: Programming assignment to implement and evaluate blocked matrix
multiply in OpenMP)

Critical Sections, locks and Matrix Factorization using OpenMP

4 4 (Assignment 2: Programming assignment to implement and evaluate
task based algorithm for a BLAS routine).

8. Introduction to Internet of Things

Instructor Name: Prof. Sudip Misra Type of Course : Elective
Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3
Pre Requisites : Basic Programming Language
Industry Support: IBM, Intel, Amazon, Google, Microsoft, Cray.
COURSE PLAN
Sr.No. Week Module Name
1 1 Introduction to IoT, Sensing, Actuation, Basics of Networking
2 2 Basics of Networking, Communication Protocols.
3 3 Communication Protocols, Sensor Networks.
4 4 Sensor Networks, Machine-to-Machine Communications
Interoperability in IoT, Introduction to Arduino Programming,
5 5
Integration of Sensors and Actuators with Arduino.

6 6 Introduction to Python programming, Introduction to Raspberry.

7 7 Implementation of IoT with Raspberry Pi, Introduction to SDN.
8 8 SDN for IoT, Data Handling and Analytics, Cloud Computing.

9 9 Cloud Computing, Sensor-Cloud.

10 10 Fog Computing, Smart Cities and Smart Homes

11 11 Connected Vehicles, Smart Grid, Industrial IoT.
Industrial IoT, Case Study: Agriculture, Healthcare, Activity
12 12
Monitoring

9. MultiCore Computer Architecture-Storage and Interconnects

Instructor Name: Prof. John Jose Type of Course : Elective
Institute: IIT Guwahati Course Duration: 08 weeks
Department: Computer Science Credit :2
Pre Requisites : Final year undergraduates or above in Computer Science and related fields (like
ECE, EEE, IT etc.). A basic understanding of Computer Organisation & Architecture
Industry Support: Intel, AMD, IBM, HP, Apple, Samsung etc.
COURSE PLAN
Sr.No. Week Module Name

1 1 Fundamentals of instruction pipeline for superscalar processor design

Memory hierarchy design, cache memory - fundamentals and basic

2 2
optimisations

Cache memory – advanced optimisations, performance

3 3
improvement technqiues

gem5 simulator – build and run, address translations using TLB
4 4
and page table
DRAM – organisation, access techniques, scheduling algorithms
5 5
and signal systems.

Introduction – Tiled Chip Multicore Processors (TCMP), Network

6 6
on Chips (NoC)

NoC router – architecture, design, routing algorithms and flow

7 7
control techniques
Advanced topics in NoC and storage – compression, prefetching,
8 8
QoS

10. Internetwork Security

Instructor Name: Prof. Sourav Mukhopadhyay Type of Course : Elective
Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites :
Industry Support: Intel, AMD, IBM, HP, Apple, Samsung etc.
COURSE PLAN
Sr.No. Week Module Name

Introduction to cryptography, Classical Cryptosystem, Cryptanalysis on

1 1 Substitution Cipher (Frequency Analysis), Play fair Cipher, Block
Cipher
Data Encryption Standard (DES), DES (Contd.), Triple DES, Modes of
2 2
Operation, Stream Cipher, Pseudorandom Sequence
LFSR based Stream Cipher, Mathematical background, Abstract
3 3
algebra, Number Theory
Modular Inverse, Extended Euclid Algorithm, Fermat's Litle Theorem,
4 4
Euler Phi-Function, Euler’s theorem, Quadratic Residue, Polynomial
Arithmetc
Advanced Encryption Standard (AES), Introduction to Public Key
5 5
Cryptosystem, Dife-eellman Key Exchange, Knapsack Cryptosystem,
RSA
More Cryptosystem
on RSA, Primarily Testing, Ellamal Cryptosystem, Elliptic Curve
6 6
over the Reals, Elliptc curve Modulo a Prime
Generalized Ellamal Public Key Cryptosystem, Chinese Remainder
7 7
Theorem, Rabin Cryptosystem, Legendre and Jacobi Symbol.
Message Authentcaton, Digital Signature, Key Management, Key
8 8 Exchange, each Function
Universal easing, Cryptographic each Function, Secure each Algorithm
9 9 (SeA), Digital Signature Standard (DSS), More on Key Exchange
Protocol.
Cryptanalysis, Time-Memory Trade-of Attack, Differential
10 10 Cryptanalysis, More on Differential Cryptanalysis, Linear
Cryptanalysis.
Cryptanalysis on Stream Cipher, Algebraic Atack, Implementation
11 11
Attacks, side channel attack.
Internetwork Security, SSL, PlP, Cloud Security, Introduction to Block
12 12
chain and Bit coin
 J D College of Engineering & Management
An Autonomous Institute
(Affiliated to Dr. Babasaheb Ambedkar Technological University,
Bachelor of Technology in Computer Science & Engineerin
With effect from the Academic Year 2020-2021
Course Mapping with NPTEL/SWAYAM Online Platform

Subjects for Minor Domain- Semester Wise (20 Credits)

Sr Title of Name of I
Semester SME (Subject Matter Expert) Course ID
No SWAYAN - NPTEL Course offering

01 III Programming in C++ Prof. Partha Pratim Das 106105151 IIT Kha

Chen
Programming, Data Structures and
02 IV Prof. Madhavan Mukund 106106145 Mathem
Algorithms in Python
Instit

03 V Introduction to Database Systems Prof. Sreenivasa Kumar 106106220 IIT Ma

04 VI Introduction to Operating Systems Prof. Chester Rebeiro 106106144 IIT Ma

05 VII Programming in Java Prof. Rajib Mall 106105191 IIT Kha

Cloud computing Prof. Soumya Kanti Ghosh 106105167 IIT Kha

06 VIII Computer Networks and Internet Prof. Soumya Kanti Ghosh
106105183 IIT Kha
Protocol &Prof. Sandip Chakraborty
 1.Programming in C++
Instructor Name: Prof. Partha Pratim Das Type of Course : Core
Institute: IIT Kharagpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Basic knowledge of programming & Data structure, C Programming, Attending
a course on OOP with this course will help.
Industry Support: Programming in C++ is so fundamental that all companies dealing with systems
as well as application development (including web, IoT, embedded systems) have a need for the
same. These include – Microsoft, Samsung, Xerox, Yahoo, Google, IBM, TCS, Infosys, Amazon,
Flipkart, etc.

COURSE PLAN

Sr.No. Week Module Name

Programming in C++ is Fun : Build and execute a C program in C++,
1 1 Write equivalent programs in C++.

2 2 C++ as Better C: Procedural Extensions of C.

Overview of OOP in C++: Classes and basic Object-Oriented features
3 3 (encapsulation).
Overview of OOP in C++ : More OO features, overloading, namespace
4 4
and using struct and union.
Inheritance: Generalization / Specialization of Object Modeling in C+
5 5
+.
6 6 Polymorphism : Static and Dynamic Binding
Type Casting & Exceptions : C++ cast operators; C++ Exceptions &
7 7 standard exception classes
Templates & STL – Function and Class templates and using STL like
8 8
containers, algorithms
 2. Programming, Data Structures and Algorithms in Python

Instructor Name: Prof. Madhavan Mukund Type of Course : Core

Institute: Chennai Mathematical Institute Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : 10+2 mathematics.

Industry Support: This course should be of value to any company requiring programming skills.
COURSE PLAN

Sr.No. Week Module Name

Informal introduction to programming, algorithms and data structures
viagcd, Downloading and installing Python, gcd in Python: variables,
1 1
operations, control flow - assignments, condition-als, loops, and
functions.
Python: types, expressions, strings, lists, tuples
Python memory model: names, mutable and immutable values
List operations: slices etc Binary search
2 2
Inductive function denitions: numerical and structural induction
Elementary inductive sorting: selection and insertion sort
In-place sorting
Basic algorithmic analysis: input size, asymptotic complexity, O()
notation
Arrays vs lists
3 3 Merge sort
Quick sort
Stable sorting
Dictionaries
More on Python functions: optional arguments, default values
4 4
Passing functions as arguments
Higher order functions on lists: map, lter, list comprehension
Exception handling
Basic input/output
5 5
Handling files
String processing
Backtracking: N Queens, recording all solutions
Scope in Python: local, global, nonlocal names
6 6
Nested functions
Data structures: stack, queue,Heaps
Abstract data types
Classes and objects in Python
7 7 "Linked" lists: find, insert, delete
Binary search trees: find, insert, delete
Height-balanced binary search trees
Efficient evaluation of recursive denitions: memoization
Dynamic programming: examples
8 8
Other programming languages: C and manual memory management
Other programming paradigms: functional programming

3. Introduction to Database Systems

 Instructor Name: Prof. Sreenivasa Kumar Type of Course : Core
Institute: IIT Madras Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : B.Tech (computer science) 3rd year Discrete Mathematics and Data Structures
Industry Support: Any Interested Learners
COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction and part of E/R Model Module

2 2 ER Model Module

3 3 Relational Model Module

4 4 Relational Model Module(continued)

5 5 TRC Module and part of SQL Module

6 6 SQL Module

7 7 Indexes Module

8 8 Indexes Module + Query Processing Module

9 9 Normal Forms Module

10 10 Normal Forms Module (continued)

11 11 Transaction Processing Module

12 12 Transaction Processing Module (continued)

4. Introduction to Operating Systems

 Instructor Name: Prof. Chester Rebeiro Type of Course : Core
Institute: IIT Madras Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : Good knowledge of C, Computer Organization and Architecture, x86 Assembly
level programming.
Industry Support: All software industries

COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction

2 2 Memory Management

3 3 Processes

4 4 Interrupts and Context Switching

5 5 Scheduling

6 6 Synchronization

7 7 Deadlocks

8 8 Operating System Security

 5.Programming in JAVA
Instructor Name: Prof. Debasis Samanta Type of Course : Core
Institute: IIT Kharagpur Course Duration: 12 weeks
Department: Computer Science Credit :3

Pre Requisites : This course requires that the students are familiar with programming language
such as C/C++ and data structures, algorithms.
Industry Support: : All IT companies.
COURSE PLAN

Sr.No. Week Module Name

1 1 Overview of Object-Oriented Programming and Java.
2 2 Java Programming Elements
3 3 Input-Output Handling in Java

4 4 Encapsulation
5 5 Inheritance
6 6 Exception Handling
7 7 Multithreaded Programming

8 8 Java Applets and Servlets

9 9 Java Swing and Abstract Windowing Toolkit (AWT)

10 10 Networking with Java

11 11 Java Object Database Connectivity (ODBC)

12 12 Interface and Packages for Software Development

6. Cloud computing
 Instructor Name: Prof. Soumya Kanti Ghosh Type of Course : Elective
Institute: IIT Kharagpur Course Duration: 08 weeks
Department: Computer Science Credit :2

Pre Requisites : Basics of computer architecture and Organisation

Industry Support: IT Industries
COURSE PLAN

Sr.No. Week Module Name

1 1 Introduction to Cloud Computing

2 2 Cloud Computing Architecture

3 3 Service Management in Cloud Computing

4 4 Data Management in Cloud Computing

5 5 Resource Management in Cloud

6 6 Cloud Security

7 7 Open Source and Commercial Clouds, Cloud Simulator

8 8 Research trend in Cloud Computing, Fog Computing

 7.Computer Networks and Internet Protocol
Instructor Name: Prof. Soumya Kanti Ghosh & Type of Course : Core
Prof. Sandip Chakraborty Course Duration: 12 weeks
Institute: IIT Kharagpur Credit :3
Department: Computer Science

Pre Requisites : Nil

Industry Support: IT industries

COURSE PLAN

Sr.No. Week Module Name

Introduction to Computer Networks History, Circuit Switching and
1 1
Packet Switching

2 2 TCPIP Protocol Stack – Basic Overview

3 3 Application Layer Services (HTTP, FTP, Email, DNS)

4 4 Transport Layer Primitives – Connection Establishment and Closure

5 5 Flow Control and Congestion Control at the Transport Layer

Transmission Control Protocol – Basic Features, TCP Congestion
6 6
Control
7 7 Network Layer Primitives – IP Addressing
IP Routing – Intra Domain Routing Protocols, Inter Domain Routing
8 8
Protocols (BGP)
9 9 IP Services – SNMP, ARP
Data Link Layer Service Primitives – Forwarding, Flow Control,
10 10
Error Control
11 11 Media Access Control - Channel Access Protocols, Framing

12 12 End to End Principles of Computer Networks

Recommendations for conducting one theory course of curriculum through online
Teaching / Learning

1. Only Swayam / NPTEL platform is allowed.

2. One defined subject per semester in online mode and BOS should declare that one subject for
online mode based on availability of NPTEL offering before commencement of the semester.

3. Student will be allowed to appear for NPTEL / Institute level / University Examination as
applicable.

4. In order to ensure learning, NPTEL lectures to be telecast in the class by including it in regular
time table if required.

5. 75% assignment submission is mandatory for these online classes also like regular lecture
attendance.

6. One faculty to be allotted for this subject, who will discuss and solve student’s doubts. Allot 3
hrs/week load to teacher who is allotted to work as facilitator of online course.

7. For Autonomy Students: For online mode the student should submit all assignment given by nptel
then his/her score has weight age of 40% for CA & MSE. And if student clear the nptel final exam
and producing certificate then 60% weightage should be given as ESE, otherwise he/she has to appear
for Makeup exam of Institute.

If student cannot enroll for NPTEL then he/she has to study online videos / material and these
students should appear for Mid Semester, CA-I , CA-II and End sem exams of the Institute.

8. For DBATU students: For online mode he has to appear for CA-I, CA-II, Midsem exam of the
institute and End sem exam of University.

If student can’t enroll for NPTEL then he/she has to study online videos / material and these students
should appear for Mid Semester, CA-I , CA-II of the institute and End sem exams of the University.

10. If the credits of NPTEL/ SWAYAM courses do not match with the existing subject proper scaling
will be done)

This system will ensure real learning; avoid any problem arising due to cancellation of NPTEL exam
as it happened in this semester. At least for first year and in the unpredictable situation of covid
pandemic these provisions will avoid any last moment chaos.
 Course Structure and Syllabus
For
B. Tech. Computer Science and Engineering Programme

Curriculum for Semester- V [Third Year]

 BTCOC501 Database Systems 4 Credit

Unit 1: Database system architecture: [06 Hours]

Data Abstraction, Data Independence, Data Definition Language (DDL), Data Manipulation
Language (DML).
Data models: Entity-relationship model, Relational integrity constraints, data manipulation
operations.
Unit 2: Relational query languages[06 Hours]
Relational algebra, Tuple and domain relational calculus,SQL3, DDL and DML constructs, Open
source and Commercial DBMS – MYSQL,ORACLE, DB2, SQL server.

Unit3: Relational database design [06 Hours]

Domain and data dependency, Armstrong's axioms, Normal forms, Dependency preservation,
Lossless design.

Unit 4: Query processing [06 Hours]

Evaluation of relational algebra expressions, Query equivalence, Join strategies.

Unit 5:File Organization and Indexing [06 Hours]

Indices, B-trees, hashing..

Unit 5:Transaction processing [06 Hours]

Concurrency control, ACID property, Serializability of scheduling, Locking and timestamp based
schedulers, Multi-version and optimistic Concurrency Control schemes, Database recovery...

Text Books
1) Henry Korth, Abraham Silberschatz& S. Sudarshan, Database System Concepts,

McGraw-Hill Publication, 6th Edition, 2011.

2) Raghu Ramakrishnan, Johannes Gehrke, Database Management Systems, McGraw- Hill

Publication, 3rd Edition, 2003.4) A Text Book of Applied Mathematics (Vol I & II) by P. N. Wartikar
and J. N. Wartikar, Pune Vidyarthi Griha Prakashan, Pune.

Reference Books
1) Joel Murach, Murach's Oracle SQL and PL/SQL for Developers, Mike Murach&
Associates, 2nd Edition, 2014.Wiederhold, Database Design, McGraw-Hill Publication, 2nd
Edition, 1983.
2) Navathe, Fundamentals of Database System, Addison-Wesley Publication, 6th
Edition, 2012.

3) Mark L. Gillenson, Fundamentals of Database Management System, Wiley

Publication, 2nd Edition, 2011.

4) J. D. Ullman, “Principles of Database and Knowledge – Base Systems”, Vol 1,

Computer Science Press.

5) Serge Abiteboul, Richard Hull, Victor Vianu, “Foundations of Databases”, Reprint by

Addison-Wesley.
BTCOC502 Theory of Computations 4 Credit

Unit-I: Finite Automata and Regular Expressions[06 Hrs]

Definition of deterministic finite automata, Non-deterministic finite automata, Moore and Mealy
machines and their conversions, Regular expressions, Recursive definition, NFA with e-moves, Inter-
conversion between NFA and DFA, Regular expression and FA, Pumping lemma.

Unit-II: Context Free Grammars [06 Hrs]

Definition, Production rules, Ambiguous grammar, Removal of ambiguity, Chomsky hierarchy,
Context Free Grammar (CFG) – definition, Simplification off.

Unit-III: Context Free Languages [06 Hrs]

Definition of context free languages, Regular grammar definition, Left linear, Right linear grammar,
Inter-conversion between left linear and right linear regular grammar, Regular grammar and finite
automata, CNF, GNF, Derivation graphs, Type 0 and Type 1 grammars.

Unit-IV: Pushdown Automata [06 Hrs]

Formal definition, Pushdown automata (PDA), Deterministic Pushdown automata (DPDA) –
definition, Non-deterministic Pushdown automata (NPDA) -definition, relative powers of DPDA and
NPDA.

Unit-V: Turing Machines and Undecidability [06 Hrs]

Definition, Computing with Turing machine, Extensions of Turing machines, Random access Turing
machines, Non-deterministic Turing machines, Grammars, The Church’s Turing hypothesis,
Universal Turing machines, The Halting problem, Unsolvable problems about Turing machines.

Text Books:
1. Fundamentals of Physics: David Halliday, Robert Resnick and Jerle Walker, John-WileyIndia
(8e, extended)
2.A text book of Engineering Physics: M. N. Avadhanulu, S. Chand & Co. Nano the Essentials:
Understanding Nanoscience and Nanotechnology, T.Praddep; TMH Publications.
3Introduction to Nanotechnology:Pooly& Owens; Willey Publication
 Text Book of Optics: Brijlal and Subramanyam (S. Chand and Company) Laser: M. N.
Avadhanulu, S. Chand & Co.

Reference Books:
5. LASERS: Theory and Applications: Thyagarajan K and Ghatak A.K.
6. Nanomaterials& Nanotechnologies and Design:M.F.Ashby, Paulo Ferreira and Daniel
L.Schodek, Elsevier Publications.
7. University Physics: Young and Freedman (Pearson Education).
8. Optics: Jenkins and White (Tata Mcgraw Hill)
 BTCOC503 Machine Learning 3 Credit

[Unit 1] [6 hrs]

Introduction: Basic definitions, types of learning, hypothesis space and inductive bias,
evaluation, cross-validation, Linear regression, Decision trees, overfitting.

[Unit 2] [6 hrs]

Instance based learning, Feature reduction, Collaborative filtering based recommendation,

Probability and Bayes learning.

[Unit 3] [6 hrs]

Logistic Regression, Support Vector Machine, Kernel function and Kernel SVM.

[Unit 4] [6 hrs]

Neural network: Perceptron, multilayer network, backpropagation, introduction to deep neural

network.

[Unit 5] [ 6 hrs]

Computational learning theory, PAC learning model, Sample complexity, VC Dimension,

Ensemble learning.

[Unit 6] [6 hrs]
Clustering: k-means, adaptive hierarchical clustering, Gaussian mixture model.

Reference Books:

1. Machine Learning, Tom Mitchell, First Edition, McGraw Hill, 1997.

2. Introduction to Machine Learning, 2nd Edition, by EthemAlpaydin.
 BTCOE504(A) Introduction to Research 2 Credit

[Unit 1]

What is research; Overview of research.

[Unit 2]

Literature survey, Conducting Systematic Research Survey.

[Unit 3]

Experimental skills; Data analysis; modelling skills.

[Unit 4]

Technical writing, Technical Presentations, Creativity in Research.

[Unit 5]

Technical writing, Technical Presentations, Creativity in Research, Research plagiarism.

[Unit 6]

Conducting a sample Research Survey on a given topic

Reference Books:
1. Research Methodology, Methods and Techniques by C.R Kothari, 2nd Edition.
 BTCOE504(B) Cyber Laws 2 Credit

[Unit 1]
Internet, E-Commerce And E-Governance With Reference To Free Market Economy
Understanding Computers, Internet and Cyber Laws, Conceptual Framework of E-commerce:
E-governance, The Role of Electronic Signatures in E-commerce with Reference to Free
Market Economy in India.

[Unit 2]
Law Relating To Electronic Records And Intellectual Property Rights In India Legal Aspects
of Electronic Records/Digital Signatures, The Rules and Regulations of Certifying Authorities
in India, Protection of Intellectual Property Rights in Cyberspace in India.

[Unit 3]
International Efforts Relating To Cyberspace Laws And Cyber Crimes International Efforts
Related to Cyberspace Laws, Council of Europe (COE) Convention on Cyber Crimes.

[Unit 4]
Penalties, Compensation And Offences Under The Cyberspace And Internet In India
Penalties, Compensation and Adjudication of Violations of Provisions of IT Act and Judicial
Review Some Important Offences under the Cyberspace Law and the Internet in India, Other
Offences under the Information Technology Act in India.

[Unit 5]
Miscellaneous Provisions Of It Act And Conclusions The Role of Electronic Evidence and
the Miscellaneous Provisions of the IT Act, Information Technology Act as Amended up to
2008, The Information Technology (Certifying Authorities) Rules, 2000, The Information
Technology (Certifying Authorities) Rules, 2000, Ministerial Order on Blocking of Websites.
Reference Books:
1. Harish Chander, Cyber Laws and It Protection, PHI Publication.
2. FaiyazAhamad, KLSI, Cyber Law and Information Security, Dreamtech Press.
3. Murray, Information Technology Law: Law and Society, 3rd Edition, Oxford
University Press Oxford 2016.
4. SunitBelapure Nina Godbole, Cyber Security, Wiley India Pvt. Ltd.

5. VivekSood, Cyber Law Simplified, McGraw-Hill Publication.

BTCOE505(A) Economics and Management 2 Credit

[Unit 1]
Introduction, Market Equilibrium: Demand and Supply, Elasticity of Demand Demand
Forecasting, Production, Exercises on Economics, Cost-Volume-Profit Relationships, Cost
Management Systems and Activity Costing System

[Unit 2]
Relevant Information and Decision Making, Cost Allocation, Exercises on Economics,
Double-Entry Bookkeeping, Job Casting, Process Costing, The Master Budget, Flexible
Budgets and Variance Analysis.

[Unit 3]
Financial Statements, Analysis of Financial Statements, Time Value of Money, Comparison
of Alternatives.

[Unit 4]
Depreciation Accounting, Evolution of Management Thoughts, Functions of Management
Directing.

[Unit 5]
Product Development, Forecasting Revisited, Capacity Planning, Product / Services Strategies
and Plant Layout, Production Planning and Control.

[Unit 6]
Inventory Management, Supply Chain Management, Marketing Management, Forms of
Ownership, Starting a New Company and Small-Scale Industrial Understandings, Capital
Financing, Entrepreneurship.
 BTCOE505(B) Business Communication 2 Credit

[Unit 1]
Introduction, Definitions & Concepts, Communicative Competence.

[Unit 2]
Intercultural Communication, Nonverbal Communication, Thought and Speech, Translation
as Problematic Discourse.

[Unit 3]
Barriers to Communication, Listening, Communication Rules, Communication Style.

[Unit 4]
Interpersonal Communication, Relational Communication, Organizational Communication.

[Unit 5]
Collaboration, Communication in Groups and Teams, Persuasive Communication.

[Unit 6]
Negotiation and Conflict Management, Leadership, Written Communication in International
Business, Role of Technology in international Business Communication, Moving to Another
Culture, Crisis Communication, Ethics in Business Communication.
 BTCOC506 Competitive Programming-I 2 Credit

[Unit 1]
Introduction
Online Judge The Programming Challenges Robot Judge, Understanding Feedback From
the Judge, Choosing Programming Languages, Reading Our Programs, Standard
Input/Output, Programming Hints, Elementary Data Types.
Challenging Problems
(1) The 3n + 1 Problem (2) Minesweeper (3) The Trip, (4) LCD Display (5) Graphical Editor
(6) Interpreter (7) Check the Check (8) Australian Voting.

[Unit 2]
Elementary Data Structures
Data Structures: Elementary Data Structures, Stacks, Dictionaries, Priority Queues Sets,
Object Libraries, The C++ Standard Template Library, The Java java.util Package, Program
Design Example: Going to War, Hitting the Dec, String Input/Output, Winning the War,
Testing and Debugging.
Challenging Problems
(1) Jolly (2) Poker Hands (3) Hartals (4) Crypt Kicker (5) Stack ’emUp (6) Erd¨os Numbers
(7) Contest Scoreboard (8) Yahtzee.

[Unit 3]
Strings
Character Codes, Representing Strings, Program Design Example: Corporate Renamings,
Searching for Patterns, Manipulating Strings, Completing the Merger, String Library
Functions.
Challenging Problems
(1) WERTYU (2) Where’s Waldorf? (3)Common Permutation (4) Crypt Kicker II (5)
Automated Judge Script (6) File Fragmentation (7) Doublets (8) Fmt

[Unit 4]
Sorting
Sorting, Sorting Applications Sorting Algorithms, Program Design Example: Rating the
Field, Sorting Library Functions, Rating the Field.
Challenging Problems
(1) Vito’s Family (2) Stacks of Flapjacks (3) Bridge (4) Longest Nap (5) Shoemaker’s
Problem (6) CDVII (7) ShellSort (8) Football.

[Unit 5]
Arithmetic and Algebra
Machine Arithmetic, Integer Libraries, High-Precision Integers, High-Precision Arithmetic,
Numerical Bases and Conversion, Real Numbers, Dealing With Real Numbers, Fractions,
Decimals, Algebra, Manipulating Polynomials, Root Finding, Logarithms, Real
Mathematical Libraries.
Challenging Problems
(1) Primary Arithmetic (2) Reverse and Add (3) The Archeologist’s Dilemma (4) Ones
(5) A Multiplication Game (6) Polynomial Coefficients (7) The Stern-Brocot Number System
(8) Pairsumonious Numbers.

[Unit 6]
Combinatorics
Basic Counting Techniques, Recurrence Relations, Binomial Coefficients, Other Counting
Sequences, Recursion and Induction Problems.

Challenging Problems
(1) How Many Fibs? (2) How Many Pieces of Land? (3) Counting (4) Expressions (5)
Complete Tree Labeling (6) The Priest Mathematician (7) Self-describing Sequence (8) Steps

List of Practical:
At least twenty five problems solving on competitive programming platforms such as,
https://uva.onlinejudge.org, http://hackerrank.com/, http://codechef.com/
Reference Books:
1. Steven S. Skiena Miguel A. Revilla, PROGRAMMING CHALLENGES The
Programming Contest Training Manual, Springer.
2. AnttiLaaksonen, Competitive Programmer’s Handbook.
3. Steven Halim, Competitive Programming 3: The Lower Bounds of Programming
Contests.
4. Gayle Lakaman Cracking the Coding Interview.
5. The Hitchhiker’s Guide to the Programming Contests.

BTCOL507 Database System Laboratory 1 Credit

List of Experiments:

1. Defining schema for applications.

2. Creating tables, Renaming tables, Data constraints (Primary key, Foreign key, Not
Null), Data insertion into a table.
3. Grouping data, aggregate functions, Oracle functions (mathematical, character
functions).
4. Sub-queries, Set operations, Joins.
5. Creation of databases, writing SQL and PL/SQL queries to retrieve information from
the databases.
6. Assignment on Triggers & Cursors.
7. Normal Forms: First, Second, Third and Boyce Codd Normal Forms.
8. Assignment in Design and Implementation of Database systems or packages for
applications such as office automation, hotel management, hospital management.
9. Deployment of Forms, Reports Normalization, Query Processing Algorithms in the
above application project.
10. Large objects – CLOB, NCLOB, BLOB and BFILE.
11. Distributed data base Management, creating web-page interfaces for database
applications using servlet.
 BTCOL508 Machine Learning Laboratory 1 Credit

As a part of lab exercises for Machine Learning Laboratory, it is suggested that the student
should get hands-on experience by solving data analysis problems available on Machine
Learning competition platforms such as HackerEarth and Kaggle. Some of the suggestive list
of problem solving is given below. The link address is as retrieved from
www.hackerearth.com on 17 June 2019. Knowledge of R programming or Python is required
to solve these problems, students get this prerequisite in Second Year.

1 Regression Analysis and Plot interpretation

2 Logistic Regression Analysis in R
3 Random Forest and Parameter Tuning in R
4 Clustering Algorithms and Evaluation in R
5 Machine Learning Project in Python on Hourse Prices Data
Curriculum for Semester- VI [Third Year]
 BTCOC601 Compiler Design 4 Credit

Unit I Introduction to Compiling [6 Hrs]

Definition, analysis of the source program, the phases of a compiler, the grouping of phases,
Compiler Construction tools, A simple one-pass compiler,

Unit II Lexical Analysis [6 Hrs]

The role of the Lexical analyzer, Input buffering, Specification of Tokens, A Language for
Specifying Lexical Analyzers, Design of a Lexical Analyzer generator.
Unit III Syntax Analysis [6 Hrs]

The role of the Parser, Context-free grammars, Writing a Grammar, Top-Down Parsing,
Bottom-Up Parsing, Operator-precedence Parsing, LR Parsers, Using Ambiguous Grammars,
Parser Generators.

Unit IV Syntax-Directed Translation [6 Hrs]

Definitions, Construction of Syntax Trees, Bottom-Up Evaluation of S- Attributed definitions,
Top-Down Translation, Bottom-Up Evaluation of Inherited attributes.

Unit V Intermediate Code Generation [6 Hrs]

Intermediate Languages, Declarations, Assignment Statements, Boolean Expressions, Case
Statements, Back patching, Procedure Calls.

Unit VI Code Generation [6 Hrs]

Issues in the Design of a Code Generator, The target Machine, Run-Time Storage
Management, Basic Blocks and Flow Graphs, Next-Use Information, Simple Code Generator,
Register allocation and Assignment, The DAG Representation of Basic Blocks, Generating
Code from DAGs, Dynamic Programming, Code-Generation Algorithm, Code-Generators.

Text Books:
1. Aho, Sethi, Ullman, Compilers Principles, Techniques and Tools, Addison Wesley, 1st
Edition, 1987.
2. Hopcroft, Motwani and Ullman, Introduction to Automata Theory, Languages and
Computation, Pearson Publication, 2nd Edition, 2001.
3. Dick Grune, Kees van Reeuwijk, Henri E. Bal, Ceriel J. H. Jacobs and Koen
Langendoen, Modern Compiler Design, Springer, 2nd Edition, 2012.

BTCOC602 Computer Networks 4 Credit

Unit I Introduction [06 hrs]

Applications of computer networks, Network hardware, Network software:
Protocol Hierarchy, Design Issue, connection oriented vs. connectionless, Service Primitives,
Reference models: OSI and TCP/IP, Example networks: Internet, Network standardization,
Performance: Bandwidth and Latency, Delay and bandwidth product, High-Speed Network,
Application Performance Needs.

Unit II LAN Technologies [06 hrs]

X.25, Frame relay, ATM, Ethernet (802.3), FDDI, Token Rings, Resilient
Packet Rings, Wireless LANs: Wi-Fi (802.11), Cell Phone Technologies, Broadband
Wireless: Wi-MAX (802.16), Bluetooth (802.15.1), RFID.

Unit III Data Link Layer [06 hrs]

Data Link Layer Design Issues: Service provided to network layer Framing,
Error Control, Flow Control, Error Detection and Correction: error correcting codes, error detecting
codes.

Unit IV Network Layer and Congestion Control [06 hrs]

IPv4/IPv 6, Routers and Routing Algorithms distance vector link state. TCP UDP and sockets.
Congestion Control and QOS: General principles, Congestion prevention policies, Load
shading, Jitter control, Quality of service: Packet scheduling, Traffic shaping, integrated Services.

Unit V Application Layer Protocols [06 hrs]

DNS, SMTP, POP, FTP, HTTP.
Unit VINetwork Security [06 hrs]
Authentication, Basics of public key and private key cryptography, digital
signatures and certificates, firewalls.

Text Books:
1. Tanenbaum, Computer Networks, PHI Publication, 5th Edition, 2011.
2. B. Forouzan, Data Communications and Networking, McGraw Hill Publication, 5th
Edition, 2013.
3. Larry Peterson and Bruce Davie, Computer Networks: A Systems Approach, Morgan
Kufman Publication, 5th Edition, 2012.
Reference Books:
1. S. Keshav, An Engineering Approach to Computer Networking, Addison-Wesley
Professional, 1st Edition, 1997.
2. D. Comer, Computer Networks and Internet, Pearson Education, 6th Edition, 2014.
3. M. Gallo, W. Hancock, Computer Communications and Networking Technologies,
Brooks/Cole Publisher, 2001.
4. Natalia Olifer, Victor Olifer, Computer Networks: Principles, Technologies and Protocols
for Network Design, Wiley Publication, 2005.
 BTCOE603(A) Human Computer Interaction 3 Credit

Unit I Introduction [06 hrs]

Course objective and overview, Historical evolution of the field, The Human,The Computer,
The Interaction.

Unit II Design processes: [06 hrs]

Interaction Design basics, Concept of usability – definition and elaboration,HCI in the
Software Process, Design Rules.

Unit III Implementation and Evaluation: [06 hrs]

Implementation Support, Evaluation Techniques, UniversalDesign, Use Support.

Unit IV Models: [06 hrs]

Cognitive Models, Socio – Organizational Issues and Stakeholders Requirements, Communication
and Collaboration models.
Theories: Task Analysis Dialog notations and Design Models of the system Modeling Rich
Interactions.

Unit V Modern Systems: [06 hrs]

Group ware, Ubiquitous Computing and Augmented Realities, Hypertext,
Multimedia and World Wide Web.

Text Books:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, Human Computer Interaction,
Pearson Education, 3rd Edition, 2003.
2. B. Shneiderman, Designing the User Interface, Addison-Wesley Publishing Company.

Reference Books:
1. Jenny Preece, Helen Sharp, Yvonne Rogers, Interaction Design: Beyond Human-
Computer Interaction, Wiley Publication, 4th Edition, 2015.
2. Gerard Jounghyun Kim, Human–Computer Interaction: Fundamentals and Practice,
CRC Press, 2015.
3. Jenifer Tidwell, Designing Interfaces, Patterns for Effective Interaction Design,
O’Reilly Media, 2nd Edition, 2010

BTCOE603(B) Artificial Intelligence 3 Credit

Unit I Introduction [06 hrs]

Introduction, What Is AI?, The Foundations of Artificial Intelligence, The History of Artificial
Intelligence, The State of the Art.
Intelligent Agents
Agents and Environments Good Behavior: The Concept of Rationality, The Nature of
Environments, The Structure of Agents.
Unit II Problem-solving [06 hrs]
Solving Problems by Searching, Problem-Solving Agents, Example Problems, Searching for
Solutions, Uninformed Search Strategies, Informed (Heuristic) Search Strategies, Heuristic
Functions.

Unit III Constraint Satisfaction Problems [06 hrs]

Defining Constraint Satisfaction Problems, Constraint Propagation: Inference in CSPs,
Backtracking Search for CSPs, Local Search for CSPs, The Structure of Problems.

Unit IV Game Playing [06 hrs]

Adversarial Search, Games, Optimal Decisions in Games, Alpha–Beta Pruning.

Unit V Logical Agents [06 hrs]

Knowledge-Based Agents, TheWumpus World, Logic, Propositional Logic: A Very Simple
Logic, Propositional Theorem Proving, Effective Propositional Model Checking, Agents
Based on Propositional Logic
First-Order Logic
Representation Revisited Syntax and Semantics of First-Order Logic, Using First-Order
Logic, Knowledge Engineering in First-Order Logic, Inference in First-Order Logic,
Propositional vs. First-Order Inference, Unification and Lifting, Forward Chaining, Backward
Chaining, Resolution.
Unit VI Uncertainty [06 hrs]
Quantifying Uncertainty, Acting under Uncertainty, Basic Probability Notation, Inference
Using Full Joint Distributions, Independence, Bayes’ Rule and Its Use, TheWumpus World
Revisited, Probabilistic Reasoning, Representing Knowledge in an Uncertain Domain, The
Semantics of Bayesian Networks, Efficient Representation of Conditional Distributions Exact
Inference in Bayesian Networks, Approximate Inference in Bayesian Networks, Relational
and First-Order Probability Models, and Other Approaches to Uncertain Reasoning.

Reference Books:
1. Peter Norvig, Artificial Intelligence: A Modern Approach, Third Edition.

BTCOE603(C) Object Oriented Analysis Design 3 Credit

Unit I [06 hrs]

Introduction Overview of object oriented system, Object orientation, Objects, attributes, object
behavior, Object respond to messages, encapsulation, Inheritance, Polymorphism, object
relationships and association, aggregation, Object identity static and dynamic binding, Object
persistence, meta classes. Object oriented system development life cycle.

Unit II [06 hrs]

Introduction Overview of object oriented system, Object orientation, Objects, attributes, object
behaviour, Object respond to messages, encapsulation, Inheritance, Polymorphism, object
relationships and association, aggregation, Object identity static and dynamic binding, Object
persistence, meta classes. Object oriented system development life cycle.

Unit III [06 hrs]

Object oriented analysis Use case analysis, CRC card analysis.

Unit IV [06 hrs]

Object Oriented Design, Design Patterns.

Unit V [06 hrs]

Implementation from Design to Implementation, Programming Style, Object-Oriented languages,
Non-Object-Oriented languages, Object Oriented Databases, Computer animation,
Electrical Distribution design System, Future of Object-Oriented Technology.

Text Books:
1. Grady, Booch, Object Oriented analysis and design with applications, 2nd Edition,
PHI.
2. James Rumbaugh, Object-Oriented Modeling And Design, 1st Edition, PHI Publication.
3. Ali Bahrami, Object Oriented Systems Development, 1st Edition, McGraw-Hill Publication.
4. Robert Lafore, Object Oriented Programming, Galgotia Publication.
5. Dan Pilone, Neil Pitman, UML 2.0 in a Nutshell: A Desktop Quick Reference,
O'Reilly Media.
6. E. Balagurusamy, Object Oriented Programming, McGraw-Hill Publication.
7. S. Koshafian, Object Orientation, Wiley Publication.
8. Mike O'Docherty, Object-Oriented Analysis Design: Understanding System Development
with UML 2.0, Wiley Publication.

BTCOE604(A) Geographic Information System 2 Credit

Unit I [06 hrs]

What is Geographic Information Systems?, Different components of GIS, Different types of
vector data, Raster data models and their types TIN data model.

Unit II [06 hrs]

Advantages and disadvantages associated with vector, raster and TIN Non-spatial data
attributes and their type Raster data compression techniques Different raster data file formats
Spatial database systems and their types.

Unit III [06 hrs]

Pre-processing of spatial datasets Different map projections, Spatial interpolation techniques
Different types of resolutions Digital Elevation Model (DEM).

Unit IV [06 hrs]

Quality assessment of freely available DEMS GIS analysis-1 GIS analysis-2 and applications
Errors in GIS Key elements of maps

Reference:
1. An Introduction to Geographical Information Systems (4th Edition) by Ian Heywood,
Sarah Cornelius and Steve Carver, 2012.
2. Introduction to Geographic Information Systems by Chang Kang-tsung (Karl), 2006
3. Geographic Information Systems: An Introduction.
 BTCOE604(B) Biology 2 Credit

Unit I Introduction
Introduction, Different Fields of Biology.

Unit II Origin of Life and Evolution

Different theories of origin of life, Experimental evidences supporting different theories.
Lamarck, Darwanism and other theories of evolution, Documentary evidences supporting
different evolution theories.

Unit III Ecology

Ecosystem, Food Chain, Pollution
Unit IV Physiology
Process of Food intake and Digestion, Nerves conduction and electrophysiology, Muscle
contraction and locomotion, Different Methods of Reproduction in prokaryotic and eukaryotic
system

Unit V Cell Biology and Sub- Cellular Structures

Structure and function of eukaryotic and prokaryotic cells

Unit VI Biological System

Structure-function of biological macromolecules, Central Dogma of Life, Replication,
Transcription, Translation,

Reference Books:
1. J. L. Tymoczko, J. M. Berg and L. Stryer, Biochemistry, 5th Ed, W. H. Freeman & Co.
2. D. L. Nelson and M. M. Cox, Lehninger Principles of Biochemistry, MacmillanWorth, 2000.
3. N. Hopkins, J. W. Roberts, J. A. Steitz, J. Watson and A. M. Weiner, MolecularBiology of the
Gene, 4th Ed, Benjamin Cummings, 1987.
4. C. R. Cantor and P. R. Schimmel, Biophysical Chemistry (Parts I, II and III), W.H.Freeman & Co.,
1980.

BTCOE604(C) Internet of Things 2 Credit

Unit IIntroduction to IoT [08hrs]

Architectural Overview, Design principles and needed capabilities, IoT Applications,
Sensing, Actuation, Basics of Networking, M2M and IoT Technology Fundamentals Devices
and gateways, Data management, Business processes in IoT, Everything as a Service(XaaS),
Role of Cloud in IoT, Security aspects in IoT.

Unit IIElements of IoT [09hrs]

Hardware Components Computing (Arduino, Raspberry Pi), Communication, Sensing,
Actuation, I/O interfaces, Software Components Programming API’s (using Python /
Node.js / Arduino) for Communication Protocols-MQTT, ZigBee, Bluetooth, CoAP, UDP,
TCP.

Unit IIIIoTApplication Development [18 hrs]

Solution framework for IoT applications- Implementation of Device integration, Data
acquisition and integration, Device data storage- Unstructured data storage on cloud/local
server, Authentication, authorization of devices.

Unit IV IoT Case Studies [10 hrs]

IoT case studies and mini projects based on Industrial automation, Transportation,
Agriculture, Healthcare, Home Automation

Reference:
1. Vijay Madisetti, ArshdeepBahga, Ïnternet of Things, “A Hands on Approach”,University Press
2. Dr. SRN Reddy, RachitThukral and Manasi Mishra, “Introduction to Internet of Things: A practical
Approach”, ETI Labs
3. Pethuru Raj and Anupama C. Raman, “The Internet of Things: Enabling Technologies, Platforms,
and Use Cases”, CRC Press
4. Jeeva Jose, “Internet of Things”, Khanna Publishing House, Delhi
5. Adrian McEwen, “Designing the Internet of Things”, Wiley
6. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill
7. CunoPfister, “Getting Started with the Internet of Things”, O Reilly Media.

BTCOE605(A) Development Engineering 2 Credit

Unit I
Introduction, Various Definitions of Development Engineering.

Unit II
World Poverty and Development, Poverty in the India, Sustainable Development, Culture and
Global Competence, The Engineers Role.

Unit III
Social Justice, Social Justice and Engineering, Religious Perspectives, Secular Perspectives.

Unit IV
Development Strategies: Society, Technological Change, and Development, Development
Economists’ Perspectives, Global Health Perspective, International Education Perspective,
Social Business Perspectives.

Unit V
Engineering for Sustainable Community Development: The Engineer as a Helper
Participatory Community Development, Teamwork and Project Management, Community
Assessment: Learning About a Community, Project Selection, Humanitarian Technology,
Participatory Technology Development, Humanitarian STEM Education.
Unit VI
ICT for Development, AI for Humanitarian purposes, Blockchain and Social Development.

Reference Books:
1. Kevin M. Passino, Humanitarian Engineering: Advancing Technology for Sustainable
Development.

BTCOE605(B) National Social Service 2 Credit

Unit I Introduction and Basic Concepts of NSS: [06 hrs]

History, Philosophy, Aims & objectives of NSS
Organizational structure, Concept of regular activities, Special camping, Day Camps, Basis of
adoption village/slums, Methodology of conducting Survey.

Unit II Youth and community mobilization: [06 hrs]

Definition, Profile of youth, Categories of youth,
Issues, Challenges and opportunities for youth, Youth as an agent of social change, Youth adult
partnership, Mapping of community stakeholders, Identifying methods of mobilization,
Needs & importance of volunteerism.

Unit III Importance and Role of Youth Leadership: [06 hrs]

Meaning and types of leadership, Qualities of
good leaders; Traits of leadership, Importance and role of youth leadership.

Unit IV Life Competencies and skill: [06 hrs]

Definition and importance of life competencies,
Communication, Inter Personal, Problem solving and decision making, Positive thinking,
Self-confidence and self-esteem, Life goals, Stress and time management.

Unit V Social Harmony and National Integration: [06 hrs]

Indian history and culture, Role of youth in
peace-building and conflict resolution, Role of youth in Nation building.

Unit VI Youth Development Programmes in India: [06 hrs]

National Youth Policy, Youth development
programmes at the National Level, State Level and voluntary sector, Youth-focused and
Youth-led organizations.
Reference:
1. National Service Scheme Manual (Revised), Government of India, Ministry of Youth
Affairs and Sports, New Delhi, 2006.
2. University of Mumbai National Service Scheme Manual, 2009.
3. Avian Chancellor’s Brigade – NSS Wing, Training camp on Disaster Preparedness
Guidelines, March 2012.
4. Rashtriya Seva Yojana Sankalpana– Prof. Dr. SankayChakane, Dr.Pramod Pabrekar,
Diamond Publication, Pune.
5. National Service Scheme Manual for NSS District Coordinators, National Service
Scheme Cell, Dept. of Higher and Technical Education, Mantralaya.
6. Annual report of National Service Scheme (NSS) published by DTE, Mantralaya.
7. NSS Cell, Dept. of Higher and Technical Education, Mantralaya, UTKARSHA- Socio
and cultural guidelines.
8. Case material as a Training Aid for Field Workers, Gurmeet Hans.
9. Social service opportunities in hospitals, Kapil K. Krishnan, TISS.
10. New Trends in NSS, Research papers published by University of Pune.
11. ANOOGUNJ Research Journal, published by NSS Unit C. K. Thakur College.
 BTCOE605(C) Consumer Behaviour 2 Credit

Unit I Introduction to the Study of Consumer Behavior

Defining Consumer Behavior, Scope and Application of Consumer Behavior, Why Study
Consumer Behavior, Evolution of Consumer Behavior as a Field Of Study and its relationship
with Marketing: Behavioral Dimension, The Interdisciplinary Nature of Consumer Behavior.
Market Research and Consumer Behavior:
Relevance of Market Research with Consumer Behavior, Approaches to Consumer Behavior
Research, Quantitative Research, Qualitative Research.

Unit II
Market Segmentation and Positioning, Market Segmentation, Basis for Segmentation,
Alternatives available for Segmentation, Positioning.

Unit III The Consumer Decision Making Process

BuyingMotives, Buying Roles, Consumer Decision Making Process, Levels of Consumer

Decision Making, Perspectives to Consumer Decision Making, Consumer Decision Making
Process.

Unit IV Models of Consumer Behavior

The Economic model, Learning model, Psychoanalytic model, The sociological model.
The Howard Sheth model of Buying Behaviour, The Nicosia model, The Engel - Kollat -Blackwell
Model, Engel, Blackwell and Miniard (EBM) model.

Psychological Influences on Consumer Decision Making

Consumers Needs & Motivation, Emotions and Mood, Consumer Involvement, Consumer
Learning, Personality, Self-concept and Self-image, Consumer Perception, Risk and Imagery.
Consumer Attitude: Belief, Affect, Attitude and Intention, Attitude Formation and Attitude
Change, Consumer Communication.

Unit V Sociological Influences on Consumer Decision Making

Consumer groups, Consumer reference groups, Family and Life cycle, Social class and
mobility, lifestyle analysis, Culture; Sub-Culture, Cross Culture, Interpersonal
Communication and influence, Opinion Leadership.
Diffusion of innovation Diffusion Process, Adoption Process, Consumer Innovators,
Multiplicative innovation adoption (MIA) model.

Unit VI Organizational Buying

Differences between Industrial Markets and Consumer Markets, Differences between
Organizational and Consumer Buying, Buying Decisions in Organizational Buying Process,
Types of Decision Making, Organization Buyer's Decision Making Process, and Factors
Dr. BabasahebAmbedkar Technological University
influencing Organizational Buying Behaviour, Decision Makers in Organizational Buying,
Webster and Wind model of Organizational buying behaviour, The Sheth model of Industrial
buying, The Sheth model of Industrial buying.
Consumer Behavior Analysis and Marketing Strategy
Consumer Behavior and Product Strategy, Consumer Behavior and Pricing Strategy,
Consumer Behavior and Distribution Channel Strategy, Consumer Behavior and Promotion
Strategy.

Reference Books:
1. Consumer Behavior, Schiffman, L.G. and Kanuk L.L., Prentice Hall, India.
2. Consumer Behavior, Concepts and Applications, Loudon, D.L. and Bitta, A.J.D, Tata
McGraw Hill.
3. Consumer Behavior and Marketing Strategy, Peter, J.P. and Olson, J.C., Schiffman,
L.G. and Kanuk L.L., Prentice Hall, India.
 BTCOC606 Competitive Programming-II 2 Credit

Unit I Number Theory

Prime Numbers, Finding Primes, Counting Primes, Divisibility Greatest Common Divisor,
Least Common Multiple, Modular Arithmetic, Congruence’s Operations on Congruence’s,
Solving Linear Congruence’s, Diophantine Equations, Number Theoretic Libraries.
Challenging Problems
(1) Light, More Light (2) Carmichael Numbers (3) Euclid Problem, (4) Factovisors, (5)
Summation of Four Primes (6) Smith Numbers (7) Marbles (8) Repackaging.

Unit II Backtracking
Backtracking, Constructing All Subsets, Constructing All Permutations, Program Design
Example: The Eight-Queens Problem, Pruning Search.
Challenging Problems
(1) Little Bishops (2) 15-Puzzle Problem (3) Queue (4) Servicing Stations (5) Tug of War (6)
Garden of Eden (7) Color Hash (8) Bigger Square Please

Unit III Graph Traversal

Flavors of Graphs, Data Structures for Graphs, Graph Traversal: Breadth-First, Breadth-First
Search, Exploiting Traversal, And Finding Paths Graph Traversal: Depth-First Finding Cycles
Connected Components Topological Sorting.
Challenging Problems
(1) Bicoloring (2) Playing With Wheels (3) The Tourist Guide (4) Slash Maze (5) Edit Step
Ladders (6) Tower of Cubes (7) From Dusk Till Dawn (8) Hanoi Tower Troubles Again!

Unit IV Graph Algorithm

Graph Theory, Degree Properties, and Connectivity, Cycles in Graphs, Planar Graphs,
Minimum Spanning Trees, Shortest Paths, Dijkstra’s Algorithm, All-Pairs Shortest Path,
Network Flows and Bipartite Matching
Challenging Problems
(1) Freckles The Necklace (2) Fire Station (3) Railroads (4) War (5)
Tourist Guide (6) The Grand Dinner (7) The Problem With the Problem Setter
Unit V Dynamic Programming

Don’t Be Greedy, Edit Distance, Reconstructing the Path, Varieties of Edit Distance, Program
Design Example: Elevator Optimization
Challenging Problems
(1) Is Bigger Smarter? (2)Distinct Subsequences (3) Weights and Measures (4) Unidirectional
TSP (5) Cutting Sticks (6) Ferry Loading (7) Chopsticks (8) Adventures in Moving: Part IV.
Unit VI Grids
Rectilinear Grids, Traversal, Dual Graphs and Representations, Triangular and Hexagonal
Grids, Triangular Lattices, Hexagonal Lattices, Program Design Example: Plate Weight,
Circle Packings, Longitude and Latitude.
List of Practical:
At least twenty five problems solving on competitive programming platforms such as, https://
uva.onlinejudge.org, http://hackerrank.com/, http://codechef.com/

Reference Books:
1. Steven S. Skiena Miguel A. Revilla, Programming Challenges The Programming
Contest Training Manual, Springer.
2. AnttiLaaksonen, Competitive Programmer’s Handbook.
3. Steven Halim, Competitive Programming 3: The Lower Bounds of Programming
Contests.
4. Gayle Lakaman Cracking the Coding Interview.
5. The Hitchhiker’s Guide to the Programming Contests.
 BTCOL607 Mobile Application Development for iOS / Android 2 Credit

BTCOL607 Mobile Application Development for iOS / Android

Note: The course on mobile application development can be taught for two different mobile
OS platforms either iOS or Android.
The students can opt any one either iOS or Android for studying mobile application
development. Either Part (A) or Part (B) of the following syllabus needs to be completed. It is
not required to complete both parts i.e. Part(A) and Part(B)
 BTCOL607(B) Internet of Things Laboratory 1Credit

1. Study of Raspberry-Pi, Beagle board, Arduino and other micro controller.

2. Study of different operating systems for Raspberry-Pi. Understanding the process of
OS installation on Raspberry-Pi.
3. Study of Connectivity and configuration of Raspberry-Pi circuit with basic
peripherals, LEDS. Understanding GPIO and its use in program.
4. Understanding the connectivity of Raspberry-Pi circuit with temperature sensor. Write
an application to read the environment temperature. If temperature crosses a threshold
value, the application indicated user using LEDSs.
5. Understanding the connectivity of Raspberry-Pi circuit with IR sensor. Write an
application to detect obstacle and notify user using LEDs.
6. Understanding and connectivity of Raspberry-Pi with camera. Write an application to
capture and store the image.
7. Study of different CPU frequency governors. Write an application to change CPU
frequency of Raspberry-Pi.
8. Write an application using Raspberry-Pi to control the operation of a hardware
simulated traffic signal.
9. Write an application using Raspberry-Pi to control the operation of a hardware
simulated lift elevator.
10. Write a server application to be deployed on Raspberry-Pi. Write client applications to
get services from the server application.
11. Create a small dashboard application to be deployed on cloud. Different publisher
devices can publish their information and interested application can subscribe.
12. Develop a Real time application like smart home with following requirements: When
user enters into house the required appliances like fan, light should be switched ON.
Appliances should also get controlled remotely by a suitable web interface. The
objective of this application is student should construct complete Smart application in
group.

BTCOL608 Computer Networks Laboratory 1Credit

1. Simulate and Understand IP forwarding within a LAN and across a router.

2. Study the working of spanning tree algorithm by varying the priority among the switches.
3. Understand the working of “Connection Establishment” in TCP using a network simulator.
4. Study how the Data Rate of a Wireless LAN (IEEE 802.11b) network varies as the
distance between the Access Point and the wireless nodes is varied.
5. Study the working and routing table formation of Interior routing protocols, i.e.
Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).
6. Plot the characteristic curve throughput versus offered traffic for a Slotted ALOHA
system.
7. Understand the impact of bit error rate on packet error and investigate the impact of
error of a simple hub based CSMA / CD network.
8. Study the performance of networks based on Star, Bus and Ring topologies
9. TCP/IP Sockets: Using TCP/IP sockets, write a client – server program to make the
client send the file name and to make the server send back the contents of the
requested file if present.
10. Write a program for calculating the shortest oath using Link State Routing Algorithms
Experiments can be done using NS2, NETSIM, NCTU etc.
 Curriculum for Semester- VII [Fourth Year]

Weekly Evaluation
Sr. Course
Course Title Teaching hrs Scheme Credit
No. Code
L T P CA MSE ESE
1 BTCOC701 Software Engineering 3 - - 20 20 60 3
2 BTCOE702 Elective – VIII
(A) Big Data Analytics
(B) Distributed System 3 - - 20 20 60 3
(C) Fundamental of Digital
Image Processing
3 BTCOE703 Elective – IX
(A) Cloud Computing
(B) Business Intelligence 3 - - 20 20 60 3
(C) Natural Language
Processing
4 BTCOE704 Open Elective - X
(A) Blockchain Technology
(B) Computer Graphics 3 - - 20 20 60 3
(C) Embedded Systems
(D) Design Thinking

5 BTCOL705 Full Stack Development

1 - 2 60 - 40 2
(LAMP / MEAN)
6 BTCOL706 System Administration 1 - 2 60 - 40 2
7 BTCOL707 Elective – VIII Lab - - 2 60 - 40 1
8 BTCOL708 Elective – IX Lab - - 2 60 - 40 1
9 BTCOP709 Project phase – I - - 2 60 - 40 1
10 BTCOF609 Field Training / Internship /
- - - - - 50 1
Industrial Training
TOTAL 14 - 10 380 80 490 20
 BTCOC701: Software Engineering

[Unit 1]
Introduction [6 Hrs]
Professional software development, Software engineering ethics, Case studies.
Software processes: Software process models, Process activities, Coping with change, The rational
unified process.
[Unit 2]
Agile software development [6 Hrs]
Agile methods, Plan-driven and agile development, Extreme programming, Agile project
management, Scaling agile methods.
Requirements engineering: Functional and non-functional requirements, The software
requirements document, Requirements specification, Requirements engineering processes,
Requirements elicitation and analysis, Requirements validation, Requirements management.

[Unit 3]
System modeling [6 Hrs]
Context models, Interaction models, Structural models, Behavioral models, Model-driven
engineering. Architectural design: Architectural design decisions, Architectural views,
Architectural patterns, Application architectures.

[Unit 4]
Design and implementation [6 Hrs]
Object-oriented design using UML, Design patterns Implementation issues, Open source
development.

[Unit 5]
Testing [6 Hrs]
Software testing, Development testing, Test-driven development, Release testing, User testing.
[Unit 6] [6 Hrs]
Dependability properties, Availability and reliability, Safety Security.

Text Books:
1. Ian Sommerville, Software Engineering; 9th Edition, Addison-Wesley Publishing Company,
USA.
Reference Books:
1. Software Engineering, S. A. Kelkar, Prentice Hall of India, 2007
2. Software Engineering, Pressman, Tata McGraw Hill, 2006
3. Software Engineering, Pankaj Jalote, Narosa Publishers, 2006.

Elective - VIII
BTCOE702 (A): Big Data Analytics

[Unit 1] Introduction to Big Data [6 Hrs]

Why Big Data and Where did it come from?, Characteristics of Big, Challenges and applications of
Big Data, Enabling Technologies for Big Data, Big Data Stack, Big Data distribution packages.

[Unit 2] Big Data Platforms [7 Hrs]

Overview of Apache Spark, HDFS, YARN, Map Reduce, Map Reduce Programming Model with
Spark, Map Reduce Example: Word Count, Page Rank etc, CAP Theorem, Eventual Consistency,
Consistency Trade-O-s, ACID and BASE, Zookeeper and Paxos, Cassandra, Cassandra Internals,
HBase, HBase Internals.

[Unit 3] Big Data Streaming Platforms [6 Hrs]

Big Data Streaming Platforms for Fast Data, Streaming Systems, Big Data Pipelines for Real-Time
computing, Spark Streaming, Kafka, Streaming Ecosystem.

[Unit 4] Big Data Applications [6 Hrs]

Overview of Big Data Machine Learning, Mahout, Big Data Machine learning Algorithms in
Mahout- kmeans, Naïve Bayes etc. Machine learning with Spark, Machine Learning Algorithms in
Spark, Spark MLlib, Deep Learning for Big Data, Graph Processing: Pregel, Giraph, Spark GraphX

[Unit 5] Database for the Modern Web [7 Hrs]

Introduction to mongoDB key features, Core server tools, MongoDB through the JavaScript’ sshell,
Creating and querying through Indexes, Document-oriented, principles of schema design,
Constructing queries on databases, collections and documents, MongoDBquery language.

Text Books:
1“Analytics in a Big Data World: The Essential Guide to Data Science and its Applications”,
 Bart Baesens, Wiley and SAS Business Series.
2“Big Data Principals and Paradiagram”, Rajkumar Buyya, Rodrigo N. Calheiros, Amir
Vahid Dastjerdi, Morgan Kaufmann, Elsevier, ISBN: 978-0-12-805394-2
3“MongoDB in Action”, Kyle Banker, Peter Bakkum and Shaun Verch, 2nd Edition Dream
tech Press, ISBN: 978-9351199359.
4“Mining of Massive Datasets”, Anand Rajaraman, Jeffrey D. Ullman, 3rd edition,
Cambridge University Press

Reference Books:
1. “BIG Data and Analytics”, Sima Acharya, Subhashini Chhellappan,Wiley publication,
ISBN: 978-8126554782.

Elective - VIII BTCOE702

(B): Distributed Systems

[Unit 1] Introduction [7 Hrs]

Introduction to Distributed Computing System, Evolution of Distributed Computing System,

Distributed Computing System models, Distributed Computing System Gaining Popularity,
Distributed Operating System, Introduction to Distributed Computing Environment (DCE),
Desirable Features of a Good Message-Passing System, Issues in IPC by Message-Passing,
Synchronization, Buffering, Multidatagram message, Encoding and Decoding of message data,
Process addressing, Failure Handling, Group Communication, Case Study: BSD UNIX IPC
Mechanism.

[Unit 2] Remote Procedure Calls [7 Hrs]

Introduction, the RPC model, Transparency of RPC, Implementing RPC Mechanism, Stub
Generation, RPC messages, Marshaling arguments and Results, Server Management, Parameter
Passing Semantics, Call Semantics, Communication Protocols for RPCs, Complicated RPCs,
Client- Server Binding, Exception Handling, Security, Some Special Types of RPCs, RPC in
Heterogeneous Environments, Lightweight RPC, Optimization for Better Performance, Case
studies: Sun RPC, DCE, RPC.

[Unit 3] Distributed Shared Memory [6 Hrs]

Introduction, general Architecture of DSM Systems, Design and Implementation Issues of DSM,
Granularity, Structure of Shared Memory Space, Consistency Models, Replacement Strategy,
Thrashing, Other Approaches to DSM, Heterogeneous DSM, Advantages of Synchronization:
Introduction, Clock Synchronization, Event Ordering, Mutual Exclusion, Deadlock, Election
Algorithms.

[Unit 4] Resource Management [6 Hrs]

Introduction, Desirable Features of a Good Global Scheduling Algorithm, Task assignment
 Approach, Load-Balancing Approach, load Sharing Approach, Process Migration, Threads.

[Unit 5] Distributed File System [6 Hrs]

Introduction, Desirable Features of a Good Distributed File System, File Models, File Accessing
Models, File Sharing Semantics, File Caching Schemes, File Replication, Fault Tolerance, Atomic
Transactions, Design Principles, Case Study: DCE Distributed File Service.

Text Books:
1. P. K. Sinha, Distributed Operating System, PHI Publication.
2. Colorouis, Distributed Systems, Addison Wesley Publication.
3. M. L. Liu, Distributed Computing: Principles and Applications, Addison-Wesley, 2004.

BTCOE702 (C): Fundamental of Digital Image Processing

[Unit 1] Digital Image Fundamentals and Image Transform [6 Hrs]

What is Digital Image Processing? The Origins of Digital Image Processing, Examples of Fields that
Use Digital Image Processing, Digital image representation, Fundamental Steps in Digital Image
Processing, Components of an Image Processing System, Elements of visual perception, Image
sampling and quantization, Basic relationship between pixels, Discrete Fourier transform, Properties
of 2D DFT.

[Unit 2] Image Enhancement Techniques [6 Hrs]

Spatial Domain Techniques, Point processing, Neighborhood processing, Spatial domain filtering,
mage smoothing and Image sharpening using spatial domain filters, Enhancement based on
histogram modeling, Frequency domain filtering, Image smoothing and Image sharpening using
frequency domain filters.

[Unit 3] Image Compression [6 Hrs]

Fundamentals, Types of redundancies, Lossy and Lossless compression, Dictionary based coding,
Run-length coding, LZW coding, Huffman coding, Arithmetic coding, Image compression model.

[Unit 4] Image Segmentation [6 Hrs]

Detection of Discontinuities - Point, Line and Edge detection, finding gradients using masks,
Thresholding based image segmentation, global and local thresholding, Region based segmentation.

[Unit 5] Applications in different domains [6 Hrs]

Applications of image processing in satellite, sonar, radar and medical areas.

Text Books:
1. R. C. Gonzalez and Richard E Woods, “Digital Image Processing”, 3’rd Edition, Pearson
 Education, ISBN 978-81-317-1934-3, 2008.
2. R.C. Gonzalez and R.E. Woods, “Digital Image Processing Using Matlab”, Pearson
Education, ISBN: 978-8177588989.
3. Anil K Jain, “Fundamentals of Digital Image Processing”, Prentice Hall, ISBN:
0133361659, 9780133361650

Elective - IX BTCOE703
(A): Cloud Computing

[Unit 1] Introduction to Cloud [6 Hrs]

Cloud Computing at a Glance, the Vision of Cloud Computing, Defining a Cloud, A Closer Look,
Cloud Computing Reference Model, Characteristics and Benefits, Challenges Ahead, Historical
Developments. Virtualization: Introduction, Characteristics of Virtualized Environment, Taxonomy
of Virtualization Techniques, Virtualization and Cloud computing, Pros and Cons of Virtualization,
Technology Examples- VMware and Microsoft Hyper-V.
Before the Move into the Cloud: Know Your Software Licenses, The Shift to a Cloud Cost
Model, Service Levels for Cloud Applications.

[Unit 2] Cloud Computing Architecture [6 Hrs]

Introduction, Cloud Reference Model, Architecture, Infrastructure / Hardware as a Service,
Platform as a Service, Software as a Service, Types of Clouds, Public Clouds, Private Clouds,
Hybrid Clouds, Community Clouds, Economics of the Cloud, Open Challenges, Cloud
Interoperability and Standards, Scalability and Fault Tolerance.

Ready for the Cloud: Web Application Design, Machine Image Design, Privacy Design, Database
Management, Data Security, Network Security, Host Security, Compromise Response.

[Unit 3] Defining the Clouds for Enterprise [6 Hrs]

Storage as a service, Database as a service, Process as a service, Information as a service, Integration
as a service and Testing as a service; Scaling a cloud infrastructure - Capacity Planning, Cloud Scale.
Disaster Recovery: Disaster Recovery Planning, Disasters in the Cloud, Disaster Management.

[Unit 4] Aneka: Cloud Application Platform [6 Hrs]

Framework Overview, Anatomy of the Aneka Container, From the Ground Up: Platform
Abstraction Layer, Fabric Services, Foundation Services, Application Services, Building Aneka
Clouds, Infrastructure Organization, Logical Organization, Private Cloud Deployment Mode, Public
Cloud Deployment Mode, Hybrid Cloud Deployment Mode, Cloud Programming and Management,
Aneka SDK, Management Tools.

[Unit 5] Cloud Applications [6 Hrs]

Scientific Applications – Health care, Geo-science and Biology; Business and Consumer
Applications- CRM and ERP, Social Networking, Media Applications and Multiplayer Online
Gaming.
Cloud Platforms in Industry: Amazon Web Services- Compute Services, Storage Services,
Communication Services and Additional Services. Google AppEngine-Architecture and Core
Concepts, Application Life-Cycle, cost model.Microsoft Azure- Azure Core Concepts, SQL
Azure.

Text Books:

1. Mastering Cloud Computing by Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi

from TMH2013.
2. George Reese Cloud Application Architectures, First Edition, O‟Reilly Media 2009.
3. Cloud Computing and SOA Convergence in Your Enterprise A Step-by-Step Guide by
David S. Linthicum from Pearson 2010.
4. Cloud Computing 2nd Edition by Dr. Kumar Saurabh from Wiley India2012.
5. Cloud Computing – web based Applications that change the way you work and
ollaborate Online – Micheal Miller, Pearson Education.
 Elective - IX
BTCOE703 (B): Business Intelligence

[Unit 1] Introduction to Business Intelligence [6 Hrs]

Introduction to digital data and its types – structured, semi-structured and unstructured, Introduction
to OLTP and OLAP (MOLAP, ROLAP, HOLAP).

[Unit 2] Basics of BI [6 Hrs]

BI Definitions & Concepts, BI Framework, Data Warehousing concepts and its role in BI, BI
Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities, Business
Applications of BI, BI best practices.

[Unit 3] Data Integration [6 Hrs]

Concepts of data integration, needs and advantages of using data integration, introduction to
common data integration approaches, Meta data –types and sources.

[Unit 4] Data Processing [6

Hrs]
Introduction to data quality, data profiling concepts and applications, Introduction to ETL (Extract-
Transform-Loading) using Open Source Software

[Unit 5] Data and Dimension Modeling [6 Hrs]

Introduction, ER Modeling, multidimensional data modeling, concepts of dimensional, facts, cubes,
attribute, hierarchies, star and snowflake schema, Introduction to business metrics and KPLs,
creating OLAP using Application Software.
Basic of Enterprise Reporting: A typical enterprise, Malcolm Baldrige – quality performance
framework, balanced scorecard, enterprise dashboard, balanced scorecard vs. enterprise dashboard,
enterprise reporting using software tools, best practices in the design of enterprise dashboards.

Text Books:
1. R. N. Prasad and Seema Acharya, “Fundamentals of Business Analytics”, Wiley Publication.

Reference Books
1. Raiph Kimball, Ross, “The Data Warehouse Lifecycle Toolkit” Wiley Publication, 2nd
edition.
2. Anahory& Murray, “Data Warehousing in the Real World” Pearson Edt Ponniah, “Data
Warehousing Fundamentals”, Wiley Publication

Elective - IX
BTCOE703 (C): Natural Language Processing

[Unit 1] Introduction [6 Hrs]

Biology of Speech Processing; Place and Manner of Articulation; Word Boundary Detection;
Argmax based computations; HMM and Speech Recognition.

[Unit 2] Word level Analysis [7 Hrs]

Morphology fundamentals; Morphological Diversity o f Indian Languages; Morphology Paradigms;
Finite State Machine Based Morphology; Automatic Morphology Learning; Shallow Parsing;
Named Entities; Maximum Entropy Models; Random Fields.

[Unit 3] Syntax Analysis [6 Hrs]

Theories of Parsing, Parsing Algorithms; Robust and Scalable Parsing on Noisy Text as in Web
documents; Hybrid of Rule Based and Probabilistic Parsing; Scope Ambiguity and Attachment
Ambiguity resolution.

[Unit 4] Semantic Analysis [7 Hrs]

Lexical Knowledge Networks, Wordnet Theory; Indian Language Wordnets and Multilingual
Dictionaries; Semantic Roles; Word Sense Disambiguation; WSD and Multilinguality; Metaphors;
Coreferences.

[Unit 5] Applications [6 Hrs]

Sentiment Analysis; Text Entailment; Robust and Scalable Machine Translation; Question
Answering in Multilingual Setting; Cross Lingual Information Retrieval (CLIR).

Text Books:
1. Allen, James, Natural Language Understanding, 2nd Edition, Benjamin / Cumming, 1995.
2. Charniack, Eugene, Statistical Language Learning, MIT Press, 1993.
3. Jurafsky, Dan and Martin, James, Speech and Language Processing, Second Edition,
Prentice Hall, 2008.
4. Manning, Christopher and Heinrich, Schutze, Foundations of Statistical Natural Language
Processing, MIT Press, 1999.

Elective - X
BTCOE704 (A): Blockchain Technology

[Unit 1] Introduction [6 Hrs]

Overview of Blockchain, Public Ledgers, Bitcoin, Smart Contracts, Block in a Blockchain,

Transactions, Distributed Consensus, Public vs. Private Blockchain, Understanding Cryptocurrency
to Blockchain, Permissioned Model of Blockchain, Overview of Security aspects of Blockchain.
Basic Crypto Primitives: Hash functions, Properties of a hash function, Hash pointer and Merkle
tree, Public key cryptography, Digital signatures, Zero-knowledge systems

[Unit 2] Bitcoin and Blockchain [6

Hrs]

Creation of coins, Payments and double spending, Bitcoin Scripts, Bitcoin P2P Network,
Transaction in Bitcoin Network, Block Mining, Block propagation and block relay. Working with
Consensus in Bitcoin: Distributed consensus in open environments, Consensus in a Bitcoin
network, Proof of Work (PoW) – basic introduction, Hashcash PoW, Bitcoin PoW, Attacks on PoW
and the monopoly problem, Proof of Stake, Proof of Burn and Proof of Elapsed Time, The life of a
Bitcoin Miner, Mining Difficulty, Mining Pool.

[Unit 3] Permissioned Blockchain [6 Hrs]

Permissioned model and use cases, Design issues for Permissioned blockchains, Execute contracts,
State machine replication, Overview of Consensus models for permissioned blockchain-Distributed
consensus in closed environment, Paxos, RAFT Consensus, Byzantine general problem, Byzantine
fault tolerant system, Lamport-Shostak-Pease BFT Algorithm, BFT over Asynchronous systems.

[Unit 4] Blockchain Application Development [5

Hrs]

Enterprise application of Blockchain: Cross border payments, Know Your Customer (KYC),
Food Security, Mortgage over Blockchain, Blockchain enabled Trade, We Trade –Trade Finance
Network, Supply Chain Financing, Identity on Blockchain.

[Unit 5] Blockchain Application Development [5

Hrs]

Hyperledger Fabric- Architecture, Identities and Policies, Membership and Access Control,
Channels, Transaction Validation, Writing smart contract using Hyperledger Fabric, Writing smart
contract using Ethereum, Overview of Ripple and Corda.

Text Books:

1. Melanie Swan, “Blockchain: Blueprint for a New Economy”, O’Reilly, 2015.

2. Josh Thompsons, “Blockchain: The Blockchain for Beginners-Guide to Blockchain Technology
and Leveraging Blockchain Programming”
3. Daniel Drescher, “Blockchain Basics”, Apress; 1st Edition, 2017.
4. Anshul Kaushik, “Blockchain and Crypto Currencies”, Khanna Publishing House, Delhi.
5. Imran Bashir, “Mastering Blockchain: Distributed Ledger Technology, Decentralization and
Smart Contracts Explained”, Packt Publishing
6. Ritesh Modi, “Solidity Programming Essentials: A Beginner’s Guide to Build Smart Contracts
for Ethereum and Blockchain”, Packt Publishing.
7. Salman Baset, Luc Desrosiers, Nitin Gaur, Petr Novotny, Anthony O’Dowd, Venkatraman
Ramakrishna, “Hands-On Block Chain with Hyperledger: Building Decentralized Applications
with Hyperledger Fabric and Composer”, Import, 2018.
 Elective - X
BTCOE704 (B): Computer Graphics

[Unit 1] Basic Concepts [6 Hrs]

Introduction to computer graphics, lines, line segments, pixels and frame buffers, anti-aliasing
techniques and character generation methods. Graphics Display devices (monochrome, color)
interactive devices, Scanners and digitizers, touch panels, tablets, mouse, joysticks, trackball, light
pen.

[Unit 2] 2D Transformation [7 Hrs]

Line and circle plotting using Breshemham’s and other algorithms, transformation matrices,
scaling, rotation, translation, picture transformation, mirror image.
Window and Clipping: Introduction, viewing transforms, 2-D clipping, Sutherland Cohen
approach, Cyrus Beck Method, Midpoint subdivision algorithm, Liang-Barsky line clipping
algorithm, polygon clipping, text clipping, generalized clipping.

[Unit 3] 3D Graphics [7 Hrs]

Introduction, 3-D geometry, Coordination system, 3D transformation, rotation about an arbitrary
axis, orthogonal projections, multiple views, isometric projection, perspective projections, 3-D
clipping.
Hidden Surfaces and Lines: Introduction, Back face removal algorithm, Z-buffers, Scan line and
Painter's algorithm hidden surface removal, curved surface generation, generation of solids, sweep
method, interpolation.

[Unit 4] Graphical User Interface [6 Hrs]

X- Windows, use of graphics tools like OPENGL, DirectX, Windows and Motif, Graphic Standards.

[Unit 5] Animation [6 Hrs]

Introduction, devices for producing animation, computer assisted animation, real time animation,
method for controlling animation (fully explicit control, procedural).

Text Books:
1. Peter Shirley, Michael Ashikhmin, Steve Marschner, Fundamental of Computer Graphics,
4th Edition, CRC Press.
2. Newman, Sprouall, Interactive Computer Graphics, McGraw-Hill Publication.
3. Hearn, Baker, Computer Graphics, PHI Publication.
4. Krishnamurthy, Introduction to Computer Graphics, McGraw-Hill Publication.
5. ISRD Group, Computer Graphics, McGraw-Hill Publication.

BTCOE704 (C): Embedded Systems

[Unit 1] Introduction [6 Hrs]

Embedded system overview, Design challenge, Processor technology, IC technology, Design

technology, Custom single processor technology, Hardware-combinational logic, Sequential
logic, Custom single purpose processor design, RT-level custom single purpose processor
design, Optimizing custom single purpose processors.

[Unit 2] General purpose processor Software [6 Hrs]

Basic architecture, Operation, Programmers view, Development environment, Application specific

instruction set processor, Selecting a microprocessor, General purpose processor design.
Introduction, ARM7TDMI-S processor, Block diagram, Memory mapping, Memory accelerator
module.

[Unit 3] System control [7 Hrs]

Pin description, Register description, Crystal oscillator, External interrupt inputs, Other system
controls, Memory mapping control, Phase locked loop, Power control, Reset, APB divider,
Wakeup timer. GPIO: GPIO register map, Timer-TIMER / COUNTER0 and TIMER /
COUNTER1 register map, Example timer operation, Architecture.
[Unit 4] UART [6 Hrs]

UART0/1 - UART0/1 register map, UART0/1 baud rate, UART0/1 auto-baud, UART0/1 block
diagram. Serial peripheral interface: SPI data transfers, SPI pin description, SPI register map, SPI
block diagram; I2C- bus interface: I2C bus configuration, I2C operating modes, I2C Bus serial
interface block diagram, Summary of I2C registers.

[Unit 5] Process scheduling [7 Hrs]

Examples of RTOS, Microprocessor and microcontroller based system design, typical design
examples, system design and simulation using simulation software such as Proteus VSM. Digital
Camera Example Introduction, Introduction to a Simple Digital Camera; User’s Perspective,
Designer’s perspective requirements specification non functional requirements, Informal functional
specification, Refined functional specification, Design

Text Books:

1. “Embedded System Design- A Unified system Hardwar/Software Introduction”, Frank

Vahid (3rd Edition, John Wiley India) ISBN 978-81-265-0837-2.
2. LPC 214x User manual (UM10139) www.nxp.com.
3. “ARM System Developer’s Guide – Designing and Optimizing System Software”, Andrew
N. Sloss, Dominic Symes and Chris Wright (ELSEVIER) ISBN: 1-55860-874-5.

Reference Books:

1. LPC 17xx User manual (UM10360) :- www.nxp.com

2. ARM architecture reference manual : - www.arm.com
3. “An Engineer’s Introduction to the LPC2100 series” Trevor Martin (Hitex (UK) Ltd.)
4. “ARM System-on-Chip Architecture” Steve Furber (2nd Edition, Addison-Wesley
Professional)ISBN-13: 9780201403527
 BTCOE704 (D): Design Thinking

[Unit 1] Overview of Design Thinking Process [7 Hrs]

Design Thinking Process: Business context of innovation for applying design thinking, two models
of design thinking, phases of design thinking, correlation with other philosophies. Introduction to
design thinking: Definition, Origin of design thinking, Importance of design thinking, Design vs.
Design thinking, Problem solving, Understanding design thinking and its process model, Design
thinking tools. Human-Centered Design (HCD) process - Empathize, Define, Ideate, Prototype and
Test and Iterate or Empathize, Analyze, Solve and Test.
[Unit 2] Empathize [6 Hrs]
Design thinking phases, How to emphasize, Role of empathy in design thinking, purpose of empa-
thy maps, Things to be done prior to empathy mapping, creation of user persons, customer journey
mapping, How might we questions.
[Unit 3] Analyze or Define [6 Hrs]
Root cause analysis, conflict of interest, perspective analysis, big picture thinking through system
operator, big picture thinking through function modeling Silent brainstorming, metaphors for
ideation, CREATE and What-If tool for ideation, introduction to TRIZ, Inventive principles and
their applications.
[Unit 4] Test (Prototyping And Validation) [5 Hrs]
 Prototyping, Assumptions during the design thinking process, Validation in the market, best prac-
tices of presentation.
[Unit 5] Design Innovation [5 Hrs]
Benefits of iteration in the design thinking process, taking the idea to the market, introduction to
innovation management in a company.

Text Books:
1. Bala Ramadurai, “Karmic Design Thinking”, First Edition, 2020.

Reference Books:
1. 101 Design Methods: A Structured Approach for Driving Innovation in Your Organization
by Vijay Kuma.
2. Human-Centered Design Toolkit: An Open-Source Toolkit To Inspire New Solutions in the
Developing World by IDEO.
3. This is Service Design Thinking: Basics, Tools, Cases by Marc Stickdorn and Jakob Schnei-
der.
4. Ulrich, Karl T. Design: Creation of artifacts in society, 2011.

BTCOL705: Full Stack Development (LAMP / MEAN)

[Unit 1] Basic HTML, Advanced HTML [4 Hrs]

HTML5: HTML5 Doctype, Some New HTML5 Elements, HTML5 Header And Footer, Allow
spell check and editable areas, Adding audio, Drag & drop, User location: geolocation, Saving
information - local Storage, Saving information - session Storage.

[Unit 2] CSS [6 Hrs]

What Is CSS?, How to write CSS: syntax, Using style sheets, Using external style sheets, Identities
and classes, Style entire elements, CSS Comments, Change background colors, Setting background
images, Change text color, Text formatting using CSS, Font Properties, Text Properties, Styling
hyperlinks using CSS, Styling lists using CSS, Setting element width and height, Adding borders,
Spacing: margin & padding, Change the mouse type: cursor, Hide, show and display elements, What
to do with overflowing content.
CSS Advanced: Grouping & Nesting, Maximum & Minimum Dimensions, Move an element from
its default position, Relative location & layering, Floating, Clear, Pseudos, Alignment Sprites: the
most efficient way to load images, Make elements translucent: opacity, Different media types, Style
elements based on their attributes, Browser prefixes.

[Unit 3] Javascript Basics [6 Hrs]

JavaScript Essentials, What is JavaScript?, JavaScript: Internal vs. External, JavaScript comments,
document. write(); Display info from the browser: alert & confirm, Prompting the user for
information, Programming fundamentals: Variables, Add two sentences together: concatenation,
Basic math in JavaScript, Redirecting users and opening new windows, Creating empty hyperlinks,
String Manipulation, Comparing variables and values, Programming fundamentals: If...Else
Statements, Else...If Statements, Switch Statements, Functions; JavaScript Events, Selecting HTML
elements using get Element By Id(), Escaping content, Programming fundamentals: Arrays, For
Loops, While Loops, Breaking Out Of Loops, Skipping A Loop Cycle.
Javascripts Advanced: Getting parts of a value: split & substr, Programming fundamentals:
Try...Catch And Throw, Getting the users date and time, Some more complex math (no homework),
Programming fundamentals: Regular Expressions, Get the users browser (navigator), Add timing:
set Interval & set Timeout.

[Unit 4] Ajax, jQuery, PHP, PHP Advanced. [4 Hrs]

Text Books:

1. Colin Ihrig, Full Stack JavaScript Development With MEAN: MongoDB, Express,
AngularJS, and Node.JS, SitePoint; 1st Edition.
2. https://www.w3schools.com/whatis/whatis_fullstack.asp.
3. Robin Nixon, Learning PHP, MySQL, JavaScript, CSS & HTML5: A Step-by-Step Guide
to Creating Dynamic Websites, O'Reilly Media; 3rd edition,
4. Callum Macrae, Learning from jQuery, O'Reilly Media.

BTCOL706: System Administration

1. Installations of various Linux flavors (Optionally using Virtualbox): Centos (with LVM,
without LVM), Ubuntu (with LVM, without LVM), Debian (with LVM, without LVM).
2. SSH Server (CentOS and Ubuntu): enable/disable root login.
3. Telnet server (CentOS and Ubuntu).
4. FTP Server (CentOS and Ubuntu).
5. Using command upload/download files from FTP Server.
6. Samba Server (CentOS and Ubuntu).
7. HTTP Server (CentOS and Ubuntu).
8. Configuration of Proxy Server.

Reference Books:
1. Tom Adelstein, Bill Lubanovic, Linux System Administration: Solve Real-life Linux
Problems Quickly, O'Reilly Media.
 2. Æleen Frisch, Essential System Administration, Third Edition, O'Reilly Media.

3. Terry Collings, Kurt Wall, Red Hat Linux Networking and System Administration, 3rd
Edition, Wiley Publication.

BTCOL707 (A): Big Data Analytics Laboratory

List of Experiments:

1. Perform setting up and Installing Hadoop in its two operating modes:

a) Pseudo distributed,
b) Fully distributed.
2. Implement the following file management tasks in Hadoop:
a) Adding files and directories
b) Retrieving files
c) Deleting files
3. To understand the overall programming architecture using Map Reduce API
4. Store the basic information about students such as roll no, name, date of birth and
address Of student using various collection types such as List, Set and Map
5. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.
a) Find the number of occurrence of each word appearing in the input file(s)
 b) Performing a Map Reduce Job for word search count (look for specific
keywords in a file)
6. Install and Run Hbase then use HbaseDDl and DML commands
7. Install, Deploy & configure Apache Spark Cluster. Run apache spark applications using
Scala.
8. Basic CRUD operations in MongoDB
9. Retrieve various types of documents from students collection
10. Data analytics using Apache Spark on Amazon food dataset, find all the pairs of items
frequently reviewed together.
a) Write a single Spark application that:
i. Transposes the original Amazon food dataset, obtaining a PairRDD of the
type:<user_id> → <list of the product_ids reviewed by user_id>
ii. Counts the frequencies of all the pairs of products reviewed together;
iii. Writes on the output folder all the pairs of products that appear more than once
and their frequencies. The pairs of products must be sorted by frequency.

BTCOL707 (B): Distributed Systems Laboratory

List of Experiments:

1. Implement the concept of RPC.

2. Implement the concept of RMI.
3. Design a Distributed Application using Message passing Interface for remote computation.
4. Implementation of Clock Synchronization (logical/physical).
5. To write Program multi-threaded client/server processes.
6. Implement concurrent echo client-server application
7. Implement concurrent day-time client-server application.
8. Configure following options on server socket and tests them:
SO_KEEPALIVE,SO_LINGER, SO_SNDBUF, SO_RCVBUF,
TCP_NODELAY
9. Incrementing a counter in shared memory.
 10. To Study Implementation of Election algorithm.
11. To study Implementation of Mutual Exclusion algorithms.
12. Implement Network File System (NFS).

BTCOL707 (C): Fundamental of Digital Image Processing Laboratory

List of Experiments:

1. Study of Matlab environment and implementation of matlab commands, functions

and programming constructs.
2. Point processing in spatial domain
a. Negation of an image
b. Thresholding of an image
c. Contrast Stretching of an image
3. Program to implement Bit Plane Slicing
4. Program for plotting a Histogram of an image
5. Program to implement Histogram Equalization
 6. To write a Program for Histogram Specification
7. Zooming an image by interpolation and replication
8. Filtering in spatial domain
a. Low Pass Filtering
b. High Pass Filtering
c. Median filtering
9. Edge Detection using derivative filter mask
a. Prewitt
b. Sobel
c. Laplacian
10. Data compression using Huffman coding
11. Filtering in frequency domain
a. Low pass filter
b. High pass filter

BTCOL708 (A): Cloud Computing Laboratory

List of Experiments:
(Pl. Note: List of Experiments should be as per theory covered in the class based on
Cloud Environments. Following list can be used as a reference.)

1. Sketch out and analyze architecture of Moodle cloud portal and moodle cloud site and
create different entities dynamically.
2. Create a scenario in wordpress for Social Marketing, Search engine and Sharing Tools.
3. Working in Cloud9 to demonstrate different language.
4. Working in Codenvy to demonstrate Provisioning and Scaling of a website.
5. Implement and configure Google App Engine to deploy Python Program application.
6. Installation and configuration of virtual machine with guest OS.
7. Demonstrate the use of map and reduce tasks.
 8. Implementation of SOAP Web services in C#/JAVA Applications.
9. Categorize Amazon Web Service (AWS) and implement its various cloud entities using
its Cloud Toolbox support.
10. Implement and use sample cloud services with the help of Microsoft Azure.
11. Design and analyze architecture of Aneka / Eucalyptus / KVM identify different entities
to understand the structure of it.
12. Make and perform scenario to pause and resume the simulation in Aneka / Eucalyptus entity,
and create simulation entities dynamically.
13. Organize a case in Aneka / Eucalyptus for simulation entities in run-time using a its toolkit
support and manage virtual cloud.

Elective - IX Laboratory
BTCOL708 (B): Business Intelligence Laboratory

List of Experiments:

1. Installation of SQL server and Power BI.

2. Import the legacy data from different sources such as (Excel, SqlServer, Oracle
etc.) and load in the target system.
3. Perform the Extraction Transformation and Loading (ETL) process to construct the
database in the Sqlserver / Power BI.
4. Create the cube with suitable dimension and fact tables based on ROLAP, MOLAP
and HOLAP model.
 5. Create the ETL map and setup the schedule for execution.
6. Execute the MDX queries to extract the data from the data warehouse.
7. Apply the what – if Analysis for data visualization. Design and generate necessary
reports based on the data warehouse data.
8. Implementation of Classification algorithm in R Programming.
9. Practical Implementation of Decision Tree using R Tool.
10. Prediction Using Linear Regression.
11. Data Analysis using Time Series Analysis.

Elective - IX Laboratory
BTCOL708 (C): Natural Language Processing Laboratory

List of Experiments:

Practical may be implemented using programming Python / Java. Concern faculty member may
add more experiments in the list make it minimum 10 to 12.

1. Preprocessing of text (Tokenization, Filtration, Script Validation, Stop Word

Removal, Stemming)
2. Morphological Analysis
3. N-gram model
 4. POS tagging
5. Chunking
6. Named Entity Recognition
7. Case Study/ Mini Project based on Application mentioned in Module.

BTCOP709: Project Phase – I

Guidelines for the project phase – I:

The project should enable the students to combine the theoretical and practical concepts studied in
his / her academics. The project work should enable the students to exhibit their ability to work in a
team, develop planning and execute skills and perform analyzing and trouble shooting of their
respective problem chosen for the project. The students should be able to write technical report,
understand the importance of teamwork and group task. The students will get knowledge about
literature survey, problem definition, its solution, and method of calculation, trouble shooting,
costing, application and scope for future development.

Project work:
The project work is an implementation of learned technology. The knowledge gained by studying
various subjects separately supposed to utilize as a single task. A group of 03/04 students will have
to work on assigned work. The topic could be a product design, specific equipment, live industrial
problem etc. The project work involves experimental/theoretical/computational work. It is expected
to do necessary literature survey by referring current journals belonging to Information Technology
reference books and internet. After finalization of project, requisites like equipments, data, tools
etc. should be arranged.

Project Activity:

The project groups should interact with guide, who in turn advises the group to carry various
activities regarding project work on individual and group basis. The group should discuss the
progress every week in the project hours and follow further advice of the guide to continue
progress. Guide should closely monitor the work and help the students from time to time. The guide
should also maintain a record of continuous assessment of project work progress on weekly basis.

Phase - I:
1. Submission of project/problem abstract containing problem in brief, requirements, broad
area, applications, approximate expenditure if required etc.
2. Problem definition in detail.
3. Literature survey.
4. Requirement analysis.
5. System analysis (Draw DFD up to level 2, at least).
6. System design, Coding/Implementation (20 to 30%).

BTCOF709: Field Training / Internship / Industrial Training

Guidelines for Field Training / Internship / Industrial Training Industrial Training:

1. To apply for a suitable Industrial Training, submit an application form to respective

organization concerned one semester before the Industrial Training Programme commences.
2. Student can also apply through online platforms such as Internshala for industrial training.
3. Submit one copy of the offer letter for the Industrial Training to the Head of the department
or Faculty coordinator (Industrial Training).
4. To complete the Industrial Training process within the specified time based on the Industrial
 Training Programme schedule.
5. Assessment within the Industrial Training context aims to evaluate the student’s work
quality and appropriateness to the field of study with reference to the learning outcomes of
the Industrial Training Programme.
6. Evaluation of the students’ performance should be done in the next upcoming semester.
7. Those students who fails, they can also complete online certification courses which are
available at free of cost on various MOOC platforms.

Curriculum for Semester- VII [Fourth Year]

Weekly Evaluation
Sr. Teaching hrs Scheme
Course Code Course Title Credit
No.
L T P CA MSE ESE
1 BTCOE801 Elective – XI # 3 - - 20 20 60 3
2 BTCOE802 Open Elective – XII # 3 - - 20 20 60 3
3 BTCOE803 Project phase - II (In-house) $ /
Internship and project in the - - 24 60 - 40 12
Industry
TOTAL 6 - 24 100 40 160 18

# These subjects are to be studied on self–study mode using

SWAYAM / NPTEL. The list of self-study online courses is given
below.

The list of self-study online courses

BTCOE801: Elective – XI # BTCOE802: Open Elective – XII #

(A) Deep Learning (A) Introduction to Industry 4.0 and Industrial
Internet of Things
(B) Social Networks (B) Cryptography and Network Security ##
(C) Randomized Algorithms ## (C) Model Checking

* Six months of Internship and Project in the industry.

$ This is for those students who are not doing Internship and project in the
Industry, they can do project in the department.

Elective - XI BTCOE801

(A): Deep Learning

Week 1: Introduction to Deep Learning, Bayesian Learning, Decision Surfaces

Week 2: Linear Classifiers, Linear Machines with Hinge Loss

Week 3: Optimization Techniques, Gradient Descent, Batch Optimization

Week 4: Introduction to Neural Network, Multilayer Perceptron, Back Propagation

Learning
Week 5: Unsupervised Learning with Deep Network, Autoencoders

Week 6: Convolutional Neural Network, Building blocks of CNN, Transfer Learning

Week 7: Revisiting Gradient Descent, Momentum Optimizer, RMSProp, Adam

Week 8: Effective training in Deep Net- early stopping, Dropout, Batch Normalization,
Instance Normalization, Group Normalization
Week 9: Recent Trends in Deep Learning Architectures, Residual Network, Skip
Connection Network, Fully Connected CNN etc.
Week 10: Classical Supervised Tasks with Deep Learning, Image Denoising, Semanticd
Segmentation, Object Detection etc.
Week 11: LSTM Networks

Week 12: Generative Modeling with DL, Variational Autoencoder, Generative

Adversarial Network Revisiting Gradient Descent, Momentum Optimizer, RMSProp,
Adam

Link: https://swayam.gov.in/nd1_noc20_cs62/preview

Elective - XI BTCOE801 (B): Social Networks

Week 1: Introduction

Week 2: Handling Real-world Network Datasets

Week 3: Strength of Weak Ties
Week 4: Strong and Weak Relationships (Continued) & Homophily
Week 5: Homophily Continued and +Ve / -Ve Relationships
Week 6: Link Analysis

Week 7: Cascading Behaviour in Networks

Week 8: Link Analysis (Continued)

Week 9: Power Laws and Rich-Get-Richer Phenomena

Week 10: Power law (contd..) and Epidemics

Week 11: Small World Phenomenon

Week 12: Pseudocore (How to go viral on web)

Elective - XI
BTCOE801 (C): Randomized Algorithms

Week 1: Introduction to Randomized Algorithms

Week 2: Probability Review
Week 3: Moments and Deviation

Week 4: The Probabilistic Method

Week 5: Markov Chains - I

Week 6: Markov Chain - II

Week 7: Number Theoretic Algorithms

Week 8: Graph Algorithms

Week 9: Approximate Counting
Week 10: Data Structures

Week 11: Computational Complexity

Week 12: Review of the course

Open Elective - XII

BTCOE802 (A): Introduction to Industry 4.0 and Industrial Internet of Things

Week 1 : Introduction: Sensing & actuation, Communication-Part I, Part II, Networking-

Part I, Part II
Week 2 : Industry 4.0: Globalization and Emerging Issues, The Fourth Revolution, LEAN
Production Systems, Smart and Connected Business Perspective, Smart Factories
Week 3 : Industry 4.0: Cyber Physical Systems and Next Generation Sensors, Collaborative
 Platform and Product Lifecycle Management, Augmented Reality and Virtual Reality,
Artifical Intelligence, Big Data and Advanced Analysis
Week 4 : Cybersecurity in Industry 4.0, Basics of Industrial IoT: Industrial Processes-Part I,
Part II, Industrial Sensing & Actuation, Industrial Internet Systems.
Week 5 : IIoT-Introduction, Industrial IoT: Business Model and Reference
Architecture: IIoT-Business Models-Part I, Part II, IIoT Reference Architecture-Part I,
Part II.
Week 6 : Industrial IoT- Layers: IIoT Sensing-Part I, Part II, IIoT Processing-Part I, Part
II, IIoT Communication-Part I.
Week 7 : Industrial IoT- Layers: IIoT Communication-Part II, Part III, IIoT Networking-
Part I, Part II, Part III.
Week 8 : Industrial IoT: Big Data Analytics and Software Defined Networks: IIoT
Analytics - Introduction, Machine Learning and Data Science - Part I, Part II, R and
Julia Programming, Data Management with Hadoop.
Week 9 : Industrial IoT: Big Data Analytics and Software Defined Networks: SDN in
IIoT- Part I, Part II, Data Center Networks, Industrial IoT: Security and Fog Computing:
Cloud Computing in IIoT-Part I, Part II.
Week 10 : Industrial IoT: Security and Fog Computing - Fog Computing in IIoT, Security
inIIoT- Part I, Part II, Industrial IoT- Application Domains: Factories and Assembly Line, Food
Industry.
Week 11 : Industrial IoT- Application Domains: Healthcare, Power Plants, Inventory
Management & Quality Control, Plant Safety and Security (Including AR and VR safety
applications), Facility Management.
Week 12 : Industrial IoT- Application Domains: Oil, chemical and pharmaceutical
industry, Applications of UAVs in Industries, Real case studies :

Case study - I : Milk Processing and Packaging Industries

Case study - II: Manufacturing Industries - Part I

Case study - III : Manufacturing Industries - Part II
Case study - IV : Student Projects - Part I

Case study - V : Student Projects - Part II

Case study - VI : Virtual Reality Lab
Case study - VII : Steel Technology Lab

BTCOE802 (B): Cryptography & Network Security

Week 1: Introduction to cryptography, Classical Cryptosystem, Block Cipher.

Week 2: Data Encryption Standard (DES), Triple DES, Modes of Operation, Stream Cipher.
Week 3: LFSR based Stream Cipher, Mathematical background, Abstract algebra, Number Theory.
Week 4: Modular Inverse, Extended Euclid Algorithm, Fermat's Little Theorem, Euler Phi-
Function, Euler's theorem.
Week 5: Advanced Encryption Standard (AES), Introduction to Public Key Cryptosystem, Diffie-
Hellman Key Exchange, Knapsack Cryptosystem, RSA Cryptosystem.
Week 6: Primarily Testing, ElGamal Cryptosystem, Elliptic Curve over the Reals, Elliptic curve
Modulo a Prime.
Week 7: Generalized ElGamal Public Key Cryptosystem, Rabin Cryptosystem.
Week 8 : Message Authentication, Digital Signature, Key Management, Key Exchange, Hash
Function.
Week 9 : Cryptographic Hash Function, Secure Hash Algorithm (SHA), Digital Signature Standard
(DSS).
Week 10: Cryptanalysis, Time-Memory Trade-off Attack, Differential and Linear
Cryptanalysis.
Week 11: Cryptanalysis on Stream Cipher, Modern Stream Ciphers, Shamir's secret sharing and BE,
Identity-based Encryption (IBE), Attribute-based Encryption (ABE).
Week 12: Side-channel attack, The Secure Sockets Layer (SSL), Pretty Good Privacy (PGP),
Introduction to Quantum Cryptography, Blockchain, Bitcoin and Cryptocurrency.

BTCOE802 (C): Model Checking

Week 1: Modeling systems as Finite-state machines

Week 2: Using the model-checker NuSMV

Week 3: Linear-time properties for verification

Week 4: Regular properties – automata over finite words

Week 5: Omega-regular properties – automata over infinite words

Week 6: Model checking omega-regular properties

Week 7: Linear Temporal Logic (LTL)

Week 8: Algorithms for LTL

Week 9: Computation Tree Logic (CTL)

Week 10: Algorithms for CTL

Week 11: Binary Decision Diagrams (BDDs)

Week 12: Models with timing constraints – timed automata Regular properties – automata over
finite words

BTCOP803: Project phase – II $ / Internship and project in the Industry *

$ This is for those students who are not doing Internship and Project in the Industry, they can do
 project in the department.

* Six months of Internship and Project in the industry.

This is continuous work to the project phase - I. Every students will have to submit a completed
report (3 copies)* of the project work. Report preparation guidelines should be followed as per
given format. The students will prepare a power point presentation of the work. Panel of examiners
comprising of guide, internal examiner, senior faculty, external examiner, etc. will assess the
performance of the students considering their quality of work.

Phase phase - II
1. Coding / Implementation.
2. Use cases.
3. Testing / Trouble shooting.
4. Data dictionary / Documentation.
5. Finalization of project in all respects.

* (For guide, Personal copy, Departmental library)

In a presentation, the students should focus to clarify problem definition and analysis of the
problem.