Detail Syllabus

M.Tech in Computer Science and Engineering

With specialization in

Artificial Intelligence
Under Computer Science and Engineering Department, NIT Agartala

Major Area / Department: Computer Science and Engineering

Specialization: Artificial Intelligence

 
 
   
 
  Department 
Institute 
   
 
National Institute of   
Technology Agartala  Computer Science and Engineering Department 
 
   
    APJ Abdul kalam Block 
P.O: NIT Agartala,Tripura(West), India,799046  NIT Agartala, Agartala,Tripura(West), India,799046 
Tel.: (0381) 234 6630 / 234 8511 Fax : (0381) 234 6360     
Email: nita.director@gmail.com 
           gopalmugeraya@yahoo.com  3 
  http://www.nita.ac.in 
 Course structure for M.Tech in
Artificial Intelligence
Department of CSE, NIT Agartala

Semester Subject L T P Cr.

1 1. Advanced Data Structures and Algorithms 3 1 0 4
2. Artificial Intelligence 3 1 0 4
3. Computational Methods of Optimization 3 1 0 4
3 0 0 3
4. Elective, I
a) Stochastic Models and Applications
b) Natural Language Processing
c) Soft computing
d) Data Mining
e) Cognitive science
3 0 0 3
5. Elective, II
a) Expert Systems
b) Computer Vision
c) Bioinformatics
d) Information Retrieval
e) AI for Cyber Security
0 0 3 2
6. Laboratory I (Advanced Data Structures
and Algorithms)

15 3 3 20
Total

2 3 1 0 4
1. Robotics and automation

3 1 0 4
2. Machine Learning

3 1 0 4
3. Computational Linear Algebra

3 0 0 3
4. Elective, III
a) Agent based intelligent system
b) Automated Reasoning
c) Deep learning
d) Data Visualization

3 0 0 3
1. Elective, IV
a) Affective Computing and Interaction
b) Inferential Statistics
c) IOT
d) Data Analytics

4 
 
 0 0 3 2
2. Laboratory, III (Robotics and Automation
Lab)

0 0 0 2
3. Project Preliminaries

0 0 0 1
4. Comprehensive Viva

15 3 3 23
Total

Semester Subject L T P Cr.

3 Project Work- I 0 0 FULL 15

*Students may go for industrial or inter institute

collaboration, based Project work for 6 months to 1
year. The DPPC and concerned local guide may be
empowered to recommend such provision.
All existing academic rules of institute will prevail. The
exact modalities may be recommended by DPPC.

Total 0 0 0 15

Semester Subject L T P Cr.

4 Project Work- II 0 0 FULL 20
*Students may go for industrial or inter institute
collaboration, based Project work for 6 months to 1
year. The DPPC and concerned local guide may be
empowered to recommend such provision.
All existing academic rules of institute will prevail.
The exact modalities may be recommended by DPPC.

Total 0 0 0 20
Cumulative credit of the course
Semester-I 15 3 3 20
Semester -II 15 3 3 23
Semester -III 0 0 0 15
Semester -IV 0 0 0 20
Total 30 6 6 78

5 
 
 Annexure, I
Detail Syllabus
Course structure for M.Tech in
Artificial Intelligence
Department of CSE, NIT Agartala

Semester I

Advanced Data Structures and Algorithms

L T P
3 , 1 , 0 : 4 Credits Prerequisites: None

UNIT I
Introduction to advanced data structures, Fundamentals of the analysis of algorithms,
Recurrences: The substitution method, Recursive tree method, Masters Method, Probabilistic
analysis, Amortized analysis, Randomized algorithms, Mathematical aspects and analysis of
algorithms.

UNIT II
Divide and Conquer technique, Binary search tree ,  AVL-trees, red-black trees, B and B+-
trees, Finding the minimum and maximum, Merge sort, Quick sort, Strassen’s matrix
multiplication. Splay Trees,  Binomial Heaps, Fibonacci Heaps, Application of k-d tree (k-
dimensional tree) in range searches and nearest neighbor searches.

UNIT III
Greedy algorithms: Introduction, Knapsack problem, Job sequencing with deadlines, Minimum
cost spanning trees, Kruskal’s algorithm, Prim’s algorithm, Optimal storage on tapes, Optimal
merge pattern, Subset cover problem, Container loading or Bin packing problem.

UNIT IV
Dynamic algorithms: Introduction Dynamic algorithms, All pair shortest path, 0/1 knapsack,
Travelling salesman problem, Coin Changing Problem, Matrix Chain Multiplication, Flow
shop scheduling, Optimal binary search tree (OBST), Analysis of All problems, Introduction
to NP-Hard And NP-Complete Problems
More algorithms: Dynamic programming, graph algorithms: DFS, BFS, topological sorting,
shortest path algorithms, network flow problems.

UNIT IV
String Matching: The naïve string matching algorithm, Rabin Karp algorithm, Knuth Morris
Pratt algorithm (KMP), longest common subsequence (LCS), Fractional cascading, suffix
trees, geometric algorithms.
References:
1. Introduction to algorithms: Cormen, Leiserson, Rivest and Stein (Main textbook)
2. Algorithm Design: Kleinberg and Tardos
5. Data structures and algorithm analysis in C++(Java): Mark Weiss
6. Data structures and algorithms: Aho, Hopcroft and Ullman
 
 
 

6 
 
Artificial Intelligence
L T P
3 , 1 , 0 : 4 Credits Prerequisites: None

UNIT I
Introduction to AI and intelligent agents, Problem Solving: Solving Problems by Searching,
heuristic search techniques, constraint satisfaction problems, stochastic search methods, Game
playing: min max, alpha beta pruning, Knowledge and Reasoning: Building a Knowledge Base:
Propositional logic, first order Logic, situation calculus, Theorem Proving in First Order Logic.

UNIT II
Uncertain Knowledge and Reasoning, Overview of Probability Theory, Bayes Networks,
Undirected Graphical Models, Template Based Representations, Exact Inference: Variable
Elimination, Clique Trees, Belief Propagation, Tree Construction, Baye’s Theorem, Dempster-
Shafer theory of evidence.

UNIT III
Introduction to Optimization, Approximate Inference: Sampling, Markov Chains, Maximum
A posteriori Probability (MAP) Inference, Inference in Temporal Models, Introduction to
learning graphical models, Parameter Estimation, Bayesian Networks and Shared Parameters.

UNIT IV
Learning: Overview of different forms of learning, Learning Decision Trees, EM, Hidden
Variables, Decision Problems, Neural Networks, ANN, McCulloch Pitts Model, Perceptron
Network.

UNIT V
Statistical learning methods, k-nearest neighbor algorithm, Naïve Bayes classifier, Introduction
to Natural Language Processing.

UNIT VI
Fuzzy Logic: operations of Fuzzy sets, Variables inference techniques, defuzzification
techniques, basic Fuzzy interference algorithm, application of fuzzy logic , Fuzzy system
design implementation.

Text book:
Artificial Intelligence and Soft Computing by Amit Konar, CRC Press, Taylor and Francis
Artificial Intelligence: A Modern Approach by S.Russell and P. Norvig.

