Sri Sri University

FACULTY OF SCIENCE
DOCS-Department of Computer Science

M.Sc. in Computer Science with Specialization in Artificial

Intelligence and Machine Learning (2020-22) LOCF Based

MASTER OF SCIENCE DEGREE

COURSE M.Sc. COMPUTER SCIENCE
WITH SPECIALIZATION IN
ARTIFICIAL INTELLIGENCE AND
MACHINE LEARNING

UNDER SRI SRI UNIVERSITY

(With effect from 2020)
Preamble
Education is the key to development of any society. Role of higher education is crucial for securing
right kind of employment and also to pursue further studies in best available world class institutes
elsewhere within and outside India. Quality education in general and higher education in particular
deserves high priority to enable the young and future generation of students to acquire skill, training
and knowledge in order to enhance their thinking, creativity, comprehension and application
abilities and prepare them to compete, succeed and excel globally. Sustained initiatives are
required to reform the present higher education system for improving and upgrading the academic
resources and learning environments by raising the quality of teaching and standards of
achievements in learning outcomes in undergraduate program in professional streams of higher
education like computer science. One of the significant reforms in the postgraduate education is to
introduce the Learning Outcomes-based Curriculum Framework (LOCF) which makes it student-
centric, interactive and outcome-oriented with well-defined aims, objectives and goals to achieve.
LOCF also aims at ensuring uniform education standard and content delivery across the country
which will help the students to ensure similar quality of education irrespective of the institute and
location. With initiatives of University Grants Commission (UGC) for nation-wide adoption and
implementation of the LOCF for PG programmes in colleges, universities and HEIs in general.So
M.Sc. Computer Science at Sri Sri University is designed as per LOCF & as per UGC guidelines.

The main objective of M.Sc. Computer Science program at Sri Sri University is to prepare a
comprehensive course structure with detailed syllabus along with quality reading material in order
to have a uniform standard of education in PG Computer Science programme among students. This
document shall serve as a model document across the higher education institutes (HEIs) in the
country for teachers, students and academic administrators. It is a student centric framework where
they are expected to learn fundamentals of computer science along with the latest trends and
techniques like Artificial Intelligence, Internet of Things, Machine Intelligence, Cloud Computing
along with advanced skillsets that include Mobile Application Development, Object Oriented
Programming among many other courses. It will help the students to be equipped with fundamental
as well as advanced and latest technologies in computer science after completion of the programme
Introduction
M.Sc. Computer Science has been evolving as an important branch of science and engineering
throughout the world in last couple of decades and it has carved out a space for itself like any
other disciplines of basic science and engineering. Computer science is a discipline that spans
theory and practice and it requires thinking both in abstract terms and in concrete terms.
Nowadays, practically everyone is a computer user, and many people are even computer
programmers. Computer Science can be seen on a higher level, as a science of problem solving
and problem solving requires precision, creativity, and careful reasoning. The ever-evolving
discipline of computer science also has strong connections to other disciplines. Many problems in
science, engineering, health care, business, and other areas can be solved effectively with
computers, but finding a solution requires both computer science expertise and knowledge of the
particular application domain.

M.Sc. Computer Science has a wide range of specialties. These include Computer Architecture,
Software Systems, Graphics, Artificial Intelligence, Computational Science, and Software
Engineering. Drawing from a common core of computer science knowledge, each specialty area
focuses on specific challenges. Computer Science is practised by mathematicians, scientists and
engineers. Mathematics, the origins of M.Sc. Computer Science, provides reason and logic. M.Sc.
Computer Science provides the methodology for learning and refinement.

M.Sc. Computer Science will commence at Sri Sri University in this year 2020, as this discipline
evolved itself to a multidisciplinary discipline. Information Technology is growing rapidly.
Increasing applications of computers in almost all areas of human endeavour has led to vibrant
industries with concurrent rapid change in technology. Unlike other basic disciplines, developing
core competency in this discipline that can be reasonably stable becomes a challenge.

Career Objective

M.Sc. Computer Science is aimed at postgraduate level training facilitating multiple career
paths. Students so graduated, can take up postgraduate programmes in CS leading to research as
well as R&D, can be employable at IT industries, or can pursue a teachers’ training programme
such B. Ed. in Computer Education, or can adopt a business management career. . There are
several employment opportunities and after successful completion of an M.Sc. Computer
Science graduating students can fetch employment directly in companies as Web Developer,
Software Engineer, Network Administrator, Data Scientist, or AI/ML personnel.

The Learning Outcome-based Curriculum Framework in M.Sc. Computer Science is aimed at

allowing flexibility and innovation in design and development of course content, in method of
imparting training, in teaching learning process and in assessment procedures of the learning
outcomes. The emphasis in computer science courses, in outcome-based curriculum framework,
help students learn solving problems, accomplishing IT tasks, and expressing creativity, both
individually and collaboratively. The proposed framework will help Students learn
programming techniques and the syntax of one or more programming languages.

Many of the learning outcomes of M.Sc. Computer Science can be achieved only by
programming a computer for several different meaningful purposes. All students must, therefore,
have access to a computer with a modern programming language installed. The computer science
framework does not prescribe a specific language. The teacher and students will decide which
modern programming languages students will learn. More importantly, students will learn to adapt
to changes in programming languages and learn new languages as they are developed.

The present Learning Outcome-based Curriculum Framework for M.Sc. Computer Science is
intended to facilitate the students to achieve the following.

1.To develop an understanding and knowledge of the basic theory of Computer Science and
Information Technology with good foundation on theory, systems and applications such as
algorithms, data structures, data handling, data communication and computation.

2.To develop the ability to use this knowledge to analyse new situations

3.To acquire necessary and state-of-the-art skills to take up industry challenges. The objectives
and outcomes are carefully designed to suit to the above-mentioned purpose.

4.The ability to synthesize the acquired knowledge, understanding and experience for a better and
improved comprehension of the real-life problems

5.To learn skills and tools like mathematics, statistics, physics and electronics to find the
solution, interpret the results and make predictions for the future developments.
Curriculum Planning- Learning Outcomes-based Approach for M.Sc. Computer
Science

M.Sc. Computer Science in India is generally a two-year degree program which develops advanced
theoretical and research skills in subject. It is an appropriate course for students who wish to
pursue M. Phil.(CS) or Doctor of Philosophy (PhD) in CS and a research or academic career. This
program facilitates students who wish to pursue an independent research project in an area of
interest under the supervision of an academic.

Aims of M.Sc. Computer Science Programmes

The M.Sc. Computer Science emphasizes problem solving in the context of algorithm development
and software implementation and prepares students for effectively using modern computer systems in
various applications. The curriculum provides required computer science courses such as
programming languages, data structures, computer architecture and organization, algorithms,
database systems, operating systems, and software engineering; as well as elective courses in
artificial intelligence, computer-based communication networks, distributed computing, information
security, graphics, human-computer interaction, multimedia, scientific computing, web technology,
and other current topics in computer science. The main aim of this Bachelor’s degree is to deliver a
modern curriculum that will equip graduates with strong theoretical and practical backgrounds to
enable them to excel in the workplace and to be lifelong learners. The purposes of the M.Sc.
Computer Science programs are twofold: (1) to prepare the student for a position involving the
design, development and implementation of computer software/hardware, and (2) to prepare the
student for entry into Research field.

