Babu Banarasi Das University, Lucknow

School of Engineering
Bachelor of Technology: Computer Science and Engineering
(Artificial Intelligence)
Branch Code: 39

Credit Summary Chart

Semester Total
Course Category %age
I II III IV V VI VII VIII Credits
F 16/11 11/16 0 0 0 0 0 0 27/27 12.80
C 10/16 16/10 25 25 25 21 13 13 148/148 70.14
GE 0 0 0 0 0 4 8 8 20 9.48
OE 0 0 0 0 0 0 4 4 8 3.79
GP 1 1 1 1 1 1 1 8 3.79
1
Total 27/28 28/27 26 26 26 26 26 26 211 100
Discipline wise Credit Summary Chart
Semester Total
Course Category %age
I II III IV V VI VII VIII Credits
Basic Sciences 10/12 12/10 4 3 29 10.43
Humanities and
Socials Sciences 0/4 4/0 2 2 3 3 14 9.95
Engg. Sciences 16/11 11/16 27 12.79
Professional
19 20 22 17 10 5 93 44.07
Subject Core
Professional
Subject-General 4 8 8 20 9.48
Elective
Professional
Subject -Open 4 4 8 3.80
Elective
GP + Project Work,
Seminar and / or
Internship in Industry 1 1 1 1 1 2 4 9 20 9.48
or
elsewhere.
Total 27/28 28/27 26 26 26 26 26 26 211 100
 Babu Banarasi Das University, Lucknow
School of Engineering
Bachelor of Technology: Computer Science and Engineering
(Artificial Intelligence)
Branch Code: 39
 SEMESTER III
Contact
Evaluation Scheme
Course Hours
Category

Credits
Course

Code Code Title

L T P CIA ESE Course
Total

BHS3301/ Industrial Psychology /

C 2 0 0 40 60 100 2
BHS3302 Industrial Sociology
Complex Analysis and Integral
C BAS3301 3 1 0 40 60 100 4
Transforms
Database Management Systems
C BAI3301 3 1 0 40 60 100 4
Artificial Intelligence in
C BAI3302 Mechanical Engineering 3 1 0 40 60 100 4
Systems
C BCS3301 Discrete Mathematics 3 1 0 40 60 100 4
C BCS3303 Digital Logic Design 3 1 0 40 60 100 4
Database Management System
C BAI3351 0 0 2 40 60 100 1
Lab
Artificial Intelligence in
C BAI3352 0 0 2 40 60 100 1
Mechanical Engineering
Lab
C BCS3353 Digital Logic Design Lab 0 0 2 40 60 100 1

GP3301 General Proficiency - - - 100 - 100 1

Total 17 5 6 460 540 1000 26

SEMESTER IV
Contact
Evaluation Scheme
Category

Credits
Course Hours
Course

Code Code Title

L T P CIA ESE Course
Total
BHS3402/ Industrial Sociology
C 2 0 0 40 60 100 2
BHS3401 /Industrial Psychology
Statistical and
C BAS3401 2 1 0 40 60 100 3
Numerical Techniques
Concepts of Machine Learning
C BAI3401 3 1 0 40 60 100 4
with Python
C BAI3402 Data Structure Using 'C' 3 1 0 40 60 100 4
C BCS3402 Operating Systems 3 1 0 40 60 100 4
Computer Organization &
C BCS3404 3 1 0 40 60 100 4
Architecture
C BAI3451 Machine Learning Lab 0 0 2 40 60 100 1
C BCS3452 Operating System Lab 0 0 2 40 60 100 1
C BAI3452 Data Structure Lab 0 0 2 40 60 100 1
C BCS3454 Numerical Techniques Lab 0 0 2 40 60 100 1
GP3401 General Proficiency - - - 100 - 100 1
Total 16 5 8 500 600 1100 26
 SEMESTER
V
Conta
Evaluation Scheme
Course ct
Code Code Title Hour
s
Category

Credits
Course

L T P CIA ESE Course

Total
Engineering &Managerial
C BHS3501 3 0 0 40 60 100 3
Economics
C BAI3501 Optimization Techniques 3 1 0 40 60 100 4
Concepts of Data
C BAI3502 3 1 0 40 60 100 4
Science with Python
C BAI3503 Artificial Neural Network 3 1 0 40 60 100 4
C BCS3503 Computer Networks 3 1 0 40 60 100 4
Automata Theory and
C BCS3504 3 1 0 40 60 100 4
Formal Languages
Data Science with
C BAI3552 0 0 2 40 60 100 1
Python Lab
C BCS3553 Computer Networks Lab 0 0 2 40 60 100 1
Artificial Neural Network
C BAI3553 0 0 2 40 60 100 1
Lab
GP3501 General Proficiency - - - 100 - 100 1
Total 17 5 6 460 540 1000 26

SEMESTER VI
Contact
Evaluation Scheme
Course Hours
Category

Credits
Course

Code Code Title

Course
L T P CIA ESE
Total
C BHS3601 Industrial Management 3 0 0 40 60 100 3
C BAI3601 Evolutionary Algorithms 3 0 0 40 60 100 3
Design & Analysis of
C BAI3602 3 1 0 40 60 100 4
Algorithms
Robotics and
C BAI3603 3 1 0 40 60 100 4
Intelligent Systems
C BCS3604 Compiler Design 3 1 0 40 60 100 4
GE Generic Elective I 3 1 0 40 60 100 4
C BAI3651 Evolutionary Algorithms Lab 0 0 2 40 60 100 1
C BAI3652 Algorithms Lab 0 0 2 40 60 100 1
C BAI3653 Seminar 0 0 2 100 0 100 1
GP3601 General Proficiency - - - 100 - 100 1
Total 18 4 6 520 480 1000 26

Note: The students need to undergo a 4 to 6 weeks of industrial training that will be evaluated in the VII Semester.
 SEMESTER VII
Contact
Evaluation Scheme

Credits
Category
Course

Course Hours
Code Code Title
L T P CIA ESE Course
Total
Natural Language Processing
C BAI3701 3 1 0 40 60 100 4
C BAI3702 Fuzzy Logic 3 1 0 40 60 100 4
GE Generic Elective II 3 1 0 40 60 100 4
GE Generic Elective III 3 1 0 40 60 100 4
OE Open Elective I* - - - 40 60 100 4
Natural Language Processing
C BAI3751 0 0 2 40 60 100 1
Lab
C BAI3752 Fuzzy Logic Lab 0 0 2 40 60 100 1
Industrial Training Evaluation
C BAI3758 0 0 2 100 - 100 1
#
C BAI3759
Project I 0 0 4 100 - 100 2
GP3701General Proficiency - - - 100 - 100 1
Total 12 4 10 580 420 1000 26
*Students will opt any one of the open elective from the list of open electives provided by the university.
#
Students need to submit an abstract for the project, select a guide and will complete the literature review related
to the project.

SEMESTER VIII
Contact
Evaluation Scheme
Course Hours
Category

Credits
Course

Code Code Title

Course
L T P CIA ESE
Total
Concepts of Deep Learning
C BAI3801 3 1 0 40 60 100 4
GE Generic Elective IV 3 1 0 40 60 100 4
GE Generic Elective V 3 1 0 40 60 100 4
OE Open Elective II** - - - 40 60 100 4
C
BAI3851 Deep Learning Lab 0 0 2 40 60 100 1
##
C
BAI3859 Project II 0 0 16 160 240 400 8
GP3801 General Proficiency - - - 100 - 100 1
Total 9 3 18 460 540 1000 26
**The opted subject should be different from the one selected in VII Semester.
##
This is in continuation with the project work started in Semester VII. In this semester the students will
formulate the methodology do experimentation and show the results. Finally all project work will be presented
in a report i.e. Project Report.
Legends:
L Number of Lecture Hours per week
T Number of Tutorial Hours per week
P Number of Practical Hours per week
CIA Continuous Internal Assessment
ESE End Semester Examination

Category of Courses:

F Foundation Course
C Core Course
GE Generic Elective
OE Open Elective
 List of Open Electives
B. Tech: Computer Science and Engineering
(Artificial Intelligence)

S.N. Course Code Open Elective

1 OE33901 Principles of Industry 4.0
2 OE33902 Nature Inspired Algorithms

List of Generic Electives

Course
Generic Elective I
Code
GE33911 Cyber Law and Security
GE33912 Introduction to Unmanned Aerial Vehicles
GE33913 Computer Vision
GE33914 Recommender Systems

Course
Generic Elective II
Code
GE33921 Block Chain Technology
GE33922 System Modeling & Simulation
GE33923 Embedded System Design
GE33924 Sentiment Analysis

Course
Generic Elective III
Code
GE33931 Evolutionary Multi-objective Optimization
GE33932 Bioinformatics
GE33933 Internet of Things
GE33934 Cloud Computing

Course
Generic Elective IV
Code
GE33941 Data Mining and Ware Housing
GE33942 Introduction to Drones
GE33943 Computer Forensics
GE33944 Augmented & Virtual Reality

Course
Generic Elective V
Code
GE33951 Wireless Sensor Networks
GE33952 Distributed Systems
GE33953 Gaming in Artificial Intelligence
GE33954 Pattern Recognition
BAI3301 Database Management Systems Course Objective:

1. To Study the fundamental concepts of Database Management.

2. To develop the skill of Database Design, Database Languages and Database
System implementation with respect to Relational Database Management System.
3. To develop the concepts of Transaction Processing System,
Concurrency control, and Recovery procedures in database.

Learning Outcome:
After completing the course, the students should be able to:
1. Understand the basic concepts of the database and data models.
2. Design a database using ER diagrams and map ER into Relations and normalize the
relations.
3. Develop a simple database application using normalization.
4. Acquire the knowledge about different special purpose databases and to critique
how they differ from traditional database systems.

Course Content:

Total
Module Course Topics Credits
Hours

Database System Concepts, Database Users, and

Architecture
I Introduction to Database System with example,
Characteristics of the Database Approach, Users of
Database System, Advantages and disadvantages of 30 Hours 1
Using a DBMS, Implications of the Database
Approach, Data Models, Schemas, and Instances,
DBMS Architecture and Data Independence, Database
Languages and Interfaces, The Components of Database
System, Classification of Database Management Systems
 II Data Modelling & Relational Database
Management System
Data Modelling Using the Entity-Relationship Model,
concepts, notation for ER diagram, mapping
constraints, keys, Concepts of Super Key, candidate
key, primary key, Entity Types, Entity Sets, and
Attributes, Relationships, Relationship Types, Roles,
and Structural Constraints, Strong vs Weak Entity
Types, ER Diagrams, Naming Conventions, and 30 Hours 1
Design Issues, Enhanced Entity- Relationship
Modelling, Subclasses, Super classes, and Inheritance,
Specialization and Generalization, Constraints and
Characteristics of Specialization and Generalization,
Modelling of UNION Types Using Categories, The
Relational Data Model, Relational Constraints, and the
Relational Algebra, Relational Model Concepts,
Relational Constraints and Relational Database
Schemas, Update Operations and Dealing with
Constraint Violations, Basic Relational Algebra
Operations, Additional Relational Operations,
Examples of Queries in Relational Algebra

SQL and Database Design Theory and

III Methodology Structured Query Language- The
Relational Database Standard, Data Definition,
Constraints, and Schema Changes in SQL, Types of
SQL Commands, SQL Operators and their Procedure,
Insert, Delete, and Update Statements in SQL, Queries
and Subqueries, Aggregate Functions, Joins, Unions, 30 Hours 1
Intersection, Minus, Views (Virtual Tables) in SQL,
Cursors, Triggers and PL/SQL, Functional
Dependencies and Normalization for Relational
Databases, Informal Design Guidelines for Relation
Schemas, Functional Dependencies, Normal Forms
Based on Primary Keys, General Definitions of
Second and Third Normal Forms, Boyce-Codd Normal
Form, Multivalued Dependencies and Fourth
Normal Form, Join Dependencies and Fifth Normal
Form
 Transaction Processing, Concurrency Control and
IV Database Recovery
Transaction Processing Concepts, Introduction to
Transaction Processing, Transaction states and State
Diagram, Transaction and System Concepts,
Desirable Properties of Transactions, Schedules and
Recoverability, Serializability of Schedules,
Concurrency Control Techniques, Locking 30 Hours 1
Techniques for Concurrency Control, Concurrency
Control Based on Timestamp Ordering, Multiversion
Concurrency Control Techniques, Validation
(Optimistic) Concurrency Control Techniques,
Granularity of Data Items and Multiple Granularity
Locking, Database Recovery Techniques, Recovery
Concepts, Recovery Techniques Based on Deferred
Update, Recovery Techniques Based on Immediate
Update, Shadow Paging, The ARIES Recovery
Algorithm, Database Backup and Recovery from
Catastrophic Failures

Text/Reference Books:

1. Korth, Silbertz, Sudarshan, Database Concepts, published in 2016 by McGraw-

Hill Publications.
2. Ivan Bayross,SQL, PL/SQL: The Programming Language Of Oracle published
in 2010 by BPB Publications.
3. Date C. J.,An Introduction to Database System (7th edition, Addison-
Wesley, 2000).
4. Elmasri, Navathe, Fundamentals Of Database Systems,Addison Wesley, Publisher :
Pearson Education India; seventh edition 2015.
BAI3302 Artificial intelligence in Mechanical Engineering Systems

Course Objective:

1. To learn how Artificial Intelligence (AI) works in Mechanical Engineering

system.
2. To learn about Mechanical Engineering system.
3. To learn how to Apply AI in Mechanical Engineering system.
4. To learn the application of AI in Mechanical Engineering system.

Learning Outcome:

After completing the course, the students should be able to:

1. To understand the usefulness of AI system for Mechanical Engineering
systems
2. To understand designing, selection and application AI system for Mechanical
Engineering systems
3. To understand the knowledge base system and software for Mechanical
Engineering systems
4. To understand the application AI in selection Mechanical Engineering systems
5.
Course Contents:

Total
Module Course Topics Credits
Hours

Definition of Artificial Intelligence, Mechanical

Engineering System, Types of Mechanical Engineering
Systems (MES), Machine learning (ML), Artificial
30 1
I Intelligence and Mechanical Engineering, Benefits of
AI for Mechanical Engineering systems. Application of
AI in MES.

Basic Elements of an Automated System, Control

II Systems, Advanced Automation Functions, Levels of
Automation, Sensors, Actuators, Analog–Digital 30 1
Conversions, Input/output Devices for Discrete Data,
Contact Input/output Interfaces.

Expert System, Definition, Structure Characterization

III Knowledge Sources, Expert Knowledge Acquisition,
Expert System software for Mechanical Engineering
application in CAD, CAPP, MRP, Adaptive Control. 30 1
Robotics, Process control. Typical cases for ML in
Mechanical Engineering, Human-like machine vision,
Adaptive control for process optimization
 Application of Artificial Intelligence in Thermal
IV Engineering, Artificial Intelligence in Additive
Manufacturing, Artificial Intelligence in 3D printing, 30 1
Application of Artificial Intelligence in
Manufacturing.

Text/Reference Books:
1. Artificial Intelligence in Mechanical and Industrial Engineering Edited By
Kaushik Kumar Divya Zindani J. Paulo Davim
2. Artificial Intelligence: Implications for Cim (Artificial Intelligence in
Industry) by Andrew Kusiak.
BCS3301 Discrete Mathematics Course
Objective

1. To introduce a number of Discrete Mathematical Structures (DMS) found to be serving as tool

seven today in the development of theoretical computer science.
2. Course focuses on of how Discrete Structures actually helped computer engineers to solve
problems occurred in the development of programming languages.
3. Also, course highlights the importance of discrete structures towards simulation of a
problem in computer science and engineering.
4. Introduction of a number of case studies involving problems of Computer Technology.
5. List the terms in a sequence, write a sequence in closed from computer the sum of a finite
sequence, compute the product of a finite sequence and express sequence in term recursive or
non-recursive forms.
6. Simplify and evaluate basic logic statement including compound statement implications,
inverse, converse and contra positive using truth table and properties of logic. Determine if a
graph has Euler or Hamilton path or circuit.
Learning Outcome:
At the end of the course, the student should be able to:
1. Have a complete knowledge on various discrete structures available in literature.
2. Have realization of some satisfaction of having learnt that discrete structures are indeed useful
in computer science and engineering and thereby concluding that no mistake has been done in
studying this course.
3. Gain some confidence on how to deal with problems which may arrive in computer science
and engineering in near future.
4. To appreciate the basic principles of Boolean algebra, Logic, Set theory.
5. Be able to construct simple mathematical proofs.
6. Be able to understand logical argument and logical constructs have a better understanding of
sets, functions and relations.
Course Contents:
Total
Module Course Topics Credits
Hours

Set Theory, Relations, Functions & Natural Numbers

Set Theory: Introduction, Combination of sets, Multisets,

Ordered pairs, Proofs of some general identities on sets.

Relations: Definition, Operations on relations, Properties

I of relations, Composite Relations, Equality of relations, 30 1
Recursive definition of relation, Order of relations. Hours

Functions: Definition, Classification of functions,

Operations on functions, Recursively defined functions,
Growth of Functions. Natural Numbers:
Introduction, Mathematical Induction, Induction with
Nonzero Base cases, Proof Methods, Proof by counter
– example, Proof bycontradiction.
 Groups, Rings, Fields & Lattice
II 30 1
Algebraic Structures: Definition, Groups, Subgroups Hours
andorder, Cyclic Groups, Cosets, Lagrange's theorem,
Normal
Subgroups, Definition and elementary properties of Rings
and Fields, Integers Modulo n; Partial order sets:
Definition, Partial order sets, Combination of partial order
sets, Hasse diagram.
Lattices: Definition, Properties of lattices ,Bounded,
Complemented, Modular, Complete lattice;

Boolean Algebra & Proposition Logic