Reference Books
Nils J. Nilsson, Artificial Intelligence: A New Sythesis, Morgan,Kaufmann.
Probabilistic Graphical Models, by Daphne Koller and Nir Friedman, MIT Press.
References:
Neural Network Design, Hagan, Demuth and Beale, Vikas PublishingHouse
Fundamentals of Artificial Neural Networks, Mohamad H Hassoum.PHI
Fuzzy Set Theory & its Applica tion, H.J. Zimmerman Allied PublishedLtd.

7 
 
Computational Methods of Optimization
L T P
3 , 1 , 0 : 4 Credits Prerequisites: None

UNIT I
Classification and general theory of optimization. Linear Programming (LP): Introduction to
LP and formulation of Linear Programming problems, geometric ideas, simplex and revised
simplex methods, duality and sensitivity, interior-point methods for LP problems.

UNIT II
Graphical solution method, alternative or multiple optimal solutions, Unbounded solutions,
Infeasible solutions, Maximization , Simplex Algorithm, Minimization , Two phase method,
Duality in linear programming, Integer linear programming.

UNIT III
Transportation & Assignment Problems: Introduction to Transportation problems, various
methods of Transportation problem, Variations in Transportation problem, introduction to
Assignment problems, variations in Assignment problems.

UNIT IV
Nonlinear optimization, method of Lagrange multipliers, Karush-Kuhn-Tucker theory,
numerical methods for nonlinear optimization, convex optimization, quadratic optimization;
Dynamic programming.

UNIT V
Queuing Models: Concepts relating to queuing systems, basic elements of queuing model, role
of Poison & exponential distribution, concepts of birth and death process.
Replacement & Maintenance Models: Replacement of items, subject to deterioration of items
subject to random failure group vs. individual replacement policies.
Simulation: Introduction & steps of simulation method, distribution functions and random
number generation.

Text Books:
1. Jasbir. Arora , Introduction to optimum Design, Elsevier
2. Singeresu S. Rao, "Engineering Optimization , Theory and Practice" New Age Intl. Ltd.,
Publishers.

References:
Handy A Taha, Operations Research , An Introduction, Prentice Hall of India, New Delhi.
Hillier F S and Lieberman G J, Operations Research, Holden Day Inc., San Francisco.
Payne T A, Quantitative Techniques for Management: A Practical Approach, Reston
Publishing Co. Inc., Virginia.

8 
 
Semester I, Elective
Stochastic Models and Applications
L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Introductory Probability: Defining Random Variables (RVs) Events, Measurability,
Independence Sample Spaces, Events, Measures, Probability, Independence, Conditional
probability, Bayes’ theorem Random Variables. RVs: Bernoulli, Binomial, Geometric,
Poisson, Uniform, Exponential, Normal, Lognormal, Expectations, Moments and Moment
generating functions Random Vectors. Random Vectors: Joint and Marginal distributions,
Dependence, Covariance, Copulas, Transformations of random vectors, Order statistics.

UNIT II
Intermediate Probability: Manipulating RVs Conditioning RVs. Conditional Distribution of a
RV, Computing probabilities and expectations by conditioning, RVs Distributions.
Inequalities: Markov, Chebyshev, Jensen, Holder, Convergence of RVs: Weak and Strong
laws, Central limit theorem, Distributions of extreme.

UNIT III
Stochastic Processes: Indexing RVs Markov Chains, Markovian property and Transition
probabilities, Irreducibility and Steady, State probabilities.
Generic Applications: Hidden Markov Chains Exponential Distribution and Poisson Process,
Construction of Poisson Process from Exponential Distribution, Thinning and Conditional
Arrival Times, Service Applications: Waiting Times Normal Distribution and Brownian
Process, Construction of Brownian Process from Normal Distribution, Hitting Times and
Maximum Values, Finance Applications: Option Pricing and Arbitrage Theorem

References:
Introduction to Stochastic Processes. S.M. Ross.
Adventures in Stochastic Processes. S. Resnick. Birkhauser
Comparison Methods for Stochastic Models and Risks. A. Muller and D. Stoyan. John Wiley
& Sons
Mathematical Theoy of Reliability. R.E. Barlow and F. Proschan.

9 
 
Natural Language Processing
L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Introduction: Knowledge in Speech and Language Processing, Ambiguity, Models and
Algorithms , Language, Thought, and Understanding, The State of the Art and The Near,
Term Future, Some Brief History, Foundational Insights: 1940’s and 1950’s ,The Two
Camps: 1957,1970 ,Four Paradigms: 1970,1983, Empiricism and Finite State Models Redux:
1983,1993, The Field Comes Together: 1994,1999 , A Final Brief Note on Psychology .

UNIT III
Regular Expressions: Basic Regular Expression Patterns, Disjunction, Grouping, and
Precedence, A simple example, A More Complex Example, Advanced Operators, Regular
Expression Substitution, Memory, and ELIZA, Finite State Automata, Using an FSA to
Recognize Sheeptalk, Formal Languages, Nondeterministic FSAs, Using an NFSA to accept
strings, Recognition as Search, Relating Deterministic and Non deterministic Automata,
Regular Languages and FSAs.

UNIT IV
Morphology and Finite State Transducers: Survey of (Mostly) English Morphology,
Inflectional Morphology, Derivational Morphology, Finite State Morphological Parsing. The
Lexicon and Morphotactic, Morphological Parsing with Finite State Transducers,
Orthographic Rules and Finite State Transducers, Combining FST Lexicon and Rules ,
Lexicon free FSTs: The Porter Stemmer , Human Morphological Processing.

UNIT V
Computational Phonology and Text-to-Speech ,Speech Sounds and Phonetic Transcription ,
The Vocal Organs , Consonants: Place of Articulation, Consonants: Manner of Articulation
, Vowels , The Phoneme and Phonological Rules ,Phonological Rules and Transducers ,
Advanced Issues in Computational Phonology ,Harmony , Templatic Morphology ,
Optimality Theory ,Machine Learning of Phonological Rules , Mapping Text to Phones for
TTS, Pronunciation dictionaries, Beyond Dictionary Lookup: Text Analysis, an FST based
pronunciation lexicon, Prosody in TTS , Phonological Aspects of Prosody , Phonetic or
Acoustic Aspects of Prosody , Prosody in Speech Synthesis, Human Processing of
Phonology and Morphology.

UNIT VI
Probabilistic Models of Pronunciation and Spelling ,Dealing with Spelling Errors, Spelling
Error Patterns, Detecting Non Word Errors, Probabilistic Models, Applying the Bayesian
method to spelling, Minimum Edit Distance, English Pronunciation Variation, The Bayesian
method for pronunciation, Decision Tree Models of Pronunciation Variation, Weighted
Automata, Computing Likelihoods from Weighted Automata: The Forward Algorithm,
Decoding: The Viterbi Algorithm, Weighted Automata and Segmentation, Pronunciation in
Humans .

UNIT VII
N-grams ,Counting Words in Corpora , Simple (Unsmoothed) N-grams , More on N-grams
and their sensitivity to the training corpus, Smoothing , Add,One Smoothing , Witten,Bell
Discounting , Good-Turing Discounting, Backoff, Combining Backoff with Discounting
10 
 
 ,Deleted Interpolation , N-grams for Spelling and Pronunciation , Context, Sensitive Spelling
