M Sc ARTIFICIAL INTELLIGENCE PATTERN

Course Details Scheme of Exams

Course
Sem. Course Code Title of the Course Hours Credits CIA SEM Final
Code

25PAI1CC01 Core Course - 1: Artificial Intelligence and Expert Systems 6 5 100 100 100
25PAI1CC02 CC Core Course - 2: Python Programming 6 4 100 100 100
25PAI1CC03 Major Core Course - 3: Big Data Analytics 5 4 100 100 100
25PAI1CP01 Core Practical - 1: Python Programming 3 2 100 100 100
25PAI1ES01A Discipline Specific Elective - 1: Mathematical Foundations
DSE Discipline Specific Elective - 1: Design and Analysis of 4 3 100 100 100
25PAI1ES01B
1 Algorithms
25PAI1AE01 AEC Ability Enhancement Course: Algorithm Lab using C++ 2 1 100 - 100
25PAI1OE01 OE Open Elective (WS): Neural Networks and Fuzzy Logic 4 2 100 100 100
25PEH1SL01 SL Global Citizenship Education (Online) - 1
Extra Credit Courses - (3)
Total 30 22 (3)
25PAI2CC04 Core Course - 4: Machine Learning 6 4 100 100 100
Core Course - 5: Internship Embedded Course:
25PAI2CC05 5 4 100 100 100
CC Data Base Systems
25PAI2CC06 Major Core Course - 6: Internet of Things 5 4 100 100 100

25PAI2CP02 Core Practical - 2: Machine Learning 3 2 100 100 100

2 25PAI2CP03 Core Practical - 3: RDBMS 3 2 100 100 100
25PAI2OE02 OE Open Elective (BS): Cyber Security 4 2 100 100 100
25PSS2SS01 SS Soft Skills 4 2 100 - 100
25PAI2SL02 SL Online Courses: NPTEL/SWAYAM - 2
Extra Credit Courses - (3)
Total 30 22 (3)
25PAI3CC07 Core Course - 7: Natural Language Processing 6 4 100 100 100
25PAI3CC08 Core Course - 8: Advanced Web Technology 5 4 100 100 100
CC
25PAI3CC09 Core Course - 9: Optimization Techniques 5 4 100 100 100
Major
25PAI3CP04 Core Practical - 4: Natural Language Processing 3 2 100 100 100
25PAI3CP05 Core Practical -5: Advanced Web Technology 3 2 100 100 100
25PAI3ES02A Discipline Specific Elective -2: Deep Learning
3
DSE Discipline Specific Elective -2: 4 3 100 100 100
25PAI3ES02B
Distributed Operating Systems
25PAI3RM01 RM Research Methodology 4 2 100 100 100
25PAI3SL03 SL Self - Learning: R Programming - 1 100 - 100
Extra Credit Courses - (3)
Total 30 22 (3)
CC
25PAI4CC10 Core Course - 10: Pattern Recognition and Image Analysis # 6 5 100 100 100
Major
Discipline Specific Elective - 3: Cryptography and
25PAI4ES03A
DSE Network Security # 4 3 100 100 100
25PAI4ES03B Discipline Specific Elective - 3: Virtual Reality #
4
25PAI4PW01 PW Project Work and Viva Voce 20 12 100 100 100
25PAI4CE01 CE Comprehensive Examination* - 2 50 50 50
Extra Credit Courses - (3)
Total 30 22 (3)
1 - 4 25PCW4OR01 OR Outreach Programme - 4
Total (2years) 120 92 (12)
*- for grade calculation 50 marks are converted into 100 in the mark statements
# Blended mode of learning

73
 Semester Course Code Title of the Course Hours/Week Credits
Core Course - 1: Artificial Intelligence
1 25PAI1CC01 6 5
and Expert Systems

Course Objectives
To understand the basics of Artificial Intelligence.
To explore various search algorithms and their problem-solving abilities.
To develop skills in using First-order Logic and PROLOG for problem-solving.
To assess the reliability of reasoning systems in handling uncertainty.
To evaluate the effectiveness of expert systems in addressing real-world problems.
UNIT I: Fundamentals of Artificial Intelligence (18 Hours)
Introduction to A. I. Representation - Non-AI & AI Techniques - Representation of Knowledge -
Knowledge Base Systems - State Space Search - Production Systems - Problem Characteristics - types
of production systems - Intelligent Agents and Environments - concept of rationality - the nature of
environments - structure of agents - problem solving agents - problem formulation
UNIT II: Search Strategies (18 Hours)
Uninformed Search: Formulation of real-world problems - Breadth First Search - Depth First Search -
Depth Limited Search - Iterative Deepening Depth First Search - Bidirectional Search - Comparison of
Uninformed Search Strategies. Informed Search: Generate & test - Hill Climbing - Best First Search -
A* and AO* Algorithm - Constraint satisfaction - Game playing: Minimax Search - Alpha-Beta Cutoffs
- Waiting for Quiescence.
UNIT III: Knowledge Representation (18 Hours)
Knowledge based agents - Wumpus world. Propositional Logic: Representation - Inference - Reasoning
Patterns - Resolution - Forward and Backward Chaining. First order Logic: Representation - Inference -
Reasoning Patterns - Resolution - Forward and Backward Chaining. Basics of PROLOG:
Representation - Structure - Backtracking.
UNIT IV: Non-Monotonic Reasoning (18 Hours)
Logics for Non-Monotonic Reasoning - Semantic Nets - Statistical Reasoning - Fuzzy logic: fuzzy set
definition and types - membership function - designing a fuzzy set for a given application. Probability
and Bayes’ theorem - Bayesian Networks.
UNIT V: Expert Systems (18 Hours)
Architecture of expert systems - Role of expert systems – Knowledge Acquisition – Meta knowledge -
Heuristics. Typical expert systems – Mycin – Prospector.
Teaching Methodology Lecture-based instruction - Project-based learning – Discovery Learning
Assessment Methods MCQ Test, Seminar, Assignment Writing, Problem Solving.