Boolean Algebra: Introduction, Axioms and Theorems of
Boolean algebra, Algebraic manipulation of Boolean
expressions, Simplification of Boolean Functions,
Karnaugh maps, Logic gates, Digital circuits and Boolean
III algebra. 30 1
Hours
Propositional Logic: Proposition, well-formed formula,
Truth tables, Tautology, Satisfiability; Contradiction;
Algebra of proposition; Theory of Inference; Predicate
Logic: First order predicate-well-formed formula of
predicate, quantifiers, Inference theory of
predicate logic.
Trees, Graph, Recurrence Relation & Combinatorics
Trees: Definition: Binary tree, Binary tree traversal, Binary
search tree; Graphs: Definition and terminology:
Representation of graphs, Multigraphs, Bipartite graphs,
Planar graphs, Isomorphism and Homeomorphism of
IV 30 1
graphs, Euler and Hamiltonian paths, Graph Coloring.
Hours
Recurrence Relation & Generating function: Recursive
definition of functions, Recursive algorithms, Method of
solving recurrences. Combinatorics: Introduction;
CountingTechniques: Pigeonhole Principle.

Text/Reference Books:
1. Koshy, “Discrete Structures”, Elsevier Publication.
2. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, McGraw-Hill.
3. B. Kolman, R.C. Busby, and S.C. Ross, “Discrete Mathematical Structures”, Prentice Hall.
4. R.P. Grimaldi, “Discrete and Combinatorial Mathematics”, Addison Wesley.
5. Jean Paul Trembley, R Manohar, “Discrete Mathematical Structures with
Application toComputer Science,” McGraw-Hill.
BCS3303 Digital Logic Design Course
Objective:
1. To impart an understanding of basic concepts of Boolean algebra and digital System.
2. To impart familiarity with the design and implementation of different types of
practically usedsequential circuits.
3. To provide an introduction to use hardware description circuits
4. Introduce the concept of digital and binary systems
5. Be able to design and analyse combinational logic circuits.
6. Be able to design and analyse sequential logic circuits.
7. Reinforce theory and techniques taught in the classroom through experiments and projects
inthe laboratory.

Learning Outcome:
At the end of the course, the student should be able to:
1. Apply the basic concepts of Boolean algebra for the simplification and implementation of
logicfunctions using suitable gates namely NAND, NOR etc.
2. Design simple combinational circuits.
3. Define different number systems, binary addition and subtraction, 2’s
complement
representation and operations with this representation.
4. Understand the basic knowledge of flip-flops
5. Understand the different switching algebra theorems and apply them for logic
functions.
6. Define the Karnaugh map for a few variables and perform an algorithmic reduction of
logicfunctions.
7. Define the following combinational circuits: buses, encoders/decoders,
(de)multiplexers,exclusive-ORs, comparators, Arithmetic-logic; and to be able to build
simple applications.

Course Contents:
Total
Modul Course Topics Credit
e Hour s
s
Binary Numbers and Gate level Minimization
Digital system and binary numbers: Signed binary numbers,
Binary codes, Cyclic codes, Error detecting and correcting
codes, Hamming codes, Floating point representation.
I 30 Hours 1
Gate-level minimization: The map method up to five variable,
Don’t care conditions, Karnaugh maps, POS simplification,
NAND and NOR implementation, Quine
McClusky method (Tabular method).

Combinational Logic
II Combinational circuits: analysis procedure, design procedure; 30 Hours 1
Binary adder-subtractor; decimal adder; binary multiplier;
magnitude comparator; decoders; encoders; multiplexers.
 Synchronous Sequential Logic
III Sequential circuits: Binary cell, Latches, Flip-flops- RS, JK, 30 Hours 1
Master-Slave JK, D F/F,T flip flops; Synchronous Sequential
Circuit Design: Fundamentals of Synchronous sequential
circuits;
Classification of synchronous machines; Analysis of
Synchronous Sequential circuits; Design of Synchronous and
Asynchronous Counters-Shift registers, Ring counters; Analysis
and design of Finite State Machines; Timing issues
in synchronous circuits.
Asynchronous Sequential Logic
Fundamentals of Asynchronous Sequential circuits: Analysis and
design of Asynchronous Sequential circuits; Pulse mode and
IV Fundamental-mode Circuits; Cycles; Races; Hazards in 30 Hours 1
asynchronous circuits; Programmable Logic Devices: PLAs,
PALs, CPLD; FPGA Architecture; Finite state machines:
Mealy,Moore design.

Text/Reference Books:
1. Raj Kamal, “Digital Systems Principle and Design”, Pearson Education.
2. Balbaniam, Carison, “Digital Logic Design Principles”, Wiley Publications.
3. Morris Mano, “Digital Design”, Pearson Education.
4. R.P. Jain, “Modern Digital Electronics”, McGraw Hill.
5. D.P. Leach, A .P. Malvino, “Digital Principles and Applications”, TMH.
6. Tocci, Digital systems, “Principles and applications”, Pearson.
7. Sudhakar Yalamachili, John M. Yarbrough, “Introductory VHDL”, Pearson Education.
BAI3351 Database Management System Lab

Note: Minimum 8 experiments to be performed by students

List of Experiments:

1.Write the queries for Data Definition and Data Manipulation Language.
2.Write SQL queries using logical operations (=, <,>, etc)
3.Write SQL queries using SQL operators.
4.Write SQL query using character, number, date and group functions.
5.Write SQL queries for extracting data from more than one table.
6.Write SQL queries for sub queries, nested queries.
7.Write programme by the use of PL/SQL.
8.Concepts for ROLL BACK, COMMIT.
9.Create VIEWS and understand its concept. 10.Create
CURSORS and understand its concept. 11.Create
TRGGERS and understand its concept.
BAI3352 Artificial intelligence in Mechanical Engineering Systems
1. Study of Artificial Intelligence for a Thermal System
2. Study of NC Machine
3. Study of CAD software
4. Study of Additive Manufacturing.
5. Study of 3 D printing
6. Study of Sensors
7. Study of Actuators
BCS3353 Digital Logic Design Lab
Note: Minimum 10 experiments to be performed by students

List of Experiments:

1. Simplification, Realization of Boolean Expressions using Logic gates/Universal gates.

2. Realization of Half/Full adder and Half/Full Subtractors using logic gates.

3. Realization of parallel adder/Subtractors using 7483 chip.

4. BCD to Excess-3 code conversion and vice versa.

5. Realization of Binary to Gray code conversion and vice versa.

6. MUX/DEMUX use of 74153, 74139 for arithmetic circuits and code converter.

7. Realization of One/Two bit comparator and study of 7485 magnitude comparator.

8. Use of a Decoder chip to drive LED display and Priority encoder.

9. Truth table verification of Flip-Flops:

a. JK Master slave (ii) T type (iii) D type.

10. Realization of 3 bit counters as a sequential circuit and MOD N

counter design(7476, 7490,74192, 74193).

11. Perform Shift left; Shift right, SIPO, SISO, PISO, PIPO operations using 74S95.

12. Wiring and testing of Ring counter/Johnson counter.

13. Wiring and testing of Sequence generator.

BAI3401 Concepts of Machine Learning with Python Course

Objective:

1. Acquire theoretical knowledge on setting hypotheses for pattern recognition.

2. Apply suitable machine learning techniques for data handling and to gain knowledge from it.
3. Evaluate the performance of algorithms and to provide solutions for various real-
world applications.

Learning Outcome:

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

1. Recognize the characteristics of machine learning strategies.

2. Apply various supervised learning methods to appropriate problems.
3. Identify and integrate more than one technique to enhance the performance of learning.
4. Create probabilistic and unsupervised learning models for handling unknown patterns.
5. Analyze the co-occurrence of data to find interesting frequent patterns.
6. Preprocess the data before applying to any real-world problem and can evaluate its
performance.

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to Machine Learning

Introduction, Examples of various Learning 30 1
I
Paradigms, Perspectives and Issues, Version
Spaces, Finite and, Infinite Hypothesis Spaces, PAC
Learning, VC Dimension.

II Supervised Learning Algorithms

Learning a Class from Examples, Linear, Non- linear, Multi-
class and Multi-label classification, Decision Trees: ID3,
Classification and Regression Trees (CART), Regression:
Linear Regression, Multiple Linear Regression, Logistic 30 1
Regression.
Advanced Supervised Learning
Neural Networks: Introduction, Perceptron, Multilayer
Perceptron, Support vector machines: Linear and Non-
Linear, Kernel Functions, K- Nearest Neighbors
Ensemble Learning
 Ensemble Learning Model Combination Schemes, Voting,
Error-Correcting Output Codes, Bagging: Random Forest
Trees, boosting: Adaboost, Stacking

Unsupervised Learning
III Introduction to clustering, Hierarchical: AGNES, DIANA,
Partitional: K-means clustering, K-Mode Clustering, Self-
Organizing Map, Expectation Maximization, Gaussian
Mixture Models, Principal Component Analysis (PCA), 30 1
Locally Linear Embedding (LLE), Factor Analysis
Probabilistic Learning
Bayesian Learning, Bayes Optimal Classifier, Naïve Bayes
Classifier, Bayesian Belief Networks, Mining,
Frequent Patterns

Machine Learning using Python

IV Introduction to python; basic library; functions of library; 30 1
implementation of library;Design, Analysis and Evaluation
of Machine Learning Experiments, Other Issues: Handling
imbalanced data sets

Text/Reference Books:

1. Ethem Alpaydin,"Introduction to Machine Learning”, MIT Press, Prentice

Hall of India, Third Edition 2014
2. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar "Foundations
of Machine Learning”, MIT Press, 2012.
3. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rd Edition,1997.
4. Charu C. Aggarwal, “Data Classification Algorithms and
Applications”, CRC Press, 2014.
5. Stephen Marsland, “Machine Learning – An Algorithmic Perspective”,
2nd Edition, CRC Press, 2015.
6. Kevin P. Murphy "Machine Learning: A Probabilistic Perspective", The MIT
Press, 2012
7. Jiawei Han and Micheline Kamber and Jian Pei, “Data Mining – Concepts and
Techniques”, 3rd Edition,Morgan Kaufmann Publications, 2012.
8. Marc Peter Deisenroth, A. Aldo Faisal, Cheng Soon Ong, “Mathematics for
Machine Learning”, Cambridge University Press, 2019.
BAI3402: Data Structure Using ‘C’
Course Objective:
1. To teach efficient storage mechanisms of data for easy access.
2. To design and implementation of various basic and advanced data structures
3. Demonstrate familiarity with major algorithms and data structures.
4. Master the implementation of linked data structures such as link list and
binary trees.
5. Analysis and performance of algorithms.
Learning Outcome:
After completing the course, the students should be able to:
1. Students develop knowledge of applications of data structures including the
ability to implement algorithms for the creation, insertion, deletion,
searching and sorting of each data structure.
2. Demonstrate knowledge of underlying data structures needed for solving
problems and programming.
3. Develop knowledge of applications of data structures for storage and
retrieval of ordered and unordered data.
4. Implement/ utilize various data structures using a programming language
such as C.
Course Contents:

Total
Module Course Topics Credits
Hours
Introduction
Introduction: Basic Terminology, Data
types and its classification, Algorithm
I complexity notations like big Oh, Time- Space
trade- off.Abstract Data Types 30
(ADT). Array: Array Definition, Hours 1
Representation and Analysis of Arrays,
Single and Multidimensional Arrays,
Address calculation, Array as Parameters, Sparse
Matrices, Recursion- definition and processes,
simulating recursion, Backtracking,
Recursive algorithms, Tail recursion, Removal of
recursion, Tower of
Hanoi.

Stack and Linked List

Stack, Array Implementation of stack,
II Linked Representation of Stack, Application of
stack: Conversion of Infix to Prefix and
Postfix Expressions and Expression
evaluation, Queue, Array and linked 1
implementation of queues, Circular queues, 30
D-queues and Priority Queues. Hours
Linked list, Implementation of Singly
Linked List, Two-way Header List, Doubly
 linked list, Linked List in Array. Generalized linked
list, Application: Garbage collection and
compaction, Polynomial Arithmetic.
Tree, Searching, Sorting and Hashing Trees:
Basic terminology, Binary Trees,, algebraic
Expressions, Complete Binary Tree,
III Extended Binary Trees, Array and Linked
Representation of Binary trees,
Traversing Binary trees, Threaded Binary trees,
Binary Search Tree(BST), AVL Trees, B-trees.
Application: Algebraic Expression, Huffman coding 30 1
Algorithm. Internal and External sorting, Insertion Hours
Sort, Bubble Sort, selection sort, Quick Sort,
Merge Sort, Heap Sort, Radix sort,
Searching Hashing: Sequential search, binary
search, Hash Table, Hash Functions,
Collision Resolution Strategies,
Hash Table
Implementation. Symbol Table, Static tree table,
Dynamic Tree table.
Graphs
Graphs: Terminology, Sequential and
IV linked Representations of Graphs:
Adjacency Matrices, Adjacency List,
Adjacency Multi-list, Graph Traversal: Depth 30 1
First Search and Breadth First Hours
Search, Connected Component, Spanning Trees,
Minimum Cost Spanning Trees:
Prims and Kruskal algorithm. Transitive Closure
and Shortest Path algorithm: Warshall Algorithm
and Dijkstra Algorithm.

Text/Reference Books:

1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein,

“Data Structures Using C and C++”, PHI, 2000.
2. Horowitz and Sahani, “Fundamentals of Data Structures”,Galgotia
Publication, 1982.
3. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data
Structures with Applications”, McGrawHill, 1984
4. R. Kruse Et Al, “Data Structures and Program Design in C”,
PearsonEducation, 2006
5. Lipschutz, “Data Structures”, Schaum’s Outline Series,TMH, 2014
6. GAV Pai, “Data Structures and Algorithms”,TMH, 2009
BCS3402 Operating system
Course Objective:
1. Study the basic concepts and functions of operating systems.
2. Understand the structure and functions of OS.
3. To gain insight on the distributed resource management components.
4. Learn about Processes, Threads and Scheduling algorithms.
5. To gain knowledge on O.S concepts that includes architecture
mutualexclusion algorithms, deadlock detection algorithms and
agreement.
6. Understand the principles of concurrency and Deadlocks.
7. Learn various memory management schemes.
8. Study I/O management and File systems.

Learning Outcome:
At the end of the course, the student should be able to:
1. Understanding of the concepts, structure and design of O.S.
2. Design various Scheduling algorithms.
3. Apply the principles of concurrency.
4. Design deadlock, prevention and avoidance algorithms.
5. Compare and contrast various memory management schemes.
6. Design and Implement a prototype file systems.
7. Demonstrate understanding of O.S design and its impact on
applicationsystem design and performance.

Course Contents:

Total
Module Course Topics Hours Credit
s
Introduction to Operating System and Process
30
I Concept 1
Hours
Operating system and functions, Classification of
Operating systems, Operating System Structure,
Operating System Services, System call and System
program, Process concept, Process state, Process
control block, Context switching, Operation on process,
Threads and their management, Benefits of
multithreading, Types of threads, Threading issues,
CPU-scheduling, Scheduling criteria, Scheduling
Algorithms, Concurrent Processes, Inter
Process Communication models and
Schemes

Process Synchronization and Deadlock Process

synchronization, Producer/Consumer
Problem, Critical Section Problem, Peterson’s
II solution, Synchronization of hardware, Semaphore, 30 1
Classical- problem of synchronization, Deadlock, Hours
Deadlock characterization, Deadlock Prevention,
Deadlock Avoidance, Resource allocation graph
algorithm, Banker’s algorithm, Deadlock detection,
Recovery from deadlock
 Memory Management
Memory Management, Basic bare machine, Resident
monitor, Multiprogramming with fixed partitions,
III Multiprogramming with variable partitions, Paging, 30 1
Hours
Segmentation, Paged segmentation, Virtual memory
concepts, Demand paging, Performance of demand
paging, Page
replacement algorithms, Thrashing
I/O Management And File System
File System Structure, File System
IV Implementation, Directory Implementation and 30 1
Allocation Methods, Free space Management, Kernel Hours
I/O Subsystems, Disk Structure, Disk
Scheduling, Disk Management,
Swap-Space Management

Text/Reference Books:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley Publication
2. Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education
3. Harvey M Dietel, “An Introduction to Operating System”, Pearson Education
4. D M Dhamdhere, “Operating Systems: A Concept based Approach”, TMH
5. William Stallings, “Operating Systems: Internals and Design Principles”, Pearson
Education
BCS3404 Computer Organization & Architecture Course Objective:

1. To understand how computers are constructed out of a set of functional

units.
2. To understand how these functional units operate, interact and
communicate.
3. To understand how computations are actually performed at the machine
level.
4. To understand the factors and trade-offs that affect computer
performance.
5. To understand how problems expressed by humans are expressedas binary strings
in a machine.

Learning Outcome:
After completing the course, the students should be able to:
1. Identify the basic structure and function unit of a digital computer.
2. Analyze the effect of addressing modes on the execution time of a program.
3. Design processing unit using the concepts of ALU and control logic unit.
4. Select appropriate instruction standards for I/O devices.

Course Contents:

Total
Module Course Topics Credits
Hours
Computer Evolution & Arithmetic
A Brief History of computers: Von Neumann
Architecture, Hardware architecture, Computer
I Components, Interconnection Structures, Bus 30 1
Interconnection, Register Transfer Language, Bus Hours
and Memory Transfers, Bus Architecture, Bus
Arbitration Techniques, Arithmetic Logic, Shift
Micro operation, Arithmetic Logic Shift Unit,
Arithmetic Algorithms(addition, subtraction, Booth
Multiplication, Division)

Control Unit
Control Design: Hardwired & Micro Programmed ,
Performing of arithmetic or logical operations,
II Multiple-Bus organization, Hardwired Control, Micro 30 1
programmed control, Microinstruction, Hours
Microprogram sequencing, Wide-Branch addressing,
Microinstruction with Next-address field,
Prefetching, Microinstruction, Pipeline control:
Instruction pipelines, Pipeline performance.
 Processor Organization and Input-
Output Organization
Processor Design: General register organization,
Stack organization,
Addressing mode, Instruction format, Data transfer &
III manipulations, Program Control, Reduced Instruction 30 1
Set Computer, Input- Output Organization: Peripheral Hours
devices, I/O interface I/O ports.
Interrupts: Interrupt hardware, Types of interrupts
and exceptions, Modes of Data Transfer:
Programmed I/O, Interrupt
initiated I/O, Direct Memory Access: I/O
channels and processors, Serial
Communication: Synchronous &
asynchronous communication,
Standard communication interfaces