Error Correction , N-grams for Pronunciation Modeling, Entropy , Cross Entropy for
Comparing Models , The Entropy of English

UNIT VIII
HMMs and Speech Recognition ,Speech Recognition Architecture , Overview of Hidden
Markov Models , The Viterbi Algorithm Revisited , Advanced Methods for Decoding , A
Decoding , Acoustic Processing of Speech , Sound Waves , How to Interpret a Waveform ,
Spectra , Feature Extraction , Computing Acoustic Probabilities , Training a Speech
Recognizer , Waveform Generation for Speech Synthesis , Pitch and Duration Modification
, Unit Selection , Human Speech Recognition

UNIT IX
Syntax: Word Classes and Part-of-Speech Tagging , Context Free Grammars for English ,
Parsing with Context Free Grammars , Features and Unification , Lexicalized and
Probabilistic Parsing , Language and Complexity

UNIT X
Semantics: Representing Meaning , Semantic Analysis , Lexical Semantics , Word Sense
Disambiguation and Information Retrieval

UNIT XI
Pragmatics: Discourse , Dialogue and Conversational Agents , Generation , Machine
Translation

UNIT XII
Miscellaneous: Regular Expression Operators , The Porter Stemming Algorithm , C5 and
C7 tag sets , Training HMMs: The Forward-Backward Algorithm

Text Books:
Daniel Jurafsky and James H Martin. Speech and Language Processing, 2e, Pearson
Education.

Reference Books:
1 James A. Natural language Understanding 2e, Pearson Education.
2. Bharati A., Sangal R., ChaitanyaV.. Natural language processing: a Paninian perspective,
PHI.
3. Siddiqui T., Tiwary U. S..Natural language processing and Information retrieval, OUP.

11 
 
 Soft Computing
L T P Prerequisites: None
3 , 0 , 0 : 3 Credits

UNIT I
Introduction to Soft Computing, Evolution of Computing ,Soft Computing Constituents , From
Conventional Artificial Intelligence to Computational Intelligence, Machine Learning Basics.

UNIT II
Fuzzy sets and Fuzzy logic: Introduction, Fuzzy sets versus crisp sets, operations on fuzzy sets,
Extension principle, Fuzzy relations and relation equations, Fuzzy numbers, Linguistic
variables, Fuzzy logic, Linguistic hedges, Applications, fuzzy controllers, fuzzy pattern
recognition, fuzzy image processing, fuzzy database.

UNIT III
Artificial Neural Network: Introduction, basic models, Hebb's learning, Adaline, Perceptron,
Multilayer feed forward network, Back propagation, Different issues regarding convergence of
Multilayer Perceptron, Competitive learning, Self Organizing Feature Maps, Adaptive
Resonance Theory, Associative Memories

UNIT IV
Evolutionary and Stochastic techniques: Genetic Algorithm (GA), different operators of
Genetic Algorithm, Analysis of selection operations, Hypothesis of building Blocks, Schema
theorem and convergence of Genetic Algorithm, Simulated annealing and Stochastic models,
Boltzmann Machine, Applications. Rough Set: Introduction, Imprecise Categories
Approximations and Rough Sets, Reduction on of Knowledge, Decision Tables, and
Applications.

UNIT V
Hybrid Systems : Neural,Network,Based Fuzzy Systems, Fuzzy Logic,Based Neural
Networks, Genetic Algorithm for Neural Network Design and Learning, Fuzzy Logic and
Genetic Algorithm for Optimization,
Text Book
Amit Konar, “Computational Intelligence: Principles, Techniques and Applications”, Springer

Books/References:
Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall.
David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”,
Addison Wesley.
S. Haykin, “Neural Networks”, Pearson Education, 2ed.
S. Rajasekaran & G. A. V. Pai , Neural Networks, Fuzzy logic, and Genetic Algorithms, PHI.
5. Fuzzy Sets and Fuzzy Logic, Klir & Yuan, PHI.
Rough Sets, Z. Pawlak, Kluwer Academic Publisher.
Neural Networks, Fuzzy logic, and Genetic Algorithms, S. Rajasekaran and G. A. V. Pai, PHI.
Intelligent Hybrid Systems, D. Ruan, Kluwer Academic Publisher.

12 
 
 Data Mining
L T P Prerequisites: None
3 , 0 , 0 : 3 Credits

UNIT I
Introduction: Basics of Data Mining, Data Mining Functionalities, Classification of Data
Mining Systems, Data Mining Issues, Data Mining Goals, Stages of the Data Mining Process.

UNIT II
Data Mining Techniques: Statistics, Similarity Measures, Decision Trees, Neural Networks,
Genetic Algorithms.

UNIT III
Mining Association Rules : Basic Algorithms, Parallel and Distributed algorithms,
Comparative study, Incremental Rules, Advanced Association Rule Technique, Apriori
Algorithm, Partition Algorithm, Dynamic Item set Counting Algorithm, FP tree growth
Algorithm, Boarder Algorithm.

UNIT IV
Clustering Techniques: Partitioning Algorithms, K, means Algorithm, CLARA, CLARANS,
Hierarchical algorithms, DBSCAN, ROCK.

UNIT V
Classification Techniques: Statistical based, Distance based, Decision Tree, based Decision
tree.

UNIT VI
Applications and Trends in Data Mining: Applications, Advanced Techniques , Web Mining,
Web Content Mining, Structure Mining.

Text Books:
Roiger & Geatz, Data Mining, Pearson Education
A.K.Pujari, Data Mining, University Press
M. H. Dunham. Data Mining: Introductory and Advanced Topics. Pearson Education.
J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufman.

References Books:
1) I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques.
Morgan Kaufmann.
2) D. Hand, H. Mannila and P. Smyth. Principles of Data Mining. Prentice,Hall.

13 
 
 Cognitive science
LT P Prerequisites: None
3,0,0:3Credits

UNIT I
Basic neuroanatomy, Physical layout of the brain, names of important components and their
functions, e.g. cortex, cerebellum, brainstem etc.

UNIT II
Neuron, structure, components, action potentials, synapses, nervous system, nerves, receptors,
connectivity, speed, structure etc.

UNIT III
Psychophysics: absolute and difference thresholds, Weber’s law, Fechner’s Law.

UNIT IV
Learning: Associative and non,associative learning, Pavlovian conditioning, Hebbian learning,
model of memory, working memory, phonological loop, visuo,spatial sketchpad, central
executive), types of memory (explicit, implicit), memory inhibition effects, e.g. blocking,
interference etc. Long,term memory: encoding, retrieval, forgetting.

UNIT V
Visual perception: basics of color, depth and motion perception, perceptual constancy, and
principles of perceptual organization, Basics of hypothesis testing (e.g. t,test, chi,square,
ANOVA), significance, p,value, error types, power and size effects.