Books for Study

1. Rich, E. K. & Nair, S. B. (2008). Artificial Intelligence, (3rd Ed.). Tata McGraw Hill.
2. Russell, S. & Norvig, P. (2003). Artificial Intelligence: A Modern Approach. (3rd Ed.). Pearson
Education.
3. Waterman, D. A. (1986). A Guide to Expert Systems. (3rd Ed.). Addison Wesley Publishing
Company.
Books for Reference
1. Bratko, I. (1986). Prolog Programming for Artificial Intelligence. (2nd Ed.). Addison Wesley.
2. Charniak, E. & McDermott, D. (1985). Introduction to Artificial Intelligence. Addison Wesley.
3. Patterson, D. W. (1992). Introduction to Artificial Intelligence and Expert Systems. Prentice-Hall
of India.
4. Nilsson, N. J. (1980). Principles of Artificial Intelligence. Morgan Kaufmann.
74
 5. Townsend, C (1989). Introduction to Turbo Prolog. Sybex.

Websites and eLearning Sources

1. https://www.kaggle.com/learn/ai-expert-systems
2. https://www.ibm.com/watson
3. https://www.deeplearning.ai

Course Outcomes
CO-Statements Cognitive
Levels
CO No. On successful completion of this course, students will be able to (K-Level)
CO1 define the fundamental concepts of artificial intelligence. K1
CO2 explain the workings of different uninformed search algorithms. K2
CO3 develop solutions using first-order logic and prolog for problem-solving. K3
CO4 analyze the reliability and accuracy of reasoning systems. K4
CO5 evaluate the effectiveness of expert systems in solving complex real-world problems K5
create innovative expert systems by integrating advanced knowledge acquisition
CO6 K6
techniques.

Relationship Matrix
Semester Course Code Title of the Course Hours Credits
1 25PAI1CC01 Core Course - 1: Artificial Intelligence and Expert Systems 6 5
Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean
Course Score of
Outcomes COs
PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1 3 3 3 2 1 3 3 3 2 1 2.4
CO2 2 2 3 2 2 2 2 3 2 2 2.2
CO3 3 2 3 2 2 3 2 3 2 2 2.4
CO4 3 2 2 2 2 3 2 2 2 2 2.2
CO5 2 3 3 2 1 2 3 3 2 1 2.2
CO6 2 3 3 2 1 2 3 3 2 1 2.2
Mean Overall Score 2.3 (High)

75
 Semester Course Code Title of the Course Hours/Week Credits
1 25PAI1CC02 Core Course - 2: Python Programming 6 4

Course Objectives
To understanding of fundamental data types, operations, functions, modules, packages and built-in
modules in Python.
To apply Regular Expression Modifiers, creating tables and connecting to databases.
To acquire skills on NumPy and effectively working with NumPy structured arrays.
To import data manipulation skills using Pandas and perform vectorized string operations.
To enhance data visualizing skills using Matplotlib and Seaborn.
UNIT I: Introduction to Python (18 Hours)
Features of Python - Data Types and Operations: Numbers-Strings-List-Tuple-Set-Dictionary.
Functions: Function Definition –Function Calling –Function Arguments-Anonymous Functions.
Modules and Packages: Built-in Modules - Creating Modules - import Statement – Locating Modules -
Namespaces and Scope - dir () function - reload() function - Packages in Python –Date and Time
Modules.
UNIT II: Regular Expressions and Database Programming (18 Hours)
Match () function - search () function - Search and Replace - Regular Expression Modifiers: Option
Flags-Regular Expression Patterns - findall() method-compile() method. Database Programming:
Connecting to a Database–Creating Tables–Insert, Update, Delete and Read Operation– Disconnecting
from a Database.
UNIT III: Numpy (18 Hours)
Introduction to Numpy-Basics of NumPy Array–Computation on NumPy Array – Aggregations –
Broadcasting – Comparisons, Masks and Boolean Logic– Sorting Arrays – NumPy Structured Array.
UNIT IV: Pandas (18 Hours)
Data Manipulation with Pandas: Introducing Panda Objects – Data Indexing and Selection -Operating
Data on Pandas – Handling Missing Data – Hierarchical Indexing –Combining Data Sets– Vectorized
String Operations– Working with Time Series.
UNIT V: Matplotlib (18 Hours)
Visualization with Matplotlib: Simple Line Plots–Simple Scatter Plots-Density and Contour Plots–
Histograms, Binnings and Density–Customizing Plot Legends –Customising Colorbars–Multiple
Subplots–Textand Annotation–Three Dimension Plottingin Matplotlib–Geographic Data with Base
Map– Visualization with Seaborn.