Memory Organization
Basic concept and hierarchy, semiconductor RAM
memories,2D & 2 1/2D memory organization,
ROM memories, Cache 30 1
memories, Concept and design issues 9 performance, Hours
IV
Address mapping and replacement, Auxiliary
memories: Magnetic disk, Magnetic tape and optical
disks, Virtual memory, Concept implementation

Text/Reference Books:

1. Patterson, ”Computer Organisation and Design”, ElsevierPublication

2. William Stalling, “Computer Organization”,PHI.
3. Vravice, Hamacher & Zaky, “Computer Organization”,TMH.
4. Moris Mano, ” Computer System Architecture”,PHI
5. John P Hays, “ Computer Organization”, McGrawHill
6. Tannenbaum,” Structured Computer Organization”,PHI
7. P Pal Chaudhry, ” Computer Organization & Design”,PHI
BAI3451 Machine Learning Lab List of

Experiments:

1. Implement Decision Tree learning

2. Implement Logistic Regression
3. Implement classification using Multilayer perceptron
4. Implement classification using SVM
5. Implement Adaboost
6. Implement Bagging using Random Forests
7. Implement k-nearest Neighbors algorithm
8. Implement K-means, K-Modes Clustering to Find Natural Patterns in Data
9. Implement Hierarchical clustering
10. Implement Gaussian Mixture Model Using the Expectation Maximization
11. Implement Principle Component Analysis for Dimensionality Reduction
12. Evaluating ML algorithm with balanced and unbalanced datasets Comparison of Machine
Learning algorithms
BCS3452 Operating Systems Lab
Note: Minimum 8 experiments to be performed by
students

List of Experiments:
Implement the following on LINUX or other UNIX like platform. Use C for
high level language implementation
1. Write programs using the following system calls of UNIX operating
system:fork, exec, getpid, exit, wait, close, stat, open dir, read dir
2. Write programs using the I/O system calls of UNIX operating system
(open,read, write, etc)
3. Write C programs to simulate UNIX commands like ls, grep, etc.
4. Given the list of processes, their CPU burst times and arrival times,
display/print the Gantt chart for FCFS and SJF. For each of the scheduling
policies, compute and print the average waiting time and average
turnaround time.
5. Given the list of processes, their CPU burst times and arrival times,
display/print the Gantt chart for Priority and Round robin. For each of the
scheduling policies, compute and print the average waiting time and
average turnaround time.
6. Developing Application using Inter Process communication (using shared
memory, pipes or message queues).
7. Implement the Producer – Consumer problem using semaphores (using
UNIX system calls).
8. Implement memory management scheme: Free space is maintained as a
linked list of nodes with each node having the starting byte address and the
ending byte address of a free block. Each memory request consists of the
process-id and the amount of storage space required in bytes. Allocated
memory space is again maintained as a linked list of nodes with each node
having the process- id, starting byte address and the ending byte address of
the allocated space.
9. Implement any file allocation technique (Linked, Indexed or Contiguous).
BAI3452 Data Structure Lab
Note: Minimum 15 experiments to be performed by students

List of Experiments:

Write Programs in C or C++ for following.

1. Array implementation of Stack.
2. Array implementation of Queue.
3. Array implementation of Circular Queue.
4. Array implementation of List
5. Implementation of Stack,
6. Implementation of Circular Queue,
7. Implementation of List using Dynamic memory Allocation.
8. Implementation of Queue.
9. Implementation of Tree Structures,
10. Implementation of Binary Tree.
11. Implementation of Tree Traversal.
12. Implementation of Binary Search Tree.
13. Implementation of Insertion in BST.
14. Implementation of Deletion in BST.
15. Implementation of Searching and Sorting Algorithms.
16. Graph Implementation, BFS.
17. Graph Implementation, DFS.
18. Graph Implementation, Minimum cost spanning tree.
19. Graph Implementation, shortest path algorithm.
BCS3454 Numerical Techniques Lab

Note: Minimum 12 experiments to be performed by students

List of Experiments:

Write Programs in ‘C’ Language:

1. To deduce error evolved in polynomial equation.

2. To Find out the root of the Algebraic and Transcendental equations using Bisection
method.
3. To Find out the root of the Algebraic and Transcendental equations using Regula-Falsi
method.
4. To Find out the root of the Algebraic and Transcendental equations using Newton-
Raphson method.
5. To Find out the root of the Algebraic and Transcendental equations using Iterative
method.
6. To implement Numerical Integration using Trapezoidal rule.
7. To implement Numerical Integration using Simpson 1/3 rule.
8. To implement Numerical Integration Simpson 3/8 rule.
9. To implement Newton’s Forward and Backward Interpolation formula. 10.To
implement Gauss Forward and Backward Interpolation formula. 11.To implement
Bessel’s Interpolation formula.
12.To implement Sterling’s Interpolation formula. 13.To
implement Newton’s Divided Difference formula. 14.To
implement Langrange’s Interpolation formula.
15. To implement Numerical Differentiations.
16. To implement Least Square Method for curve fitting.
BAI3501 Optimization Techniques Course

Objective:

1. Enumerate the fundamental knowledge of Linear Programming and

Dynamic Programming problems.
2. Learn classical optimization techniques and numerical methods of
optimization.
3. Know the basics of different evolutionary algorithms.
4. Understand different optimization techniques to solve various models
arising from engineering areas.
5. To understand optimization in different areas like Machine learning,
Neural Networks.
Learning Outcome:

After completing the course, the students should be able to:

1. Understand the importance of optimization of industrial process

management.
2. Apply basic concepts of mathematics to formulate an optimization problem.
3. Analyze and appreciate a variety of performance measures for various
optimization problems.
4. Apply the theoretical concepts of Artificial Intelligence and practical
knowledge in analysis, design, and development of computing systems and
applications.
5. Work as a socially responsible professional by applying Artificial
Intelligence with optimization.
Course Contents:

Total
Module Course Topics Credits
Hours

Introduction of optimization technique History,

Engineering application of optimization techniques.
Tool for optimization, Design issues and formulation of
I
mathematical programming. Role of optimization
30 Hours 1
technique in machine learning techniques, supervised,
unsupervised, Types of optimization technique, linear,
non-linear and discrete.

Linear optimization Geometry, Simplex method,

Duality theory, Analysis, sensitivity, Convex, Non
II
convex analysis;

Non-linear optimization, Application, Discrete 30 Hours 1

techniques and its application, Branch
Bound, Cutting Planes method, Heuristic and
 Approximation algorithms.
Dynamic Programming Optimality,
condition, Gradient method, Conjugate, Accelerated,
III Noise reduction method, Line search and Newton
30 Hours 1
search method, Robust optimization, Large scale
optimization, Network flows.
Modern Optimization Techniques: Genetic
algorithm terms and concept, mathematical formulation,
IV Neural Network-based optimization, Fuzzy
optimization techniques , real life application; Ant
30 Hours 1
colony optimizing method, application, real life issues
and overcome using formulation.

Text/Reference Books:

1. Optimization for Engineering Design by Kalyanmoy Deb, PHI

Publishers, 2012
2. Genetic algorithms in Search, Optimization, and Machine learning –
D.E.Goldberg, Addison-Wesley Publishers, 1989
3. Operations Research by Hillar and Liberman, TMH Publishers, 2021
4. Optimal design – Jasbir Arora, Mc Graw Hill (International)
Publishers, 2016
BAI3502 Concepts of Data Science with Python Course Objective:

1. To read, write and execute simple Python Programs

2. To learn and use Python data structures – lists, tuples and dictionaries
3. To understand the data science process and exploration
4. To learn Machine learning algorithms
5. To get a knowledge on types of learning, processes, techniques and models
Learning Outcome:
After completing the course, the students should be able to:
1. Use syntax and semantics of Python programming language for problem
solving and code a given logic in Python language.
2. Understand the data science concepts, techniques and models
3. Build recommendation systems
4. Build speech recognition systems
5. Learn and apply different mining algorithms and recommendation systems for
large volumes of data

Course Contents :
Module Course Topics Total Credits
Hours
Introduction to Data Science Case for data science, data
science classification, data science algorithms; Data Science
Process, prior Knowledge, Data Preparation, Modeling,
I Application, Knowledge; Data Exploration, Objectives of data 30 Hours 1
Exploration; Datasets, Descriptive Statistics; Data Visualization,
Roadmap for data exploration.

Introduction To Python Programming

Python interpreter and interactive mode; values and types
variables, expressions, statements, tuple assignment, Order of
II operations, comments, debugging; modules and functions:
function Calls, adding new functions, Definitions and Uses,
flow of execution, parameters and arguments, Fruitful 30 Hours 1
functions. Conditionals: Boolean values and operators,
conditional (if), alternative (if-else), chained conditional (if-
elif-else); Iteration: state, while, for, range, break, continue,
pass; recursion; Strings: string slices, immutability, string
functions and methods, string module; Lists as arrays.

Lists, Tuples, Dictionaries: Lists: Traversing a List, list

operations, list slices, list methods, Map, Filter and Reduce, list
loop, mutability, aliasing, cloning lists, list parameters;
III Dictionaries: operations and methods; advanced list processing 30 Hours 1
– list comprehension; Tuples: tuple assignment, tuple as return
value.

Files, Modules, Packages: Files and exception: 30 Hours 1

 text files, reading and writing files, format operator; command
IV line arguments, errors and exceptions, handling exceptions,
modules, packages: Pandas, Numpy, Scikit-Learn.

Text/Reference Books:

1. Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming

in Python: An Inter-disciplinary Approach, Pearson India Education Services Pvt.
Ltd., 2016.
2. Wes McKinney. “Python for Data Analysis”, O'Reilly Media, 2017, 2nd Edition.
3. Grus, Joel. “Data Science from Scratch: First Principles with Python”, O'Reilly
Media, 2015, 1st Edition.
4. Brian K. Jones and David M. Beazley. “Python Cookbook”, O'Reilly Media,
2013, 3rd Edition.
5. Dipanjan Sarkar, “Text Analytics with Python: A Practitioner‟s Guide to Natural
Language Processing”, A Press, 2019, 2nd Edition.
6. Daniel Jurafsky, James H. Martin, “Speech and Language Processing”,
Pearson, 2009.
BAI3503 Artificial Neural Network

Course Objective:

1. To understand the biological neural network and to model equivalent

neuron models.
2. To understand the architecture, learning algorithm and issues of various
feed forward and feedback neural networks.
3. To understand the fundamental theory and concepts of neural networks,
neuro-modelling, several neural network paradigms and its applications.
4. To understand the concepts of fuzzy sets, knowledge representation using
fuzzy rules, approximate reasoning, fuzzy inference systems, and fuzzy
logic control and other machine intelligence applications of fuzzy logic.
5. To understand the basics of an evolutionary computing paradigm known as
genetic algorithms and its application to engineering optimization
problems.

Learning Outcome:
After completing the course, the students should be able to:

1. Create different neural networks of various architectures both feed forward

and feed backward.
2. Perform the training of neural networks using various learning rules.
3. Perform the testing of neural networks and do the perform analysis of these
networks for various pattern recognition applications.
4. Understanding the impact of environment and propose the technological
solutions for sustainable development.
5. Ability to use current techniques, skills, and IT tools necessary for
computing practice.

Course Contents:
Total
Module Course Topics Credits
Hours

Introduction: Neural Network, Human Brain, Models

of a Neuron, Neural Networks viewed as Directed
I Graphs, Network Architectures, Knowledge 30 Hours 1
Representation, Artificial Intelligence and Neural
Networks, Error Correction Learning, Memory Based
Learning, Hebbian Learning, Competitive, Boltzmann
Learning, Credit Assignment Problem, Memory,
Adaption, Statistical Nature of the Learning Process
 II Perceptron: Adaptive Filtering Problem,
Unconstrained Organization Techniques, Linear
Least Square Filters, Least Mean Square Algorithm,
Learning Curves, Learning Rate Annealing 30 Hours
Techniques, Perceptron –Convergence Theorem, 1
Relation Between Perceptron and Bayes Classifier for
a Gaussian Environment Multilayer Perceptron: Back
Propagation Algorithm XOR Problem, Heuristics,
Output Representation and Decision Rule, Computer
Experiment, Feature Detection.

Back Propagation: Back Propagation and

III Differentiation, Hessian Matrix,
Generalization, Cross Validation, Network Pruning 30 Hours 1
Techniques, Virtues, and Limitations
of Back Propagation Learning, Accelerated
Convergence, Supervised Learning

Neuro Dynamics: Dynamical Systems,

IV Stability of Equilibrium States, Attractors, Neuro
Dynamical Models, Manipulation of Attractors as a 30 Hours 1
Recurrent Network Paradigm Hopfield Models
– Hopfield Models,
Computer Experiment

Text/Reference Books:

1. Neural Networks a Comprehensive Foundations, Simon Haykin, PHI edition,

2004.
2. Artificial Neural Networks - B. Yegnanarayana Prentice Hall of India P Ltd 2005.
3. Neural Networks in Computer Inteligance, Li Min Fu TMH 2003.
BCS3503 Computer Networks
Course Objectives:
1. Build an understanding of the fundamental concepts of computer networking.
2. To understand the organization of computer networks, factors influencing
computer network development and the reasons for having variety of
different types of networks.
3. To apply knowledge of different techniques of error detection and correction
to detect and solve error bit during data transmission.
4. To demonstrate proper placement of different layers of ISO model and
illuminate its function.
5. To understand internals of main protocols such as FTP, SMTP, TCP, UDP, IP
6. To analyze simple protocols and can independently study literature
concerning computer networks.
7. Have a basic knowledge of the use of cryptography and network security.
Learning Outcomes:
At the end of the course, the student should be able to:
1. Independently understand basic computer network technology.
2. Identify the different types of network topologies and protocols.
3. Enumerate the layers of the OSI model and TCP/IP. Explain the function(s)
of each layer.
4. Identify the different types of network devices and their functions within a
network
5. Understand and building the skills of routing mechanisms.
6. Analysis the requirements for a given organizational structure and select
the most appropriate networking architecture and technology.
Course Contents:

Total
Module Course Topics Credits
Hours

Introduction
Introduction: Network objectives and applications;
network structure and architecture; OSI reference
I model; network services; network standardization; 30 1
examples of network; Physical layer: Fundamentals of Hours
data communication; transmission media; analog
transmission; digital transmission; switching; ISDN;
terminal handling; Broadcast channels and medium
access: LAN protocols.
 Data link layer and network layer
Data link layer: Design issues; error detection and
corrections; elementary data link protocols; sliding 30
II window protocols. Examples; Network layer: Design Hours 1
issues; routing algorithms; congestion control;
internetworking. Examples. CSMA with collision
detection; collision free protocols; IEEE standard 802
for LANs; comparison of LANs; Fiber optic networks
and FDDI.

Transport, Session and Presentation layer

Transport layer: Design Issues; connection
III management; example of a simple transport protocol. 30
1
Session layer: Design issues; remote procedure call; Hours
examples, Presentation layer: Design issues; data
compression and encryption; network security and
privacy. Examples;

Application Layer

IV Application layer: Design issues; File transfer and file 30 1

access; electronic mail; virtual terminals; other Hours
applications, Case study based on available network
software.

Text/Reference Books:
1. Andrew S. Tanenbaum “Computer Networks” Prentice Hall of India.
2. William Stallings “Local Networks” Maxwell Macmillan International Edition.
3. B.A. Forouzan “Data Communication and Networking”. Tata McGraw Hill.
BCS3504 Automata Theory and Formal Languages
Course Objective:
Students will learn several formal mathematical models of computation along with their
relationships with formal languages. They will learn regular languages and content free languages
which are crucial to understand how compilers and programming languages are built. Also students
will learn that not all problems are solvable by computers and some problems do not admit efficient
algorithms. Throughout this course, students will strengthen their rigorous mathematical reasoning
skills.
Learning Outcome:
At the end of the course, the student should be able to:
1. Demonstrate an understanding of abstract models of computing, including
deterministic (DFA), non deterministic (NFA) and Turing Machine (TM) models.
2. Understand the relative computing power of the different abstract machine
models.
3. Demonstrate an understanding of regular expression and grammars.
4. Understand the associations between language classes and machine models.
5. Understand the associations between language classes and language descriptors.
6. Understand decidable and undecidable problems.
7. Understand the application of machine models and descriptors to compiler theory
and parsing.

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to Automata
Introduction, Alphabets, Strings and Languages,
Automata and Grammars, Deterministic finite
I Automata (DFA)-Formal Definition- State transition
graph, Transition table, Language of DFA.
30 Hours 1
Nondeterministic finite Automata (NFA)-NFA with
epsilon transition, Language of NFA, Equivalence of
NFA and DFA, Minimization of Finite Automata,
Myhill-Nerode Theorem.
 Regular expression
Operators of regular expression and their precedence,
Algebraic laws for Regular expressions, Kleen’s
Theorem, Regular expression to FA, Application and
II Limitations of FA, DFA to Regular expression- Arden 30Hours 1
Theorem, Non Regular Languages, Pumping Lemma
for regular Languages - Application of Pumping
Lemma, Closure and Decision properties of Regular
Languages, FA with output -Moore and Mealy
machine, Equivalence of Moore and Mealy Machine.

Context free grammar and Context Free Languages

Definition, Examples, Derivation , Derivation trees
,Ambiguity in Grammar, -Inherent ambiguity ,
Ambiguous to Unambiguous CFG, Useless symbols
,Simplification of CFGs, Normal forms for CFGs: CNF
and GNF, Closure and Decision properties of CFL,
III 30 Hours 1
Pumping lemma for CFLs.

Push Down Automata (PDA)-Description and

Definition, Instantaneous description, Language of
PDA Acceptance by Final state, Acceptance by empty
stack-Deterministic PDA, Equivalence of PDA and
CFG, CFG to PDA and PDA to CFG ,Two stack PDA.

Turing machines (TM):

