COURSE STRUCTURE

JSPM University Pune (NEP 2020 Aligned)

FACULTY OF SCIENCE & TECHNOLOGY W. E. F 2024-2025
SCHOOL OF BASIC AND APPLIED SCIENCES RELEASE DATE 01/07/2024
FIRST YEAR MASTER OF SCIENCE
REVISION NO. 1.0 (NEP)
(DATA SCIENCE AND ARTIFICIAL INTELLIGENCE)
SEMESTER I (LEVEL – 6.5)

C
R
TEACHING E
COURSE EXAMINATION SCHEME AND MARKS
SCHEME D
I
T
S
PRACTICAL ORAL
THEORY
Hours / Week (Equal Weightage for (Equal Weightage for
(Equal Weightage for CIE and ESE)
CIE and ESE) CIE and ESE)
CONTINUOUS INSEMESTER T
CONTINUO CONTINUO
EVALUATION END 0
TYPE CODE COURSE NAME (100 Marks) SEMESTER
US END US END
INSEMEST SEMESTER INSEMEST SEMESTER T
EXAMINATI
L T P EL T1 T2
Assign-
ON
ER EXAMINATI ER EXAMINATI A
ments EVALUATI ON EVALUATI ON L
(30 (30 (100 / 50
(40 ON (50 Marks) ON (50 Marks)
Marks) Marks) Marks)
Marks) (50 Marks) (50 Marks)

Mathematical Foundations of
PSMC 230GMAM04_01 2 1 - - 30 30 40 100 - - - - 100 3
Computer Science
PCC 231GCAM01_01 Data Structure and Algorithm 2 - - 2 30 30 40 100 - - - - 100 2.5
Introduction to Artificial Intelligence
PCC 240GCAM31_01 2 - - - 30 30 40 50 - - - - 50 2
and Machine Learning
Data Communication and Computer
PCC 231GCAM03_01 2 - - - 30 30 40 50 - - - - 50 2
Networking
Object-Oriented Programming with
SEC 240GCAM40_01 2 - 2 - - - - - 50 50 50 50 100 3
Java
MMC Multidisciplinary Minor Course 1 - 2 - - - - - 50 50 50 50 100 2

VSC 230IDCB01_01 Design Thinking and Creativity 1 - - 2 - - - - - - 50 50 50 1.5

Communicative English for
AEC 230UENM01_01 1 - 2 - 30 30 40 50 - - - - 50 2
Professionals
RMC 230IRMM01_01 Research Methodology 2 - - - 30 30 40 50 - - - - 50 2

LC 231GCAM17_01 Data Structure and Algorithm Lab - - 2 - - - - - 50 50 - - 50 1

Introduction to Artificial Intelligence
LC 240GCAM41_01 - - 2 - - - - - 50 50 - - 50 1
and Machine Learning Lab
TOTAL 15 1 10 4 750 22

L-Lecture T-Tutorial P-Practical Session (Laboratory) EL-Experiential Learning

Format No.: JSPMUni/ACAD/00I Rev. No.:0.0 Rev. Date:01/07/2024 Page 1 of 2
 Multidisciplinary Minor Course (MMC)
Sem.
Course Code 230GMEB53_01 230UEEB02_01 230GRAB51_01
I
Course Name CAD/CAM Public Economics Robot Modeling
Course Code 230VBCB18_02 230VDMM02_02 230GRAB52_02
II
Course Name Personal Financial Planning Customer Relationship Management Autonomous Mobile Robot

Mohd. Ikram Ali Dr. G. A. Patil Dr. R. S. Deshpande

Programme Coordinator, MSc-DSAI Director, School of Computational Sciences Dean, Faculty of Science and Technology

Dr. Anuradha S. Deshpande Prof. B.B. Ahuja

Associate Dean (Academics) Vice Chancellor, JSPM University Pune

Format No.: JSPMUni/ACAD/00I Rev. No.:0.0 Rev. Date:01/07/2024 Page 2 of 2

 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: PSMC Course Title: Mathematical Foundations of Computer Science

Course Code: Teaching Scheme: (Hrs./Week) Examination Scheme:

230GMAM04_01
Credits: 3 Lecture (L): 2 Theory (TH): 100 Marks
Tutorial (T): 1
Practical (P): 0
Experiential Learning (EL):0
Prerequisite Courses, if any:
An understanding of Math in general is sufficient.
Course Objectives:
• Introduces elementary discrete mathematics for computer science and engineering.
• Topics include formal logic notation, methods of proof, induction, sets, relations, graph
theory, permutations and combinations, counting principles; recurrence relations and
generating functions, Boolean Algebra, Sequential circuit.
Course Outcomes: On completion of the course, learner will be able to :
CO1: Ability to understand and construct precise mathematical proofs.
CO2: Ability to use logic and set theory to formulate precise statements.
CO3: Ability to analyze and solve counting problems on finite and discrete structures.
CO4: Ability to describe and manipulate sequences.
CO5: Ability to apply graph theory in solving computing problems.
CO6: Evaluate Boolean functions and simplify expressions using the properties of Boolean algebra.

Course Contents
Unit I Mathematical Logic (8 Hrs)
Propositional Logic, Applications of Propositional Logic, Propositional Equivalence, Predicates and
Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Methods of Proofs.
Unit II Sets, Relations and Functions (8 Hrs)
Sets, Types of sets, Cardinality of Sets, Operations on sets, Cartesian products, Relations,
Closures of Relations, Equivalence Relations, Partial Orderings, Functions, Types of functions,
Sequences, Sum of Sequences.
Unit III Algebra (8 Hrs)
Binary Operation, Semi Groups, Monoids, Groups, Rings, Matrices and Determinants, Matrix
Multiplication, Inverse of a matrix, Rank, and Elementary transformations. Solving linear systems
by Cramer's rule, Vector spaces, Subspaces, Basis, and dimension, Linear dependence and
Independence, Eigenvalues, Eigenvectors, Characteristic equation, Cayley-Hamilton theorem.
Unit IV Boolean Algebra (7 Hrs)
Boolean Algebra, Identities of Boolean Algebra, Duality, Representation of Boolean Function,
Disjunctive and Conjunctive Normal Form, Boolean Rings.
Unit V Graphs (7 Hrs)
Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing
Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems,
Planar Graphs, Graph Coloring.
Unit VI Trees (7 Hrs)
Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning
Trees.