Lecture-based instruction, Demonstration, Group Discussion, Peer

Teaching Methodology
Learning, Problems solving, and Project-based learning,
Assessment Methods MCQ Test, Seminar, Assignment Writing, Problem Solving
Books for Study
1. Jose, J. & Lal, S. P. (2016). Introduction to Computing and Problem Solving with PYTHON.
Khanna Book Publishing Co. (P) Ltd.
2. Vanderplas, J. (2016). Python Data Science Handbook: Essential Tools for Working with Data
(1sted.). O'Reilly Media.
Books for Reference
1. Chun, W. (2006). Core Python Programming (2nd ed.). Prentice Hall Publication.
2. Budd, T. A. (2011). Exploring Python. Tata McGraw Hill.
3. Boschetti, A. & Massaron, L. (2018). Python Data Science Essentials (3rd ed.). Packet
Publishing.

76
Websites and eLearning Sources
1. https://realpython.com/
2. https://towardsdatascience.com/
3. https://jupyter.org/
4. https://pandas.pydata.org/pandas-docs/stable/

Course Outcomes
CO-Statements Cognitive
CO No. Levels
On successful completion of this course, students will be able to (K-Level)
acquire knowledge about various programming constructs and libraries like
CO1 K1
Numpy, Pandas and Matplotlib used for data analysis in Python.
explain the basic concepts of object-oriented & procedural programming and
CO2 concepts used in various data analysis libraries like Numpy, Pandas and K2
Matplotlib available in Python.
apply core Python concepts to write simple programs and various libraries
CO3 like Numpy, Pandas and Matplotlib used in Python for performing data K3
analysis.
discover how to implement core python concepts in various domains and
CO4 K4
data analysis using various libraries like Numpy, Pandas and Matplotlib.
assess simple Python applications to perform data analysis using various
CO5 K5
libraries.
develop Python applications and perform data analysis using various
CO6 K6
libraries like Numpy, Pandas and Matplotlib.

Relationship Matrix
Semester Course Code Title of the Course Hours Credits
1 25PAI1CC02 Core Course - 2: Python Programming 6 4
Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean
Course
Score of
Outcomes PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 2 2 1 3 3 2 2 2 2.3
CO2 3 3 2 2 1 3 3 3 2 3 2.5
CO3 3 3 2 2 1 3 3 2 2 3 2.4
CO4 3 3 3 2 1 3 3 3 2 3 2.6
CO5 3 3 3 2 1 3 3 3 2 3 2.6
CO6 3 3 3 2 1 3 3 3 2 3 2.6
Mean Overall Score 2.5 (High)

77
 Semester Course Code Title of the Course Hours/Week Credits
1 25PAI1CC03 Core Course - 3: Big Data Analytics 5 4