Basic model, definition and representation,
Instantaneous description, Language acceptance by
IV TM, Variants of Turing Machine, Universal TM,TM as 30 1
computer of integer function, Church’s Thesis, Hours
Recursive and recursively enumerable languages.,
Halting problem , Introduction to Undecidability -
Undecidable problems about TMs, Post
correspondence problem (PCP), Modified PCP and
Introduction to recursive function theory .
Text/Reference Books:
1. Hopcroft, Ullman, “Introduction to Automata Theory, Languages and
Computation”, Pearson Education.
2. K.L.P. Mishra and N. Chandrasekaran, “Theory of Computer Science:
Automata, Languages and Computation”, PHI Learning Private Limited,
Delhi India.
3. Peter Linz, "An Introduction to Formal Language and Automata", Narosa
Publishing house.
4. Y. N. Singh “Mathematical Foundation of Computer Science”, New Age
International.
5. Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI
Learning Private Limited, Delhi India.
6. K. Krithivasan and R. Rama; Introduction to Formal Languages, Automata
Theory and Computation; Pearson Education.
7. Harry R. Lewis and Christos H. Papadimitriou, Elements of the theory of
Computation, Second Edition, Prentice-Hall of India Pvt. Ltd.
8. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson
Learning
BAI3552 Data Science with Python Lab List of

Experiments:

Write python scripts to implement following programs.

1. Implementation of a program for reading of different types of data sets (.txt,

.csv) from web and disk and writing in file in specific disk location.
2. Implementation of a program for reading of EXCEL and XML data sheets.
3. Implementation of Basic Statistics functions and performs visualization.
4. Implementation of K-means Clustering and K-nearest Neighbor algorithm.
5. Implementation of Association Rules.
6. Implementation of Linear Regression and Logistic Regression.
7. Implementation of Naive Bayesian Classifier.
8. Implementation of Decision Trees.
9. Implementation of Random Forest. 10.Implementation of
Principal component analysis. 11.Implementation of Singular
Value Decomposition.
BCS3553 Computer Networks Lab
List of Experiments
1. Study of different type of Network cables and practically implement the cross wired
cable.
2. Study and implementation of basic network command and network configuration
commands.
3. Connect the computers in local area network.
4. To write a socket program for implementation of echo.
5. Write a program in C, to perform character stuffing.
6. Write a program in C, to perform Bit stuffing.
7. Implement CRC (Cyclic redundancy check) in C.
8. Study of Network Simulators like NS2, OPNET.
9. Write a program in C, to implement sliding window protocol.
10. To create Scenario and Study the performance of Ring topology through simulation.
11. To create Scenario and Study the performance of Bus topology through simulation.
BAI3553 Artificial Neural Network Lab

Note: Minimum 8 experiments to be performed by students.

List of Experiments:

1. Write a program to implement Perceptron.

2. Write a program to implement AND OR gates using Perceptron.
3. Implement Crab Classification using pattern net.
4. Write a program to implement Wine Classification using Back
propagation.
5. Write a Mat Lab Script containing four functions Addition, Subtraction, Multiply
and Divide functions.
6. Write a program to implement classification of linearly separable Data with a
perceptron.
7. Study Long Short Term Memory for Time Series Prediction.
8. Study Convolutional Neural Network and Recurrent Neural Network.
9. Study ImageNet, Google Net, Res Net convolutional Neural Networks. 10.Study the
use of Long Short Term Memory / Gated Recurrent Units to
predict the stock prices based on historic data.
BAI3601 Evolutionary Algorithms Course

Objective:

1. Summarize current research in Genetic Algorithms and Evolutionary Computing.

2. Design algorithms that are robust yet easy to program.
3. To solve optimization related problems efficiently.
4. How to solve hard problems without using complex mathematical
formulations.
Learning Outcome:

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

1. Describe the Evolutionary algorithms and solve complex problem using evolutionary
algorithms.
2. Identify the issues in design and implementation of genetic algorithm.
3. Explain the concepts of Swarm Intelligence techniques.
4. Describe the social network structure.
5. Evolutionary Computation and Artificial Life for optimization of biological problems.
6. Describe the deferential evolutionary algorithms.

Course Contents:

Module Course Topics Total Credits

Hours
Introduction to Evolutionary Algorithms (EA):
Biological foundation of Evolutionary computing,
Principles of evolutionary computation, Introduction of
I EA, EA and Artificial Intelligence, Types of EA, 30 Hours 1
Evolutionary Strategies, Evolutionary Programming,
Structure of an evolutionary
algorithm, Difference between Traditional and
Heuristic search, Advantages of EA

Genetic Algorithms (GA): Biological foundation of

GA, General steps in GA, Genetic Operations (cloning,
crossover and mutation), Encoding techniques,
II Selection techniques (Proportional, Ranking, 30 Hours 1
Tournament), Convergence, Mathematical foundation
and Schemata, Holland Schemata theorem, Design and
implementation of GA for Travelling Salesman
Problem, Pros and cons of GA, Classification of
Genetic Algorithm, Various applications of GA, Recent
trends in GA
Advanced Operators and Technique in
 Genetic Algorithm: Multiploid, Inversion and
Reordering, Partially Matched and Cyclic Crossover

Genetic Programming (GP): Primitives, Genetic

Operators, Representation of GP, Attributes in GP,
Executional Steps, Characteristics and applications of
III Genetic Programming 30 Hours 1
Differential Evolution (DE):
Representation, Operators, Algorithm,
Applications of DE, Types of DE with their Hybrids

Swarm Algorithms (SA):

Fundamental of SA, SA Techniques: Ant Colony
Optimization (ACO) and Particle Swarm Optimization
(PSO), Comparison between EA and SA, General steps
in ACO, Ant Colonies and Optimization, Ant Colonies
and Clustering, Applications of ACO
PSO: Fundamental of PSO, The Neighbourhood
Principle, PSO Algorithm, Fitness Calculation,
Convergence, PSO System Parameters, Applications of
IV PSO 30 Hours 1
Multi-Objective Optimization: Linear and nonlinear
multi-objective problems, convex and non – convex
problems, Use of Evolutionary Computations to solve
multi
objective optimization, bi level optimization,
Theoretical Foundations.

Text/Reference Books:

1. Thomas Bäck, “Evolutionary algorithms in theory and practice”, Oxford

University Press, 1996.
2. W. Kosinski, “Advances in evolutionary algorithms”, In-Tech, 2008.
3. M. Mitchell, “An introduction to Genetic Algorithms”, Prentice-Hall, 1998.
4. D. E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine
Learning,”Addison Wesley,1989.
5. R.Eberhart, P.Simpson and R.Dobbins, “Computational Intelligence - PC
Tools”, AP Professional, 1996.
BAI3602 Design & Analysis of Algorithms Course

Objective:

1. To remember and analyze the asymptotic performance of algorithms.

2. To write rigorous correctness proofs for algorithms.
3. To demonstrate a familiarity with major algorithms and data structures.
4. To apply important algorithmic design paradigms and methods of analysis.
5. To evaluate efficient algorithms in common engineering design situations.

Learning Outcome:

After completing the course, the students should be able to:

1. This course will provide an understanding of how to write algorithms for
various problems and do an analysis of the same.
2. Analyze worst-case running times of algorithms using asymptotic analysis.
3. Design algorithms using different algorithm paradigm like dynamic-
programming paradigm, Greedy paradigm, Divide & Conquer approach etc
4. Synthesize new graph algorithms and algorithms that employ graph
computations as key components, and analyze them
5. Analyze randomized algorithms and amortized running time.
6. Compare between different data structures. Pick an appropriate data
structure for a design situation.
7. Explain what an approximation algorithm is, and the benefit of using
approximation algorithms.

Course Contents:

Total
Module Course Topics Credits
Hours

Analysis of Algorithm: Introduction:

Algorithms, Pseudo code for algorithms,
I Characteristics of Algorithm, Designing of
Algorithms, Analyzing algorithms, 30 Hours 1
Complexity of algorithms, Growth of
Functions, Mathematics for Algorithms:
Definitions, Notion of Algorithm and Basic results,
Asymptotic Notation, Recurrences, Substitution
method, Iteration method, Master method
Sorting and Searching Algorithm: Insertion Sort
Selection Sort and Bubble Sort, Searching in
sequential time.
 Divide and Conquer Method: Introduction to
Divide and Conquer Approach: Binary Search,
Finding Maximum and Minimum, Merge Sort, Quick
II Sort, Heap Sort. 30 Hours 1
Advanced Data Structure: Binary Search Tree and
Red Black tree: Tree Traversal and Related
Properties, Augmenting data
structures, Order-statistic tree, B Tree, Binomial
Heaps, Fibonacci Heaps.

Advanced Design and Analysis Techniques:

III Dynamic Programming: Elements of dynamic
programming, Assembly-line scheduling problem,
Matrix chain multiplication, finding longest common
subsequence; Multistage Graph : All Pairs Shortest
Path Algorithm , Basic search techniques and
traversal techniques, bi- connected components,
Depth First Search, Breadth First Search.
30 Hours 1
Greedy Algorithm: Elements of greedy strategy,
Activity selection problem, Huffman encoding,
Task-scheduling problem, Amortized analysis,
Minimum Spanning Tree Algorithm, Single Source
Shortest Path Algorithm. Maximum Flow and Flow
networks,

Backtracking: N-Queens Problem, Sum of

Subsets, Graph Coloring, Hamiltonian Cycle.
Branch and Bound Method, Knapsack Problem: 0/1 30 Hours 1
IV Knapsack Problem, Fractional Knapsack Problem,
Traveling Salesman Problem

Randomized Algorithms, String Matching, NP

Completeness, Approximation Algorithms

Text/Reference Books:

1. E.Horowitz , Sahni & Sanguthevar Rajasekaran, “Fundamentals of Computer

Algorithms”, Galgotia Publications,1997
2. Richard Johnsonbaugh , Marcus Schaefer , “ Algorithms “ , Pearson Education,
2006 3rd edition (chapter 1,2,10)
3. Aho, Ullman & Hopcraft, “The Design and Analysis of Algorithms”, Pearson
Education, 2001
4. S.E.Goodman , S.T.Hedetniemi , “Introduction to the Design and Analysis of
Algorithms”, McGraw Hill , 2002
5. Sara Baase , “Computer Algorithms - Introduction to design and analysis”,
Pearson Education, 1998
BAI3603 Robotics and Intelligent Systems Course

Objective:

1. To understand Robotics, Control and Intelligent Systems.

2. To understand necessary Approaches and Techniques to build working
mechanisms of robots.

Learning Outcome:
After completing the course, the students should be able to:
1. To model robot manipulators and mobile robots
2. Design and analyze robot controllers by using appropriate methods
3. Design basic robot intelligent sensor systems including static system
learning (kinematics) and dynamic learning; and intelligent course
recognition.
4. Acquire skill in robot task planning for problem solving.
5. Develop skills in identifying areas in manufacturing where robotics can be
deployed for enhancing productivity.

Course Contents:
Total
Module Course Topics Credits
Hours

Robotics Systems: Overview and Preliminaries,

Biological Paradigms, Robotic Manipulators
Sensors and Actuators, Low-Level Robot Control,
Mobile Robots, Modelling Dynamic Systems
Kinematics and Dynamics of Rigid Bodies,
I Continuous- and Discrete- time Dynamic Models,
Linearization and Linear Response, 30 Hours 1
Controller hardware/software
systems, Sensor systems and integration.

Intelligent Systems and Control: General rule

based expert systems- structure, characteristics,
chaining inferences, conflict resolution, Fuzzy
expert systems- fuzzy sets and their operations,
II linguistic variables, fuzzy rules, fuzzy inference, 30 Hours 1
defuzzification, applications. Evolutionary and
genetic algorithms- simulation of natural
 evolution, genetic algorithms, genetic
operators, fitness function, applications.
Simulation and control of dynamics systems-
modeling using Simulink, PID controllers,
implementation, fuzzy control, stability and
performance evaluations.

Neural Networks: Learning processes,

Single layer perceptron, Multilayer perceptron,
Radial basis function neural networks, Self
III 30 Hours 1
organizing map neural networks Learning vector
quantization neural networks.
Goal-Oriented Control :
IV Optimal Control, Robust, Adaptive, and Neural 30 Hours 1
Control, Training Neural Networks, Task Planning
and Multi-Agent Systems.

Text/Reference Books:

1. M. Negnevitsky, Artificial Intelligence – A guide to intelligent systems Addison-

Wesley, 2005.
2. M. Tarokh, Intelligent Systems and Control, Lectures
3. J. J. Craig, Introduction to Robotics, Addison Wesley Publishers, 2005.
4. Autonomous Robots, G. Bekey, MIT Press, 2005
5. Jones, Joseph L., Flynn, Anita, M., and Seiger, B.A., “Mobile Robots: Inspiration
to Implementation”, AK Peters, 1999
6. Schilling R. J., Fundamentals of Robotics: Analysis and Control, Prentice
Hall, 2004
7. McKerrow P. J., Introduction to Robotics, Addison-Wesley.
8. Siegwart R. and Nourbakhsh I. R., Introduction to Autonomous Mobile Robots, The
MIT Press, 2004.
BCS3604 Compiler Design
Course Objective:
1. The aim of this module is to show how to apply the theory of language
translation introduced in the prerequisite courses to build compilers and
interpreters.
2. It covers the building of translators both from scratch and using compiler
generators.
3. In the process, the module also identifies and explores the main issues of the
design of translators.
4. The construction of a compiler/interpreter for a small language is a necessary
component of this module, so students can obtain the necessary skills.
Learning Outcome:
At the end of the course, the student should be able to:
1. Understand the structure of compilers.
2. Understand the basic techniques used in compiler construction such as lexical
analysis, top-down, bottom-up parsing, context-sensitive analysis, and
intermediate code generation.
3. Understand the basic data structures used in compiler construction such as
abstract syntax trees, symbol tables, three-address code, and stack machines

Course Contents:

Total
Module Course Topics Credits
Hours
Introduction to Compiler
Introduction-Compiler and features, Analysis –
Synthesis model, Phases of compiler, Grouping of
Phase, Concept of pass, Bootstrapping. Lexical
30
I analyzer-Implementation and Role of lexical analyzer, Hours 1
Token, Pattern and Lexemes and function, Finite state
machine and Regular expression. Formal grammar and
their application to syntax analysis- CFG, derivation
and Parse trees
Basics Parsing Techniques –I: Top-Down Parser-
Back tracking, Predictive Parser
Basic parsing techniques-II: Bottom –Up Parser
Shift –Reduce Parser, Operator Precedence parsing,
Recursive descent parsing, LR Parser-LR(0) Parser ,
SLR parser , Canonical LR Parser, LALR Parser. 30
II 1
Syntax-Directed Translation-Syntax Directed definition Hours
and type, Construction of Syntax Tree and DAG
representation. Symbols Table- Storage Allocation
strategies, Runtime Storage Organization, Structure
Storage Allocation, Error detection and
Recovery-Lexical, syntax and semantic error.
 Intermediate code Generator
Intermediate code- forms of intermediate code,
Implementation of 3-address code- Quadruple, direct
III
and triple, Translation of Assignment statements,
Translation of Boolean expression- Flow of Control
Statement, and Case statements. Code Generation- 30
1
Hours
Design issues, The Target code and addresses in target
code, Code generator algorithm.
Code Optimization
Machine-independent optimization, Basic Blocks, Flow
IV graph- DAG representation of basic blocks, Loop in 30 1
Hours
Flow graph .Transformation, Loop Optimization
,Peephole Optimization, Global Data
Flow-Control Flow Analysis, Data Flow Analysis

Text/Reference Books:
1. Aho, Sethi& Ullman, “Compilers: Principles, Techniques and Tools”, Pearson
Education
2. V Raghvan, “Principles of Compiler Design”, TMH
3. Kenneth Louden, “Compiler Construction”, Cengage Learning.
4. Charles Fischer and Ricard LeBlanc, “Crafting a Compiler with C”,
Pearson Education
BAI3651 Evolutionary Algorithms Lab

Software/Tools used: MATLAB/PYTHON. List

of Experiments:

1. Study of genetic algorithms.

2. Study of genetic Programming.
3. Understanding working of differential evolution.
4. Study of Particle swarm optimization and Ant colony optimization.
2
5. Find the global maximum of the function 1 + e−x cos(36x); xϵ[−1,1] using GA.
6. Implement travelling sales person problem (tsp) using genetic algorithms.
7. Implement travelling sales person problem (tsp) using PSO.
8. Implement travelling sales person problem (tsp) using Ant Colony
optimization.
9. Implementation of multi objective evolutionary algorithms.
10. A and B are two given points on the same side of a line l ,find a point D on l such that the
sum of distances from A to D and from D to B is minimum.
BAI3652 Algorithms Lab List

of Experiments:

1. Implementation of an application of Dynamic Programming. (Multistage graphs,

Optimal BST, 0/1 knapsack, Traveling salesperson problem).
2. Implementation of an application of Greedy Algorithm. (Knapsack problem, Job
sequencing, Optimal merge patterns).
3. Implementation of an application of Back tracking (n-queens problem, graph
coloring problem, Hamiltonian cycles).
4. Implementation of Minimum Spanning Tree Algorithm.
5. Implementation of Single-pair shortest path Algorithm.
6. Implementation of All-pair shortest path Algorithm.
7. Implementation of String-Matching Algorithm.
8. Implementation of Quick Sort and Merge Sort.
9. Implementation of Linear-time Sorting Algorithms.
10. Implementation of Red-Black Tree operations.
11. Implementation of Binomial Heap operations.
12. Implementation of Strassen‘s matrix multiplication
BAI3701 Natural Language Processing

Course Objective:
1. To tag a given text with basic Language features
2. To design an innovative application using NLP components
3. To learn the fundamentals of natural language processing
4. To understand the use of CFG and PCFG in NLP

Learning Outcome:
After completing the course, the students should be able to:
1. Teach students the leading trends and systems in natural language processing.
2. Make them understand the concepts of morphology, syntax, semantics and pragmatics of
the language and that they are able to give the appropriate examples that will illustrate the
above mentioned concepts.
3. Enable students to be capable to describe the application based on natural language
processing and to show the points of syntactic, semantic and pragmatic processing.
4. Understand approaches to discourse, generation, dialogue and summarization within NLP.
5. Understand approaches to syntax and semantics in NLP.

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to NLP, Need of NLP, History of NLP,

