Annexure 9

AMITY SCHOOL OF ENGINEERING & TECHNOLOGY

(Computer Science & Engineering)
Minor Track (CSE Specialization)
Artificial Intelligence and Machine Learning
Semeste Course Name Vacancies Course Subject Credit
r Available Code
I CSA 101 Introduction to 3
Artificial intelligence
and Machine
Learning
II Artificial CSA 201 Mathematical 3
Intelligence Foundations for
and Machine Artificial Intelligence
III Learning CSA 301 Cognitive Science in 3
Artificial Intelligence
CSA 321 Cognitive Science in 1
Artificial Intelligence
Lab
IV CSA 401 Machine Learning 3
Techniques
CSA 421 Machine Learning 1
Techniques Lab
V CSA 501 Neural Networks and 3
Deep Learning
CSA 521 Neural Networks and 1
Deep Learning Lab
VI CSA 601 Artificial Intelligence 3
for Robotics
CSA 621 Artificial Intelligence 1
for Robotics Lab
 Annexure 9
INTRODUCTION TO ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Course Code: CSA 101 Credit Units: 03
Total Hours: 30
Course Objective:

The main purpose of this course is to provide the most fundamental knowledge about Artificial Intelligence and
Machine Learning. It will provide understanding of the basic techniques for building intelligent computer systems
and an understanding of how AI is applied in problems.
Course Contents:
Module I: Introduction: (6 Hours)
Definitions of Artificial Intelligence, AI Problems, Production Systems, State Space Representation, Branches of
Artificial Intelligence, Applications of AI. Heuristic Search Techniques, Problem Reduction.

Module II: Knowledge Representation: (6 Hours)

Knowledge Management, Types of Knowledge, Knowledge Representation, Approaches to Knowledge
Representation, Issues in Knowledge Representation, Knowledge Representation Structures, Expert Systems

Module III: Machine Learning: (6 Hours)

Types of Learning, Types of Problems in Machine Learning, History of Machine Learning, Learning Systems,
Intelligent Agents, Reinforcement Learning, Supervised and Unsupervised Learning, Real-Time Applications of AI
and Machine Learning
Module IV: R Basics: (6 Hours)
Commands and Syntax, Packages and Libraries, Introduction to Data Types, Variables, Operators, Decision Making,
Loops, Functions, Strings, Control structures and Functions
Module V: Working with Data in R: (6 Hours)
Data Structures in R - Vectors, Matrices, Arrays, Lists, Factors, Data Frames, R Data Interfaces, R Charts and
Graphs
Course Outcomes:
At the end of this course, students will learn:
 about Artificial Intelligence and intelligent agents, history of Artificial Intelligence
 Building intelligent agents (search, games, logic, constraint satisfaction problems)
 Machine Learning and its basics
 Applications of AI and ML
Examination Scheme:

Components A CT S/V/Q/HA EE

Weightage (%) 5 15 10 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; A: Attendance

Text & References:

Text:
 Chandra S.S.V, Artificial Intelligence and Machine Learning, Prentice Hall Ind ia Learning Private
Limited; 1 edition (2014)
 Russell, Artificial Intelligence 3e: A Modern Approach, Pearson Education India; 3 edition (2015)
 Mark Gardener, Beginning R: The Statistical Programming Language, Wiley (2013)
References:
 Machine Learning by Saikat Dutt , Subramanian Chandramouli, Pearson Education; First edition (1
October 2018)
 Norman Matloff , The Art of R Programming – A Tour of Statistical Software Design, No Starch Press; 1
edition (5 October 2011)
 Garrett Grolemund, Hands-On Programming with R: Write Your Own Functions and Simulations,
Shroff/O'Reilly; First edition (2014)
 Annexure 9

MATHEMATICAL FOUNDATIONS FOR ARTIFICIAL INTELLIGENCE

Course Code: CSA 201 Credit Units: 03