M.Sc. Computer Science focuses on the concepts and techniques used in the design and
development of software systems. Students in this program explore the conceptual underpinnings
of Computer Science -- its fundamental algorithms, programming languages, operating systems,
and software engineering techniques. In addition, students choose from a rich set of electives that
includes data science, computer graphics, artificial intelligence, database systems, computer
architecture, and computer networks, among other topics. A generous allotment of free electives
allows students to combine study in computer science with study in auxiliary fields to formulate a
program that combines experiences across disciplines.
Programme Learning Outcomes for M.Sc. Computer Science
The M.Sc. Computer Science program enables students to attain, by the time of completion:

PLO-A. Demonstrate the aptitude of Computer Programming and Computer based

problem solving skills.
PLO-B. Display the knowledge of appropriate theory, practices and tools for the
specification, design, implementation.
PLO-C. Ability to learn and acquire knowledge through online courses available at
different MOOC Providers.
PLO-D. Ability to link knowledge of Computer Science with other two chosen auxiliary
disciplines of study.

PLO-E. Display ethical code of conduct in usage of Internet and Cyber systems.
PLO-F. Ability to pursue higher studies of specialization and to take up technical
employment.
PLO-G. Ability to formulate, to model, to design solutions, procedure and to use software
tools to solve real world problems and evaluate.
PLO-H. Ability to operate, manage, deploy, configure computer network, hardware,
software operation of an organization.
PLO-I.Ability to present result using different presentation tools.
PLO-J. Ability to appreciate emerging technologies and tools.
PLO-K. Apply standard Software Engineering practices and strategies in real-time
software project development.
PLO-L. Design and develop computer programs/computer -based systems in the areas
related to algorithms, networking, web design, cloud computing, IoT and data analytics.

PLO-M.Acquaint with the contemporary trends in industrial/research settings and thereby

innovate novel solutions to existing problems.

PLO-N. The ability to apply the knowledge and understanding noted above to the
analysis of a given information handling problem.

PLO-O. The ability to work independently on a substantial software project and as an

effective team member.
The Course of Study and the Scheme of Examinations
Year / Subject Paper Title of the Paper Credit Max. Marks
Semest IA Uni. Total
er Exam
I Year Core MCS101 Object Oriented Programming 4 40 60 100
I Semester
Core MCS102 Data Structures and Algorithms 4 40 60 100

Core MCS103 Computer System Architecture 4 40 60 100

General MCS104 Mathematical Foundations for Computer 4 40 60 100

Elective Science
Core MCS105 Object Oriented Programming LAB 2 40 60 100
Practical
Core MCS106 Data Structures and Algorithms LAB 2 40 60 100
Practical
Core MCS107 Computer System Architecture LAB 2 40 60 100
Practical
Semester Total 22 700

I Year Core MCS201 Operating System 4 40 60 100

II Semester Core MCS202 Data Base Management System 4 40 60 100
Core MCS203 Data Communication and Networking 4 40 60 100
Core MCS204 AI and Machine Learning 4 40 60 100
General MCS205 Optimization Techniques 4 40 60 100
Elective
Core MCS206 Data Base Management System LAB 2 40 60 100
Practical
Core MCS207 AI and Machine Learning LAB 2 40 60 100
Practical
Core MCS208 Python Programming LAB 2 40 60 100
Practical
MCS209 Seminar/ MOOC/Open Elective 2 40 60 100

Semester Total 28 900

II Year Core MCS301 Software Engineering using UML 4 40 60 100

Core MCS302 Data Science 4 40 60 100
III
Core MCS303 Advanced Machine Learning 4 40 60 100
Semester Professional MCS304 Professional Elective - I 4 40 60 100
Elective
 Professional MCS305 Professional Elective – II 4 40 60 100
Elective
Core MCS306 Software Engineering using UML LAB 2 40 60 100
Practical

Core MCS307 Data Science LAB 2 40 60 100

Practical
Professio MCS308 Laboratory –I 2 40 60 100
nal (Based on Professional Electives)
Elective
Practical
Internship MCS309 Academic/ Industrial Internship 4 40 60 100
(Evaluation of Internship at the end of 1 year
of study)
Semester Total 30 900

II Year Core MCS401 Cloud Computing 4 40 60 100

Professional MCS402 Professional Elective -III 4 40 60 100
IV
Elective
Semester Professional MCS403 Professional Elective -IV 4 40 60 100
Elective
Professional MCS404 Professional Elective -V 4 40 60 100
Elective
Professional MCS405 Cloud Computing LAB 2 40 60 100
Elective
Practical

Professional MCS406 Laboratory –II 2 40 60 100

Elective (Based on Professional Electives)
Practical
MCS407 Comprehensive Viva 2 40 60 100
MCS408 Major Project / Dissertation 8 40 60 100
Semester Total 30 800
Program Total 110 3300
List of Professional Elective Subjects*:
Professional Elective List of Subjects
Professional Elective-I Digital Signal Processing/
Computer Vision/
Reinforcement Learning
Professional Elective-II Recommender System/
Pattern Recognition/
Knowledge Based AI/
Intelligent Agents
Professional Elective-III Data Visualization/
AI in Speech Processing/
AI and Games
Professional Elective-IV Internet of Things/
Robotics and Intelligent Systems/
Application of AI & Machine Learning in Industries
Professional Elective-V Natural Language Processing/
Deep Learning/
GPU Computing

List of Open Elective Subjects*:-

1. Project Management
2. Business Analytics
3. Entrepreneurial Skill Development
4. Lean Startup Management
5. Writing for Technical Purpose
6. Cyber Law and Ethics
7. Operations Research
8. Digital Marketing

*Subject to availability of faculty

 MCS101: Object Oriented Programming

Unit-I: Principal of OOP ,Procedure oriented Vs Object oriented, OOP paradigm, Features of OOP ,
Basic Data types Tokens, Keywords, Constant ,Variables, Operator I/O statements , Structure of C++
program, Arrays, pointers, Object modelling technique (OMT)

Unit-II: Function, Object and Class, Defining class, Abstract class ,Function prototype, Function with
parameter ,Passing object as a parameter, Constructor function ,Types of constructor, Destructor Friend
function , Friend class, Dynamic allocation operator new and delete.

Unit-III: Polymorphism and Inheritance ,Types of polymorphism, Constructor overloading ,Operator

overloading, Template function Template class, Types of inheritance ,Private ,protected and public
derivation of class ,Resolving ambiguity Pointer to object, This pointer ,Virtual class , virtual function

Unit-IV: Input - output and File handling I/O classes ,File and stream classes ,Opening and closing file
Detecting end of file, String I/O, Char I/O, Object I/O, I/O with multiple object ,File pointer, Disk I/O.

Unit-V: Exception handling, Name spaces and Standard Template library (STL), Need of Exception
handling, try, catch and throws keywords, defining namespace, benefit of namespace, Component of
STL.

Text Books:
1. Object Oriented Programming with C++ Programming , E.Balaguruswamy,Mc Graw Hill .
2. C++ Complete reference. By Herbert Schildt, Mc Graw Hill.
Reference Books:
1. Principles and Practices using C++ , Bjarne Stroustrup, Addison Wesley
2. Mastering C++ b, Venugopal , Mc Graw Hill
3. Object Oriented Programming in C++ , Robert Lafore, Galgotia Pub.
 MCS102: Data Structures and Algorithms

Unit I: Basics: Basic terminologies; introduction to basic data Structures: Arrays, linked list, trees,
stack, queue, Graph; Data structure operations; Algorithm complexity: definition, types and notations .

Unit II: Stacks, Queues and Recursion: Stacks; Array representation of stack; Linked representation of
stack; Various polish notation’s-Prefix, Postfix, infix; Evaluation of a postfix & Prefix expression;
Conversion from one another; Application of stack; Recursion; Towers of Hanoi; Implementation of
recursive procedures by stacks; Queues; Linked representation of queues; Dequeues; Circular queue;
Priority queue; Singly Linked list- Operation on it; Doubly linked list- Operation on it; Circular linked
list.