Ref Books:
Clifford Morgan, Richard King (2017) Introduction to Psychology. 7th Edition. McGraw Hill.
Stangor. MIT , Introduction to Psychology (Open Source , free to download on the internet)
David G. Myers. Psychology. Macmillan Indian Edition.
Cohen, B.H. Explaining Psychological Statistics. 4th Ed. John Wiley & Sons.
Mangal, S.K. Statistics in Psychology and Education. 2nd Ed. Prentice Hall India.

14 
 
Semester I Elective II

EXPERT SYSTEMS
LT P Prerequisites: None
3,0,0:3Credits

UNIT I
Introduction to AI: Intelligent agents, Perception, Natural language processing, Problem,
Solving agents, Searching for solutions: Uniformed search strategies, Informed search
strategies.

UNIT II
Adversarial search, Optimal and imperfect decisions, Alpha, Beta pruning, Logical agents:
Propositional logic, First order logic, Syntax and semantics, Using first order logic, Inference
in first order logic.

UNIT III
Uncertainty, acting under uncertainty, Basic probability notation, Axioms of probability,
Baye’s rule, Probabilistic reasoning, making simple decisions.

UNIT IV
Planning: Planning problem, Partial order planning, Planning and acting in non, deterministic
domains, Learning: Learning decision trees, Knowledge in learning, Neural networks ,
Reinforcement learning , Passive and active.

UNIT V
Definition, Features of an expert system, Organization, Characteristics, Prospector, Knowledge
Representation in expert systems, Expert system tools, MYCIN, EMYCIN.

Text Books:

Stuart Russel and Peter Norvig, ‘Artificial Intelligence A Modern Approach’, Second Edition,
Pearson Education, PHI.
Donald A.Waterman, ‘A Guide to Expert Systems’, Pearson Education.

References:

George F.Luger, ‘Artificial Intelligence, Structures and Strategies for Complex Problem
Solving’, Fourth Edition, Pearson Education.

Elain Rich and Kevin Knight, ‘Artificial Intelligence’, Second Edition Tata McGraw Hill.

15 
 
 COMPUTER VISION

LT P Prerequisites: None
3,0,0:3Credits

UNIT I
Digital Image Formation and low, level processing: Overview and State of the art,
Fundamentals of Image Formation, Transformation: Orthogonal, Euclidean, Affine, Projective,
etc, Fourier Transform, Convolution and Filtering, Image Enhancement, Restoration,
Histogram Processing.
Depth estimation and Multi camera views:
Perspective, Binocular Stereopsis: Camera and Epipolar Geometry, Homography,
Rectification, DLT, RANSAC, 3D reconstruction framework, Auto calibration.

UNIT II
Feature Extraction: Edges , Canny, LOG, DOG, Line detectors (Hough Transform), Corners ,
Harris and Hessian Affine, Orientation Histogram, SIFT, SURF, HOG, GLOH, Scale, Space
Analysis, Image Pyramids and Gaussian derivative filters, Gabor Filters and DWT.
Image Segmentation: Region Growing, Edge Based approaches to segmentation, Graph, Cut,
Mean, Shift, MRFs, Texture Segmentation, Object detection.

UNIT III
Pattern Analysis:
Clustering: K-Means, K-Medoids, Mixture of Gaussians, Classification: Discriminant
Function, Supervised, Un-supervised, Semi-supervised, Classifiers: Bayes, KNN, ANN
models, Dimensionality Reduction: PCA, LDA, ICA, Nonparametric methods.

UNIT IV
Motion Analysis: Background Subtraction and Modeling, Optical Flow, KLT, Spatio,
Temporal Analysis, Dynamic Stereo, Motion parameter estimation.
Shape from X: Light at Surfaces, Phong Model, Reflectance Map, Albedo estimation,
Photometric Stereo, Use of Surface Smoothness Constraint, and Shape from Texture, color,
motion and edges.

UNIT V
Miscellaneous: Applications: CBIR, CBVR, Activity Recognition, computational
photography, Biometrics, stitching and document processing, Modern trends , super-resolution,
GPU, Augmented Reality, cognitive models, fusion and SR&CS.

Text Books:
Szeliski, R., Computer Vision: Algorithms and Applications, Springer, Verlag London .
Forsyth, A., D. and Ponce, J., Computer Vision: A Modern Approach, Pearson Education.

References:
Hartley, R. and Zisserman, A., Multiple View Geometry in Computer Vision Cambridge
University Press.
Fukunaga, K.,Introduction to Statistical Pattern Recognition, Academic Press, Morgan
Kaufmann.

16 
 
 Bioinformatics
L T P
3 , 0 , 0 : 3 Credits Prerequisites: None
UNIT I
History of bioinformatics, History of Bioinformatics, role of Bioinformatics in biological
sciences, scope of bioinformatics, Division of Bioinformatics, Bioinformatics and internet,
challenges in Bioinformatics.

UNIT II
Databases in bioinformatics, Databases in Bioinformatics, Genbank, NCBI, EMBL, DDBJ ,
UniGene, SGD, EMI Genomes, ,protein databases, PIR, SWISSPROT, TrEMBL,
PrositePRINTS ,structural databases, PDB, SCOP, CATH, PDB_SELECT, PDBSUM, DSSP,
FSSPDALI, PRODOM, protein families & pattern databases, Pfam, KEGG , sequence storage
sequence accuracy, EST,STS, sequence retrieval systems, Entrez, SRS, sequence query
refinement using Boolean operators, limits, preview, history and index.

UNIT III
Sequence submission, Sequence submission tools, BANKIT, SEQUIN, WEBIN, SAKURA
literature databases, PubMed and midline, Data mining and its techniques, data warehousing,
Sequence annotation, principles of genome annotation, annotation tools & resources.

UNIT IV
Applications of bioinformatics, Applications of Bioinformatics, phylogenetic analysis steps
in phylogenetic analysis, microarrays, DNA and protein microarrays.
Bioinformatics in pharmaceutical industry, informatics & drug, discovery, pharma informatics
resources drug discovery and designing, SNP. File formats, File formats, raw/plain format,
NCBI, Genbank flat file format, ASN.1, GCGFASTA, EMBL, NBRF, PIR, swissprot
sequence formats, PDB format, Introduction to structure prediction methods.
Books / References :
Bioinformatics: David Mount
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic acids, R. Durbin,
S.R. Eddy, A. Krogh and G. Mitchison.

17 
 
 Information Retrieval
L T P
3 , 0 , 0 : 3 Credits Prerequisites: None
UNIT I
Basic Concepts of IR, Data Retrieval & Information Retrieval, IR system block diagram.
Automatic Text Analysis, Luhn's ideas, Conflation Algorithm, Indexing and Index Term
Weighing, Probabilistic Indexing, Automatic Classification, Measures of Association,
Different Matching Coefficient, Classification Methods, Cluster Hypothesis. Clustering
Algorithms, Single Pass Algorithm, Single Link Algorithm, Rochhio's Algorithm and
Dendograms.

UNIT II
File Structures, Inverted file, Suffix trees & suffix arrays, Signature files, Ring Structure, IR
Models, Basic concepts, Boolean Model, Vector Model, and Fuzzy Set Model. Search
Strategies, Boolean search, serial search, and cluster based retrieval, Matching Function.