Learning Resources
Textbook:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, TataMcGraw – Hill
2. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley &
Sons,2006.
3. Narsingh Deo, Graph Theory with applications to Engineering and computer sciences.
Reference Books:
1. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth
Publishing Co. Inc
2. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer Oriented
Approach, 3rd Edition by, Tata McGraw – Hill.
3. J.P. Tremblay and R. Manohar, “Discrete Mathematical Structure and Its Application to
Computer Science”, TMG Edition, Tata Mcgraw-Hill
4. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.Schaum’s
Outlines Series, Seymour Lipschutz, Marc Lipson.
5. N.P. Bali and Manish Goyal, A textbook of Engineering Mathematics, Laxmi Publications,
Reprint, 2008.
6. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11thReprint,
2010.
MOOC / NPTEL Courses:
1. https://onlinecourses.nptel.ac.in/noc22_cs49/preview By Prof. Dipanwita
Roychowdhury | IIT Kharagpur
2. https://onlinecourses.nptel.ac.in/noc23_cs109/preview By Prof. Sudarshan
Iyengar, Prof. Anil Shukla | IIT Ropar.
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: PCC Course Title: Data Structure and Algorithm

Course Code: Teaching Scheme: (Hrs./Week) Examination Scheme:

231GCAM01_01
Credits: 2.5 Lecture (L): 2 Theory (TH) :100 Marks
Tutorial (T): 0
Practical (P): 0
Experiential Learning (EL): 2
Prerequisite Courses, if any:
• Introductory knowledge of Computing.
• Basic knowledge of common programming concepts.
• Basic knowledge of mathematics, including proof by induction and contradiction.
Course Objectives:
• To impart knowledge about various data structures, their representation, and
applications.
• To Acquaint with various Algorithmic techniques and applications.
• Apply logical reasoning to solve a variety of problems.

Course Outcomes: On completion of the course, learner will be able to-

CO1: Implement linear and non-linear data structure with operations.
CO2: Ability to understand the fundamental concepts in algorithms & analyze algorithms
using space &Time complexity.
CO3: Ability to understand and apply various data structures such as arrays, queues,
linked lists, stacks, Trees and graphs.
CO4: Modify or suggest new data structure for an application.
CO5: Perceive advanced data structures and perform operations on them.
CO6: Evaluate the performance of various algorithms.

Course Contents
Unit I Introduction Data Structure and Algorithm (8 Hrs)
Introduction to data structure: Data, Entity, Information, Difference between Data and
Information, Data type, Build in data type, Abstract data type, Definition of data structures.
Types of Data Structures: Linear and Non-Linear Data Structure.
 Introduction to Algorithms: Definition of Algorithms, Difference between algorithm and
programs, properties of algorithm, Algorithm Design Techniques, Performance Analysis of
Algorithms, Complexity of various code structures, Order of Growth, Asymptotic Notations.

Unit II Array, Stack and Queue (8 Hrs)

Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row
Major Order, and Column Major Order, Sparse Matrices and their representations.
Stack: Definition, operations on stacks, stack implementation using array and linked list,
Applications of stacks: Infix, Postfix & Prefix expressions, converting an expression from
infix to postfix.
Queue: Definition and concepts, Operations on queue. Types of queues: Linear queue,
Circular queue, Priority queue, Double Ended queue, Implementations of queue.
Unit III List, Search and Sort Technique (8 Hrs)
Linked list: Introduction of Linked List, types of linked list, singly linked lists,
Representation of linked lists in memory, Traversing, Searching, Insertion into, Deletion
from linked list, Doubly Linked List, Circularly Linked List & Operations on all type of
Linked List.
Search Technique: Introduction of searching, type of Searching: Linear Search and
Binary Search.
Sorting Technique: Basic concepts of sorting, Selection Sort, Bubble Sort, Insertion Sort,
Quick sort, Merge sort, shell sort.
Unit IV Tree Data Structure (7 Hrs)
Trees: Introduction of trees, Basic terminology used with tree, Types of trees, Binary
trees. Properties of Binary trees and their implementation, Binary Tree Representation,
Creating a Binary tree, An Extended Binary Trees, Tree Traversal algorithms: In order,
Preorder and Post order.
Unit V Advanced Tree data Structure (7 Hrs)
Binary Search Trees: Introduction of Binary Search Tree, Properties of Binary Search
Trees and their implementation, Creating Binary search Tree from given Tree Traversal,
Operation of Insertion, Deletion, Searching & Modification of data in Binary Search Tree,
AVL trees, Huffman algorithm, B-trees.
Unit VI Graph Data Structure (7 Hrs)
Graphs: Introduction of Graph, Graph Terminologies, Type of Graph, Representations of
Graph.
Graph traversal Algorithms – Depth-first search (DFS), Breadth-first search (BFS) and
applications. Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal
algorithm.
Shortest Path algorithm: Floyd Warshall and Dijkstra Algorithm.
Heap: Introduction of Heap, Heap tree and Heap sort Algorithm.
 Learning Resources
Text Books: (Maximum 2)
1. Dinesh P Mehta &SartajSahni, Handbook of Data Structures and Applications, Chapman and
Hall. 2005.
2. Gregory L. Heilman, Data Structures, Algorithms and Object Oriented Programming, Tata
Mcgraw-Hill, New Delhi, 2002.
3. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms (2nd ed.),
Prentice-Hall of India, 2006
Reference Books:
1. D.E.Knuth, Fundamental Algorithms, Vol. I, Addison Wesley, 1997
2. J. Kleinberg and E.Tardos, Algorithms Design, Pearson Education, 2006.
3. S.Baase, Computer algorithms: Introduction to Design and Analysis, Addison Wesley, 1999.
4. A.V. Levitin, Introduction to the Design and Analysis of algorithms, Pearson Education, 2006.

MOOC / NPTEL Courses:

1.NPTEL Course “Data Structure And Algorithms”, Prof. Naveen Garg,IIT Delhi
Link of the Course:https://nptel.ac.in/courses/106102064

Additional Web Resources:

1. https://www.mygreatlearning.com/academy/learn-for-free/courses/data-structures-and-
algorithms-in-java
2. https://www.coursera.org/courses?query=data%20structures%20and%20algorithms
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: PCC Course Title: Introduction to Artificial Intelligence and
Machine Learning
Course Code: Teaching Scheme: Examination Scheme:
240GCAM31_01 (Hrs./Week)
Credits: 2 Lecture (L): 2 Theory (TH): 50 Marks
Tutorial (T): 0
Practical (P): 0
Experiential Learning (EL): 0
Prerequisite Courses, if any:
• Fundamentals of Programming
• Data Structures and Algorithms.
• Mathematics for Computer Science.
Course Objectives: The student should be made to
• Understand the core concepts of Artificial Intelligence (AI) and Machine Learning
(ML).
• Learn problem-solving and search strategies.
• Explore knowledge representation and reasoning techniques.
• Analyze various machine learning approaches and techniques.
• Apply regression and decision tree learning in AI and ML contexts.
Course Outcomes: On completion of the course, learner will be able to
CO1: Comprehend the basic concepts and characteristics of AI and ML.
CO2: Implement heuristic search techniques and problem-solving strategies.
CO3: Understand and apply knowledge representation and inference mechanisms.
CO4: Analyze different machine learning approaches and their applications.
CO5: Develop solutions using regression and decision tree learning algorithms.
CO6: Address practical and ethical considerations in deploying AI and ML systems.
Course Contents
Unit I General Issues and overview of AI (5 Hours)
The AI problems: what is an AI technique, Characteristics of AI applications Problem
Solving, Search and Control Strategies. General Problem solving, Production systems.
Control strategies: forward and backward chaining. Exhaustive searches: Depth first
Search, Breadth first search.
Unit II Heuristic Search Techniques (5 Hours)
Heuristic search methods: Hill climbing, Branch and Bound, Best-First Search, A* algorithm,
AND/OR Graphs, Problem reduction and AO* algorithm, Constraint Satisfaction problems,
Game Playing: Min Max Search procedure, Alpha-Beta cutoff.
 Unit III Knowledge Representation (5 Hours)
Knowledge Representation Methods: Propositional Logic, Predicate Logic, Skolemnisation,
Resolution Principle and Unification, Inference Mechanisms: Horn’s Clauses, Semantic
Networks, Frame Systems and Value Inheritance, Scripts, Conceptual Dependency.
Unit IV Introduction Machine Learning (5 Hours)
Introduction – Machine Learning, Types of Learning, well defined learning problems,
Designing a Learning System, History of ML, Introduction of Machine Learning
Approaches – (Artificial Neural Network, Clustering, Reinforcement Learning, Decision
Tree Learning, Bayesian networks, Support Vector Machine, Genetic Algorithm).
Unit V Supervised Learning Techniques in Machine Learning (5 Hours)
Introduction to Supervised Learning: Definition and Overview,
Differences Between Supervised, Unsupervised, and Reinforcement Learning,
Types of Supervised Learning Algorithms:
Regression Algorithms: Linear Regression, Polynomial Regression, Ridge and Lasso
Regression
Classification Algorithms: Logistic Regression, Decision Trees, k-Nearest Neighbors (k-
NN), Support Vector Machines (SVM), Naïve Bayes Classifier, Random Forest.
Metrics for Regression: Mean Squared Error (MSE), Root Mean Squared Error (RMSE),
R-squared
Metrics for Classification: Accuracy, Precision, Recall, F1 Score, ROC-AUC.
Unit VI Unsupervised Learning Techniques in Machine (5 Hours)
Learning
Introduction to Unsupervised Learning: Definition and Overview.
Clustering Techniques:
Partitioning Methods: K-Means Clustering: Algorithm, Centroid Initialization, Convergence,
K-Medoids (PAM) Clustering.
Hierarchical Clustering: Agglomerative and Divisive Clustering, Dendrograms and
Linkage Criteria (Single, Complete, Average).
Density-Based Clustering: DBSCAN (Density-Based Spatial Clustering of Applications
with Noise), OPTICS (Ordering Points to Identify the Clustering Structure).
Dimensionality Reduction Techniques:
Principal Component Analysis (PCA): Concept, Eigenvectors, and Eigenvalues,
Reducing the Number of Features While Retaining Variance
Linear Discriminant Analysis (LDA): Comparison with PCA, Supervised vs. Unsupervised
Context.
t-SNE (t-Distributed Stochastic Neighbor Embedding): Visualizing High-Dimensional
Data.
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: PCC Course Title: Data Communication and Computer Networking

Course Code: Teaching Scheme: (Hrs./Week) Examination Scheme:

231GCAM03_01
Credits: 2 Lecture (L): 2 Theory (TH): 50 Marks
Tutorial (T): 0
Practical (P): 0
Experiential Learning (EL): 0
Prerequisite Courses, if any:
• Basic Knowledge in Computers
Course Objectives:
• To understand the fundamentals of computer networks and data
communication.
• To introduce the concepts, protocols, and technologies used in modern
computer networks
• To equip students with knowledge of how data is transmitted, exchanged, and
managed over a network.
• To get familiarized with Internet security.
Course Outcomes: On completion of the course, learner will be able to -
CO1: Understand the fundamental concepts of data communication and networking models.
CO2: Analyze the protocols, and techniques involved in the data link layer for error control and
flow management.
CO3: Explain the role of the network layer, routing algorithms and network addressing.
CO4: Evaluate the transport layer protocols and mechanisms for ensuring efficient data transfer.
CO5: Understand various protocols and functionalities of the application layer
CO6: Identify security challenges and solutions in internet communication, focusing on protocols
and cryptography.
Course Contents
Unit I Introduction to Data Communication and (5 Hrs)
Networking
Data Communication basics: Components, data representation, data flow (Simplex, half-duplex,
full duplex), Network: Network topology, Network criteria, Standards in networking, Architecture of
Internet, Reference Models: TCP/IP Model, The OSI Model, Comparison of the OSI and TCP/IP
reference model.
Physical Layer: Guided transmission media, network performance.
Unit II Data Link Layer (5 Hrs)
Data Link Layer - Design issues, Error Detection & Correction, Elementary Data Link Layer
Protocols, Sliding window protocols. Multiple Access Protocols - ALOHA, CSMA,CSMA/CD,
CSMA/CA, Collision free protocols, Ethernet- Physical Layer, Ethernet Mac Sub layer, wireless
LANs: IEEE 802.11, Bluetooth
Unit III Network Layer (5 Hrs)
Network Layer: Network Layer Design issues, store and forward packet switching connection less
and connection-oriented networks-routing algorithms-optimality principle, shortest path, flooding,
Distance Vector Routing, Count to Infinity Problem, Link State Routing, Path Vector Routing,
Hierarchical Routing; Congestion control algorithms, IP addresses. Subnetting, Super Netting,
IPv4, Packet Fragmentation, IPv6 Protocol, Transition from IPv4 to IPv6,
Unit IV Transport layer (5 Hrs)
Transport Layer: Services provided to the upper layers elements of transport protocol addressing
connection establishment, Connection release, Error Control & Flow Control, Crash Recovery.
The Internet Transport Protocols: UDP, Introduction to TCP, The TCP Service Model, The TCP
Segment Header, The Connection Establishment, The TCP Connection Release. TCP Congestion
Control Algorithm.
Unit V Application layer (5 Hrs)
Application Layer- Introduction, providing services, Applications layer paradigms: Client server
model, HTTP, E-mail, WWW, TELNET, DNS; RSA algorithm.
Unit VI Security in the Internet (5 Hrs)