Unit III: Trees: Binary trees; Representation of binary tree in memory; Traversing binary tree;
Traversing using stack; Header nodes; Binary search trees; Searching and inserting in binary search
trees; Deleting in a binary search tree; AVL search trees; Insertion and deletion in binary search trees;
m-way search trees: searching, insertion, deletion; B trees: searching, insertion, deletion; Heap.

Unit IV: Algorithm Design techniques: Divide and Conquer, Greedy, Dynamic programming, back
Tracking. Searching algorithm: linear search, binary search; Sorting algorithms: Bubble sort, Insertion
sort, Selection sort, Quick Sort, Merge sort and Heap sort, Hashing, Hash function.

Unit- V: Graphs: Terminology & representation; Linked representation of graph; Operation on graph;
Traversing a graph. Depth First Search, BFS, Warshall algorithm, Dijkstara algorithm, Minimum
spanning tree; Kruskal & Prim’s algorithm.

Text Books:
1. Data Structure , Lipschutz , Mc Graw Hill.
2. Data Structures with C++”, John R. Hubbard.
3. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
Reference Books:
1. Schaum’s Outline, Tata McGraw Hill.
2. Data Structure using C, AM Tanenbaum, Y Langsam and MJ Augenstein, PrenticeHall, India
 3. Data Structures, Algorithms, and Applications in Java”, Sahani, McGraw Hill.
4. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition,
Pearson Education, 2012.

MCS103: Computer Organization and Architecture

Unit- I: Register transfer language, Bus and memory transfer, Arithmetic, micro operation, Logic
micro operation, Shift micro operation, Arithmetic logic shift unit

Unit- II: Instruction codes, Computer registers, Computer instructions, Timing and control, Instruction
cycle, Memory reference instruction, I/O and interrupt, Design of basic computer and Accumulator
logic.

Unit- III: Machine language, assembly language, Assembler programming, arithmetic and logic
operation, I/O programming. Micro programmed and hardwired control unit, General register
organization of C.P.U, Stack organization, Instruction format, Addressing modes, Program control,
RISC v/s CISC.

Unit- IV: Parallel processing, Pipelining, Arithmetic pipelining, Instruction pipeline, RISC pipeline,
Vector processing, Memory interleaving, Array processor, multiprocessor.

Unit- V: Peripheral devices, I/O interfaces, Asynchronous Data transfer DMA, Priority Interrupt, I/O
processor, Multiprocessor system organization and Data communication processor. Auxiliary memory,
Microcomputer, memory, Memory hierarchy, Associative memory, Virtual memory, Cache memory,
Memory management hardware.
Text Books:
1. Morris Mano “Computer System Architecture”,
2. Computer Organization & Architecture, W. Stallings, “, PHI.
Reference Books:
1. Computer Architecture and Organization, J. P. Hayes, McGraw Hill,
2. Computer Architecture, A Quantitative Approach, John L. Hennessy & David A. Patterson,”,
Morgan Kaufmann, .
3. Modern Computer Architecture , Rafiquzamman and Chandra,”. Galgotia Publication.
 MCS104- Mathematical Foundations for Computer Science

Unit I: Numerical Methods: Significant figures, Error definitions, Approximations and round off
errors, accuracy and precision. Roots of Equations: Bairstow-Lin’s Method, Graeffe’s Root Squaring
Method. Computation of eigen values of real symmetric matrices: Jacobi and Givens method.

Unit II: Statistical Inference: Introduction to multivariate statistical models: Correlation and
Regression analysis, Curve fitting (Linear and Nonlinear)

Unit III: Probability Theory: Probability mass function (p.m.f), density function (p.d.f), Random
variable: discrete and continuous, Mathematical expectation, Sampling theory: testing of hypothesis by
t-test and chi - square distribution.

Unit IV: Graph Theory: Isomorphism, Planar graphs, graph coloring, Hamilton circuits and Euler
cycle. Specialized techniques to solve combinatorial enumeration problems.

Unit V: Vector Spaces: Vector spaces; subspaces; Linearly independent and dependent vectors ; Bases
and dimension; coordinate vectors-Illustrative examples. Linear transformations; Representation of
transformations by matrices; linear functional; Non singular Linear transformations; inverse of a linear
transformation- Problems.

Text Books:
1. Steven C. Chapra and Raymond P Canale: ” Numerical Methods for Engineers, 7th Edition,
McGraw-Hill Publishers, 2015.
2. T.Veerarajan: “Probability, Statistics and Random Process“, 3rd Edition,Tata Mc-Graw Hill
Co.,2016.
3. David C.Lay, Steven R.Lay and J.J.McDonald: Linear Algebra and its Applications, 5 th
Edition, Pearson Education Ltd., 2015.
Reference Books:
1. B.S. Grewal: Higher Engineering Mathematics, Khanna Publishers, 44th Ed., 2017.
2. John Vince : “Foundation Mathematics for Computer Science”, Springer International
Publishing, Switzerland, 2015.
 3. M.K.Jain, S.R.K.Iyengar and R.K.Jain: Numerical Methods for Scientific and Engineering
Computation. 6th Ed.,New Age Int.Publishers.2012.
4. Norman L.Biggs: Discrete Mathematics, 2nd Ed., Oxford University Press, 2017.

MCS201: Operating System

Unit- I: Operating System, Computer-System Organization, Computer-System Architecture,
Operating-System Structure, Operating-System Operations, Process Management, Memory
Management, Storage Management, Protection and Security, Distributed Systems, Special Purpose
Systems, Computing Environments, Open-Source Operating Systems. Operating System Services,
User Operating System Interface, System Calls, Types of System Calls, System Programs, Operating-
System Design and Implementation, Operating System Structure, Virtual Machines, Operating
System Debugging, Operating System Generations. System Boot.

Unit- II: Process: Process Concept, Process Scheduling, Operations on Processes, Inter-
Process Communication, Examples of IPC Systems, Communication in Client-Server
Systems. Multithreaded Programming: Multithreading Models, Thread Libraries, Threading
Issues, Operating-System Examples.

Unit- III: Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms,
Thread Scheduling. Multiple-Process Scheduling. Synchronization: The Critical Section
Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, Classical
Problems of Synchronization, Monitors, Synchronization Examples, Atomic Transactions.

Unit- IV: Deadlocks: System Model, Deadlock Characterization, Methods of Handling

Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock Detection, Recovery from
Deadlock. Memory Management Strategies: Swapping, Contiguous Memory Allocation, Paging,
Structure of the Page Table, Segmentation, Example: The Intel Pentium.

Unit- V: Virtual-Memory Management: Demand Paging, Copy-on-Write, Page Replacement,

Allocation of Frames, Thrashing, Memory-Mapped Files, Allocating Kernel Memory. File System:
File Concept, Access Methods, Directory and Disk Structure, File-System Mounting, File Sharing,
Protection.
Text Books:
1. Operating System Concepts: Silberschatz, Galvin, Gagne, 8/e (Wiley-India).
2. Modern Operating Systems, A S Tanenbaum, , PHI.

Reference Books:
1. Operating System Concepts, Peterson and Silberschatz, , Addison Wesley.
2. Operating Systems: Internals and Design Principles , William Stalling, PHI.

MCS202: Data Base Management System