UNIT III
Performance Evaluation, Precision and recall, alternative measures reference collection (TREC
Collection), Libraries & Bibliographical system, Online IR system, OPACs, Digital libraries ,
Architecture issues, document models, representation & access, Prototypes, projects &
interfaces, standards.

UNIT IV
Taxonomy and Ontology: Creating domain specific ontology, Ontology life cycle Distributed
and Parallel IR: Relationships between documents, Identify appropriate networked collections,
multiple distributed collections, parallel IR, MIMD Architectures, Distributed IR, Collection
Partitioning, Source Selection, and Query Processing.

UNIT V
Multimedia IR models & languages, data modelling, Techniques to represent audio and visual
document, query languages Indexing & searching, generic multimedia indexing approach,
Query databases of multimedia documents, Display the results of multimedia searches, one
dimensional time series, two dimensional color images, automatic feature extraction.

UNIT VI
Searching the Web, Challenges, Characterizing the Web, Search Engines, Browsing, Mata
searchers, Web crawlers, robot exclusion, Web data mining, Metacrawler, Collaborative
filtering, Web agents (web shopping, bargain finder,..), Economic, ethical, legal and political
issues
Text Books :
Yates &Neto, "Modern Information Retrieval", Pearson Education, ISBN 81,297,0274,6
C.J. Rijsbergen, "Information Retrieval", (www.dcs.gla.ac.uk)
I. Witten, A. Moffat, and T. Bell, “Managing Gigabytes”
D. Grossman and O. Frieder “Information Retrieval: Algorithms and Heuristics”
References:
Mark leven, “Introduction to search engines and web navigation”, John Wiley and sons Inc., ISBN
9780,170,52684,2.
V. S. Subrahamanian, Satish K. Tripathi “Multimedia information System”, Kulwer Academic Publisher
ChabaneDjeraba, ”Multimedia mining A highway to intelligent multimedia documents”, Kulwer Academic
Publisher, ISBN 1,4020,7247,3

18 
 
 AI for Cyber Security
L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Introduction: Understanding Cyber security , Looking at the Various Aspects of Cyber
security, Social engineering and phishing , Introducing ransom ware, Malware intrusion,
Non-malware intrusion, Detect, Respond, and Mitigate, Responding to and Recovering From
Cyber attacks and Security Events, Meeting the Challenges of Cyber security,

UNIT II
Fathoming Artificial Intelligence: Teaching Machines to be Smarter , Learning Algorithms
, Supervised learning , Unsupervised learning , Being Smarter , Interacting with Humans ,
Natural Language Processing.

UNIT III
Discovering Machine Learning and Deep Learning: Deep Learning and Deeply Layered
Neural Networks , Introducing cognitive computing , Structured and Unstructured Data.

UNIT IV
Applying Machine Learning and Deep Learning to Cyber security: Predictive Analytics ,
Taught Not Programmed , Uncovering the needle in the haystack , Introducing cognitive
computing , Identifying root cause , A Smarter Adversary.

UNIT V
Using the Cognitive Capabilities of Watson to Investigate Security Incidents, Taking
Intelligent Action , Understand, Reason, and Learn , Applying Watson and Qradar, Winning
with Threat Intelligence.

UNIT VI
Ten Trends in Cyber security, Responding to Ransom ware , Combining Application
Development and Cyber security, Using Deep Learning to Detect DGA, Generated Domains
, Detecting Non-Malware Threats , Adaptive Honeypots and Honeytokens , Gaining a Better
Understanding of How Neural Networks Work , Employing Capsule Networks , Deep
Reinforcement Learning , Protecting the IoT , Predicting the Future.

UNIT VII
Artificial Intelligence and International Security : AI Trends and Strategies ,Forecasting and
Mapping AI Development , Country Strategies.

UNIT VIII
Theoretical Background: International Relations Frameworks, Relevant Strategic Concepts,
Bargaining ,Verification and Enforcement , Communication, Signaling and Perception ,
Deterrence and Assurance , The Offense, Defense Balance , Norms, Institutions and
Regimes.

19 
 
 UNIT IX
Arms Control and Artificial Intelligence , The History of Arms Control , The (U.S.) Politics
of Arms Control , The Role of Ideas, Scientists, and Experts , The Intellectual History of
Arms Control Thinking.

UNIT X
Race Dynamics : The Idea of an Artificial Intelligence Race , International Relations: Arms
Races , International Relations: The Diffusion of Technology, Strategy, and Arms ,
International Relations: Diffusion, Development, and Conflict , International Relations: Case
Studies , Economics: Race and Innovation Models , Economics: Case Studies.

UNIT XI
Technological Analogies : Dual, Use Technology , General Purpose Technology , Nuclear
, Cyber , Biotechnology.

UNIT XII
Government and Technology.

UNIT XIII
Fundamental Security Properties and Mechanisms: Development of Secure Software , Cyber
Threat Hunting and Digital Forensics , Security of Control and Embedded Systems , Machine
Learning and Adaptive Intelligence , Scalable Machine Learning , Text Processing , Natural
Language Processing .

Text Books:

Artificial Intelligence & Cybersecurity For Dummies, IBM Limited Edition.

Reference Books:

1. AI in Cybersecurity, Sikos, Leslie F. (Ed.)

20 
 
 Laboratory I(Advanced Data Structures and Algorithms)
L T P
0 , 0 , 3 : 2 Credits Prerequisites: None

Experiment 1 (Arrays, Linked List, Stacks, Queues, Binary Trees )

I. WAP to implement a 3,stacks of size ‘m’ in an array of size ‘n’ with all the basic
operations such as IsEmpty(i), Push(i), Pop(i), IsFull(i) where ‘i’ denotes the stack
number (1,2,3), m ≅ n/3. Stacks are not overlapping each other. Leftmost stack facing
the left direction and other two stacks are facing in the right direction.
II. WAP to implement 2 overlapping queues in an array of size ‘N’. There are facing in
opposite direction to eachother. Give IsEmpty(i), Insert(i), Delete(i) and IsFull(i)
routines for ith queue
III. WAP to implement Stack ADT using Linked list with the basic operations as Create(),
Is Empty(), Push(), Pop(), IsFull() with appropriate prototype to a functions.
IV. WAP to implement Queue ADT using Linked list with the basic functions of Create(),
IsEmpty(), Insert(), Delete() and IsFull() with suitable prototype to a functions

Experiment 2 (Sorting & Searching Techniques)

Experiment 3 (Hashing)

I. WAP to store k keys into an array of size n at the location computed using a hash
function, loc = key % n, where k<=n and k takes values from [1 to m], m>n. To handle
the collisions use the following collision resolution techniques,
a. Linear, Quadratic, Random probing, Double hashing/rehashing, Chaining.

Experiment 4 (BST and Threaded Trees)

Experiment 5 (AVL Trees and Red,Black Trees)
Experiment 6 ( B,Trees)
Experiment 7 (Min,Max Heaps, Binomial Heaps and Fibonacci Heaps )
Experiment 8 (Disjoint Sets)
Experiment 9 (Graphs Algorithms)
Experiment 10 (String Matching)

21 
 