Advantages and Disadvantages of NLP, Applications
of NLP.
I 1
How does NLP work, components of NLP, Phases 30 Hours
of NLP, NLP vs. Machine learning. NLP
examples, Future of NLP.

Lexical analysis, Unsmoothed N grams, evaluating N

grams, Morphology and Finite state Transducers, 1
II Interpolation and Back off 30 Hours
– word classes, Part of Speech Tagging –
Markov Models, Hidden Markov Models.
Transformation based Models – Maximum Entropy
Models.
Syntax Parsing:-

Concept of Parser, Types of Parsing, Concept of

Derivation, Types of Derivation, Concept of Grammar,
III CFG, Definition of CFG. Grammar rules for English 30 Hours 1
Treebank’s, Normal forms for
grammar – Dependency Grammar, Syntactic
 Parsing, Ambiguity, Dynamic Programming
Parsing- Shallow Parsing.
Semantic Analysis and Disclosure
Pragmatic:-

Elements of Semantics Analysis, Difference between

Polysems and Homonymy. Meaning Representatives, 30 Hours 1
IV
Need of Meaning Representative, Disclosure
Pragmatic- Concept of Coherence, Disclosure
structure, Text coherence, Building Hierarchical
Disclosure structure. Reference Resolution,
Terminology used in Reference Resolution.

Text/Reference Books:

1. Daniel Jurafsky, James H. Martin: "Speech and Language Processing", 2/E, Prentice Hall,
2008.
2. James Allen, "Natural Language Understanding", 2/E, Addison-Wesley, 199Christopher D.
Manning, Hinrich Schutze: "Foundations of Statistical Natural Language Processing", MIT
Press, 1999
3. Steven Bird, Natural Language Processing with Python, 1st Edition, O'Reilly, 2009.
4. Jacob Perkins, Python Text Processing with NLTK 2.0 Cookbook, Packt Publishing, 2010
BAI3702 Fuzzy Logic

Course Objectives:

1. To teach about the concept of fuzziness involved in various systems. To provide

adequate knowledge about fuzzy set theory.
2. To provide adequate knowledge of application of fuzzy logic control to real time
systems.
3. Comprehend the fuzzy logic control and to design the fuzzy control using
genetic algorithms.
4. Apply basic fuzzy system modelling methods.
5. Make applications on Fuzzy logic membership function and fuzzy inference
systems.

Learning Outcomes:
After completing the course, the students should be able to:

1. Recognize fuzzy logic membership function.

2. Make applications on Fuzzy logic membership function and fuzzy
inference systems.
3. Use the fuzzy set theory on the statistical method which is given.
4. Analyse statistical data by using fuzzy logic methods.
5. Recognize fuzzy logic fuzzy inference systems

Course Content:

Total
Module Course Topics Credits
Hours

Introduction, Classical Sets and Fuzzy Sets:-

Background, Uncertainty and Imprecision, Statistics and

I 1
Random Processes, Uncertainty in Information Fuzzy 12 Hours
Sets and Membership, Chance versus Ambiguity
Classical Sets - Operations on Classical Sets Properties o
Classical (Crisp) Sets, Mapping of Classica Sets to
Functions Fuzzy Sets - Fuzzy Set operations, Properties of Fuzzy
Sets. Sets as Points in Hypercubes

Classical Relations and Fuzzy Relations :-

II
Cartesian Product, Crisp Relations- Cardinality of Crisp 1
9 Hours
Relations, Operations on Crisp
 III
,
11 Hours 1
Ge

IV 8 Hours 1

Text/ReferenceBooks:

1. Fuzzy Logic with Engineering Applicati ons By Timothy J. Ross · 2016.

2. Kosko, B, “Neural Networks and Fuzzy Systems: A Dynamical
Approach to Machine Intelligence”, PrenticeHall, NewDelhi, 2004.
BAI3751 Natural Language Processing Lab List of

Experiments:

1. Word Analysis
The objective of the experiment is to learn about morphological features of a word by
analysing it.
2. Word Generation
The objective of the experiment is to generate word forms from root and suffix
information.

3. Morphology
Understanding the morphology of a word by the use of Add-Delete table

4. N-Grams
The objective of this experiment is to learn to calculate bigrams from a given corpus and
calculate probability of a sentence.

5. N-Grams Smoothing
The objective of this experiment is to learn how to apply add-one smoothing on sparse
bigram table.

6. POS Tagging - Hidden Markov Model

The objective of the experiment is to calculate emission and transition matrix which will be
helpful for tagging Parts of Speech using Hidden Markov Model.

7. POS Tagging - Viterbi Decoding

The objective of this experiment is to find POS tags of words in a sentence using Viterbi
decoding.

8. Building POS Tagger

The objective of the experiment is to know the importance of context and size of training
corpus in learning Parts of Speech
BAI3752 FUZZY LOGIC LAB

List of Experiments:

1. Implementation of Fuzzy Operations.

2. Implementation of Fuzzy Relations (Max-min Composition).
3. Implementation of Fuzzy Controller (Washing Machine).
4. Implementation of Simple Neural Network (McCulloh-Pitts model).
5. Implementation of Perceptron Learning Algorithm.
6. Implementation of Unsupervised Learning Algorithm. Implementation of Simple
Genetic Application.
7. Study of ANFIS Architecture.
8. Study of Derivative-free Optimization.
9. Study of research paper on Soft Computing.
BAI3801 Concepts of Deep Learning Course
Objective:
1. Provide basic concepts of deep learning and applications in various fields.
2. This course emphasis is on analysing the fundamental issues to develop deep learning
models and applied to solve complex engineering and social problems.
3. Provide in-depth coverage of emerging trades of deep learning, focusing on the
development of deep learning models.
4. Provides analysis of big data and develops efficient models.
5. Develop industry-oriented skills.
Learning Outcomes:
Upon Successful Completion of this course, the students should be able to:

1. Demonstrate the basic concepts of deep learning.

2. Applies basic principles of deep learning that are required to analyse large dataset and
demonstrate the results in various formats.
3. Demonstrate advanced pre-trained deep learning models ie. GUN, LeNet5, VGG16
models to process large visual dataset.
4. Demonstrate how to improve the learning quality of the model to make it more
accurate.
5. Demonstrate current scope and limitations, and social impact of Deep learning
Course Contents:

Module Course Topics Total Credi

Hours t
INTRODUCTION: Definition of machine learning- Linear
models and Nonlinear Models, introduction to machine learning
I algorithms, biological neuron, perceptron, Neural Nets: shallow 30 1
network, training a network: back propagation, gradient descent
loss functions, and - Neural networks as universal function
approximates
DEEP NETWORKS: History of Deep Learning- Deep
Learning Platforms. A Probabilistic Theory of Deep Learning
II Backpropagation and regularization, normalization, Deep 30 1
Boltzmann Machine, Hidden Markov model, Deep Networks Vs
Shallow Networks- Convolutional Networks- Auto Encoder and
Generative Adversarial Networks (GAN), Semi- supervised
Learning
DIMENSIONALITY REDUCTION: Linear (PCA,
LDA) and manifolds, metric learning - dimensionality reduction
III in networks - Introduction to Convnet - 30 1
Architectures –LeNet5, AlexNet, VGG16, ResNet - Training
a Convnet: weights initialization, batch
 normalization, hyperparameter optimization,
vanishing gradients problem
OPTIMIZATION ALGORITHMS AND
GENERALIZATION: Concept of Optimization, Optimization
in deep learning– First Order, Second Order Methods, Stochastic
IV Methods, Population Based Methods, Spatial Transformer 30 1
Networks- Recurrent networks, LSTM - Recurrent Neural
Network Language Models- Word-Level RNNs & Deep
Reinforcement Learning - Computational & Artificial
Neuroscience.
CASE STUDY: Imagenet- Image Classification

Text books:

1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015
2. Deng & Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press, 2016.
4. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015
Reference Books:

1. Wei Qi Yan - Computational Methods for Deep Learning_ Theoretic, Practice and
Applications-Springer (2021)
2. Hisham El-Amir and Mahmoud Hamdy, Deep Learning Pipeline: Building a Deep
Learning Model with TensorFlow,Apress,2020
BAI3851 Deep Learning Lab

Note: Minimum 10 experiments to be performed by students

List of Experiments:

1. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print
both correct and wrong predictions.
2. Write a program to visualization of each species of iris dataset using Liner Regression Model.
3. Build a Logistic Regression model that answers the question: “what sorts of people were more
likely to survive?” using passenger data (ie name, age, gender, socio-economic class, etc). in
Titanic dataset.
4. Build a model to digit recognition of MNIST dataset using Support Vector Machine. Also print
the confusion matrix.
5. Write a program to implement the naïve Bayesian classifier for a sample training data set stored
as a .CSV file. Compute the accuracy of the classifier, considering few test data sets.
6. Build a CNN Model to identify Image from the CIFAR-10 Dataset. Calculate the accuracy,
precision, and recall for your data set.
7. The Pima Indians Diabetes Database can be used to train machine learning models to predict if a
given patient has diabetes. This dataset contains measurements relating to Pregnancies, Glucose,
Blood Pressure, Skin Thickness, Insulin, BMI, Diabetes Pedigree Function, and Age. Build a
predictive model and show the output in form of confusion matrix.
8. Write a program to generate images that never existed before. They learn about the world
(objects, animals and so forth) and create new versions of those images that never existed using
Generative Adversarial Networks (GAN) model.
9. Construct a Bayesian network considering medical data. Use this model to demonstrate the
diagnosis of heart patients using standard Heart Disease Data Set.
10. Write a program to classify retinal damage from OCT Scan dataset using a pre- trained VGG16
Model
11. Consider the “airline-passengers.csv“dataset. Write a program to implement LSTM (Short Long-
term Memory) Network, the task is to predict the number of international airline passengers in
units of 1,000. The data ranges from January 1949 to December 1960, or 12 years, with 144
observations.
OE33901 Principles of Industry 4.0 Course

Objective:

1. This course provides students with an introduction to Industry 4.0, its building blocks, its
applications and advantages compared to conventional production techniques.
2. Introduce the basic concepts of Industry 4.0, Artificial Intelligence, Big Data and Internet of
Things.
3. Learners will gain deep insights into how smartness is being harnessed from data and appreciate
what needs to be done in order to overcome some of the challenges.
4. Learn Application of Industry 4.0 and Business issues in Industry 4.0

Learning Outcomes:
On the successful completion of the course, student will be able to:

1. Understand the basic concepts of Industry 4.0

2. Summarize the Big data domain stack and Internet of Things
3. Understand the opportunities, challenges brought about by Industry 4.0 and how organisations
and individuals should prepare to reap the benefits
4. Identify the applications and Tools of Industry 4.0

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to Industry: Definition of Industry 4.0;

Need for adopting; Industry 4.0; Goals of Industry 4.0;
Developments in USA, Europe, China and other
I
countries; Comparison of Industry 4.0 Factory and 30 1
today's Factory; Difference between conventional
automation and Industry 4.0; Difference between
conventional automation and Industry 4.0.

Artificial intelligence, Big Data And IOT:

Introduction to AI; History/Foundation of AI; Tools
II
and Technologies of AI; Internet of Things (IoT) &
Industrial Internet of Things
 (IIoT) & Internet of Services; Big Data Definitions; Big
Data Components; Big Data Tools; Big Data in Data
Science; Big Data in IoT 30 1
; Big Data in Machine Learning ; Big Data in Databases;
Big Data for Industry; Internet of Things (IoT)
Introduction; Industrial Internet of Things (IIoT);
Internet of Services; Architecture of IoT; Technologies
for IoT; Applications of IoT.
Related Disciplines, System, Technologies for
enabling Industry 4.0: Cyberphysical Systems; Robotic
III Automation and Collaborative Robots; Support System 30 1
for Industry 4.0; Mobile Computing; Cyber Security;
Cloud Computing Basics; Cloud Computing and
Industry 4.0.
Application of Industry 4.0: Impact of Industry 4.0 on
IV Society; Impact on Business, Government, People;
Impact on Healthcare and Education.
Business issues in Industry 4.0: Opportunities and 30 1
Challenges; Future of Works and Skills for Workers in
the Industry 4.0 Era; Strategies for competing in an
Industry 4.0 world.

Text/ReferenceBooks:

1. Alasdair Gilchrist. Industry 4.0: The Industrial Internet of Things, Apress Publications.
OE33902 Nature Inspired Algorithms Course
Objective:
By the end of the course, students will be able to
1. Study the basics Natural systems.
2. Study the concepts of Natural systems and its applications
3. Study the Basic Natural systems functions(operations)
4. Study the Natural design considerations
5. Study the Integration of Hardware and software in Natural applications.
Learning Outcome:
After completing the course, the students should be able to:
1. Explain the Concept of Basic Natural Systems.
2. Explain all the Basic Natural System Models(Operations)
3. Design the different Computing models.
4. Integration of Models in Computing Platform.
Course Contents:

Total
Module Course Topics Credits
Hours

INTRODUCTION: From Nature to Nature Computing

, Philosophy , Three Branches: A Brief Overview, 30 1
Individuals, Entities and agents - Parallelism and
I Distributive Interactivity ,Adaptation Feedback-Self-
Organization-Complexity, Emergence and
,Bottom-up Vs Top-Down- Determination, Chaos and
Fractals.
Computing Inspired by Nature: Evolutionary
II Computing, Hill Climbing and Simulated Annealing, 30 1
Darwin's Dangerous Idea, Genetics Principles,
Standard Evolutionary Algorithm -Genetic Algorithms
, Reproduction-Crossover, Mutation,
Evolutionary Programming, Genetic
Programming

SWARM INTELLIGENCE: Introduction - Ant 30 1

III Colonies, Ant Foraging Behavior, Ant Colony
Optimization, SACO and scope of ACO
algorithms, Ant Colony Algorithm (ACA), Swarm
Robotics, Foraging for food, Social Adaptation of
Knowledge , Particle Swarm
Optimization (PSO)
 IMMUNOCOMPUTING: Introduction- 30 1
IV Immune System, Physiology and main components,
Pattern Recognition and Binding , Immune Network
Theory- Danger Theory, Evaluation
InteractionImmune Algorithms , Introduction –
Genetic algorithms , Bone Marrow Models , Forest's
Algorithm, Artificial Immune Networks,
COMPUTING WITH NEW NATURAL
MATERIALS: DNA Computing: Motivation, DNA
Molecule , Adleman's experiment , Test tube
programming language, Universal DNA Computers ,
PAM Model , Splicing Systems , Lipton's Solution to
SAT Problem , Scope of
DNA Computing , From Classical to DNA
Computing

TEXT BOOKS

1. Leandro Nunes de Castro, " Fundamentals of Natural Computing, Basic Concepts, Algorithms and
Applications", Chapman & Hall/ CRC, Taylor and Francis Group, 2007

REFERENCE BOOKS

1. Floreano D. and Mattiussi C., "Bio-Inspired Artificial Intelligence: Theories, Methods, and
Technologies", MIT Press, Cambridge, MA, 2008
2. Albert Y.Zomaya, "Handbook of Nature-Inspired and Innovative Computing", Springer, 2006. 4.
Marco Dorrigo, Thomas Stutzle,” Ant Colony Optimization”, PHI,2005
GE33911 Cyber Law and Security Course

Objective:

1. To introduce the basics of information security and computer

communication.
2. To familiarize students with Cyber Laws and Security policies and
Cryptography.
3. To exhibit knowledge to secure corrupted systems, protect personal data, and
secure computer networks in an Organization.
4. To understand principles of web security and to guarantee a secure network by
monitoring and analyzing the nature of attacks through cyber/computer forensics
software/tools.

Learning Outcome:
After completing the course, the students should be able to:
1. Help the organization to continue its commercial activities in the event of significant
information security incidents
2. Establish responsibility and accountability for information security
in organizations
3. Be proficient in various forensic tools and usage of tools for disk imaging
and recovery processes
4. Design security procedures and policies

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to information systems, Types of

information Systems, Development of Information
Systems, Introduction to information security, Need for
Information security, Threats to Information Systems,
Information Assurance, Cyber Security, and Security Risk
Analysis. Classification of Threats and Assessing 30 Hours 1
I Damages Security in Mobile and Wireless Computing ,
Security Challenges in Mobile Devices, authentication
Service Security, Security Implication for organizations.
 Application security (Database, E-mail and Internet),
Data Security Considerations- Backups, Archival Storage
and Disposal of Data, Security Technology-Firewall and
VPNs, Security Threats-Viruses, Worms, Trojan Horse,
Bombs, Trapdoors, Spoofs, E-mail viruses, Macro
II viruses, Malicious Software, Network and Denial of 30 Hours 1
Services Attack, Security Threats to E- Commerce-
Electronic Payment System, e- Cash, Credit/Debit Cards.
Digital Signature, public Key Cryptography.

Developing Secure Information Systems, Application

Development Security, Information Security Governance
& Risk Management, Security Architecture & Design
III Security Issues in Hardware, Data Storage &
Downloadable Devices, Physical Security of IT Assets,
Access Control, CCTV and intrusion Detection Systems, 30 Hours 1
Backup Security Measures.
Laws, Investigation and Ethics, Cyber Crime ,
Information Security and Law ,Types & overview of
Cyber Crimes, Cyber Law, Issues in E-Business
Management Overview of Indian IT Act, Ethical Issues in
IV
Intellectual property rights, Copy Right, Patents, Data 30 Hours 1
privacy and protection, Domain Name, Software piracy,
Plagiarism, Issues in ethical hacking.

Text/Reference Books:

1. Godbole, “ Information Systems Security”, Willey, 2008

2. Merkov, Breithaupt, “ Information Security”, Pearson Education, 2014
3. Yadav, “Foundations of Information Technology”, New Age, Delhi, 2006
4. Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw
Hill, 2006
GE33912 Introduction to Unmanned Aerial Vehicles

Course Objective:
1. Describe the parts and functions of UAV & Indian Aviation regulations of UAV
2. Explain the concepts of Aerodynamics, Propulsion & Structures of Model
Aircrafts
3. Describe the working principle and components of UAV
4. Demonstrate the design process of UAV
5. Demonstrate design, fabrication and Flying of UAV