Unit-I: Database System : Database System Applications, Database Systems versus File Systems,
View of Data & Data Models, Database Languages, Database Users and Administrators,
Transaction Management, Database System Structure, Application Architecture. Entity-Relationship
Model : Basic Concepts & Constraints, Keys, Design Issues, Entity-Relationship Diagram, Weak
Entity Sets, Extended E-R Features, Design of E-R Database Schema, Reduction of an E-R Schema
to Tables, Overview of Relational Model and Relational Database Design.

Unit-II: SQL : Basic Structure, Set Operations, Aggregate Functions, Null Values, Nested Sub-
queries, Views, Complex Queries, Modification of the Database, Joined Relations, Data-
Definition Language, Embedded SQL. Dynamic SQL. Integrity and Security: Domain
Constraints, Referential Integrity, Assertions, Triggers, Security and Authorization, Authorization in
SQL, Encryption and Authentication.

Unit –III: Query Processing: Measures of Query Cost, Selection Operation, Sorting, Join and
other Operations, Evaluation of Expressions. Query Optimization: Estimating Statistics of Expression
Results, Transformation of Relational Expressions, Choice of Evaluation Plans, Materialized
Views.

Unit-IV: Object-Oriented Databases: Complex Data Types, Object-Oriented Data Model, Object-
Oriented Languages, Persistent Programming Languages, Persistent C++ Systems, Persistent
Java Systems. Object-Relational Databases: Nested Relations, Complex Types, Inheritance, Reference
Types, Querying with Complex Types, Functions and Procedures, Object-Oriented Vs Object-
Relational.
Unit-V: Transactions: Transaction, Transaction State, Implementation of Atomicity and Durability,
Concurrent Executions, Serializability, Recoverability, Implementation of Isolation, Transaction
Definition in SQL, Testing for Serializability. Concurrency Control: Lock-Based, Timestamp-
Based, Validation-Based Protocols Multiple Granularity, Multiversion Schemes, Deadlock
Handling, Insert and Delete Operations, Weak Levels of Consistency, Concurrency in Index
Structures. Recovery System : Failure Classification, Storage Structure, Recovery and Atomicity, Log-
Based Recovery, Shadow Paging, Recovery with Concurrent Transactions, Buffer
Management, Failure with Loss of Nonvolatile Storage, Advanced Recovery Techniques,
Remote Backup Systems.

Text Books:

1. Silbcrschatz. A,. Korth, H.F., and Sudarshan.S. : Database System Concepts 4/ed.
( McGraw-Hill Int.)
2. An Introduction to Data base Systems , C J Dates, / Kannan, Pearson Education.
3. Data Base Systems , J.D.Ullman, Galgotia, New Delhi.
Reference Books:

1. Distributed Databases ,S.Ceri and G. Relagatti, McGraw-Hill.

2. The Theory of Database concurrency Control C.Papadimitriou ,Computer Science Press.

MCS203: Data Communication and Networking

Unit-I: Introduction: Goal and application Network Hardware and Software , Protocol hierarchies,
Design Issue of the layers, Interfaces and services, Connection oriented and connection less services,
Service Primitives, Reference Models – The OSI Reference model, The TCP/IP Reference
Model ,Types of computer Network :LAN,MAN,WAN, Topologies, Transmission mode .Physical
Layer: Transmission Media ,Concept of data transmission ,Switching Techniques ,Communication
Satellites – Geosynchronous Satellite – VSAT, Low Orbit Satellites, ISDN and ATM. Digital
Modulation and Demodulation Techniques.

Unit-II: Data Link Layer: Data Link Layer design issues, Framing, Flow control, Error Detection and
Correction DLL Protocol: Stop and Wait Protocol, Sliding window protocol, A Simplex protocol for
noisy channel, Medium access sublayer: Channel allocation –static and dynamic ,Multiple access
protocol FDDI, Data Link Layer in the Internet – SLIP,PPP.

Unit-III: Network Layer: The Network Layer Design Issue, comparison of virtual circuits and
datagram subnets, connectionless internetworking, Tunnelling, Internetwork routing, Routing
algorithm , Fragmentation, The Network Layer in the Internet – The IP Protocol, IP Address, subnets,
Internet control protocols, internet multicasting.

Unit-IV: Transport Layer: The Transport layer services, The concept of client and server in terms of
socket addressing Quality, of service, Transport service primitives and buffering, Multiplexing, Crash
Recovery. The Internet Transport Protocols (TCP/IP) – The TCP Service Model, The TCP protocol,
The TCP segment header, TCP connection management, TCP transmission policy, TCP congestion
control, TCP timer management, UDP.

Unit-V: Presentation and Application Layer: Network Security – Traditional Cryptography, Two
fundamental Cryptographic Principles, Secret Key Algorithms Public key Algorithms, Authentication
protocols, DNS, E-mail.

Text Books :

1. Forouzan, B. A.: Data Communications and Networking, 2/Ed (TMH)

2. Computer Networks ,A.S. Tanenbaum, Pearson Education

Reference Books :
1. Computer Network , S.S.Shinde ,New Age International Publisher.
2. Data and computer Communication , Shashi banzal ,Firewall media.
3. Data & Computer communication, William Stallings, Pearson

MCS204: AI and Machine Learning

Unit-I: Introduction to AI: History of AI, State of the Art Intelligent Agents, Problem Solving by
Searching: BFS, Uniform Cost Search, DFS, IDS, Bi-directional Search, Constraint Satisfactory
Search, Informed Search Best First Search, Heuristic Function, Memory bounded search, A* and
IDA*, Game Playing: Min-Max search and Alpha-Beta pruning.
Unit-II: Knowledge & Reasoning: Agents that reason logically, First Order Logic, Syntax and
Semantics. Inference in First Order Logic: Inference Rules, Modus Ponems, Unification, Forward and
Backward Reasoning, Resolutions Planning: A simple Planning Agent, from Problem Solving to
Planning, Planning in Situation Calculus.

Unit-III: Learning: Learning from Observations. A General Model of Learning Agents, Inductive
Learning; Expert Systems, Robotics. Introduction to Machine Learning: Statistical Technique,
Artificial Neural Network.

Unit IV: Supervised Learning (Regression/Classification) Basic methods: Distance-based methods,

Nearest-Neighbours, Decision Trees, Naive Bayes Linear models: Linear Regression, Logistic
Regression, Generalized Linear Models, Support Vector Machines, Nonlinearity and Kernel Methods,
Beyond Binary Classification: Multi-class/Structured Outputs, Ranking.

Unit V: Unsupervised Learning Clustering: K-means/Kernel K-means, Dimensionality Reduction:

PCA and kernel PCA.

Text Books:

1. Stuart Russel &, Peter Norvig: Artificial Intelligence A Modern Approach (Person Education
Asia.) 3rd edition.

2. EthemAlpaydin, "Introduction to Machine Learning" 2nd Edition, The MIT Press, 2009.

3. Tom M. Mitchell, "Machine Learning", First Edition by Tata McGraw-Hill Education, 2013.

Reference Books:

1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012

2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning,
Springer 2009 (freely available online)
3. Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007.

MCS205: Optimization Techniques

Unit-I : Introduction: Definition, characteristics, Nature, scope, objectives; Models in OR, Principal
and Approximation of O.R. Models, characteristics, advantages, limitations of models; phases of OR,
General Methods of solving models, Scientific Methods.
Unit-II: Linear Programming: Liner Programming: Introduction, requirements of a LPP, applications
of LP, General LP problems, Formulation, Graphical solution, standard and matrix forms of linear
programming problems, Simplex method and its flow chart, Two phase Simplex method, Big-M
Method, Degeneracy.