Total Hours: 30
Course Objective:
The course will introduce students to the fundamental mathematical methods concepts for applications in artificial
intelligence and machine learning. 
 
Course Contents:
Module I: Linear Algebra: (9 Hours)
Floating point arithmetic; inner product; norm and distance (vector norm, distance, matrix norm etc.); clustering
(objective, the k-means algorithm etc.); singular values of a matrix; min-max principle; notion of hyperplanes; half-
planes; Matrix factorizations: LU, Cholesky method, QR, Singular Value Decomposition; Projections; Matrix
diagonalization, matrix triangularization, Gram-Schmidt orthogonalization; iterative methods for large linear
systems; Krylov subspace methods; approximating eigenvalues and eigenvectors.

Module II: Descriptive and Inferential Statistics: (8 Hours)

Data exploration (histograms, bar chart, box and whisker Plot, line graph, scatter plot), Probability distributions,
covariance matrices, Inequalities of statistics, Multivariate Gaussian and weighted least square, linear regression and
logistic regression, Multiple Linear Regression; Sampling: Basic Concept, Types of Sampling Errors and
Precautions, Parameter and Statistic, Sampling Distribution of the mean, Sampling distribution of proportion,
Markov Chains.

Module III: Fuzzy Set Theory: (6 Hours)

Fuzzy Sets : Classical sets vs Fuzzy Sets – Need for fuzzy sets – Definition and Mathematical representations –
Level Sets – Fuzzy functions -  Zadeh’s Extension Principle; Operations on Fuzzy Sets: Operations on [0,1] – Fuzzy
negation, triangular norms, t-conorms, fuzzy implications, Aggregation Operations, Fuzzy Functional Equations.

Module IV: Optimization: (7 Hours)

Fundamentals of Unconstrained Optimization; Necessary and sufficiency conditions for optima; Lagrange
Multipliers, Numerical properties of modified Newton, quasi-Newton, steepest descent for unconstrained
optimization; theory of Constrained Optimization, KKT conditions;

Course Outcomes:
Upon successful completion of this unit, students should be able to:
· Apply the concept of Linear algebra to the Artificial Intelligence.
· Understand the appropriateness of probability theory and need of fuzzy set theory for Artificial
Intelligence.
· Formulate scalable and accurate implementations of the most important optimization algorithms
for Artificial Intelligence.
· Characterize trade-offs between time, data and accuracy for optimization technique.

Examination Scheme:

Components A CT S/V/Q/HA ESE

Weightage (%) 5 15 10 70
A: Attendance, CT: Class Test,:, S/V/Q/HA: Seminar/Viva/Quiz/ Home Assignment, EE: End Semester
Examination;

Text Books & References:

· G. Strang (2016). Introduction to Linear Algebra, Wellesley-Cambridge Press, Fifth edition, USA.
· George J Klir and Bo Yuan, Fuzzy Sets and Fuzzy Logic : Theory and Applications, Prentice Hall NJ,1995.
· Gupta C B, Gupta V - An Introduction to Statistical Methods (Vikas1995, 23rd Edition).
· S. Boyd and L. Vandenberghe(2009). Convex Optimization, Cambridge University Press.
· Montgomery, D. C. and G. C. Runger (2011). Applied Statistics and Probability for Engineers. 5th Edition.
John Wiley & Sons, Inc., NY, USA:
 Annexure 9
· J. Nocedal and S. Wright. Numerical Optimization, Springer Series in Operations Research and Financial
Engineering, 2006
Reference Books:
· Lloyd N. Trefethen and David Bau, III. Numerical linear algebra, SIAM, 1997.
· Edward A. Bender. Mathematical Methods in Artificial Intelligence, IEEE Computer Society Press.

COGNITIVE SCIENCE IN ARTIFICIAL INTELLIGENCE

Course Code: CSA 301 Credit Units: 03

Total Hours: 30

Course Objective:
The course is designed to provide an in-depth appreciation of the central challenges in realizing aspects of human
cognition (with specific focus on language and memory) on machine. It surveys significant breakthroughs in our
understanding till date, and identifies avenues for exploration in future.

