SRI VENKATESWARA COLLEGE OF

ENGINEERING
An Autonomous Institution,
Affiliated to Anna University, Chennai
SRIPERUMBUDUR TK - 602 117

REGULATIONS 2018

B.TECH - ARTIFICIAL INTELLIGENCE AND

DATA SCIENCE
Choice Based Credit System
Curriculum and Syllabus
(Semester I to IV)

1
 SEMESTER I

COURSE CONTACT Fixed/

S.NO. COURSE TITLE CATEGORY L T P C Prerequisites
CODE PERIODS Movable

THEORY
Communicative English
1. HS18151 HS 3 3 0 0 3 NIL F
(Common to all Branches)
Engineering Mathematics I
2. MA18151 (Common to all branches BS 4 3 1 0 4 NIL F
except MR)
Engineering Physics
3. PH18151 BS 3 3 0 0 3 NIL F
(Common to all branches)
Engineering Chemistry
4. CY18151 (Common to all branches BS 3 3 0 0 3 NIL F
except MR)
Basic Electrical and Electronics
Engineering
5. EE18151 ES 3 3 0 0 3 NIL F
(Common to AE, BT, CE, CS,
IT, MR & ME)
Programming for Problem
Solving
6. IT18101 ES 3 3 0 0 3 NIL F
(Common to all branches
except MR)
PRACTICAL
Physics and Chemistry
7. PC18161 Laboratory BS 2 0 0 2 1 NIL F
(Common to all branches)
Engineering Practices
8. GE18161 Laboratory ES 3 0 0 3 1.5 NIL F
(Common to all branches)
Programming for Problem
Solving Laboratory
9. IT18111 ES 3 0 0 3 1.5 NIL F
(Common to all branches
except MR)
TOTAL 27 18 1 8 23 - -

(Recommended by BoS - Meeting held on 04.03.2020)

II
 SEMESTER II

COURSE CONTACT Fixed/

S.NO. COURSE TITLE CATEGORY L T P C Prerequisites
CODE PERIODS Movable

THEORY
Engineering Mathematics II
1. MA18251 BS 4 3 1 0 4 NIL F
(Common to all branches except MR)
2. MA18253 Algebra for Data Science BS 4 3 1 0 4 NIL F
Engineering Drawing
3. GE18151 BS 5 3 0 2 4 NIL F
(Common to all branches)
4. AD18201 Digital Logic Design ES 4 3 1 0 4 NIL F
5. AD18202 Data Structures and Algorithm Analysis PC 4 3 1 0 4 NIL F
Object Oriented Paradigm and
6. AD18203 PC 4 3 1 0 4 NIL F
Programming
PRACTICAL
Data Structures and Algorithm Analysis
7. AD18211 PC 4 0 0 4 2 NIL F
Laboratory
Object Oriented Paradigm and
8. AD18212 PC 4 0 0 4 2 NIL F
Programming Laboratory
TOTAL 33 18 5 10 28 - -

(Recommended by BoS - Meeting held on 04.03.2020)

III
 SEMESTER III

COURSE CONTACT
S.NO. COURSE TITLE CATEGO L T P C Prerequisites Fixed/
CODE PERIODS
RY Movable
THEORY
1. MA18353 Probability and Statistics for Data Science BS 4 3 1 0 4 - F
MA18354 Mathematics for Data Analysis
2. BS 4 3 1 0 4 - F
3. CS18402 Operating Systems PC 3 3 0 0 3 - F
Foundations to Computer Systems
4. AD18301 PC 3 3 0 0 3 - F
Design
Intelligent Database Management
5. AD18302 PC 3 3 0 0 3 - F
Systems
AD18303 Programming for Data Science
6. PC 3 3 0 0 3 - F
PRACTICAL
Operating Systems Laboratory
7. CS18411 PC 3 0 0 3 1.5 - F

Intelligent Database Management

8. AD18311 PC 3 0 0 3 1.5 - F
Systems Laboratory
Programming for Data Science
9. AD18312 PC 3 0 0 3 1.5 - F
Laboratory
TOTAL 29 18 2 9 24.5 - -

(Recommended by BoS - Meeting held on 03.12.2020)

SEMESTER IV

COURSE CONTACT
S.NO COURSE TITLE CATEGORY L T P C Prerequisites Fixed/
CODE PERIODS
. Movable
THEORY

MA18456 Queuing Theory and Optimization

1. BS 4 3 1 0 4 P&S, AMDS F
2. AD18401 Intelligent Computer Networks PC 3 3 0 0 3 - F
AD18402 Principles of Artificial Intelligence
3. PC 3 3 0 0 3 - F
4. AD18403 Applied Machine Learning PC 3 3 0 0 3 - F

5. AD18404 Object Oriented Software Engineering PC 3 3 0 0 3 - F

Environmental Science and
6. GE18251 BS 3 3 0 0 3 - F
Engineering

PRACTICAL
Intelligent Computer Networks
7. AD18411 PC 3 0 0 3 1.5 - F
Laboratory

AD18412 Artificial Intelligence Laboratory

8. PC 3 0 0 3 1.5 - F
AD18413 Applied Machine Learning Laboratory
9. PC 3 0 0 3 1.5 - F
TOTAL 29 18 1 9 23.5 - -
(Recommended by BoS - Meeting held on 10.04.2020)

IV
 SEMESTER V

S.NO. COURSE CONTACT

COURSE TITLE CATEGORY L T P C Prerequisites Fixed/
CODE PERIODS
Movable
THEORY
Deep Learning Algorithms
1. AD18501 PC 3 3 0 0 3 - F
and Architectures
Digital Signal Processing for Data -
2. AD18502 PC 4 3 1 0 4 F
Science

3. CS18502 Datamining and Data warehousing PC 4 3 1 0 4 - F

4. AD18503 Internet of Things towards Data Science PC 3 3 0 0 3 - F

5. **** Open Elective I OE 3 3 0 0 3 - M
PRACTICAL

6. AD18511 Deep Learning Laboratory PC 4 0 0 4 2 - F

Internet of Things towards Data
7. AD18512 PC 4 0 0 4 2 - F
Science Laboratory
Interview and Career Skills
8. HS18561 Laboratory (Common to all branches EEC 3 0 0 3 2 - F
except BT and EE)
TOTAL 27 15 2 11 23 - -

SEMESTER VI

COURSE CONTACT
S.NO. COURSE TITLE CATEGOR L T P C Prerequisites Fixed/
CODE PERIODS
Y Movable
THEORY
Cloud Computing Tools
1. AD18601 PC 3 3 0 0 3 F
and Techniques
2. AD18602 Big Data Analytics and Visualization PC 3 3 0 0 3 - F

3. AD18603 Natural Language Processing Techniques PC 3 3 0 0 3 - F

4. AD18604 Computer Vision and Applications PC 4 3 1 0 4 - F

5. **** Professional Elective – I PE 3 3 0 0 3 - M

6. **** Open Elective II OE 3 3 0 0 3 - M

PRACTICAL

7. AD18611 Computer Vision and NLP Laboratory PC 4 0 0 4 2 - F

8. AD18612 Cloud and Big Data Analytics PC 4 0 0 4 2 - F

Laboratory
TOTAL 27 18 1 8 23 - -

(Recommended by BoS - Meeting held on 10.04.2021)

V
 SEMESTER VII

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/
CODE PERIODS
Movable
THEORY

1. AD18701 Compiler Design Techniques PC 3 3 0 0 3 - F

2. CS18702 Cyber Security and Ethical Hacking PC 4 3 1 0 4 - F

3. AD18702 Reinforcement Learning PC 3 3 0 0 3 - F
4. **** Professional Elective – II PE 3 3 0 0 3 - M
5. **** Professional Elective – III PE 3 3 0 0 3 - M
PRACTICAL

6. AD18711 Mini Project EEC 6 0 0 6 3 - F

7. AD18712 Cyber Security Laboratory PC 4 0 0 4 2 - F

8. AD18713 Reinforcement Learning PC 4 0 0 4 2 - F

Laboratory
TOTAL 30 15 1 14 23 - -

SEMESTER VIII

S.NO. COURSE CONTACT

COURSE TITLE CATEGOR L T P C Prerequisites Fixed/
CODE PERIODS
Y Movable
THEORY

1. **** Professional Elective – IV PE 3 3 0 0 3 - M

2. **** Professional Elective – V PE 3 3 0 0 3 - M

PRACTICAL

3. AD18811 Project Work EEC 24 0 0 24 12 - F

TOTAL 30 6 0 24 18 - -

(Recommended by BoS - Meeting held on 10.04.2021)

VI
 List of Electives

Professional Elective II & III (Offered in ODD Semester)

SL. COURSE
COURSE TITLE
NO. CODE
1 AD18001 Advanced Database Concepts
2 AD18003 AI in Robotics
3 AD18005 Bitcoin and Blockchain Technology
4 AD18007 Healthcare Analytics
5 AD18009 Human Computer Interaction
6 AD18011 Kernel Methods for Pattern Analysis
7 CS18007 Information Retrieval Techniques
8 CS18017 Resource Management Techniques
9 CS18023 Software Planning and Project Management
10 IT18004 Software Testing and Quality Assurance

Professional Elective I, IV & V (Offered in EVEN Semester)

SL. COURSE
COURSE TITLE
NO. CODE
1 AD18002 Bio-Inspired Computing
2 CS18008 Business Intelligence
3 AD18004 Evolutionary Computing
4 AD18006 Explainable Artificial Intelligence
5 AD18008 Full stack Software Development
6 AD18010 Game Theory
7 AD18012 Knowledge Representation and Reasoning
8 AD18014 Quantum Computing
9 AD18016 Semantic Web
10 AD18018 Sentiment Analysis
11 AD18020 Soft Computing Techniques
12 AD18022 Speech Processing Techniques
13 AD18024 Video Analytics
14 AD18026 Virtual and Augmented Reality

(Recommended by BoS - Meeting held on 10.04.2021)

VII
 Professional Electives (Can be Chosen whenever offered)
COURSE
SL. No. COURSE TITLE
CODE
1. SE18001 Mathematics for AI & ML (Common to all branches except MR)

2. SE18002 Corporate Finance (Common to all branches except MR)

3. SE18003 Financial Statement Analysis (Common to all branches except MR)
4. SE18004 Managerial Economics (Common to all branches except MR)
5. SE18005 Market Research (Common to all branches except MR)
6. SE18006 Production Management (Common to all branches except MR)
7. SE18007 Project Management (Common to all branches except MR)
8. SE18008 Introduction to Securities Market(Common to all branches except MR)
9. SE18009 Supply Chain Management (Common to all branches except MR)

Value Added Courses

SL. COURSE CONTACT

COURSE TITLE L T P C
NO. CODE PERIODS
1. VD18503 Digital Forensics 2 2 0 0 2
2. VD18504 Finite Automata Theory 2 2 0 0 2
Communicative German
3. VC18001 2 2 0 0 2
(Common to All Branches, Except MR)
Communicative Japanese
4. VC18002 2 2 0 0 2
(Common to All Branches, Except MR)
Communicative Hindi
5. VC18003 2 2 0 0 2
(Common to All Branches, Except MR)
Design Thinking and Prototyping
Laboratory (Common to All Branches
6. VC18004 2 2 0 0 2
Except MR)
(Common to All branches, Except MR)
Basics of Entrepreneurship Development
7. VC18005 2 2 0 0 2
(Common to All Branches)

(Recommended by BoS - Meeting held on 10.04.2021)

VIII
 Mandatory Courses

COURSE
S.NO. COURSE TITLE CATEGORY
CODE
Indian Constitution and Society
1. MC18001 MC
(Common to All Branches except MR)

Internship Training

S.NO. COURSE TITLE DURATION CATEGORY

1. Internship 2 Weeks EEC

 This course must be done in an Industry approved by the Department during vacation from semester 3 to semester 6
for a period not less than 2 weeks.

(Recommended by BoS - Meeting held on 10.04.2021)

B. Tech - Artificial Intelligence and Data science

Subject Area Credits per Semester
1 2 3 4 5 6 7 8 Total %
Humanities and Social Sciences (HS), including Management 3 3 1.61
Basic Sciences (BS) including Mathematics, Physics, Chemistry, Biology 11 12 8 7 38 20.43
Professional Subjects-Core (PC), relevant to the chosen
specialization/branch; (May be split into Hard (no choice) and Soft (with 12 16.5 16.5 18 17 14 94 50.54
choice), if required)
Engineering Sciences (ES), including Materials, Workshop, Drawing,
Basics of, Electrical/Electronics/Mechanical/ Computer Engineering, 9 4 13 6.99
Instrumentation
Professional Subjects – Electives (PE), relevant to the chosen
3 6 6 15 8.06
specialization/ branch
Open Subjects -Electives (OE), from other technical and/or emerging
3 3 6 3.23
subject areas
Project Work, Seminar and/or Internship in Industry or Elsewhere (EEC) 2 3 12 17 9.14
Total Credits 23 28 24.5 23.5 23 23 23 18 186 100%

IX
HS18151 COMMUNICATIVE ENGLISH L T P C
(Common to all Branches except Marine Engineering ) 3 0 0 3
OBJECTIVES

 To enable learners to interact fluently on everyday social contexts.

 To enable learners engage in conversations in an academic/scholarly setting.
 To enable learners overcome public speaking barriers.
 To develop learners’ ability to take notes and in the process, improve their listening skills
 To develop learners’ reading skill through reading text passages for comprehension and
contemplation.
 To enable learners write on topics of general interest and drafting correspondences for general
purposes.

UNIT I 9
Listening – short video clips – conversational scenes form movies, celebrities’ speeches/interviews.
Speaking – several ways of introducing oneself at several situations, introducing others at several
situations, inviting people for several occasions, describing people and their places. Reading – short
comprehension passages – making inferences, critical analysis. Writing – completing the incomplete
sentences– developing hints from the given information. Grammar – Wh- Questions and Yes or No
questions –Parts of speech. Vocabulary development– prefixes- suffixes- articles – countable /
uncountable nouns.

UNIT II 9
Listening – customer care voice files, short narratives – identifying problems and developing
telephone etiquettes. Speaking – speaking over skype/whatsapp, making business calls, making self-
recorded informative videos, inquiring about a concept/activity, describing a concept/activity. Reading
– reading the headlines on news magazines – slogans and taglines from advertisements. Writing - free
writing – writing - headlines, slogans and taglines individual inspirations. Grammar – conjunctions,
idioms, phrases, quotes. Vocabulary development – guessing the meanings of words in various
different contexts.

UNIT III 9
Listening – courtroom scenes from movies, debates and talks from news channels, notes taking.
Speaking – language and tone for arguments, discussion, deliberation, contemplation, expressing
opinions, reacting to different situations in an alien country. Reading–language used in instruction
manuals of household appliances, cookery and other basic instructions. Writing- understanding the
structure of texts - use of reference words, discourse markers-coherence, rearranging the jumbled
sentences. Grammar – adjectives - degrees of comparison, framing direct and indirect questions.

1
Vocabulary development – concise approach, single word substitution.

UNIT IV 9
Listening – Sports commentaries, advertisements with users’ criticisms; Speaking –for social causes,
for promoting a concept, negotiating and bargaining; Reading – review of a product, movie,
movement or a system; Writing – writing for advertisements, selling a product; Grammar – Tenses –
Simple Past, Present and Future, Continuous - Past, Present and Future; Vocabulary Development –
synonyms, antonyms and phrasal verbs.

UNIT V 9
Listening – video lectures, video demonstration of a concept; Speaking – presenting papers/concepts,
delivering short speeches, discourses on health, suggesting natural home remedies, cleanliness, civic
sense and responsibilities; Reading – columns and articles on home science; Writing –
correspondences of requests, basic enquiry/observation and basic complaints; Grammar - modal
verbs, perfect tenses – Vocabulary development – collocations.

TOTAL (L): 45 Periods

OUTCOMES:
At the end of the course, learners will be able to:
• Read articles and infer meanings from specific contexts from magazines and newspapers.
• Participate effectively in informal/casual conversations; introduce themselves and their friends
and express opinions in English.
• Comprehend conversations and short talks delivered in English
• Write short write-ups and personal letters and emails in English.

REFERENCES:
1. Mindscapes : English for Technologists and Engineers. Orient Black swan, Chennai. 2017
2. Downes, Colm, Cambridge English for Job-hunting, Cambridge University Press, New Delhi.
2008
3. Murphy, Raymond, Intermediate English Grammar with Answers, Cambridge University Press
2000
4. Thomson, A.J. Practical English Grammar 1& 2 Oxford 1986.

WEBSITES

1. http://www.usingenglish.com
2. http://www.uefap.com3
3. https://owl.english.purdue.edu/owl/
4. www.learnenglishfeelgood.com/esl-printables-worksheets.html

2
SOFTWARE

1. Face 2 Face Advance – Cambridge University Press, 2014

2. English Advance Vocabulary- Cambridge University Press
3. IELTS test preparation – Cambridge University Press 2017
4. Official Guide to the TOEFL Test With CD-ROM, 4th Edition
5. CAMBRIDGE Preparation for the TOEFL TEST- Cambridge University Press, 2017

3
MA18151 ENGINEERING MATHEMATICS – I L T P C
(Common to all except Marine Engineering) 3 1 0 4
OBJECTIVES
 To understand and apply matrix techniques for engineering applications.
 To make the student knowledgeable in statistical methods of analyzing and interpret the
data for engineering problems.
 To familiarize the student with basic calculus including functions of several variables and
how to apply the transformation of variables.
 To acquaint the student with Mathematical tools needed in evaluating multiple integrals
and their usage

UNIT I MATRICES 9+3

Eigen values and Eigen vectors of a real matrix – Characteristic equation – Properties of Eigen
values and Eigen vectors – Statement and Applications of Cayley-Hamilton Theorem –
Diagonalization of matrices– Reduction of a quadratic form into canonical form by orthogonal
transformation-Nature of quadratic forms

UNIT II STATISTICAL METHODS 9+3

Scatter diagram- Karl Pearson coefficient of correlation for raw data- Spermann rank correlation
coefficient- lines of regression – Regression equation X on Y and Y on X- Curve fitting by
Principle of least squares – Fitting a straight line and a parabola

UNIT III APPLICATION OF DIFFERENTIAL CALCULUS 9+3

Curvature in Cartesian co-ordinates – Centre and radius of curvature – Circle of curvature –
Evolutes – Envelopes

UNIT IV DIFFERENTIAL CALCULUS OF SEVERAL VARIABLES 9+3

Limits and Continuity - Partial derivatives – Total derivatives – Differentiation of implicit
functions – Jacobians and properties– Taylor’s series for functions of two variables – Maxima and
Minima of functions of two variables – Lagrange’s method of undetermined multipliers

UNIT V MULTIPLE INTEGRALS 9+3

Double integrals in Cartesian and polar coordinates – Change of order of integration – Area
enclosed by plane curves - Change of variables in double integrals – Triple integrals – Volume of
solids.

TOTAL (L:45+T:15):60 Periods

4
OUTCOMES:
. At the end of the course, learners will be able to
 Develop the use of matrix algebra techniques which is needed for practical applications.
 Apply the skill to solve statistical problems under correlation and regression and acquire
the knowledge for fitting the straight line and parabola.
 Acquire the skills to evaluate the functions of several variables.
 Express proficiency in handling the concept of improper integrals of gamma, beta and
error functions.
 Acquaint the student with mathematical tools needed in evaluating multiple integrals and
their usage.

TEXT BOOKS:

1. Erwin Kreyszig, Advanced Engineering Mathematics,8thEdition, John Wiley, (1999)

2. Bali N. P and Manish Goyal, “A Text book of Engineering Mathematics”, Eighth Edition,
Laxmi Publications Pvt Ltd., (2011).
3. Grewal. B.S, “Higher Engineering Mathematics”, 41stEdition, Khanna Publications, Delhi,
(2011).

REFERENCES:

1. S C Gupta and V K Kapoor, Fundamentals of Mathematical Statistics, S. Chand Private

Ltd.,11th Edition (2005).
2. Glyn James, “Advanced Modern Engineering Mathematics”, 3rdEdition, Pearson
Education, (2012).
3. Peter V.O’Neil, “Advanced Engineering Mathematics”, 7th Edition, Cengage learning,
(2012).
4. Ramana B.V, “Higher Engineering Mathematics”, Tata McGraw Hill Publishing Company
New Delhi, (2008).
5. Sivarama Krishna Das P. and Rukmangadachari E., “Engineering Mathematics”, Volume
I, Second Edition, Pearson Publishing (2011).

5
PH18151 ENGINEERING PHYSICS L T P C
(Common to all Branches except Marine Engineering)
3 0 0 3
OBJECTIVE:

 To enhance the fundamental knowledge in Physics and its applications relevant to various
streams of Engineering and Technology.

UNIT – I CRYSTAL PHYSICS 12

Unit cell – Bravais Lattices – Miller indices – Distance between Inter planar distance ‘d’
(derivation) – discussion of various crystal structures : calculation of Atomic radius,
Coordination number, effective number of lattice points and Atomic Packing Factor for the
SC, BCC, FCC, HCP, Diamond Cubic (derivation) – discussion about the NaCl, Graphite
structures. Crystal defects : Zero dimensional, one dimensional, Two dimensional and Three
dimensional defects.
Diffraction of X-rays by crystal planes - Bragg’s spectrometer – Powder Diffraction
method

UNIT – II THERMAL PHYSICS 6

Modes of heat transfer: Newton’s law of cooling – thermal conductivity- Lee’s disc method
(derivation and expt) – Radial heat flow – Rubber tube method – conduction through
compound media (series and parallel).

UNIT– III WAVE MECHANICS 9

Quantum principles: Black body radiation-Planck Hypothesis (qualitative),Compton’s
effect (derivation).
Wave-particle duality - de-Broglie matter waves – Heisenberg’s uncertainty principle -
Wave function and its significance - Schrödinger’s wave equation ( time dependent and Time
independent) (derivation) – Application of Schrodinger’s wave equation - Particle in one
dimensional box (derivation ) – Degenerate and non-degenerate energy states.

UNIT– IV ACOUSTICS AND ULTRASONICS 9

Acoustics: Classification of Sound – Characteristics of Musical Sound : Quality (Timbre),
Pitch, Intensity of Sound – Units of Sound – decibel - Reverberation of sound –
Reverberation time – absorption of sound energy by materials – Absorption coefficient –
Sabine’s Formula (derivation) – Factors affecting the acoustics of buildings – Remedies.
Ultrasonics: Introduction to ultrasonics – Properties of ultrasonic waves – Production of
Ultrasonics: Magnetostriction method, Piezo electric method – detection of ultrasonics –
Ultrasonic Acoustic grating - Applications of ultrasonic waves – SONAR, NDT, Sonogram.

UNIT – V OPTOELECTRONICS AND FIBER OPTICS 9

Lasers: Basic properties of Lasers - Einstein’s coefficients (Derivation) – Population
6
inversion – Types of Lasers – Molecular Gas Lasers (CO2 Laser) – Solid state Laser (Nd:
YAG Laser) – Applications of Lasers in Engineering and Medicine.
Fibreoptics: Introduction - Principle and structure of optical fibers-Acceptance angle-
Numerical aperture-Types of optical fibers-Optical fiber communication system (block
diagram) - Advantages and its applications.
TOTAL (L):45 Periods
OUTCOMES:
Students will be able to
 Interpret the thermal properties of the materials
 Exhibit the ability to solve the problems pertaining to the behavior of sub-atomic
particles using quantum mechanics.
 Learn to solve the issues related to defects in the buildings due to acoustic design
 Develop an understanding about photonics and Fiber Optic communication system
 Classify and demonstrate the fundamentals of crystals and their defects.

TEXT BOOKS
1. Gaur R.K. and Gupta S.L, "Engineering Physics", Dhanput Publications, 2015.
2. Shatendra Sharma and Jyotsna Sharma, "Engineering Physics", Pearson, 2006.
3. Rajendran V, "Engineering Physics", Tata McGraw Hill, 2009.
4. Arumugam M, "Materials Science", Anuradha Publications, 2015.

REFERENCE BOOKS
1. David Halliday, Robert Resnick Jearl Walker, "Principles of Physics", 10th
Edition, Wiley, 2015.
2. Peter Atkins and Julio De Paula, "Physical Chemistry", 10th Edition.,
Oxford University Press, 2014.
3. Arthur Beiser, Shobhit Mahajan and Rai Choudhury S, "Concepts of
Modern Physics", 7th Edition, McGraw Hill Education, 2017.
4. Raghavan V, "Materials Science and Engineering", PHI Learning Pvt. Ltd., 2010.

7
 CY18151 ENGINEERING CHEMISTRY L T P C
(Common to all branches except Marine Engineering) 3 0 0 3
OBJECTIVES:
 To make the students conversant with boiler feed water requirements, related problems and
the water treatment techniques.
 To develop an understanding the principle, types and mechanism of corrosion and
protective coatings.
 To acquaint the students with the basics of nanomaterials, their properties and applicants.
 To develop an understanding of the laws of photochemistry and basic spectral analysis.
 To enable the students to understand the types of fuels, its calorific values and significance
of flue gas analysis.

UNIT I WATER TECHNOLOGY 9

Sources, hard and soft water, estimation of hardness by EDTA method, boiler feed water, boiler
problems, cause and preventive measures, softening of water - zeolite process and
demineralization by ion exchangers, internal treatment methods, specifications for drinking water,
BIS and WHO standards, treatment of water for domestic use, desalination - reverse osmosis and
electrodialysis.

UNIT II CORROSION AND ITS CONTROL 9

Corrosion: Basic concepts - mechanism of chemical, electrochemical corrosion - Pilling Bedworth
rule – Types of Electrochemical corrosion - galvanic corrosion - differential aeration corrosion -
pitting corrosion – stress corrosion – factors influencing corrosion. Corrosion control: Cathodic
protection – sacrificial anodic method - corrosion inhibitors. Protective coatings: surface
preparation for metallic coatings - electro plating (copper plating) and electroless plating (Nickel
plating) - chemical conversion coatings - anodizing, phosphating and chromate coating.

UNIT III NANOCHEMISTRY 9

Basics - distinction between molecules, nanoparticles and bulk materials; size-dependent
properties. Nanoparticles, nanocluster, nanorod, - nanotube(CNT) and nanowire. Synthesis:
precipitation, thermolysis, hydrothermal, solvothermal, electrodeposition, chemical vapour
deposition, laser ablation; Properties and applications of nanomaterials.

UNIT IV PHOTOCHEMISTRY AND SPECTROSCOPY 9

Laws of photochemistry –Grotthuss-Draper law, Stark–Einstein law and Lambert Beer Law.
Quantum efficiency – Photo processes - Internal Conversion, Inter-system crossing, Fluorescence,
Phosphorescence and Photo-sensitization. Spectroscopy: Electromagnetic spectrum - Absorption
of radiation – Electronic, Vibrational and rotational transitions. UV-visible and IR spectroscopy –
principles, instrumentation (Block diagram only) and applications.

8
UNIT V FUELS AND COMBUSTION 9
Fuel: Introduction- classification of fuels - calorific value- higher and lower calorific values-
analysis of coal (proximate and ultimate)- carbonization- manufacture of metallurgical coke (Otto
Hoffmann method) - petroleum- refining- manufacture of synthetic petrol (Bergius process)-
knocking - octane number - diesel oil- cetane number - natural gas- compressed natural gas(CNG)-
liquefied petroleum gases(LPG)- producer gas- water gas. Combustion of fuels: introduction-
theoretical calculation of calorific value- calculation of stoichiometry of fuel and air ratio - flue gas
analysis by ORSAT Method.

TOTAL (L): 45 Periods

OUTCOMES:
On the successful completion of the course, students will be able to
 Estimate the hardness of water, asses the boiler feed water requirement and related
problems also identification of suitable water treatment methods.
 Differentiate the mechanisms of different types of corrosion and suggest suitable corrosion
control techniques to mitigate the problem of corrosion including protective coatings.
 Compare the nano and bulk materials, their synthesis and its applications in various fields.
 Interpret the photochemical reactions and spectroscopic techniques.
 Asses the types and quality of fuels, its calorific values and significance of flue gas analysis

TEXT BOOKS:
1. Jain P.C. and Monica Jain, “Engineering Chemistry”, Dhanpat Rai Publishing Company
(P) Ltd., New Delhi, 2010.
2. Dara S.S, Umare S.S, “Engineering Chemistry”, S. Chand & Company Ltd., New Delhi
2010
3. Sivasankar B., “Engineering Chemistry”, Tata McGraw-Hill Publishing Company, Ltd.,
New Delhi, 2008.

REFERENCES:
1. Ozin G. A. and Arsenault A. C., “Nanochemistry: A Chemical Approach to
Nanomaterials”, RSC Publishing, 2005.
2. B.R. Puri, L.R. Sharma, M.S. Pathania., “Principles of Physical Chemistry” Vishal
Publishing Company, 2008.

9
EE18151 BASIC ELECTRICAL AND ELECTRONICS L T P C
ENGINEERING 3 0 0 3
(Common to all branches except ECE, EEE & CE)
OBJECTIVES
 To understand the basic theorems used in Electrical circuits and the principles of
measuring instruments.
 To educate the different concepts and function of electrical machines.
 To introduce the fundamentals of semiconductor and applications.
 To explain the principles of digital electronics.
 To impart knowledge of communication.

UNIT I ELECTRICAL CIRCUITS & MEASURMENTS 10

Ohm’s Law – Kirchhoff’s Laws – Steady State Solution of DC Circuits using Mesh Analysis
– Introduction to AC Circuits – Waveforms and RMS Value – Power and Power factor –
Single Phase and Three Phase AC Balanced Circuits. Construction and working Principle of
Moving Coil and Moving Iron Instruments (Ammeters and Voltmeters), Dynamometer type
Watt meters and Energy meters (Qualitative treatment only)