Course Objectives
To understand the fundamentals of big data analytics, data structures, and the analyst's perspective
on data repositories.
To develop proficiency in basic data analytic methods using R, descriptive statistics, exploratory
data analysis, and statistical methods of evaluation.
To explore advanced analytical theory and methods, such as clustering, association rules, and
regression.
To learn classification techniques, including decision trees, naive Bayes, and time series analysis,
to categorize and predict outcomes in diverse datasets.
To familiarize with advanced analytics technology and tools, including MapReduce, Hadoop, and
SQL essentials.
UNIT I: Introduction to Big Data Analytics (15 Hours)
Introduction to Big Data Analytics: Big Data Overview – Data Structures – Analyst Perspective on Data
Repositories - State of the Practice in Analytics – BI Versus Data Science - Current Analytical
Architecture – Drivers of Big Data – Big Data Ecosystem - Data Analytics Lifecycle – Data Discovery
– Data Preparation – Model Planning – Model Building – Communicate Results – Operationalize.
UNIT II: Data Analytic Methods (15 Hours)
Basic Data Analytic Methods Using R : Introduction to R programming – R Graphical User Interfaces –
Data Import and Export Attribute and Data Types – Descriptive Statistics Exploratory Data Analysis:
Visualization Before Analysis – Dirty Data – Visualizing a Single Variable – Examining Multiple
Variables Data Exploration Versus Presentation – Statistical Methods of Evaluation: Hypothesis Testing
– Difference of Means – Wilcoxon Rank-Sum Test – Type I and Type II Errors – Power and Sample
Size – ANOVA.
UNIT III: Advanced Methods (15 Hours)
Advanced Analytical Theory and Methods: Clustering – K Means – Use Cases – Overview –
Determining number of clusters – Diagnostics Reasons to choose and cautions – Additional Algorithms
- Association Rules: A Priori Algorithm – Evaluation of Candidate Rules Applications of Association
Rules – Validation and Testing – Diagnostics. Regression: Linear Regression and Logistic Regression:
Use cases – Model Description – Diagnostics - Additional Regression Models.
UNIT IV: Classification Techniques (15 Hours)
Classification: Decision Trees – Overview – Genetic Algorithm – Decision Tree Algorithms –
Evaluating Decision Tree – Decision Trees in R - Naive Bayes – Bayes Theorem – Naïve Bayes
Classifier – Smoothing – Diagnostics – Naïve Bayes in R – Diagnostics of Classifiers – Additional
Classification Methods - Time Series Analysis: Overview – Box–Jenkins Methodology – ARIMA Model
– Auto correlation Function – Autoregressive Models – Moving Average Models – ARMA and ARIMA
Models–Building and Evaluating and ARIMA Model – Text Analysis: Text Analysis Steps – Example
– Collecting – Representing Term Frequency – Categorizing – Determining Sentiments – Gaining
Insights.
UNIT V: Distributed Technology (15 Hours)
Advanced Analytics-Technology and Tools: MapReduce and Hadoop: Analytics for Unstructured Data
- Use Cases - MapReduce - Apache Hadoop – The Hadoop Ecosystem – pig – Hive – Hbase – Mahout
– NoSQL - Tools in Database Analytics: SQL Essentials – Joins – Set operations – Grouping Extensions
– In Database Text Analysis - Advanced SQL – Windows Functions – User Defined Functions and
Aggregates – ordered aggregates- MADLib – Analytics Reports Consolidation – Communicating and
operationalizing and Analytics Project – Creating the Final Deliverables: Developing Core Material for
Multiple Audiences – Project Goals – Main Findings – Approach Model Description – Key points
support with Data - Model details – Recommendations – Data Visualization
78
 Teaching Methodology Lecture-based instruction, technology-based learning, group
learning, individual learning, inquiry-based learning
Assessment Methods MCQ Test, Seminar, Assignment Writing, Problem Solving
Books for Study
1. John. (2015). Data Science & Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data. Wiley & Sons
2. Burlingame, N. (2012). The little book on Big Data. New Street Communications, LLC.
3. Maheshwari, A. (2017). Data Analytics, (1st Ed.). McGraw Hill Education
Books for Reference
1. Loshin, D. (2013). Big Data Analytics: From Strategic Planning to Enterprise Integration with
Tools, Techniques, NoSQL, and Graph. Morgan Kaufman.
2. Baesens, B. (2015). Analytics in a Big Data World: The Essential Guide to Data Science and
its Applications. Wiley Publishers.
3. Jannach, D. & Zanker, M. (2010). Recommender Systems: An Introduction. Cambridge
University Press.
4. Kim, H. P. & Dunnigan, R. (2015). Big Data Analytics: A Practical Guide for Managers. CRC
Press.
Website and eLearning Source
1. https://www.turing.com/resources/big-data-analytics
Course Outcomes
CO-Statements Cognitive
CO No. Levels
On successful completion of this course, students will be able to (K-Level)
CO1 recall the foundational concepts and principles of big data analytics. K1
demonstrate proficiency in utilizing R programming for basic data analysis
CO2 tasks, such as performing descriptive statistics, and conducting exploratory K2
data analysis.
apply advanced analytical theories and methodologies, to analyze complex
CO3 K3
datasets and extract meaningful insights.
analyze and interpret data using classification techniques, to effectively
CO4 K4
categorize and predict outcomes in various domains.
design and implement advanced analytics solutions using technologies to
CO5 K5
efficiently process and analyze large-scale datasets in real-world scenarios.
evaluate the effectiveness and efficiency of different analytical approaches
CO6 K6
and technologies in addressing specific big data challenges.

Relationship Matrix
Semester Course Code Title of the Course Hours Credits
1 25PAI1CC03 Core Course - 3: Big Data Analytics 5 4
Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean
Course
Score of
Outcomes PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 3 2 1 3 2 3 2 3 2.5
CO2 2 3 3 2 2 2 3 2 1 3 2.3
CO3 3 2 3 2 2 3 2 2 2 2 2.3
CO4 3 3 2 2 2 3 3 3 2 3 2.6
CO5 2 3 3 2 1 3 3 2 2 3 2.4
CO6 2 3 3 2 1 3 3 2 2 3 2.4
Mean Overall Score 2.42 (High)

79
Semester Course Code Title of the Course Hours/Week Credits
Core Practical - 1: Python
1 25PAI1CP01 3 2
Programming

