Executive M.

Tech in Computer Science & Engineering

SI. No. Course Course Title Instructor
Code
1 CS541 Foundations of Computer Systems Dr.Suman Kumar Maji
2 MA501 Probability, Statistics & Stochastic Processes Dr. Yogesh Mani Tripath
3 Elective-I
4 Elective-II
5 Elective-III
6 CS559 Computer Systems Lab-1 Dr.Suman Kumar Maji

Electives for CSE:

Electives
SI. No. Course Course Title Instructor
Code
1 CS 561 Artificial Intelligence Dr. Asif Ekbal
2 CS 564 Foundation of Machine Learning Dr.Sriparna Saha
3 CS 565 Cloud Computing Dr.Rajiv Misra
4 MA542 Linear Algebra & Optimization Dr.Nutan Kumar Tomar
5 CS501 Database Systems & Data Mining Dr.Chandranath Adak
6 CS 603 Re-enforcement Learning Dr.Sriparna Saha

 CS541 : Foundations of Computer Systems

Review of Concepts of Computer Architecture: Study of an existing CPU: architecture,

instruction set and the addressing modes, assembly language programming. Control unit Design:
instruction interpretation, hardwired and micro-programmed methods of design. Pipelining and
parallel processing, RISC and CISC paradigms, I/O Transfer techniques: programmed, interrupt-
driven and DMA; Memory organization: hierarchical memory systems, cache memories, cache
coherence, virtual memory.

Review of Concepts of Operating Systems: Processes, threads, Unix fork-exec model, Unix
signals, synchronization, Inter process communication, scheduling, memory management.

Review of Concepts of Computer Networks: link layer protocols, local area networks
(Ethernet and variants), routing, transport layer protocols. Concepts of distributed networked
systems: Virtualization, distributed file systems, mass storage systems, recovery and fault
tolerance, content networking including multimedia delivery.

Texts:
1. A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, 7th Ed, John Wiley
and Sons, 2004.
2. J. Kurose and K. W. Ross, Computer Networking: A Top down approach, 3rd Ed, Pearson
India, 2004.
3. M. Singhal and N. Shivratri, Advanced Concepts in Operating Systems, McGraw Hill, 1994.
4. A. S. Tanenbaum and Van Steen, Distributed Systems: Principles and Paradigms, Prentice
Hall India, 2007.
David A Patterson and John L Hennessy, Computer Organisation and Design: The
Hardware/Software Interface, Morgan Kaufmann, 1994. ISBN 1-55860-281-X.
 MA 501 : Probability, Statistics and Stochastic Processes

Algebra of sets, probability spaces, random variables, cumulative distribution functions,

mathematical expectations, conditional probability and expectation, moments and inequalities,
special discrete and continuous probability distributions, function of a random variable, random
vectors and their distributions, convolutions, joint, marginal and conditional distributions,
product moments, independence of random variables, bivariate distributions and properties,
order statistics and their distributions, sampling distributions, Central Limit Theorem, strong
law of large numbers, sequence of random variables, modes of convergence, distributions of the
sample mean and the sample variance for a normal population, chi-square, t and F distributions,
method of moments and maximum likelihood estimation, concepts of unbiasedness, criteria for
choosing estimators, consistency and efficiency of estimates, confidence intervals, pivotal
quantities, confidence intervals for proportions, simple and composite hypothesis, null and
alternative hypotheses, types of error, level and size of tests, the most powerful test and Neyman
- Pearson Fundamental Lemma, tests for one- and two-sample problems for normal populations,
tests for proportions, likelihood ratio tests, chi-sqaure test for goodness of fit. discrete and
continuous stochastic processes, markov chains, transition probability matrix, state spaces,
classification of states, stationary distributions, ergodicity, poisson process, birth and death
process.

