Regulation GODAVARI INSTITUTE OF ENGINEERING & TECHNOLOGY

GRBT-20 (Autonomous) III B.Tech

Course Code SOFT COMPUTING LAB II Semester
201AI612 CSE (AI/ML)
Practical Total contact hours: 48 L T P C
Prerequisite(s):--- 0 0 3 1.5

Course Objective(s)
1. To describe supervised and un-supervised learning differences
2. To describe the data science life cycle.
3. To use machine take data science into production.
4. To introducing data science, with a focus on the job outlook and market requirements.
5. To gain knowledge relate to Hands-on Applied Statistics concepts using python
6. To use Graphics and data visulization libraries in python
7. To know Machine learning algorithms, Models and case studies with python

Course Outcome(s):
After successful completion of this course, a student will be able to-
CO-1: Use deep learning techniques to build concise representations of the meanings of
words in all significant languages.
CO-2: Use machine learning methods to solve the real – world problems.
CO-3: Develop a feed forward, convolution and recurrent neural networks.
CO-4: Experiment with AI and data visualization techniques.
CO-5: Examine map reduce,Naïve Byes and K-Means clustering

List of Experiments
1. To solve the real-world problems using the following machine learning methods :
a) Linear regression b) Logistic regression
2. Implement support vector machine
3. Implement K-Means clustering & PCA
4. Implementation of map reduce
5. Implementation of Naïve Bayes
6. Exploratory Data Analysis for Classification using Pandas and Matplotlib
7. Implement a program for Bias, Variance, and Cross Validation
8. Implementation of Feed Forward Neural Networks
9. Implementation of ConvolutionNeural Networks
10. Implementation of Recurrent Neural Networks
 11. Write a program to simulate a perception network for pattern classification and function
approximation.

12. Solve optimal relay coordination as a Linear programming problem using Genetic
algorithm

13. Solve optimal relay coordination as a non-Linear programming problem using Genetic
algorithm
14. Solve economic load dispatch problem using Genetic algorithm

CO-PO Mapping:
(1: Slight [Low]; 2: Moderate[Medium]; 3: Substantial[High]; '-' : No Correlation)
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO 1 - 2 1 2 - - - - 2 - - 2 1
1
CO 2 - 2 - - 1 - - - - - - 1 2
2
CO - - - 3 2 - 1 - - - - - 2 2
3
CO 1 2 - - 3 1 - - - 1 - - 1 1
4
CO - 3 2 3 - - - - - 2 - - 1 2
5