UNIT II ELECTRICAL MACHINES 10

Construction, Principle of Operation, Basic Equations and Applications of DC Generators,
DC Motors, Single phase induction Motor-,Single Phase Transformer

UNIT III SEMICONDUCTOR DEVICES AND APPLICATIONS 9

Characteristics of PN Junction Diode – Zener Effect – Zener Diode – LED, Photo diode and
its Characteristics – Half wave and Full wave Rectifiers – Voltage Regulation. Bipolar
Junction Transistor – CB, CE, CC Configurations and Characteristics – Photo transistors

UNIT IV DIGITAL ELECTRONICS 9

Binary Number System – Logic Gates – Boolean Algebra – Half and Full Adders – Flip-Flops
– Registers and Counters – A/D and D/A Conversion (single concepts)

UNIT V FUNDAMENTALS OF COMMUNICATION ENGINEERING 7

Types of Signals: Analog and Digital Signals – Modulation and Demodulation: Principles of
Amplitude and Frequency Modulations.
Communication Systems: Radio, TV, Fax, Microwave, Satellite and Optical Fiber (Block
Diagram Approach only).

TOTAL (L): 45 Periods

10
OUTCOMES:
 Study the fundamental laws governing electrical circuits and to describe the working of
measuring instruments.
 Understand the construction and characteristics of different electrical machines.
 Describe the fundamental behavior of different semiconductor devices and circuits.
 Learn the fundamental concepts of digital electronics circuits.
 Recognize the type of signals, data transfer and able to apply in communication
systems

TEXT BOOKS:
1. Mittle V.N, Arvind Mittal “Basic Electrical Engineering”, Tata McGraw Hill(India),
Second Edition,2013.
2. Sedha R.S., “A Text Book of Applied Electronics”, S. Chand & Co., 2014.

REFERENCES:
1. Muthusubramanian R, Salivahanan S and Muraleedharan K A, “Basic Electrical,
Electronics Engineering”, Tata McGraw Hill, 2013.
2. I.J.Nagrath and D.P. Kothari, “Basic Electrical Engineering”, Tata McGraw Hill
((India), Third Edition, 2010.
3. Mehta V K, “Principles of Electronics”, S.Chand & Company Ltd, 2010.
4. M.Morris Mano, “Digital Logic & Computer Engineering”,Printice Hall of India,
2004.
5. Mahmood Nahvi and Joseph A. Edminister, “Electric Circuits”, Schaum’ Outline
Series, McGraw Hill, Fourth Edition,2007.

11
 IT18101 PROGRAMMING FOR PROBLEM SOLVING L T P C
(Common to All Branches Except Marine) 3 0 0 3
OBJECTIVES
The students should be made to:
 Learn the organization of a digital computer.
 Learn to think logically and write algorithms or draw flow charts for problems.
 Be exposed to the syntax of C.
 Be familiar with programming in C.
 Learn to use arrays, strings, functions, pointers, structures and unions in C.

UNIT I INTRODUCTION TO PROBLEM SOLVING 9

Simple model of a Computer – Hardware – Software – Data Representation, Introduction to
Computer Networks and Internet, Problem Solving Techniques – Bottom up design and top
down design - applications, Introduction to Algorithms and Flow Chart.

UNIT II C PROGRAMMING BASICS 9

Introduction to ‘C’ programming – structure of a ‘C’ program – compilation and linking
processes. Conversion of simple algorithm to program. Constants, Variables – Data Types –
Expressions using operators in ‘C’ – Managing Input and Output operations – Decision
Making and Branching – Looping statements – solving simple scientific and statistical
problems.

UNIT III ARRAYS AND STRINGS 9

Arrays – Initialization – Declaration – One dimensional and Two dimensional arrays - String-
String operations –Arrays of strings.

UNIT IV FUNCTIONS AND USER DEFINED DATA TYPES 9

Function – definition of function – Declaration of function – Pass by value - Pass by
reference– Recursion - Enumerators - Structures - Unions.

UNIT V POINTERS AND FILES 9

Macros - storage classes - Pointers- Definition – Initialization – Pointers arithmetic – Double
Pointers, Basic file operations-Example problems.

TOTAL (L): 45 Periods

OUTCOMES:
At the end of the course, the student should be able to:

 Apply various problem solving techniques and represent solutions to problems in the
form of algorithms and flow charts.
 Examine given problems, design solutions and write C programs using the constructs
of C language.

12
  Apply the advanced constructs and string manipulation feature available in C
programming language to solve problems.
 Demonstrate the use functions, structures and unions to create modularized
applications in C language.
 Illustrate the dynamics of memory by the use of files and pointers.

TEXT BOOKS:
1. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming in C”,
First Edition, Oxford University Press, 2009.
2. Byron S Gottfried, “Programming with C”, Schaum’s Outlines, Third Edition, Tata
McGraw-Hill, 2010.

REFERENCES:
1. Kernighan, B.W and Ritchie, D.M, “The C Programming language”, Second Edition,
Pearson Education, 2015.
2. Yashavant P. Kanetkar. “Let Us C”, BPB Publications, 2011.
3. Paul J Deitel, Dr. Harvey M. Deitel,"C How to Program", Seventh Edition, Pearson
Education, 2016.

13
PC18161 PHYSICS AND CHEMISTRY LABORATORY L T PC
(Common to ALL branches) 0 0 2 1

PHYSICS LABORATORY

OBJECTIVES
To make the student to acquire practical skills in the determination of various physical
properties of materials.

List of Experiments (Any 5 experiments to be conducted)

1. Determination of compressibility of the liquid - Ultrasonic interferometer.
2. Determination of thickness of the given object by Air wedge method.
3. Determination of dispersive power of a prism by Spectrometer.
4. Determination of Young’s modulus of wooden scale by Non-Uniform bending.
5. Determination of wavelength, particle size and numerical aperture of fibre using
Lasers.
6. Lee’s Disc – Thermal conductivity of the poor conductor.
7. Torsional Pendulum – Determination of Rigidity modulus and moment of inertia.

OUTCOMES:
 The student will be able to analyze the physical principle using the various
instruments, also relate the principle to engineering applications.
 The various experiments in the areas of optics, mechanics and thermal physics will
nurture the students in all branches of Engineering.
 The students will be able to think innovatively and also improve the creative skills
that are essential for engineering.

LIST OF EQUIPMENTS FOR THE BATCH OF 30 STUDENTS :

Spectrometer, Mercury Vapour lamp, Lee’s disc exptl setup, Travelling microscope,
ultrasonic interferometer, Sodium vapour lamp, diode laser, optical fiber kit.

CHEMISTRY LABORATORY

OBJECTIVES
 To make the student to acquire practical skills in the determination of water quality
parameters through volumetric and instrumental analysis.
 To acquaint the students with the determination of molecular weight of a polymer by
viscometery.
List of Experiments (Any 5 experiments to be conducted)

1. Determination of total, temporary & permanent hardness of water by EDTA method.

2. Estimation of copper by EDTA.
3. Conductometric titration of a strong acid with a strong base

14
 4. Estimation of iron content of the given solution using potentiometer.
5. Estimation of iron content of the water sample using spectrophotometer.
6. Determination of molecular weight of polymer using viscometer.
7. Determination of Alkalinity in water.

OUTCOMES:
The students will be equipped with hands - on knowledge in the quantitative chemical
analysis of water quality related parameters.
TEXT BOOKS
1. Vogel‘s Textbook of Quantitative Chemical Analysis (8 TH edition, 2014)

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

1. Conductivity meter – 10 Nos
2. Spectrophotometer – 10 Nos
3. Ostwald Viscometer – 10 Nos
4. Potentiometer - 10 Nos
5. Electronic Balance - 2 Nos

Common Apparatus: Pipette, Burette, conical flask, iodine flask, porcelain tile, dropper
(each 30 Nos.)

TOTAL: 30 Periods

15
GE18161 ENGINEERING PRACTICES LABORATORY L T P C
0 0 3 1.5
OBJECTIVES :
 To provide exposure to the students with hands on experience on various basic
engineering practices in Civil, Mechanical, Electrical and Electronics Engineering.

LIST OF EXPERIMENTS
GROUP A (CIVIL & MECHANICAL)
I CIVIL ENGINEERING PRACTICE
Buildings:
(a) Study of plumbing and carpentry components of residential and industrial
buildings. Safety aspects.
Plumbing Works:
(a) Study of pipeline joints, its location and functions: valves, taps, couplings, unions,
reducers, elbows in household fittings.
(b) Study of pipe connections requirements for pumps and turbines.
(c) Preparation of plumbing line sketches for water supply and sewage works.
(d) Hands-on-exercise: Basic pipe connections – Mixed pipe material connection –
Pipe connections with different joining components.
(e) Demonstration of plumbing requirements of high-rise buildings.
Carpentry using Power Tools only:
a) Study of the joints in roofs, doors, windows and furniture.
b) Hands-on-exercise: Wood work, joints by sawing, planing and cutting.

II MECHANICAL ENGINEERING PRACTICE

Welding:
a) Preparation of arc welding of butt joints, lap joints and tee joints.
b) Gas welding practice
Basic Machining:
a) Simple Turning and Taper turning
b) Drilling Practice
Sheet Metal Work:
a) Forming & Bending:
b) Model making – Trays, funnels, etc.
c) Different type of joints.
Machine assembly practice:
a) Study of centrifugal pump
b) Study of air conditioner
Demonstration on:
a) Smithy operations, upsetting, swaging, setting down and bending.
Example – Exercise – Production of hexagonal headed bolt.
16
 b) Foundry operations like mould preparation for gear and step cone pulley.
c) Fitting – Exercises – Preparation of square fitting and vee – fitting models

GROUP B (ELECTRICAL & ELECTRONICS)

III ELECTRICAL ENGINEERING PRACTICE
1. Residential house wiring using switches, fuse, indicator, lamp and energy
meter.
2. Fluorescent lamp wiring.
3. Stair case wiring
4. Measurement of electrical quantities – voltage, current, power & power
factor in RLC circuit.
5. Measurement and comparison of energy for resistive and LED load using
single phase energy meter.
6. Measurement of resistance to earth of an electrical equipment.

IV ELECTRONICS ENGINEERING PRACTICE

1. Identification of circuit components
a) Resistor, capacitor, diode (PN & Zener),transistors
b) Soldering practice – Circuits – Using general purpose PCB.
2. Evaluating the parameters for DC power supply and AC power supply (peak-
peak, rms, average, period, frequency) using function generator and CRO.
3. Study and implementation of logic functions using NAND, NOR, and NOT
gates.
4. VI Characteristics of PN Junction diode.
5. VI Characteristics of Solar photovoltaic panel.
6. Design a 5V/12V Regulated Power Supply: using FWR rectifier and
IC7805/IC7812.

TOTAL : 45 Periods
COURSE OUTCOMES
● Fabricate carpentry components and to lay pipe connections including
plumbing works.
● Use welding equipments to join the structures.
● Wiring of basic electrical system and measurement of electrical parameters.
● Study and implementation of basic electronic components, circuits and solar
photovoltaic panel.
● Design a basic regulated power supply.

REFERENCES
1. Jeyachandran K., Natarajan S. & Balasubramanian S., "A Primer on
Engineering Practices Laboratory", Anuradha Publications, 2007.
2. Jeyapoovan T., Saravanapandian M. & Pranitha S., "Engineering Practices Lab
Manual", Vikas Puplishing House Pvt.Ltd, 2006.
3. Bawa H.S., "Workshop Practice", Tata McGraw Hill Publishing Company
Limited, 2007.
17
 4. Rajendra Prasad A. and Sarma P.M.M.S., "Workshop Practice", Sree Sai
Publication, 2002.
5. Kannaiah P. & Narayana K.L., "Manual on Workshop Practice", Scitech
Publications, 1999.
6. Mittle V.N, Arvind Mittal, "Basic Electrical Engineering", Tata McGraw
Hill(India), Second Edition,2013.
7. Sedha R.S., "A Text Book of Applied Electronics", S. Chand & Co., 2014.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

CIVIL
1. Assorted components for plumbing consisting of metallic pipes, plastic
pipes, flexible pipes, couplings, unions, elbows, plugs and other fittings. 15
Sets.
2. Carpentry vice (fitted to work bench) 15 Nos.
3. Standard woodworking tools 15 Sets.
4. Models of industrial trusses, door joints, furniture joints 5 each
5. Power Tools:
a. Rotary Hammer 2 Nos
b. Demolition Hammer 2 Nos
c. Circular Saw 2 Nos
d. Planer 2 Nos
e. Hand Drilling Machine 2 Nos
f. Jigsaw 2 Nos

MECHANICAL
1. Arc welding transformer with cables and holders 5 Nos.
2. Welding booth with exhaust facility 5 Nos.
3. Welding accessories like welding shield, chipping hammer, wire brush, etc.
5 Sets.
4. Oxygen and acetylene gas cylinders, blow pipe and other welding outfit. 2
Nos.
5. Centre lathe 2 Nos.
6. Hearth furnace, anvil and smithy tools 2 Sets.
7. Moulding table, foundry tools 2 Sets.
8. Power Tool: Angle Grinder 2 Nos
9. Study-purpose items: centrifugal pump, air-conditioner One each.

ELECTRICAL
1. Assorted electrical components for house wiring 15 Sets
2. Electrical measuring instruments 10 Sets
3. Study purpose items: Iron box, fan and regulator, emergency lamp 1 each
4. Megger (250V/500V) 1 No.

18
 5. Power Tools: (a) Range Finder 2 Nos (b) Digital Live-wire detector 2 Nos
6. LED lamp 8W 2 Nos., 16W 2 Nos.

ELECTRONICS
1. Soldering guns 10 Nos.
2. Assorted electronic components for making circuits 50 Nos.
3. Small PCBs 10 Nos.
4. Multimeters 10 Nos.
5. Study purpose ICs: IC7805/IC7812
6. Photovoltaic panel 5W/10W: 2 Nos.
7. Light Source for PV panel 1 Nos.

19
IT18111 PROGRAMMING FOR PROBLEM SOLVING L T P C
LABORATORY 0 0 3 1.5
(Common to All Branches Except Marine)
OBJECTIVES
The students should be made to:
 Be exposed to the syntax of C.
 Be familiar with programming in C.
 Learn to use arrays, strings, functions, pointers, structures and unions in C.

List of Exercises
1. Usage of Basic Linux commands
2. C Programming using Simple statements and expressions
3. Scientific problem solving using decision making and looping.
4. Simple programming for one dimensional and two dimensional arrays.
5. Solving problems using Strings
6. C Programming using Pointers
7. C Programming using user defined functions (Pass by value and Pass by reference)
8. C Programming using Recursion
9. C Programming using structures and union
10. C Programming using enumerated data types
11. C Programming using macros and storage classes
12. C Programming using Files

TOTAL: 45 Periods
OUTCOMES:
At the end of the course, the student should be able to:
 Apply various problem solving techniques and represent solutions to problems in the
form of algorithms and flow charts.
 Examine given problems, design solutions and write C programs using the constructs of
C language.
 Apply the advanced constructs and string manipulation feature available in C
programming language to solve problems.
 Demonstrate the use functions, structures and unions to create modularized applications
in C language.
 Illustrate the dynamics of memory by the use of files and pointers.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C compiler 30 Nos. or
Server with C compiler supporting 30 terminals or more

20
MA18251 ENGINEERING MATHEMATICS II L T P C
3 1 0 4
OBJECTIVES
 To acquaint the student with the concepts of vector calculus needed for problems in all
engineering disciplines.
 To make the student acquire sound knowledge of techniques in solving ordinary
differential equations that model engineering problems.
 To develop an understanding of the standard techniques of complex variable theory so
as to enable the student to apply them with confidence in application areas such as heat
conduction, elasticity, fluid dynamics and flow of electric current.
 To make the student appreciate the purpose of using transforms to create a new domain
in which it is easier to handle the problem that is being investigated

UNIT I VECTORCALCULUS 9+3

Gradient, divergence and curl – Directional derivative – Irrotational and solenoidal vector
fields – Vector integration – Green’s theorem in a plane, Gauss divergence theorem and
Stokes’ theorem (excluding proofs) – Simple applications involving cubes and rectangular
parallelopipeds.

UNIT II ORDINARYDIFFERENTIALEQUATIONS 9+3

Higher order linear differential equations with constant coefficients – Method of variation of
parameters – Cauchy’s and Legendre’s linear equations – Simultaneous first order linear
equations with constant oefficients.

UNIT III LAPLACE TRANSFORM 9+3

Laplace transform – Sufficient condition for existence – Transform of elementary functions –
Basic properties – Transforms of derivatives and integrals of functions - Derivatives and
integrals of transforms - Transforms of unit step function and impulse functions – Transform
of periodic functions. Inverse Laplace transforms -Statement of Convolution theorem – Initial
and final value theorems – Solution of linear ODE of second order with constant coefficients
using Laplace transformation techniques.

UNIT IV ANALYTIC FUNCTION 9+3

Functions of a complex variable – Analytic functions: Necessary conditions – Cauchy-
Riemann equations and sufficient conditions (excluding proofs) – Harmonic and orthogonal
properties of analytic function – Harmonic conjugate – Construction of analytic functions –
Conformal mapping-Translation, rotation and inversion (w = z+c, cz, 1/z, z2) - Bilinear
transformation.
UNIT V COMPLEX INTEGRATION 9+3
Complex integration –Statement and applications of Cauchy’s integral theorem and Cauchy’s
integral formula –Taylor’s and Laurent’s series expansions – Singular points– Residues –
Cauchy’s residue theorem – Evaluation of real definite integrals as contour integrals around
unit circle and semi-circle (excluding poles on the real axis).
TOTAL(L:45+T:15):60 Periods
21
OUTCOMES:
At the end of the course, learners will be able to:

 Interpret the fundamentals of vector calculus and be fluent in the use of Stokes theorem
and Gauss divergence theorem.
 Express proficiency in handling higher order differential equations.
 Determine the methods to solve differential equations using Laplace transforms and
Inverse Laplace transforms.
 Explain Analytic functions and Categorize transformations.
 Solve complex integrals using Cauchy integral theorem and Cauchy's residue theorem.

TEXT BOOKS:
1. Erwin Kreyszig, Advanced engineering mathematics, 8th Edition, John Wiley, 1999.
2. Bali N. P and Manish Goyal, “A Text book of Engineering Mathematics”, Eighth
edition, Laxmi Publications Pvt Ltd., (2011).
3. Grewal. B.S, “Higher Engineering Mathematics”, 41stEdition, Khanna Publications,
Delhi, (2011).

REFERENCES:
1. Dass, H.K., and Er.Rajnish Verma, “Higher Engineering Mathematics”, S.Chand
Private Ltd.,(2011).
2. Glyn James, “Advanced Modern Engineering Mathematics”, 3rd Edition, Pearson
Education, (2012).
3. Peter V.O’Neil, “Advanced Engineering Mathematics”, 7th Edition, Cengage learning,
(2012).
4. Ramana B.V, “Higher Engineering Mathematics”, Tata McGraw Hill Publishing
Company New Delhi, (2008).
5. Sivarama Krishna Das P. and Rukmangadachari E., “Engineering Mathematics”,
Volume I, Second Edition, PEARSON Publishing, 2011.

22
MA18253 ALGEBRA FOR DATA SCIENCE L T P C
3 1 0 4
OBJECTIVES
The Student should be made to:
 Extend student‘s logical and mathematical maturity and ability to deal with abstraction
 Familiarize the applications of algebraic structures.
 Introduce and apply the concepts of Rings, Fields and Polynomials.
 Understand the concepts and significance of lattices and boolean algebra which are
widely used in data science.

UNIT I PROPOSITIONAL LOGIC 9+3

Propositional Logic – Propositional equivalences – Normal forms – Principal Conjunctive
Normal Forms – Principal Disjunctive Normal Forms – Inference Theory.

UNIT II PREDICATE LOGIC AND PROOF 9+3

Predicates and Quantifiers – Nested Quantifiers – Introduction to proofs – Proof methods and
strategy

UNIT III ALGEBRAIC STRUCTURES 9+3

Rings: Definition - Sub rings - Integral domain - Field - Integer modulo n - Ring
homomorphism. Rings - Polynomial rings - Irreducible polynomials over finite fields

UNIT IV RINGS AND FIELDS 9+3

Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic
systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean
algebra.

UNIT V LATTICES AND BOOLEAN ALGEBRA 9+3

Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic
systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean
algebra

TOTAL (L:45+T:15): 60 Periods

OUTCOMES:
Upon completion of the course, students will be able to,
 Have knowledge of the concepts needed to test the logic of a program.
 Be exposed to concepts and properties of algebraic structures.
 Have an understanding in identifying structures on many levels.
 Apply the basic notions of groups, rings, fields which will be used to solve related
problems.
23
  Explain the fundamental concepts of advanced algebra and their role in applied
context.

TEXT BOOKS:
1. Grimaldi, R.P and Ramana, B.V., "Discrete and Combinatorial Mathematics", Pearson
Education, 5th Edition, New Delhi, 2007.
2. Rosen, K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw
Hill Publications.Co. Ltd., New Delhi, Special Indian Edition, 2011.

REFERENCES:
1. Lidl, R. and Pitz, G, "Applied Abstract Algebra", Springer Verlag, New Delhi, 2nd
Edition, 2006.

24
GE18151 ENGINEERING DRAWING L T P C
(Common to ALL Branches of B.E. / B.Tech)
3 0 2 4
OBJECTIVES
 This course will introduce students to Engineering Drawing and build their ability to
read drawings and interpret the position and form of simple geometry, culminating
into understanding of simple technical assemblies.

UNIT 0 ENGINEERING DRAWING FUNDAMENTALS (Not for Exams) 2

Drawing standard: BIS, Lettering, Dimensioning, Type of lines, Conventions, Geometrical
constructions: Dividing a straight line into equal parts, Bisecting a given angle, Construction
of polygon – Triangle, Square, Pentagon and Hexagon using drawing tools.

UNIT I CURVES AND PROJECTION OF POINTS AND LINES 18

Construction of Engineering Curves: Conic Sections – Ellipse,Parabola, Hyperbola using
Eccentricity method, Cycloid, Involute of Circle and Pentagon.
Projection: Orthographic Projection – Principal Planes, Projection of Points using Four
Angles of Projection, Projection of Straight Lines – Lines parallel or inclined to one or both
planes using Rotating Line Method in First Angle of Projection.

UNIT II PROJECTION OF PLANES AND SOLIDS 15

Projection of Plane Figures – Inclined to any one Principal Plane, Projection of Solids –
Simple Solids (Prisms, Pyramids, Cone and Cylinder) axis inclined to any one Principal Plane.

UNIT III SECTION OF SOLIDS & DEVELOPMENT OF SURFACES 15

Section of Solids –Sectional views of simple vertical solids cut by section plane inclined to
any one Principal Plane. Development of Surfaces – Development of lateral surfaces of
truncated and frustum of simple solids.

UNIT IV PICTORIAL PROJECTION 15

Introduction to Pictorial Projection, Isometric Projection – Principle, Isometric Planes,
Isometric Scales, Isometric Projection of simple solids and their combination.
Free Hand Drawing - Orthographic views of simple blocks from their Isometric view,
Isometric view of simple blocks from their Orthographic views.

UNIT V PERSPECTIVE PROJECTION 10

Perspective Projection of full solids in simple positions with respect to projection planes by
visual ray and vanishing point method.

TOTAL (L+T): 75 Periods

25
OUTCOMES:
Upon successful completion of this course, the student shall be able to:
 Understand the importance of BIS Standards in Engineering Drafting
 Graphically construct and understand the importance of Conic sections and special
curves in Engineering applications
 Given a problem statement in geometric elements such as points, lines, planes, solids,
Orthographic projections will be drafted.
 Draw the orthographic projections of sectioned solids and also will Develop their
surfaces
 Interpret Orthographic, Isometric and Perspective views of objects

TEXT BOOKS:
1. N.D. Bhatt, V.M. Panchal Pramod, R. Ingle, “Engineering Drawing”, Charotar
Publishing House, 2014.

REFERENCES:
1. K.Venugopal&V.PrabhuRaja, “Engineering Graphics”, New Age International (P)
Limited, 2009.
2. M.B.Shah & B.C. Rana, “Engineering Drawing”, Pearson Education, 2009.
3. K.R. Gopalakrishna, “Engineering Drawing” (Vol..I&II), Subhas Publications, 2010.
4. K.V.Natrajan, “A text book of Engineering Graphics”, Dhanalakshmi Publishers,
Chennai, 2006.
5. S. Gowri and T. Jeyapoovan, “Engineering Graphics”, Vikas Publishing House Pvt
Ltd., 2011.

26
AD18201 DIGITAL LOGIC DESIGN L T P C
3 1 0 4
OBJECTIVES
 To understand various number systems, different methods used for the simplification of
Boolean functions
 To design and implement a system that uses combinational logic for the given
specification; Simulate combinational logic systems using verilog or VHDL
 To design and implement synchronous sequential system for the given specification;
simulate sequential logic systems using verilog or VHDL.
 To design and implement Asynchronous sequential system for the given specification.
 To design and implement memory accessing systems and systems using PLA, PAL.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9

Digital Systems and Binary Numbers-Review of Number Systems – Arithmetic Operations –
Binary Codes – Boolean Algebraic Axioms – Boolean Functions, Truth Table, Canonical Forms
- Gate Level Minimization – Simplification of Boolean Functions using Karnaugh Map and
Tabulation Methods-NAND & NOR Implementation

UNIT II COMBINATIONAL CIRCUITS 9

Combinational Circuits – Analysis and Design Procedures –Binary Adder-Subtractor – Decimal
Adder- Binary Multiplier – Magnitude Comparator- Decoders – Encoders – Multiplexers – HDL
Models for Combinational Circuits

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9

Latches and Flip Flops – Analysis and Design Procedures –State Reduction and Assignment –
Registers –Mealy/Moore Finite State Machines- Shift Registers – Counters –State Diagram,
State Table, State Assignment & Minimization

UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9

Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables
– Race-free State Assignment – Hazards

UNIT V MEMORY AND PROGRAMMABLE LOGIC 9

RAM - Memory Decoding - Error Detection and Correction –ROM - Programmable Logic
Array – Programmable Array Logic –Sequential Programmable Devices – RTL

TOTAL (L:45 +T:15): 60 Periods

27
OUTCOMES:
 Perform arithmetic operations in any number system & to simplify the Boolean
expression using K –Map and Tabulation techniques
 Use Boolean Simplification techniques to design a combinational hardware circuit &
Design and analysis of a given digital Combinational circuit
 Design and analysis of a given digital Sequential hardware circuit
 Design and analysis of a given digital asynchronous sequential circuits
 Design using PLD

TEXT BOOKS:
1. “Digital Design with An Introduction to Verilog HDL” by M.Morris Mano and Michael
D.Ciletti, 5th Edition.

REFERENCES:
1. John F. Wakerly, “Digital Design Principles and Practices”, Fourth Edition, Pearson
Education,2007.
2. Charles H. Roth Jr, “Fundamentals of Logic Design”, Fifth Edition – Jaico Publishing
House, Mumbai, 2003.
3. Donald D. Givone, “Digital Principles and Design”, Tata Mcgraw Hill, 2003.
4. Kharate G. K., “Digital Electronics”, Oxford University Press, 2010.
5. https://www.cs.tcd.ie/John.Waldron/CS1026/lec9adder.pdf
6. http://digitalbyte.weebly.com/code-converters.html
7. http://www.learnabout-electronics.org/Digital/dig44.php
8. http://ece.gmu.edu/~clorie/Spring11/ECE-301/Lectures/Lecture_16.pdf
9. Morris Mano, “Computer System Architecture”, Third Edition, Pearson Education
10. https://www.iitg.ernet.in/asahu/cs221/Lects/Lec11.pdf

28
AD18202 DATA STRUCTURES AND ALGORITHM L T P C
ANALYSIS 3 1 0 4

OBJECTIVES
Upon completion of this course, students will be able to:
 Familiar with the algorithm analysis techniques and orders of growth.
 Familiar with the linear data structures and its applications.
 Familiar with the tree data structures, hashing techniques and priority queues.
 Understand graph algorithms and its applications.
 Understand he various classes of algorithm design techniques.

UNIT I FOUNDATION OF ALGORITHM ANALYSIS 9+3

The Role of Algorithms in Computing - Growth of Functions - Asymptotic Notations –
Analysis of Non recursive Algorithms - Divide and Conquer – Analysis of recursive
algorithms – The backward substitution for solving recurrences - The master method for
solving recurrences - Sorting: Selection sort - Bubble sort – Insertion Sort - Merge Sort -
Quick sort – Searching: Linear Search – Binary Search.

UNIT II LINEAR DATA STRUCTURES 9+3

List: Array Implementation of List – Linked List – Doubly Linked List – Circular Linked List;
Stack: Array and Linked List Implementation – Applications; Queues: Array and Linked List
Implementation – Applications.

UNIT III TREES, HASHING AND PRIORITY QUEUES 9+3

Trees: Binary trees – Binary Search Trees – AVL Trees – Splay Trees – B-Trees; Hashing:
Hash Function – Separate Chaining – Open Addressing – Linear Probing; Priority Queues –
Binary Heap Operations.

UNIT IV GRAPH ALGORITHMS 9+3

Representation of Graphs – Breadth First Search – Depth First Search - Topological Sort –
Shortest Path Algorithms: Dijkstra’s Algorithm - Floyd Warshall's algorithm – Minimum
Spanning Tree: Prim’s Algorithm – Kruskal’s Algorithm.