IPSecurity (IPSec), SSL, PGP, Firewalls, VPNs, Vulnerabilities and attacks in OSI model layers

Learning Resources
Textbooks:
1. BehrouzForouzan, “Data Communication and Networking”, McGraw Hill
2. Andrew Tanenbaum “Computer Networks”, Prentice Hall.
3. William Stallings, “Data and Computer Communication”, Pearson.
4. Kurose and Ross, “Computer Networking- A Top-Down Approach”, Pearson.
Reference Books:
1. Peterson and Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann
2. W. A. Shay, “Understanding Communications and Networks”, Cengage Learning.
3. D. Comer, “Computer Networks and Internets”, Pearson.
4. BehrouzForouzan, “TCP/IP Protocol Suite”, McGraw Hill.
MOOC / NPTEL Courses:

1. NPTEL Course “Computer Network and Internet protocol”, Prof. SoumyaKantiGoash and
Prof. SandeepChakrborty,IIT Delhi
Link of the Course:https://archive.nptel.ac.in/courses/106/105/106105183/
Web Sources:
1. https://www.mygreatlearning.com/academy/learn-for-free/courses/basics-of-
computer-networking
2. https://www.coursera.org/courses?query=computer%20network
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: SEC Course Title: Object-Oriented Programming with Java

Course Code: Teaching Scheme: Examination Scheme:

240GCAM40_01 (Hrs./Week)
Credits: 3 Lecture (L): 2 ORAL (OR): 50 Marks
Tutorial (T): 0 Practical (PR): 50 Marks
Practical (P): 2
Experiential Learning (EL): 0
Prerequisite Courses, if any:
• Fundamental of C programming language.
Course Objectives: The student should be made to
• Understand Object-Oriented Programming Principles
• Develop Problem-Solving Skills Using Java
• Learn Advanced Object-Oriented Features
• Develop Graphical User Interfaces (GUIs)
Course Outcomes: On completion of the course, learner will be able to
CO1: Demonstrate a thorough understanding of object-oriented programming principles
such as encapsulation, inheritance, polymorphism, and abstraction, and effectively
apply them in Java programming.
CO2: Write efficient and well-structured Java programs using classes, objects, methods,
and constructors to solve complex real-world problems.
CO3: Utilize inheritance and polymorphism to create scalable, flexible code that
adapts to changing requirements and behaviors in application design.
CO4: Write robust Java programs that include exception handling and perform file I/O
operations for secure and reliable data management.
CO5: Create intuitive and interactive Graphical User Interfaces (GUIs) using Java’s AWT
and Swing, incorporating event-driven programming principles.
CO6: Integrate Java applications with relational databases using Java Database
Connectivity (JDBC), performing CRUD operations and data manipulation.
Course Contents
Unit I Introduction of Java (7 Hours)
Object-Oriented Programming (OOP) concepts: Classes, Objects, Encapsulation,
Inheritance, Polymorphism, Abstraction, Introduction of Java, History and Evolution of
Java. JVM, JRE, and JDK. Java program structure, compilation, and execution Cycle. Data
types, variables, operators, expressions.
Control Statements: Decision-making (if-else, switch), Loops (for, while, do-while). Arrays
and Strings in Java. Basic input and output in Java (Scanner, Buffered Reader).
 Unit II Class & Object (7 Hours)
Class Definition and Usage: Defining classes and objects in Java. Class members: fields
and methods. Access modifiers (public, private, protected, default). Constructors and their
types. Static members and methods. The "this" keyword. Method overloading, Method
overriding.
Object Creation and Interaction: Memory management in Java (Heap, Stack). Garbage
collection mechanism. Passing objects as arguments to methods. Returning objects from
methods.
Unit III Inheritance, Polymorphism & Interfaces in Java (7 Hours)
Inheritance: Concept of inheritance in Java. Superclass and subclass. “super" keyword and
constructor chaining. Method overriding and dynamic method dispatch. Types of inheritance
(single, multilevel, hierarchical). Restrictions on inheritance (final class, final method).
Polymorphism: Compile-time (method overloading) and runtime polymorphism (method
overriding). Abstract classes and methods.
Interfaces in Java: syntax, implementation, and multiple inheritance.
Unit IV Exception Handling & Multithreading (8 Hours)
Exception Handling: Concept of exception and error in Java. Exception hierarchy
(checked and unchecked exceptions). Handling exceptions using try-catch-finally.
Throwing exceptions, throws clause, and custom exceptions.
Multithreading: Understanding threads and multi-threading in Java.
Thread lifecycle and states. Creating threads by extending Thread class and implementing
Runnable interface. Thread synchronization and inter-thread communication.
Thread priorities, daemon threads, and deadlocks.
Unit V Java Collections Framework & File I/O (8 Hours)
Java Collections Framework: Overview of the Collection API. Interfaces: List, Set, Map.
Common Implementations: ArrayList, LinkedList, HashSet, TreeSet, HashMap, TreeMap.
Iterating through Collections: Using Iterators and Enhanced for Loops.
File I/O: Handling Files using File Class. Reading and Writing Files using FileReader and
FileWriter. Buffered Streams for Efficient I/O. Serialization and Deserialization of Objects.
Unit VI Graphical User Interface (GUI) (8 Hours)
Graphical User Interface (GUI) Development: Introduction to Abstract Window Toolkit
(AWT) and Swing. AWT components: Button, Label, TextField, TextArea, Checkbox, and
Layout Managers. Event handling in AWT (ActionListener, MouseListener, KeyListener).
Creating GUI applications using JFrame, JPanel, and other Swing components.
Introduction to Java Database Connectivity (JDBC) and database operations.
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: SEC Lab Course Title: Object-Oriented Programming with Java
Course Code: Teaching Scheme:(Hrs./Week) Examination Scheme:
240GCAM40_01
Credits: 3 Lecture (L): 2 Practical (PR): 50 Marks
Tutorial (T): 0 Oral (OR): 50 Marks
Practical (P): 2
Experiential Learning (EL): 0
List of Laboratory Experiments
Write a Java program to demonstrate basic syntax, data types, variables, and
1.
control structures (if-else, for, while).
Create a Java program using various loops (for, while, do-while) and decision-
2.
making statements (switch, if-else).
Implement a Java program that defines a class, creates objects, and uses
3.
constructors (default and parameterized).
Create a program that demonstrates method overloading and constructor
4.
overloading.
5. Write a program using static methods and static variables to show their utility.
6. Develop a Java program demonstrating single and multilevel inheritance.
7. Implement method overriding and the use of the super keyword.
8. Write a program to show runtime polymorphism using method overriding.
9. Implement multiple inheritance using interfaces in Java.
Write a program to implement exception handling using try, catch, throw, throws,
11.
and finally.
12. Develop a multithreaded program using the Thread class and Runnable interface.
Implement thread synchronization and inter-thread communication (using wait (),
13.
notify (), notifyAll()).
Write a Java program to read from and write to a text file using FileReader and
14.
FileWriter.
Implement object serialization and deserialization to save and retrieve objects
15.
from a file.
Develop a program that performs directory-related operations (e.g., listing files in
16.
a directory).
Create a basic GUI application using Java AWT/Swing to demonstrate windows,
17.
buttons, and text fields.
Implement event handling for button clicks and mouse events in a Swing
18.
application.
 Write a simple applet program to demonstrate applet lifecycle (init(), start(),
19.
stop(), destroy()) and basic UI elements.
Write a Java program that connects to a database and performs the following
operations (Create a table, insert data into the table, Retrieve and display data
20.
from the table, update a record, Delete a record, Close the database connection)