Unit-III: Non Linear Programming: Introduction, elimination methods: various search

methodsFibonacci method and golden section method Interpolation method-Quadratic and cubic
interpolation methods, Direct root method.
Duality: Introduction, Definition, General Rule for converting any primary into its Dual, Dual Simplex
method and its flow chart.

Unit-IV: PERT and CPM: PERT and CPM: Introduction, PERT Vs. CPM, network construction,
Forward and Backward computation, Representation in Tabular form critical path computations, floats
and slacks.

Unit-V: Introduction to non-traditional methods: Genetic Algorithm: Introduction, Representation of

design variables, objective function and constraints, Genetic operators and numerical results.
Introduction to Neural network based optimization.

Text Books:
1. Sharma, S.D., Operations Research, Kedar Nath & Ram Nath, Meerut, 1996.
2. Gupta P.K, Hira and D.S., Operation Research, Sultan Chand & Sons, New Delhi, 1994.
Recommended Books:
1. Kanti Swarup, Gupta P.K. & Man Mohan, Operation Research, Sultan Chand & sons, New Delhi,
1990.

2. Taha, H.A., Operation Research - An Introduction, McMillan Publishing Co, New York, 1986.
 MCS301: Software Engineering using UML

Unit-I: Introduction, Introduction to Software Development processes, Agile software development:

Agile methods, Plan-driven and agile development, Extreme programming, Agile Process model:
Adoptive software development, scrum, crystal, Agile modelling, Agile unified process.

Unit-II: Requirements engineering: Functional and non-functional requirements: The software

requirements document, Requirements specification, Requirements engineering processes,
Requirements elicitation and analysis, Requirements validation, Requirements management

Unit-III: Object-oriented design using UML: Analysis and Design: Concepts, Classes and Objects.
Relationships Among Objects. Inheritance and Polymorphism, Design Concepts, Design Notation and
Specification, Design Methodology, Dynamic Modelling, Functional Modelling, Defining Internal
Classes and Operations, Design patterns.
System modelling: Context models, Interaction models, Structural models, Behavioural models Model-
driven engineering

Unit-IV: Architectural design: Architectural design decisions, Architectural views, Architectural

patterns, Application architectures, Design and implementation,Testing: Introduction to software
testing, verification and validation, unit testing, integration testing, system testing. Software
Maintenance.

Unit-V: Project management: introduction to Risk management, managing people, Teamwork, Project
planning, Software pricing, Plan-driven development, Project scheduling, Estimation techniques,
Quality management, Software measurement and metrics.

Introduction to Advanced Software Engineering concepts: Software reuse, Component-based software

engineering, Distributed software engineering, Service-oriented architecture, Embedded software,
Aspect-oriented software engineering
Text Books:
1. Ian Sommerville Software Engineering-, Pearson Education, New Delhi, 10th Edition 2017,
ISBN: 9789332582699
2. Roger S. Pressman, Bruce R. Maxim, Software Engineering-A practitioner’s approach-
McGraw-Hill International Editions, New York. ISBN: 9789353165710, 9353165717,
Edition: 8, 2019
3. Pankaj Jalote , An Integrated Approach to Software Engineering-, Narosa Publishing
House. Third Edition, 978-81-7319-702-4 , Reprint 2019
4. Rajib Mall ,Fundamentals of Software Engineering-, PHI, New Delhi. 5th Edition, 2018
Reference Books:
1. Ugrasen Suman Software Engineering: Concepts & Practices, Cengage Learning
publications. 1st Edition, 2013.
2. Aggarwal, K. K. & Singh, Y: Software Engineering (New Age International)

MCS302: Data Science

Unit -I: Introduction to Data Science, Data Science Venn Diagram, Relation to data mining, machine
learning, big data and statistics, Business Intelligence (BI) vs. Data Science. Types of Data: Structured
v/s unstructured data, Examples of data pre-processing , Quantitative vs qualitative data, Four levels of
data. Stages of a data science project: Defining the goal, Data collection and management, Explore the
data, Modeling, Model evaluation and critique, Presentation and documentation.

Unit –II: Introduction to Linear algebra for data science: Vectors and matrices. Introduction to
Probability: Bayesian versus Frequentist, Frequentist approach, The law of large numbers, Compound
events, Conditional probability, Bayesian ideas revisited, Bayes theorem , More applications of Bayes
theorem, Random variables, Discrete random variables.

Basic Statistics: Obtaining data (Observational, Experimental), Sampling data, Probability sampling,
Random sampling, Unequal probability sampling, measurement of statistics , Measures of center
(Mean, Median, Mode, Skewness, Quantile, Percentile), Measures of variation, Measures of relative
standing, Correlations in data, The Empirical rule.
Unit –III: Data Visualization: Basic principles, ideas and tools for data visualization, Identify effective
and ineffective visualization (Scatter plots, Line graphs, Bar charts, Histograms, Box plots),
Correlation versus causation, Simpson’s paradox, Verbal communication.

Machine Learning Essentials: Machine learning, Working principles, Types of machine learning
(Supervised learning, Unsupervised learning, Reinforcement learning), How does statistical modeling
fit. Some Basic Algorithms like Linear Regression, k-Nearest Neighbors (k-NN), k-Means, Decision
Tree. Feature Extraction, Eigen vectors and Eigen values, Principal Component Analysis (PCA).

Unit-IV: Beyond the Essentials: The bias variance tradeoff (Error due to bias, Error due to variance,
Two extreme cases of bias/variance tradeoff, How bias/variance play into error functions), K folds
cross-validation, Grid searching (Visualizing training error versus cross-validation error), Ensembling
techniques (Random forests, Comparing Random forests with decision trees), Introduction to structure
of Neural networks.

Unit-V: Hands on laboratory using R Language for example like Data Visualization (Scatter plots, Line
graphs, Bar charts, Histograms, Box plots), Some Basic Algorithms like Linear Regression, k-Nearest
Neighbors (k-NN), k-Means, Decision Tree. Principal Component Analysis (PCA), Random Forests,
Neural Networks.

Text Books:
1. Principles of Data Science, Sinan Ozdemir, Packt Publishing Ltd 2016.
2. Doing Data Science, Straight Talk From The Frontline, Cathy O'Neil and Rachel Schutt.,
O'Reilly. 2014.
3. An Introduction to Statistical Learning with Applications in R. James G, Witten D, Hastie
Tibshirani R, Springer, 2013.
Recommended Books:
1. Hands-On Data Science with R: Techniques to perform data manipulation and ...,Vitor Bianchi
Lanzetta, Nataraj Dasgupta, Ricardo Anjoleto Farias, Packt publishing ltd, 2018.
2. Data Science for Engineers : https://swayam.gov.in/nd1_noc19_cs60/preview (Prof.
Raghunathan Rengasamy & Prof. Shankar Narasimhan, IIT Madras).
3. Eric Seigel, "Predictive Analytics: The Power to Predict who Will Click, Buy, Lie, or Die",
Wiley, 2013.
 MCS303: Advanced Machine Learning
Unit-I: Linear Regression : Prediction using Linear Regression, Gradient Descent, Linear Regression
with one variable, Linear Regression with multiple variables, Polynomial Regression, Feature
Scaling/Selection.

Logistic Regression : Classification using Logistic Regression, Logistic Regression vs. Linear
Regression, Logistic Regression with one variable and with multiple variables.

Unit-II:: Regularization : Regularization and its utility: The problem of Overfitting, Application of
Regularization in Linear and Logistic Regression, Regularization and Bias/Variance.