Semester II
Robotics and Automation
L T P
3 , 1 , 0 : 4 Credits Prerequisites: None

UNIT I
Robotics Foundations: Kinematics , Dynamics , Mechanisms and Actuation , Sensing and
Estimation , Motion Planning , Motion Control , Force Control , Robotic Systems
Architectures and Programming , AI Reasoning Methods for Robotics.

UNIT II
Robot Structures: Performance Evaluation and Design Criteria , Redundant Manipulators
Parallel Mechanisms and Robots , Robots with Flexible Elements , Model Identification ,
Robot Hands , Legged Robots , Wheeled Robots , Micro/Nano Robots.

UNIT III
Sensing and Perception: Force and Tactile Sensors , Inertial Sensors, GPS and Odometry,
Sonar Sensing , Range Sensors , 3D Vision and Recognition , Visual Servoing and Visual
Tracking , Sensor Fusion.

UNIT IV
Manipulation and Interfaces: Motion for Manipulation Tasks , Modelling and Manipulation
, Grasping , Cooperative Manipulators, Haptics, Telerobotics, Networked Teleoperation,
Exoskeletons for Human Performance Augmentation.

UNIT V
Mobile and Distributed Robotics: Motion Control of Wheeled Mobile Robots , Motion
Planning and Obstacle Avoidance , World Modeling , Simultaneous Localization and
Mapping , Behavior Based Systems , Distributed and Cellular Robots , Multiple Mobile
Robot Systems , Networked Robots.

UNIT VI
Field and Service Robotics: Industrial Robotics, Underwater Robotics, Aerial Robotics,
Space Robots and Systems, Chap. 46. Robotics in Agriculture and Forestry, Robotics in
Construction, Robotics in Hazardous Applications, Mining Robotics , Search and Rescue
Robotics, Intelligent Vehicles, Medical Robots and Systems, Rehabilitation and Health Care
Robotics , Domestic Robots, Robots for Education.

UNIT VII
Human-Centered and Life Like Robotics: Humanoids , Safety for Physical Human Robot
Interaction , Social Robots that Interact with People , Robot Programming by Demonstration
, Biologically, Inspired Robots , Evolutionary Robotics, Neurorobotics: From Vision to
Action Perceptual Robotics, Roboethics: Social and Ethical Implications.

Text Books:
1. Introduction to Robotics: Mechanics & Control, 3ed, J. Craig, Prentice Hall, 2004.
2. Robot Modeling and Control, M. Spong, S. Hutchinson, M. Vidyasagar, Wiley, 2005.
3. Fundamentals of Robotics: Analysis and Control, Robert J. Schilling, Prentice Hall,
1990.
4. Theory of Applied Robotics 2nd Ed., R. Jazar, Springer, 2010.
22 
 
 Machine Learning
L T P
3 , 1 , 0 : 4 Credits Prerequisites: None

UNIT I
Supervised Learning (Regression/Classification), Basic methods: Distance-based methods,
Nearest-Neighbors, Decision Trees, Naive Bayes, Linear models: Linear Regression, Logistic
Regression, Generalized Linear Models, Unsupervised Learning , Clustering: K-means/Kernel
K-means, Dimensionality Reduction: PCA and kernel PCA , Matrix Factorization and Matrix
Completion, Generative Models (mixture models and latent factor models).

UNIT II
Support Vector Machines, Nonlinearity and Kernel Methods, Beyond Binary Classification:
Multi-class/Structured Outputs, Ranking, Streaming algorithms and Naive Bayes, fast nearest
neighbor, parallel perceptrons, parallel SVM, randomized algorithms, hashing, sketching,
scalable SGD, parameter servers, graph-based semi-supervised learning, scalable link analysis.

UNIT III
Evaluating Machine Learning algorithms and Model Selection, Introduction to Statistical
Learning Theory, Ensemble Methods (Boosting, Bagging, Random Forests) , Sparse Modeling
and Estimation, Modeling Sequence/Time, Series Data, Deep Learning and Feature
Representation Learning .

UNIT IV
Scalable Machine Learning (Online and Distributed Learning) A selection from some other
advanced topics, e.g., Semi, supervised Learning, Active Learning, Reinforcement Learning,
Inference in Graphical Models, Introduction to Bayesian Learning and Inference.

UNIT V
Recent trends in various learning techniques of machine learning and classification methods
for IOT applications, Various models for IOT applications.

Text Books:
T. Mitchell, Machine Learning, McGrawHill.
Machine Learning by V. K. Jain
APPLIED MACHINE LEARNING by M. GOPAL, MC Graw Hill
References:
Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012

23 
 
 Computational Linear Algebra

L T P Prerequisites: None
3 , 1 , 0 : 4 Credits

UNIT I
Fundamental operation with vectors in Euclidean space Rn , Linear combination of Schwarz
inequality, Trianglevectors, Dot product and their properties, Cauchy inequality, Projection
vectors, Some elementary results on vector in Rn , Matrices, Gauss, Jordan row reduction,
Reduced row echelon form, Row equivalence, Rank, Linear combination of vectors, Row
space, Eigenvalues, Eigenvectors, Eigenspace, Characteristic polynomials, Diagonalization of
matrices, Definition and examples of vector space, Some elementary properties of vector
spaces, Subspace.

UNIT II
Span of a set, A spanning set for an eigenspace, Linear independence and linear dependence of
vectors, Basis and dimension of a vector space, Maximal linearly independent sets, Minimal
spanning sets, Application of rank, Homogenous and non homogenous systems of equations,
Coordinates of a vector in ordered basis, Transition matrix, Linear transformations: Definition
and examples, Elementary properties, The matrix of a linear transformation, Linear operator
and Similarity.

UNIT III
Application: Computer graphics, Fundamental movements in a plane, Homogenous
coordinates, Composition of movements, Kernel and range of a linear transformation,
Dimension theorem, One to one and onto linear transformations, Invertible linear
transformations, Isomorphism: Isomorphic vector spaces (to Rn ), Orthogonal and orthonormal
vectors, Orthogonal and orthonormal bases, Orthogonal complement, Projection theorem
(Statement only), Orthogonal projection onto a subspace, Application: Least square solutions
for inconsistent systems.

Textbooks
Introduction to Linear Algebra, Fifth Edition, Gilbert Strang.
Linear Algebra Done Right, Third Edition.
No Bullshit Guide To Linear Algebra, Ivan Savov.
Matrix Computations, Gene Golub and Charles Van Loan.
Numerical Linear Algebra, Lloyd Trefethen and David Bau.

24 
 
Semester II Elective III

Agent based intelligent system

L T P Prerequisites: None
3 , 0 , 0 : 3 Credits

UNIT I
Definitions , Foundations , History , Intelligent Agents, Problem Solving, Searching,
Heuristics, Constraint Satisfaction Problems , Game playing.

UNIT II
Logical Agents, First order logic, First Order Inference, Unification, Chaining, Resolution
Strategies, Knowledge Representation, Objects, Actions, and Events

UNIT III
Planning Problem, State Space Search, Partial Order Planning, Graphs, Nondeterministic
Domains, Conditional Planning, Continuous Planning, MultiAgent Planning.