UNIT V ADVANCED ALGORITHM DESIGN TECHNIQUES 9+3

Dynamic Programming: Longest Common Subsequence - Optimal Binary Search Trees;
Greedy Algorithm: Huffman Codes; Backtracking: n-Queens Problem - Subset-sum Problem;
Branch and Bound: Assignment Problem – Knapsack Problem.

TOTAL (L:45 + T:15): 60 Periods

29
OUTCOMES:
At the end of the course, learners will be able to
 Analyze the time complexity of algorithms using asymptotic notations.
 Apply linear data structures to various applications.
 Develop different tree data structures and apply hashing techniques.
 Apply graph algorithms to real time applications.
 Develop solutions to various classes of algorithms.

TEXT BOOKS:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education, 2013.

REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition,
Pearson Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and
Algorithms”, Pearson Education, Reprint 2006.
3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3, Pearson
Education, 2009.
4. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
5. http://nptel.ac.in/

30
AD18203 OBJECT ORIENTED PARADIGM AND L T P C
PROGRAMMING
3 1 0 4
OBJECTIVES
 Familiar with the basic concepts of object oriented programming.
 Familiar with the basic concepts of C++ programming language.
 Familiar with the generic programming, exception and file handling in C++.
 Understand object oriented concepts and basic characteristics of Java.
 Understand the advanced programming concepts in Java.

UNIT I OBJECT ORIENTED PARADIGM 9+3

Object oriented programming concepts – objects – classes – data members and member functions
- abstraction and encapsulation – inheritance – polymorphism. Introduction to C++ – classes –
access specifier – function and data members – default arguments –friend functions – const and
volatile functions - static members – Objects – pointers and objects – constant objects – nested
classes- constructors –default constructor –parameterized constructors –constructor with dynamic
allocation –copy constructor –destructors.

UNIT II POLYMORPHISM AND INHERITANCE 9+3

Compile time polymorphism- function overloading –operator overloading –overloading through
friend functions – type conversion - Runtime Polymorphism – virtual function – pure virtual
functions – abstract class- RTTI- Inheritance – private, public protected derivations – multiple
Inheritance – multilevel Inheritance – Hierarchical Inheritance – Hybrid Inheritance - virtual base
class.

UNIT III TEMPLATES, EXCEPTION HANDLING AND FILES 9+3

Templates – Function templates – class templates - Exception handling – try-catch-throw
paradigm– exception specification – terminate and Unexpected functions – Uncaught exception -
Streams and formatted I/O – I/O manipulators - file handling – random access – object
serialization – namespaces - Standard template library.

UNIT IV JAVA OOPS CONCEPTS 9+3

Data types – Variables – Arrays – Operators - Control statements - Classes, objects, and methods
- Method overloading and overriding – Inheritance - Interfaces and packages.

UNIT V ADVANCED JAVA PROGRAMMING 9+3

Exception handling - Multithreaded programming - The I/O classes – Generics - String handling.

TOTAL (L+ T): 60 Periods

31
OUTCOMES:
At the end of the course, learners will be able to:
 Apply the concepts of object oriented programming for practical problem solutions.
 Apply generic data type for the data type independent programming which relates to
reusability.
 Design the exception handling techniques for resolving run-time errors and handle large
data set using file I/O
 Develop Java programs using object oriented concepts.
 Design and develop real world problems in Java.

TEXT BOOKS:
1. B. Trivedi, ―Programming with ANSI C++, Second Edition, Oxford University, Press,
2012.
2. Herbert Schildt, Java: The Complete Reference, Eleventh Edition, 11th Edition, McGraw-
Hill, 2018.

REFERENCES:
1. Deitel and Deitel, “C++ How to Program”, Tenth Edition, Pearson Education, 2017
2. Paul Deitel, Harvey Deitel, ―Java SE 8 for programmers, 3rd Edition, Pearson, 2015.
3. Herbert Schildt, ―C++: The Complete Reference, Fourth Edition, McGraw Hill, 2013.
4. Bjarne Stroustrup, "The C++ programming language", Fourth Edition, Addison
Wesley, 2013.
5. Ira Pohl, ― Object oriented programming using C++, Second Edition, Pearson
Education Asia, 2012.

32
AD18211 DATA STRUCTURES AND ALGORITHM L T P C
ANALYSIS LABORATORY 0 0 4 2

OBJECTIVES
Upon completion of this course, students will be able to:
 Familiar with the applications of different linear data structures.
 Understand the tree data structures and its representation.
 Familiar with the implementation of graph algorithms and its applications.
LIST OF EXPERIMENTS
1. Sorting
 Selection Sort
 Bubble Sort
 Insertion Sort
 Quick Sort
 Merge Sort
2. Searching
 Linear Search
 Binary Search
3. Array Implementation of List
4. Linked List Implementation of List
5. Array Implementation of Stack
6. Linked List of Stack
7. Applications of Stack
 Infix to Postfix Expression
 Evaluation of Postfix Expression
8. Array Implementation of Queue
9. Linked List of Queue
10. Binary Search Tree with Tree traversal Techniques – Preorder, Post order and In order.
11. AVL tree
12. Binary Heap
13. Graph Traversal Algorithm
 Breadth-first search
 Depth-first search
14. Shortest Path Algorithm
 Dijkstra’s algorithm
 Floyd – Warshall’s algorithm
15. Minimum Spanning Tree
 Kruskal's algorithm
 Prim's algorithm
33
 TOTAL: 60 Periods
OUTCOMES:
At the end of the course, learners will be able to:
 Apply linear data structures to real word problems.
 Develop recursive algorithms for tree data structures and implement its different traversals.
 Apply graph algorithms to various real time applications.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C / C++ and Java compiler 30 Nos. (or)
Server with C/C++ and Java compiler supporting 30 terminals or more

34
AD18212 OBJECT ORIENTED PARADIGM AND L T P C
PROGRAMMING LABORATORY 0 0 4 2

OBJECTIVES
This course will develop the student's ability to
● Be familiarized with good programming design methods
● Getting exposure in implementing various OOPS Concepts
● Appreciate recursive algorithms.
LIST OF EXPERIMENTS

Implement the following topics:

C++
1. Programs Using Functions
- Functions with default arguments
- Implementation of call by value, call by address and call by reference
2. Classes with data members, member functions and constructors
- Static data member and static member function
- Const data member and const member function
3. Compile time polymorphism
- Function Overloading
- Unary and Binary Operator Overloading
- Unary and Binary Operator Overloading using friend functions
4. Inheritance
- Single Inheritance
- Multiple Inheritance
- Multilevel Inheritance
- Hierarchical Inheritance
- Hybrid Inheritance
5. Runtime Polymorphism
- Virtual functions
- Pure virtual functions
6. Templates
- Function Templates
- Class Templates
7. Exception Handling
8. File Handling
- Sequential access
- Random access
9. Formatted and Unformatted I/O Manipulators
10. Standard Template Library

Java
11. Simple Java application
12. Package creation
Handling in built packages
Creating user defined packages
35
13. Interfaces
14. Threading and Synchronization
15. Exception handling
- Handling pre-defined exceptions
- Handling user-defined exceptions
TOTAL: 60 Periods
OUTCOMES:
Upon Completion of the course, the students will be able to
● Design and implement C++ programs for implementing OOPS concepts.
● Apply good programming design methods for program development.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C++ compiler 30 Nos. or
Server with C++ compiler supporting 30 terminals or more

36
 MA18353 PROBABILITY & STATISTICS FOR DATA L T P C
SCIENCE 3 1 0 4
OBJECTIVES
The student should be made to:
 Understand the basic concepts of the probability and to apply the same for
Engineering Problems
 Understand the fundamentals of one and two dimensional random variables and to
introduce some standard distributions applicable to data science.
 Provide the required mathematical support in real life problems and develop
probabilistic models which can be used in several areas of science and engineering.
 Identify of appropriate test in Statistics based on the given Data and also to apply
and validate
 Understand the concept of Random Process and Applications to Engineering
Problems

UNIT I DESCRIPTIVE STATISTICS AND PROBABILITY 9+3

Introduction – Measures of central tendency-Mean, Median, Mode – Measures of
Dispersion – Range, Interquartile range, Standard deviation – Probability – Axioms of
probability – Conditional probability – Bayes’ theorem.

UNIT II RANDOM VARIABLES 9+3

Discrete and continuous random variables – Moments – Moment generating functions –
Binomial, Poisson and Normal distributions. Joint distributions – Marginal and conditional
distributions – Covariance – Correlation and linear regression – Central limit theorem (for
independent and identically distributed random variables).

UNIT III TESTING OF HYPOTHESIS – LARGE SAMPLES 9+3

Sampling distributions – Population and Samples – Estimation of parameters – Statistical
hypothesis – Confidence Interval – Large sample test for single mean, single proportion,
difference of means and difference of proportions.

UNIT IV TESTING OF HYPOTHESIS – SMALL SAMPLES 9+3

Tests based on t, F and chi-square distributions for mean, variance and proportion – Tests
for independence – Goodness of fit.

37
UNIT V INTRODUCTION TO RANDOM PROCESS 9+3
Introduction – Classification – Stationary Processes – Auto correlation functions – Cross
correlation functions – Properties –Power spectral density – Cross spectral density.

TOTAL (L+T): 60 Periods

OUTCOMES:
Upon completion of the course,
 The students will have a fundamental knowledge of the concepts of probability.
 The students will have knowledge of standard distributions which is more relevant
to Data Science and its Applications
 The students will have a notion of sampling distributions and statistical techniques
used in Data science.
 To analyse and interpret the data based on the sample tests
 The students will acquire knowledge on Random processes and its applications

TEXT BOOKS:
1. Ibe. O.C., "Fundamentals of Applied Probability and Random Processes", Elsevier,
1st Indian Reprint, 2007.
2. Richard A J, Irwin Miller, John Freund, Miller and Freund’s - Probability and
Statistics for Engineers, Pearson Education, Asia, Eight Edition, 2007.

REFERENCES:
1. Johnson. R.A. and Gupta. C.B., "Miller and Freund’s Probability and Statistics for
Engineers", Pearson Education, Asia, 7th Edition, 2007.
2. Walpole R E, Myres, R H, Myres SL and Ye K, Probability and Statistics for
Engineers and Scientists, Pearson Education, Asia, Eigth Edition, 2007.
3. Spiegel M R, Schiller J and Srinivasan R A, Schaum Outline of Theory and
Problems of Probability and Statistics, Tata McGraw Hill Edition, 2004.

38
 MA18354 MATHEMATICS FOR DATA ANALYSIS L T P C
3 1 0 4
OBJECTIVES
The student should be made to:
 Apply the concepts of basic principles of Combinatorics and its Applications.
 Understand the basic concepts in Number Theory and its Applications in Data
Science.
 Understand the fundamental concepts of graph theory.
 Understand the advanced concepts of graph theory and its applications to
computer science.
 Provide the required support to develop regression models which can be used in
data analytics.

UNIT I COMBINATORICS 9+3

Sets - Operations - Inclusion and exclusion principle and its applications – Mathematical
induction – Strong induction and well ordering – The basics of counting – The pigeonhole
principle – Permutations and combinations – Recurrence relations – Solving linear
recurrence relations – Generating functions.

UNIT II DIVISIBILITY THEORY AND CANONICAL 9+3

DECOMPOSITIONS
Division algorithm – Base - b representations – Number patterns – Prime and composite
numbers – GCD – Euclidean algorithm – Fundamental theorem of arithmetic – LCM.

UNIT III REGRESSION ANALYSIS 9+3

Introduction – The Simple Linear Regression Model – Estimating Model Parameters.

Inferences about the Slope Parameter and the Prediction of Future Y Values. Introduction
to Non-Linear and Multiple Regression Models.

UNIT IV FUNDAMENTALS OF GRAPH THEORY 9+3

Graphs and Interconnection Networks – Types of Graphs – Trees and Decision Trees –
Planar Graphs – Kuratowski's Theorem – Degree Sequence – Matrix Representation of
Graphs and Graph Isomorphism, Spectrum of Graphs – Graph Measurements: Length,
Distance, Diameter, Eccentricity, Bisection width and Betweenness Centrality. Euler and
Hamilton Concepts.

UNIT V APPLICATIONS OF GRAPH THEORY 9+3

Connectivity and Paths: Cuts and Connectivity, Menger’s Theorem, k-Network Flow –
Ford-Fulkerson Algorithm, Max-Flow Min-cut Theorem – Labeling: Graceful and Cordial
39
– Domination: Independent and Connected, Matching: Matching and Perfect Matching
applications to optimal assignment problem- Colouring and Vizing’s Theorem –
Timetabling Problem.
TOTAL: (L+ T): 60 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to
 Apply the Counting Principles to compute the running time algorithm.
 Apply integrated approach to number theory and algebra and provide a firm basis
for further reading and study in the subject.
 Use graph models and their connectivity, to study the interconnection network
architecture in related to Computer Science
 Use graph theoretical problem to solve real world problem in the area of
optimization and data analytics.
 Understand and characterize phenomenon which evolve with respect to time in a
probabilistic manner.
 Have basis to develop regression models

TEXT BOOKS:
1. Koshy, T., “Elementary Number Theory with Applications”, Elsevier Publications,
New Delhi, 2002.
2. J. A. Bondy and U. S. R. Murty, Graph Theory and Applications, The Macmillan
Press Ltd. New York 1982.
3. Johnson. R.A. and Gupta. C.B., "Miller and Freund’s Probability and Statistics for
Engineers", Pearson Education, Asia, 7th Edition, 2007.

REFERENCES:
1. Devore. J.L., "Probability and Statistics for Engineering and the Sciences”,
Cengage Learning, New Delhi, 8th Edition, 2012.
2. Niven, I., Zuckerman. H.S., and Montgomery, H.L., ―An Introduction to Theory
of Numbers, John Wiley and Sons, Singapore, 2004.
3. Kenneth H. Rosen and K. Krithivasan, Discrete. Mathematics and Its Applications
with Combinatorics and Graph Theory. McGraw-Hill Companies Seventh Edition
2012.

40
 CS18402 OPERATING SYSTEMS L T P C
3 0 0 3
OBJECTIVES
● Understand the basic concepts and functions of operating systems.
● Understand Processes and Threads.
● Analyze Scheduling algorithms.
● Understand the concept of Deadlocks.
● Analyze various memory management schemes.
● Understand I/O management and File systems.

UNIT I OPERATING SYSTEMS OVERVIEW 9

Computer System Organization – Computer System Architecture – Evolution of Operating
System – Operating System Structures – Services and Operations – System Calls – System
Programs – Operating System Generation and System Boot – Computing Environments.

UNIT II PROCESS MANAGEMENT AND SCHEDULING 9

Process Concept – Process Scheduling – Operations on Processes – Interprocess

Communication – Shared Memory – Message Passing – PIPES. Threads – Overview –
Multicore Programming – Multithreading Models – Thread Libraries – Threading Issues –
Windows 7 – Thread and SMP Management. CPU Scheduling – Scheduling criteria –
Scheduling algorithms – Multiple-processor scheduling – Real time scheduling –
Algorithm Evaluation. Case study: Process scheduling in Linux.

UNIT III PROCESS SYNCHRONIZATION AND DEADLOCK 9

Process Synchronization – The critical-section problem – Synchronization hardware –

Semaphores – Classic problems of synchronization – critical regions – Monitors. Deadlock
– System model – Deadlock characterization – Methods for handling deadlocks – Deadlock
prevention – Deadlock avoidance – Deadlock detection – Recovery from deadlock.

UNIT IV MEMORY MANAGEMENT 9

Main Memory – Memory Partitioning – Memory Allocation Algorithms – Segmentation –

Paging – 32 and 64 bit architecture – Virtual Memory – Data structures – Management
Policies – Demand Paging – Replacement Algorithms – Allocation – Thrashing –
Allocating Kernel Memory - Case Study : Windows, Solaris OS.

UNIT V FILE SYSTEM AND SECONDARY STORAGE STRUCTURE 9

File System Storage – File Concepts – Access Methods – File Sharing and Protection –
File System Structure – File System Implementation – Directory Structure – Allocation
41
Methods – Free Space Management – Mass Storage Structure – Overview – Disk
Scheduling and Management – Swap Space Management – RAID Structure – Kernel I/O
Systems. Case Study : Mobile OS – iOS and Android.
TOTAL (L): 45 Periods
OUTCOMES:
At the end of the course, learners will be able to
● Apply the functionality of Operating Systems.
● Design various Scheduling algorithms.
● Apply the principles of concurrency and to design deadlock, prevention and
avoidance algorithms.
● Compare and contrast various memory management schemes
● Design and Implement a prototype file system.

TEXT BOOKS:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 10th Edition, John Wiley and Sons Inc., 2018.

REFERENCES:
1. William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition,
Prentice Hall, 2011.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison
Wesley, 2001.
3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw
Hill Education”, 1996.
4. Neil Smyth, ―iPhone iOS 4 Development Essentials – Xcode, Fourth Edition,
Payload media, 2011.

42
 AD18301 FOUNDATION TO COMPUTER SYSTEMS L T P C
DESIGN 3 0 0 3
OBJECTIVES
This course will develop the student's ability to
 Be familiar with the various types of performance metrics
 Be familiar with the basic instruction sequencing.
 Be familiar with the different I/O interfaces
 Be familiar with an ALU

UNIT I BASIC STRUCTURE OF COMPUTERS 9

Basic Operational Concepts, Bus Structures, Performance – Processor Clock, Basic
Performance Equation, Clock Rate, Performance Measurement. Memory Location and
Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing
Modes, Assembly Language, Basic Input and Output Operations, Stacks and Queues,
Subroutines, Additional Instructions, Encoding of Machine Instructions.

UNIT II INPUT/OUTPUT ORGANIZATION 9

Accessing I/O Devices, Interrupts – Interrupt Hardware, Direct Memory Access, Buses,
Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB.

UNIT III ARITHMETIC 9

Numbers, Arithmetic Operations and Characters, Addition and Subtraction of Signed
Numbers, Design of Fast Adders, Multiplication of Positive Numbers, Signed Operand
Multiplication, Fast Multiplication, Integer Division.

UNIT IV BASIC PROCESSING UNIT 9

Some Fundamental Concepts, Execution of a Complete Instruction, Multiple Bus
Organization, Hard-wired Control, Micro programmed Control.

UNIT V PIPELINING 9
Basic concepts of pipelining, Data Hazards, Instruction hazards, Influence on Instruction
sets, Data path and control considerations, Super scalar operation.

TOTAL (L): 45 Periods

OUTCOMES:
Upon completion of the course, students will be able to
 Explain the basic organization of a computer system.
 Demonstrate functioning of different sub systems, such as processor, Input/output,
43
 and memory.
 Design and analyze simple arithmetic and logical units.
 Illustrate hardwired control and micro programmed control, pipelining, embedded
and other computing systems.
 Demonstrate the effects of hazards

TEXT BOOKS:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, 5th
Edition, Tata McGraw Hill, 2014.

REFERENCES:
1. William Stallings: Computer Organization & Architecture, 9th Edition, Pearson,
2013

44
 AD18302 INTELLIGENT DATABASE MANAGEMENT SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
 To learn the fundamentals of data models and to conceptualize and depict a database
system using ER diagram.
 To make a study of SQL and relational database design.
 To learn about the internal storage structures using different file and indexing techniques
which will help in physical DB design.
 To know the fundamental concepts of transaction processing- concurrency control
techniques and recovery procedure.
 To have an introductory knowledge about the Storage and Query processing Techniques
and NoSQL.

UNIT I RELATIONAL DATABASES 9

Purpose of Database System -– Views of data – Data Models – Database System Architecture –
Introduction to relational databases - Relational Model – Keys – Relational Algebra – Relational
Calculus – SQL fundamentals - Advanced SQL features – Triggers – Embedded SQL – Dynamic
SQL – Database connectivity.

UNIT II DATABASE DESIGN 9

Entity-Relationship Model – E-R Diagrams – Functional Dependencies – Non-loss
Decomposition – Functional Dependencies – First, Second, Third Normal Forms, Dependency
Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth Normal Form
– Join Dependencies and Fifth Normal Form

UNIT III TRANSACTION MANAGEMENT 9

Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery – Media
Recovery – Two Phase Commit -- Save Points – Concurrency – Need for Concurrency – Locking
Protocols – Two Phase Locking – Deadlock – Recovery Isolation Levels

UNIT IV IMPLEMENTATION TECHNIQUES 9

Overview of Physical Storage Media – RAID – File Organization – Organization of Records in
Files – Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files – Static
Hashing – Dynamic Hashing – Query Processing Overview – Catalog Information for Cost
Estimation - Query Optimization

UNIT V INTELLIGENT DATABASES 9

Active Databases: Syntax and Semantics (Starburst, Oracle, DB2)- Taxonomy- Applications-
Design Principles for Active Rules- Temporal Databases: Overview of Temporal Databases
TSQL2- Deductive Databases-Recursive Queries in SQL- Spatial Databases- Spatial Data Types -

45
Spatial Relationships- Spatial Data Structures-Spatial Access Methods- Spatial DB
Implementation.
TOTAL (L): 45 Periods
OUTCOMES:
At the end of the course, the student should be able to :
 To design database schema models with constraints.
 To design database using E-R modeling and apply normalization techniques over it.
 To manage the transactions that happens in a database.
 To analyze the recent advancements in databases.
 To design and implement database for real world applications.

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ― Database System Concepts, Sixth
Edition, Tata McGraw Hill, 2019.
2. Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T.Snodgrass, V.S. Subrahmanian,
Roberto Zicari, “Advanced Database Systems”, Morgan Kaufmann publishers, 2006.

REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systems, Sixth
Edition, Pearson Education, 2010.
2. C.J. Date, A. Kannan, S. Swamynathan, ― An Introduction to Database Systems, Eighth
Edition, Pearson Education, 2006..
3. Leskovec, J., Rajaraman, A., & Ullman, J. D.- Mining of massive datasets. Cambridge
university press, 2014..
4. Raghu Ramakrishnan, Johannes Gehrke ―Database Management Systems, Fourth Edition,
Tata Mc Graw Hill, 2010.
5. G.K. Gupta, ―Database Management Systems, Tata McGraw Hill, 2011.
6. Carlos Coronel, Steven Morris, Peter Rob, ―Database Systems: Design, Implementation
and Management, Ninth Edition, Cengage Learning, 2011
7. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, Wiley and SAS Business Series, 2012.

46
 AD18303 PROGRAMMING FOR DATA SCIENCE L T P C
3 0 0 3
OBJECTIVES
The Student should be made to:
 Understand writing simple programs using Python and R.
 Understand the concepts of data structures such as Lists, Vectors etc.,
 Understand the concepts of dataframes and ndarray.
 Understand the concepts of data storage, transformation, visualization and modeling.

UNIT I INTRODUCTION TO BASICS OF PROGRAMMING 9

Introduction to Python and R- Variables - Expressions and Statements - Operators-String

Operations - Functions-Control and Iterative structures.

UNIT II CLASS, DATA STRUCTURES 9

Objects and Classes, Data structures - List - Tuple - Set - Dictionary: Operations and Methods.

UNIT III ARRAYS, DATAFRAME 9

Creating ndarrays - Arithmetic with Arrays - Basic Indexing and Slicing - Transposing Arrays
and Swapping Axes - File Input and Output with Arrays - Mathematical and Statistical
Methods. Introduction to DataFrame - fundamental methods to interact with DataFrame,
Arithmetic and Data Alignment, Summarizing and Computing Descriptive Statistics.

UNIT IV DATA STORAGE AND DATA TRANSFORMATION 9

Reading and Writing Data - Data Cleaning-Data transformation- Data Wrangling, Interacting
with databases.

UNIT V VISUALIZATION AND MODELING 9

Data aggregation - Group Operations-Introduction to Data Plotting and Visualization,
Modeling Libraries - Introduction to Statistics model.

TOTAL (L): 45 Periods

OUTCOMES:
Upon completion of the course, students will be able to
 Develop simple programs using python/R.
 Apply the concepts of lists, tuples, dictionaries and sets.
 Write programs using ndarray and dataframes.
 Apply the concepts of data storage and data transformation
 Apply the concepts of data visualization and develop models.
47
TEXT BOOKS:
1. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”, 2nd
edition, Updated for Python 3, O‘Reilly Publishers, 2016.
2. Hadley Wickham & Garrett Grolemund, “R for Data Science”, O‘Reilly Media, 1st
edition, 2016.

REFERENCES:
1. Wes McKinney, “Python for Data Analysis”, O‘Reilly Media, 2nd edition, 2017.
2. Mark Lutz, Learning Python, 5th edition, Updated for Python 3.3, O‘Reilly Publishers,
2013. (Revised in 2020).
3. John V Guttag, “Introduction to Computation and Programming Using Python”,
Revised and expanded Edition, MIT Press, 2013
4. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python: An Inter-disciplinary Approach”, Pearson India Education Services Pvt. Ltd.,
2016.

48
CS18411 OPERATING SYSTEMS LABORATORY L T P C
0 0 3 1.5
OBJECTIVES
 Learn Unix commands and shell programming.
 Be exposed to programming in C using system calls.
 Learn to implement process creation and inter process communication.
 Be familiar with implementation of CPU Scheduling Algorithms
 Be familiar with implementation of page replacement algorithms
 Be familiar with implementation of Deadlock avoidance and detection algorithms.
 Be familiar with implementation of File Organization and File Allocation
Strategies.

List of Experiments
1. Study of UNIX Commands.
2. Study of Shell Programming.
3. Implement system calls of UNIX operating system fork, exec, getpid,
exit, wait, close, stat, opendir, readdir.
4. Simulate Unix commands cp, mv, ls, grep.
5. Implement the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority.
6. Implement all file allocation strategies.
a) Sequential b) Indexed c) Linked.
7. Implement Producer Consumer Problem using Semaphores.
8. Implement all File Organization Techniques.
a) Single level directory b) Two level c) Hierarchical d) DAG
9. Implement Bankers Algorithm for Dead Lock Avoidance.
10. Implement an algorithm for Dead Lock Detection.
11. Implement the following page replacement algorithms.
a) FIFO b) LRU c) LFU
12. Implement Shared memory, message passing and pipes.
13. Implement Paging and Segmentation Technique of memory
management.
14. Implement Threading & Synchronization Applications for Reader Writer
Problem.
15. Study of Mimix Operating System.
TOTAL: 45 Periods
OUTCOMES:
At the end of the course, learners will be able to
 Implement system calls in UNIX.
 Compare the performance of various CPU Scheduling Algorithms
 Implement Deadlock avoidance and Detection Algorithms.
 Implement semaphores, create processes and perform IPC.
49
  Implement the various Page Replacement Algorithms and File Organization and
File Allocation Strategies.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

HARDWARE:
1. Standalone desktops 30 Nos. (or) Server supporting 30 terminals or more.

SOFTWARE:
Standalone desktops with C / C++ / Java / Equivalent complier 30 Nos.
(or)
Server with C / C++ / Java / Equivalent complier supporting 30 terminals

50
 AD18311 INTELLIGENT DATABASE MANAGEMENT SYSTEMS L T P C
LABORATORY
0 0 3 1.5
OBJECTIVES:

 Learn to create and use a database.

 Be familiarized with a query language.
 Have hands on experience on DDL Commands.
 Have a good understanding of DML Commands and DCL Commands.
 Familiarize advanced SQL queries.
 Be exposed to different applications.

LIST OF EXPERIMENTS:
1. Creation of a database and writing SQL queries to retrieve information from the database.
2. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based
on conditions.
3. Creation of Views, Synonyms, Sequence, Indexes, Save point.
4. Creating an Employee database to set various constraints.
5. Creating relationship between the databases.
6. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
7. Write a PL/SQL block that handles all types of exceptions.
8. Creation of Procedures.
9. Creation of database triggers and functions
10. Intelligent database interface
11. Database Connectivity with Front End Tools
12. Case study of Big Data and NoSQL.
13. Mini project
a. Inventory Control System.
b. Material Requirement Processing.
c. Hospital Management System.
d. Railway Reservation System.
e. Personal Information System.
f. Web Based User Identification System.
g. Timetable Management System.
h. h) Hotel Management System

TOTAL: 45 Periods
OUTCOMES:
At the end of the course, the student should be able to:
 Design and implement a database schema for a given problem-domain
 Populate and query a database.
51
  Create and maintain tables using PL/SQL.
 Implement triggers for application specific actions.
 Establish database connectivity with Front End tools.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

HARDWARE:
Standalone desktops 30 Nos. (or) Server supporting 30 terminals or more.

SOFTWARE:
OS: Fedora / Linux, Hadoop package.
Front end: VB/VC ++/JAVA or Equivalent,
Back end: Oracle / SQL / MySQL/ PostGress / DB2 or Equivalent.

52
AD18312 PROGRAMMING FOR DATA SCIENCE L T P C
LABORATORY 0 0 3 1.5
OBJECTIVES
The Student should be made to:
 Write basic programs using Python and R.
 Be familiar with data structures such as Lists, Vectors, Tuples etc.,
 Learn the concepts of using dataframes and ndarray.
 Learn the concepts of data storage, transformation.
 Learn the concepts of data visualization and modeling techniques.