List of Exercises
Basic Python Programs
1. Flow controls, Functions and String Manipulation
2. Operations on Tuples and Lists
3. Operations on Sets and Dictionary
4. Regular Expressions
5. Database Operations
Data Analysis – NumPy
6. NumPy Arrays,
7. Sorting and Searching on Arrays
Data Analysis - Pandas
8. Data Series
9. Data Frame
10. Combining and Merging Data Sets
11. Handling Missing Values, Filter, Grouping and Aggregation
Visualization – MatplotLib & Seaborn
12. MatPlotLib – Line Chart, Scatter Plot, Histogram
13. Seaborn – Boxplot, HeatMap

80
Semester Course Code Title of the Course Hours/Week Credits
Discipline Specific Elective - 1:
1 25PAI1ES01A 4 3
Mathematical Foundations

Course Objectives
To understand fundamental concepts of set theory.
To study the basic properties of matrices and its manipulations.
To develop the knowledge of graph theory.
To understand different the basic descriptive statistics.
To apply numerical techniques and solve problems.
UNIT I: (12 Hours)
Set Theory: Basic concepts of set theory: Notation – Inclusion of equality of sets – Power set –
Operation on sets – Venn diagrams. Relations and ordering: Cartesian products - Relations –
Properties of Binary Relation in a set – Relation matrix and graph – Equivalence relations –
Composition of Binary Relations. Functions: Definition and Introduction – Composition of
functions – Inverse function.
UNIT II: (12 Hours)
Matrices: Introduction – Vectors – Methods of Testing Linear Dependence – Consistency of a
System of Linear Algebraic Equation –Rank of the Matrix –Inverse of the Matrix- Eigen Values
and Eigen Vectors – Cayley Hamilton Theorem.
UNIT III: (12 Hours)
Graph Theory: Basic terminology: Different types of graphs – Directed and Undirected – Simple
– Pseudo – Complete – Regular – Bipartite – Incidence and Degree – Pendant and Isolated Vertex
– Null Graph – Isomorphism – Sub Graphs – Walk – Path and Circuit – Connected and Disconnected
Graphs and Components - Planar graphs - Euler's formula - Operations on Graphs – Matrix
representation of Graphs – Incidence Matrix – Path matrix -Adjacency Matrix
UNIT IV: (12 Hours)
Statistics: Measure of Central Tendency (Arithmetic Mean, Median, Mode) - Measure of
Dispersion (Absolute and Relative Measures Range - Quartile Deviation - Mean Deviation - Standard
Deviation and Coefficient of Variation). Correlation: Definition - Scatter diagram - Karl Pearson's
coefficient of correlation - Numerical problems for determination of Correlation Coefficients.
UNIT V: (12 Hours)
Numerical Methods: Basics – Errors - Significant Digits – Solving Simultaneous Linear Equations
– Bisection Method -Regular Falsi Method – Newton Raphson Method – Gauss Elimination Method
– Gauss Jordan Method – Jacobi Iteration Method – Gauss Seidal Method.

lecture-based instruction, technology-based learning, group learning,

Teaching Methodology individual learning, inquiry-based learning
Assessment Methods MCQ Test, Seminar, Assignment Writing, Problem Solving

Books for Study

1. J.P Trembley, R. Manohar. (2017). Discrete Mathematical structures with
applications to
Computer Science. Tata McGraw Hill.
2. Lipschutz, S. & Lipson, M. L. (2002). Discrete Mathematics. (Revised 3rd Ed.).
Schaum’s Outline Series. Tata McGraw Hill Publications.
3. Grewal, B. S. (2018). Numerical methods in Engineering & Science. (5th Ed.).
Khanna Publishers.

81
Books for Reference
1. Santha, S. (2015). Discrete Mathematics with Combinatory and Graph Theory. (3rd
Ed.). Cengage Publications.
2. Arumugam, S. & Isaac, A. T. (2018). Statistics. New Gamma Publishing House.
3. Gupta, S. C. (2018). Fundamentals of Statistics. Himalaya Publishing House.
Websites and eLearning Sources
1. https://www.geeksforgeeks.org/set-theory/
2. https://www.geeksforgeeks.org/matrices/
3. https://www.geeksforgeeks.org/fundamentals-of-graph-
4. theory/https://www.datasciencecentral.com/best-resources-to-learn-statistics-for-free/
5. https://ocw.mit.edu/courses/18-335j-introduction-to-numerical-methods-spring-2019/
6. https://web.stanford.edu/class/archive/cs/cs103/cs103.1184/notes/Mathematical%20Foundat
ion