Course Contents:
Module I: Introduction: (6 Hours)
Declarative/ logic-based computational cognitive modeling, connectionist models of cognition, Bayesian models of
cognition, a dynamical systems approach to cognition.

Module II: Cognitive Models of Memory and Language: (7 Hours)

Computational models of episodic and semantic memory, modeling psycholinguistics (with emphasis on lexical
semantics), towards deep understanding: modeling the interaction of language, memory and learning.

Module III: Modeling Select Aspects of Cognition: (6 Hours)

Classical models of rationality, symbolic reasoning and decision making; Formal models of inductive generalization,
causality, categorization and similarity; the role of analogy in problem solving,

Module IV: Cognition and Artificial Intelligence: (6 Hours)

Modeling aspects of human cognition on Artificial Intelligence; cognitive architectures such as as ACT-R, SOAR,
OpenCog, CopyCat, Memory Networks;

Module V: Physics of Cognition: (5 Hours)

Quantum Models of Cognition, Models of Emergence inspired by Statistical Physics, Non-linear Dynamics and
Cognition.

Course Outcomes:
At the end of this course, students will demonstrate ability to:
· To apply concepts of classes and objects in real world scenarios.
· Understand Domains of cognitive psychology, Cognitive Neuroscience and Nervous system.
· Understand about Learning.
· Understand about Human intelligence which will include Measurement of intelligence, Artificial
Intelligence, Language, Structure of language, Comprehension of language.
· Learn about Cognitive process, Cognitive biases and Cognitive deficits.

Examination Scheme:

Components A CT S/V/Q/HA EE

Weightage (%) 5 15 10 70
 Annexure 9
CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; A: Attendance
Text & References:
Text:
 Machine Learning. Tom Mitchell. First Edition, McGraw- Hill, 1997.
 Introduction to Machine Learning Edition 2, by Ethem Alpaydin
References:
· The Cambridge Handbook of Computational Psychology, Ron Sun (ed.), Cambridge University Press
(2008)
· The Oxford Handbook of Computational and Mathematical Psychology, Jerome R. Busemeyer, Zheng
Wang, James T.
· Townsend, Ami Eidels (ed.), Oxford University Press (2015)
· Formal Approaches in Categorization, Emmanuel M. Pothos, Andy J. Wills, Cambridge University Press
(2011)
· Quantum Models of Cognition and Decision, Jerome R. Busemeyer, Peter D. Bruza, Cambridge
University Press (2014)
· The Quest for Artificial Intelligence, Nils J. Nilsson, Cambridge University Press (2009)
 Annexure 9

COGNITIVE SCIENCE IN ARTIFICIAL INTELLIGENCE LAB

Course Code: CSA 321 Credit Unit: 01

Total Hours: 20
Course Objective:
R with machine learning is widely used for Data analysis. The main objective of this course is to give you
enough understanding on all the concepts of the R language with Machine Learning

SOFTWARE REQUIREMENTS: R Studio

List of experiments/demonstrations:
1. R Exporting Data to Excel, CSV, SAS, STATA, Text Filereading in data
2. Correlation in R: Pearson & Spearman with Matrix
3. R Aggregate Function: Summarise & Group_by()
4. R Simple, Multiple Linear and Stepwise Regression
5. Decision Tree in R
6. R Random Forest
7. Generalized Linear Model (GLM) in R
8. K-means Clustering
9. Exploratory data analysis
10. Feature Engineering
11. Training and test split
12. Model training with Random Forests, Gradient Boosting, Neural Nets, etc.

Course Outcomes:
Learner will learn
· Advanced data analysis with R
· To build models with R
· To train and test data

Examination Scheme:

IA EE

A PR Practical Major Minor

LR Viva
Based Test Experiment Experiment

5 10 15 35 15 10 10