Learning Resources
Textbooks:

• "Effective Java" by Joshua Bloch, Publisher: Addison-Wesley.

• "Thinking in Java" by Bruce Eckel, Publisher: Pearson Education.
• "Java: The Complete Reference" by Herbert Schildt, Publisher: McGraw-Hill Education.
Reference Books:
• "Object-Oriented Programming with Java: An Introduction" by David Barnes and
Michael Kolling, Publisher-Pearson Education.
• "Java: How to Program" by Paul Deitel and Harvey Deitel, Publisher: Pearson
Education.
• "Head First Java" by Kathy Sierra and Bert Bates, Publisher: O'Reilly Media.
MOOC / NPTEL Courses:
• https://onlinecourses.nptel.ac.in/noc22_cs47/preview
• https://nptel.ac.in/courses/106105191
 JSPM UNIVERSITY PUNE
F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE
SEMESTER-I
Course Type: MMC Course Title: CAD/CAM

Course Code: Teaching Scheme: Examination Scheme:

(Hours/Week)
230GMEB53_01
Credits: 2 Lecture (L): 1 Practical (PR): 50 Marks
Tutorial (T): 0 Oral (OR): 50 Marks
Practical (P): 2
Experiential Learning (EL):0
Prerequisite Courses, if any:
1. Engineering Graphics and Design
Course Objectives:
• To study the principles and concepts of Computer-Aided Design (CAD) and
Computer-Aided Manufacturing (CAM).
• To develop skills in geometric modelling and parametric design
• To enable students to understand the principles of Computer Numerical
Control (CNC) machining.
• To provide hands-on experience with CAM software for generating toolpaths
and CNC programming.
Course Outcomes: On completion of the course, learner will be able to
CO1: To understand basics of CAD/CAM
CO2: To familiarize students with CAD software tools and techniques for 2D and 3D
modeling.
CO3: Understanding of geometric modeling techniques and parametric design principles.
CO4: Ability to create and interpret engineering drawings and models using CAD software.
CO5: Ability to generate CNC programs and simulate machining operations using CAM
software
CO6: To make student conversant with knowledge of modern manufacturing technologies
and their integration with CAD/CAM systems.
Course Contents
Unit I Introduction to CAD/CAM (2 Hours)
Basic concepts and principles of CAD/CAM., Historical background and evolution of
CAD/CAM systems., Importance and applications in mechanical engineering
 Unit II Computer Graphics (3 Hours)
Introduction to engineering graphics, 2D and 3D coordinate systems, Geometric primitives
(lines, circles, curves, etc.), Transformation techniques (translation, rotation, scaling),
Viewing transformations (projection, perspective).
Unit III CAD Software Tools (3 Hours)
Introduction to popular CAD software (e.g., AutoCAD / SolidWorks / CATIA, etc.), Drawing
and editing commands, Creating and modifying 2D and 3D geometric shapes, Parametric
modeling techniques.
Unit IV Surface Modeling and Solid modelling (2 Hours)
Creation and manipulation of complex surfaces, Lofting, sweeping, and extruding
techniques, Advanced surface modeling features, Constructive Solid Geometry (CSG) and
Boundary Representation (B-rep) methods, Creation and modification of solid models,
Boolean operations (union, difference, intersection)
Unit V CAM Software Tools (3 Hours)
Introduction to CAM software (e.g., Mastercam / Gibbs CAM / CAM Works, etc.), generation
of CNC programs using G-codes and M-codes, Toolpath generation for machining
operations (milling, turning, drilling, etc.), Integration with CAD and CAM systems
Unit VI Data Exchange and Collaboration (2 Hours)
File formats for CAD/CAM data exchange (STEP, IGES, STL, etc.), Collaborative design
and concurrent engineering principles.
 JSPM UNIVERSITY PUNE
F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE
SEMESTER-I

Course Type: MMC Course Title: CAD/CAM

Course Code: Teaching Scheme: Examination Scheme:

(Hours/Week)
230GMEB53_01
Credits: 2 Lecture (L): 1 Practical (PR): 50 Marks
Tutorial (T): 0 Oral (OR): 50 Marks
Practical (P): 2
Experiential Learning
(EL):0
List of Laboratory Experiments

1. Drawing simple 2D shapes such as lines, circles, arcs, and polygons using CAD
software.
2. Practicing basic editing commands like move, copy, rotate, and mirror to modify 2D
objects.
3. Dimensioning and annotating the 2D drawings according to standard engineering
practices.
4. Creating parametric 3D models of basic geometric shapes (e.g., cubes, cylinders,
and spheres) and controlling dimensions using parameters.
5. Creating complex surfaces using loft, sweep, and revolve commands to model
parts with intricate geometries.
6. Editing and manipulating surface geometry to refine the design and meet specific
requirements.
7. Building solid models of mechanical components by extruding, revolving, and
sweeping 2D profiles.
8. Performing Boolean operations (union, difference, intersect) to combine or subtract
solid bodies to create complex shapes.
9. Generation of CNC machining programs using G-codes and M-codes.
10. Generating toolpaths for machining operations such as milling, turning, drilling, and
contouring using CAM software.
 11. Creating 3D models suitable for rapid prototyping and additive manufacturing
processes like 3D printing, stereolithography, or selective laser sintering.
12. Importing and exporting CAD/CAM data in different file formats (e.g., STEP, IGES,
STL) for interoperability with other software and manufacturing systems
Virtual LAB Links:
1. Lab Name: Virtual lab-IIT Kharagpur
Link of the Virtual Lab: http://vlabs.iitkgp.ac.in/vlt/project.html