UNIT IV
Acting under uncertainty , Probability Notation, Bayes Rule and use , Bayesian Networks,
Other Approaches, Time and Uncertainty, Temporal Models, Utility Theory , Decision
Network , Complex Decisions.

UNIT V
Knowledge in Learning, Relevance of Information, Statistical Learning Methods,
Reinforcement Learning, Communication, Formal Grammar, Augmented Grammars, Future
of AI.

Text Book:
Stuart Russell and Peter Norvig, “Artificial Intelligence , A Modern Approach”,2nd Edition,
Prentice Hall, 2002

References
Michael Wooldridge, “An Introduction to Multi Agent System”, John Wiley.
Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW.
Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House.

25 
 
 Automated Reasoning

L T P Prerequisites: None
3 , 0 , 0 : 3 Credits

UNIT II
Introduction and Motivation: Role of logic in Computer Science, problem representation.

UNIT II
Basic Notions: Language, models, interpretations, validity, proof, decision problems in logic,
decidability.

UNIT III
Propositional Logic: Syntax, semantics, proof systems, Validity, satisfiability, unsatisfiability,
soundness and completeness.

UNIT IV
Truth tables, normal forms, semantic tableau, resolution, proof by contradiction, example.

UNIT V
First Order Predicate Logic Theory: Quantifiers, first order models, validity and satisfiability,
semantic tableaux.

UNIT VI
Normal Forms and Skolemization: Elimination of quantifiers, unification, resolution and
various resolution strategies, equality axioms and para-modulation, Horn formulas and
programs, Prolog as a restricted resolution-based theorem prover, Undecidability and
incompleteness in logic, compactness Theorem.

UNIT VII
Introduction to Modal Logic, Temporal Logic and other logics for concurrency, Some exposure
to theorem proving systems such as Prolog, PVS, SPIN, etc.

References
Michael Huth and Mark Ryan, Logic in Computer Science: Modelling and Reasoning about
Systems, Cambridge University Press.
Arindama Singh, Logics for Computer Science, Prentice Hall of India.
C. L. Chang and R. C. T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic
Press.
M. Ben,Ari, Mathematical Logic for Computer Science, Springer.
E. Mendelson, Introduction to Mathematical Logic, Chapman and Hall.

26 
 
 Deep Learning

L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Basics of Deep leaning, Deep learning architectures: Convolutional Neural Networks : Neurons
in Human Vision ,The Shortcomings of Feature Selection, Vanilla Deep Neural Networks
Don’t Scale Filters and Feature Maps, Full Description of the Convolutional Layer, Max
Pooling, Full Architectural Description of Convolution Networks, Closing the Loop on MNIST
with Convolutional Networks, Image Preprocessing Pipelines Enable More Robust Models,
Accelerating Training with Batch Normalization.

UNIT II
Building a Convolutional Network for CIFAR-10, Visualizing Learning in Convolutional
Networks Leveraging Convolutional Filters to Replicate Artistic Styles, Learning
Convolutional Filters for Other Problem Domains, Training algorithms.

UNIT III
Memory Augmented Neural Networks : Neural Turing Machines, Attention, Based Memory
Access, NTM Memory Addressing Mechanisms, Differentiable Neural Computers,
Interference, Free Writing in DNCs, DNC Memory Reuse, Temporal Linking of DNC Writes,
Understanding the DNC Read Head, The DNC Controller Network Visualizing the DNC in
Action, Implementing the DNC in Tensor Flow, Teaching a DNC to Read and Comprehend.

UNIT IV
Deep Reinforcement Learning: Deep Reinforcement Learning Masters Atari Games, What Is
Reinforcement Learning, Markov Decision Processes (MDP), Explore Versus Exploit Policy
versus Value Learning, Pole Cart with Policy Gradients, Q-Learning and Deep Q-Networks,
Improving and Moving Beyond DQN.

UNIT V
Implementing Neural Networks in TensorFlow : What Is TensorFlow?, How Does TensorFlow
Compare to Alternatives?,Installing TensorFlow, Creating and Manipulating TensorFlow
Variables, TensorFlow Operations, Placeholder Tensors, Sessions in TensorFlow, Navigating
Variable Scopes and Sharing Variables, Managing Models over the CPU and GPU, Specifying
the Logistic Regression Model in TensorFlow, Logging and Training the Logistic Regression
Model, Leveraging Tensor Board to Visualize Computation Graphs and Learning, Building a
Multilayer Model for MNIST in TensorFlow. Applications: Deep learning for computer vision,
Deep Learning Applications at the Enterprise Scale, Deep Learning Models for Healthcare
Applications.

