AI ML Course
AI ML Course
Faculty of Engineering
Total Credits: 34
Total Duration: 492
1
Semester 1 Total Credits: 3
Lecture: 3 Credits Practical:
2
Semester 2 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
PYTHON PROGRAMMING
5
Python Programming Lab
List of Programs
1. Setting up the Python Environment using Anaconda IDE : Know Jupyter & Spyder
2. Write a program to perform Functions in Python
3. Write a program in Python First Class Functions & Immutable Data
4. Write a program in Python exploring Iterators
5. Write a program in Python exploring Generators
6. Work in Python using Collections
7. Write a program in Python to perform Higher Order Function-I
8. Write a program in Python to perform Higher Order Functions-II
9. Write a program in Python to perform File Operation in Python
10. Write a program in Python to perform Data Preprocessing
11. Write a program in Python to perform Exploratory Data Analysis
12. Write a program in Python to actuate Curve Fitting
Course Learning Outcomes (CLOs):-
On completion of this course, the students will be able to:-
1. Get a hands-on programming experience.
2. Learn statistical implementations
3. Carry out exploratory data analysis
6
Semester 3 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
SUPERVISED LEARNING
7
Supervised Learning Lab
List of Programs
1. Understanding the Learning Implementation on Jupyter Notebook
2. Using NumPy functions in Jupyter
3. Using Pandas in Jupyter
4. Using SciPy in Jupyter
5. Using Simple Linear Regression, calculate Gradient and Cost minimum, Along with line
of best fit.
6. Understand Linear Regression and other regression techniques using house prices
prediction dataset.
7. Understanding Decision tree with sample dataset.
8. KNN algorithm explained with Cancer Data. (Using Python)
9. Identifying optimal K value in K-means Clustering algorithm. (Using Python)
10. Random Forest algorithm explained with classification and Regression (Using Python)
11. Implement Gradient Boosting Machine using Python.
12. Understand Logistic Regression model using Iris dataset (using Python)
8
Semester4 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
9
List of Programs
1. Write a program for using PCA on MNIST Dataset.
2. Write a program for using PCA on Cat and Dog Dataset.
3. Write a program for using LDA on Cat and Dog Dataset.
4. Write a program for using DBSCAN on IRIS Dataset.
5. Write a program for using SVD on MNIST Digits Dataset.
6. Write a program for Feature Selection Techniques (Forward/ Backward).
7. Write a program for K-Means Clustering on IRIS Dataset.
8. Write a program for Hierarchical Clustering on Customers Dataset.
9. Write a program for Neural Networks on Mobile Price Classification.
10. Write a program for Convolution Neural Network on MNIST Dataset.
11. Write a program for Convolution Neural Network on Malaria Dataset.
12. Write a program for Convolution Neural Network on Aerial Cactus Dataset.
10
Semester 5 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
11
Advanced Neural Networks Lab
List of Programs
12
Semester 6 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
13
Natural Language Processing Lab
List of Programs
1. Text Classification using Word Embeddings.
2. Find Synonyms and antonyms using Word Embeddings.
3. Introduction to Topic Modelling.
4. Converting a Foreign Language to English using Machine Translation(German to
English).
5. Twitter Sentiment Analysis.
6. Explaining Lemmatization, PoS Tagging,
7. Stemming and Tokenization using an Example.
8. Understanding Dependency Parsing in a given sentence.
9. Perform Speech to Text Conversion using PyAudio and Google Speech Recognition.
10. Creating Custom Speech Recognition Corpus.
11. Introduction to Dynamic Memory Network.
12. Dialog Generation using Deep Learning.
14
Semester 7 Total Credits: 4
Lecture: 3 Credits Practical: 2 Credits
SEARCH ALGORITHMS
Depth First Search, Disadvantages of Depth First Search,Breadth First Search, Disadvantages
of Breadth first search, Traversing a Maze, Searching for a Gift, Implementing Depth First
Search & Breadth First Search, Web Spidering, Depth First Iterative Deepening, Advantages
of Iterative deepening, Uniform-cost search: The Dijkstra's algorithm, Disadvantages of
Uniform cost search
Unit III: Heuristic Search
Hill Climbing Algorithm, Steepest Ascent Hill Climbing, Stochastic Hill Climbing, Disadvantages
of Hill Climbing - Foothills, Plateaus & Ridges
15
Search Algorithms Lab
List of Programs
5. Given a graph and a source vertex in the graph, find shortest paths from source to all
vertices in any given graph. Use Dijkstra’s algorithm.
6. What is mother vertex? Find a mother vertex in any given graph.
7. Solve the traveling salesman problem using genetic algorithm in python.
8. Imagine a real life situation, where you are using a Map (Map on a paper). You are at
point A and want to reach point B. Which algorithm you would choose and why.
9. Implement question 8, using python.
10. Explain a use case and implement Stochastic hill climbing algorithm using python.
11. Solve the 8 puzzle problem using appropriate algorithm and python.
12. Assume you have 10 given search result. Find the best solution for the keywords you
select while searching on your python console.
16
Semester 7 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
Image Processing, Elements of Image Processing System, Computer Vision, Computer Graphics,
Application Areas, Imaging Geometry, Image Sampling, Mathematical Tools, Image transformations:
2D and 3 D Transformation, Image Enhancements-Intro, Image Segmentation-Intro, Cognitive Aspects
of Color, VR/AR, Object Recognition, Object Tracking
Introduction, GUI Features, Operations: Pixel Editing, Geometric Transformations, Feature Detection,
Videon Analysis and Tracking, Stereo Imaging, Caliberation, OpenCV-Python, Image Denoising, Object
Detection, Transformation and Spatial Filtering Introduction, Functions, Histogram, Histogram
Equalization, Histogram Matching (Specification), Local Histogram Processing, Using Histogram
Statistics for Image Enhancement Introduction to Spatial Filtering, Smoothing & Sharpening Image
Fileters
Human Vision, Applications, Point Line and Edge Detection, Shot Boundary Detection, Interactive
Segmentation, Image Segmentation by Clustering Pixels, Basic Clustering Methods, The Watershed
Algorithm, Segmentation Using K-means, Graphs, Fitting, Motion Segmentation, Model Selection,
Case Studies
Introduction, Shape correspondence and shape matching, Sliding Window Method, Patterns,
Structural Methods, Deformable Objects, Tracking, Strategies, Matching, Tracking with Filters, Data
Association, Particle Filtering
17
Computer Vision & Image Processing Lab
List of Objectives
18
Semester 8 Total Credits: 4
Lecture: 3 Credits Practical: 1 Credits
REINFORCEMENT LEARNING
Unit 1: Introduction to Reinforcement Learning
SARSA, Explore & Exploit Dilemma, Multi-armed Bandits Action Value Methods, k-armed Bandit
Problem, The 10-armed Test Bed, Tracking a Nonstationary Problem, Optimistic Initial Values,
Reinforcement Comparison, Pursuit Methods, Associative Search, Gradient Bandit Algorithms, Upper-
Confidence-Bound Action Selection. The Reinforcement Learning Problem, Thompson’s Sampling
Agent- Environment Interface, Goals & Rewards, The Markov Property, Markov Decision Processes,
Value Functions, Returns & Episodes, Finite Markov-Decision, Optimality & Approximation Markov
Decision Process, Markov chains, Markov reward process (MRP). Introduction to and proof of Bellman,
Bellman equations in MRP.
Dynamic programming Policy Evaluation, Improvement, Iteration, Value Iteration, Asynchronous DP,
Generalized Policy, Efficiency of Dynamic programming, Prediction and Control by Dynamic
Programing
Monte Carlo Methods MonteCarlo Prediction, Estimation of Action Values, Monte Carlo Control, Off-
Policy Prediction, Inremental, On policy and off policy learning, Importance sampling, TD Prediction,
Optimality of TD, Actor Critic Method, Temporal Difference Learning, Q-Learning, Approximation
Methods for prediction
19
Reinforcement Learning Lab
List of Objectives
4. Computer the return agent for a particular action and choosing the best
9. Apply Monte Carlo Method to solve a problem by generating suitable random numbers
20
21