Learning Resources
Text Books:
1. P.N. Rao, “CAD/CAM: Concepts, Tools, and Applications", Tata McGraw Hill
Publishing House
2. K. L. Narayan, “CAD/CAM: principles and Applications”, Oxford higher Education
Publications
3. M. P. Groover, “ Computer - Aided Design and Manufacturing”, Pearson Education
Reference Books:

1. Sham Tickoo "AutoCAD 2023: A Problem-Solving Approach, Basic and

Intermediate", CADCIM Technologies USA
2. Harold A. Rothbart and Thomas H. Brown, "CAM Design Handbook", Tata McGraw
Hill Publishing House
3. James D. Bethune, "Engineering Design and Graphics with SolidWorks", Pearson
publishing
MOOC / NPTEL Courses:

1. NPTEL Course “Computer Aided Manufacturing”, Prof. J. Ramkumar and Prof.

Amandeep Singh, IIT Kanpur.
Link of the Course:
https://onlinecourses.nptel.ac.in/noc20_me44/preview
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: VSC Course Title: Design Thinking and Creativity

Course Code: Teaching Scheme: (Hrs./ Week) Examination Scheme:

230IDCB01_01
Credits: 1.5 Lecture (L): 1 Oral (OR): 50 Marks
Tutorial (T): 0
Practical (P): 0
Experiential Learning (EL): 2
Prerequisite Courses, if any: ---
Course Objectives: -
• Encourage creative problem-solving by applying design thinking principles to develop
innovative solutions for real-world problems.
• Emphasize the importance of empathy to understand user needs and create human-
centered designs.
• Enable students to apply design thinking principles across various domains such as
business, engineering, product design, and social innovation.
Course Outcomes: On completion of the course, learner will be able to,
CO1: Describe the Design thinking principles of Human Centered approach to real life problem
solving
CO2: Demonstrate through the project-oriented approach the basic theories and knowledge of
design thinking and master the tools and principles of design thinking, and their
application.
CO3: Demonstrate through the project-oriented approach the basic theories and knowledge of
design thinking and master the tools and principles of design thinking, and their
application.
CO4: Analysis of various applications of design thinking.
CO5: Determine the suitable design thinking approach to solve the problem.
CO6: Develop a low fidelity prototype of the alternative Solutions to the identified Problem.
Course Contents
Unit I Design Thinking Introduction (3 Hrs)
Introduction & definition of design thinking, Principles, the process, Innovation in design
thinking, importance of design thinking method, the relationship between design thinking and
innovation & entrepreneurship. Five step method of Design thinking (Empathize, Define, Ideate,
Prototype, Test).
Class Activity: Students are asked to form groups. Classroom Project begins: Share ideas with
team members, discuss the meaning of DT, it’s importance in today’s world. Case: ABC
Nightline- IDEO Shopping Cart, (the video can be shown in classroom for discussion.)
Unit II Awareness of the five stages of design thinking, (4 Hrs)
Empathize & Define
Stage 1 & 2: Empathize & Define Introduction of the tools in the stage of empathy. Emphasize
the skills and tactics of interviews. Understand the persona, Methods of collecting the data from
interviews.
The empathy map. Establishing the Problem statement using 5 Why’s technique as a tool to
understand the root cause. (Ex.26/11 attack, rescue team not able to move with ambulance due
to stagnation) & Emphasis on establishing the "Problem Statement” only for faculty ref.
Classroom Project: Each group will write the Problem Statement by using Stages of Empathy
and technique of 5 Why’s. Each group member will do the interview round for writing the
problem statement. Take record of the interview process.
Unit III Ideate (4 Hrs)
Stage 3, Ideate Process to Find and select ideas, The creative process and creative principles,
Creativity techniques, Evaluation of ideas. Idea Generation Stage-Fine tuning process of ideas
(every team member comes up with 1 idea and passes on to next person, each idea will be
fine-tuned by each team member and ultimately matured ideas are established- round robin
method) and selection of best three ideas by voting method.
Classroom Project: Through the project, students will know how to propose a point of view
(POV) statement based on the analyses of data from user research via brainstorming and
others.
Students are asked to submit ideas as many as possible. Note in POV practice: please define
the problem which each group is finally going to resolve. The practice process: unpack the
interview data, select one interviewee as analysis target and solution. Make inferences to
generate ideas and POV statement.
Unit IV Prototype & Test (3 Hrs)
Stage 4 and 5, Prototype & Test Prototype and test stage, Prototype model, The role of
prototype and test in innovation and entrepreneurship. Prototype and the way to test,
visualization of ideas.
Classroom project: groups design the prototype to show ideas about the innovative way to
resolve the problem in the dormitory life. Concerning the test practice: Ask other group to visit
your group and test your prototype, and then in turn.
Unit V Understanding Business Viability (3 Hrs)
Checking the Business viability of selected ideas derived in stage 3 using BXT model, Tools for
the Design Journey, Pillars of Design thinking.
Unit VI Presentation and closure (3 Hrs)
The student groups will give the final presentation of the project they have done (Unit 1 to 5)
and close the DT process.