References:
(1) Rohatgi, V.K., and Saleh, A.K.Md. Ehsanes (2009).An introduction to probability and
statistics. Second Edition, Wiley India.
(2) Introduction to the Theory of Statistics; Alexander M. Mood, Franklin A. Graybill, Duane C.
Boes, Tata McGraw Hill.
(3) Milton, J.S. and Arnold, J.C. (2009) Introduction to Probability and Statistics, Fourth Edition,
Tata Mcgraw-Hill.
(4) Ross, S.M.(2008) Introduction to Probability Models, Ninth edition, Academis Press.
(5) Statistical Inference (2007), G. Casella and R.L. Berger, Duxbury Advanced Series.

 CS561 : Artificial Intelligence

1. Introduction, Motivation of the course.
2. Problem Solving: Uninformed search, Informed search, local Search, Online search.
3. Knowledge and Reasoning: Propositional and Predicate Calculus, Semantic Nets,
Frames, Scripts, Probabilistic Reasoning.
4. Learning: Introduction to machine learning paradigms: unsupervised, supervised,
reinforcement learning, Naive Bayes, Decision Tree, Fundamental of Neural Networks
and Deep Learning.
5. Evolutionary Computation: Genetic algorithms, Multi objective optimization,
Differential Evolution, Particle Swarm and Ant Colony Optimization.
6. Application Topics: Introduction to NLP, Ethics and Bias in AI

References:
1. S. Russel and P. Norvig. Artificial Intelligence: A Modern Approach (Third Edition),
Prentice Hall, 2009.
2. E. Rich and K. Knight, Artificial Intelligence, Addison Wesley, 1990
3. George Klir, U. St. Clair and B. Yuan, Fuzzy Set Theory: Foundations and
Applications, Prentice Hall, 1997
 4. Ian Goodfellow, Yoshua Bengio and Aaron Courville, Deep Learnng, MIT Press,
2016
5. Daphne Koller and Nir Friedman, Probabilistic Graphical Models: Principles and
Techniques, MIT Press, 2009.

 CS564 : Foundation of Machine Learning

Introduction, Logistic regression, Perceptron, Generative learning algorithm: Support vector

machines,  Model selection and feature selection, Ensemble methods: Bagging, boosting, Random
Forest; Unsupervised learning: Clustering: K-means, EM;  Mixture of Gaussians, Factor analysis,
PCA (Principal components analysis).; Active learning: Theoretical analysis, Committee-based
active learning, Active learning from the crowd; Collaborative filtering: Latent factor-based
models and neighborhood models; Introduction to Graphical Models (HMM, MEMM, CRF), Deep
Learning: CNN, RNN, LSTM, GRU.

Texts:
1. T. Mitchell. Machine Learning. McGraw-Hill, 1997.
2. Christopher Bishop. Pattern recognition and machine learning. Springer Verlag, 2006.
3. Hastie, Tibshirani, Friedman. The elements of Statistical Learning Springer Verlag.
4. Probability, Random Variables and Stochastic processes by Papoulis and Pillai, 4thEdition,
Tata McGraw Hill Edition.
5. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, 198815.

 CS565 : Cloud Computing

Part 1: Introduction to Clouds, Virtualization and Virtual Machine

 Introduction to Cloud Computing: Why Clouds, What is a Cloud, What's new in today's
Clouds, Cloud computing vs. Distributed computing, Utility computing, Features of
today’s Clouds: Massive scale, AAS Classification: HaaS, IaaS, PaaS, SaaS, Data-intensive
Computing, New Cloud Paradigms, Categories of Clouds: Private clouds, Public clouds.
 Virtualization: What’s virtualization, Benefits of Virtualization, Virtualization Models:
Bare metal, Hosted hypervisor.
 Types of Virtualization: Processor virtualization, Memory virtualization, Full
virtualization, Para virtualization, Device virtualization.
Network Virtualization and Geo-distributed Clouds
1. Server Virtualization: Methods of virtualization: Using Docker, Containers, Kubernetes,
Approaches for Networking of VMs: Hardware approach: Single-root I/O virtualization (SR-
IOV), Software approach: Open vSwitch, Mininet and its applications.
2. Software Defined Network: Key ideas of SDN, Evolution of SDN, SDN challenges, Multi-tenant
Data Centers: The challenges, Network virtualization, Case Study: VL2, NVP.
3. Geo-distributed Cloud Data Centers: Inter-Data Center Networking, Datacenter
interconnection techniques: MPLS, Google’s B4 and Microsoft’s Swan.