List of Experiments
1. Write simple programs using Python/R.
2. Write programs using control and iterative structures.
3. Write programs using functions.
4. Write programs using classes and objects.
5. Develop simple programs using vectors, lists and tuples.
6. Develop simple programs using set and dictionary.
7. Write programs for accessing ndarray and perform various operations on it.
8. Write programs to interact with dataframe and perform various operations.
9. Write programs to perform data transformation.
10. Develop programs to perform data wrangling.
11. Develop programs to interact with database.
12. Write programs for data aggregation and grouping functions
13. Create various graphical plots for analysing data.
14. Select appropriate functions for estimation of samples.
15. Develop mathematical and statistical models.
TOTAL: 45 Periods
OUTCOMES:
At the end of the course, the student should be able to:
Develop basic programs using Python and R.
 Implement data structures using Lists, Vectors, Tuples etc., using Python/R.
 Use dataframes and ndarray in Python/R.
 Implement the concepts of data storage, data transformation, data wrangling and
database connectivity.
 Visualize data using various plots.
 Build mathematical and statistical models.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

 Standalone desktops with Python and R computers 30 Nos.
(or)
 Server with Python and R supporting 30 terminals or more.

53
 MA18456 QUEUEING THEORY AND OPTIMIZATION L T P C
3 1 0 4
OBJECTIVES
The student should be made to:
 Understand the concepts of Linear Programming Problems and its Applications
 Learn the basic concepts of Transportation and Assignment problems
 Understand the fundamental concepts of Queueing systems and its Applications
 Gain more knowledge in analyzing queuing models.
 Understand the basic concepts of Optimization and apply the same to problems in
Machine Learning

UNIT I QUEUEING MODELS 9+3

Markovian queues – Birth and Death processes – Single and multiple server queueing
models— Little’s formula- Queues with finite waiting rooms - Finite source models

UNIT II ADVANCED QUEUEING MODELS 9+3

M/G/1 queue - Pollaczek Khinchin formula - M/D/1 and M/EK/1 as special cases-Series
queues – Open Jackson networks.

UNIT III LINEAR PROGRAMMING MODELS 9+3

Mathematical Formulation –Graphical solution of LP models – Simplex method –Artificial
Variable Techniques—Variants of Simplex method- Primal and Dual relationships-Dual-
simplex method-post optimal Analysis

UNIT IV TRANSPORTATION AND ASSIGNMENT MODELS 9+3

Mathematical Formulation of Transportation problem – Methods for finding Initial Basic
Feasible solution – Optimum solution –Degeneracy--.Mathematical Formulation of
Assignment Models – Hungarian Algorithm – Variants of Assignment problem

UNIT V CLASSICAL OPTIMIZATION THEORY 9+3

Unconstrained and Constrained optimization - Numerical optimization techniques for
constrained and unconstrained optimization: KKT conditions - Newton’s method - Steepest
descent method - Penalty function method.

TOTAL (L+ T): 60 Periods

OUTCOMES:
Upon completion of the course, students will be able to
 Identify, formulate Linear Programming Problems and analyze the same
 Analyze and evaluate the various methods under transportation, assignment models
 Acquire skills in analyzing queueing models
54
  Design networks using queuing theories in domain specific situations.
 Apply optimization techniques to problems in Machine Learning

TEXT BOOKS:
1. Taha H.A. “Operations Research”, Pearson Education, Asia, 8th Edition, 2007.
2. Gross. D. and Harris. C.M, “Fundamentals of Queueing Theory”, Wiley student
Edition,2004

REFERENCES:
1. Hira and Gupta “Problems in Operations Research”, S. Chand and Co.,2008.
2. J. Nocedal and S. J. Wright, Numerical Optimization. New York: Springer Science
Business Media, 2006.
3. Winston. W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole,
2003.

55
 AD18401 INTELLIGENT COMPUTER NETWORKS L T P C
3 0 0 3
OBJECTIVES:
The learner should be made to:
 Understand the concepts of computer network and Internet.
 Be familiar with real time applications of networks.
 Learn the Transport Layer, flow control and congestion control algorithms.
 Be exposed to various addressing schemes and routing protocols.
 Understand the better manage and control networking, the intelligent awareness of network
traffic.
 Understand the link, physical layers and error detection-correction of data.

UNIT I INTRODUCTION TO COMPUTER NETWORK AND 9

INTERNET
What is Internet-The Network Edge-The Network Core- Delay, Loss, and Throughput in Packet
Switched Networks- Protocol Layers and Their Service Models- Networks Under Attack- History
of Computer Networking and the Internet.

UNIT II APPLICATION LAYER 9

Principles of Network Applications- The Web and HTTP- File Transfer: FTP- Electronic Mail in
the Internet- DNS—The Internet‘s Directory Service- Peer-to-Peer Applications- Socket
Programming: Creating Network Applications.

UNIT III TRANSPORT AND NETWORK LAYER 9

Introduction and Transport-Layer Services- Multiplexing and De-multiplexing- Connectionless
Transport: UDP- Principles of Reliable Data Transfer- Connection-Oriented Transport: TCP
Principles of Congestion Control- TCP Congestion Control- Routing Algorithms- Routing in the
Internet- Broadcast and Multicast Routing.

UNIT IV LINK AND PHYSICAL LAYER 9

Introduction- Introduction to the Link Layer- Error-Detection and –Correction Techniques-
Multiple Access Links and Protocols- Physical Layer: Digital Transmission – Multiplexing and
Spread Spectrum - Transmission Media, Virtual Circuit and Datagram Networks- What‘s Inside a
Router- The Internet Protocol (IP), Forwarding and Addressing in the Internet- Routing
Algorithms.

UNIT V INTELLIGENT NETWORK 9

Intrusion Detection System Based on Multi-Level Semi-Supervised Machine Learning- Intrusion
Detection Based on Hybrid Multi-Level Data Mining- Framework of HMLD-Abnormal Network
Traffic Detection Based on Big Data Analysis.

56
 TOTAL (L): 45 Periods

OUTCOMES:
At the end of the course, learners will be able to
 Learners will be able to choose the required functionality at each layer for given
application
 Choose the required functionality at each layer for given application
 Detect and Correct the error in the frame
 Apply the knowledge of addressing scheme and various routing protocols in data
communication to select optimal path.
 Trace the flow of information from one node to another node in the network
 Apply the intelligent awareness of network traffic

TEXT BOOKS:
1. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach
Featuring the Internet”, Seventh Edition, Pearson Education, 2017.
2. Yao, Haipeng, Jiang, Chunxiao, Qian, Yi, Developing Networks using Artificial
Intelligence, Springer, 2019.

REFERENCES:
1. Behrouz A. Forouzan, “Data Communications and Networking”, Fourth Edition,
McGrawHill, 2011.
2. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth
Edition, Morgan Kaufmann Publishers, 2011.
3. John Anderson, "Intelligent Networks: Principles and applications", IET
Publications, 2002.
4. Syed V Ahamed,” Intelligent Networks”, First Edition, Elsevier, 20213.
5. Gerardus Blokdyk,"Intelligent Network A Complete Guide",5STARCooks,2020.

57
 AD18402 PRINCIPLES OF ARTIFICIAL INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES
 To understand the various Intelligent agents and problem solving search strategies
 To learn about game playing and constraint satisfaction problems
 To learn to represent knowledge in solving AI problems
 To combine problem-solving strategies with knowledge representation mechanism
for solving hard problems
 To understand the role of expert systems

UNIT I PROBLEM SOLVING METHODS 9

Foundations of Artificial Intelligence, State of the Art; Intelligent Agents - Characteristics
of Intelligent Agents, Typical Intelligent Agents; Problem solving - Search Strategies,
Uninformed, Informed, Heuristic Functions; Production Systems – Introduction and
Characteristics, Water Jug Problem

UNIT II ADVERSARIAL SEARCH 9

Game Playing - Optimal Decisions in Games, Alpha-Beta Pruning, Stochastic Games;

Constraint Satisfaction Problems – Inference, Backtracking Search and Local Search

UNIT III KNOWLEDGE REPRESENTATION 9

Representing Knowledge using Rules; Predicate logic - Syntax and Semantics, Inference,
Unification and Lifting, Forward Chaining, Backward Chaining, Resolution; Semantics
Nets, Frames and Scripts; Dempster-Shafer Theory and Fuzzy Logic

UNIT IV PLANNING 9

Planning - Overview, Components of a Planning System, Components of a Planning

System, Goal Stack Planning, Nonlinear Planning Using Constraint Posting

UNIT V EXPERT SYSTEMS 9

Expert Systems – Introduction, Architecture, Knowledge acquisition; Expert System

Shells; Typical Expert Systems – MYCIN, ONCOCIN, Dxplain, PUFF, DART and XCON

TOTAL (L): 45 Periods

58
OUTCOMES:
Upon completion of the course, the students will be able to:
 Use appropriate search algorithms for any AI problem.
 Make inferencing in game playing
 Represent a problem using predicate logic
 Solve hard problems using problem-solving strategies with knowledge
representation mechanism
 Design and develop expert system for real-time applications

TEXT BOOKS:
1. Peter Norvig and Stuart Russel, Artificial Intelligence: A Modern Approach,
Pearson, 4th Edition, 2020
2. Elaine Rich, Kevin Knight and B.Nair, Artificial Intelligence 3rd Edition, McGraw
Hill, 2008

REFERENCES:
1. Melanie Mitchell, Artificial Intelligence: A Guide for Thinking Humans. Series:
Pelican Books, 2020
2. Ernest Friedman-Hill, Jess in Action, Rule-Based Systems in Java, Manning
Publications, 2003
3. Nils J. Nilsson, The Quest for Artificial Intelligence, Cambridge University Press,
2009
4. Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems,1st
Edition by Patterson, Pearson, India, 2015

59
AD18403 APPLIED MACHINE LEARNING L T P C
3 0 0 3
OBJECTIVES
 To understand the fundamental concepts of Machine learning techniques
 To enable the students to gain knowledge of parameter estimation methods
 To study the concepts of non-parameter estimation methods and dimensionality
reduction techniques.
 To understand various discriminative learning models
 To understand decision tree algorithm and schemes of combining models.

UNIT I INTRODUCTION 9
Overview of Machine Learning-Applications-Types of learning -Supervised learning-
Classification, Regression, Unsupervised learning, Reinforcement learning; Bayesian
Decision Theory-Classification-Losses and Risks- Discriminant Functions – Utility
Theory, Learning Associations-Association Rules.

UNIT II PARAMETERIC METHODS 9

Maximum Likelihood Estimation-Bernoulli Density, Multinomial Density, Gaussian

(Normal) Density; Evaluating an Estimator-Bias and Variance, Bayes Estimator-
Parametric Classification, Regression, Tuning Model Complexity-Bias-Variance Dilemma-
Model Selection Procedures.
UNIT III NON-PARAMETRIC METHODS AND DIMENSIONALITY 9
REDUCTION
Non parametric Density Estimation-Non parametric Classification - K-Nearest neighbor,
Non parametric Regression - Smoothing models ; Clustering - K-means – K –Medoid
Hierarchical clustering Dimensionality reduction - Principal Component Analysis-Fisher
Discriminant Analysis – Independent Component Analysis.

UNIT IV DISCRIMINATIVE LEARNING MODELS 9

Logistic regression –Artificial neural networks- Perceptrons - Training a Perceptron-

Learning Boolean Functions - Multilayer Perceptrons - Back propagation Algorithm,
Training Procedures and Tuning Network Size; Kernel Machines - Optimal Separating
Hyperplane - The Nonseparable Case: Soft Margin Hyperplane - Kernel Trick .

UNIT V TREE MODELS AND COMBINING CLASSIFIERS 9

Decision trees – Classification trees - Regression trees –Pruning; Rule extraction from
trees- Combining Multiple Learners, Voting- Generating Diverse Learners-Model
Combination Schemes-Voting-Error-Correcting Output Codes-Random Forests-Bagging-
Boosting-Mixture of Experts.
60
 TOTAL (L): 45 Periods
OUTCOMES:
Upon completion of the course, the students will be able to:
 Develop an appreciation for what is involved in learning models from real
world data.
 Use parametric methods to obtain AI based solution.
 Implement machine learning solutions to clustering problems.
 Use discriminative models to evaluate data
 Apply the decision tree and mixture of experts algorithms to real-world
problems.

TEXT BOOKS:
1. Peter Norvig and Stuart Russel, Artificial Intelligence: A Modern Approach,
Pearson, 4th Edition, 2020
2. Alpaydin, E., “Introduction to machine learning” MIT press, 2020

REFERENCES:
1. Bratko, ―Prolog: Programming for Artificial Intelligence, Fourth edition, Addison-
Wesley Educational Publishers Inc., 2011.
2. Deisenroth, Marc Peter, A. Aldo Faisal, and Cheng Soon Ong. Mathematics for
machine learning. Cambridge University Press, 2020.
3. Kroese, Dirk P., Zdravko Botev, Thomas Taimre, and Radislav Vaisman. Data
Science and Machine Learning: Mathematical and Statistical Methods. CRC Press,
2019.
4. Marsland, Stephen. Machine learning: an algorithmic perspective. CRC press,
2015.

61
AD18404 OBJECT ORIENTED SOFTWARE ENGINEERING L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand generic process models to structure the software development process.
 Understand fundamental concepts of requirements engineering and Modelling using UML
concepts.
 Understand the principles, process and concepts of various design models.
 Learn various conventional and object oriented testing strategies.
 Learn the concepts of Software maintenance and Reengineering.

UNIT I SOFTWARE PROCESS AND PROJECT MANAGEMENT 9

Introduction - Process models- Agile Development- Process and Project Metrics : Software
Measurement - LOC & FP based estimation - Empirical estimation models – Risk analysis -Software
project scheduling and Tracking.- Object Oriented concepts, Principles & Methodologies- Object
Oriented Estimation & Scheduling.

UNIT II REQUIREMENTS ANALYSIS AND MODELING 9

Software Requirements: Functional and Non-Functional, User requirements, System requirements,
Software Requirements Document – Requirement Engineering Process -Requirement Modelling :
Scenario based Modelling(Use Case, Swimlane and Activity),Class based modelling – Flow &
behaviour based Modelling – Structured analysis.

UNIT III SOFTWARE DESIGN 9

Design Principles – Design Process and Concepts – Architectural Design – Architectural styles,
Architectural Mapping using Data Flow Diagram (DFD) - User Interface Design: Interface analysis,
Interface Design –Component level Design: Designing Class based components, traditional
Components.

UNIT IV TESTING AND IMPLEMENTATION 9

Software Testing Strategies: Unit Testing- Integration Testing- Validation Testing – System Testing –
Art of Debugging, Testing Conventional applications: White Box Testing & Black Box Testing,
Testing Object oriented Applications: Object oriented testing strategies & methods – Testing at class
level.

UNIT V MAINTENANCE & RE-ENGINEERING 9

Software Maintenance – Software supportability – Reengineering – Business process Reengineering –
Software Reengineering – Reverse Engineering – Restructuring – Forward Engineering – The
Economics of Reengineering.

TOTAL (L): 45 Periods

62
OUTCOMES:
At the end of the course, the student should be able to
 Identify the key activities in managing a software development and management process.
 Compare different process models. Concepts of requirements engineering and Modelling using
UML concepts.
 Apply systematic procedure for conventional and object oriented software design and
deployment.
 Compare and contrast the various testing strategies of conventional and object oriented
applications.
 Learn the concepts of Software Maintenance and Reverse Engineering.

TEXT BOOKS:
1. Roger. S. Pressman and Bruce R. Maxim, “Software Engineering – A Practitioner’s Approach”,
seventh Edition, McGraw Hill, 2015.

REFERENCES:
1. Ian Sommerville, “Software Engineering”, eighth edition, Pearson Education, New Delhi,
2011.
2. Bill Brykczynski, Richard D. Stutz, “Software Engineering Project Management”, Wiley India
Edition, IEEE computer society, 2007.
3. Craig Larman, “Applying UML and Patterns: An Introduction to Object-Oriented Analysis
and Design and Iterative Development” (3rd Edition), Pearson Education, 2008.

63
GE18251 ENVIRONMENTAL SCIENCE AND L T P C
ENGINEERING 3 0 0 3
OBJECTIVES
 To study the nature and facts about environment.
 To study the interrelationship between living organism and environment.
 To implement scientific, technological, economic, and political solutions to environmental
problems.
 To study the integrated themes and biodiversity, natural resources, pollution control
and waste management.

UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 9

Definition, scope and importance of environment – need for public awareness - concept of an
ecosystem – structure and function of an ecosystem – energy flow in the ecosystem –
ecological succession – food chains, food webs and ecological pyramids – Introduction, types,
characteristic features, structure and function of the forest ecosystem, grassland ecosystem,
desert ecosystem, aquatic ecosystems, Introduction to biodiversity definition: genetic, species
and ecosystem diversity – biogeographical classification of India – value of biodiversity –
Biodiversity at global, national and local levels – India as a mega-diversity nation – hot-spots
of biodiversity – threats to biodiversity – man-wildlife conflicts – endangered and endemic
species of India – conservation of biodiversity: In-situ and ex-situ conservation of biodiversity.

UNIT II NATURAL RESOURCES AND DISASTER MANAGEMENT 9

Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction,
mining, dams and their effects on forests and tribal people – Water resources: Use and over-
utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits
and problems – Mineral resources: Use and exploitation, environmental effects of extracting
and using mineral resources, case studies – Food resources: World food problems, changes
caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide
problems, water logging, salinity, case studies – Energy resources: Growing energy needs,
renewable and non renewable energy sources, use of alternate energy sources. case studies –
Land resources: Land as a resource – role of an individual in conservation of natural resources
– Equitable use of resources for sustainable lifestyles.

UNIT III ENVIRONMENTAL POLLUTION 9

Definition – causes, effects and control measures Air pollution, Water pollution, Soil pollution,
Marine pollution, Noise pollution, Thermal pollution, Nuclear hazards – solid waste
management: causes, effects and control measures of municipal solid wastes, e-Waste, risk
related to e-Waste – role of an individual in prevention of pollution – pollution case studies –
disaster management: floods, earthquake, cyclone and landslides, land degradation, man
induced landslides, soil erosion and desertification.
64
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 9

From unsustainable to sustainable development – urban problems related to energy – water

conservation, rain water harvesting, watershed management – resettlement and rehabilitation
of people; its problems and concerns, case studies – role of non-governmental organization-
environmental ethics: Issues and possible solutions – Principles of green chemistry, climate
change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust, case
studies. – wasteland reclamation – consumerism and waste products – Environment protection
act – Air (Prevention and Control of Pollution) act – Water (Prevention and control of
Pollution) act – Wildlife protection act – Forest conservation act – central and state pollution
control boards - Public awareness.

UNIT V HUMAN POPULATION AND THE ENVIRONMENT 9

Population growth, variation among nations – population explosion – family welfare

programme – environment and human health – human rights – value education – HIV / AIDS,
Swine flu, Dengue fever – women and child welfare – role of information technology in
environment and human health management – case studies.

TOTAL (L): 45 Periods

OUTCOMES:
On completion of the course, the student will be able to
 Describe the importance of ecosystems, biodiversity and its protection.
 Implement the knowledge which requires optimum use of various natural resources for
the conservation of natural resources.
 Classify the different types of pollution, their effects and control measures. Also apply
the knowledge gained for disaster management.
 Describe the sustainable development, social issues, role of NGO’s and various laws
available in the country for environmental protection.
 Recognize the importance of women and child welfare, prevention of HIV/AIDS and
usage of technology for environmental management.

TEXT BOOKS:
1. Benny Joseph, Environmental Science and Engineering, Tata McGraw-Hill, New
Delhi, 2012.
2. Gilbert M.Masters, Introduction to Environmental Engineering and Science, 2nd
edition, Pearson Education, 2010.
REFERENCES:
1. Dharmendra S. Sengar, ̳Environmental law‘, Prentice hall of India PVT LTD, New
Delhi, 2012.
2. Erach Bharucha, ―Textbook of Environmental Studies, Universities Press(I) PVT,

65
 LTD, Hyderabad, 2015.
3. Rajagopalan, R, ̳Environmental Studies-From Crisis to Cure, Oxford University Press,
2011.
4. Tyler Miller. G and Scott E. Spoolman, ―Environmental Science, Cengage Learning
India PVT, LTD, Delhi, 2013.

66
 AD18411 INTELLIGENT COMPUTER NETWORKS L T P C
LABORATORY 0 0 3 1.5
OBJECTIVES
 Learn socket programming.
 Be familiar with simulation tools.
 Have hands on experience on various networking protocols

LIST OF EXPERIMENTS
1. Write a program to implement A. bit stuffing B. CRC.
2. Study of Socket Programming and Client – Server model
3. Applications using TCP Sockets a. Date and Time server & client b. Echo server &
client, etc c. Chat
4. Applications using UDP Sockets a. DNS
5. Simulation of Stop and Wait Protocol and Sliding Window Protocol.
6. Simulation of ARP /RARP protocols.
7. Simulation of PING and TRACEROUTE commands
8. Write a program to implement subnetting and find the subnet for a given IP
9. Using Cisco Packet Tracer, do the following a). Establish a Local Area Network (LAN)
with 4 hosts and a switch/Hub b). Connect two LANs using multi-router topology with
static routes.
10. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms
using NS.
11. Demonstrate intrusion detection system (ids) using any tool eg. Snort or any other
software.
12. Write a program to implement signature based intrusion detection system used to detect
network attacks.

TOTAL: 45 Periods
OUTCOMES:
At the end of the course, the student should be able to:
 Use simulation tools
 Implement the various protocols.
 Analyze the performance of the protocols in different layers.
 Analyze various routing algorithms
 Understand the major software and hardware technologies used on computer networks
and intelligent networks.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
 C / C++ / Java / Equivalent Compiler 30 Network simulator like
NS2/Glomosim/OPNET/ Equivalent/Snor.

67
 L T P C
AD18412 ARTIFICIAL INTELLIGENCE LABORATORY 0 0 3 1.5
OBJECTIVES
 Design and implement methods of solving problems using Artificial Intelligence.
 Implement various Expert Systems and machine learning strategies.

List of Experiments
1. Implement Breadth First Search & Depth first Search for Water Jug problem
2. Implement Minimax search Procedure for game playing
3. Implement Constraint Satisfaction Problems – Cryptarithmetic, Map
Colouring
4. Implement various Python packages for Predicate Logic
5. Implement Unification algorithm using Python / JESS
6. Implement forward chaining and backward chaining using Python / JESS
7. Implement Dempster-Shafer using Python
8. Implement Fuzzy set operations using Python
9. Implement Goal Stack Planning using Python
10. Implement Expert system for the field of Medicine using JESS

TOTAL: 45 Periods
OUTCOMES:
At the end of the course, the student should be able to:
 Implement appropriate AI methods to solve a given problem.
 Implement and carry out an empirical evaluation of different algorithms on a
problem
 Represent knowledge and perform inferencing using Python and JESS
 Design and implement an expert system for any domain

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C/C++/Java/Python/JESS compiler 30 Nos.
(or)
Server with C/C++/Java/Python/JESS compiler supporting 30 terminals

68
 AD18413 APPLIED MACHINE LEARNING L T P C
LABORATORY 0 0 3 1.5
OBJECTIVES

The student should be made to:

 Understand the implementation of machine learning algorithms in python.
 Make use of appropriate data sets for implementing the machine learning
algorithms.

List of Experiments
1. Introduction to Python Libraries- Numpy, Pandas, Matplotlib, Scikit.
2. Perform Data exploration and preprocessing in Python.
3. Implement Naive Baye’s classification.
4. Implement Linear regression.
5. Implement K-Nearest Neighbor classification.
6. Build model to perform Clustering using K-mean algorithm.
7. Implement regularized logistic regression.
8. Build model using Back Propagation Neural Network.
9. Build model using SVM with different kernels.
10. Build model using Decision trees.

TOTAL: 45 Periods
OUTCOMES:
At the end of the course, the student should be able to:
 Identify the implementation procedures for the machine learning algorithms.
 Design Python programs for various Learning algorithms.
 Apply appropriate data sets to the Machine Learning algorithms.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

HARDWARE:
Standalone desktops – 30 Nos. (or) Server supporting 30 terminals or more

SOFTWARE:
Python compiler in Ubuntu OS.

69
 SEMESTER V
AD18501 DEEP LEARNING ALGORITHMS AND L T P C
ARCHITECTURES 3 0 0 3
OBJECTIVES
The students are made to
 Understand the basis of linear and softmax regression
 Learn the notions of over fitting, under fitting and regularization techniques.
 Design convolutional neural network
 Handle sequential information
 Study the transformation of an idea to concrete math model and make it work

UNIT I LINEAR NEURAL NETWORKS 9

Linear Regression - Basic Elements of Linear Regression- The Normal Distribution and
Squared Loss - From Linear Regression to Deep Networks Softmax Regression -
Classification Problems - Loss Function - Information Theory Basics -Model Prediction and
Evaluation

UNIT II MULTILAYER PERCEPTRONS 9

Multilayer Perceptrons: Hidden Layers-Activation Functions-The model-The Loss Function-
Training; Model Selection, Underfitting and Overfitting: Training Error and generalization
Error-Model Selection-Polynomial Regression. Weight Decay: Squared Norm Regularization-
High-Dimensional Linear Regression; Drop out: Robustness through Perturbations. Forward
Propagation and Backward Propagation. Numerical Stability and Initialization.

UNIT III CONVOLUTIONAL NEURAL NETWORKS 9

Convolutional Neural Networks (CNN)- From Dense Layers to Convolutions: Invariances-
Constraining the MLP-Convolutions. Convolutions for Images: The Cross-Correlation
Operator-Convolutional Layer-Object edge Detection in Images-Learning a kernel-Cross
Correlation and Convolution. Padding and Stride. Multiple Input and Output Channels.
Pooling.

UNIT IV RECURRENT NEURAL NETWORKS 9

Gated Recurrent Units (GRU)-Long Short Term Memory (LSTM)- Deep Recurrent Neural
Networks-Bidirectional Recurrent Neural Networks - Encoder and Decoder Architecture -
Sequence to Sequence Model.

70
UNIT V ATTENTION MECHANISMS 9
Attention Mechanisms - Sequence to Sequence with Attention Mechanisms: Decoder -
Training. Transformer: Multi-Head Attention-Position wise Feed Forward Networks- Add and
Norm-Positional Encoding-Encoder-Decoder-Training

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course, students will be able to
 Train models for multi-category classification.
 Train deep learning models and ensure the gradients are well controlled
 Construct a complex CNN and tune various hyper parameters
 Construct a sequential model which can capture the dependencies for time series data
 Familiar with the encoder-decoder architecture

TEXT BOOKS:
1. Bengio Y, Goodfellow I, Courville A. Deep learning. MIT press; 2017.
2. Zhang, Aston, Zachary C. Lipton, Mu Li, and Alexander J. Smola. "Dive into Deep
Learning."Unpublished draft. Retrieved 3 (2019): 319.

REFERENCES:
1. Charniak E. Introduction to deep learning. The MIT Press; 2019 Jan 29.

71
AD18502 DIGITAL SIGNAL PROCESSING FOR DATA L T P C
SCIENCE
3 1 0 4
OBJECTIVES
The students will be made to :
 Understand the basics of signals and systems
 Gain an understanding of discrete time signals and systems
 Understand the various probability distributions
 Study how to build machine learning models using audio signals
 Study deep learning model and architectures for computer vision

UNIT I SIGNALS AND SYSTEMS 9+3

Basic Elements of Digital Signal Processing-Classification of Continuous and Discrete Time

Signals -Concept of Frequency in Continuous Time and Discrete Time Signal; Analog-to-
Digital conversion and Digital-to-Analog conversion

UNIT II DISCRETE-TIME SIGNALS AND SYSTEMS 9+3

Discrete Time Signals - Discrete Time Systems-Classification Discrete Time Signals-Z-

Transform -Inverse Z-Transform-Analysis of Linear Time Invariant Systems

UNIT III PROBABILITY DISTRIBUTION 9+3

Binary Variables-Beta Distribution- Multinomial Variables - The Gaussian Distribution- Non-
parametric Methods-Mixture Models & Expectation Maximization-K-means Clustering-
Mixture of Gaussians

UNIT IV AUDIO SIGNAL PROCESSING 9+3

Introduction to Audio Indexing and Classic Information Retrieval System; Feature Extraction:
Introduction-Basic Audio Features-Feature Extraction Techniques; Audio Classification:
Classification strategies-Neural network in Speech Classification-Deep Neural Network in
Speech Recognition

72
UNIT V IMAGE SIGNAL PROCESSING 9+3
Convolution Neural Networks; Object Detection-Object tracking and Action Recognition-
Image Segmentation and Synthesis

TOTAL (L:45+T:15): 60 PERIODS

OUTCOMES:
At the end of the course, learners will be able to:
 Use signals for modelling

 Know various signal transformations

 Appreciate necessity of various probability distributions

 Design models that can process audio signals

 Use existing architectures and create their own architectures for computer vision

TEXT BOOKS:
1. Svensén, Markus, and Christopher M. Bishop(2007). "Pattern recognition and machine
learning".
2. Proakis, J. G., &Manolakis, D. G. (2013). Digital Signal Processing: Pearson New
International Edition. Pearson Education Limited.
3. Sen, S., Dutta, A., & Dey, N. (2019). Audio processing and speech recognition:
concepts, techniques and research overviews. Springer.
4. Goodfellow, I., Bengio, Y., & Courville, A. (2016). Deep learning. MIT press.

REFERENCES:
1. Rabiner, L. R., & Schafer, R. W. (2007). Introduction to Digital Speech
Processing (Vol. 1). Now Publishers Inc.

73
 L T P C
CS18502 DATA MINING AND DATA WAREHOUSING
3 1 0 4
OBJECTIVES
 To understand data warehouse concepts, architecture, business analysis and tools
 To understand data pre-processing and data visualization techniques
 To study algorithms for finding hidden and interesting patterns in data
 To understand and apply various classification and clustering techniques using tools.
 Master data mining techniques in various applications like social, scientific and environmental