Note: IA –Internal Assessment, EE- External Exam, A- Attendance PR- Performance, LR – Lab Record, V – Viva.

Text & References:

· Mark Gardener, Beginning R: The Statistical Programming Language, Wiley (2013)
· Norman Matloff , The Art of R Programming – A Tour of Statistical Software Design, No
Starch Press; 1 edition (5 October 2011)
 Annexure 9
· Garrett Grolemund, Hands-On Programming with R: Write Your Own Functions and
Simulations, Shroff/O'Reilly; First edition (2014)
 Annexure 9
MACHINE LEARNING TECHNIQUES

Course Code: CSA 401 Credit Units: 03

Total Hours: 30
Course Objective:
The main objective of the course is to understand the need for machine learning for various problem solving and to
study the various supervised, semi-supervised and unsupervised learning algorithms in machine learning

Module I: Preparing to Model: (6 Hours)

Machine Learning - Perspectives and Issues, Types of data, Exploring structure of data, Data Quality and
Remediation, Data Pre-processing, Selecting a Model, Training a model, Model Representation, Evaluation of
Model

Module II: Feature Engineering: (7 Hours)

Basics of Feature Engineering, Feature Transformation, Feature Subset Selection, Approaches of Feature Selection

Module III: Baysian and Computational Learning: (6 Hours)

Bayes Theorem, Concept Learning – Bayes Optimal Classifier, Naïve Bayes Classifier, Bayesian Belief Network –
EM Algorithm – Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake
Bound Model.

Module IV: Supervised Learning (6 Hours)

Case- Based learning, Classification model, Classification Learning Steps, Common Classification Algorithms,
Regression, Common Regression Algorithms.

Module V: Unsupervised Learning (5 Hours)

Application of Unsupervised learning, Clustering, Types of Clustering, Association Rule, Reinforcement Learning –
Task – Q-Learning – Temporal Difference Learning.

Course Outcomes:
At the end of this course, students will demonstrate ability to:
• Differentiate between supervised, unsupervised, semi-supervised machine learning approaches
• Discuss the decision tree algorithm and indentity and overcome the problem of overfitting
• Discuss and apply the back propagation algorithm and genetic algorithms to various problems
• Apply the Bayesian concepts to machine learning
• Analyse and suggest appropriate machine learning approaches for various types of problems

Examination Scheme:

Components A CT S/V/Q/HA EE

Weightage (%) 5 15 10 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; A: Attendance

Text & References:

Text:
· Machine Learning by Saikat Dutt , Subramanian Chandramouli, Pearson Education; First edition (1
October 2018)
· Chandra S.S.V, Artificial Intelligence and Machine Learning, Prentice Hall India Learning Private Limited;
1 edition (2014)

References:
· Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
· Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and Machine Learning), The
MIT Press 2004.
· Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.
 Annexure 9
· Christopher M. Bishop, Pattern Recognition and Machine Learning.
MACHINE LEARNING TECHNIQUES LAB

Course Code: CSA 421 Credit Unit: 01

Total Hours: 20
Course Objective:
The course objective is to make use of Data sets in implementing the machine learning algorithms and Implement
the machine learning concepts and algorithms in any suitable language of choice.

SOFTWARE REQUIREMENTS: Python GUI

List of experiments/demonstrations:
1 Python in Machine Learning
2 Data Preprocessing
3 Data Analysis
4 Summarizing the Dataset .
5 Training Data
6 Test Data
7 Performance Measures: Bias and Variance
8 PYTHON MACHINE LEARNING – TECHNIQUES. Classification, Regression, Clustering
9 PYTHON MACHINE LEARNING – ALGORITHMS
10 Traffic Congestion Analysis and Predictions

Course Outcomes:
Learner will learn
 Understand the implementation procedures for the machine learning algorithms.
 Design Java/Python programs for various Learning algorithms.
 Apply appropriate data sets to the Machine Learning algorithms.
 Identify and apply Machine Learning algorithms to solve real world problems.

Examination Scheme:

IA EE