Course Outcomes
CO No. CO-Statements Cognitive
Levels
On successful completion of this course, students will be able to (K-Level)
recall key concepts of set theory, matrix operations, graph theory, statistics, and
CO1 K1
numerical methods for computer science applications.
demonstrate the ability to perform matrix operations, analyze graphs, compute
CO2 K2
statistical measures, and apply numerical methods to solve mathematical problems
apply set theory principles, matrix techniques, graph algorithms, statistical methods,
CO3 K3
and numerical algorithms to solve real-world problems in computer science.
apply set theory principles, matrix techniques, graph algorithms, statistical methods,
CO4 K4
and numerical algorithms to solve real-world problems in computer science.
design algorithms, data structures, and mathematical models using set theory, matrix
CO5 operations, graph theory, statistics, and numerical methods to address specific K5
computational problems.
design algorithms, data structures, and mathematical models using set theory, matrix
CO6 operations, graph theory, statistics, and numerical methods to address specific K6
computational problems.

Relationship Matrix
Semester Course Code Title of the Course Hours Credits
Discipline Specific Elective - 1: Mathematical
1 25PAI1ES01A 4 3
Foundations
Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean
Course
Score of
Outcomes PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 3 2 1 3 2 3 2 3 2.5
CO2 2 3 3 2 2 2 3 2 1 3 2.3
CO3 3 2 3 2 2 3 2 2 2 2 2.3
CO4 3 3 2 2 2 3 3 3 2 3 2.6
CO5 2 3 3 2 1 3 3 2 2 3 2.4
CO6 2 3 3 2 1 3 3 2 2 3 2.4
Mean Overall Score 2.4 (High)

82
 Semester Course Code Title of the Course Hours/Week Credits
Discipline Specific Elective - 1: Design
1 25PAI1ES01B and Analysis of Algorithms 4 3

Course Objectives
To understand fundamental concepts of Algorithm.
To impart knowledge about Basic Traversal and Search Techniques and Problematic Design.
To implement the linear and non-linear data structures.
To analyze the efficiency and complexity of algorithms.
To foster problem-solving skills through algorithmic thinking.
UNIT I: Introduction to Algorithms (12 Hours)
Algorithm-Specification - Performance Analysis. Divide And Conquer - General Method -
Binary Search - Find the Maximum and Minimum - Quick sort - Strassen’s Matrix
Multiplication.
UNIT II: Representing rooted trees (12 Hours)
Hash Tables: Direct- address tables-Hash tables- Hash functions - Open addressing- Perfect
hashing – Binary Search Trees: Querying a binary search tree- Insertion and deletion-
Randomly built binary search trees – Red-Black Trees: Properties of red-black trees-
Rotations- Insertion- Deletion – B- Trees: Definition of B-trees- Basic Operations-Deleting
a key from a B-tree.
UNIT III: The Greedy Method (12 Hours)
The Greedy Method: General Method - Knapsack Problem - Job Sequencing with Deadlines-
Minimum Cost Spanning Tree - Single Source Shortest Path. Dynamic Programming:
General Method-Multistage Graph-All Pairs Shortest Path -Optimal Binary Search Tree - 0/1
Knapsack- Travelling Salesperson Problem.
UNIT IV: Basic Traversal and Search Techniques (12 Hours)
Techniques for Binary Trees –Techniques for Graphs Connected Components and Spanning
Trees-Bi-connected Components and DFS. Backtracking: General Method-8-Queen
Problem- Sum of Subsets Graph Coloring: Hamiltonian Cycle.
UNIT V: Graph Algorithms (12 Hours)
Representation of Graphs- Breadth first search- Depth first search- Topological sort. Minimum
Spanning Trees: Algorithms of Kruskal and Prim – Single Source Shortest Path: The Bellman-
Ford Algorithm- Single source shortest path in directed acyclic graphs-Dijkstra’s algorithm
All Pairs Shortest Path: Shortest path and Matrix Multiplication - The Floyd-Warshall
algorithm – Johnson’s algorithm for sparse graphs.
Lectures and Conceptual Explanation, Problem-Solving
Teaching Methodology
Workshops,Guest Lectures and Industry Insights
Assessment Methods MCQ Test, Seminar, Assignment Writing, Problem Solving
Books for Study
1. Horowitz, E., Sahni, S. & Rajasekaran, S. (2018). Fundamentals of Computer Algorithms.
(2nd Ed.). Universities Press(India) Private Ltd.
2. Aho, A. V., Hoporoft, & Ulman, J. D. (2001). The Design Methods and Analysis of
Computer Algorithm. Pearson Education.
3. Basu, S. K. (2006). Design Methods and Analysis of Algorithms. PHI.
4. Weiss, M. A. (2013). Data Structure and Algorithm Analysis in C++. Pearson
Educations.
5. Sen, S. & Kumar, A. (2019). Design and Analysis of Algorithms: A contemporary
perspective. Cambridge University Press.

83
Book for Reference
1. Thomas, S. C., Charles, E. L., Ronald, L. R. & Stein, C. (2001). Introduction to
Algorithms, (2nd Ed.). The MIT Press.
Websites and eLearning Sources
1. https://www.geeksforgeeks.org/design-and-analysis-of-algorithms/
2. https://www.javatpoint.com/daa-tutorial
3. https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/