Part 2: Leader Election in Cloud, Distributed Systems and Industry Systems

 Leader Election in Rings (Classical Distributed Algorithms): LeLann-Chang-Roberts
(LCR) algorithm, The Hirschberg and Sinclair (HS) algorithm.
  Leader Election (Ring LE & Bully LE Algorithm): Leader Election Problem, Ring based
leader election, Bully based leader election, Leader Election in Industry Systems:
Google’s Chubby and Apache Zookeeper.
 Design of Zookeeper: Race condition, Deadlock, Coordination, Zookeeper design goals,
Data model, Zookeeper architecture, Sessions, States, Usecases, Operations, Access
Control List (ACL), Zookeeper applications: Katta, Yahoo! Message Broker.

Classical Distributed Algorithms and the Industry Systems

1. Time and Clock Synchronization in Cloud Data Centers: Synchronization in the cloud, Key
challenges, Clock Skew, Clock Drift, External and Internal clock synchronization,
Christians algorithm, Error bounds, Network time protocol (NTP), Berkley’s algorithm,
Datacenter time protocol (DTP), Logical (or Lamport) ordering, Lamport timestamps,
Vector timestamps.
2. Global State and Snapshot Recording Algorithms: Global state, Issues in Recording a
Global State, Model of Communication, Snapshot algorithm: Chandy-Lamport Algorithm.
3. Distributed Mutual Exclusion: Mutual Exclusion in Cloud, Central algorithm, Ring-based
Mutual Exclusion, Lamport’s algorithm, Ricart-Agrawala’s algorithm, Quorum-based
Mutual Exclusion, Maekawa’s algorithm, Problem of Deadlocks, Handling Deadlocks,
Industry Mutual Exclusion : Chubby.

Consensus, Paxos and Recovery in Clouds

1. Consensus in Cloud Computing and Paxos: Issues in consensus, Consensus in
synchronous and asynchronous system, Paxos Algorithm.

2. Byzantine Agreement: Agreement, Faults, Tolerance, Measuring Reliability and

Performance, SLIs, SLOs, SLAs, TLAs, Byzantine failure, Byzantine Generals Problem,
Lamport-Shostak-Pease Algorithm, Fischer-Lynch-Paterson (FLP) Impossibility.

3. Failures & Recovery Approaches in Distributed Systems: Local checkpoint, Consistent

states, Interaction with outside world, Messages, Domino effect, Problem of Livelock,
Rollback recovery schemes, Checkpointing and Recovery Algorithms: Koo-Toueg
Coordinated Checkpointing Algorithm.

Part 3: Cloud Storage: Key-value stores/NoSQL

 Design of Key-Value Stores: Key-value Abstraction, Key-value/NoSQL Data Model, Design
of Apache Cassandra, Data Placement Strategies, Snitches, Writes, Bloom Filter,
Compaction, Deletes, Read, Membership, CAP Theorem, Eventual Consistency, Consistency
levels in Cassandra, Consistency Solutions.
 Design of HBase: What is HBase, HBase Architecture, Components, Data model, Storage
Hierarchy, Cross-Datacenter Replication, Auto Sharding and Distribution, Bloom Filter,
Fold, Store, and Shift.
P2P Systems and their use in Industry Systems
 Peer to Peer Systems in Cloud Computing: Napster, Gnutella, FastTrack, BitTorrent, DHT,
Chord, Pastry and Kelips.
Cloud Applications: MapReduce, Spark and Apache Kafka

1. MapReduce: Paradigm, Programming Model, Applications, Scheduling, Fault-Tolerance,

Implementation Overview, Examples.
 2. Introduction to Spark: Resilient Distributed Datasets (RDDs), RDD Operations, Spark
applications: Page Rank Algorithm, GraphX, GraphX API, GraphX working.

3. Introduction to Kafka: What is Kafka, Use cases for Kafka, Data model, Architecture, Types
of messaging systems, Importance of brokers.

 MA542 : Linear Algebra & Optimization

 Objective: To introduce students to the various Mathematical Concept to be used in

