Course Code Course Name Credit

CSC604 Machine Learning 03

Pre-requisite: Data Structures, Basic Probability and Statistics, Algorithms

Course Objectives: The course aims:

1 To introduce Machine learning concepts
2 To develop mathematical concepts required for Machine learning algorithms
3 To understand various Regression techniques
4 To understand Clustering techniques
5 To develop Neural Network based learning models

Course Outcomes:
After successful completion of the course students will be able to:
1 Comprehend basics of Machine Learning
2 Build Mathematical foundation for machine learning
3 Understand various Machine learning models
4 Select suitable Machine learning models for a given problem
5 Build Neural Network based models
6 Apply Dimensionality Reduction techniques

Modul Detailed Content Hours

e
1 Introduction to Machine Learning 6
1.1 Introduction to Machine Learning, Issues in Machine Learning,
Application of Machine Learning, Steps of developing a Machine
Learning Application.
Supervised and Unsupervised Learning: Concepts of Classification,
Clustering and prediction, Training, Testing and validation dataset, cross
validation, overfitting and underfitting of model
Performance Measures: Measuring Quality of model- Confusion Matrix,
Accuracy, Recall, Precision, Specificity, F1 Score, RMSE
2 Mathematical Foundation for ML 5
2.1 System of Linear equations, Norms, Inner products, Length of Vector, Distance
between vectors, Orthogonal vectors
2.2 Symmetric Positive Definite Matrices, Determinant, Trace, Eigenvalues and
vectors, Orthogonal Projections, Diagonalization, SVD and its applications
3 Linear Models 7
3.1 The least-squares method, Multivariate Linear Regression, Regularized
Regression, Using Least-Squares Regression for classification
3.2 Support Vector Machines
4 Clustering 4

4.1 Hebbian Learning rule

 4.2 Expectation -Maximization algorithm for clustering

5 Classification models 10
5.1 Introduction, Fundamental concept, Evolution of Neural Networks, Biological
Neuron, Artificial Neural Networks, NN architecture, McCulloch-Pitts Model.
Designing a simple network, Non-separable patterns, Perceptron model with
Bias. Activation functions, Binary, Bipolar, continuous, Ramp. Limitations of
Perceptron.
5.2 Perceptron Learning Rule. Delta Learning Rule (LMS-Widrow Hoff),
Multi-layer perceptron network. Adjusting weights of hidden layers. Error back
propagation algorithm.
5.3 Logistic regression
6 Dimensionality Reduction 07
6.1 Curse of Dimensionality.
6.2 Feature Selection and Feature Extraction
6.3 Dimensionality Reduction Techniques, Principal Component Analysis.

Textbooks:
1 Nathalie Japkowicz & Mohak Shah, ―Evaluating Learning Algorithms: A
Classification Perspective‖, Cambridge.
2 Marc Peter Deisenroth, Aldo Faisal, Cheng Soon Ong, ―Mathematics for machine learning‖,
3 Samir Roy and Chakraborty, ―Introduction to soft computing‖, Pearson Edition.
4 Ethem Alpaydın, ―Introduction to Machine Learning‖, MIT Press McGraw-Hill Higher
Education
5 Peter Flach, ―Machine Learning‖, Cambridge University Press

References:
1 Tom M. Mitchell, ―Machine Learning‖, McGraw Hill
2 Kevin P. Murphy, ―Machine Learning ― A Probabilistic Perspective‖, MIT Press
3 Stephen Marsland, ―Machine Learning an Algorithmic Perspective‖, CRC Press
4 Shai Shalev-Shwartz, Shai Ben-David, ―Understanding Machine Learning‖, Cambridge
University Press
5 Peter Harrington, ―Machine Learning in Action‖, DreamTech Press

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
when approx. 40% syllabus is completed and second class test when additional40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.
Useful links:

1 NPTEL
2 AI and ML Certification - Enroll in PGP AI ML Courses with Purdue (simplilearn.com)
3 https://www.learndatasci.com/out/coursera-machine-learning/
4 https://www.learndatasci.com/out/google-machine-learning-crash-course/
 Course Code Course Name Credit