A PR Practical Major Minor

LR Viva
Based Test Experiment Experiment

5 10 15 35 15 10 10

Note: IA –Internal Assessment, EE- External Exam, A- Attendance PR- Performance, LR – Lab Record, V – Viva.

Text & References:

Text:
· Machine Learning by Saikat Dutt , Subramanian Chandramouli, Pearson Education; First edition (1
October 2018)
· Chandra S.S.V, Artificial Intelligence and Machine Learning, Prentice Hall India Learning Private
Limited; 1 edition (2014)

References:
· Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
· Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and Machine Learning),
The MIT Press 2004.
· Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.
· Christopher M. Bishop, Pattern Recognition and Machine Learning.
 Annexure 9
NEURAL NETWORKS AND DEEP LEARNING

Course Code: CSA 501 Credit Units: 03

Total Hours: 30
Course Objective:
The main objective of the course is to introduce major deep learning algorithms, the problem settings, and their
applications to solve real world problems.

Course Contents:
Module I: Introduction: (6 Hours)
Various paradigms of learning problems, Perspectives and Issues in deep learning framework, review of
fundamental learning techniques.

Module II: Artificial Neural Network: (6 Hours)

Artificial Neural Network, Basics of ANN, Activation Functions, Architectures of Neural Network. Learning
Process in ANN, Error functions, Back Propagation Neural network.

Module III: (6 Hours)

Speech Recognition, Probabilistic Neural Networks, Convolutional Neural Network, Recurrent Neural Network.

Module IV: Deep Learning: (6 Hours)

Deep Feed Forward network, regularizations, training deep models, dropouts,, Deep Belief Network, Limitations of
Deep Learning.

Module V: Deep Learning Research and Tools: (6 Hours)

Object recognition, sparse coding, computer vision, natural language processing, Deep Learning Tools: Caffe,
Theano, Torch.

Course Outcomes:
At the end of this course, students will demonstrate ability to:
· Identify the deep learning algorithms which are more appropriate for various types of learning tasks in
various domains.
· Implement deep learning algorithms and solve real-world problems.

Examination Scheme:

Components A CT S/V/Q/HA EE
Weightage (%) 5 15 10 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; A: Attendance

Text & References:

Text:
· Machine Learning by Saikat Dutt , Subramanian Chandramouli, Pearson Education; First edition (1
October 2018)
· Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016..
· Bishop, C. ,M., Pattern Recognition and Machine Learning, Springer, 2006.

References:
· Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
· Golub, G.,H., and Van Loan,C.,F., Matrix Computations, JHU Press,2013.
· Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education, 2004.
 Annexure 9
NEURAL NETWORKS AND DEEP LEARNING LAB

Course Code: CSA 521 Credit Unit: 01

Total Hours: 20
Course Objective:
The course objective is to understand major deep learning algorithms.

SOFTWARE REQUIREMENTS: R Studio

List of experiments/demonstrations:
· Introductory session on neural network tools
· Neural Network with Python
· Implementing, training, and evaluating neural networks
· Image Classification with Deep Convolutional Networks
· Feedforward Networks for Handwritten Digit Recognition
· Deep Feedforward Networks.
· Recurrent and Recursive Networks.
· Convolutional Networks.
· R Adversarial Learning.

Course Outcomes:
Learner will learn
· Identify the deep learning algorithms which are more appropriate for various types of learning tasks in
various domains.
· Implement deep learning algorithms and solve real-world problems.

Examination Scheme:

IA EE

A PR Practical Major Minor

LR Viva
Based Test Experiment Experiment

5 10 15 35 15 10 10

Note: IA –Internal Assessment, EE- External Exam, A- Attendance PR- Performance, LR – Lab Record, V – Viva.

Text & References:

Text:
· Machine Learning by Saikat Dutt , Subramanian Chandramouli, Pearson Education; First edition (1
October 2018)
· Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016..
· Bishop, C., M., Pattern Recognition and Machine Learning, Springer, 2006.
References:
· Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
· Golub, G.,H., and Van Loan,C.,F., Matrix Computations, JHU Press,2013.
· Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education, 2004.
 Annexure 9