context.
UNIT I DATA WAREHOUSING & MODELING 9+3
Basic Concepts: Data Warehousing: A multitier Architecture, Data warehouse models: Enterprise
warehouse, Data mart and virtual warehouse, Extraction, Transformation and loading, Data Cube: A
multidimensional data model, Stars, Snowflakes and Fact constellations: Schemas for
multidimensional Data models, Dimensions: The role of concept Hierarchies, Measures: Their
Categorization and computation, Typical OLAP Operations.

UNIT II DATA WAREHOUSE IMPLEMENTATION& DATA MINING 9+3

Efficient Data Cube computation: An overview, Indexing OLAP Data: Bitmap index and join index,
Efficient processing of OLAP Queries, OLAP server Architecture ROLAP versus MOLAP Versus
HOLAP. : Introduction: What is data mining, Challenges, Data Mining Tasks, Data: Types of Data,
Data Quality, Data Preprocessing, Measures of Similarity and Dissimilarity.

UNIT III ASSOCIATION ANALYSIS 9+3

Association Analysis: Problem Definition, Frequent Item set Generation, Rule generation. Alternative
Methods for Generating Frequent Item sets, FP-Growth Algorithm, Evaluation of Association
Patterns.

UNIT IV CLASSIFICATION 9+3

Decision Trees Induction, Method for Comparing Classifiers, Rule Based Classifiers, Nearest
Neighbor Classifiers, Bayesian Classifiers.

UNIT V CLUSTERING ANALYSIS 9+3

Overview, K-Means, Agglomerative Hierarchical Clustering, DBSCAN, Cluster Evaluation, Density-
Based Clustering, Graph- Based Clustering, Scalable Clustering Algorithms.

TOTAL (L:45 T:15): 60 PERIODS\

74
OUTCOMES:
 Students will be able to understand data warehouse concepts, architecture, business analysis
and tools.
 Students will be able to understand data pre- processing and data visualization techniques
 Students will be able to study algorithms for finding hidden and interesting patterns in data
using association algorithms
 Students will be able to apply various classification and clustering techniques using tools
 Students will be mastering the data mining techniques in various applications like social,
scientific and environmental context

TEXT BOOKS:
1. Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques, Third Edition,
Elsevier, 2012.

REFERENCE BOOKS:
1. Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP‖, Tata
McGraw – Hill Edition, 35th Reprint 2016.
2. K.P. Soman, Shyam Diwakar and V. Ajay, ―Insight into Data Mining Theory and Practice,
Eastern Economy Edition, Prentice Hall of India, 2006.
3. Ian H.Witten and Eibe Frank, ―Data Mining: Practical Machine Learning Tools and
Techniques, Elsevier, Second Edition.

75
AD18503 INTERNET OF THINGS TOWARDS DATA L T P C
SCIENCE 3 0 0 3
OBJECTIVES
 To introduce the terminology, technology and its applications
 To introduce the concept of M2M (machine to machine) with necessary protocols
 To introduce the Python Scripting Language which is used in many IoT devices
 To introduce the Raspberry PI platform, that is widely used in IoT applications.
 To apply the concept of Internet of Things in the real world scenario

UNIT I INTRODUCTION TO INTERNET OF THINGS 9

Definition and Characteristics of IoT, Physical Design of IoT – IoT Protocols, IoT
communication models, IoT Communication APIs IoT enabled Technologies – Wireless
Sensor Networks, Cloud Computing, Big data analytics, Communication protocols,
Embedded Systems, IoT Levels and Templates Domain Specific IoTs

UNIT II IOT AND M2M 9

Software defined networks, network function virtualization, difference between SDN and
NFV for IoT Basics of IoT System Management with NETCOZF, YANG- NETCONF,
YANG, SNMP NETOPEER.

UNIT III INTRODUCTION TO PYTHON 9

Language features of Python, Data types, data structures, Control of flow, functions,
modules, packaging, file handling, data/time operations, classes, Exception handling Python
packages – JSON, XML, HTTPLib, URLLib, SMTPLib.

UNIT IV IOT PHYSICAL DEVICES AND ENDPOINTS 9

Introduction to Raspberry PI-Interfaces (serial, SPI, I2C) Programming – Python program
with Raspberry PI with focus of interfacing external gadgets, controlling output, reading
input from pins.

76
UNIT V CASESTUDY 9
Smart Lighting, Home Intrusion Detection, Smart Parking, Weather Monitoring, Reporting
System & Bot, Air Pollution Monitoring, Forest Fire Detection, Smart Irrigation, IoT Printer.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Analyze various protocols for IoT.
 Develop IoT application using scripting languages
 Design a portable IoT using Raspberry Pi
 Develop web services to access/control IoT devices.
 Analyze applications of IoT in real time scenario

TEXT BOOKS:
1. Internet of Things – A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547.

REFERENCES:
1. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O’Reilly
(SPD), 2014, ISBN: 9789350239759
2. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), ―Architecting the
Internet of Things‖, Springer, 2011
3. HonboZhou,―The Internet of Things in the Cloud: A Middleware Perspective, CRC
Press, 2012.
4. David Boyle, "From Machine-to-Machine to the Internet of Things -Introduction to a
New Age of Intelligence", Elsevier, 2014.

77
AD18511 DEEP LEARNING LABORATORY L T P C
0 0 4 2
OBJECTIVES
This course will develop the student's ability to
 Be familiarized with good programming design in Deep Learning.
 Getting exposure in implementing the different Convolution Neural Network (CNN)
Architecture.
 Get familiarized with sequential models

LIST OF EXPERIMENTS
1. Basic Exercises in Python .
2. Linear Regression - Generating the Dataset, Reading the Dataset, Initializing Model
Parameters, Defining the Model, Defining the Loss Function, Defining the Optimization
Algorithm, Training and Testing.
3. Perceptron model for a Toy dataset.
4. Softmax Regression - Initializing Model Parameters, Defining the Model, Defining
the Loss Function, Classification Accuracy, Model Training and Prediction.
5. Multi-layer Perceptron for image classification.
6. Edge Detection in Images.
7. Implementation of different kernels.
8. Handwritten digit recognition using LeNet architecture.
9. Application using AlexNet architecture.
10. Application using VGG architecture.
11. Application using GoogLeNet architecture.
12. Application using ResNet architecture.
13. Sequence Model for a Toy Example.
14. Recurrent Neural Network (RNN)
15. Long Short Term Memory (LSTM)
TOTAL: 60 PERIODS.

78
OUTCOMES:
At the end of the course, the student should be able to:

 Design and implement basic and advanced exercises in Python.

 Design and implement regression models.
 Apply the different CNN architectures to get AI-based solutions for various real-world
problems.
 Implement sequential model.
 Iimplement RNN and LSTM models for sequential classification.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone GPU desktops with Anaconda, pytorch packages: 30 Nos.

79
AD18512 INTERNET OF THINGS TOWARDS DATA L T P C
SCIENCE LABORATORY 0 0 4 2
OBJECTIVES
 The student should be made to build a simple IoT application and to perform the
predictive analysis on gathered data.
LIST OF EXPERIMENTS
1. Implement the following using Raspberry Pi
a. Peripheral interfacing with IoT kit
b. Working with LED, SWITCH and BUZZER
c. Motion Detection using PIR Sensor
d. Simulation of Traffic Light
e. Controlling LED intensity using PWM signal
2. Build an application for temperature measurement using DHT sensor.
3. Build an application for Object Distance measurement using Ultrasonic Sensor.
4. Build a mobile application using DHT, PIR, US sensors
5. Store, Retrieve and explore the data from the sensors(use above mentioned sensors)
to Cloud Environment. (ThingspeakIoT platform is used)
6. Implement a simple experiment using Relay Control
7. Installation of OS in Raspberry pi
8. Design GUI for capturing and analysing sensor data from IoT kit
9. Develop Video Surveillance application using IoT
10. A project to be implemented covering all IoT phases using Raspberry Pi / Arduino.

TOTAL: 60 PERIODS

OUTCOMES:

At the end of the course, the student should be able to:

 Create a simple IoT application
 Demonstrate the transmission of data between devices
 Design GUI for an application
 Install an OS in IoT device
 Perform analysis on data.

80
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
 Create a simple IoT application
 Perform analysis on data.
 Arduino Uno - 8 Nos
 Raspberry Pi - 1 No
 DHT sensor - 8 Nos
 PIR Sensor - 8 Nos
 Ultrasonic Sensor - 8 Nos
 Node MCU - 8 Nos
 A to B cable - 8 Nos
 LED
 USB cables
 Jumper Wires.

81
 INTERVIEW AND CAREER SKILLS L T P C
HS18561 LABORATORY 0 0 3 2
(Common to all branches except BT and EE)
OBJECTIVES
 To enable learners to build confidence and enhance their language proficiency.
 To expose learners to the use of professional English.
 To equip them with employability skills.
 To expose learners to build entrepreneurship skills.

UNIT I LISTENING AND SPEAKING SKILLS 12

Conversation Skills – Types - Small Talk, Face-to-Face and Telephonic, Formal and Informal
Conversations – Skills in presenting ideas and collating information during Conference Calls
(one –to-one and technical group / team) – Academic and Workplace Situations – Conversing
with Faculty/Visiting Faculty/Guests/Officials/Employers and Employees – Group
Discussion – Etiquette and Dos and Don’ts, Turn-taking –Presentation Skills – Seminars and
Projects using Digital Tools; Mock Interview – Etiquette and Dos and Don’ts – Audio-Visual
interface for enhancement of Listening and Speaking Skills.
UNIT II READING / SPEED READING, CRITICAL THINKING AND 12
WRITING SKILLS
Reading Comprehension – General and Scientific Texts/Articles/Case Studies from different
or relevant fields of study for analysis and critical thinking; Employability Skills – Writing
Job Applications – Cover Letter accompanying Résumé – Types of Business Letters and
Email Writing and Etiquette; Writing Reports – Statement of Purpose – Writing Articles for
Publication Style and Format – Creating Blogs or Company Profiles – Speed Reading of
Voluminous Reports / Documents and Exacting Necessary Information and Abstract
Preparation including Dissemination.

UNIT III ENGLISH FOR PROFESSIONAL EXAMINATIONS 12

Sentences, Paragraphs and Reading Comprehension – Vocabulary Building – General and
Technical Terms – Contextual Meaning – Spelling – Subject-Specific Words – Usage and
User-Specific Terminology.

82
 UNIT IV ENTREPRENEURSHIP SKILLS 9

Introduction to Entrepreneurship; Developing Leadership Qualities and Team Work; Goal

Setting and Real-Life Scenarios; Fundamentals of Entrepreneurial Skills – Marketing
Strategies - Microcosmic and Macrocosmic Levels of Product Sales and Survey – Sector /
Industry Appraisal and Appreciation (Review and Understanding State of the Nation /
Economy / Environment / Sector Reports Published) - Interaction & Understanding Role of
Multi-Lateral Financial / Institutional / Industrial Agencies such as World Bank, ADB,
UNDP, CII etc.
TOTAL (L:45): 45 PERIODS
TEACHING METHODS:
1. To be totally learner-centric with minimum teacher intervention as the course
revolves around practice.
2. Suitable audio/video samples from Podcast/YouTube to be used for illustrative
purposes.
3. Portfolio approach for writing to be followed. Learners are to be encouraged to
blog, tweet, text and email employing appropriate language.
4. GD/Interview/Role Play/Debate could be conducted off the laboratory (in a regular
classroom) but learners are to be exposed to telephonic interview and video
conferencing.
5. Learners are to be assigned to read/write/listen/view materials outside the
classroom as well for gaining proficiency and better participation in the class.
6. Learners to form team(s), select a module of external Industrial / Institutional
interaction and prepare a short thesis/project proposal.

OUTCOMES:
At the end of the course, learners should be able to
 Take international examination such as IELTS and TOEFL
 Make presentations and Participate in Group Discussions.
 Successfully answer questions in interviews

REFERENCES:
 Business English Certificate Materials, Cambridge University Press.
 Graded Examinations in Spoken English and Spoken English for Work downloadable
materials from Trinity College, London.
 International English Language Testing System Practice Tests, Cambridge University
Press.
 Interactive Multimedia Programs on Managing Time and Stress.
 Personality Development (CD-ROM), Times Multimedia, Mumbai.
83
WEB SOURCES:
http://www.slideshare.net/rohitjsh/presentation-on-group- discussion
http://www.washington.edu/doit/TeamN/present_tips.html
http://www.oxforddictionaries.com/words/writing-job- applications
http://www.kent.ac.uk/careers/cv/coveringletters.htm
http://www.mindtools.com/pages/article/newCDV_34.html

84
 SEMESTER VI
AD18601 CLOUD COMPUTING: TOOLS AND TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the concept of cloud and utility computing.
 Understand the various issues in cloud computing.
 Familiarize themselves with the lead players in cloud.
 Appreciate the emergence of cloud as the next generation computing paradigm.
 Setup a private cloud.

UNIT I INTRODUCTION 9
Introduction - Historical Development - Cloud Computing Architecture – The Cloud
Reference Model – Cloud Characteristics – Cloud Deployment Models: Public, Private,
Community, Hybrid Clouds - Cloud Delivery Models: IaaS, PaaS, SaaS – Open Source Private
Cloud Software: Eucalyptus, Open Nebula, Open Stack.

UNIT II VIRTUALIZATION 9
Data Center Technology - Virtualization - Characteristics of Virtualized Environments -
Taxonomy of Virtualization Techniques – Virtualization and Cloud Computing – Pros and
Cons of Virtualization - Implementation Levels of Virtualization - Tools and Mechanisms:
Xen, VMWare, Microsoft Hyper-V.

UNIT III CLOUD COMPUTING MECHANISM 9

Cloud Infrastructure Mechanism: Cloud Storage, Cloud Usage Monitor, Resource Replication
– Specialized Cloud Mechanism: Load Balancer, SLA Monitor, Pay-per-use Monitor, Audit
Monitor, Failover System, Hypervisor, Resource Cluster, Multi Device Broker, State
Management Database – Cloud Management Mechanism: Remote Administration System,
Resource Management System, SLA Management System, Billing Management System

UNIT IV HADOOP AND MAP REDUCE 9

Apache Hadoop – Hadoop Map Reduce – Hadoop Distributed File System- Hadoop I/O-
Developing a Map Reduce Application - Map Reduce Types and Formats - Map Reduce
Features– Hadoop Cluster Setup – Administering Hadoop.

85
UNIT V SECURITY IN THE CLOUD 9
Security Threats – Cloud Security Mechanism: Encryption, Hashing, Digital Signature, Public
Key Infrastructure, Identity and Access Management, Single Sign-on, Cloud Based Security
Groups, Hardened Virtual Server Images

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to
 Articulate the main concepts, key technologies, strengths and limitations of cloud
computing
 Identify the architecture, infrastructure and delivery models of cloud computing
 Explain the core issues of cloud computing such as security, privacy and
interoperability
 Choose the appropriate technologies, algorithms and approaches for the related issues
 Explain the security threats in cloud

TEXT BOOKS:
1. Thomas Erl, Zaigham Mahood, Ricardo Puttini, ―Cloud Computing, Concept,
Technology and Architecture, Prentice Hall, 2013.

REFERENCES:
1. Toby Velte, Anthony Velte, Robert C. Elsenpeter, ―Cloud Computing, A Practical
Approach, Tata McGraw-Hill Edition, 2010.
2. Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi, ―Mastering Cloud
Computing, Tata McGraw-Hill, 2013.
3. Arshdeep Bahga, Vijay Madisetti, ―Cloud Computing: A Hands-On Approach,
Universities Press, 2014.
4. Tom White, ―Hadoop: The Definitive Guide, O'Reilly Media, 4th Edition, 2015.
5. John Rittinghouse and James Ransome, Cloud Computing, Implementation,
Management and Strategy, CRC Press, 2010

86
AD18602 BIG DATA ANALYTICS AND VISUALIZATION L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the importance of big data analytics.
 Understand Hadoop architecture for processing big data.
 Understand Next Generation Databases like MongoDB and Cassandra.
 Know to program in MapReduce, Hive and Pig.
 Understand data visualization techniques for data analytics.

UNIT I INTRODUCTION TO BIG DATA ANALYTICS 9

Characteristics of Data, Evolution - Definition - Challenges - Why Big Data - Traditional
Business Intelligence (BI) versus Big Data - Big Data Analytics - Classification of Analytics -
Top Challenges Facing Big Data - Data Science - Few Top Analytics Tools.

UNIT II INTRODUCTION TO HADOOP 9

Introducing Hadoop - RDBMS versus Hadoop - Distributed Computing Challenges - History -
Overview - Use Case - Hadoop Distributors - HDFS (Hadoop Distributed File System) -
Processing Data with Hadoop - Managing Resources and Applications with Hadoop YARN -
Interacting with Hadoop Ecosystem

UNIT III INTRODUCTION TO MONGODB AND CASSANDRA 9

MongoDB - Introduction - Terms Used in RDBMS and MongoDB - Data Types - Query
Language. Cassandra - Introduction - Features - CQL Data Types- CQLSHKeyspaces - CRUD
(Create, Read, Update and Delete) Operations - Collections - Using a Counter - Time to Live
(TTL) - Alter Commands - Import and Export - Querying System Tables.

UNIT IV INTRODUCTION TO MAPREDUCE, HIVE, PIG 9

MapReduce - Mapper - Reducer - Combiner - Partitioner - Searching - Sorting - Compression.
Hive - Architecture - Data Types - File Format - Hive Query Language (HQL) -RCFile
Implementation - User-Defined Function (UDF). Pig - The Anatomy of Pig - Pig on Hadoop -
Pig Philosophy - Use Case for Pig: ETL Processing -Pig Latin Overview -Data Types-
Running Pig - Execution Modes of Pig - HDFS Commands - Relational Operators - Eval
Function - Complex Data Types - User-Defined Functions (UDF).

UNIT V DATA VISUALIZATION 9

Conceptual Framework for Data Visualization - Data, information, knowledge, and insight -
87
Transforming data into information - Visualization plots - The Gestalt principles of perception
- Best practices for visualization - Visualization tools in Python

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course, students will be able to
 Apply analytics to big data applications.
 Understand the hadoop frameworks.
 Use MongoDB and Cassandra for big data storage and retrieval.
 Work with hadoop ecosystem tools such as MapReduce, Hive, Pig.
 Visualize data to transform into information for further analysis.

TEXT BOOKS:
1. Seema Acharya, Subhashini Chellapan, “Big Data and Analytics”, Wiley
Publisher, 2015.
2. Kirthi Raman, “Mastering Python Data Visualization”, O’Reilly publisher, 2015.

REFERENCES:
1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.
2. Tom White “Hadoop: The Definitive Guide” Third Edition, O’Reilly Media, 2012

88
AD18603 NATURAL LANGUAGE PROCESSING L T P C
TECHNIQUES 3 0 0 3
OBJECTIVES

The Student should be made to:

 Learn the fundamentals of natural language processing (NLP)
 Understand the use of CFG and PCFG in NLP
 Understand the role of semantics of sentences and pragmatics
 Apply the NLP techniques to IR applications

UNIT I INTRODUCTION 9
Origins and challenges of NLP – Language Modeling: Grammar-based LM, Statistical LM –
Regular Expressions, Finite-State Automata – English Morphology, Transducers for lexicon
and rules, Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit Distance.

UNIT II WORD LEVEL ANALYSIS 9

Word level analysis - Unsmoothed N-grams, Evaluating N-grams, Smoothing, Interpolation
and Backoff – Word Classes, Part-of-Speech Tagging, Rule-based, Stochastic and
Transformation-based tagging, Issues in PoS tagging – Hidden Markov and Maximum
Entropy models.

UNIT III SYNTACTIC ANALYSIS 9

Syntactic analysis - Context-Free Grammars, Grammar rules for English, Treebanks,
Normal Forms for grammar – Dependency Grammar – Syntactic Parsing, Ambiguity,
Dynamic Programming parsing – Shallow parsing – Probabilistic CFG, Probabilistic CYK,
Probabilistic Lexicalized CFGs – Feature structures, Unification of feature structures.

UNIT IV SEMANTICS AND PRAGMATICS 9

Semantics and pragmatics - Requirements for representation, First-Order Logic, Description
Logics – Syntax-Driven Semantic analysis, Semantic attachments – Word Senses, Relations
between Senses, Thematic Roles, selectional restrictions – Word Sense Disambiguation, WSD
using Supervised, Dictionary & Thesaurus, Bootstrapping methods – Word Similarity using
Thesaurus and Distributional methods

UNIT V DISCOURSE ANALYSIS AND LEXICAL RESOURCES 9

Discourse analysis and lexical resources - Discourse segmentation, Coherence – Reference
Phenomena, Anaphora Resolution using Hobbs and Centering Algorithm – Coreference
89
Resolution – Resources: Porter Stemmer, Lemmatizer, Penn Treebank, Brill’s Tagger,
WordNet, PropBank, FrameNet, Brown Corpus, British National Corpus (BNC).

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course, students will be able to:
 Tag a given text with basic Language features
 Design an innovative application using NLP components
 Implement a rule based system to tackle morphology/syntax of a language
 Design a tag set to be used for statistical processing for real-time applications
 Compare and contrast the use of different statistical approaches for different types of
NLP applications.

TEXT BOOKS:
1. Daniel Jurafsky, James H. Martin, “Speech and Language Processing: An
Introduction to Natural Language Processing, Computational Linguistics and Speech”,
Pearson Publication, 2014.
2. Steven Bird, Ewan Klein and Edward Loper, “Natural Language Processing with
Python”, First Edition, OReilly Media, 2009.

REFERENCES:
1. Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook, Atlantic
Publisher, 2015.
2. Richard M Reese, ―Natural Language Processing with Java, OReilly Media, 2015.
3. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language
Processing, Second Edition, Chapman and Hall/CRC Press, 2010.
4. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information
Retrieval, Oxford University Press, 2008.

90
AD18604 COMPUTER VISION AND APPLICATIONS L T P C
3 1 0 4
OBJECTIVES
Students are made to:
 Understand the fundamental concepts of computer vision.
 Understand three-dimensional image analysis techniques.
 Understand motion analysis.
 Recognize applications of computer vision in real environments

UNIT I IMAGE PROCESSING FUNDAMENTALS 9+3

Introduction of Computer Vision- Basics of Image Formation-Geometric primitives and
transformation-Photometric image formation-Digital Camera- Image Transformation-2D
transformation-3D transformation-Fourier Transform-Convolution - Filtering-Image
Enhancement and Restoration-Thresholding techniques.

UNIT II FEATURE EXTRACTION AND IMAGE SEGMENTATION 9+3

Edge Detection-Canny-Roberts-Sobel -Line detectors- Hough transform-- Corner and Interest
Point Detection – Harris Detector – Local Invariant Feature Detectors and Descriptors-Harris
Scale and Affine-Hessian Scale and Affine-Invariant Detectors and Descriptors- SIFT -SURF
–Image Segmentation contours-Split and merge-mean shift.

UNIT III CAMERA CALIBRATION AND STEREO GEOMETRY 9+3

Camera Models– Direct Parameter Calibration – Extraction from Projection matrix- Stereopsis
– Correspondence Problem –RANSAC and Alignment - Epipolar Geometry.

UNIT IV 3D AND MOTION ANALYSIS 9+3

Motion field of rigid objects – Notation of Optical flow – Estimating motion field – Estimation
Motion Field – Horn and Schunck algorithm – Lucas and Kanade Algorithm – Using and
Evaluation of Motion field –3D reconstruction- Shape from Shading and photometric stereo-
shape from Texture-shape from focus- Locating objects from space

UNIT V PATTERN ANALYSIS AND APPLICATIONS 9+3

Interpretation trees- Invariants – Appearance and Shape based Classification – 3D object
modeling – Matching from Intensity Data – Matching from Range Data – Visual Recognition
– AdaBoost and Random Decision Forests

TOTAL (L:45,T:15): 60 PERIODS

OUTCOMES:

91
Upon completion of the course, students will be able to
 Apply the image transformation and enhancement techniques.
 Use suitable feature extraction and segmentation techniques.
 Recognize the geometric relations.
 Select suitable optical flow for motion field and methods for 3D reconstruction.
 Create 3D objects.

TEXT BOOKS:
1. R. Szeliski- “Computer Vision: Algorithms and Applications”- Springer 2011.

REFERENCES:
1. E. R. Davies- “Computer & Machine Vision”, Fourth Edition, Academic Press,2012.
2. Simon J. D. Prince- “Computer Vision: Models- Learning- and Inference”, Cambridge
University Press,2012.
3. Mark Nixon and Alberto S. Aquado, “Feature Extraction & Image Processing for
Computer Vision”, Third Edition

92
AD18611 COMPUTER VISION AND NATURAL LANGUAGE L T P C
PROCESSING LAB 0 0 4 2
OBJECTIVES
The student should be made to:
 Learn the fundamental concepts of Computer Vision to be familiar with the algorithms
and techniques to analyze and interpret the visible world around us.
 Be familiar with natural language text processing techniques.
 Be familiar with natural language speech processing techniques
LIST OF EXPERIMENTS
Develop a program to implement the following concepts
1. Image segmentation
2. Pattern Recognition
3. Motion Detection and Tracking
4. Edge Detection Techniques
5. Text pre-processing techniques.
a. Change into Lower Case
b. Remove Punctuations
c. Remove words and digits containing digits
d. Remove Stop words
e. Text Stemming and Lemmatization
6. Word Embedding techniques
7. Text Classification
8. Text Mining
9. Text to Speech Conversion
10. Speech to Text Conversion
11. Speech Classification
TOTAL: 60 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Implement the algorithms of computer vision that are used in Image Segmentation,
Detection and Tracking of moving objects, Pattern Classification and Edge detection.
 Analyse the various algorithms that are used in Image Segmentation, Detection and
Tracking of moving objects, Pattern Classification and Edge detection.
 Develop a program to pre-process and extract features of natural language
 Develop a program to classify Text/Speech and mining the text
 Develop a program for Text to Speech Conversion and Speech to Text Conversion
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone GPU desktops with Anaconda, pytorch packages: 30 Nos.

93
AD18612 CLOUD AND BIG DATA ANALYTICS L T P C
LABORATORY 0 0 4 2
OBJECTIVES
The Student should be made to:
 Be exposed to tool kits for cloud environment
 Learn to run virtual machines of different configuration
 To learn to implement and use parallel programming using Hadoop
 Set up and install Hadoop
 Develop the APIs to interact with Hadoop
LIST OF EXPERIMENTS
Use Eucalyptus or Open Nebula or equivalent to set up the cloud and demonstrate
1. Find procedure to run the virtual machine of different configuration. Check how many
virtual machines can be utilized at particular time.
2. Find procedure to attach virtual block to the virtual machine and check whether it holds
the data even after the release of the virtual machine.
3. Install a C compiler in the virtual machine and execute a sample program.
4. Install Google App Engine. Create hello world app and other simple web applications
using python/java.
5. Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not
present in CloudSim.
6. Find procedure to set up the one node Hadoop cluster
7. Implement the following file management tasks in Hadoop:
• Adding files and directories
• Retrieving files
• Deleting files
8. Write a program to use the API’s of Hadoop to interact with it.
9. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.
• Find the number of occurrence of each word appearing in the input
file(s)
• Performing a MapReduce Job for word search count (look for
specific keywords in a file).
10. Write a grep program to demonstrate the use of Map and Reduce tasks
TOTAL: 60 PERIODS

94
OUTCOMES:
At the end of the course, the student should be able to:
 Use Cloud open source Tools for managing cloud resources.
 Create virtual Machines using Eucalyptus
 Use GAE launcher and Google App Engine to launch Web applications.
 Set up and install Hadoop
 Manipulate large data sets in a parallel environment

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with Eucalyptus or Open Nebula or equivalent, Hadoop: 30 Nos

95
 SEMESTER VII
AD18701 COMPILER DESIGN TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand, design and implement a lexical analyzer.
 Understand, design and implement a parser
 Understand, design code generation schemes.
 Understand optimization of codes and runtime environment.

UNIT I INTRODUCTION TO COMPILING 9

Compilers – Analysis of the source program – Phases of a compiler – Cousins of the Compiler
– Grouping of Phases – Compiler construction tools - Lexical Analysis -Role of Lexical
Analyzer – Input Buffering – Specification of Tokens.

UNIT II SYNTAX ANALYSIS 9

Role of the parser –Writing Grammars –Context-Free Grammars – Top Down parsing -
Recursive Descent Parsing - Predictive Parsing – Bottom-up parsing - Shift Reduce Parsing –
Operator Precedent Parsing - LR Parsers - SLR Parser - Canonical LR Parser - LALR Parser.

UNIT III INTERMEDIATE CODE GENERATION 9

Intermediate languages – Declarations – Assignment Statements – Boolean Expressions – Case
Statements – Back patching – Procedure calls.

UNIT IV CODE GENERATION 9

Issues in the design of code generator – The target machine – Runtime Storage management–
Basic Blocks and Flow Graphs – Next-use Information – A simple Code generator – DAG
representation of Basic Blocks – Peephole Optimization.

UNIT V CODE OPTIMIZATION AND RUN TIME 9

ENVIRONMENTS
Introduction– Principal Sources of Optimization – Optimization of basic Blocks – Introduction
to Global Data Flow Analysis – Runtime Environments – Source Language issues – Storage
Organization – Storage Allocation strategies – Access to non-local names – Parameter Passing.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course, students will be able to

96
  Understand the major phases of compilation.
 Design and implement a prototype of compiler.
 Develop the parsers and experiments its design.
 Apply the various optimization techniques.
 Use the different compiler construction tools.