Unit-III: Neural Networks : Introduction, Model Representation, Gradient Descent vs. Perceptron
Training, Stochastic Gradient Descent, Multilayer Perceptrons, Multiclass Representation,
Backpropagation Algorithm.

Unit-IV: Deep Learning History, Scope and specification, why deep learning now, building block of
neural network, neural networks, Deep learning hardware. Feedforward neural networks, xor model,
cost function estimation (maximum likelihood), units, activation functions, layers, , normalization,
hyper-parameter tuning, Convolution neural networks, architecture, recurrent neural networks,
architecture, types and overview, GAN (Generative Adversarial Networks).

Unit-V: Deep learning applications in Computer vision, sentiment analysis, music generation, text
generation, neural style transfer, image captioning

Text Books:
1. EthemAlpaydin, "Introduction to Machine Learning" 2nd Edition, The MIT Press, 2009.
2. Tom M. Mitchell, "Machine Learning", First Edition by Tata McGraw-Hill Education, 2013.

Reference Books:
3. Christopher M. Bishop, "Pattern Recognition and Machine Learning" by Springer, 2007.
4. Mevin P. Murphy, "Machine Learning: A Probabilistic Perspective" by The MIT Press, 2012.
 MCS401: Cloud Computing
Unit-I: Overview of Computing Paradigm: Recent trends in Computing: Grid Computing, Cluster
Computing, Distributed Computing, Utility Computing, Cloud Computing. Introduction to Cloud
Computing: Introduction to Cloud Computing, History of Cloud Computing, Cloud service providers,
Benefits and limitations of Cloud Computing.

Unit-II: Cloud Computing Architecture: Comparison with traditional computing architecture

(client/server), Services provided at various levels, Service Models-Infrastructure as a Service (IaaS),
Platform as a Service (PaaS), Software as a Service (SaaS), How Cloud Computing Works,
Deployment , Models- Public cloud, Private cloud, Hybrid cloud, Community cloud, Case study of
NIST architecture.

Unit-III: Case Studies: Case Study of Service, Model using Google App Engine Microsoft Azure,
Amazon EC2.
Unit IV: Service Management in Cloud Computing: Service Level Agreements (SLAs),Billing &
Accounting, Comparing Scaling Hardware: Traditional vs. Cloud,Economics of Scaling.

Unit-V: Cloud Security: Infrastructure Security- Network level security, Host level security,
Application level security, Data security and Storage- Data privacy and security Issues, Jurisdictional
issues raised by Data location, Authentication in Cloud Computing.

Text Books:
1. Barrie Sosinsky, “Cloud Computing Bible”, Wiley-India, 2010
2. Rajkumar Buyya, James Broberg, Andrzej, M. Goscinski, “Cloud Computing Principles &
Paradigms”, Wiley-2011.
3. Cloud Computing for Dummies, By Judith S. Hurwitz, Daniel Kirsch · 2020.
Reference Books:
1. Cloud Computing: A Hands-On Approach , Arshdeep Bahga , Vijay Madisetti : University
Press.
2. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather,
Subra Kumaraswamy, Shahed Latif, O’Reilly.
3. Cloud Computing: Theory and Practice, Dan C. Marinescu, Elvesier, 2013.
 Professional Electives Subjects
Professional Elective-I

MCS304A: Digital Signal Processing

Unit-I:
Introduction to Digital Signal Processing: Introduction to Digital Signal Processing: Discrete time
signals & sequences, linear shift invariant systems, stability, and causality, linear constant coefficient
difference equations. Frequency domain of discrete time signals and systems.

Discrete Fourier series: DFS representation of Periodic Sequences. Properties of Discrete Fourier
Series., Discrete Fourier Transforms: Properties of DPT. linear convolution of sequences using DPT.
Computation of DFT: Over-lap Add method, Over-lap Save method, Relation between DTFT, DFS.
DFT and Z-Transform.

Unit-II:
Fast Fourier Transforms: Fast Fourier transforms (FFT) - Radix-2 decimation-in-time and decimation-
in-frequency FPT Algorithms, Inverse FFT and FFT with general Radix-N.

Realization of Digital Filters: Applications of Z - transforms, solution of difference equations of digital

filters, System function. Stability criterion. Frequency response of stable systems, Realization of digital
filters - Direct, Canonic, Cascade and Parallel forms.

Unit-III:
Digital Filters : Analog filter approximations - Butterworth and Chebyshev, Design of IIR Digital
filters from analog filters. Step and Impulse invariant techniques. Bilinear transformation method,
Spectral transformations.

FIR Digital Filters: Characteristics of FIR Filters. Frequency response. Design of FIR Filters: Fourier
Method. Digital Filters using Window techniques, Frequency Sampling technique, Compare IIR & FIR
filters.
Unit-IV:
Multi Rate Digital Signal Processing: Introduction. Down sampling, Decimation. Up sampling,
Interpolation, Sampling Rate Conversion, conversion of band pass signals. Concept of re-sampling.
Applications of multi rate signal processing. Limit cycles. Overflow oscillations. Round-off noise in
IIR digital filters. Computational output round off noise. Methods to prevent overflow. Trade off
between round off and overflow noise. Measurement of coefficient quantization effects through pole-
zero movement. Dead band effects.

Text Books:
1. John G. Proakis, Dimitris G. Manolakis.,Digital Signal Processing, Principles, Algorithms, and
Applications: Pearson Education / PHI. 2007.
2. A. V. Oppenheim and R.W. Schaffer , Discrete Time Signal Processing-. PHI, 2009 3.
S.Salivahanan. A.Vallavaraj and CGnanapriya , Digital Signal Processing -.TMH.2009.
Reference Books:
1. Digital Signal Processing fundamentals and Applications, Li Tan , Jean Jiang, Academic
Press, 2nd edition,2013.
2. Digital Signal Processing – A computer based Approach, S.K.Mitra, Tata McGraw Hill,3rd
Edition, 2006.
3. Fundamentals of digital Signal Processing –Lonnie c.Ludeman, Wiley.
4. Digital Signal processing-A Practical Approach, Second edition, Emmanuel I. feacher, and
BarrieW..Jervis, Pearson Education.
 MCS304B: Computer Vision

Unit-I: Introduction to Computer Vision: What is computer vision, History of computer Vision,
Application areas. Image Formation and Filtering: Geometric Primitives and Transformations,
Frequency Domain: Fourier Transform, Pyramids and Wavelets. Cameras and Optics: Photometric
image formation and Digital camera.

Unit-II: Introduction to Statistical, Structural, Neural and Hybrid Techniques, Dimensionality

Reduction: PCA, LDA, ICA; Non-parametric methods. Feature Detection and Matching: Local image
features, Points and Patches, Edges, Lines, Image Segmentation.

Unit-III: Multiple Views and Motion: Photometric Calibration, High Dynamic Range Imaging,
Super Resolution and Blur removal, Epipolar Geometry and Structure from Motion, Stereo
Correspondence and Introduction to Optical Flow: Horn-Shunck and Lucas-Kanade algorithms, Image
based rendering.

Unit-IV: Recognition: Document Analysis and Optical Character Recognition, Object Recognition.,
Template Matching, Face detection and recognition, Gesture recognition, Robotic Vision.

Unit-V: Machine Learning in Computer Vision: Face detection using Ada-boost, Machine learning
techniques for computer vision: Neural networks Basics and Convolution Networks, Object Detectors
Emerge in Deep Scene CNNs and Architecture, Structured Output from Deep Networks.