CSDLO6012 03
Distributed Computing

Pre-requisite: C Programming

Course Objectives: The course aims:

1 To provide students with contemporary knowledge in distributed systems
2 To equip students with skills to analyze and design distributed applications.
3 To provide master skills to measure the performance of distributed synchronization
algorithms
4 To equip students with skills to availability of resources
5 To provide master skills to distributed file system

Course Outcomes:
1 Demonstrate knowledge of the basic elements and concepts related to distributed system
technologies.
2 Illustrate the middleware technologies that support distributed applications such as RPC, RMI
and Object based middleware.
3 Analyze the various techniques used for clock synchronization and mutual exclusion
4 Demonstrate the concepts of Resource and Process management and synchronization
algorithms
5 Demonstrate the concepts of Consistency and Replication Management

6 Apply the knowledge of Distributed File System to analyze various file systems like NFS,
AFS and the experience in building large-scale distributed applications

Module Detailed Content Hours

1 Introduction to Distributed Systems
1.1 Characterization of Distributed Systems: Issues, Goals, and Types of 06
distributed systems, Distributed System Models, Hardware concepts,
Software Concept.
1.2 Middleware: Models of Middleware, Services offered by middleware, Client
Server model.
2 Communication 06
2.1 Layered Protocols, Interprocess communication (IPC): MPI, Remote Procedure Call
(RPC), Remote Object Invocation, Remote Method Invocation (RMI)
2.2 Message Oriented Communication, Stream Oriented Communication, Group
Communication
3 Synchronization 09
3.1 Clock Synchronization, Physical Clock, Logical Clocks, Election Algorithms,
Mutual Exclusion, Distributed Mutual Exclusion-Classification of Mutual
Exclusion Algorithm, Requirements of Mutual Exclusion Algorithms,
Performance measure.
3.2 Non Token based Algorithms: Lamport Algorithm, Ricart–Agrawala‘s
Algorithm, Maekawa‘s Algorithm
 3.3 Token Based Algorithms: Suzuki-Kasami‘s Broadcast Algorithms, Singhal‘s
Heuristic Algorithm, Raymond‘s Tree.based Algorithm, Comparative
Performance Analysis.
4 Resource and Process Management 06
4.1 Desirable Features of global Scheduling algorithm, Task assignment approach,
Load balancing approach, load sharing approach
4.2 Introduction to process management, process migration, Threads,
Virtualization, Clients, Servers, Code Migration
5 Consistency, Replication and Fault Tolerance 06
5.1 Introduction to replication and consistency, Data-Centric and Client-Centric
Consistency Models, Replica Management
5.2 Fault Tolerance: Introduction, Process resilience, Reliable client-server and group
communication, Recovery
6 Distributed File Systems and Name Services 06
6.1 Introduction and features of DFS, File models, File Accessing models, File-Caching
Schemes, File Replication, Case Study: Distributed File Systems (DSF), Network File
System (NFS), Andrew File System (AFS), HDFS

Textbooks:
1 Andrew S. Tanenbaum and Maarten Van Steen, ―Distributed Systems: Principles and Paradigms,
2nd edition, Pearson Education.
2 George Coulouris, Jean Dollimore, Tim Kindberg, , "Distributed Systems: Concepts and Design",
4th Edition, Pearson Education, 2005.
References:
1 A. S. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second
Edition, Prentice Hall, 2006.
2 M. L. Liu, ―Distributed Computing Principles and Applications‖, Pearson Addison Wesley, 2004.
3 Learn to Master Distributed Computing by ScriptDemics, StarEdu Solutions

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Useful Links
1 https://onlinecourses.nptel.ac.in/noc21_cs87/
2 https://nptel.ac.in/courses/106106168

* Suggestion: Laboratory work based on the above syllabus can be incorporated as a mini project in
CSM601: Mini-Project.