ARTIFICIAL INTELLIGENCE FOR ROBOTICS

Course Code: CSA 601 Credit Units: 03

Total Hours: 30
Course Objective:
The main objective is to teach basic methods in Artificial Intelligence, including: probabilistic inference, planning
and search, localization, tracking and control, all with a focus on robotics.

Course Contents:
Module I: Introduction: (6 Hours)
Robotics, Components of Robot,Robotic Paradigms, History of Robotics,Representative Architectures, Advantages
and Disadvantages

Module II: Reactive Paradigm: (6 Hours)

Prception in Behaviors, Schema Theory, Attributes of Reactive Paradigm, Potential Fields Methodologies,
Evaluation of Reactive Architectures

Module III: Designing a Reactive: Implementation: (6 Hours)

Behaviors as Objects in OOP, Steps in Designing a Reactive Behavioral System, Finite state automata

Module IV: Common Sensing Techniques for Reactive Robots: (6 Hours)

Logical sensors, Designing a sensor suite, Proprioceptive Sensors, Proximity Sensors, Computer Vision, CCD
Camera, Range From Vision, Laser Ranging

Module V: Navigation: (6 Hours)

Topological Path Planning, Metric Path Planning, Localization and Map Making, Applications and Expectations of
Robotics.

Course Outcomes:
At the end of this course, students will learn:
· Basic techniques in artificial intelligence, including probabilistic inference, planning and search algorithms,
localization, tracking, and PID control, all with a focus on robotics.
· To program all the major systems of a robotics.

Examination Scheme:

Components A CT S/V/Q/HA EE

Weightage (%) 5 15 10 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; A: Attendance

Text & References:

Text:
· Robin R. Murphy, Introduction to AI Robotics 2e (Intelligent Robotics and Autonomous Agents series),
MIT Press; 1st edition (9 January 2001)
References:
· Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
· Golub, G.,H., and Van Loan,C.,F., Matrix Computations, JHU Press,2013.
· Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education, 2004.
 Annexure 9
ARTIFICIAL INTELLIGENCE FOR ROBOTICS LAB

Course Code: CSA 621 Credit Unit: 01

Total Hours: 20
Course Objective:
To expose students to Mathematical tools like Matlab and To introduce different types of robotics and demonstrate
them to identify different parts and components.

SOFTWARE REQUIREMENTS: Matlab, Robotic OS

List of experiments/demonstrations:
1. Determination of maximum and minimum position of links.
2. Verification of transformation (Position and orientation) with respect to gripper and world coordinate
system
3. Estimation of accuracy, repeatability and resolution.
4. Robot programming and simulation for pick and place
5. Robot programming and simulation for Colour identification
6. Robot programming and simulation for Shape identification
7. Robot programming and simulation for machining (cutting, welding)
8. Robot programming and simulation for writing practice
9. Robot programming and simulation for any industrial process ( Packaging, Assembly)
10. Robot programming and simulation for multi process.
11. Modeling of problems related to kinematics and dynamics of robot using MATLAB

Course Outcomes:
Learner will learn
· Basics of matlab,
· Use of any robotic simulation software to model the different types of robots and calculate work volume for
different robots

Examination Scheme:
IA EE

A PR Practical Major Minor

LR Viva
Based Test Experiment Experiment

5 10 15 35 15 10 10

Note: IA –Internal Assessment, EE- External Exam, A- Attendance PR- Performance, LR – Lab Record, V – Viva.

Text & References:

Text:
· Robin R. Murphy, Introduction to AI Robotics 2e (Intelligent Robotics and Autonomous Agents series),
MIT Press; 1st edition (9 January 2001)
References:
· Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
· Golub, G.,H., and Van Loan,C.,F., Matrix Computations, JHU Press,2013.
· Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education, 2004.