Course Outcomes
CO-Statements Cognitive
CO No. Levels
On successful completion of this course, students will be able to
(K-Level)
recall the fundamental principles and techniques of algorithms, including
CO1 K1
specification, analysis, and optimization
explain the characteristics, operations, and applications of various data
CO2 K2
structures
apply algorithmic techniques to solve optimization problems such as
CO3 K3
knapsack, job sequencing, and shortest path
analyze and evaluate the efficiency, correctness, and scalability of
CO4 K4
algorithms and data structures
evaluate the implications of algorithmic decisions and data structure choices
CO5 K5
on problem-solving and decision-making processes
design and implement algorithms and data structures to solve practical
CO6 K6
problems

Relationship Matrix
Semester Course Code Title of the Course Hours Credits
Discipline Specific Elective - 1: Design and
1 25PAI1ES01B Analysis of Algorithms 4 3
Programme Specific Outcomes Mean
Programme Outcomes (POs) Score
Course (PSOs)
Outcomes of
PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 3 2 1 3 3 3 2 1 2.4
CO2 2 2 3 2 2 2 2 3 2 2 2.2
CO3 3 2 3 2 2 3 2 3 2 2 2.4
CO4 3 2 2 2 2 3 2 2 2 2 2.2
CO5 2 3 3 2 1 2 3 3 2 1 2.2
CO6 2 3 3 2 1 2 3 3 2 1 2.2
Mean Overall Score 2.3 (High)

84
Semester Course Code Title of the Course Hours/Week Credits
Ability Enhancement Course:
1 25PAI1AE01 2 1
Algorithm Lab using C++

Course Objectives
To develop problem-solving skills to understand and solve complex problems efficiently.
To enable students to select appropriate algorithms for different types of problems,
considering
factors such as time complexity and space complexity.
To nurture programming competence, enabling students to design and analyze algorithms and
data
structures effectively for diverse problem domains.

List of Exercises
1. Merge Sort, Heap Sort and QuickSort algorithms.
2. Knapsack problem (0/1).
3. Topological ordering of vertices in a given digraph.
4. Greedy algorithm to find minimum number of coins to make change for a given
value of Indian currency. Assume that we have infinite supply of denominations in
Indian currency.
5. Breadth First Search and Depth First search
6. Prim’s Algorithm to find a minimum spanning tree.
7. Shortest path using Dijkstra’s algorithm.
8. Multiply two matrices recursively.
9. String is a permutation of another given string.
10. Postfix evaluation
11. Binary tree traversal
12. Binary Search Tree

Hands-on Programming Exercises, Peer Learning and Collaboration

Teaching Methodology
Lab Sessions, Code Reviews and Feedback, Problem-solving Sessions
Assessment Methods Program writing, Error correction, Test

Course Outcomes
CO-Statements Cognitive
CO No. Levels (K-
On successful completion of this course, students will be able to
Level)
demonstrate proficiency in evaluating postfix expressions and implementing K4
CO1 algorithms
CO2 analyze graphs and apply graph traversal algorithms K5
develop proficiency in implementing and analyzing various algorithms and
CO3 K6
data structures

85
 Relationship Matrix
Semester Course Code Title of the Course Hours Credits
1 25PAI1AE01 Ability Enhancement Course: Algorithm Lab using C++ 2 1
Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean
Course
Score of
Outcomes PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 2 2 2 3 2 2 2 2 2.2
CO2 2 3 3 2 2 2 3 3 2 2 2.4
CO3 2 3 3 2 2 2 3 3 2 2 2.4
Mean Overall Score 2.3 (High)

86
 Semester Course Code Title of the Course Hours/Week Credits
Open Elective (WS): Neural
1 25PAI1OE01 4 2
Networks and Fuzzy Logic

Course Objectives
To understand the neural network basics, architectures, early models (Perceptron, ADALINE,
MADALINE), and applications.
To comprehand backpropagation network architecture, learning process, and applications in journal
bearing design, soil classification, and steel extrusion
To cover autocorrelations, BAM networks, training strategies, and applications in character recognition
and fabric defect identification.
To compares fuzzy and crisp sets, covering operations, relations, and partitioning of crisp sets.
To master crisp and fuzzy logic, including propositional and predicate logic, fuzzy inference systems.
defuzzification methods, and applications like fuzzy cruise and air conditioner controllers.
UNIT I: Fundamentals of Neural Network (12 Hours)
Basic Concepts- Human Brains - Model of an Neural Networks- Neural Network Architectures:
Single Layer Feedforward Network, Multilayer Feedforward Network, Recurrent Networks -
Characteristics of Neural Networks - Learning Models- Taxonomy of Neural Network
Architectures. Early Neural Network Architectures: Rosenblatt’s Perceptron- ADALINE
Network- MADALINE Network. Some Application Domains.

UNIT II: BackPropogation Networks (12 Hours)