Text Books:
1. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer-Verlag London
Limited, 2011 Edition.
2. Computer Vision: A Modern Approach, 2nd Edition, D. A. Forsyth, J. Ponce, Pearson Education,
2012.
3. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, 2 nd
Edition, Cambridge University Press, March 2004.
4. K. Fukunaga; Introduction to Statistical Pattern Recognition, 2nd Edition, Academic Press,
Morgan Kaufmann, 2013.

Reference Books:
1. Ma, Soatto, Kosecka and Sastry (MaSKS) An Invitation to 3D Vision
2. Simon Prince ,Computer Vision: Models Learning and Inference

MCS304C: Reinforcement Learning

Detailed course to be updated
 Professional Elective-II

MCS305A: Recommender System

Unit I: Introduction: Overview of Information Retrieval, Retrieval Models, Search and Filtering
Techniques: Relevance Feedback, User Profiles, Recommender system functions, Matrix operations,
covariance matrices, Understanding ratings, Applications of recommendation systems, Issues with
recommender system.

Unit II: Content-based Filtering: High level architecture of content-based systems, Advantages and
drawbacks of content based filtering, Item profiles, Discovering features of documents, pre-processing
and feature extraction, Obtaining item
features from tags, Methods for learning user profiles, Similarity based retrieval, Classification
algorithms.

Unit III: Collaborative Filtering: User-based recommendation, Item-based recommendation, Model

based approaches, Matrix factorization, Attacks on collaborative recommender systems.

Unit IV: Hybrid approaches: Opportunities for hybridization, Monolithic hybridization design: Feature
combination, Feature augmentation, Parallelized hybridization design: Weighted, Switching, Mixed,
Pipelined hybridization design: Cascade Meta-level, Limitations of hybridization strategies.

Unit V: Evaluating Recommender System: Introduction, General properties of evaluation research,

Evaluation designs: Accuracy, Coverage, confidence, novelty, diversity, scalability, serendipity,
Evaluation on historical datasets, Offline evaluations.

Unit VI: Types of Recommender Systems: Recommender systems in personalized web search,
knowledge-based recommender system, Social tagging recommender systems, Trust-centric
recommendations, Group recommender systems.
Text Books:
1. Jannach D., Zanker M. and FelFering A., Recommender Systems: An Introduction, Cambridge
University Press (2011), 1st ed.
2. Charu C. Aggarwal, Recommender Systems: The Textbook, Springer (2016), 1st ed.
Reference Books:
1. Ricci F., Rokach L., Shapira D., Kantor B.P., Recommender Systems Handbook,
Springer(2011), 1st ed.
2. Manouselis N., Drachsler H., Verbert K., Duval E., Recommender Systems For Learning,
Springer (2013), 1st ed.

MCS305B: Pattern Recognition

Unit I: Introduction: Feature representation, extraction and Pattern Representation. Learning and
adaptation: Concept of Supervised, Unsupervised Classification, Reinforcement learning. Application
Areas. Feature Selection: Data Pre-processing, Data Normalization, Outlier Removal, Missing Data,
Class Separability Measures, Feature-Subset Selection, Bayesian Information Criterion.

Unit II: Supervised Learning: Perceptron Algorithm, Least-Squares Methods, Multilayer Perceptron's,
Decision Trees, Support Vector Machines, Radial Basis Function Networks, Combinations of
Classifiers. Hidden Markov Models (HMM)-evaluation, decoding and learning

Unit III: Bayes Decision Theory: Discriminant Functions and Services, the Normal Distribution,
Bayesian Classification, Estimating Probability Density Functions, Nearest Neighbour Rules, Bayesian
Networks. Performance Analysis, ROC Curves

Unit IV: Unsupervised Classification: Sequential Algorithms, Hierarchical Clustering, Partition Based
Clustering: k-Medoid Algorithms, DB-Scan Clustering, FCM Clustering. Spectral Clustering.

Unit V: Feature Generation: Principal Component Analysis, The Singular Value Decomposition,
Independent Component Analysis, Discrete Fourier Transform, Hadamard Transform, Haar Transform.
Dynamic Time Warping in Speech Recognition, Measures Based on Correlations.
Text Books:
1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2nd Edition, 2016.
2. C.M.Bishop, Pattern Recognition and Machine Learning, Springer, 2006
Reference Books:
1. Theodoridis, S. and K. Koutroumbas, Pattern recognition. 4th Edition. 2009, San
Diego,CA: Academic Press.
2. https://nptel.ac.in/courses/106106046/ by Prof. C.A. Murthy Indian Statistical Institute and
Prof. Sukhendu Das IIT Madras. (MOOC Course)

MCS305C: Knowledge Based AI

Detailed course to be updated

MCS305D: Intelligent Based AI

Detailed course to be updated
 Professional Elective-III

MCS402A: Data Visualization

Unit I: Introduction of visual perception, visual representation of data, Gestalt principles, information
overloads.
Unit II: Creating visual representations, visualization reference model, visual mapping, visual
analytics, Design of visualization applications.
Unit III: Classification of visualization systems, Interaction and visualization techniques misleading,
Visualization of one, two and multi-dimensional data, text and text documents.
Unit IV: Visualization of groups, trees, graphs, clusters, networks, software, Metaphorical
visualization.
Unit V: Visualization of volumetric data, vector fields, processes and simulations, Visualization of
maps, geographic information, GIS systems, collaborative visualizations, evaluating visualizations.
Unit VI: Recent trends in various perception techniques, various visualization techniques, data
structures used in data visualization.

Text Books:
1. WARD, GRINSTEIN, KEIM, Interactive Data Visualization: Foundations, Techniques, and
Applications. Natick : A K Peters, Ltd.
2. E. Tufte, The Visual Display of Quantitative Information, Graphics Press.
Reference Books:
1. Claus O. Wilke, Fundamentals of Data Visualization” to be published with O’Reilly Media, Inc.
(https://serialmentor.com/dataviz/index.html)
2. Ben Jones, Communicating Data with Tableau, O'Reilly Media, Inc, USA.

MCS402B: AI in Speech Processing

Detailed course to be updated

MCS402C: AI and Games

Detailed course to be updated
 Professional Elective-IV

MCS403A: Internet of Things

Unit-I: Introduction- M2M : M2M to IoT-The Vision-Introduction, From M2M to IoT, M2M towards
IoT-the global context, A use case example, Differing Characteristics. M2M to IoT : A Market
Perspective– Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An emerging
industrial structure for IoT, The international driven global value chain and global information
monopolies. M2M to IoT-An Architectural Overview– Building an architecture, Main design principles
and needed capabilities, An IoT architecture outline, standards considerations.

Unit-II: M2M and IoT Technology Fundamentals : Devices and gateways, Local and wide area
networking, Data management, Business processes in IoT, Everything as a Service(XaaS), M2M and
IoT Analytics, Knowledge Management.

Unit-III: IoT Architecture: State of the Art – Introduction, State of the art, Architecture Reference
Model- Introduction, Reference Model and architecture, IoT reference Model

Unit-IV: IoT Reference Architecture : Introduction, Functional View, Information View, Deployment
and Operational View, Other Relevant architectural views. Real-World Design Constraints
Introduction, Technical Design constraints-hardware is popular again, Data representation and
visualization, Interaction and remote control. Industrial Automation- Service-oriented architecture-
based device integration, SOCRADES: realizing the enterprise integrated Web of Things, IMC-
AESOP: from the Web of Things to the Cloud of Things, Commercial Building,

Unit-V: Automation- Introduction :Case study: phase one-commercial building automation today,
Case study: phase two- commercial building automation in the future.

Text Books:
1. Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis Karnouskos, David
Boyle, “From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence”, 1st Edition, Academic Press, 2014.
 2. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-onApproach)”, 1stEdition,