Learning Outcome:

1. Compute loads acting on various types of UAVs

2. Apply concept of performance and stability analysis of UAVs
3. Derive equation of motion of UAV
4. Identify application of sensors and actuators in UAV

Course Contents:
Total
Module Course Topics Credits
Hours
BASICS OF FLIGHT
Different types of flight vehicles, Components and functions
of an airplane Forces acting on Airplane Physical properties
I and structure of the atmosphere Aerodynamics, Airfoil 30 1
nomenclature, aerofoil characteristics, Angle of attack, Mach Hours
number, Lift and Drag, Propulsion and airplane structures.

Basic Review & Characteristics of UAV

Types: History, Classification and applications of UAVs,
Unmanned Aircraft System (UAS), UAS composition,
societal impact, future prospects, Regulations and 30
II safety considerations. Long- range, long-endurance, Hours 1
MUAV types, MAV and NAV types, UCAV, Novel
hybrid aircraft configurations
Unmanned Aerial Vehicles Difference between aircraft and
UAV - Parts and functions of Fixed, Rotorcraft and flapping
wing UAV, various History of UAVs, Types of Drones,
Applications and Uses. Characteristics of Multi rotor
vehicle, Fixed Wing vehicle, Flapping wing
Vehicles and their applications, Defense

Introduction to design and selection of UAV Aspects of

airframe design:Conceptual design, preliminary design,
detailed design, selection of UAV for particular
requirement. Airframe configuration, Scale effects, 30 1
packaging density, Aerodynamic design, Strength, Hours
stiffness and reliability requirements, flight and gust
envelopes including manoeuvre loads, selection
 of power plants, Design for stealth PAYLOADS FOR
UAV Classification of Payloads, camera, sensors, radars,
III various measuring devices classification of payload based
on applications, Hyper spectral sensors, laser detection and
range, synthetic aperture radar, thermal cameras,
ultrasonic detectors, case study on payloads.

Avionics Hardware & Communication Autopilot, AGL-

pressure sensors, servos, accelerometer, gyros, actuators,
power supply, processor, integration, installation,
configuration, and testing

IV UAV NAVIGATION AND GUIDANCE 30 1

System Navigation, Dead Reckoning, Inertial, Radio Hours
Navigation, Satellite, Waypoint Navigation, Dijkstra’s
Algorithm, A-star Algorithm, UAV Guidance, Types of
guidance, UAV communication systems, Ground control
station, Telemetry, UAS future.

Text/ Reference Books:

1. Andey Lennon “ Basics of R/C model Aircraft design” Model airplane

news publication
2. Randal W. Beard and Timothy W. McLain: Small Unmanned Aircraft:
Theory and Practice, Princeton University Press, 2012
3. Kimon P. Valavanis: Advances in Unmanned Aerial Vehicles: State of the Art
and the Road to Autonomy, Springer, 2007
GE33913 Computer Vision

Course Objective:

1. Identify basic concepts, terminology, theories, models and methods in the field of computer
vision.
2. Describe known principles of the human visual system.
3. Describe basic methods of computer vision related to multi-scale representation, edge detection
and detection of other primitives, stereo, motion and objectrecognition.
4. suggest a design of a computer vision system for a specific problem.

Learning Outcome:

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

1. Have a complete knowledge on various computer vision available in literature.
2. Have realized some satisfaction of having learnt that computer vision is indeed useful in computer
science and engineering and thereby concluding that no mistake has been made in studying this course.
3. Gain some confidence on how to deal with problems which may arrive in computer science and
engineering in near future.
4. Be able to construct simple mathematical proofs.
5. Be able to understand methods and techniques better.
6. Understanding of imaging systems.

Course Contents:

Module Course Topics Total Credits

Hours

I Image formation and camera calibration: Introduction to 30 1

computer vision, geometric camera models, orthographic and Hours
perspective projections, weak perspective projection, intrinsic and
extrinsic camera
parameters, linear and nonlinear approaches of camera calibration.
II Feature detection and matching: Edge detection, interest points 30 1
and corners, local image features, feature matching and Hough Hours
transform, model fitting and RANSAC, scale invariant feature
matching.
 III Stereo Vision: Stereo camera geometry and epipolar constraints, 30 1
essential and fundamental matrix, image rectification, local Hours
methods for stereo matching: correlation and multi-scale
approaches, global methods for stereo matching: order constraints
and dynamic
programming, smoothness and graph based energy
minimization, optical flow

IV Shape from Shading: Modeling pixel brightness, reflection at 30 1

surfaces, the Lambertian and specular model, area sources, Hours
photometric stereo: shape from multiple shaded images, modeling
inter-reflection, shape from one shaded image
Structure from motion: Camera self-calibration,
Euclidean structure and motion from two images, Euclidean
structure and motion from multiple images, structure and motion
from weak-perspective and multiple cameras.

1. Forsyth, D. A. and Ponce, J., "Computer Vision: A Modern Approach", Prentice Hall, 2nd
Ed.
2. Richard Szeliki, R., "Computer Vision: Algorithms and Applications", Springer.
3. Hartley,R. and Zisserman, A.,"Multiple View Geometry in Computer Vision”,
Cambridge University Press.
4. Gonzalez, R. C. and Woods, R. E., "Digital Image Processing", Prentice Hall, 3rd Ed. Trucco,
E. and Verri, A., "Introductory Techniques for 3-D ComputerVision", Prentice Hall.
5. Pedram Azad, Tilo Gockel, R. Dillmann, Computer Vision: Principles and Practice, Elektor
Electronics Publishing, 2008.
6. Dana Harry Ballard, Christopher M. Brown, Computer vision, Prentice-Hall, 1982
GE33914 Recommender Systems Course

Objective:

1. This course covers the basic concepts of recommender systems.

2. To learn personalization algorithms, evaluation tools, and user
experiences.
3. To analyse Data Mining Methods for Recommender Systems.
4. To develop the concepts of Content-based Recommender Systems.
5. To study a Comprehensive Survey of Neighbourhood-based
Recommendation Methods.

Learning Outcome:
After completing the course, the students should be able to:

1. Understand the most important classification techniques, including Bayesian

Networks and Support Vector Machines.
2. Develop how recommender systems are deployed in e-commerce sites, social
networks, and many other online systems.
3. To understand the basic of Classification, Cluster Analysis and Data Pre-
processing.

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction:Introduction to Recommender Systems,

Recommender Systems Function, Linear Algebra notation:
I Matrix addition, Multiplication, transposition, and
inverses, covariance matrices, Understanding ratings,
Applications of recommendation systems, Issues with
recommender system, Data and Knowledge Sources, 30 Hours 1
Recommendation Techniques, Recommender Systems and
Human Computer Interaction, Recommender Systems as a
Multi- Disciplinary Field, Application and Evaluation.

Data Mining Methods for Recommender Systems,

Collaborative Filtering:Data Preprocessing,
Classification: Nearest Neighbors, Decision Trees, Rule-
based Classifiers, Bayesian Classifiers, Artificial Neural
Networks, Support Vector Machines, Ensembles of
Classifiers. Cluster Analysis: k-Means, Alternatives to k-
II 30 Hours 1
means. User-based nearest neighbor recommendation,
Item-based nearest neighbor recommendation, Model
based and
 pre-processing based approaches, Attacks on
collaborative recommender systems.

Content-based Recommender Systems, Knowledge

based recommendation:Basics of Content-based
Recommender Systems. High level architecture of
content-based systems, Advantages and drawbacks of
content based filtering, Item profiles, Discovering features 1
III of documents, Obtaining item features from tags, 30 Hours
Representing item profiles, Methods for learning user
profiles, Similarity based retrieval, Classification
algorithms. Knowledge representation and reasoning,
Constraint based recommenders, Case based
recommenders.

Hybrid approaches, Evaluating

Recommender System Recommender Systems and
communities:Opportunities for hybridization, Monolithic
hybridization design: Feature combination, Feature
augmentation, Parallelized hybridization design:
IV Weighted, Switching, Mixed, Pipelined hybridization 30 Hours 1
design: Cascade Meta-level, Limitations of hybridization
strategies. Introduction, General properties of evaluation
research, Evaluation designs, Evaluation on historical
datasets, Error metrics, Decision-Support metrics, User-
Centred metrics. Communities, collaboration and
recommender systems in personalized web search, Social
tagging recommender systems,
Trust and recommendations, Group recommender
systems.

Text/Reference Books:
1. Jannach D., Zanker M. and FelFering A., Recommender Systems: An
Introduction, Cambridge University Press (2011), 1.
2. Ricci F., Rokach L., Shapira D., Kantor B.P., Recommender Systems
Handbook, Springer (2011), 1.
3. Manouselis N., Drachsler H., Verbert K., Duval E., Recommender
Systems For Learning, Springer (2013), 1.
GE33921 Block Chain Technology Course

Objective:

By the end of the course, students will be able to

1. Understand how block chain systems (mainly Bitcoin and Ethereum) work,
2. To securely interact with them,
3. Design, build, and deploy smart contracts and distributed applications,
4. Integrate ideas from block chain technology into their own projects,
5. Evaluate security, privacy, and efficiency of a given block chain system.

Learning Outcome:
After completing the course, the students should be able to:

1. Explain design principles of Bitcoin and Ethereum.

2. Explain Nakamoto consensus.
3. Explain the Simplified Payment Verification protocol.
4. List and describe differences between proof-of-work and proof-of-stake consensus.
5. Interact with a block chain system by sending and reading transactions.
6. Design, build, and deploy a distributed application.
7. Evaluate security, privacy, and efficiency of a given block chain system.

Course Contents:

Total
Module Course Topics Credits
Hours

Basics: Distributed Database, Two General Problem,

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

Blockchain: Introduction, Advantage over conventional

distributed database, Blockchain Network, Mining
Mechanism, Distributed Consensus, Merkle Patricia Tree,
Gas Limit, Transactions and Fee, Anonymity, Reward, 1
II 30
Chain Policy, Life of Blockchain application, Soft & Hard
Fork, Private and Public blockchain.
 Distributed Consensus: Nakamoto consensus, Proof of
Work, Proof of Stake, Proof of Burn, Difficulty Level,
III Sybil Attack, Energy utilization and alternate. 30 1

Cryptocurrency: History, Distributed Ledger, Bitcoin

protocols - Mining strategy and rewards, Ethereum -
Construction, DAO, Smart Contract, GHOST,
Vulnerability, Attacks, Sidechain, Namecoin
IV
Cryptocurrency Regulation: Stakeholders, Roots of Bit 30
1
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.

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).

Reference Books

1. Andreas M. Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies, "O'Reilly

Media, Inc.", 03-Dec-2014 - Business & Economics.
2. Dr. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction Ledger,”Yellow
paper.2014.
3. Antony Lewis, The Basics of Bitcoins and Blockchains: An Introduction to Cryptocurrencies
and the Technology that Powers Them(Cryptography, Crypto Trading, Digital Assets, NFT)
Paperback – April 13,2021
4. Joseph J. Bambara, Paul R. Allen, Block Chain: A Practical Guide to Developing Business,
Law And Technology.
 GE33922 System Modeling and Simulation Course

Objective:

1. Introduce computer simulation technologies and techniques, provides the

foundations for the student to understand computer simulation needs, and to
implement and test a variety of simulation and data analysis libraries and programs.
2. This course focuses on what is needed to build simulation software
environments, and not just building simulations using pre-existing packages.
3. Learn Useful statistical models.

Learning Outcome:
On the successful completion of the course, student should be able to:

1. Understand the basic concepts of Simulation.

2. Understand the Useful statistical models .
3. Understand Input Modeling and Data Collection
4. Understand Model Building and Verification, Validation and
Optimization of simulation Models

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction and Overview of Simulation; Advantages

and Disadvantages of Simulation; Application areas;
Steps in a Simulation Study; What is System?; System 1
I 30
Components; System Environment;Model of a system;
Types of Models.
Concepts in Discrete-Event Simulation: The
EventScheduling / Time-Advance Algorithm, World
II 1
Views, Manual simulation Using Event Scheduling; List
30
processing. Simulation in Java; Simulation in GPSS;
Simulation in Spreadsheet.
Useful statistical models; discrete distributions;
Continuous distributions; Poisson process; Empirical
III distributions; Queuing Models: Characteristics of
30 1
queuing systems; Queuing notation; Long-run measures
of performance of queuing systems; Networks of
queues; Rough-cut modelling.
 Input Modelling: Data Collection; Identifying
the distribution with data, Parameter estimation,
IV
Goodness of Fit Tests, Fitting a non-stationary Poisson
process, Selecting input models without data,
Multivariate and Time-Series input models. 30 1
Measures of performance and their estimation,Output
analysis for terminating simulations; Output analysis for
steady-state simulations. Model building, verification
and validation; Verification of simulation models;
Calibration and validation of models, optimization via
Simulation

Text/Reference Books:

1. Zeigler B.P. Praehofer. H. and Kim I.G. "Theory of modeling and simulation", 2 nd Edition.
Academic press 2000
2. Shannon, R. E., “System Simulation: the Art and Science”, Prentice Hall Inc. 1990
GE33923 Embedded System Design Course

Objective:

1. To impart fundamental concepts in the area of Embedded Systems.

2. To impart the design of an embedded system.
3. To impart the partition of a system to hardware and software parts efficiently.
4. To impart the Hardware/software Co-design concepts.
Learning Outcomes:

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

1. Provide experience to integrate hardware and software for microcontroller applications

systems.
2. Understand the General System Theory (GST), how this applies to embedded system
engineers, and how this differs from the traditional mechanistic theory.
3. Understand the general process of embedded system development.
4. Comprehend important embedded system terminology.
5. Experience of embedded system product conceptualization methods.
6. Experience common aspects of embedded system development.

Course Contents:

Module Course Topics Total Credits

Hours
I Introduction to Embedded System: Embedded 30 Hours 1
systems, History, The Development
Environment, classifications,
applications and purpose of embedded
systems, processor embedded into a system, embedded
hardware units and devices in a system, embedded
software in a system, examples of embedded systems,
Characteristics and quality attributes of
embedded systems

II Embedded System Design Process and system 30 Hours 1

architecture:
Design Process- Requirements,
Specifications, Architecture Design, Designing of
Components, System Integration, Challenges in
Embedded System Design.
Embedded System Architecture -
Instruction Set Architecture i.e., CISC and RISC
instruction set architecture,Basic
EmbeddedProcessor/Microcontroller Architecture with
examples, Memory System Architecture (Caches,
Virtual Memory,
Memory Management Unit and Address
Translation), Processor Performance
 Enhancement (Pipelining, Superscalar
Execution)

III Programming Embedded Systems, 30 Hours 1

Embedded hardware and peripherals:
Programming Embedded Systems-
Structure of embedded program, infinite loop,
compiling, linking and locating, downloading and
debugging.
Embedded hardware-Memory map, i/o map, interrupt
map, processor family, external peripherals, memory -
RAM, ROM, types of RAM and ROM, memory
testing, CRC, Flash memory.
peripherals-Control and Status Registers,
Device Driver, Timer Driver-Watchdog Timers,
Embedded Operating System, Real-Time
Characteristics, Selection Process.
IV Concept of Real time Operating Systems: 30 Hours 1
Real-time Memory Management, Example Real-time
OS, Types of RTOS, Basic design using RTOS,
Micro/OS-II and Vx works, windows CE, OSEK, real-
time Linux functions, case study: digital camera
hardware and software architecture, embedded systems
in automobile, embedded system for a smart card,
mobile phone software for key inputs.
Embedded Control Applications- Open-
loop and Closed Loop Control Systems, PID
Controllers, Fuzzy Logic Controller

Text/Reference Books:

1. Embedded Systems Design by Steve Heath, II edition, Newnes publications, 2002.

2. Embedded Systems Architecture: A Comprehensive Guide for Engineers and Programmers
by Tammy Noergaard, Elsevier, 2005.
3. Embedded Systems Architecture Programming and Design by Raj Kamal, II edition, Tata
MC Graw-Hill, 2011.
4. Designing Embedded Systems with PIC Microcontrollers: principles and
applications by Tim Wilmshurst, Elsevier, 2009.
5. Embedded Systems, Rajkamal, TataMcGraw-Hill, 2003.
GE33924 Sentiment Analysis Course

Objective:

1. Discuss the various algorithms to perform opinion mining, subjectivity and emotion
2. Identify the sentiment of any document, web-page or social networking
site
3. Recognize aspect-based opinion summary and entity extraction
4. Underline the opinion summarization using various approaches
5. Use the apt tools to perform sentiment analysis for any given application

Learning Outcome:

After completing the course, the students should be able to:

1. Understand key issues involved in the study of semantic fields;

2. Explore the meanings of an expression in a systematic manner;
3. Solve simple problems in semantic analysis;
4. Explainthebasicgoalsofseveral different approachestosemantics; and
5. Undertake guided research in topics in semantics.
6. The relationship between syntax and semantics
7. The distinction between semantics and pragmatics
8. Therelationship betweenwords, concepts,and things/facts (sense, reference,
extension/intension)

Course Contents:

Module Course Topics Total Credits

Hours

Introduction

Need for Sentiment Analysis, Problem of Sentiment Analysis,

Subjectivity, Stance, Words to Discourse , Pragmatics, Natural 30 1
I Language Processing Issues, Opinion Definition, Sentiment
Analysis Tasks, Opinion Summarization, Types of Opinion,
Subjectivity and Emotion

Document Sentiment Classification

II
Sentiment Classification Using Supervised Learning
Unsupervised Learning Rating Prediction, Cross-Domain 30 1
Sentiment Classification, Cross Language Sentiment
Classification, Sentence Subjectivity And Classification
Subjectivity Classification, Sentence Sentiment
Classification, Conditional Sentences, Sarcastic Sentences
 Cross, Language Subjectivity and Sentiment Classification –
Discourse Information for Sentiment Classification

Aspect Based Sentiment Analysis

Aspect sentiment classification, Basic rules of opinions and