TEXT BOOKS:
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computations”, second Edition, Pearson Education, 2007.
2. Alfred Aho, Ravi Sethi and Jeffrey D Ullman, “Compilers Principles, Techniques and
Tools”, Second Edition, Pearson Education, 2013.

REFERENCES:
1. J. Martin, “Introduction to Languages and the Theory of computation” Third Edition,
Tata Mc Graw Hill, 2007.
2. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition,
Narosa Publishers, New Delhi, 2002.
3. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata
Theory and Computation”, Pearson Education 2009.
4. Randy Allen, Ken Kennedy, “Optimizing Compilers for Modern Architectures: A
Dependence- based Approach”, Morgan Kaufmann Publishers, 2002.
5. Steven S. Muchnick, “Advanced Compiler Design and Implementation, “Morgan
Kaufmann Publishers - Elsevier Science, India, Indian Reprint 2003.
6. Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, Pearson
Education, 20081

97
CS18702 CYBER SECURITY AND ETHICAL HACKING L T P C
3 1 0 4
OBJECTIVES
The student should be made to:
 Acquire fundamental knowledge on the concepts of cyber security and Ethical Hacking
 understand cyber-attack, types of cybercrimes, cyber laws
 Demonstrate the techniques for system hacking
 Detect and prevent the security attacks in different environments

UNIT I CYBER SECURITY FUNDAMENTALS 9+3

Network and Security Concepts : Information Assurance Fundamentals -Basic Cryptography:
Symmetric Encryption- Public Key encryption – DNS -Firewalls – Virtualization -Radio
Frequency Identification – Microsoft Windows Security Principles – Windows programs
Execution – Windows Firewall

UNIT II TECHNIQUES AND ATTACKS MOTIVATIONS 9+3

Proxies and its use- Tunneling Techniques – Fraud Techniques – Threat Infrastructure-
Exploitation : Techniques to gain a Foothold -Shellcode – SQL Injection – Malicious PDF
files- Race conditions – Web based Exploits- DOS conditions - Brute force and Dictionary
attacks

UNIT III MALICIOUS CODE AND DEFENSE TECHNIQUES 9+3

Self-Replicating Malicious code – Evading detection and Elevating Privileges – Rootkits –
Spyware -Token Kidnapping – Virtual Machine detection – Defense techniques : Memory
Forensics – Honey pots – Malicious code Naming – Automated Malicious Code Analysis
System- Intrusion Detection System

UNIT IV INTRODUCTION TO ETHICAL HACKING 9+3

Security Fundamental, Security testing, Hacker and Cracker, Descriptions, Test Plans-keeping
It legal, Ethical and Legality – Technical Foundations of Hacking : The attacker’s process –
The Ethical Hacker’s Process – Security and the Stack - OSI Model – Anatomy of TCP/IP
protocols – Foot printing and Scanning - Enumeration and System Hacking. - Sniffers,
Session Hijacking, and Denial of Service.

UNIT V HACKING TECHNIQUES 9+3

Web Server Hacking, Web Application Hacking, Database Hacking- Wireless Technologies,
Mobile Security and Attacks- Cloud Computing and Botnets.

TOTAL (L:45,T:15): 60 PERIODS

98
OUTCOMES:

After learning the course the students should be able to

 Understand cyber-attack, types of cybercrimes, cyber laws
 How to protect them self and ultimately society from such attacks
 Describe and understand the basics of the ethical hacking
 Demonstrate the techniques for system hacking
 Detect and prevent the security attacks in different environments

TEXT BOOKS:
1. Cyber Security Essentials ,(2011), James Graham , Richard Howard, Ryan Olson, CRS
Press , Taylor & Francis Group, New York.
2. Certified Ethical Hacker, Version 9, Second Edition, Michael Gregg, Pearson IT
Certification

REFERENCES:
1. Anti- Hacker Tool Kit (Indian edition) , Mike Sherma , McGraw Hill publication
2. Hacking the Hacker, Roger Grimes, Wiley
3. The Unofficial Guide to Ethical Hacking, Ankit Fadia, Premier Press

99
AD18702 REINFORCEMENT LEARNING L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand reinforcement learning tasks
 Learn Markov decision processes, and Bellman expectation equations
 Learn Monte Carlo metods for model free prediction
 Understand various function approximation tasks
 Know the policy gradient methods

UNIT I INTRODUCTION 9
Origin and history of Reinforcement Learning research, Applications; Probability Primer -
Probability concepts - Axioms of probability, concepts of random variables, PMF, PDFs,
CDFs, Expectation. Concepts of joint and multiple random variables, joint, conditional and
marginal distributions. Correlation and independence.

UNIT II MARKOV DECISION PROCESS 9

Introduction to RL terminology, Markov property, Markov chains, Markov reward process
(MRP). Introduction to and proof of Bellman equations for MRPs along with proof of
existence of solution to Bellman equations in MRP. Introduction to Markov decision process
(MDP), state and action value functions, Bellman expectation equations, optimality of value
functions and policies, Bellman optimality equations.

UNIT III MONTE CARLO METHODS FOR MODEL FREE 9

PREDICTION AND CONTROL
Overview of Monte Carlo methods for model free RL, First visit and every visit Monte Carlo,
Monte Carlo control, On policy and off policy learning, Importance sampling, TD Methods -
Incremental Monte Carlo Methods for Model Free Prediction, Overview TD(0), TD(1) and
TD(λ), k-step estimators, unified view of DP, MC and TD evaluation methods, TD Control
methods - SARSA, Q-Learning and their variants.

UNIT IV FUNCTION APPROXIMATION METHODS 9

Getting started with the function approximation methods, Revisiting risk minimization,
gradient descent from Machine Learning, Gradient MC and Semi-gradient TD(0) algorithms,
Eligibility trace for function approximation, Afterstates, Control with function approximation,
Least squares, Experience replay in deep Q-Networks.

UNIT V POLICY GRADIENTS 9

Getting started with policy gradient methods, Log-derivative trick, Naive REINFORCE
100
algorithm, bias and variance in Reinforcement Learning, Reducing variance in policy gradient
estimates, baselines, advantage function, actor-critic methods.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Prove the axioms of probability
 Define the significant features of reinforcement learning and derive Bellman equations
 Apply Monte Carlo Methods for Prediction and Control for RL tasks
 Approximate solutions using deep-Q networks
 Apply policy gradients for various applications

TEXT BOOKS:
1. Richard S. Sutton and Andrew G. Barto, "Reinforcement learning: An introduction",
Second Edition, MIT Press, 2019
2. Alberto Leon-Garcia, Probability, Statistics, and Random Processes for Electrical
Engineering", 3rd Edition
3. Kevin P. Murphy, Machine Learning: A Probabilistic Perspective

REFERENCES:
1. Li, Yuxi. "Deep reinforcement learning." arXiv preprint arXiv:1810.06339 (2018).
2. Wiering, Marco, and Martijn Van Otterlo. "Reinforcement learning." Adaptation,
learning, and optimization 12 (2012)

101
AD18712 CYBER SECURITY LABORATORY L T P C
0 0 4 2
OBJECTIVES
The student should be made to:
• Learn to implement the Symmetric and Asymmetric Encryption algorithms.
• Know about the devices and components in a wireless network
• Know how to setup a firewall on Operating System
• Understand the security and privacy features and operation of browsers.
• Identify different types of Web Application Vulnerability
LIST OF EXPERIMENTS
1. Implementation of Classical Symmetric Encryption Techniques
a)Substitution Ciphers
i. Implementation of Caesar Cipher using c/c++/Java
ii. Implementation of Vigenere Cipher using c/c++/Java
iii. Implementation of one time pad algorithm using c/c++/Java
b) Transpositional Ciphers
i. Implementation of Rail fence using c/c++/Java
ii. Implementation of row & Column Transformation cipher using
c/c++/Java
2. Implementation of SDES Algorithm using c/c++/Java
3. Implementation of RSA Algorithm using c/c++/Java
4. Implementation of Diffiee-Hellman Exchange Algorithm using c/c++/Java.
5. Study of different wireless network components and features of any one of the Mobile
Security Apps.
6. Study of the features of firewall in providing network security and to set Firewall
Security in windows.
7. Steps to ensure Security of any one web browser (Mozilla Firefox/Google Chrome)
8. Study of different types of vulnerabilities for hacking a websites / Web Applications.
9. Analysis the Security Vulnerabilities of E-commerce services.
10. Analysis the security vulnerabilities of E-Mail Application
TOTAL: 60 PERIODS

102
OUTCOMES:

At the end of the course, the student should be able to:

 Implement the encryption algorithms of Symmetric and Asymmetric techniques.
 Configure the various wireless network components and windows firewall.
 Analyze the security of web browsers.
 Identify the vulnerability of E-commerce and E-Mail applications.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

C / C++ / Java or equivalent compiler, Microsoft Windows 8 or later.

HARDWARE:
 Standalone desktops – 30 Nos. (or) Server supporting 30 terminals or more

103
AD18713 REINFORCEMENT LEARNING LABORATORY L T P C
0 0 4 2
OBJECTIVES
This course will develop the student's ability to
 Be familiarized with good programming design in Reinforcement Learning.
 Getting exposure in implementing the different Reinforcement algorithms
LIST OF EXPERIMENTS
1. Write a program for policy iteration and re-solve Jack’s car rental problem
2. Implement value iteration for the gambler’s problem
3. Write a program to implement first-visit MC policy evaluation
4. Write a program to generate random walks using simple Markov process
5. Write a program to construct a transition table for recycling Robot
6. Write a program to implement TIC TAC TOE problem
7. Write a program to implement on-policy TD control algorithm
8. Write a program to implement off-policy TD control algorithm
9. Write a program to implement Windy Gridworld with King’s Moves
10. Write a program to implement on line tabular TD
TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to
 Design and implement different Reinforcement algorithms
 Implement Monte Carlo methods
 Implement Markov decision processes
 Design and implement various gaming problems
 Design policy control algorithms

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone GPU desktops with Anaconda, pytorch packages: 30 Nos.

104
 List of Electives
Professional Elective II & III (Offered in ODD Semester)
AD18001 ADVANCED DATABASE CONCEPTS L T P C
3 0 0 3
OBJECTIVES
Students will be made to
 Learn the fundamentals of data models and to depict a relational database design using
ER diagram.
 Know the fundamental concepts of transaction processing with concurrency control
techniques and recovery isolation levels.
 Learn about the internal storage structures using different file and indexing techniques
which will help in physical DB design.
 Gain a fundamental knowledge about object oriented Databases with complex data
types
 Learn the emerging technologies like XML, Mobile, Multimedia, Spatial and
Temporal Databases

UNIT I RELATIONAL DATABASES 9

Purpose of Database System -– Views of data – Data Models – Database System Architecture
– Introduction to relational databases - Relational Model – Keys – Relational Algebra –
Relational Calculus – Entity-Relationship Model – E-R Diagrams – Functional Dependencies
– Non-loss Decomposition – Functional Dependencies – First, Second, Third Normal Forms,
Dependency Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and
Fourth Normal Form – Join Dependencies and Fifth Normal Form

UNIT II TRANSACTION PROCESSING 9

Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery – Media
Recovery – Two Phase Commit -- Save Points – Concurrency – Need for Concurrency –
Locking Protocols – Two Phase Locking – Deadlock – Recovery Isolation Levels

UNIT III IMPLEMENTATION TECHNIQUES 9

Overview of Physical Storage Media – RAID – File Organization – Organization of Records
in Files – Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files –
Static Hashing – Dynamic Hashing

UNIT IV OBJECT ORIENTED DATABASES 9

Overview – Complex data types – structured types and Inheritance in SQL – Table
Inheritance-Array and Multiset Types in SQL-Object Identity and Reference Types in SQL-
Implementing O-R Features – Persistent Programming Languages – Object Oriented Vs
Object Relational Databases.

UNIT V SPECIALTY DATABASES 9

105
XML Databases: XML Data Model – DTD – XML Schema – XML Querying – Web
Databases – Mobile Databases – Multimedia Databases – Spatial and Temporal Databases

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 To design database schema models with constraints using E-R modeling and apply
normalization techniques over it.
 To manage the transactions carried out in a database.
 To analyze the indexing and hashing techniques in database structure.
 To design and implement object oriented and object relational databases.
 To design and implement database for real world applications.

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ― Database System Concepts,
Seventh Edition, Tata McGraw Hill, 2019.Book 2

REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systems,
Sixth Edition, Pearson Education, 2010.
2. C.J. Date, A. Kannan, S. Swamynathan, ― An Introduction to Database Systems,
Eighth Edition, Pearson Education, 2006.

106
AD18003 AI IN ROBOTICS L T P C
3 0 0 3
OBJECTIVES
The students should be made to:
 Leverage fundamentals of AI and Robotics
 Object Recognition
 Speech Recognition
 Search Algorithms
 Artificial Personality to Robot

UNIT I THE BASIC PRINCIPLE OF ROBOTICS AND AI 9

What is AI, Examples, Artificial intelligence and advanced robotics techniques, Introducing
the robot and our development environment, Software components (ROS, Python, and
Linux), Robot control systems and a decision-making framework and The robot control
system.

UNIT II SETTING UP YOUR ROBOT 9

Robot anatomy, Subsumption architecture, Software setup - Laptop preparation, Installing
Python, Installing ROS on the laptop, Setup of Raspberry Pi 3; Hardware - Assembling the
tracks, Mounting the tracks, Arm base assembly (turntable) and Wiring.

UNIT III OBJECT RECOGNITION 9

The image recognition process - Image processing, Convolution, Artificial neurons, The
convolution neural network process, Build the toy/not toy detector, Using the neural
network, Picking Up The Toys - Task analysis, Teaching the robot arm - action state
reinforcement learning, Q-learning implementation, indexed states and actions, Genetic
algorithms; Other robot arm machine-learning approaches - Google SAC-X, Amazon
Robotics Challenge; Avoiding the Stairs – SLAM.

UNIT IV ROBOT SPEECH RECOGNITION 9

Robot speech recognition – Speech to text, Mycroft hardware and software, Telling and
Receiving jokes.

107
UNIT V SEARCH ALGORITHMS AND ARTIFICIAL PERSONALITY 9
Putting Things Away - Decision trees, Entropy, One hot encoding, Grid searching and A*, D*,
GPS path finding; Artificial Personality - The Turing test, An emotion state machine, Playing
the emotion game, Creating a model of human behavior, Integrating artificial personality into
robot, The robot emotion engine, The human emotion model.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Apply simulation techniques to give your robot an artificial personality
 Understand object recognition using neural networks and supervised learning Techniques
 Apply the techniques to listen using NLP via an expert system
 Use machine learning and computer vision to train the robot to avoid obstacles
 Understand path planning, decision trees, and search algorithms in order to enhance your
robot

TEXT BOOKS:
1. Francis X. Govers, “Artificial Intelligence for Robotics: Build intelligent robots that
perform human tasks using AI techniques”, Packt Publishing, 2018

REFERENCES:
1. Murphy, R. R. Introduction to AI robotics. MIT press, 2019

108
AD18005 BITCOIN AND BLOCKCHAIN TECHNOLOGY L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand how blockchain systems
 Securely interact with block chain systmes
 Design, build, and deploy smart contracts and distributed applications
 Integrate ideas from blockchain technology into real time projects

UNIT I INTRODUCTION 9
Distributed Database, Two General Problem, Byzantine General problem and Fault
Tolerance, Hadoop Distributed File System, Distributed Hash Table, ASIC resistance,
Turing Complete. Cryptography: Hash function, Digital Signature - ECDSA, Memory Hard
Algorithm, Zero Knowledge Proof.

UNIT II BLOCKCHAIN 9
Blockchain introduction, Advantage over conventional distributed database, Blockchain
Network, Mining Mechanism, Distributed Consensus, Merkle Patricia Tree, Gas Limit,
Transactions and Fee, Anonymity, Reward, Chain Policy, Life of Blockchain application, Soft
& Hard Fork, Private and Public blockchain

UNIT III DISTRIBUTED CONSENSUS 9

Distributed Consensus, Nakamoto consensus, Proof of Work, Proof of Stake, Proof of Burn,
Difficulty Level, Sybil Attack, Energy utilization and alternate

UNIT IV CRYPTOCURRENCY 9
Cryptocurrency, History, Distributed Ledger, Bitcoin protocols - Mining strategy and
rewards, Ethereum Construction, DAO, Smart Contract, GHOST, Vulnerability, Attacks,
Sidechain, Namecoin.

UNIT V BLOCK CHAIN REGULATION AND APPLICATIONS 9

Cryptocurrency Regulation, Stakeholders, Roots of Bit coin, Legal Aspects-Crypto currency
Exchange, Black Market and Global Economy. Applications: Internet of Things, Medical
Record Management System, Domain Name Service and future of Blockchain.

TOTAL (L:45): 45 PERIODS

OUTCOMES:

Upon completion of the course, students will be able to

109
  Understand the types, benefits and limitation of blockchain.
 Explore the blockchain decentralization and cryptography concepts
 Enumerate on the Bitcoin features and its alternative options.
 Describe and deploy the smart contracts
 Summarize and apply the regulations outside of currencies in real world digital
markets

TEXT BOOKS:
1. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven
Goldfeder, Bitcoin and Cryptocurrency Technologies: A Comprehensive
Introduction, Princeton University Press (July 19, 2016)

REFERENCES:
1. Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies
2. Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System
3. DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction
Ledger,”Yellow paper.2014.
4. Nicola Atzei, Massimo Bartoletti, and TizianaCimoli, A survey of attacks on
Ethereum smart contracts

110
AD18007 HEALTHCARE ANALYTICS L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the structured and unstructured clinical data
 Learn the descriptive and prediction models for healthcare systems.
 Know various e-health technologies and illustrate the e-health systems.
 Understand visualization techniques and apply for healthcare analytics
 Analyze NLP and IR techniques to implement in health care models

UNIT I HEALTHCARE DATA SOURCES AND STANDARDS 9

Introduction to Healthcare Analytics- Data Sources-Data Types-Electronic Health Records
(EHR) - Components of EHR-Standards for EHR-Coding Systems-Benefits of EHR-Barriers
and Challenges of using EHR Data-Phenotyping Algorithms - Clinical Document
Architecture-Aims and objectives of CDA-Levels of CDA- CDA identifiers- Design of a CDA
document- Introduction-DICOM and other standards-Biomedical Imaging Modalities.

UNIT II E-HEALTH DATA SOURCE AND TECHNOLOGIES 9

Data Model – Hierarchical-Relational Schema-Star Schema - Body Area Networks- Mobile
Health Technologies -Social Networks on Healthcare-Cloud Computing on e-Health-Security
and Privacy in e-Health Applications over the Cloud. Case Study: Descriptive Model for
Point-of Care.

UNIT III PREDICTION MODELS 9

Basic Statistical Prediction Models -Alternative Clinical Prediction Models -Survival Models
Predictive Models for Integrating Clinical and Genomic Data-Visual Analytics in Healthcare
Case Study on in-patient quality healthcare delivery -Case Study on early identification of a
disease from clinical data.

UNIT IV BIO-SIGNAL AND BIO-MEDICAL IMAGE ANALYSIS 9

Mining of Sensor Data in Healthcare - Biomedical signals Analysis-Image Segmentation-
Image Registration-Feature Extraction- Computer-Assisted Medical Image Analysis Systems.
Mobile Imaging and Analytics for Biomedical Data-Case study: Identification of retinopathy

111
UNIT V ADVANCED DATA ANALYTICS FOR HEALTHCARE 9
Natural Language Processing for Clinical Text Mining- Temporal Data Mining for Healthcare
Data- Information Retrieval for Healthcare- Genomic Data Analysis-Case Study: Gene
Expression data analysis in cloud.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Identify various types of clinical data and clinical standards.
 Select appropriate e-technologies for healthcare systems.
 Explain descriptive model for a given real time healthcare applications.
 Use signal processing methods to analyse medical images
 Design a suitable prediction model for real time healthcare analytics.

TEXT BOOKS:
1. Joel J.P.C. Rodrigues, Sandra, Isabel de la Torre Díez, “e-Health Systems: Theory and
Technical Applications”, ISTE Press and Elsevier,2016.
2. Chandan K. Reddy, Charu C. Aggarwal, “Healthcare Data Analytics”, CRC
Press,2015.

REFERENCES:
1. Nilanjan Dey Amira S. Ashour Simon James Fong Chintan Bhatt, “Healthcare Data
Analytics and Management”, Academic Press,2019.

112
AD18009 HUMAN COMPUTER INTERACTION L T P C
3 0 0 3
OBJECTIVES
The students should be made to:
 Explain how to use design and evaluation techniques for developing successful
interactive technologies
 Demonstrate, through many examples, the cognitive, social and affective issues that
underpin the design of these technologies.
 Provides thought-provoking design dilemmas and interviews with expert designers and
researchers.
 Uses a strong pedagogical format to foster understanding and enjoyment.

UNIT I FOUNDATIONS OF HCI 9

The Human: I/O channels, Human Memory, Reasoning and problem solving; The computer:
Devices, Memory, Processing and networks; The Interaction: Models of interaction,
Frameworks and HCI, Ergonomic, Interaction styles, Elements of the WIMP Interface,
Interactivity; Paradigms – Paradigms for Interaction.

UNIT II DESIGN & SOFTWARE PROCESS 9

Interactive Design basics – Process of Design, Scenarios, Navigation design, Screen design
and layout, Iteration and prototyping; HCI in the software process – Software life cycle,
Usability engineering, Prototyping in practice, Design rationale; Design rules – Principles to
support usability, Standards, Guidelines, Golden rules and Heuristics, HCI Patterns

UNIT III COGNITIVE MODELS 9

Cognitive Aspects – Cognition, Cognitive Frameworks; Social Interaction – Being Social,
Face-to-face Conversations, Remote Conversations, Co-presence, Social Engagement;
Emotional Interaction - Emotions and the User Experience, Expressive Interfaces and
Emotional Design, Annoying Interfaces, Affective Computing and Emotional AI, Persuasive
Technologies and Behavioral Change, Anthropomorphism.

UNIT IV INTERACTION STYLES AND DATA INTERPRETATION 9

Interfaces – Interface Types, Natural User Interfaces and Beyond; Data Gathering – Five Key
Issues, Data Recording, Interviews, Questionnaires, Observation; Data Analysis,
Interpretation, and Presentation - Quantitative and Qualitative, Tools to Support Data
Analysis, Interpreting and Presenting the Findings; Data at Scale - Approaches to Collecting
and Analyzing Data, Visualizing and Exploring Data and Ethical Design Concerns

113
UNIT V EVALUATION STUDIES 9
Introducing Evaluation - Types of Evaluation, Evaluation Case Studies; Evaluation Studies:
Usability Testing, Conducting Experiments, Field Studies; Inspections: Heuristic Evaluation
and Walk-Throughs, Analytics and A/B Testing, Predictive Models.

TOTAL (L:45): 45 PERIODS

OUTCOMES:

At the end of the course, the student should be able to:

 Apply design and evaluation techniques for developing successful interactive
technologies.
 Demonstrate the cognitive, social and affective issues that underpin the design of
these technologies for various applications.
 Use a strong pedagogical format to foster understanding and enjoyment.
 Apply various interaction styles to interpret data
 Evaluate predictive models using different types of evaluation

TEXT BOOKS:
1. Helen Sharp, Jennifer Preece, Yvonne Rogers, Interaction Design: Beyond Human-
Computer Interaction, 5th Edition, Wiley, 2019.
2. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, Human Computer
Interaction, 3rd Edition, Pearson Education, 2004

REFERENCES:
1. B. Shneiderman; Designing the User Interface, Addison,2012

114
AD18011 KERNEL METHODS FOR PATTERN ANALYSIS L T P C
3 0 0 3
OBJECTIVES
Students are made to:
 To provide the broad spectrum of problem formulations for kernel-based unsupervised
and supervised learning methods
 To show the mapping from the original vector space to the kernel-induced intrinsic
vector space
 To cover conventional unsupervised learning models for cluster discovery.
 To introduce Kernel ridge regressors and variants.
 To introduce Support Vector Machines and variants

UNIT I MACHINE LEARNING AND KERNEL SPACES 9

Introduction; Feature representation and dimension reduction: Feature representation in
vector space-Conventional similarity metric Euclidean inner product; The learning subspace
property (LSP) and kernelization of learning models: The LSP-Kernelization of the
optimization formulation for learning models; Generalized inner products and kernel
functions.

UNIT II KERNEL-INDUCED VECTOR SPACES 9

Introduction - Mercer kernels and kernel induced similarity metrics; Training data
independent intrinsic feature vectors; Training data dependent empirical feature vectors; The
kernel-trick for non-vectorial data analysis.

UNIT III FEATURE SELECTION AND UNSUPERVISED LEARNING 9

Principal Component Analysis and Kernel Principal Component Analysis; Feature Selection;
Unsupervised learning models for cluster Analysis: Unsupervised learning for cluster
discovery-Kernel methods for cluster analysis

UNIT IV KERNEL RIDGE REGRESSORS AND VARIANTS 9

Kernel-based regression and regularization analysis: Linear least squares error analysis-
Kernel based regression analysis-Regularization via radial basis functions (RBF) networks.

UNIT V SUPPORT VECTOR MACHINES AND VARIANTS 9

Support vector machines (SVM): Introduction-Linear support vector machines; SVM with
fuzzy separation; Kernel based support vector machines; Empirical space SVM for trimming
115
of training vectors; Support vector learning models for outlier detection

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of this course, the students should be able to
 Represent features for any application and reduce dimension.
 Come up with new kernel functions that satisfy Mercer theorem.
 Learn kernels for unsupervised methods.
 Experiment kernel regressors for various applications.
 Learn models for classification problems using SVMs.

TEXT BOOKS:
1. Kung SY. Kernel methods and machine learning. Cambridge University Press; 2014.

REFERENCES:
1. Cristianini N, Shawe-Taylor J. An introduction to support vector machines and other
kernel-based learning methods. Cambridge university press; 2000 Mar 23.
2. Schölkopf B, Smola AJ, Bach F. Learning with kernels: support vector machines,
regularization, optimization, and beyond. MIT press; 2002.

116
CS18007 INFORMATION RETRIEVAL TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Learn the various information retrieval models.
 Be familiar with Web Search Engine.
 Be exposed to Link Analysis, Search in mobile web and social networks
 Understand Hadoop and Map Reduce.
 Learn document text mining techniques.

UNIT I INTRODUCTION TO INFORMATION RETRIEVAL 9

Introduction - History of IR- Components of IR - Issues – Open source Search engine Frameworks -
The impact of the web on IR - IR Versus Web Search - Components of a Search engine - Crawls and
Feeds – Crawling the Web - Crawling Documents and Email – Document Feeds.

UNIT II INFORMATION RETRIEVAL MODELS 9

Boolean and vector-space retrieval models- Term weighting - TF-IDF weighting- cosine similarity –
Preprocessing - Inverted indices - efficient processing with sparse vectors – Language Model based
IR - Probabilistic IR – Latent semantic indexing- Relevance feedback and query expansion.

UNIT III WEB SEARCH ENGINE – CRAWLING AND NAVIGATION 9

Web search overview, web structure, Information seeking on the web, Link Analysis, Content
Relevance – Link-based Metrics, Evaluating search engines – Different types of search engines –
Search Engine Advertising – Metasearch – Hadoop and Map Reduce- Personalization – Question
Answering on the Web, Image search - Special Purpose Search Engines - Web Browsing and
Navigation - Navigation Tools - Navigational Metrics - Web Data Mining and algorithms.

UNIT IV SEARCH IN MOBILE WEB AND SOCIAL NETWORKS 9

The Mobile Web - The Paradigm of Mobile Computing - Mobile Web Services - Mobile Device
Interfaces - The Navigation Problem in Mobile Portals - Mobile Search - Social Networks –
Introduction - Social Network Analysis - Collaborative Filtering – Weblogs - Searching in Social
Networks - Social Tagging and Bookmarking - Opinion Mining.

UNIT V DOCUMENT TEXT MINING 9

Text Mining -Text classification and clustering - Categorization algorithms: Naive Bayes; decision
trees; and nearest neighbour - Clustering algorithms: agglomerative clustering; k-means; expectation
maximization (EM) – SVM classifier.

TOTAL (L:45): 45 PERIODS

117
OUTCOMES:
 Students will be able to apply information retrieval models.
 Students will be able to understand the basic concepts and techniques in Information
Retrieval
 Students will be able to understand how statistical models of text can be used for other IR
applications, for example clustering and news aggregation
 Students will gain the skill to build a document retrieval system, through the practical
sessions, including the implementation of a relevance feedback mechanism
 Students will be able to apply document text mining techniques.

TEXT BOOKS:
1. Bruce Croft, Donald Metzler and Trevor Strohman, Search Engines: Information Retrieval in
Practice, 1st Edition Addison Wesley, 2009
2. C. Manning, P. Raghavan, and H. Schutze, Introduction to Information Retrieval, Cambridge
University Press, 2008.
3. Mark Levene, An Introduction to Search Engines and Web Navigation, 2nd Edition Wiley,
2010.

REFERENCES:
1. Stefan Buettcher, Charles L. A. Clarke, Gordon V. Cormack, Information Retrieval:
Implementing and Evaluating Search Engines, The MIT Press, 2010.
2. Ophir Frieder “Information Retrieval: Algorithms and Heuristics: The Information Retrieval
Series”, 2nd Edition, Springer, 2004.
3. Manu Konchady, “Building Search Applications: Lucene, Ling Pipe”, and First Edition,
Gate Mustru Publishing, 2008.