Architecture of a Back propagation Network: The Perceptron Model- The Solution- Single Layer
Artificial Neural Network- Model for Multilayer Perceptron. Back propagation Learning: Input
Layer Computation- Hidden Layer Computation- Output Layer Computation- Calculation of
Error- Training of Neural Network- Method of Steepest Descent- Effect of Learning Rate ‘𝜼’-
Adding a Momentum Term- Back propagation Algorithm - Illustration – Applications: Design of
Journal Bearing- Classification of Soil.

UNIT III: Associative Memoy (12 Hours)

Autocorrelations. Hetero correlators: Kosko’s Discrete BAM: Addition and Deletion of Pattern
Pairs-Energy Function for BAM. Wang et al’s Mutliple Training Encoding Strategy - Exponential
BAM: Evolution Equations. Associative Memory for Real-coded Pattern Pairs: Input
Normalization- Evolution Equations – Applications: Recognition of Characters- Fabric Defect
Identification.

UNIT IV: Fuzzy Set Theory (12 Hours)

Fuzzy versus Crisp. Crisp sets: Operation on Crisp Sets-Properties of Crisp Sets, Partition and
Covering. Fuzzy Sets: Membership Functions- Basic Fuzzy Set Operations- Properties of Fuzzy
Sets. Crisp Relations: Cartesian Product- Other Crisp Relations- Operations on Relations. Fuzzy
Relation: Fuzzy Cartesian Products- Operations on Fuzzy Relation.

UNIT V: Fuzzy Systems (12 Hours)

Crisp Logic: Laws of Propositional-Logic- Inference in Propositional Logic. Predicate Logic:
Interpretations of Predicate Logic Formula - Inference in Predicate Logic. Fuzzy Logic: Fuzzy
Quantifiers, Fuzzy Inference. Fuzzy Rule based System. Defuzzification Methods. Applications:

87
 Greg Viot’s Fuzzy Cruise Controller- Air Conditioner Controller.

Teaching Methodology Videos, PPT, Demonstration, and Hands on sessions

Assessment Methods MCQ Test, Assignment Writing, Problem Solving and Seminar

Book for Study

1. Rajasekaran S and Vijayalakshmi Pai (2004). Neural Networks, Fuzzy Logic, and Genetic
Algorithms: Synthesis and Applications, Prentice-Hall of India.
Unit I: Chapters 2.1 – 2.7, 2.8-2.10
Unit II: Chapters 3.1 – 3.4.2
Unit III: Chapters 4.1 – 4.6
Unit IV: Chapters 6.1 – 6.5
Unit V: Chapters 7.1 – 7.6.
Books for Reference
1. Timothy J. Ross (2004). Fuzzy Logic with Engineering Applications, McGraw-Hill, Inc.
2. John Yen and Reza Langari (1999). Fuzzy Logic: Intelligence, Control, and Information,
Prentice Hall.
3. F. Martin McNeill and Ellen Thro (1994). Fuzzy Logic: A Practical Approach, Academic
Press
Websites and eLearning Sources
1. https://www.geeksforgeeks.org/artificial-neural-networks-and-its-applications/
2. https://www.sciencedirect.com/topics/engineering/artificial-neural-network-mod
3. https://onlinecourses.nptel.ac.in/noc21_ge07/preview
4. https://www.geeksforgeeks.org/fuzzy-logic-introduction/

Teaching Methodology Videos, PPT, Demonstration, and Hands on sessions

Assessment Methods MCQ Test, Assignment Writing, Problem Solving and Seminar

Course Outcomes
CO-Statements Cognitive
CO
Levels (K-
No. On successful completion of this course, students will be able to Level)
CO1 recall concepts of neural networks, backpropagation, fuzzy logic, and their applications in K1
various systems.
CO2 explain neural network architectures, backpropagation, fuzzy logic, and their applications. K2
CO3 apply neural networks, backpropagation, and fuzzy logic to real-world problems. K3
CO4 evaluate and optimize the neural networks, back propagation, and fuzzy logic for K4
real-world applications.
synthesize neural network architectures, backpropagation methods, and fuzzy logic systems
CO5 K5
to design and innovate solutions for complex real-world problems.
design neural networks, fuzzy systems, and associative memory models for real-
CO6 K6
world applications.

88
 Relationship Matrix
Semester Course Code Title of the Course Hours Credits
Open Elective (WS): Neural Networks and Fuzzy
1 25PAI1OE01 4 2
Logic
Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Course Mean Scores of
Outcomes PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO5 PSO5 COs
CO1 3 1 3 3 1 3 3 3 2 3 2.5
CO2 3 2 3 1 3 1 2 2 3 3 2.4
CO3 2 1 3 3 3 3 2 3 3 3 2.6
CO4 3 2 3 1 2 3 3 3 3 3 2.6
CO5 1 2 3 3 2 3 2 3 2 3 2.4
CO6 2 2 3 2 2 3 3 2 2 2 2,3
2.5
Mean Overall Score (High)

89