Reference:
Nikhil Buduma, Nicholas Locascio, “Fundamentals of Deep Learning: Designing Next
Generation Machine Intelligence Algorithms”, O'Reilly Media.
Ian Goodfellow, Yoshua Bengio, Aaron Courville, ”Deep Learning (Adaptive Computation
and Machine Learning series”, MIT Press.

27 
 
 Data Visualization

L T P Prerequisites: None
3 , 0 , 0 : 3 Credits

UNIT I
Importance of analytics and visualization in the era of data abundance, Review of probability,
statistics and random processes, Brief introduction to estimation theory.

UNIT II
Introduction to machine learning, supervised and unsupervised learning, gradient descent,
overfitting, regularization etc. , Clustering techniques: K-means, Gaussian mixture models and
expectation-maximization, agglomerative clustering, evaluation of clustering , Rand index,
mutual information based scores, Fowlkes-Mallows index etc. , Regression: Linear models,
ordinary least squares, ridge regression, LASSO, Gaussian Processes regression. , Supervised
classification methods: K-nearest neighbor, naive Bayes, logistic regression, decision tree,
support vector machine. , Sparse coding and dictionary learning, orthogonal matching pursuit.
, Introduction to artificial neural networks (ANNs), deep NNs, convolutional neural network
(CNN), and other recent topics.

UNIT III
Data visualization: Basic principles, categorical and continuous variables. , Exploratory
graphical analysis. , Creating static graphs, animated visualizations, loops, GIFs and Videos. ,
Data visualization in Python and R, examples from Bokeh, Altair, ggPlot, ggplot2, gganimate,
Image Magick etc. , Introduction to Visualization Toolkit (VTK) for 3D computer graphics,
image processing and visualization. , Visualization for deep learning

REFERENCE BOOKS

Jerome H. Friedman, Robert Tibshirani, and Trevor Hastie, The Elements of Statistical
Learning, Springer.
Christopher Bishop, Pattern Recognition and Machine Learning, Springer.
David G. Stork, Peter E. Hart, and Richard O. Duda, Pattern Classification (2nd edition),
Wiley.
Edward Tufte, The Visual Display of Quantitative Information (2nd edition), Graphics Press.
Colin Ware, Information Visualization: Perception for Design (2nd edition), Morgan
Kaufmann.
Alberto Cairo, The Functional Art: An Introduction to Information Graphics and Visualization,
New Riders, Pearson Education.
Nathan Yau, Data Points: Visualization That Means Something, Wiley.
Charles D. Hansen and Chris R. Johnson, Visualization Handbook, Academic Press.
Will Schroeder, Ken Martin, and Bill Lorensen, The Visualization Toolkit: An Object,Oriented
Approach to 3D Graphics, Kitware Inc. Publishers.

28 
 
Elective IV

Affective Computing and Interaction

L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Overview of affective computing, Background on emotion research from psychology and
neuroscience & its relevance to affective computing, Emotionally Intelligent Human Computer
Interaction, Emotion and Perception, Decision-making, and Creativity Emotion and Learning,
Physiology of Emotion.

UNIT II
Neuroscience Findings Related to Emotion, Affect Recognition by Machines (include wearable
systems),,Communicating Frustration / Stress in Autism and in Customer Experience,
Responding to User Emotion to Reduce User Frustration ,Inducing Emotion, Emotion sensing
and recognition, Emotion expression. Emotion modeling, overview, applied models, Models
of emotion generation, Models of emotion effects on cognition and behavior.

UNIT III
Design guidelines for emotion models, Cognitive, affective agent architectures, Affect,
adaptive HCI, Affective user modeling, Applications in affective virtual agents & social
robotics. Emotion and Behavior Expression of Emotion by Machines, Agents, Synthetic
characters.

UNIT IV
Affective gaming, Ethical considerations, Philosophical, Social, Ethical Implications of
Affective Computing Machine / Mobile Empathy and Emotional Support Lie Detection and
Stress Detection

Books:

1. Picard, R.W. (2000). Affective Computing. The MIT Press.

2. Calvo, R.A., D'Mello, S.K., Gratch, J., and Kappas, A. The Oxford Handbook of
Affective Computing. Oxford University Press.

29 
 
 Inferential Statistics

L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Probability Theory: Sample Spaces, Events , Axioms , Counting , Conditional Probability and
Bayes’ Theorem , The Binomial Theorem , Random variable and distributions : Mean and
Variance of a Random variable, Binomial, Poisson, Exponential and Normal distributions.

UNIT II
Curve Fitting and Principles of Least Squares, Regression and correlation. Sampling
Distributions & Descriptive Statistics: The Central Limit Theorem, distributions of the sample
mean and the sample variance for a normal population, Sampling distributions (Chi,Square, t,
F, z). Test of Hypothesis, Testing for Attributes , Mean of Normal Population , One-tailed and
two-tailed tests, F-test and Chi-Square test , , Analysis of variance ANOVA , One way and two
way classifications. Tabular data, Power and the computation of sample size, advanced data
handling multiple regression, linear models, Logistic regression, Rates and Poisson regression
Nonlinear curve fitting. Density Estimation, Recursive Partitioning, Smoothers and
Generalized Additive Models , Survivals Analysis, Analyzing Longitudinal Data,
Simultaneous Inference and Multiple Comparisons, Meta Analysis,

UNIT III
Principal Component Analysis, Multidimensional Scaling Cluster Analysis. Introduction to R,
Packages, Scientific Calculator, Inspecting Variables, Vectors Matrices and Arrays, Lists and
Data Frames, Functions, Strings and Factors, Flow Control and Loops, Advanced Looping,
Date and Times.

UNIT IV
Introduction to Python Packages, Fundamentals of Python, Inserting and Exporting Data, Data
Cleansing Checking and Filling Missing Data, Merging Data, Operations, Joins.

Text Book:

1. Sheldon M. Ross,” Introduction to Probability and Statistics for Engineers and

Scientists”.
2. Richard Cotton, “Learning R”, O’Reilly.
3. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business Media.
4. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition LLC.
5. Samir Madhavan, “Mastering Python for Data Science”, Packt.

30 
 
 Internet of Things(IOT)

L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Internet of things: Overview, technology of the internet of things, enchanted objects, Design
principles for connected devices, Privacy, Web thinking for connected devices .

UNIT II
Writing Code: building a program and deploying to a device, writing to Actuators, Blinking
Led, Reading from Sensors, Light Switch, Voltage Reader, Device as HTTP Client, HTTP,
Push Versus Pull Pachube, Netduino, Sending HTTP Requests—the Simple Way, Sending
HTTP Requests—the Efficient Way HTTP: Device as HTTP Server, Relaying Messages to
and from the Netduino.

UNIT III
Request Handlers, Web Html, Handling Sensor Requests, Handling Actuator Requests Going
Parallel: Multithreading, Parallel Blinker, prototyping online components, using an API, from
prototypes to reality, business models, ethics, privacy, disrupting control, crowd sourcing.

Text Book:
1. Adrian McEwen and Hakim Cassimally, “Designing the Internet of Things”, John
Wiley & Sons.
2. Cuno Pfister, “Getting Started with the Internet of Things: Connecting Sensors and
Microcontrollers to the Cloud”, Maker Media.
3. Rob Barton, Gonzalo Salgueiro, David Hanes, “IoT Fundamentals: Networking
Technologies, Protocols, and Use Cases for the Internet of Things”, Cisco Press.
4. Radomir Mihajlovic, Muthu Ramachandran, Reinhold Behringer, Petar Kocovic
“Emerging Trends and Applications of the Internet of Things”, IGI Global.
5. Hwaiyu Geng, “Internet of Things and Data Analytics Handbook”, John Wiley & Sons.
6. Marco Schwartz, “Internet of Things with Arduino Cookbook”, Packt Publishing.

31 
 
 Data Analytics

L T P
3 , 0 , 0 : 3 Credits Prerequisites: None

UNIT I
Introduction data analytics, Challenges of Conventional Systems, Intelligent data analysis,
Nature of Data, Analytic Processes and Tools, Analysis vs Reporting.

UNIT II
Data streams : Introduction To Streams Concepts , Stream Data Model and Architecture ,
Stream Computing , Sampling Data in a Stream , Filtering Streams , Counting Distinct
Elements in a Stream.

UNIT III
Estimating Moments , Counting Oneness in a Window , Decaying Window , Real time
Analytics Platform(RTAP) Applications , Case Studies , Real Time Sentiment Analysis, Stock
Market Predictions.

UNIT IV
Frameworks: Applications on Big Data Using Pig and Hive , Data processing operators in Pig
, Hive services , HiveQL , Querying Data in Hive , fundamentals of HBase and ZooKeeper ,
IBM InfoSphere BigInsights and Streams. Predictive Analytics, Simple linear regression,
Multiple linear regression, Interpretation.

Text Book:

1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer.

2. Tom White “Hadoop: The Definitive Guide” Third Edition, O’reilly Media.
3. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos,
“Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming Data”,
McGrawHill Publishing.
4. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP.

32 
 
 Laboratory, II (Robotics and Automation Lab)

LT P Prerequisites: None
0,0,3:2Credits

LIST OF EXPERIMENTS

1. Determination of maximum and minimum position of links.

2. Verification of transformation (Position and orientation) with respect to gripper and world
coordinate system
3. Estimation of accuracy, repeatability and resolution.
4. Robot programming and simulation for pick and place.
5. Robot programming and simulation for Color identification.
6. Robot programming and simulation for Shape identification.
7. Robot programming and simulation for Kinematics.
8. Robot programming and simulation for remote operation.
9. Speech Processing for Robots.
10. Home and device automation.

***************************************************************************

33