118
 CS18017 RESOURCE MANAGEMENT TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
 The student should be familiar with the basic resource management techniques
 The student should learn to solve problems in linear programming and Integer
programming and be exposed to CPM and PERT
 The student should be familiar to use the queuing model

UNIT I LINEAR PROGRAMMING MODELS 9

Mathematical Formulation - Graphical Solution of linear programming models – Simplex method
– Artificial variable Techniques- Variants of Simplex method.

UNIT II INTEGER PROGRAMMING MODELS 9

Formulation – Gomory’s IPP method – Gomory’s mixed integer method – Branch and bound
technique.

UNIT III TRANSPORTATION AND ASSIGNMENT MODELS 9

Mathematical formulation of transportation problem- Methods for finding initial basic feasible
solution – optimum solution - degeneracy – Mathematical formulation of assignment models –
Hungarian Algorithm – Variants of the Assignment problem

UNIT IV SCHEDULING BY PERT AND CPM 9

Network Construction – Critical Path Method – Project Evaluation and Review Technique –
Resource Analysis in Network Scheduling

UNIT V QUEUING MODELS 9

Characteristics of Queuing Models – Poisson Queues - (M / M / 1) : (FIFO / α /α), (M / M / 1) :
(FIFO / N / α), (M / M / C) : (FIFO / α / α), (M / M / C) : (FIFO / N / α) models.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
On the completion of the course
 Students will be able to formulate linear programming (LP) models and solve the
problems using appropriate methods.
 Students will be able to construct a linear integer programming model and discuss the
methods to solve it.
 Students will be able to produce optimized solutions for transportation and assignment
models.
 Students will be able to apply CPM and PERT techniques constructively to make
effective business decisions and resource mapping.
119
  Students will be able to develop mathematical skills to solve queuing models arising from
a wide range of applications.

TEXT BOOKS:
1. Taha H.A., “Operations Research : An Introduction “ 7th Edition, Pearson Education, 2004.

REFERENCES:
1. A.M. Natarajan, P. Balasubramani, A. Tamilarasi, “Operations Research”, Pearson
Education, Asia, 2005.
2. Prem Kumar Gupta, D.S. Hira, “Operations Research”, S.Chand & Company Ltd, New
Delhi, 3rd Edition , 2003.

120
 L T P C
SOFTWARE PLANNING AND PROJECT
CS18023
MANAGEMENT 3 0 0 3
OBJECTIVES:
Students can able to,
 Understand how to Estimate project cost and perform cost-benefit evaluation among
projects
 Understand project scheduling activities network analysis and risk management
 Understand how to apply schedule and cost control techniques for project monitoring
including contract management
 Understand the different quality models in software projects for maintaining software
quality and reliability.
 Understand and use suitable project organization structure, leadership, decision and
motivation styles, proper safety and ethical practices and be responsible to the society

UNIT I PROJECT EVALUATION & EVALUATION TECHNIQUES 9

Software Project Definitions Software Project Categorization, Software VS other projects,
Stakeholders, Project Success and Failure, Software project Activities, Practices & Standards,
Selecting Process Models, software maintenance model - Estimation & Evaluation
Techniques: Business Case & Cost Benefit Analysis, Cash Flow Forecasting, Cost-Benefit
Evaluation Techniques-Risk Analysis for Project Evaluation, Program management, Project
effort and cost estimation; Basis of estimation, Estimation method categorization, SLOC,
Analogy, Delphi technique, FP Analysis, COCOMO II, Staffing pattern.

UNIT II PROJECT PLANNING AND RISK MANAGEMENT 9

Project Planning: Stepwise planning, Identification of Project product and activities (PBS &
PFD), Activity based approach (WBS), Sequencing and Scheduling of Activities, Precedence
Network Diagram: AON and AOA conventions, Network Planning, CPM technique- Risk
Management: Nature and Types of Risks, Risk Management framework, Hazard
Identification, Hazard Analysis, Risk Planning and Control, Schedule Risk, PERT Technique

UNIT III PROJECT MONITORING AND CONTROL 9

Schedule and Cost Monitoring Collecting Data & Reporting, Graphical Visualization
techniques, Cost Monitoring, Earned Value analysis, Requirements management, Change
Control - Contract Management: Types of Contracts, Stages in Contract Placement, Typical
Terms of a Contract, Contract Management and Acceptance.

121
UNIT IV SOFTWARE QUALITY MANAGEMENT 9
Software Quality: Testing and Software Reliability, Metrics, ISO and CMMI Quality
management models, Quality enhancement techniques (Review, Inspection, Formal methods,
Best practices and Lessons learnt report).

UNIT V PEOPLE MANAGEMENT 9

Organizational Behavior, Safety and Ethics: Selecting the right person for a job, Motivation
(Taylor’s model, expectancy theory), Job characteristic models, Leadership styles, Stress,
Health and Safety, Professional Ethics- Organization & Project team Structure: Working in
Groups, Decision Making, Organizational structure and Project team structures.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course,
 Student will be able to estimate project cost and perform cost-benefit evaluation among
projects
 Student will be able to perform project scheduling, activity network analysis and risk
management
 Student will be able to apply schedule and cost control techniques for project
monitoring including contract Management
 Student will be able to apply quality models in software projects for maintaining
software quality and Reliability
 Student will be able to use suitable project organization structure, leadership, decision
and motivation styles, proper safety and ethical practices and be responsible to the
society

TEXT BOOKS:
1. Bob Hughes, Mike Cotterell, Rajib Mall, “Software Project Management”, 6th Edition,
Tata McGraw Hill, 2017.

REFERENCES:
1. Royce, “Software Project Management”, Pearson Education, 1999.
2. Robert K. Wysocki, Effective Software Project Management, Wiley, 2009

122
 SOFTWARE TESTING & QUALITY ASSURANCE L T P C
IT18004
(COMMON TO IT & CS) 3 0 0 3

OBJECTIVES
Students should be made

 To understand mathematical foundations of software testing.

 To comprehend the phases of software testing
 To know the managerial aspects of software testing
 To understand software quality management process and quality management models
 To learn software quality metrics, assurance and various software standards

UNIT I INTRODUCTION TO SOFTWARE TESTING 9

Software testing life cycle, software specifications, program correctness and verification,
Failures, errors and faults, testing taxonomy.

UNIT II TEST DATA GENERATION 9

Test generation concepts, Functional and structural criteria, Test Oracle design, Test Driver
design, Test outcome analysis.

UNIT III MANAGEMENT OF SOFTWARE TESTING 9

Metrics for software testing, tools – Scripting tools, record-and-replay tools, performance
testing tools, oracle design tools, exception discovery, collaborative tools.

UNIT IV SOFTWARE QUALITY 9

Defining Software Quality, Software Quality factors, Components of software quality
assurance system, pre project software quality components- Contract Review - Development
and Quality Plans, integrating quality activities in project life cycle.

UNIT V STANDARDS, CERTIFICATION AND ASSESSMENT 9

Need for standards, SQA Standards – ISO9001 Certification, bootstrap methodology, SPICE
project and process assessment, Organizing for Quality Assurance -Management and its Role
in Quality Assurance - SQA Unit & other actors, introduction to Six Sigma.

TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students will be able to:
 Apply the knowledge of mathematics in software testing and test data generation
techniques.
 Implement appropriate procedures, Tools and test data generation techniques

123
  Choose the suitable Software Testing Tools
 Examine the benefits of software quality management process
 Develop a software quality assurance plan for software projects

TEXT BOOKS:
1. Ali Mili, Fairouz Tchier , “Software Testing: Concepts and Operations”, John wiley &
sons, 2015.
2. Daniel Galin, “Software Quality Assurance: From Theory to Implementation”, Pearson
Addison-Wesley, Second Edition, 2012.

REFERENCES:
1. Jeff Tian, “Software Quality Engineering: Testing, Quality Assurance, and
Quantifiable”, Wiley, 2006.
2. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and
Practices”, Pearson Education, 2006.
3. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson Education,
2007.

124
AD18002 BIO-INSPIRED COMPUTING L T P C
3 0 0 3
OBJECTIVES
The students should be made to:
 Familiarize students with computational concepts and methods inspired by biological
systems
 Introduce the concepts of algorithm design for biologically inspired computing
 Develop skills in biologically inspired algorithm design with an emphasis on solving real
world problems
 Understand the most appropriate types of algorithms for different data analysis problems
and to introduce some of the most appropriate implementation strategies

UNIT I INTRODUCTION TO OPTIMIZATION AND EVOLUTIONARY 9

SYSTEMS
Introduction – Unconstrained Optimization, Gradient-Based Methods, Constrained
Optimization, No Free Lunch Theorems, Nature-Inspired Metaheuristics, Genetic Algorithms.
Pillars of Evolutionary Theory; The Genotype; Artificial Evolution; Genetic Representations;
Initial Population; Fitness Functions; Selection and Reproduction; Genetic Operators;
Evolutionary Measures, Types of Evolutionary Algorithms, Schema Theory, Human-
Competitive Evolution. Evolutionary Programming, Evolution Strategies, Genetic
Programming, Evolutionary Algorithms Variations

UNIT II CELLULAR SYSTEMS 9

The Basic Ingredients, Cellular Automata, Modeling with Cellular Systems, Some Classic
Cellular Automata, Other Cellular Systems, Computation, Artificial Life, Complex Systems,
Analysis and Synthesis of Cellular Systems

UNIT III NEURAL AND IMMUNE SYSTEMS 9

Biological Nervous Systems, Artificial Neural Networks, Neuron Models, Architecture,
Unsupervised Learning, Supervised Learning. Immune Systems - How Biological Immune
Systems Work, The Constituents of Biological Immune Systems, Lessons for Artificial
Immune Systems, Algorithms and Applications, Shape Space, Negative Selection
Algorithm, Clonal Selection Algorithm, Case Study - ARTIS and LISYS.

UNIT IV BEHAVIORAL SYSTEMS 9

Behavior in Cognitive Science, Behavior in Artificial Intelligence, Behavior-Based
Robotics, Biological Inspiration for Robots, Robots as Biological Models, Robot Learning-
Value-based Learning, Learning and Morphological Change, Imitation Learning, Evolution
of Behavioral Systems, Evolution and Learning in Behavioral Systems, Evolution and

125
 Neural Development in Behavioral Systems, Coevolution of Body and Control

UNIT V COLLECTIVE SYSTEMS 9

Biological Self-Organization, Particle Swarm Optimization, Ant Colony Optimization, Swarm
Robotics, Coevolutionary Dynamics: Biological Models, Artificial Evolution of Competing
Systems, Artificial Evolution of Cooperation, Differential Evolution, Firefly algorithm, Bee
Algorithm, Bat algorithm, Flower pollination algorithm

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At The end of the course, the student should be able to:
 Familiarize students with computational concepts and methods inspired by
biological systems
 Describe the principles of biologically inspired computing algorithms.
 Discuss the rationale for, advantages and limitations of biologically inspired
computing
 Describe the variety of implementations of biologically inspired computing
algorithms and the value of their application to real world data.
 Design and implement bio-computing algorithms

TEXT BOOKS:
1. Dario Floreano and Claudio Mattiussi, “Bio-Inspired Artificial Intelligence :
Theories Methods, and Technologies”, The MIT Press, 2008.
2. Dan Simon, Evolutionary Optimization Algorithms, Wiley Publishers, 2013.

REFERENCES:
1. Stuart Russell & Peter Norvig, “Artificial Intelligence: A Modern Approach, 3rd
Edition, Pearson Education Limited 2014.
2. Xin-She Yang, “Nature-Inspired Metaheuristic Algorithms”, Luniver Press,
2008

126
CS18008 BUSINESS INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES
Students will be made to:
 Be exposed with the basic rudiments of business intelligence system
 Understand the modeling aspects behind Business Intelligence
 Be exposed with different data analysis tools and techniques
 Apply business intelligence in different domain
UNIT I DECISION SUPPORT AND BUSINESS INTELLIGENCE 9
Definition, concept and need for Business Intelligence – Changing Business Environments and
Computerized Decision Support, Managerial Decision Making, Computerized Support for Decision
Making, An Early framework for Computerized decision support, Concept of Decision Support
Systems, A framework for Business Intelligence, Major Tools and Techniques, Decision Making –
Introduction and Definitions, Models, Phases of the decision-Making process, Decision Support
System – Concepts, Methodologies and Technologies, Classifications, Components of Decision
Support Systems

UNIT II KNOWLEDGE DELIVERY 9

The business intelligence user types, Standard reports, Interactive Analysis and Ad Hoc Querying,
Automated reports and Self-Service Reporting, dimensional analysis, Alerts/Notifications,
Visualization: Charts, Graphs, Widgets, Scorecards and Dashboards, Heatmap, Geographic
Visualization, Integrated Analytics, Considerations: Optimizing the Presentation for the Right
Message

UNIT III DATA STORAGE FOR BUSINESS INTELLIGENCE 9

Data Mining Concepts and Applications, Data Mining Applications, Data Mining Process, Data
Mining Methods, Artificial Neural Networks for Data Mining, Data Warehousing – Definitions and
Concepts, Process Overview, Architectures, ETL Process, Data warehouse development, Real-Time
Data Warehousing

UNIT IV BUSINESS INTELLIGENCE TOOLS FOR APPLICATIONS 9

Text and Web Mining – Text mining applications and tools, Web Mining – Overview, Web content
mining and web structure mining, Web usage Mining. Data Visualization – Using R, Case Studies –
Boston Housing Data, Iris Dataset

UNIT V FUTURE OF BUSINESS INTELLIGENCE 9

Future of business intelligence – Emerging Technologies, Machine Learning, Predicting the Future, BI
Search & Text Analytics – Advanced Visualization – Rich Report, Future beyond Technology
TOTAL (L:45): 45 PERIODS

127
OUTCOMES:
 Students will be able to apply the ETL concepts, tools and techniques to perform Extraction,
Transformation and Loading of data.
 Students will be able to summarize the usable data by using various reporting concepts,
techniques/tools, and use charts, tables for reporting in BI.
 Students will be able to use Analytics concepts like data mining, Exploratory and statistical
techniques for predictive analysis in Business Intelligence.
 Students will be able to demonstrate application of concepts in BI.
 Students will be able to analyze and carry out an empirical evaluation of different algorithms
on a problem formalization, and state the conclusions that the evaluation supports..

TEXT BOOKS:
1. Efraim Turban, Ramesh Sharda, DursunDelen, “Decision Support and Business
Intelligence Systems”, 9th Edition, Pearson 2013.
2. Galit Shmueli, Nitin R. Patel and Peter C. Bruce, ―Data Mining for Business Intelligence:
Concepts, Techniques, and Applications in Microsoft Office Excel with XLMiner, Wiley,
2007

REFERENCES:
1. Larissa T. Moss, S. Atre, “Business Intelligence Roadmap: The Complete Project Lifecycle
of Decision Making”, Addison Wesley, 2003.
2. David Loshin Morgan, Kaufman, “Business Intelligence: The Savvy Manager’s Guide”,
Second Edition, 2012.
3. Cindi Howson, “Successful Business Intelligence: Secrets to Making BI a Killer App”,
McGraw-Hill, 2007.
4. Ralph Kimball , Margy Ross , Warren Thornthwaite, Joy Mundy, Bob Becker, “The Data
Warehouse Lifecycle Toolkit”, Wiley Publication Inc.,2007.

128
AD18004 EVOLUTIONARY COMPUTING L T P C
3 0 0 3
OBJECTIVES
The students should be made to:
 Learn the concepts of Evolutionary Computation process and techniques.
 Study the evolutionary computation as a meta-heuristic algorithm to solve
complex problems.
 Learn parameter controls and advanced techniques in genetic algorithm(GA)
 Solve various optimization problems

UNIT I INTRODUCTION TO EVOLUTIONARY COMPUTATION 9

Introduction to Evolutionary Computation: Biological evolution and artificial evolution -
History of Evolutionary Computation - Fundamentals of search space problems, optimization
versus constraint satisfaction - Basics of Evolutionary Algorithm and its Classes - Components
of Evolutionary Algorithm - Advantages of Evolutionary Computation -. Hybridization with
Other Methods - Applications of Evolutionary Computation.

UNIT II GENETIC ALGORITHM(GA) 9

A simple genetic algorithm - Representation of Individuals - Mutation - Recombination -
Population Model - Parent Selection - Survivor Selection - Applications: Job Shop Scheduling
Problem, N-Queens Problem, Knapsack Problem.

UNIT III PARAMETER TUNING AND ADVANCED TECHNIQUES IN 9

GENETIC ALGORITHM
Parameter Controls - Working with Evolutionary Algorithm - Performance Measure - Types of
GA - Parallel & Distributed GA - Hybrid GA - Adaptive GA –The Schema Theorem in GA-
Building Block Hypothesis - Applications of SGA.

UNIT IV MULTI-OBJECTIVE OPTIMIZATION 9

Linear and nonlinear multi-objective problem - convex and non convex multi-objective
problem, Dominance – concepts and properties, Pareto optimality - Use of Evolutionary
Computations to solve multi objective optimization. NSGA, SPEA ,etc. for multi-objective
optimization

UNIT V GENETIC PROGRAMMING 9

Genetic Programming versus Genetic Algorithm- Structure of genetic programming - Fitness
Measure - Operations - State of Adaptive System - Termination - Result - Classic GP
problems and their solutions: Santa Fe Trail, Symbolic regression, boolean circuit design.
129
 TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, students will be able to:
 Apply the concepts of Evolutionary Computation.
 Use the concepts of scheduling in real-world applications
 Apply the appropriate concepts of optimization technique using Genetic Algorithm.
 Solve multi-objective problem using evolutionary computing
 Use Genetic Programming to provide solutions for real world applications.

TEXT BOOKS:
1. E.Eiben and J.E Smith, “Introduction to Evolutionary Computing”,2nd
Edition,Springer,2015
2. John R Koza, “Genetic Programming”, MIT Press, 1992

REFERENCES:
1. D. E. Goldberg, “Genetic Algorithms in Search, Optimization & Machine Learning”,
New York: Addison Wesley, 13th edition,1989.
2. Kalyanmoy Deb, “Multi-Objective Optimization using Evolutionary Algorithms”, John
Wiley and Son, 2002.

130
AD18006 EXPLAINABLE ARTIFICIAL INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES
Upon completion of this course, students will be able to:
 Understand the explainable AI and its needs.
 Practice the EAI with Python.
 Learn the Chatbots simulation packages and its working process.
 Study the interpretation of AI systems with Machine learning models.
 Know the application area of EAI.

UNIT I INTRODUCTION TO EAI 9

Explainable AI (XAI) – Definition - Explainable AI: Needs, Opportunities, and Challenges -
XAI techniques - The need for XAI: Business - The need for XAI: Legal - Limitations of XAI
- Examples of Possible XAI Applications

UNIT II EAI WITH PYTHON 9

Designing and extracting - Reading and displaying Google Location History data - Enhanced
KNN - XAI applied to the medical diagnosis experimental program.

UNIT III EXPLAINABLE AI CHATBOTS 9

The Python client for Dialogflow - Enhancing the Google Dialog flow Python client - A CUI
XAI dialog using Google Dialogflow - Introducing LIME - The LIME explainer

UNIT IV INTERPRETAION OF AI SYSTEMS 9

Neural Networks via Feature Visualization – Black box Neural Networks – Unsupervised
Learning – Deep Networks.

UNIT V APPLICATIONS OF EXPLAINABLE AI 9

Visual scene understanding by Semantic segmentation – Deep Learning in Drug Discovery –
Software and applications patterns for Explanation Methods

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, learners will be able to:
 Show familiarity with concepts within Explainable AI and interpretable machine
learning.
 Apply EAI using Python language
 Demonstrate comprehension of current techniques for generating explanations from
131
 black-box machine learning methods.
 Demonstrate the working of Explainable AI in Python.
 Develop simple chatbots with the functioning of AI.

TEXT BOOKS:
1. Rothman, D. (2020). Hands-On Explainable AI (XAI) with Python: Interpret,
visualize, explain, and integrate reliable AI for fair, secure, and trustworthy AI apps.
Packt Publishing Ltd.
2. Gianfagna, L., & Di Cecco, A. (2021). Explainable AI with Python (pp. 1-202).
Springer.

REFERENCES:
1. Samek, W., Montavon, G., Vedaldi, A., Hansen, L. K., & Müller, K. R. (Eds.).
(2019). Explainable AI: interpreting, explaining and visualizing deep learning (Vol.
11700). Springer Nature.
2. Molnar, C. (2020). Interpretable machine learning. Lulu. com.

132
AD18008 FULL STACK SOFTWARE DEVELOPMENT L T P C
3 0 0 3
OBJECTIVES
The students are made:

 To understand the concepts and architecture of the World Wide Web

 To understand and practice Markup Language
 To understand Embedded Dynamic Scripting on Client-side Internet Programming
 To understand and practice NoSQL MongoDB Database
 To understand and practice Server-side JS Framework
 To understand on Front-end application development and the React library

UNIT I WEB ESSENTIALS 9

Basic Internet Protocols-WWW-HTTP Request and HTTP Response Message-Web Clients-
Web Servers-An introduction to HTML-Fundamental HTML Elements-List-Tables-Frames-
Forms-Creating HTML documents-cascading Style Sheets.

UNIT II CLIENT SIDE PROGRAMMING: THE JAVASCRIPT 9

LANGUAGE
Introduction - Core features - Data types and Variables - Operators, Expressions and
Statements -Functions & Scope - Objects - Array, Date and Math related Objects - Document
Object Model – Event Handling –Browser Object Model - Windows and Documents - Form
handling and validations. Object-Oriented Techniques in JavaScript - Classes – Constructors
and Prototyping (Sub classes and Super classes) – JSON –Introduction to AJAX -Introduction
to jQuery.

UNIT III INTRODUCTION TO NOSQL DATABASE – MONGODB 9

What is NoSQL Database - Why to Use MongoDB - Difference between MongoDB&
RDBMS - Download & Installation - Common Terms in MongoDB– Implementation of Basic
CRUD Operations using MongoDB

UNIT IV INTRODUCTION TO SERVER-SIDE JS FRAMEWORK – 9

NODE.JS9
Introduction - What is Node JS – Architecture – Feature of Node JS - Installation and setup –
Creating web servers with HTTP (Request & Response) – Event Handling - GET& POST
implementation - Connect to NoSQL Database using Node JS – Implementation of CRUD
operations
133
UNIT V INTRODUCTION TO REACT AND ITS ROUTER 9
Introduction to React: Platforms and Frameworks tools – Hybrid frameworks versus Native –
React Environment Setup – React internals – React JSX – React Components and its styling–
React Router: Parameters – Designing single page applications using React Router

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Build the interactive web pages
 Develop Client-side validation using scripting languages and Open source JavaScript
libraries
 Identify the CURD operations and make Database Connectivity using MongoDB
 Interpret the functionalities of Client-side and Server-side JS frameworks
 Accomplish the functional front-end web application using React.

TEXT BOOKS:
1. Web Technologies-A Computer Science Perspective-Jeffrey C. Jackson, 4th Edition,
2007
2. Amol Nayak, “MongoDB Cookbook ” , Second Edition, Packt Publishing, 2016
3. Krasimir Tsonev, “Node.js by Example”, Packt Publishing, 2015
4. Michele Bertoli, “React Design Patterns and Best Practices: Build easy to scale modular
applications using the most powerful components and design patterns”

REFERENCES:
1. Kirupa Chinnathambi, “Learning React: A Hands-On Guide to Building Web
Applications Using React and Redux”, Second Edition, Pearson Education, 2018.
2. An Introduction to web development and Programming- Michael Mendez Suny
Fredonia, 2014
3. David Flanagan, “JavaScript: The Definitive Guide, Sixth Edition”, O'Reilly Media,
2011
4. Sandro Pasquali, “Mastering Node.js”, First Edition, Packt Publishing,2013.
5. Kristina Chodorow, “MongoDB : The Definitive Guide”, Second Edition, O' Reilly
Publications, 2013.

134
AD18010 GAME THEORY L T P C
3 0 0 3
OBJECTIVES
The students should be made to:
 Understand the concepts of Non-Cooperative game theory
 Understand the concepts of Cooperative game theory
 Know the different types of learning techniques
 Understand the constraint satisfaction problem for distributed environment

UNIT I GAME THEORY - NORMAL FORMS 9

Theory of rational choice-Strategic Games-Preference and Utility Theory-Nash Equilibrium
and Existence Properties- Computing Solution Concepts of Normal Form Games.

UNIT II GAME THEORY - EXTENSIVE FORMS AND RICHER 9

REPRESENTATIONS
Games with Sequential Actions: Reasoning and Computing with Extensive Forms-Repeated
Games-Stochastic Games -Bayesian Games-Congestion Games.

UNIT III LEARNING AND COMMUNICATION 9

Learning and Teaching-Fictitious Play-Rational Learning-Reinforcement Learning-No regret
Learning-Targeted Learning-Evolutionary Learning-Communication

UNIT IV COALITIONAL GAME THEORY 9

Protocols for Strategic Agents – Protocols for Multiagent Resource Allocation - Introduction
to Coalitional Game Theory- Classes of coalitional games- Compact representations of
coalitional games.

UNIT V DISTRIBUTED CONSTRAINT SATISFACTION PROBLEMS 9

AND OPTIMIZATION
Introduction to distributed constraint satisfaction problem - Domain-pruning algorithms -
Heuristic search algorithms - Distributed dynamic programming for path planning - Action
selection in multiagent Markov Decision Problems- Negotiation, auctions and optimization-
Social laws and conventions.

TOTAL (L:45): 45 PERIODS

135
OUTCOMES:
At the end of the course, the student should be able to:
 Provide solutions for strategic environments.
 Identify various game learning types.
 Build Multiagent system using cooperative game theory.
 Identify suitable strategic algorithm for distributed environment.
 Recommend and apply suitable game theory strategy to solve real world problems.

TEXT BOOKS:
1. YoavShoham; Kevin Leyton-Brown ,Multiagent Systems: Algorithmic, Game-
Theoretic, and Logical Foundations, Cambridge University Press,2008.

REFERENCES:
1. Martin Osborne, An Introduction to Game Theory, Oxford University Press, 2003.
2. PrajitDutta, Strategies and Games, MIT Press,1999.

136
AD18012 KNOWLEDGE REPRESENTATION AND L T P C
REASONING 3 0 0 3
OBJECTIVES
The student should be made to:
 Learn the various soft computing frame works.
 Be familiar with design of various neural networks.
 Be exposed to fuzzy logic.
 Learn genetic programming

UNIT I PROPOSITIONAL LOGIC 9

Introduction, Propositional Logic, Syntax and Semantics, Proof Systems, Natural Deduction,
Tableau Method, Resolution Method

UNIT II FIRST ORDER LOGIC 9

First Order Logic (FOL), Syntax and Semantics, Unification, Forward Chaining, The Rete
Algorithm, Rete example, Programming Rule Based Systems Representation in FOL,
Categories and Properties, Reification, Event Calculus

UNIT III REASONING IN FIRST ORDER LOGIC 9

Deductive Retrieval, Backward Chaining, Logic Programming with Prolog, Resolution
Refutation in FOL, FOL with Equality, Complexity of Theorem Proving.

UNIT IV DESCRIPTION LOGIC 9

Description Logic (DL), Structure Matching, Classification, Extensions of DL, The ALC
Language, Inheritance in Taxonomies

UNIT V DEFAULT REASONING 9

Default Reasoning, Circumscription, The Event Calculus Revisited, Default Logic,
Autoepistemic Logic, Epistemic Logic, Multi Agent Scenarios.

TOTAL (L:45): 45 PERIODS

137
OUTCOMES:
Upon completion of the course, students will be able to
 Represent knowledge of a domain formally,
 Design, implement and apply a knowledge-based system
 Understand the limitations and complexity of reasoning algorithms
 Design knowledge based system for real world application
 Understand the logical Reasoning for knowledge-based system

TEXT BOOKS:
1. Ronald J. Brachman, Hector J. Levesque: Knowledge Representation and Reasoning,
Morgan Kaufmann, 2004.
2. Deepak Khemani. A First Course in Artificial Intelligence, McGraw Hill Education
(India), 2013.

REFERENCES:
1. Schank, Roger C., Robert P. Abelson: Scripts, Plans, Goals, and Understanding: An
Inquiry into Human Knowledge Structures. Hillsdale, NJ: Lawrence Erlbaum, 1977.
2. R. C. Schank and C. K. Riesbeck: Inside Computer Understanding: Five Programs
Plus Miniatures, Lawrence Erlbaum, 1981.
3. Murray Shanahan: A Circumscriptive Calculus of Events. Artificial Intelligence
77(2), pp. 249-284, 1995.
4. John F. Sowa: Conceptual Structures: Information Processing in Mind and Machine,
Addison–Wesley Publishing Company, Reading Massachusetts, 1984.
5. John F. Sowa: Knowledge Representation: Logical, Philosophical, and
Computational Foundations, Brooks/Cole, Thomson Learning, 2000.

138
AD18014 QUANTUM COMPUTING L T P C
3 0 0 3
OBJECTIVES

The students should be made to:

 Be familiar with the basics of Quantum Computing
 Be familiar with the concepts of Quantum Programs
 Be familiar with the advanced algorithms Quantum Computing

UNIT I INTRODUCTION TO QUANTUM COMPUTING 9

Motivation for studying Quantum Computing - Major players in the industry (IBM,
Microsoft, Rigetti, D-Wave etc.) - Origin of Quantum Computing - Overview of major
concepts in Quantum Computing - Qubits and multi-qubits states, Bra-ket notation- Bloch
Sphere representation - Quantum Superposition - Quantum Entanglement.