VPT, 2014.
3. Designing the Internet of Things, Wiley Publishers, 2013, ISBN:978-1-118-43062-0.Daniel
Kellmereit,

Reference Books:
1. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, 1st Edition, Apress Publications, 2013.
2. Internet of Things, Architecture, Protocol and Standards” , by Simone Cirani, Gianluigi Ferrari,
Marco Picone and Luca Veltri, Willy Publishers, 2019, ISBN 9781119359678(hardcover)
3. The Silent Intelligence: The Internet of Things”. 2013, ISBN:0989973700
4. https://nptel.ac.in/courses/106105166/ by Prof. Sudip Misra, IIT KGP. (MOOC Course)

MCS403B: Robotics and Intelligent Systems

Detailed course to be updated

MCS403C: Application of AI and Machine Learning in Industries

Detailed course to be updated
 Professional Elective-V

MCS404A: Natural Language Processing

Unit-I: Stages of NLP and ambiguity problem, Words and Transducers (FSA and FST for
Morphological Parsing), Applications such as NLP tasks in syntax, semantics and pragmatics;
Applications such as information extraction, question answering, and machine translation. The problem
of ambiguity. The role of Machine Learning

Unit-II: POS-tagging, POS-tagging perspective, POS tagging and HMM, Hidden Markov models
(Forward and Viterbi algorithm and EM training), POS-tag set, Machine translation, Parsing
algorithms, Probabilistic parsing, Parser Comparison.

Unit-III: Grammar, constituency and dependency, CYK algorithm, Parse tree construction, Semantics,
Word sense disambiguation.

Unit-IV: Knowledge based and supervised WSD, Unsupervised EM based WSD, Multilingual
Resource constrained WSD.

Unit-V: Linear and logistic Regression, Dimensionality Reduction, PCA, Machine translation,
Statistical Machine translation, Binding Theory and Merger, X-Bar theory.

Text Books:
1. Stuart Russel &, Peter Norvig: Artificial Intelligence A Modern Approach (Person Education

Asia.) 3rd Edition.

2. Dan Jurafsky and James H. Martin, Speech and Language Processing, (Pearson Education
Asia) 3rd Edition.
Reference Books:
1. James Allen. (1995). Natural Language Understanding, Pearson.
2. Chris Manning and Hinrich Schuetze. (1999). Foundations of Statistical Natural Language
Processing, MIT Press.
3. Ian Goodfellow, Yoshua Bengio, and Aaron Courville. (2015). Deep Learning, MIT Press.
 MCS404B: Deep Learning

Unit I: Introduction to Deep Learning: Basics: Biological Neuron, Idea of computational units,
McCulloch–Pitts unit and Thresholding logic, Linear Perceptron, Perceptron Learning Algorithm,
Linear separability. Convergence theorem for Perceptron Learning Algorithm.

Unit II: Feedforward Networks: Multilayer Perceptron, Gradient Descent, Backpropagation, Empirical
Risk Minimization, regularization, autoencoders.

Unit III: Convolutional Networks: The Convolution Operation - Variants of the Basic Convolution
Function - Structured Outputs - Data Types - Efficient Convolution Algorithms - Random or
Unsupervised Features- LeNet, AlexNet.

Unit IV: Recurrent Neural Networks: Bidirectional RNNs - Deep Recurrent Networks Recursive
Neural Networks - The Long Short-Term Memory and Other Gated RNNs.

Unit V: Deep Generative Models: Boltzmann Machines - Restricted Boltzmann Machines -

Introduction to MCMC and Gibbs Sampling- gradient computations in RBMs - Deep Belief Networks-
Deep Boltzmann Machines.

Unit VI: Applications: Large-Scale Deep Learning - Computer - Speech Recognition - Natural
Language Processing - Other Applications.

Text Books:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2016.
2. Bengio, Yoshua. "Learning deep architectures for AI." Foundations and trends in Machine
Learning 2.1 (2009): 1127.
3. N.D.Lewis, “Deep Learning Made Easy with R: A Gentle Introduction for Data Science”,
January 2016.
Reference Books:
1. Nikhil Buduma, “Fundamentals of Deep Learning: Designing Next-Generation Machine
Intelligence Algorithms”, O’Reilly Publications.
2. Tariq Rashid, “Make your own neural network “.
 MCS404C: GPU Computing

Unit I: Introduction: History, Graphics Processors, Graphics Processing Units, GPGPUs. Clock
speeds, CPU / GPU comparisons, Heterogeneity, Accelerators, Parallel programming, CUDA OpenCL
/ OpenACC, Hello World Computation Kernels, Launch parameters, Thread hierarchy, Warps /
Wavefronts, Thread blocks / Workgroups, Streaming multiprocessors, 1D / 2D / 3D thread mapping,
Device properties, Simple Programs.

Unit II: Memory: Memory hierarchy, DRAM / global, local / shared, private / local, textures, Constant
Memory, Pointers, Parameter Passing, Arrays and dynamic Memory, Multi-dimensional Arrays,
Memory Allocation, Memory copying across devices, Programs with matrices, Performance evaluation
with different memories.

Unit III: Synchronization: Memory Consistency, Barriers (local versus global), Atomics, Memory
fence. Prefix sum, Reduction. Programs for concurrent Data Structures such as Worklists, Linked-lists.
Synchronization across CPU and GPU Functions: Device functions, Host functions, Kernels functions,
Using libraries (such as Thrust), and developing libraries.

Unit IV: Support: Debugging GPU Programs. Profiling, Profile tools, Performance aspects Streams:
Asynchronous processing, tasks, Task-dependence, Overlapped data transfers, Default Stream,
Synchronization with streams. Events, Event-based-Synchronization - Overlapping data transfer and
kernel execution, pitfalls.

Unit V: Case Studies: Image Processing, Graph algorithms, Simulations, Deep Learning.

Unit VI: Advanced topics: Dynamic parallelism, Unified Virtual Memory, Multi-GPU processing, Peer
access, Heterogeneous processing.

Text Books:
1. Programming Massively Parallel Processors: A Hands-on Approach; David Kirk, Wen-mei
Hwu; Morgan Kaufman; 2010 (ISBN: 978-0123814722).
 2. CUDA Programming: A Developer's Guide to Parallel Computing with GPUs; Shane Cook;
Morgan Kaufman; 2012 (ISBN: 978-0124159334).
References Books:

1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar "Introduction to Parallel
Computing", Second Edition, Addison Wesley, 2003. ISBN: 0-201-64865.
2. S.G.Akl, "The Design and Analysis of Parallel Algorithms", PHI, 1989.
3. F.T.Leighton, "Introduction to Parallel Algorithms and Architectures
4. https://nptel.ac.in/courses/106102163/ AVAILABLE FROM : 08-JUNE-2017, COURSE CO-
ORDINATED BY : Prof. Y Sabharwal , IIT Delhi. (MOOC Course)
5. https://nptel.ac.in/courses/106102114/21, Course Available From : 14-NOV-2013; Course Co-Ordinated
By Dr. Subodh Kumar IIT Delhi. (MOOC Course)
Eligibility for admission to M. Sc. Computer Science with
Specialization Artificial Intelligence and Machine Learning:
1. B. Sc. Computer Science/B.Sc(Hons) Computer Science
2. B. Sc. ITM with Mathematics at +2 level,
3. BCA with Mathematics at +2 level
4. Btech(CSE)/Btech(IT)
5. Bsc(Hons) Data Science
With 50% marks
Examinations: As per University norms for M. Sc. Courses.