Machine Learning and Data Science.
 Basic of Linear Algebra: Representation of vectors, linear dependence and
independence vector, Vector space and subspaces, definition, examples and concept of
basis linear transformations, range and null space, matrices associated with linear
transformations, special matrices, matrix and vector norms.
 Matrix Factorizations: LU, PLU, QR, and Cholesky factorizations, direct methods for
solution of linear systems.
 Eigenvalue and least squares problems, eigenvalue and eigenvectors, least square, least
square and minimum normed solutions with applications to data problems, singular
value decomposition, principal component analysis, linear discriminant analysis.
 Basic of optimization, basic concept of calculus, partial derivatives, gradient dimensional
derivatives, gradient dimensional derivatives, Jacobian, Hessian convex sets, convex
function and their properties.
 Optimization: Numerical Optimization Technique for Unconstrained Optimization,
Decorative Free methods, Golden Section Search Method

 CS 501: Database Systems & Data Mining

Data models: entity-relationship, relational model. Query languages: relational algebra,

relational calculus, SQL. Theory of database design: functional dependencies; normal forms: 1NF,
2NF, 3NF, Boyce-Codd NF; decompositions; normalization; Transaction management,
Concurrency control; error recovery; Need for Data Mining Techniques, Data Preprocessing,
Mining Frequent Patterns, Classification, Prediction, Clustering, etc Data Mining: Knowledge
Representation Using Rules, Association and Classification Rules.

Text Books:

1. Abraham Silberschatz, Henry Korth, and S. Sudarshan, Database System Concepts,

McGraw -Hill.
2. Raghu Ramakrishnan, Database Management Systems, WCB/McGraw -Hill.
Jiawei Han, Micheline Kamber and Jian Pei, Data Mining Concepts and Techniques, Morgan
Kaufmann.

 CS603 : Re-enforcement Learning

 Foundations: Machine Learning Techniques, Introduction and Basics of RL, RL

Terminology.
Brush up of Probability concepts - Axioms of probability, concepts of random variables,
PMF, PDFs, CDFs, Expectation.
 Concepts of joint and multiple random variables, joint, conditional and marginal
distributions. Correlation and independence.

 Markov Decision Process: Introduction to Markov decision process (MDP), Markov

property, Markov chains, Markov reward process (MRP).
Introduction to Bellman equations, Bellman expectation equations, optimality of value
functions and policies, Bellman optimality equations.
Markov decision process (MDP), state and action value functions.

 Tabular Methods and Q-networks: Planning through the use of Dynamic Programming
and Monte Carlo; Temporal-Difference learning methods (TD (0), SARSA, Q-Learning).

 Function Approximation Methods: Getting started with the function approximation

methods, Revisiting risk minimization, gradient descent from Machine Learning, Gradient
MC and Semi-gradient TD (0) algorithms.

 Deep Reinforcement Learning: Deep Q-networks (DQN, DDQN, Dueling DQN, Prioritised
Experience Replay).

 Policy Optimization: Introduction to policy-based methods; Vanilla Policy Gradient;

REINFORCE algorithm and stochastic policy search.

 Policy Gradient Theorem: Actor-critic methods (A2C, A3C), Soft Actor-Critic and
constrained optimization methods such as TRPO and PPO.

 Recent Advances and Applications: Model-based Reinforcement Learning and offline

Reinforcement Learning, Alpha-Go and Reinforcement Learning with Human Feedback
(RLHF), Meta-learning, Multi-Agent Reinforcement Learning, Ethics in Reinforcement
Learning.

Texts:
1) "Reinforcement Learning: An Introduction" by Richard S. Sutton and Andrew G.
Barto, The MIT Press (1 January 1998).
2) "Deep Reinforcement Learning Hands-On" by Maxim Lapan, Packt Publishing
Limited (21 June 2018).
3) Algorithms for Reinforcement Learning by Csaba Szepesvari, Morgan and Claypool
Publishers (2010)
4) Deep Reinforcement Learning: Fundamentals, Research and Applications by Hao
Dong, Springer Verlag (2020)