Learning Resources
Text Books:
1. Design Thinking Methodology Book Paperback, ArtBizTech, Emrah Yayici, 2016.
2. Design Thinking for Strategic Innovation, by Idris Mootee, CEO Idea Couture, Wiley 2014
Reference Books:
1. “SL Schensul, JJ Schensul, MD LeCompte”, (latest reprint) Essential Ethnographic
Methods: Observations, Interviews, and Questionnaires: (Ethnographer's Toolkit),
https://rowman.com/ISBN/9780759122017
2. Paddy Miller, Thomas Wedell-Wedellsborg, (2013), Innovation as Usual: How to Help
Your People Bring Great Ideas to Life, HBR Press
3. Tim Brown, (2010), Change by Design: How Design Thinking Transforms Organizations
and Inspires Innovation, HBR Press
4. “SL Schensul, JJ Schensul, MD LeCompte”, (latest reprint) Essential Ethnographic
Methods: Observations, Interviews, and Questionnaires: 2 (Ethnographer's Toolkit),
https://rowman.com/ISBN/9780759122017
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: AEC Course Title: Communicative English for Professionals

Course Code: 230UENM01_01 Teaching Scheme: (Hrs./Week) Examination Scheme:

Credits: 2 Lecture (L): 1 Theory (TH) : 50 Marks

Tutorial (T): 0
Practical (P): 2
Experiential Learning (EL): 0
Course Objectives:
• Remember the different aspects of communication.
• Understand basics of grammar, sentence construction and vocabulary to write and speak
effectively.
• Apply appropriate modes of expressions in written and oral communication.
• Analyze the attitude and aptitude of the speaker in the professional sphere for effective listening
skill.
• Evaluate the non-verbal clues of the speaker for effective communication.
• Cultivate students to create commendable personalities.
Course Outcomes: On completion of the course, learner will be able to
CO1: Understand and practice different types of communication.
CO2: Reflect on basic language skills-listening, speaking, reading, and writing and attempt tasks
by using
functional grammar and vocabulary effectively.
CO3: Reproduce their understanding of concepts/principles of business communication skills.
CO4: Build relationships, solve problems, ensure understanding, resolve conflicts, and improve
accuracy.
CO5: Become more self-confident and develop a strong determination.
CO6: Build social skills with ease and comfort.
Course Contents
Unit I Foundation of Communication (5 Hrs)
Importance and types of Communication. Types of communication: Verbal and Non-verbal.
Channels of communication. Barriers to Effective Communication and ways to mitigate.
Unit II Language Competency/Functional English (5 Hrs)
Basic rules of Phonics, Parts of Speech, Sentence Constructions, Prefixes and Suffixes
Unit III Business Communication at Workplace (5 Hrs)
Types of business letter, Characteristics of good business letter. Letter Components and
Layouts, Email Communication, memo.
Unit IV Mindful Listening (5 Hrs)
The purpose and types of listening, Principles of effective listening, Ways to improve listening
skills.Role of Active listening in professional interactions and conflict resolutions
Unit V Art of Effective Verbal Interaction (5 Hrs)
Identifying common fears and anxieties related to speaking. Techniques to build confidence and
overcome stage fright. Voice modulation, pitch, and pace for engaging delivery, Impromptu
Speaking.
Unit VI Effective Body Language (5 Hrs)
Basic Principles of Body Language and Nonverbal Communication, Signs and Clusters, Kinesics
& Proxemics Gesture & Posture
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: AEC Lab Course Title: Communicative English for Professionals

Course Code: Teaching Scheme:(Hrs./Week) Examination Scheme:

230UENM01_01
Credits: 2 Lecture (L): 1 Theory (TH): 50 Marks
Tutorial (T): 0
Practical (P): 2
Experiential Learning (EL): 0
Prerequisite Courses, if any: - Nil
List of Laboratory Experiments
Group A
1. Phonics
2. Parts of Speech
3. Presentation Skills
4. Tenses
5. Verbal and Non-verbal Communication
Group B
6. Listening Skills
7. Reading Skill
8. Body Language
9. Formal Writing
10. Email Writing
Virtual LAB Links:

Learning Resources
Textbook:
1. Adair, John. Effective Communication. London: Pan Macmillan Ltd., 2003.
Reference Book:
1. Carnegie, Dale. The Quick and Easy Way to Effective Speaking. New York: Pocket Books,
1977.
2. Mitra, Barun. Personality Development & Soft Skills, New Delhi: Oxford Press, 2011
MOOC / NPTEL Course:
NPTEL Course “Developing Soft Skills and Personality” by Prof. T Ravichandran, IIT Kharagpur
Linkof the Course: https://nptel.ac.in/courses/109104107
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I

Course Type: RMC Course Title: Research Methodology

Course Code: Teaching Scheme: (Hrs./Week) Examination Scheme:

230IRMM01_01
Credits: 2 Lecture (L): 2 Theory (TH): 50 Marks
Tutorial (T): 0
Practical (P): 0
Experiential Learning (EL): 0
Prerequisite Courses, if any:
1. Determinant and matrices, differentiation, and integration
Course Objectives:
• To develop a research orientation among the students and to acquaint them with
fundamentals of research methodology
• To develop an understanding of the basic framework of research process and research
design
• To develop skills in effectively searching for relevant literature sources and familiarize
with formulation of research hypotheses
• To familiarize the students about various types of data and data collection methods
• To establish a strong understanding of the foundational principles of research ethics,
integrity, and the responsible conduct of research
• To acquaint students with the process of crafting research reports and thesis
Course Outcomes: Students completing the course will be able to:
CO1: Demonstrate Proficiency in Research Fundamentals.
CO2: Identify and Frame Research Problems
CO3: Conduct Comprehensive Literature Reviews and Formulate Testable Hypotheses
CO4: Collect and Differentiate the Types of Research Data
CO5: Practice Ethical Research Conduct
CO6: Create Effective Scientific Papers Through the Application of Scientific Writing
Principles
Course Contents
Unit I Introduction to Research (5 Hours)
Meaning and Definition of Research, Objectives of Research, Characteristics of Research
Need of Research, Importance of Research, Types of Research, Research Methods vs.
Research Methodology
Unit II Problem Identification & Formulation (5 Hours)
Research Process, Research Design, Defining the Research Problem, Formulation of
Research Problem, Errors in Selecting Research Problem, Research Questions

Unit III Literature Review and Hypothesis (5 Hours)

Literature Review Concepts and Theories, Meaning of Hypothesis and Formulation of
Hypothesis, Sources of Hypothesis, Characteristics of Hypothesis, Role of Hypothesis,
Tests of Hypothesis
Unit IV Research Data (5 Hours)
Sampling Design and Types and Techniques, Types of Data, Methods of Data Collection,
Questionnaires, Observation Method and Interview Method, Case Study Method
Unit V Ethics in Research (5 Hours)
Ethics in Conduct of Research, Ethical challenges in Data Collection, Ethical issues in
Scientific Publication, Plagiarism and Self-Plagiarism, Cases of Scientific Misconduct
Unit VI Scientific Writing (5 Hours)
Preparation of Title, Keywords and Methods Section, Preparation of Figures and
Schematics, Citations and Referencing, Report writing and Presentation, Layout of a
Research Paper, Research Journals and its Impact factor, Research Metrics.

Learning Resources
Text Books:

1. Wayne Goddard, Stuart Melville, “Research Methodology: An Introduction”, Juta,

Lansdowne, Second Edition.
2. Ranjit Kumar “Research Methodology: A Step-by-Step Guide for Beginners‟, SAGE
Publications Pvt. Ltd Fourth Edition.

Reference Books:

1. Dr. C. R. Kothari, “Research Methodology: Methods and Trends‟, New Age International
(P) Limited, Publishers, Second Edition.
2. Nicholas Walliman, “Research Methods: The Basics”, Routledge – Taylor and Francis
Group, Third Edition.
3. Vinod Chandra, Anand, Hareendran “Research Methodology”, Pearson 1st Edition
4. Dr. Prabhat Pandey, Dr. Meenu Mishra Pandey, “Research Methodology: Tools and
Techniques”, Bridge Center, 2015.
5. Alan Bryman & Emma Bell, “Business Research Methods”, Oxford University Press,
Third Edition.
MOOC / NPTEL Courses:

1. NPTEL Course “Research Methodology”, Prof. Edamana Prasad, Prof. Prathap

Haridoss, IIT Madras. Link of the Course:
https://onlinecourses.nptel.ac.in/noc23_ge36/preview
2. NPTEL Course “Research Methodology”, Prof. Soumitra Banerjee, IISER Kolkata.
Link of the Course: https://archive.nptel.ac.in/courses/127/106/127106227/

Additional Web Resources:

1. https://www.coursera.org/learn/research-methods
2. https://www.coursera.org/specializations/data-collection
3. https://www.coursera.org/learn/introduction-to-academic-writing
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: LC Lab Course Title: Data Structure and Algorithm Lab
Course Code: Teaching Scheme: (Hrs./Week) Examination Scheme:
231GCAM17_01
Credits: 1 Lecture (L): 0 Practical (PR): 50 Marks
Tutorial (T): 0
Practical (P): 2
Experiential Learning (EL):0
List of Laboratory Experiments
1. Basic Programs – Control Flow Structure (Expression, Conditional, looping,
data manipulations).
2. Implement insertion, deletion, and searching in single-dimensional and multi-
dimensional arrays.
3.
Demonstrate row-major and column-major order representations of 2D arrays.
4. Implement a sparse matrix using a linked list or arrays.
5. Implement stack operations (push, pop, peek) using both arrays and linked lists.
6. Implement queue operations (enqueue, dequeue) using arrays and linked lists.
7. Implement circular queue, priority queue, and double-ended queue (deque).
8. Implement singly linked list and perform operations such as insertion, deletion,
and traversal.
9. Extend to doubly and circularly linked lists with all operations.
11. Implement Linear Search and Binary Search algorithms.
12. Implement and compare Selection Sort, Bubble Sort, Insertion Sort, Quick Sort,
and Merge Sort.
13. Implement the creation of a binary tree and perform traversals (Inorder, Preorder,
Postorder).
14. Implement a binary search tree (BST) with insertion, deletion, and searching
operations.
15. Implement a heap data structure (min-heap or max-heap) and demonstrate heap
insertion and deletion.
 JSPM UNIVERSITY PUNE

F.Y. MASTER OF SCIENCE - DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

SEMESTER-I
Course Type: LC Lab Course Title:
Introduction to Artificial Intelligence and Machine Learning Lab
Course Code: Teaching Scheme: (Hrs./Week) Examination Scheme:
240GCAM41_01
Credits: 1 Lecture (L): 0 Practical (PR): 50 Marks
Tutorial (T): 0
Practical (P): 2
Experiential Learning (EL):0
List of Laboratory Experiments
1. Basic Programs –Python Variables and Data Types.
Write a python code to create a list of the items. After creating the list write
code for the below operations:
• Print the list of items.
• Change any single element in the list.
• Append the item at the end of the list.
• Insert an element at a specified index.
• Remove an element from list.
Sort the elements.
2. Write a python program to create a dictionary. After creating the dictionary write
a code to:
• Print dictionary items.
• Access an element of the dictionary.
• Change any element of the dictionary.
• Add new element to the dictionary.
• Remove any element from dictionary.
3. Create the following DataFrame Sales containing year wise sales figures
for five salespersons in INR. Use the years as column labels, and
salesperson names as row labels.
Name 2019 2020 2021
Kapil 205 177 189
Kamini 165 175 190
Shikhar 206 157 179
 Mohini 198 183 169

• Create the DataFrame.

• Display the row labels of Sales.
• Display the column labels of Sales.
• Display the data types of each column of Sales.
• Display the dimensions, Shape, Size and values of Sales.
4. Plot the following data on a line chart and customize the chart according to the
below-given instructions:
Monthly Sales Report
Month January February March April May
Sale 510 350 475 580 600
s

• Write a title for the chart “The Monthly Sales Report “

• Write the appropriate titles of both the axes
• Write code to Display legends
• Display blue color for the line
• Use the line style – dashed
• Display diamond style markers on data points

5. Observe following data and plot data according to given instructions:

Batsman 2017 2018 2019 2020

Virat Kohli 2501 1855 2203 1223
Steve Smith 2340 2250 2003 1153
Baber Azam 1750 2147 1896 1008
Rohit 1463 1985 1854 1638
Sharma
Kane 1256 1785 1874 1974
Williamson
Jos Butler 1125 1853 1769 1436

6. WAP to create a 3*3 numpy array with all the elements as per the user choice
and print sum of all elements of the array.
• Create a bar chart to display data of Virat Kohli & Rohit Sharma.
• Customize the chart in this manner
• Use different widths
 • Use different colors to represent different years score
• Display appropriate titles for axis and chart
• Show legends. Create a bar chart to display data of Steve Smith,
Kane
Williamson & Jos Butler.
• Customize Chart as per your wish.
Display data of all players for the specific year.
7. Implement the Data Pre-processing technique using python. Take Bank
data set.Replace the data values with your own data set.
8. Using LINEAR REGRESSION technique, write a python code to predict
Housing prices if area is given.
Consider a Houseprices.csv file as below:

Sr. No. Area Price

1 2600 550000
2 3000 565000
3 3200 610000
4 3600 680000
5 4000 725000
pandas, numpy and matplotlib, sklearn libraries and develop a prediction model
using linear regression method.
9. Implementation of Polynomial Regression using Python: Use Data.csv which
includes data like below:
NOTE: Use Numpy, Pandas, Matplotlib libraries.
Sr. No. Temperature Pressure
1 0 0.0002
2 20 0.0012
3 40 0.0060
4 60 0.0300
5 80 0.0900
6 100 0.2700
10. WAP to show implementation of Apriori algorithm with suit suitable dataset. Use
Apyori algorithm.

11. Take a dataframe of Age and Expected Salary. Apply Naive Bayes algorithm
and Make predictions and display results.
Age = [22, 25, 47, 52, 46, 56, 56, 60, 62, 65], '

SalaryCategory = ['low', 'low', 'medium', 'medium', 'medium', 'high', 'high', 'high',

'high', 'high']
 Steps:
1. Import necessary libraries.
2. Create a dataset of age and salary.
3. Train the Naive Bayes model on the dataset.
4. Make predictions and display the results.
12. Implement Hill Climbing Algorithm’ using python.
Note: import random library.

13. Take Iris dataset. Replace it with your own dataset. Implement Support Vector
Machine

14. Implement Principal Component Analysis algorithm by using iris dataset.

15. Implement DBSCAN algorithm by generating synthetic dataset.

16. Implement Decision Tree Algorithm using any dataset of your choice