UNIT II MATH FOUNDATION FOR QUANTUM COMPUTING 9

Matrix Algebra: basis vectors and orthogonality, inner product and Hilbert spaces, matrices
and tensors, unitary operators and projectors, Dirac notation, Eigen values and Eigen
vectors.

UNIT III BUILDING BLOCKS FOR QUANTUM PROGRAM 9

Architecture of a Quantum Computing platform - Details of q-bit system of information
representation: Block Sphere - Multi-qubits States - Quantum superposition of qubits (valid
and invalid superposition) - Quantum Entanglement - Useful states from quantum
algorithmic perceptive e.g. Bell State - Operation on qubits: Measuring and transforming
using gates.- Quantum Logic gates and Circuit: Pauli, Hadamard, phase shift, controlled
gates, Ising, Deutsch, swap etc.

UNIT IV QUANTUM ALGORITHMS 9

Basic techniques exploited by quantum algorithms - Amplitude amplification Quantum
Fourier Transform Phase Kick-back - Quantum Phase estimation Quantum Walks.

139
UNIT V MAJOR ALGORITHMS 9
Shor’s Algorithm Grover’s Algorithm - Deutsch’s Algorithm Deutsch -Jozsa Algorithm.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Use suitable concepts in computer science, mathematics and physics necessary
for quantum computation and quantum information
 Solve the factoring and discrete logarithm problems using Fourier transform
 Find whether the two items of quantum information are similar using
distance measures Applying the algorithms in various domains
 Protect quantum computations against the effect of noise by using quantum
error-correcting codes
 Apply suitable algorithm for the given problem

TEXT BOOKS:
1. Michael A. Nielsen, “Quantum Computation and Quantum Information”,
Cambridge University Press, 2013
2. David McMahon, “Quantum Computing Explained”, Wiley, 2008

REFERENCES:
1.V. Sahni, “Quantum Computing”, Tata McGraw-Hill Publishing Company, 2007.

140
AD18016 SEMANTIC WEB L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the structure of the Semantic Web technology
 Understand the concepts of metadata, semantics of knowledge and resource,
ontology, and their descriptions in XML-based syntax and web ontology language
(OWL).
 Describe logic semantics and inference with OWL.
 Understand Semantic Web query languages (SPARQL).
 Understand and reflect on the principles of Ontology Engineering.

UNIT I INTRODUCTION TO THE SEMANTIC WEB AND XML 9

The Semantic Web Vision:- Introduction - Current web vs Semantic Web - Semantic Web
Technologies - A layered approach, The Quest for Semantics :- Building Models -
Calculating with Knowledge - Exchanging Information - Semantic Web Technologies,
Structured Web Documents in XML :- Motivation and Overview - The XML Language --
Structuring - Namespaces - Addressing and querying XML document – Processing.

UNIT II RESOURCE DESCRIPTION LANGUAGE RDF 9

Simple Ontologies in RDF and RDF Schema :- Introduction to RDF - Syntax for RDF -
Advanced Features - Simple Ontologies in RDF Schema - Encoding of Special Data
structures - An Example, RDF Formal Semantics :- Semantics- Model-Theoretic Semantics
for RDF(S) - Syntactic Reasoning with Deduction Rules - The Semantic Limits of RDF(S).

UNIT III WEB ONTOLOGY LANGUAGE: OWL 9

Ontologies in OWL : OWL Syntax and Intuitive Semantics - OWL Species - The Forthcoming
OWL 2 Standard, OWL Formal Semantics : Description Logics - Model-Theoretic Semantics
of OWL - Automated Reasoning with OWL - Examples :- An African Wildlife Ontology - A
printer ontology - OWL in OWL

UNIT IV RULES AND QUERIES 9

Ontologies and Rules : Rule - Datalog as a First-Order Rule Language - Combining Rules
with OWL DL - Rule Interchange Format RIF, Query Languages : SPARQL Query
Language for RDF - Conjunctive Queries for OWL DL

UNIT V ONTOLOGY ENGINEERING AND APPLICATIONS 9

Ontology Engineering : Manually constructing ontologies - Re-using existing ontologies -

141
Requirement Analysis - Ontology Creation - Quality Assurance of Ontologies - Modular
Ontologies: Divide and Conquer - Software Tools - Applications: Web Data Exchange and
Syndication - Semantic Wikis - Semantic Portals - Semantic Metadata in Data Formats -
Semantic Web in Life Sciences - Ontologies for Standardizations - RIF Applications – BBC
World Cup 2010 Website - Government Data - New York Times - Toward Future
Applications.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
On completion of the course, students will be able to
 Use the technical framework of semantic web.
 Design and understand the data standards and principles that provide the foundation of
the Semantic web and integration of structured data from the Web sources.
 Design an application that need to process the content of information
 Develop domain specific ontologies using ontology languages in OWL ontologies.
 Develop application by make use of tools for building and storing ontologies.

TEXT BOOKS:
1. Foundations of Semantic Web Technologies, Pascal Hitzler, Markus Krötzsch,
Sebastian Rudolph, CRC Press, 2010
2. A Semantic Web Primer, by Grigoris Antoniou, Paul Groth, Frank van Harmelen
and Rinke Hoekstra, MIT Press; 3rd edition (September, 2012).

REFERENCES:
1. Michael C. Daconta, Leo J. Obrst, and Kevin T. Smith, “The Semantic Web: A
Guide to the Future of XML, Web Services, and Knowledge Management”, Fourth
Edition, Wiley Publishing, 2003.
2. Handbook of Semantic Web Technologies, John Domingue, Dieter Fensel, James
A. Hendler (Eds.), Springer, 2011
3. Learning SPARQL: Querying and Updating with SPARQL 1.1, by BobDuCharme
Publisher: O'Reilly Media; 2 edition (July 18, 2013).

142
AD18018 SENTIMENT ANALYSIS L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Introduce the sentiment analysis problem and its related issues
 Get familiarity in the topic of document level sentiment classification
 Go to the fine-grained level of study to aspect based sentiment analysis
 Compile sentiment lexicons.
 Focus on opinion search and detecting fake opinions.

UNIT I INTRODUCTION 9
The Problem of Sentiment Analysis: Definition of Opinion-Sentiment Target-Sentiment of
Opinion-Reason and Qualifier for Opinion-Objective and Tasks of Sentiment Analysis.
Definition of Opinion Summary-Affect, Emotion and Mood-Different Types of Opinion.

UNIT II SENTIMENT CLASSIFICATION 9

Supervised Sentiment Classification-Unsupervised Sentiment Classification-Sentiment Rating
Prediction-Cross Domain Sentiment Classification-Cross Language Sentiment Classification-
Emotion Classification of Documents. Sentence, Subjectivity and Sentiment Classification-
Dealing with Conditional and Sarcastic Sentences-Cross Language Subjectivity and Sentiment
Classification.

UNIT III ASPECT SENTIMENT CLASSIFICATION 9

Aspect Sentiment Classification-Rules of Sentiment Composition-Negation and Sentiment-
Modality and Sentiment-Coordinating Conjunction-Sentiment Words in Non-opinion
Contexts-Rule Representation. Aspect and Entity Extraction: Frequency based Aspect
Extraction-Exploiting Syntactic Relations-Supervised Learning-Mapping Implicit Aspects-
Topic Models-Entity Extraction and Resolution.

UNIT IV SENTIMENT LEXICON GENERATION 9

Dictionary based Approach-Corpus based Approach. Analysis of Comparative Opinions:
Problem Definition-Identify Comparative Sentences-Identifying the Preferred Entity Set-
Types of Comparison.

143
UNIT V OPINION SUMMARIZATION AND SEARCH 9
Aspect based Opinion Summarization-Enhancements-Contrastive View Summarization-
Opinion Search. Modeling Debates/Discussions: Join Topic Expression (JTE) Model.
Detecting Fake or Deceptive Opinions: Different types of Spam; Quality of Reviews.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of this course, the students should be able to
 Define sentiment analysis and classify different types of opinions.
 Detect the overall opinion or sentiment expressed in a document.
 Find the shortcomings for real-life applications of sentiment analysis and classification.
 Find an effective method for discovering and determining domain and
context-dependent sentiments
 Use detection algorithm to be smart enough in spotting sophisticated fake reviewers.

TEXT BOOKS:
1. Liu, Bing. Sentiment analysis: Mining opinions, sentiments, and emotions.
Cambridge University Press, 2015.

REFERENCES:
1. Pedrycz, Witold, and Shyi-Ming Chen. "Sentiment Analysis and Ontology
Engineering." In An Environment of Computational Intelligence, Springer
publication, 2016.

144
AD18020 SOFT COMPUTING TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Learn the various soft computing frame works
 Be familiar with design of various neural networks
 Be exposed to fuzzy logic
 Learn genetic programming

UNIT I NEURAL NETWORK 9

Introduction of Soft computing and Hard computing, Neural Network, Learning rules and
various activation functions, Single layer Perceptrons , Back Propagation networks,
Architecture of Backpropagation(BP) Networks, Backpropagation Learning, Variation of
Standard Back propagation Neural Network, Introduction to Associative Memory, Adaptive
Resonance theory and Self Organizing Map, Recent Applications.

UNIT II FUZZY SYSTEM 9

Fuzzy Set theory, Fuzzy versus Crisp set, Fuzzy Relation, Fuzzification, Minmax
Composition, Defuzzification Method, Fuzzy Logic, Fuzzy Rule based systems, Predicate
logic, Fuzzy Decision Making, Fuzzy Control Systems, Fuzzy Classification

UNIT III GENETIC ALGORITHMS 9

History of Genetic Algorithms (GA), Working Principle, Various Encoding methods, Fitness
function, GA Operators- Reproduction, Crossover, Mutation, Convergence of GA, Bit wise
operation in GA, Multi-level Optimization

UNIT IV HYBRID SYSTEMS 9

Hybrid Systems: Sequential Hybrid Systems, Auxiliary Hybrid Systems, Embedded Hybrid
Systems, Neuro-Fuzzy Hybrid Systems, Neuro-Genetic Hybrid Systems, Fuzzy-Genetic
Hybrid Systems.

UNIT V NEURO FUZZY AND GENETIC SYSTEMS 9

GA based Backpropagation Networks: GA based Weight Determination, K - factor
determination in Columns, Fuzzy Backpropagation Networks: LR type Fuzzy numbers,
Fuzzy Neuron, Fuzzy BP Architecture, Learning in Fuzzy BP, Application of Fuzzy BP
Networks.

TOTAL (L:45): 45 PERIODS

145
OUTCOMES:
Upon completion of the course, students will be able to
 Understand the various soft computing frameworks.
 Apply the fuzzy techniques to real world problems.
 Understand the principles of genetic algorithms.
 Design hybrid systems.
 Design the applications of GA based neuro fuzzy systems.

TEXT BOOKS:
1. Jang J.S.R, Sun C.T, Mizutani. E, Neuro-Fuzzy and Soft Computing, PHI New
Delhi, 2012.
2. Rajasekaran. S, Vijayalakshmi Pai G.A, Neural networks, Fuzzy logic, and Genetic
algorithms synthesis and applications, PHI, New Delhi, 2011.

REFERENCES:
1. Timothy J Ross, Fuzzy logic with Engineering Applications - ED3, Wiley, India,
New Delhi, 2011.
2. Laurence Fausett, Fundamentals of Neural Networks: Architecture Algorithms and
Applications, Pearson Education, New Delhi, 2004.
3. S.N. Sivanandam and S.N. Deepa, “Principles of Soft Computing”, Wiley India Pvt
Ltd, 2011.

146
AD18022 SPEECH PROCESSING TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the fundamentals of speech.
 Understand the basic concepts of speech signal representations and audio features.
 Familiarize the students with the modeling of speech.
 Understand Large Vocabulary Continuous Speech Recognition
 Get introduced to Text-To-Speech systems

UNIT I FUNDAMENTALS OF SPEECH 9

Introduction-The Speech Production Process-Representing Speech in Time and Frequency
Domain-Speech Sounds and Features - Approaches to Automatic Speech Recognition by
Machine

UNIT II SPEECH ANALYSIS 9

Spectral Analysis Methods: Linear Predictive Coding Model-Vector Quantization-Auditory
based Spectral Analysis Models. Pattern Comparison Techniques: Speech Detection-
Distortion Measures-Mathematical Considerations-Perceptual Considerations; Spectral
Distortion Measures; Time Alignment and Normalization.

UNIT III SPEECH MODELING 9

Speech Modeling: Discrete Time Markov Processes-Hidden Markov Models(HMM): HMMs
Probability Evaluation, Optimal State Sequence – Viterbi Search, Baum-Welch Parameter Re-
estimation- Types of HMMs- Implementation issues for HMMs

UNIT IV LARGE VOCABULARY CONTINUOUS SPEECH 9

RECOGNITION
Introduction- Subword Speech Units- Subword Unit Models based on HMMs-Training of
Subword Units-Context Dependent Subword Units.

147
UNIT V TEXT-TO-SPEECH 9
Speech Sounds and Phonetic Transcription-The Phoneme and Phonological Rules-
Phonological Rules and Transducers - Machine Learning of Phonological Rules-Mapping
Text to Phones for Text-To-Speech(TTS) - Prosody in TTS.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of this course, the students should be able to :
 Identify the various temporal, spectral and cepstral features required for
identifying speech units – phoneme, syllable and word.
 Process the digital signals and extract features from the speech signals.
 Build an acoustic model for speech recognition
 Identify the appropriate approach for building ASR models for large vocabulary
 Evaluate a text-to-speech model.

TEXT BOOKS:
1. Joseph Mariani, - Language and Speech Processing, Wiley, 2009.
2. Lawrence Rabiner and Biing-Hwang Juang, - Fundamentals of Speech
Recognition, Prentice Hall Signal Processing Series, 1993.

REFERENCES:
1. Sadaoki Furui, ―Digital Speech Processing: Synthesis, and Recognition, Second
Edition, (Signal Processing and Communications), Marcel Dekker, 2000.
2. Thomas F. Quatieri, - Discrete-Time Speech Signal Processing, Pearson Education,
2002.
3. Xuedong Huang, Alex Acero, Hsiao-Wuen Hon, ―Spoken Language Processing –
A guide to Theory, Algorithm and System Development, Prentice Hall PTR, 2001.

148
AD18024 VIDEO ANALYTICS L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the need and basics for video Analytics
 Understand the basic configuration and functional blocks of video analytic system
 Acquire the knowledge of extracting information from surveillance videos.
 Learn Event Modelling for different applications.
 Understand the algorithms for face recognition in videos.

UNIT I VIDEO ANALYTIC COMPONENTS 9

Need for Video Analytics-Overview of video Analytics- Foreground extraction- Feature
extraction classifier - Preprocessing- edge detection- smoothening- Feature space-PCA-FLD-
SIFT features.

UNIT II FOREGROUND EXTRACTION 9

Background estimation- Averaging- Gaussian Mixture Model- Optical Flow based- Image
Segmentation- Region growing- Region Splitting-Morphological operations- erosion-Dilation
Tracking in a multiple camera environment.

UNIT III VIDEO SURVEILLANCE 9

Fundamentals for Video Surveillance- Scene Artifacts- Object Detection and Tracking:
Adaptive Background Modelling and Subtraction- Pedestrian Detection and Tracking -
Vehicle Detection and Tracking- Articulated Human Motion Tracking in Low-Dimensional
Latent Spaces.

UNIT IV BEHAVIOURAL ANALYSIS & ACTIVITY RECOGNITION 9

Event Modelling- Behavioral Analysis- Human Activity Recognition-Complex Activity
Recognition- Activity modelling using 3D shape, Video summarization, shape-based activity
models- Suspicious Activity Detection.

UNIT V HUMAN FACE RECOGNITION & GAIT ANALYSIS 9

Overview of Recognition algorithms – Human Recognition using Face: Face Recognition
from still images, Face Recognition from video, Evaluation of Face Recognition
Technologies- Human Recognition using gait: HMM Framework for Gait Recognition, View
Invariant Gait Recognition, Role of Shape and Dynamics in Gait Recognition.

TOTAL (L:45): 45 PERIODS

149
OUTCOMES:
At the end of the course, learners will be able to:
 Gain the knowledge on the need and basics of video Analytics
 Apply different data extraction techniques in real world problems.
 Track objects and human in the surveillance videos.
 Recognize Human Activity in real-world applications.
 Apply different Human Face Recognition algorithms in real world problems.

TEXT BOOKS:
1. A. Murat Tekalp, Digital Video Processing (2 ed.), Prentice Hall, 2015. ISBN 978-
0133991000.
2. Rama Chellappa, Amit K.Roy-Chowdhury, Kevin Zhou.S, “Recognition of Humans
and their Activities using Video”, Morgan&Claypool Publishers, 2005.
3. Alan C Bovik, The Essential Guide to Video Processing Al Bovik (2 ed.), Academic
Press, 2009. ISBN 978-0123744562

REFERENCES:
1. NilanjanDey (Editor), Amira Ashour (Editor) and SuvojitAcharjee (Editor), Applied
Video Processing in Surveillance and Monitoring Systems (IGI global) 2016
2. Yunqian Ma, Gang Qian, “Intelligent Video Surveillance: Systems and Technology”,
CRC Press (Taylor and Francis Group), 2009.
3. Caifeng Shan (Editor), FatihPorikli (Editor), Tao Xiang (Editor), Shaogang Gong
(Editor) Video Analytics for Business Intelligence, Springer, 2012

150
AD18026 VIRTUAL AND AUGMENTED REALITY L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the fundamental concepts of Virtual and Augmented Reality
 Learn Geometric modelling and transformations.
 Identify suitable techniques and toolkits for modelling Virtual and Augmented Reality

UNIT I INTRODUCTION TO VIRTUAL REALITY AND VIRTUAL 9

ENVIRONMENT
Introduction- Computer graphics-Real time computer graphics- Virtual environment
requirement- benefits of virtual reality-3D Computer Graphics: Introduction- The Virtual
world space-positioning the virtual observer- the perspective projection- human vision-
stereo perspective projection- 3D clipping- Colour theory-Simple 3D modelling-
Illumination models-Reflection models- Shading algorithms- Radiosity- Hidden Surface
Removal-Realism-Stereographic image.

UNIT II GEOMETRIC MODELING AND TRANSFORMATIONS 9

Geometric Modelling: Introduction - From 2D to 3D, 3D space curves, 3D boundary
representation. Geometrical Transformations: Introduction, Frames of reference, Modelling
transformations, Instances, Picking, Flying, Scaling the VE, Collision detection Generic VR
system: Introduction, Virtual environment, Computer environment, VR technology, Model
of interaction, VR Systems.

UNIT III VIRTUAL ENVIRONMENT 9

Animating the Virtual Environment: Introduction- The dynamics of numbers- Linear and
Nonlinear interpolation- the animation of objects- linear and non-linear translation, shape &
object in-between, free from deformation- particle system. Physical Simulation: Introduction-
Objects falling in a gravitational field- Rotating wheels- Elastic collisions-projectiles- simple
pendulum- springs- Flight dynamics of an aircraft.

UNIT IV VR HARDWARE AND SOFTWARE 9

Human factors: Introduction - the eye - the ear - the somatic senses. VR Hardware:
Introduction- sensor hardware- Head-coupled displays- Acoustic hardware- Integrated VR
systems. VR Software: Introduction- Modelling virtual world- Physical simulation- VR
toolkits- Introduction to VRML.

151
UNIT V AUGMENTED REALITY 9
Introduction –Concepts of Augmented Reality-difference between AR and VR- Challenges
with AR- AR systems and functionality- Augmented reality methods- visualization techniques
for augmented reality- wireless displays in educational augmented reality applications- mobile
projection interfaces- marker-less tracking for augmented reality- enhancing interactivity in
AR environments- evaluating AR systems

TOTAL (L:45): 45 PERIODS

OUTCOMES:
On completion of the course, students will be able to
 Demonstrate the concepts of stereographic projections.
 Deploy the smearing the concepts of 3D modelling and transformations for Virtual
Reality.
 Choose the suitable hardware and software components for developing VR
applications.
 Generate applications using Virtual Reality concepts.
 Build applications using Augmented Reality concepts.

TEXT BOOKS:
1. John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2007.
2. Alan B Craig, “Understanding Augmented Reality Concepts and Applications”,
Morgan Kaufmann, 2013.

REFERENCES:
1. William R. Sherman, Alan B. Craig, “Understanding Virtual Reality: Interface,
Application, and Design”, Morgan Kaufmann, 2008.

152
 VALUE ADDED COURSES
VD18503 DIGITAL FORENSICS L T P C
2 0 0 2
OBJECTIVES
 Describe digital forensics and relate it to an investigative process.
 Explain the legal issues of preparing for and performing digital forensic analysis.
 Demonstrate the process of Electronic Discovery
 Explains the Intrusion Investigation Process
 Explain how to recover hidden data for forensic analysis from Windows file system

UNIT I INTRODUCTION TO DIGITAL FORENSICS 6

Forensics Soundness, Forensic Analysis Fundamentals, Crime Reconstruction, Networks and
the Internet, Conclusion.

UNIT II FORENSIC ANALYSIS 6

Introduction, Applying the Scientific Method to Digital Forensics, Uses of Digital Forensic
Analysis, Data Gathering and Observation, Hypothesis Formation, Evaluating Hypotheses,
Conclusions and Reporting.

UNIT III ELECTRONIC DISCOVERY 6

Introduction to Electronic Discovery, Case Management, Identification of Electronic data,
Forensic Preservation of Data, Data Processing, Production of Electronic Data

UNIT IV INTRUSION INVESTIGATION 6

Introduction and Methodologies, Preparation, Case Management and Reporting, Common
Initial Observations, Scope Assessment, Collection, Analyzing Digital Evidence,
Combination/ Correlation, Feeding Analysis Back into the Detection Phase.

UNIT V WINDOWS FORENSIC ANALYSIS 6

Introduction - NTFS Overview, Forensic Analysis of the NTFS Master File Table (MFT) ,
Metadata , Artifacts of User Activities , Deletion and Destruction of Data, Windows Internet
and Communications Activities , Windows Process Memory, BitLocker and Encrypting File
System (EFS)

TOTAL (L:30): 30 PERIODS

OUTCOMES:
 Students will be able to demonstrate in-depth knowledge in the field of Digital
forensics.
 Students will be able to analyze the data to identify evidence.

153
  Students will be able to implement the Electronic Discovery of data.
 Students will be able to make use of mathematical techniques to detect fake data.
 Students will be able to apply forensic analysis on NTFS file system.

TEXT BOOKS:

1. Handbook of Digital Forensics and Investigation, Eoghan Casey , Elsevier Academic

Press, USA.

REFERENCES:
1. The Basics of Digital Forensics: The Primer for Getting Started in Digital Forensics
Book by John Sammons
2. Computer Forensics For Dummies 1st Edition by Carol Pollard

154
 VD18504 FINITE AUTOMATA THEORY L T P C
2 0 0 2
OBJECTIVES
The student should be made to:

 Understand the various Computing models like Finite State Machine, Pushdown
Automata, and Turing Machine.
 Learn Formalism, regular expressions and types of grammars.
 Understand the Simplification methods and Normal Forms for grammars.
 Understand equivalence and various properties of the computing models Be aware of
Decidability and Un-decidability of various problems.

UNIT I FINITE AUTOMATA (FA) 6

Introduction-Deterministic Finite Automata(DFA)-Formal definition-simpler notations (state
transition diagram, transition table)-Non deterministic Finite Automata (NFA)- Definition of
NFA-language of an NFA-Equivalence of DFA and NFA- Applications of Finite Automata-
Finite Automata with Epsilon Transitions-Eliminating Epsilon transitions-Minimization of
Deterministic Finite Automata.

UNIT II REGULAR EXPRESSIONS (RE) 6

Introduction-Identities of RE -Finite Automata and Regular Expressions- Converting from
DFA’s to Regular Expressions- Converting Regular Expressions to Automata-applications of
Regular Expressions-Proving languages need not be RL -Pumping lemma-applications-
Closure properties of regular languages.

UNIT III CONTEXT FREE GRAMMARS (CFG) 6

Derivation Trees-Sentential Forms-Rightmost and Leftmost derivations of Strings-Ambiguity
in CFG-Minimization of Context Free Grammar - Chomsky Normal Form(CNF)-Greibach
Normal Form(GNF).

UNIT IV PUSHDOWN AUTOMATA AND TURING MACHINE 6

Definition, Model, Acceptance of CFL, Acceptance by Final State and Acceptance by
Empty stack and its Equivalence, Equivalence of CFG and PDA. TURING MACHINES
(TM): Formal definition -TM as a computer of integer functions- Programming Techniques
for Turing machine – Multi head, Multi tape and Non Deterministic Turing Machines - The
Halting problem – Chomskian hierarchy of languages.

UNIT V RECURSIVE AND RECURSIVELY ENUMERABLE 6

LANGUAGES
Properties of recursive and recursively enumerable languages-Universal Turing machine-The

155
Halting problem-Undecidable problems about the TM-Decidability-Post's Correspondence
Problem (PCP)
TOTAL (L:30): 30 PERIODS

OUTCOMES:
Upon completion of the course, students will be able to
 Use basic concepts of formal languages of finite automata techniques
 Design Finite Automata’s for different Regular Expressions and Languages
 Construct context free grammar for various languages
 Solve various problems of applying normal form techniques, push down
automata and Turing Machines
 Explain the Decidability or Undecidability of various problems.

TEXT BOOKS:
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computations”, second Edition, Pearson Education, 2008.

REFERENCES:
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”, Second
Edition, Pearson Education, 2003.
2. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole,
1997.
3. J. Martin, “Introduction to Languages and the Theory of computation” Third Edition,
Tata Mc Graw Hill, 2007
4. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition,
Narosa Publishers, New Delhi, 2002.

156
VC 18004 DESIGN THINKING AND PROTOTYPING L T P C
LABORATORY
(Common to All branches, Except MR)
2 0 0 2
OBJECTIVE:
To apply design thinking principles in arriving at innovative engineering solutions for problems
relevant to society.

SYLLABUS
The course will use a combination of lectures and hands-on project work. The project will give an
opportunity to come up with an innovative engineering solution to problems or challenges
particular to our society.

1. Concepts of design thinking and human centered design thinking.

2. Identifying societal problems using indirect and qualitative research.
3. Forming teams and assignments of major societal problems and arriving at sound concept
hypotheses, and solution using brainstorming sessions. Societal problems such as water
management, energy sources, basic amenities (health, education, food, clean water,
sanitation, connectivity etc), organic farming, livelihood etc. will be assigned as projects.
4. Developing a prototype that allows for meaningful feedback in a real-world environment.
5. Presenting the developed prototype in front of a technically qualified audience.

Evaluation will be done as per following details.

Internal (65 Marks) End Semester Examination (35 Marks)
Project Work Project Report (15) Viva - Voce (20)
Review I Review II Review III
External Internal External Supervisor
Phase 15 25 25 15 5 10 5

OUTCOMES:
 Students will be able to apply design thinking principles in arriving innovative design.
 Students will be able to solve unique societal problems.
 Students will be able to make prototypes.
 Students will be able to work as a team member or lead interdisciplinary engineering teams.
 Students will be able to demonstrate the product prototype to technically qualified audience.

157
VC18005 BASICS OF ENTREPRENEURSHIP DEVELOPMENT L T P C
(Common to All Branches) 2 0 0 2
OBJECTIVES:
The students will be made:
 To provide Knowledge on Self-discovery and Problem identification.
 To provide Skill set on Identifying customer segment and Practice on Business Model.
 To understand the Market, Sales and support.
UNIT I SELF-DISCOVERY & PROBLEM IDENTIFICATION 6
Orientation of Entrepreneurship – Case Study – activity – Effectuation – Principles of
Effectuation – Identifying Entrepreneur skill.
Problem Identification – Design thinking – look for solution – activity – Brain storming.

UNIT II CUSTOMER & BUSINESS MODEL 6

Identifying customer segment, understanding the market – Product selection –activity – value
proposition canvas.
Identify the Problem, Solution and Risk identification – Activity – Business model.

UNIT III VALIDATION AND RESOURCES 6

Build a Minimum Viable Product (MVP) – validation and launching of MVP –activity – MVP
Interview.
Cost – Revenue – Pricing – Profitability – Sources of finance – activity – Bootstrap Finance –
Leadership – Identifying Co-founders and Hiring a Team – activity –Pitching about a venture

UNIT IV MARKET AND SALES 6

Positioning and branding – network and channels – sales planning – activity – selling skill.

UNIT V SUPPORT 6
Project Management – Project tracking – Basics of Business regulations – Activity – capstone
project.
TOTAL : 30 PERIODS

OUTCOMES
Upon the completion of the course, Students will be able to:
 Acquire knowledge and Practice on Self Discovery and Problem identification.
 Understand the concept of Identifying the Customer and Business model.
 Acquire knowledge on various Resource and Practice on validation.
 Acquire knowledge on marketing and sales.
 Practice on Project management.

158
TEXT BOOKS:

1. S. S. Khanka, “Entrepreneurial Development” S. Chand & Co. Ltd., Ram Nagar, New
Delhi, 2013.
2. Donald F Kuratko, “Entrepreneurship – Theory, Process and Practice”, 9th edition,
Cengage Learning 2014
REFERENCES :
1. Hisrich R D, Peters M P, “Entrepreneurship” 8th Edition, Tata McGraw-Hill, 2013.
2. Mathew J Manimala, “Entrepreneurship Theory at Cross Roads: paradigms and Praxis”,
2nd Edition Dream Tech, 2005.

WEB RESOURCE:
https://learnwise.wfglobal.org/#/IN/en/courses

159