Compositional Semantics, Aspect Extraction, Identifying
Resource usage aspect, Simultaneous Opinion Lexicon 30 1
Expansion and Aspect Extraction, Grouping aspects into
III
categories, Entity, Opinion Hold and Timing Extraction,
CoreferenceResolutionandWordSenseDisambiguation Aspect
and Entity Extraction, Sentiment Lexicon
Generation, Corpus Based Approach, Dictionary Based
Approach, Desirable and Undesirable Facts

Opinion Summarization &Tools for Sentiment Analysis

Aspect Based Opinion Summarization, Improvements to Aspect-

Based Opinion Summarization, Contrastive view Summarization,
Traditional Summarization, Analysis of Comparative Opinions,
Identifying Comparative Sentences, Identifying Preferred
Entities, Opinion Search and Retrieval, Opinion Spam Detection, 30 1
Types of Spam Detection, Supervised and Unsupervised
Approach, Group Spam Detection. Detecting Fake or Deceptive
Opinions , Quality of Review, Quality as Regression Model,
IV
Other Methods, Case Study, Sentiment Analysis Applications
Tools for Sentiment Analysis, Semantria, Meltwater, Google
Analytics, FaceBook Insights, Tweetstats

Text books:

1. Bing Liu, Sentiment Analysis and Opinion Mining: Morgan and Claypool publishers,
2012.

Reference books

1. Bo Pang and Lillian Lee, Opinion Mining and Sentiment Analysis: Now Publishers
Inc,2008.
2. Roy De Groot, Data mining for Tweet sentiment classification – Twitter sentiment,
2009
GE33931 - Evolutionary Multi-objective Optimization Course

Objective:

1. To generate knowledge base about Multi-Objective Optimization Algorithms

2. To equip with concepts of Evolutionary and Genetics Algorithms
3. To expose with the application in Multi-Objective Optimization.

Learning Outcome:
After completing the course, the students should be able to:
1. Explain the difference between Single and Multi-Objective Optimization.
2. Discuss Classical Methods.
3. Explain the Evolutionary and Genetic Algorithms.
4. Differentiate between Elitist and Non Elitist Multi-Objective Evolutionary
Algorithms.
5. Explain the Constrained Multi-Objective Evolutionary Algo
6. Elaborate Salient Issues of Multi-Objective Evolutionary Algorithms:
7. Implement Applications of Multi-Objective Evolutionary Algorithms

Course Contents :
Total
Module Course Topics Credits
Hours

Introduction: Single and Multi- Objective(MO)

Optimization, Two Approaches, Rise of MO Evolutionary
Algorithms.
MO Optimization: Linear, Non Linear, Convex, and
I Nonconvex MO Optimization (MOO) Problems,
Principle of MOO, Difference with Single Objective, 30 1
Dominance and Pareto- Optimality, Optimality
Conditions.

Classical Methods: Weighted Sum Method, e-

Constraint Method, Weighted Metric Method, Benson’s
Method, Value Function Method, Goal Programming
Methods, Interactive Methods, Review of classical
Methods.
II Evolutionary Algorithms: Difficulties with 30 1
Classical Optimisation Algorithms, Genetic
Algorithms(GA), Evolution Strategies, Evolutionary
Programming, Genetic Programming, Multi-Model
Function Optimization.
 Non-Elitist Multi-Objective Evolutionary
Algorithm: Motivation for inding MPO Solutions,
Example roblems,Vector Evaluated GA, Vector
ptimised Evolution Strategy, Weight-Based A,
Random Weighted GA, MO GA, Non ominated
Sorting GA, Niched-Pareto GA, redator-Prey
Evolution Strategy, Other ethods
Elitist Multi-Objective Evolutionary Algorithms:
Rudolph’s Elitist MOE Algorithm, Elitist Non
Dominated Sorting GA, Distance Based Pareto GA,
Strength Pareto Evolutionary Algorithm,
Thermodynamical GA, Pareto Archived Evolution
III Strategy, MO Messy GA, Other Elitist MOEA. 30 1
Constrained Multi-Objective Evolutionary Algo: An
Example Problem, Ignoring Infeasible Solution, Penalty
Function Approach, JVGS Method, Constrained
Tournament Method, RTS Method.

Salient Issues of Multi-Objective Evolutionary

Algorithms: Illustrative Representation of Non-
IV Dominated Solutions,Performance Metrics, Test
Problem Design, Comparison of MO Evolutionary
Algorithms, Objective Versus Decision Space 30 1
Niching, Searching for Preferred Solution, Exploiting
MO Evolutionary Optimization, Scaling and
Convergence Issues, Controlling Elitism, MO
Scheduling Algorithms.
Applications of Multi-Objective
Evolutionary Algorithms

Text/Reference Books:

1. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, Wiley and

Sons, 2009.
2. M. Mitchell, An introduction to genetic algorithms, MIT Press, 1996.
3. L. D. Davis, Evolutionary algorithms, Springer-Verlag, 1999.
GE33932 Bioinformatics

Course Objective:

1. To develop methods and software tools for understanding biological data.

2. To introduce students to the fundamentals of evolution, molecular biology, and
molecular evolution.
3. To study DNA, RNA important molecules, protein data, etc. their structure,
replication and transcription.
4. To on biological databases which help in analyzing biological data and their
interpretation
5. To provide knowledge about the development and application of computer
methods for management, analysis, interpretation, and prediction, as well as
for the design of experiments.
Learning Outcome:
After completing the course, the students should be able to:

1. Have a good working knowledge of basic bioinformatics tools and databases such as
GenBank, BLAST, multiple alignment, and phylogenetic tree construction.
2. Describe the contents and properties of the most important bioinformatic databases,
perform text- and sequence-based searches, and analyse and discuss the results in light
of molecular biological knowledge.
3. Explain the major steps in pairwise and multiple sequence alignment, explains the principle
for, and executes pairwise sequence alignment by dynamic programming.
4. Give examples of methods for describing and analysing genes, genomes and gene
expression

Course Contents:

Module Course Topics Total Credits

Hours

Introduction

Bioinformatics and Computational Biology, Nature & Scope of

I Bioinformatics. Data integration, Data analysis, Major 30
Bioinformatics databases and tools. Metadata: Summary &
reference systems, finding new type of data online. Molecular Hours 1
Biology and Bioinformatics: Systems approach in biology,
Central dogma of molecular RNA classification –coding and
non-coding RNA- mRNA, tRNA, miRNA and sRNA, RNAi.
DNA and RNA structure – Nucleic Acid structure and function,
Genetic Code, Genes and Evolution
 SEQUENCE ANALYSIS

A The Information Molecules and Information Flow Basic

chemistry of nucleic acids, Structure of DNA, Structure of RNA,
DNA Replication, -Transcription, - Translation, Genes- the
functional elements in DNA, Analyzing DNA,DNA sequencing.
II Proteins: Amino acids, Protein structure, Secondary, Tertiary 30
and Quaternary structure, Protein folding and function, Nucleic
acid-Protein interaction; Perl: Perl Basics, Per applications for Hours 1
bioinformatics- Bioperl, Linux Operating System,
Understanding and Using Biological Databases, Java clients,
CORBA, Introduction to biostatistics
Introduction, Advantages of Phylogenetic Trees, Tree
topologies, Methods for phylogenetic analysis- Distance Matrix
30
methods, Character based methods.
III 1
Hours
HMM (Hidden Markov Model): Introduction to HMM, Forward
algorithm, Viterbi algorithm, applications in Bioinformatics
General Introduction to Gene expression in
prokaryotes and eukaryotes

Prokaryotic Genomes – Gene structure, GC content, Gene

Density

Eukaryotic Genomes- Gene structure, GC content, Gene

IV Density,

Gene Expression, Transposition, Gene prediction 30

approaches.
1
Hours
Protein and RNA structure Prediction:

Predicting RNA secondary structure - Nussinov Algorithm,

Energy minimization methods - Zuker Algorithm. Amino Acids,
Polypeptide Composition, Protein Structures, Algorithm for
protein folding, Structure prediction

Text/Reference Books:

1. Lesk.A.M,“IntroductiontoBioinformatics”,1stEdition,Oxford University Press,2002.

2. Gautham.N, “Bioinformatics”, Narosa Publishing Company,2006.
3. Westhead.D.R, Parish.J.H and Twyman.R.M, “Instant Notes Series
Bioinformatics”1stEdition,VivaBooksPrivateLimited,2003.
4. Steffen Schulze-Kremer, “Molecular Bioinformatics: Algorithms and
Applications”, Walter de Gruyter,1996.
5. Yi-PingPhoebe.Chen,“BioinformaticsTechnologies”,Springer,2005.
6. Zheng Rong Yang, “Machine Learning Approaches to Bioinformatics” (Science,
Engineering, and Biology Informatics), World Scientific Publishing Company; 1 edition
GE33933 Internet of Things

Course Objective:

1. Describe the IoT and Cloud architectures

2. Determine the right sensors and communication protocols to use in a particular IoT
system.
3. Deploy Cloud Services using different cloud technologies.
4. Implement cloud computing elements such virtual machines, web apps, mobile
services, etc
5. Establish data migration techniques from IoT devices to the cloud.
Learning Outcome:
After completing the course, the students should be able to:
1. Understand general concepts of Internet of Things (IoT) (Understand)
2. Recognize various devices, sensors and applications (Knowledge)
3. Apply design concept to IoT solutions (Apply)
4. Analyze various M2M and IoT architectures (Analyze)
5. Evaluate design issues in IoT applications (Evaluate)
6. Create IoT solutions using sensors, actuators and Devices (Create)
Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to IoT: Sensing, Actuation,

Networking basics, Communication Protocols,
I Sensor Networks, Machine-to-Machine 30 Hours 1
Communications, IoT Definition,
Characteristics. IoT Functional Blocks, Physical
design of IoT, Logical design of IoT,
Communication models & APIs.

M2M to IoT-The Vision-Introduction, From M2M

II to IoT, M2M towards IoT-the global context, A 30 Hours 1
use case example, Differing
Characteristics. Definitions, M2M Value Chains,
IoT Value Chains, An emerging industrial structure
for IoT.

M2M vs IoT An Architectural Overview–

III Building architecture, Main design principles and 30 Hours 1
needed capabilities, An IoT architecture outline,
standards considerations. Reference Architecture
and Reference Model of IoT.

IoT Reference Architecture- Getting Familiar with

IV IoT Architecture, Various architectural views of IoT
such as Functional, Information, Operational and 30 Hours 1
Deployment. Constraints affecting design in the IoT
world- Introduction, Technical design Constraints.
 Domain specific applications of IoT: Home
automation, Industry applications, Surveillance
applications, Other IoT applications, developing IoT
solutions.

Text/Reference Books:

1. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-

onApproach)”, 1st Edition, VPT, 2014
2. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to
Connecting Everything”, 1st Edition, Apress Publications, 2013
3. Cuno Pfister, Getting Started with the Internet of Things, O‟Reilly Media, 2011, ISBN:
978-1-4493- 9357-1
GE33934 Cloud Computing

Course Objective:

1. To understand the concepts of Cloud Computing.

2. To learn Cloud Computing Architecture.
3. To learn Taxonomy of Virtualization Techniques.
4. To acquire knowledge on Cloud Deployment models.
5. To learn Industry Cloud Platforms.

Learning Outcome:
After completing the course, the students should be able to:
1. Understand the concept of virtualization and how this has enabled
the development of Cloud Computing
2. Know the fundamentals of cloud, cloud Architectures and types of
services in cloud
3. Understand scaling, cloud security and disaster management
4. Design different Applications in cloud
5. Explore some important cloud computing driven commercial systems

Course Contents:

Total
Module Course Topics Credits
Hours

Origins of Cloud computing, Cloud components,

Evolution of Cloud Computing, Characteristics of
Cloud Computing, Underlying Principles of Parallel and
I 1
Distributed Computing, driving factors towards cloud, 30
Architecture, How Cloud Computing Works, Role of
Networks in Cloud computing, protocols used, Role of
Web services, Service Models: IaaS, PaaS, SaaS, NaaS,
Cloud Clients, Comparing cloud providers with
traditional IT service providers.
Introduction, Cloud Reference Model, Architecture,
Infrastructure / Hardware as a Service, Platform as a
Service, Software as a Service, Types of Clouds, Public
II 30 1
Clouds, Private Clouds, Hybrid Clouds, Community
Clouds, Economics of the Cloud, Open Challenges,
Cloud Interoperability and Standards, Scalability and
Fault Tolerance. Cloud deployment model: Public
clouds,
 Private clouds, Community clouds, Hybrid
clouds, Advantages of Cloud computing.
Inter Cloud Resource Management, Resource
Provisioning and Resource Provisioning Methods
III Global Exchange of Cloud Resources, Security 30 1
Overview, Cloud Security Challenges, Software-as-a-
Service Security, Security Governance, Virtual Machine
Security, IAM, Security Standards.

Hadoop, MapReduce, Virtual Box, Google App

Engine, Programming Environment for Google App
Engine, Open Stack, Federation in the Cloud, Four 30 1
IV Levels of Federation, Federated Services and
Applications, Future of Federation.Scientific
Applications: Health care, Geoscience and
Biology.Business and Consumer Applications- CRM
and ERP,
Social Networking, Media Applications and
Multiplayer Online Gaming.

Text/Reference Books:

1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, “Distributed and Cloud

Computing, From Parallel Processing to the Internet of Things”, Morgan Kaufmann
Publishers, 2012.
2. Rittinghouse, John W., and James F. Ransome, ―CloudComputing:
Implementation, Management and Security, CRC Press, 2017
3. George Reese Cloud Application Architectures, First Edition, O‟Reilly Media
2009.
4. Cloud Computing 2nd Edition by Dr. Kumar Saurabh from Wiley India 2012.
5. Cloud Computing (Principles and Paradigms), Edited by Rajkumar Buyya,
James Broberg, Andrzej Goscinski, John Wiley & Sons, Inc. 2011
6. Cloud computing for dummies- Judith Hurwitz, Robin Bloor, Marcia Kaufman,
Fern Halper, Wiley Publishing, Inc, 2010
GE33941 Data Mining and Ware housing Course
Objective:

1. To introduce the concept of data mining with in detail coverage of basic tasks, metrics,
issues, and implication.
2. Understand and implement classical models and algorithms in data warehouses
and data mining
3. To introduce the concept of data warehousing with special emphasis on architecture
and design.
4. Characterize the kinds of patterns that can be discovered by association rule mining,
classification and clustering.

Learning Outcome:
After completing the course, the students should be able to:

1. Understand the functionality of the various data mining and data warehousing
components.
2. Appreciate the strengths and limitations of various data mining and data warehousing
models.
3. Explain the analyzing techniques of various data.
4. Describe different methodologies used in data mining and data
warehousing.
5. Compare different approaches of data warehousing and data mining with various
technologies.

Course Contents:

Total
Module Course Topics Credits
Hours

Introduction to Data Mining

Introduction, What is Data Mining, Definition, KDD,
Challenges, Data Mining Tasks, Data Preprocessing-
I Data Cleaning, Missing Data, Dimensionality 1
30
Reduction, Feature Subset Selection, Discretization
and
Binarization , Data Transformation; Measures of
similarity and dissimilarity-Basics.

Data warehouse and OLAP technology:Introduction

II to Data WareHouse, Differences between operational
database systems and data WareHouse, Data
WareHouse characteristics, Data WareHouse
Architecture and its components,
 Extraction-Transformation-Loading, Logica (Multi-
Dimensional), Data Modelling, Schema Design, star 30 1
and snow-Flake Schema, Fact Constellation, Fact
Table, Fully Addictive, Semi-Addictive, Non-Additive
Measures; Factless-Facts, Dimension Table
characteristics; Factless-Facts, Dimension Table
characteristics; OLAP cube, OLAP
Operations, OLAP Server Architecture- ROLAP,
MOLAP and HOLAP.

Association Rules:Problem Definition, Frequent Item

Set Generation, The APRIORI Principle, Support and
III Confidence Measures, Association Rule Generation,
APRIORI Algorithm, The Partition Algorithms, FP- 30 1
Growth Algorithms, Compact Representation
of Frequent Item Set-Maximal Frequent Item Set,
Closed Frequent Item Set.
Classification and prediction:What is Classification
& Prediction , Issues regarding Classification and
IV prediction, Decision tree, Bayesian Classification
,Classification by Back propagation, Multilayer feed-
forward Neura Network, Back propagation Algorithm,
Classification methods ,K nearest neighbor classifiers, 30 1
Genetic Algorithm, Cluster Analysis ,Data types in
cluster analysis, Categories of clustering methods,
Partitioning methods, Hierarchical Clustering-
,CURE and Chameleon, Density Based Methods-
DBSCAN, OPTICS, Grid Based Methods-
STING,CLIQUE.

Text/ReferenceBooks:

1. Data Mining-Concepts and Techniques- Jiawei Han, Micheline Kamber, Morgan Kaufmann
Publishers, Elsevier, 2 Edition, 2006.
2. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch, Pearson
Education, 2016
3. Data Mining Techniques, Arun K Pujari, 3rd Edition, Universities Press, 2013
4. Data Ware Housing Fundamentals, Pualraj Ponnaiah, Wiley StudentEdition,2010
5. The Data Ware House Life Cycle Toolkit- Ralph Kimball, Wiley StudentEdition,2008
GE33942 Introduction to Drones Course

Objective:

1. To develop an overall understanding of UAS history, UAS types, and civilian small UAS
applications
2. To develop a firm understanding of UAS operational safety and rule-compliance
requirements
3. To understand basic UAS elements
4. To obtain basic knowledge of UAS aerodynamics and flight dynamics
5. To obtain basic knowledge of UAS guidance, navigation and control
6. To obtain basic knowledge of UAS payloads and the enabled ConOps (concept of
operations)

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

1. To be able to understand typical civilian low cost UAS systems

2. To be able to operate typical civilian low cost UAS systems
3. To be able to understand and comply FAA regulations on small UAS operations
4. To be able to integrate typical mission sensors in typical civilian low cost UAS
systems
5. To be able to get ready for applying for an FAA’s Remote Pilot Certificate with a Small
UAS rating
6. To be able to get ready to create UAS related engineering practice/service or to join
UAS work force

Course Contents:

Module Course Topics Total Hours Credits

1 Basics of Flights:-
Introductions , Understanding geospatial technology ,
UAS platform overview, UAS flight demo,
FAA regulations , UAS safety , Flight checklists,
Roles and responsibilities of personnel involved in flight
30Hours 1
operations ,Different types of flight vehicles, Components
and functions of an airplane , Forces acting on Airplane,
Physical properties and structure of the atmosphere,
Aerodynamics ,Airfoil nomenclature, aerofoil
characteristics, Angle of attack, Mach number, Lift and Drag
- Propulsion and airplane structures.
2 Unmanned Aerial Vehicle:- Difference between aircraft and
UAV, Parts and functions of Fixed, Rotorcraft and flapping
30Hours 1
wing UAV-various History of UAV’s, Types of
Drones, Applications and Uses. Characteristics of Multi
 rotor vehicle, Fixed Wing vehicle, Flapping wing Vehicles
and their applications, Defense, Civil, Environmental
monitoring (physical, chemical and biological).

3 Payloads For UAV:- Payloads, Classification of Payloads,

camera, sensors, radars, various measuring devices ,
30Hours 1
classification of payload based on applications , Hyper
spectral sensors ,laser detection and range , synthetic aperture
radar, thermal cameras ,ultra sonic detectors ,case study on
payloads.

4 Launch and Recovery:- Launching systems, UAV Launch

Methods for Fixed, Wing Vehicles ,Vertical Takeoff and
Landing UAV Launch ,Recovery systems.
UAV Navigation And Guidance Systems:- 30Hours 1
Navigation, Dead Reckoning, Inertial, Radio Navigation,
Satellite, Way point Navigation. Dijkstra’s Algorithm, A- star
Algorithm, UAV Guidance, Types of guidance, UAV
communication systems, and Ground control station,
Telemetry, UAS future.

Reference Books:-
1. Andey Lennon “ Basics of R/C model Aircraft design” Model airplane news
publication, 2016
2. Theory, Design, and Applications of Unmanned Aerial Vehicles- by A. R. Jha Ph.D.
(Author), 2016.
3. Unmanned Aerial Vehicles- Editors: Valavanis, K., Vachtsevanos, George J. (Eds.), 2014.
4. Jane's Unmanned Aerial Vehicles and Targets -by Kenneth Munson (Editor), 2010
GE33943 Computer Forensics Course
Objective:
1. To know computer forensics and its issues, resources to forensics the data.
2. To understand the file logs, event file logs, working of the file system.
3. To understand the importance of identification of evidence with their impact, file
recovery process.
4. To understand the application of various computer forensics techniques in different
areas.
5. To know about the information hiding and steganography system.
Learning Outcome:
After completing the course, the students should be able to:
1. To create proper documentation over the forensics analysis process.
2. To describe the representation and organization of data and metadata in modern
computers.
3. To gain knowledge about the working process of Windows and Linux file systems and
its application.
4. To recover deleted files, extract hidden data, and also create disk images.
5. To develop effective solutions using various forensics techniques.
Course Contents:
Total
Module Course Topics Credits
Hours

Introduction to Computer Forensics:

Computer Forensics, history of computer 30 1
forensics, Types of Computer Forensics
I Technology, resources required to develop computer
forensics, Computer Investigation, Law enforcement
agency investigation, Corporate investigation, Company
policies.
Computer Forensics System: Window and artefact
II Window File system system-File allocation, File 30 1
allocation table, Registry, Event logs, Executable
Window, prefetch file. Linux Systems and artefacts
Linux Systems: Linux File Systems, File System Layer,
Metadata Layer, Data Unit Layer, Journal Tools,
Deleted Data, Linux Logical Volume Manager, Linux
Boot Process and Services, Linux System Organization
and Artefacts, Partitioning, File system Hierarchy,
Ownership and
Permissions, File Attributes, Hidden Files, User
Accounts.
 Computer Forensics Analysis:Evidence
Identification, Data Seizure, Replication and avoiding 30 1
III of evidence, Digital image verification and
authentication, Reconstruction of Past Evidence-
fighting against macro threats,
Information safety, Network Forensics and investigating
logs, network Intrusion and
crime, Network Traffic investigation, Tactics of
military-terrorist and private company; Forensics
Identification and Analysis of
surveillance Devices.

Computer Forensics Technology: Need of evaluation

Tools, Operation performed by 30 1
IV Techniques, Types of Computer Forensics
Techniques- Software techniques, Command Line
techniques, Unix/Linux Techniques, GUI based
techniques, Hardware based
Techniques- Forensics Workstation, Write
Blocker, Comparison of Techniques; Cyber Forensics
techniques and Case study.

Text/Reference Books:
1. Cory Altheide, Harlan Carvey, Digital Forensics with Open Source Tools, Syngress
imprint of Elsevier.
2. Bill Nelson, Amelia Phillips, Christopher Steuart, “Guide to Computer Forensics
and Investigations”, Fourth Edition, Course Technology.
3. MariE-Helen Maras, “Computer Forensics: Cybercriminals, Laws, and
Evidence”, Jones & Bartlett Learning; 2nd Edition, 2014.
GE33944 Augmented & Virtual Reality Course
Objective:
1. Introducing importance and applications of Augmented and Virtual Reality
Systems
2. To learn 3D User Interfaces and Hardware Technologies For 3d User
Interfaces.
3. To learn the difference between AR and VR.
Learning Outcome:
After completing the course, the students should be able to:
1. Understand Historical Overview, Current Trends and Future
applications of Immersive Technologies
2. Understand Overview of human physiology, psychology and
usability factors
3. Understand 3D interactive and procedural graphics
Course Contents:

Total
Module Course Topics Credits
Hours

Introduction: A Brief History of Virtual Reality, The

five Classic Components of a VR System, Basic
I features of VR systems, Architecture of VR systems, 1
Early Commercial VR Technology 30
Hardware Technologies For 3d User
Interfaces: Visual Displays Auditory
Displays, Haptic Displays, Choosing Output Devices
for 3D User Interfaces.

II 3D User Interfaces: Why 3D user interfaces, Major user

tasks in VE, Interaction techniques for selection, 1
manipulation and navigation, 3D UI evaluation. 30

Virtual Reality Applications: Engineering, Architecture,

Education, Medicine, Entertainment, Science, Training.

Software Technologies: Database - World Space,

III World Coordinate, World Environment, Objects -
Geometry, Position / Orientation, Hierarchy, Bounding 30 1
Volume, Scripts and
 other attributes, VR Environment - VR Database,
Tessellated Data, LODs, Cullers and Occluders, Lights
and Cameras, Scripts, Interaction - Simple, Feedback,
Graphical User Interface, Control Panel, 2D Controls,
Hardware Controls, Room / Stage / Area
Descriptions, World Authoring and Playback, VR
toolkits, Available software in the market

Augmented and Mixed Reality, Taxonomy, technology

IV and features of augmented reality, difference between
AR and VR, Challenges with AR, AR systems and
functionality, Augmented reality methods, visualization 30 1
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.

Text/ReferenceBooks:
1. Alan B Craig, William R Sherman and Jeffrey D Will, “Developing Virtual Reality
Applications: Foundations of Effective Design”, Morgan Kaufmann, 2009.
2. Doug A Bowman, Ernest Kuijff, Joseph J LaViola, Jr and Ivan Poupyrev,
“3D User Interfaces, Theory and Practice”,
3. Burdea, Grigore C and Philippe Coiffet, “Virtual Reality Technology”, Wiley
Interscience, India, 2003.
GE33951: Wireless Sensor Networks

Course Objective:
1. Explain the fundamental concepts of WSN and its applications.
2. Explain basic technologies and systems.
3. Choose suitable MAC and routing algorithm and for wireless sensor actuator network.
4. Implement the elements of distributed computing and network protocol foran
application.
5. Suggest suitable hardware and software platforms for a application to setup
sensor networks.

Learning Outcome:

After completing course, he students should be able to

1. Explain the sensor network technology for various application setups.
2. Analyze the design and conduct trade-off analysis between performance and resources.
3. Illustrate suitable medium access protocols and radio hardware.
4. Describe the different transport control mechanisms and middle wares in WSN
5. Explain the localization and topology control.

Course Contents:

Total
Module Course Topics Credits
Hours
Overview Of Wireless Sensor Networks: The vision of
Ambient Intelligence, Application examples, Types of
applications, Challenges for WSNs, Why are sensor
networks different?, Enabling technologies for wireless
sensor networks Challenges for Wireless Sensor Networks,
Enabling Technologies for Wireless Sensor Networks.
I Architectures: Single- Node Architecture - Hardware 30 Hours 1
Components, Energy Consumption of Sensor Nodes,
Operating Systems and Execution Environments, Some
examples of sensor nodes.
.
Network Architecture: Sensor Network Scenarios,
II optimization Goals and Figures of Merit, Design principles 30 Hours 1
for WSNs, Service interfaces of WSNs, Gateway Concepts.
Physical Layer - Wireless channel and communication
fundamentals, Physical layer and transceiver design
considerations in WSNs
 MAC protocols - Fundamentals of (wireless) MAC
protocols, Low duty cycle protocols and wakeup concepts,
Contention-based protocols, Schedule-based protocols, The
IEEE 802.15.4 MAC protocol, How about IEEE 802.11
and Bluetooth. Link-layer protocols - tasks and
requirements, Error control, Framing, Link management
III 30 Hours 1

Routing protocols: The many faces of forwarding and

routing, Gossiping and agent-based unicast forwarding,
Energy-efficient unicast, Broadcast and multicast,
Geographic routing, Mobile nodes, Data aggregation
ocalization and positioning: Properties of localization and
positioning procedures, Possible approaches: Proximity, 30 Hours 1
IV Trilateration and triangulation, Scene analysis, Single-hop
localization Overlapping connectivity, Approximate point
in triangle, Positioning in multi- hop environments,
Impact of anchor placement.

Text/ Reference Books:

1. Holger Karl & Andreas Willig, " Protocols And Architectures for
WirelessSensor Networks", John Wiley, 2011
Reference Books:
1. Ian F. Akyildiz, Mehmet Can Vuran "Wireless Sensor Networks", Wiley 2010
2. Feng Zhao & Leonidas J. Guibas, “Wireless Sensor Networks- An
Information Processing Approach", Elsevier, 2007.
3. Kazem sohraby, Daniel minoli, Taieb znati, “Wireless Sensor Networks:
Technology, Protocols and Applications:, WILEY , Second Edition (Indian) , 2014
GE33952 Distributed Systems

Course Objective:

1. To learn issues related to clock synchronization and the need for global state in distributed
systems.
2. Have knowledge and understanding of the main principles, techniquesand methods
involved when dealing with distributed systems.
3. To get the knowledge of how distributed objects communicate by means of remote
invocation.
4. To provide an in-depth overview of research topics in distributed systems.
5. To learn distributed mutual exclusion and Deadlock detection algorithms.

Learning Outcome:
After completing the course, the students should be able to:
1. Understand the foundations and issues of distributed systems.
2. Understand in detail how distributed applications work and what
requirements they aim to satisfy.
3. Understand the various synchronization issues and global state for distributed
systems.
4. Understand in detail how distributed applications work and what
architecture they exhibit.
5. Understand in detail how distributed applications work and what
techniques and infrastructures they are built upon.
Course Contents:

Module Course Topics Total Credits

Hours

Introduction to distributed systems: Definitions and

Examples of Distributed systems; System Models:
I Architectural models and Fundamental models;
limitations of distributed systems. 30 1
Logical Clocks: Lamport’s clocks, Vector logical
clock, NTP; Message Passing System: Causal
ordering of messages, Sates of a Distributed system,
Local and Global State, Consistent and inconsistent
states; Termination detection.
 Mutual Exclusion: Requirements of Mutual
Exclusion, Classification of distributed mutual
exclusion: Non-token based Quorum Based and
II Token Based mutual exclusion with examples; 30 1
Performance metric for distributed mutual exclusion
algorithms.
Deadlock Detection: System models,
Preliminaries, Deadlock prevention, Deadlock
avoidance, Deadlock detection & resolution.

Agreement Protocols: Classification of Agreement

Problem: Byzantine agreement problem, Consensus
III problem, Interactive consistency Problem; Solution 1
to Byzantine Agreement problem; Application of 30
Agreement problem.

Resource Management: Distributed File Systems,

Issues in distributed File System.

Failure Recovery: Backward and Forward recovery,

Recovery in Concurrent systems: Checkpoints;
Recovery in Distributed Database Systems; Fault
Tolerance: Issues in Fault Tolerance, Voting
IV Protocols. 30 1
Transaction Control: Nested Transactions, Locks;
Concurrency Control: Methods and their comparison,
Concurrency control in Distributed Transactions,
Replication: Fault tolerant services, Transactions
with replicated data.

Text/Reference Books:
1. Singhal & Shivaratri, “Advanced Concept in Operating Systems”, McGraw Hill, 2001
2. Ramakrishna, Gehrke, “Database Management Systems”, McGrawhill, 2014
3. Coulouris, Dollimore, Kindberg, “Distributed System: Concepts and Design”,
Pearson Education. 2005
4. Tenanuanbaum, Steen, “Distributed Systems”, Prentice Hall of India, 2017
5. Gerald Tel, “Distributed Algorithms”, Cambridge University Press, 2010
GE33953 Gaming in Artificial Intelligence Course
Objective:
1. To understand the concepts of Artificial Intelligence.
2. To understand the issues and role of AI in the design of games.
3. To learn the designing and using path planning.
4. To develop the Capability for designing and implementing decision making and
coordinating action based on finite states, fuzzy sets, Markov sets, or rules.
5. To understand the concept of tactical and strategic AI.
Learning Outcome:
After completing the course, the students should be able to:

1. Students will gain a breadth of understanding of current techniques and

disciplines used in academic and industry in Game AI.
2. Students will get hands-on experience developing AI programs in existing game
engines and game projects.
3. Students will be capable of developing some of the most common Game AI
techniques used in the industry.
4. Students will get a better understanding of the relationship between Game AI
and the game development process.
5. Students will gain an understanding between developing artificial intelligence in
the computer game industry versus other areas of research doing AI.
Course Contents:

Total
Module Course Topics Credits
Hours

Meaning and definition of artificial intelligence, Physical

Symbol System Hypothesis, production systems,
Characteristics of production systems; Breadth first search
I and depth first search techniques. Nature of Game AI, 1
Game AI Design, Simple State Machines, Computationa 30
Geometry, Kinetic and Dynamic Movement, Steering and
combining steering, Interaction with Physics engine,
Jumping, coordinated movement, Motor Control, Path
finding methods, Divide and Conquer, Greedy, Branch
and Bound, Gradient Descent.
 Knowledge Representation, Problems in representing
II knowledge, knowledge representation using propositional
and predicate logic, logical consequences, syntax and
semantics of an expression, semantic Tableau. 30 1
Forward and backward reasoning. Proof methods,
substitution and unification, conversion to clausal form,
normal forms, resolution, refutation, deduction, theorem
proving, inferencing, monotonic and non- monotonic
reasoning. Introduction to prolog.

Adversarial search and Game theory, classification of

games, game playing strategies, prisoner's Dilemma.
III Game playing techniques, minimax procedure, alpha-beta
cut- offs. Complexity of alpha-beta search.
Automated planning, classical planning problem, forward 30 1
planning, partial order planning, planning with
proposal logic, hierarchical task planning, multi
agent planning.

Decision Making: Decision trees, State

Machines, Fuzzy Logic, Decision Making,
IV Markov Systems, Goal-oriented behavior, Rule- based 30 1
systems, blackboard architectures, Decision
Making, Tactics, Learning, Execution Management.

Text/Reference Books:
1. Artificial Intelligence for Games, Second Edition by Ian Millington and John Funge,
Morgan-Kaufman, 2009
2. Artificial Intelligence by Luger (Pearson Education), 2002
3. Russel Norvig, Artificial Intelligence: A Modern Approach, Pearson
Education, 2010
4. Introduction to AI & Expert System: Dan W.Patterson, PHI, 1990
5. Artificial Intelligence: Elaine Rich, Kevin Knight, Mc-GrawHill, 2008
GE33954 Pattern Recognition Course
Objective:
1. Explain classification, structural pattern recognition, and pattern classifier
combination techniques.
2. Analyze, and relate research in the pattern recognition area verbally and in writing.

3. Apply performance evaluation methods for pattern recognition, and decision

making technique.

4. Explain pattern recognition techniques to real-world problems such as document

analysis and recognition.

5. Implement simple pattern classifiers, classifier combinations, and structural pattern

recognizers.
Learning Outcome:
At the end of the course, the students should be able to:

1. Have a complete knowledge on various pattern Recognition available in literature.

2. Explain and define concepts of pattern recognition.
3. Explain and distinguish procedures, methods and algorithms related to pattern recognition.
4. Apply methods from the pattern recognition for new complex applications
5. Analyze and breakdown problems related to the complex pattern recognition system.

Course Contents:

Module Course Topics Total Credits

Hours

1 Introduction: application of pattern recognition, 30 Hours 1

statistical decision theory, image processing and analysis.
Probability: introduction, probability of events, random
variables, joint distribution and densities, moments of
random variables, estimation of parameters from
samples, minimum risk estimations.
 2 Statistical decision making: introduction, baye’s 30 Hours 1
theorem, multiple features, conditionally independent
features, decision boundaries, estimation of error rates,
characteristic centers, estimating the composition of
populations.

3 Non parametric decision making: introduction, 30 Hours 1

histograms, kernel and windows estimators, nearest
neighbor classification techniques, adaptive decision
boundaries, and adaptive discriminant functions,
minimum squared.

4 Clustering: introduction, hierarchical clustering, 30 Hours 1

partitioned clustering.
Artificial neural networks: introduction, nets without
hidden layers, And nets with hidden layers, the back
propagation algorithm, Hopfield nets an application:
classifying gender from facial images.

Text/Reference Books
1. Earl Gose, Richard Johnson baugh And Steve Jost, Pattern Recognition And Image
Analysis, Phi, 1996
2. Duda R.O. And Hart P.E., Pattern Classification And Scene Analysis, John Wiley, 2015
3. Fu. K. S., Syntactic Methods In Pattern Recognition, Academic Press, 1976