Proposal of Lab setup of Artificial

Intelligence and Machine Learning (AI&ML)

 Module

Subject Name Data Analytics Teaching Hrs = 30

Practice/Assignment Hrs = 20
Total Hrs = 50
Teaching Scheme Examination Scheme
Teaching Practice/Assignment Total External Internal Credits
Total Marks
Hrs/Week Hrs/Week Hrs Exam Exam
4 2 6 60 40 100 4
Course Outcomes (COs)
After learning this course student will be able to,
 Deploying the Data Analytics Lifecycle to address big data analytics projects
 Reframing a business challenge as an analytics challenge
 Applying appropriate analytic techniques and tools to analyze big data, create statistical models,
and identify insights that can lead to actionable results
 Selecting appropriate data visualizations to clearly communicate analytic insights to business
Subject : Data Analytics
Sr. Chapter / Topic Details No. of
No. hrs
1 Python 8
1.1 Why Python
1.2 Setup and demo
1.3 Introduction – keyword, variables ,statement, comments input, output
operators
1.4 Flow Controls - if…else, while loop, for loop, break, continue
1.5 Data Structures- Lists, Tuples , Dictionary, Strings, Sets
1.6 Functions - Introduction, Types, Recusive Functions, Lambda Functions,
Modules, Packages, Decorators, *arg, **kwargs
1.7 File Handling
1.8 Exception Handling
1.9 Debugging
2 Preprocessing Essentials 4
2.1 Handling missing data
2.2 Scaling and Normalization
2.3 Parsing Dates
2.4 Inconsistent Data Entry
 3 Python for AI and ML 5

3.1 NumPy
3.2 Matplotlib
3.3 Scipy
3.4 Pandas
3.5 Scikit-learn

4 Machine Learning Algorithms 8

4.1 Supervised Learning
4.1.1 Regression
Simple Linear, Multiple Linear, polynomial, Support vector machine
Decision tree regression, Random forest regression
4.1.2 Classification
Logistic Regression, k-nearest neighbor(k-nn), Naïve Bayes,
Decision tree classification, Random forest classification
4.2 Unsupervised Learning
4.2.1 Clustering
4.2.2 k-means clustering
4.2.3 Hierarchical clustering
4.3 Reinforcement Learning
4.3.1 Natural Language Learning
4.3.2 Dimensionality Reduction
4.3.3 Model Selection Boosting
5 Deep Learning 5
5.1 Understanding Neural Networks with TensorFlow
5. 2 Deep dive into Neural Networks with TensorFlow
5. 3 Master Deep Networks
5.4 Convolutional Neural Networks (CNN)
5.5 Recurrent Neural Networks (RNN)

Reference Books:

1.Introducing Python-Mordern Computing in Simple Packages by Bill Lubanovic

O'Reilly
Media
2. Beginners Guide to Python Programming: Learn Python 3 Fundamentals by Serhan
Yamacli
3. Data Mining Concepts and Techniques,Third Edition Jiawei Han,Jian Pei,Kamber
4. Python Machine Learning by Wei-Meng Lee wiley publication
5. Applied Supervised Learning with Python: Use scikit-learn by Benjamin Johnston, Ishita
Mathu
6. Python Machine Learning By Wei-Meng Lee
7. Deep Learning With Python: Develop Deep Learning Models By Jason Brownlee
Sr.
Deliverables Description
No.
 AI-DL Workstation Hardware :
- 2 x Intel Xeon 16 Core CPU,
- Mother Board having dual socket for 2x16 Core CPU
- 2 x 32GB DDR4 ECC RAM(256 GB),
- 1 x 2TB SATA HDD’s,
- 1 x 240GB SATA SSD,
- 1 x 1000W SMPS Power supply ,
- Tower Mount Cabinet chassis
- 18” Monitor/Display compatible with Machine
- USB Mouse & Keyboard
AI/DL Machine:
1 - GPU: 2 x NVIDIA® RTX A5000 PCIe Gen 4 – 24GB (Total = 48 GB)
(Qty=1)
 Included Software Libraries & OS:
The setup contains Ubuntu OS (16.04/ 18.04) with the following pre-
installed libraries, utilities, tools and SDKs.
Essentials Utilities: CUDA, cuDNN, TensorRT
Machine Learning: vowpal wabbit, XGBoost,Numpy, Scikit, Pandas, other
relevant Py libs
Deep Learning: NVidia DIGITS, Tensor Flow, Caffe, Caffe2, PyTorch, Torch,
Theano
Dataset: Image Net, CIFAR-10, KITTI pre-loaded for out-of-box
development
 Edge Computing Embedded Hardware for Deep Learning Inference
Platform comprises of 6-core Carmel ARMv8 CPU, 384-core Volta GPU, 8GB
LPDDR4, 16GB eMMC(optional), 2x 4kp30 H.264/H.265 encoder & 2x
4kp60 H.264/H.265 decoder, MIPI CSI-2 lanes,2x PCIe controllers,
 Ports and Peripherals includes: 4x USB 3.1 A, USB 2.0 Micro B, 2x MIPI CSI-
2, HDMI 2.0, DisplayPort 1.4, Gigabit Ethernet, M.2 Key-E with PCIe, M.2
Key-M NVMe with PCIe, MicroSD card slot, 2x I2C, 2x SPI, UART, I2S, GPIOs
etc.,
 128GB SSD along with pre-loaded Linux OS having tools like OpenCV, Open
GL, Vulkan, Tensor Flow, Tensor RT, CUDA, VisonWorks etc…
 18” HDMI Display and USB mouse-Keyboard
Edge Computing
 Software Eco System configured to work with GPU Board for Edge
Embedded Hardware
Computing & Deep Learning Inference,
2 for Deep Learning
 Software Eco System also configured to work with Advance Image/Video
Inference
Processing & Advance vision applications with camera setup along with
(Qty=5)
examples on OpenCV, OpenGL, Vulkan, VisionWorks and CUDA and its
documentation
 Relevant / compatible softwares for interfacing of Thermal Camera and
3D/Stereo Camera need to be installed along with resources for high-end
camera applications
 Demonstration of the implementation of remote inference of a trained
deep learning model on embedded board along with examples and its
documentation
 Demonstration of Advance Image/Video Processing & Advance vision
applications with various camera setup along with examples on OpenCV,
OpenGL, Vulkan, VisionWorks and CUDA and its documentation
 Thermal camera (Qty = 5)
 Frame Rate: 8.6 Hz, Pixel Size: 17 µm
 Radiometric Accuracy: High gain: Greater of +/- 5°C or 5% (typical)
Low gain: Greater of +/- 10°C or 10% (typical)
 Scene Dynamic Range: -10-140 °C (high gain); up to 450°C (low gain)
 Spectral Range: 8 µm to 14 µm; Thermal Sensitivity: 0.050° C
 Non-Operating Temperature Range: -40 °C to +80 °C
 Optimum Temperature Range: -10°C to +80°C
 Array format: 80 × 60, progressive scan
 FOV - Diagonal: 63.5° & Horizontal: 50° (nominal)
 Thermal video over USB & Powered via USB
 GPIO and peripheral breakouts to easily attach other devices
 UART, I2C, and GPIO Expansion
3D- Stereo camera (Qty = 5)
 Infrared (IR) camera resolution 512 × 424 pixels
 RGB camera resolution 1920 × 1080 pixels
 Field of view 70 × 60 degrees, 7x7 depth pixels per degree
 Framerate: 30 FPS
 Operative measuring range: from 0.5 to 4.5 m
Camera Setup
3
(5 Set)  Recommended min. distance: 1.4m & max. distance: 4m
 Microphone array 4 microphones, 48KHz
 Object pixel size (GSD) between 1.4 mm (@ 0.5m range) and 12 mm
(@ 4.5m range)
Night vision camera (Qty = 5)
• Interface USB
• Image sensor CMOS
• Lens 5P High quality lens
• Video resolution 1920x1080 – 30 FPS
IP camera – wireless (Qty = 5)
• Resolution 1920 x1080
• Video Compression H.264
• FPS 15
• Wireless 802.11 b/g/n
• Night Vision yes up to 30ft.
USB camera (Qty = 5)
• Resolution 720p/30FPS
• Focus type fixed focus
• Interface USB
• Lens 5P High quality lens
• Built-in mic Mono
 13th Gen Intel® Core™ i7-13700
Desktop PC  Intel® UHD Graphics 770
4.
(20 Qty)  8 GB, 2 x 8 GB, DDR4, 3200 MHz
 512 GB, M.2, PCIe NVMe, SSD
Programme Name MCA (Artificial Intelligence and Machine Learning)
Level: Post Graduate

Programme duration: 2 Years

Programme Scope

This unique programme provides career options for the students in the fast-growing technology
sectors of Artificial Intelligence and Machine Learning. In addition to all the mandatory y
subjects of a traditional post graduate programme, this specialized programme offers in-depth
practical know-how of the current trends in Artificial Intelligence. These sectors have the
potential to grow exponentially and they provide challenging job opportunities for young
professionals with the right skill sets.

Programme Introduction

Master of Computer Application (MCA) is a postgraduate program in Computer Applications.

With the rapid growth of the IT industry in India, the demand for computer professionals is
increasing day by day. This increasing growth of the IT industry has created alot of opportunities
for computer postgraduates.

Master of Computer Application (MCA) is one of the popular courses among the students who
want to make their career in the computer applications field with specialization in Artificial
Intelligence. The duration of the course is two years and divided into four semesters. Artificial
Intelligence (AI) is the sub-area of computer application devoted to creating software and
hardware to get computers to do things that would be considered ‘intelligent’ as if people did
them. Artificial intelligence has an exciting history and is now a mature area. Machine Learning
is the field of study that gives computers the capability to learn without being explicitly
programmed but by getting trained. Many of the research discoveries have now reached the
point of industrial application and many companies have made and saved millions of dollars by
utilizing the results of AI a n d M L research. However the goal of emulating human
intelligence has not been reached and many stimulating and challenging problems remain. The
challenging problems which humans find difficult to solve, can be tackled using sophisticated
technology of AI Sciences.
 The Specialization programme on Artificial Intelligence covers the following subject matters.
Foundational IT topics such as Computer programming; data structures; database management;
operating systems; computer networks; object-oriented programming with Python & Java and
Operating System Concepts. Specialization courses on Artificial Intelligence: Artificial Neural
Networks, Machine Learning, Advanced Machine Learning, Deep Learning, Digital Image
Processing, Natural Language processing, Chat-bot development and Computer Vision.

Artificial Intelligence & Machine Learning

The Master of Computer Application in Artificial Intelligence and Machine Learning is designed
to provide technical training to the student in the field of Artificial Intelligence and Machine
Learning. Upon successful completion you will be able to understand and solve complex
machine learning problems with:

● Programming language skills in Python and Table auto be able to synthesize large
unstructured data sets.
● Competencies in data mining, regression analysis, text mining, and predictive analytics.
● Deploy and Scale AI and ML applications with concepts and skills in machine learning
to prepare you to build, tune, and discover actionable insights from predictive models.
● Choose from the following electives: Advanced Machine Learning areas like Computer
Vision, Natural language processing(NLP), Big Data, Robotics, and Reinforcement
Learning.

3 | Page
Development of Artificial Intelligence (AI) applications is devoted to creating software and
hardware to get computers to do things that would be considered ‘intelligent’ as if people did
them. Many of the research discoveries have now reached the point of industrial application,
and many companies have made and saved millions of dollars by utilizing the results of AI
research. However, the goal of emulating human intelligence has not been reached and many
stimulating and challenging problems remain. The challenging problems which humans find
difficult to solve, can be tackled using sophisticated technology of AI Sciences.

Indian Scenario
The Indian IT and start-up sector shave a lot to benefit from AI. It will offer companies
unparalleled advantage of data-driven decision-making which will improve their efficiency and
provide cost effective alternatives to certain business processes. Start-ups that are basic can
adopt and integrate AI technology to make their business process data and intelligence-driven,
giving the most value for their investment in Artificial Intelligence.

Global Scenario
Tech giants and digital native companies such as Amazon, Apple, Baidu, and Google are
investing billions of dollars in the various technologies known collectively as artificial
intelligence. They see that the inputs needed to enable AI to finally live up to expectations—
powerful computer hardware, increasingly sophisticated algorithmic models, and a vast and
fast-growing inventory of data—are in place. Indeed, internal investment by large corporations
dominates to $18 billion to $27 billion in 2024; external investment (from VCs, PE firms,
M&A, grants, and seed funding) was around $8 billion to $15 billion.
Career Outcomes

Career Path–Artificial Intelligence and Machine Learning

Career Progression Path– Artificial Intelligence and Machine Learning

Job Role Entry-level (0-4 yrs exp.) Mid-level (5-8 yrs exp.)

Data Scientist ₹ 5,00,000 – 7,00,000 per year ₹ 7,00,000 – 9,00,000 per year

AI Developer ₹ 5,00,000 – 6,50,000 per year ₹ 7,50,000 – 9,50,000 per year

NLP Analyst ₹ 5,00,000 – 6,50,000 per year ₹ 7,00,000 – 10,00,000 per year

Researcher ₹ 5,00,000 – 6,50,000 per year ₹ 7,50,000 – 8,50,000 per year

Statistician ₹ 5,00,000 – 6,50,000 per year ₹ 8,50,000 – 12,00,000 per year

Programme Objectives
The MCA (Artificial Intelligence and Machine Learning) has been designed to cater to the
regional, national and global requirements of the IT professionals. The postgraduate will be
able to articulate and solve problems related to the Artificial Intelligence field and can take
upinterdisciplinaryprojects.Theobjectiveistoprepareentrepreneurs and workforce for the public
and private sector in related fields.

Curriculum
Semester- 01
Subject Subject Name Category External Internal Marks Credits
Code of Sub. Marks Marks
1 Probability and statistics Core 60 40 100 3
2 Python Programming Core 60 40 100 3
3 Data structures and Algorithms Core 60 40 100 3
4 Database Management Systems Core 60 40 100 3
5 Operating System Principles Core 60 40 100 3
6 Soft skills development AECC 30 20 50 2
7 LAB - Python Programming DSEC 30 20 50 2
8 LAB -Database Management Systems DSEC 30 20 50 1
9 LAB- Data structures and Algorithms DSEC 30 20 50 1
10 LAB-Operating System Principles DSEC 30 20 50 1
Total 750 22
 Semester- 02
Subject Category External Internal
Subject Name Marks Credits
Code of Sub. Marks Marks
1 Inferential Statistics Core 60 40 100 3
2 Artificial Neural Networks Core 60 40 100 3
3 Machine Learning Core 60 40 100 3
4 Natural Language Processing Core 60 40 100 3
5 Digital Image Processing Core 60 40 100 3
Principles & Practices of management
(PPM)
6 Allied 30 20 50 2
OR
Green Computing
7 LAB- Artificial Neural Networks DSEC 30 20 50 1
8 LAB-Machine Learning DSEC 30 20 50 2
9 LAB- Natural Language Processing DSEC 30 20 50 1
10 LAB- Digital Image Processing DSEC 30 20 50 1
Total 750 22
 Semester- 03
Subject Category External Internal
Subject Name Marks Credits
Code of Sub. Marks Marks
1 Deep Learning Core 60 40 100 3
2 Exploratory Data Analysis Core 60 40 100 3
3 Advanced Machine Learning Core 60 40 100 3
Social Media Analytics
4 Elective-I 60 40 100 3
Reinforcement Learning
Big DataAnalytics
5 Elective-II 60 40 100 3
Time series Analysis
Principles & Practices of management
(PPM)
6 GEC 30 20 50 2
OR
Green Computing
7 LAB-Deep Learning DSEC 30 20 50 1
8 LAB-Exploratory Data Analysis DSEC 30 20 50 1
9 LAB-Advanced Machine Learning DSEC 30 20 50 1
LAB-Social Media Analytics
10 Elective-II 30 20 50 1
LAB-Reinforcement Learning
LAB-Big DataAnalytics
11 Elective-IL 30 20 50 1
LAB-Time series Analysis
Total 800 22

Semester- 04
Subject Category External Internal
Subject Name Marks Credits
Code of Sub. Marks Marks
1 Internship/ Final Project Core 200 100 300 12
2 Computer Vision Core 60 40 100 3
Chatbot Development
3 Elective-III 60 40 100 3
Intelligent process automation
Lokmanya Tilak – Maker of modern 50 50 2
4 GEC
India
5 LAB- Computer Vision DSEC 30 20 50 1
LAB-Chatbot Development
6 Elective-III 30 20 50 1
LAB- Intelligent process automation
Total 650 22
 Syllabus
Semester- 01
Subject Subject Name Category External Internal Marks Credits
Code of Sub. Marks Marks
1 Probability and statistics Core 60 40 100 3
2 Python Programming Core 60 40 100 3
3 Data structures and Algorithms Core 60 40 100 3
4 Database Management Systems Core 60 40 100 3
5 Operating System Principles Core 60 40 100 3
6 Soft skills development AECC 30 20 50 2
7 LAB - Python Programming DSEC 30 20 50 2
8 LAB -Database Management Systems DSEC 30 20 50 1
9 LAB- Data structures and Algorithms DSEC 30 20 50 1
10 LAB-Operating System Principles DSEC 30 20 50 1
Total 750 22

Course Name: Probability and Statistics

Course Code:
Course Objectives:
• Identify the types of random variables involved in a given problem and calculate relevant
probabilities.
• Compute probabilities, expectations, covariance, and correlations of jointly distributed random
variables.
• Explain practical implications of expectation and variance and how they predict the shapes of
distribution and density (mass) functions of a random variable.
• Find probability information of a random variable which is defined as a function of another or
several other random variables.
• Represent given data graphically and compute descriptive statistics.
• Describe an appropriate statistical model for the given data and compute population
parameters using appropriate estimators.

Course Content:
Theory

Module 1: Introduction to Probability and Statistics Theory

History of probability theory, definition of various terms related to probability – trial, events,
exhaustive events, mutually exclusive events, equally likely events, independent events, introduction
to a priori probability, limitations of classical probability, statistical or empirical probability, theory
of sets, elements of sets, operations on sets, algebra of sets, axiomatic approach to probability,
probability function, theorems on probabilities of events, law of probability theory, Introduction to
conditional probability and expectations, examples for conditional probability and expectation,
properties of conditional random variables, Bayes theorem & Independence, application of Bayes
Theorem. History of statistics, importance of statistics in different field of research, Types of
statistics, types of data, variables, types of variables – based on measurement, based on observation,
difference between cross sectional and time series data, parameter, estimation, estimator, probability
distribution function, probability density function, sampling distribution and standard error, basic
arithmetic operators in statistics, application of statistics in different research areas.

Module 2: Theory of Random Variables and Expectations

Random variables- discrete, continuous and mixed random variables, statistical properties of random
variables, Expectation of a random variables, expectation of random variable in terms of variance and
covariance, jointly distributed random variables, moment generating function, characteristic function,
limit theorems related to random variables. Mark of inequality, Chebyshev’s inequality.

Module 3: Correlation and Regression

Introduction to bivariate statistics, Scatter plot, Correlation analysis, properties of correlation
coefficient, significance of single correlation coefficient, significance of multiple correlation
coefficient, linear model, assumptions of linear model, estimation of parameters using OLS,
properties of regression coefficients, significance of regression coefficient, multiple line are
regression analysis, assumptions, significance of estimated parameters.

Module 4: Summarizing Data Using Statistical Measures

Descriptive Statistics – Measure of central tendency - Mean: Arithmetic mean, geometric mean and
harmonic mean with its mathematical properties, mathematical relationship among these different
means, median for raw data–odd number and even number, grouped data, mode for raw data grouped
data, properties mean, median and mode and relationship among mean, median and mode, measure of
dispersion – standard deviation, variance, covariance and its properties, coefficient of variation,
quartiles, quartile deviation and mean deviation, Mean Absolute deviation, graphical representation
of data: Uni-dimensional, bi- dimensional and multidimensional.

Module 5: Testing of Hypothesis

Introduction to testing of hypothesis, Statistical assumptions, Level of significance, confidence level,
TypeI Error, Type error, Critical value, power of the test, sampling distribution, small sample test – t
test for one and two sample mean, F test, Large Sample test – Z test for equality of single mean,
equality of two sample mean, equality of single proportion, equality of two sample proportions,
multiple comparison of sample means, one way analysis of variance with unequal sample sizes,
Introduction to general linear model, assumptions of ANOVA, factors and levels in ANOVA, layout
of one way ANOVA, skeleton of one way and two way ANOVA, calculation and examples for one-
way and two- way ANOVA, multiple comparison of sample means, one way analysis of variance
with unequal sample sizes, two factor analysis of variance – introduction and parameter estimation,
two way analysis of variance with interaction, Post ANOVA: testing of hypothesis for significance of
mean using Fishers Least Significance Difference test (lsd), TukeystestDunnet test, Duncan Multiple
Range test. Neyman-Pearson Fundamental Lemma

Course Outcomes:
• Define basic probability and statistics
• Understanding the measures of central tendency and dispersion
• Apply hypothesis testing
• Apply correlation and regression methods
Text Books:
1. Fundamentals of mathematical statistics – SC Gupta and VK Kapoor, Sultan Chand & Sons
Publication, New Delhi
2. Introduction to probability Models, Ninth Edition – Sheldon M. Ross, Elsevier Publication,
Academic Press, UK.
Reference Books:
1. Introduction to probability Models, Ninth Edition – Sheldon M. Ross, Elsevier Publication,
Academic Press, UK
2. Introduction to Probability and Statistics for Engineers and Scientists, Third Edition - Sheldon
M. Ross, Elsevier Publication, Academic Press, UK
3. An introduction to Probability and Statistical Inference – George Roussas, Academic Press
Course Name: Python Programming
Course Code:
Course Objectives:
• To setup the environment to run the python programs
• To understand concepts about Data Types and Looping techniques
• To understand and implement the OOP concepts, Decorators, and Iterators
• To understand and build the Web Applications
• Debugging and Troubleshooting Python Programs

Course Content:
Theory

Module 1: Introduction to Python

Introduction: Introduction to Python, Setting up the environment, Installing Python, Running python
program, Python’s execution model, Guidelines on how to write good, The Python culture, A note on
the IDEs
Built-in Data Types: Numbers, Immutable sequences, Mutable sequences, Set types,
Mapping types – dictionaries, The collections module, Final considerations
Iterating and Making Decisions: Conditional programming, Looping, Putting this all together.

Module 2: Advanced Concepts

Functions, the Building Blocks of Code: Use of functions, Scopes and name resolution, Input
parameters, Return values, Recursive functions, Anonymous functions, Function attributes, Built-in
functions, Importing objects.
Saving Time and Memory: map, zip, and filter, Comprehensions, Generators, Some performance
considerations, Name localization, and Generation behavior in built-ins.
Advanced Concepts – OOP, Decorators, and Iterators: Decorators, Class and object namespaces,
Attribute shadowing, Initializing an instance, Accessing a base class, Multiple inheritance, Static and
class methods, Private methods and name mangling, The property decorator, Operator overloading,
Polymorphism

Module 3: Web Development

The Edges – GUIs and Scripts: Scripting-The imports, Parsing Arguments, The business logic, GUI
application- The import, The layout logic, The business logic, The tkinter.tixmodule,The turtle
module, wxPython, PyQt, and PyGTK, The principle of least astonishment, Threading considerations.
Web Development Done Right: Django design philosophy, The Django URL dispatcher, Setting up
Django, Adding the Entry model, Customizing the admin panel, Creating the form, Writing the views,
Tying up URLs and views, Writing the templates, Writing a Flask view, Building a JSON quote server
in Falcon.

Module 4: Cloud Native Python

Building Microservices in Python: Modelingmicroservices, Buildingmicroservices, Testing the
RESTful API.
Building a Web Application in Python: Getting started with applications, Working with Observables
and AJAX, Binding data for the adduser template, Working on Observables with AJAX for the
addtweet template, Data binding for the addtweet template, CORS - Cross-Origin Resource Sharing,
Session management, Cookies.
Interacting Data Services: MongoDB terminology, Initializing the MongoDB database, Integrating
micro services with MongoDB, Working with user resources, Working with the tweets resources.

Module 5: Exception Handling

Testing, Profiling, and Dealing with Exceptions: The anatomy of a test, Testing guidelines, Unit
testing, Test-driven development, Exceptions, Profiling Python.
Debugging and Troubleshooting: Debugging with print, Debugging with a custom function,
Inspecting the traceback, Using the Python debugger, Inspecting log files, Other techniques,
Troubleshooting guidelines.

Course Outcomes:
On successful completion of the course, students will be able to,
• Install and Run Python Program
• Write functions and Loops in the python program
• Implementing OOPs concepts while writing Python Program
• Developing web applications using Django
• Build microservices in Python
• Test, Debug and Troubleshoot Python Programs

Text Books:
1. Learn Python Programming, 2nd Edition by Fabrizio Romano
2. Python Cookbook, 3rd Edition by David Beazley (Author), Brian K. Jones

Reference Books:
1. Python Programming: A Step-by-Step Guide For Absolute Beginners by Brian Jenkins and
ATS Coding Academy
2. Python and AWS Cookbook: Managing Your Cloud with Python and Boto by Mitch Garnaat
3. Advanced Python Programming: Build high performance, concurrent, and multi-threaded apps
with Python using proven design patterns by Dr. Gabriele Lanaro
4. Programming Google App Engine with Python: Build and Run Scalable Python Apps on
Google's Infrastructure by Dan Sanderson

List of Practical’s
Experiments:
1. Write a python code to find given number is prime or not
2. Write a python code to find LCM and GCM of a given list
3. Write a python code to find mean and standard deviation of a given list of numbers
4. Write a python code to add and delete element from a dictionary using functions
5. Write a python code to print 10 student details using class and lists
6. Write a python code to find student from a given list using class
7. Write a python code to inherit employee class to student class
8. Write a python code to build simple GUI calculator
9. Write a python code to build web page with student registration form
10. Write a python code to build web pages with sign-in and sing-up forms
11. Write a python code to build Rest api for product
12. Write a python code to build Ajax enabled web application for product
Course Name: Data structures and Algorithms
Course Code:
Course Credit: 3-0-2
Course Objectives:
• A data structure is a particular way of storing and organizing data in a computer so that it can
be used efficiently using different types of algorithms and search.
• Different kinds of data structures are suited to different kinds of applications and some are
highly specialized to specific tasks.
• This course covers the basic concepts of different data structures which are the basic building
blocks to analyse trees, graphs and its functionalities

Course Content:
Theory
Module 1: Fundamentals of Algorithms
Algorithm definitions, Asymptotic notations, O-notation, Omega notation and theta notation. Time
complexity and space complexity, Average and worst case analysis, Analysing control statements,
Recursion.

Module 2: Types of algorithms

Sorting and searching algorithms, Divide and conquer algorithms, Greedy algorithms, Dynamic
programming, Graph Algorithms, String matching, The class P and NP problems.

Module 3: Linear Data Structures

Arrays and operations. Stacks: LIFO structure, create, POP, PUSH, delete stack. Queues: FIFO
structure Priority Queues, Circular Queues, operations on Queues.
Linked Lists: Nodes, Linked List operations: Create List, Insert Node (empty list, beginning, Middle,
end), Delete node (First, general case), Search list, Retrieve Node, add node, Remove node, Print List.

Module 4: Trees
Introduction to Trees, Binary Trees :Travesals (breadth-first, depth-first),
Expression Trees: Infix, Prefix, Postfix Traversals. Search Trees, Binary Search Trees, B Trees, AVL
trees. Heaps: Structure,
Basic algorithms – Reheap Up, Reheap Down, Build heap, Insert, Delete.

Module 5: Graphs: Terminology,

Operations: Add vertex, Delete vertex, Add Edge, Delete Edge, Find vertex, Traverse Graph: Depth-
First, Breadth-First.
Graph Storage Structures :Adjacency Matrix, Adjacency List.

Course Outcomes:
• Recognize basic data structures such as arrays, linked lists, stacks and queues.
• Identify different parameters to analyze the performance of an algorithm.
• Apply Algorithms for solving problems like sorting, searching, insertion and deletion of data.
• Outline appropriate data structure while designing the algorithms.
• Compare the Trees, Graphs and its functionalities
Text Books:
1. Aaron M. Tenenbaum, YeedidyahLangsam, Moshe J. Augenstein, “Data structures using C
and C++”, Pearson Education.
2. Lipschutz: Schaum’s outline series Data structures Tata McGraw-Hill
Reference Books:
1. Bandyopadhyay, Data Structures Using C Pearson Education
2. Introduction to Algorithms, TH Cormen, CE Leiserson, RL Rivest, C Stein, PHI
3. Data Structures - A Pseudocode Approach with C, Richard. F. Gilbergand Behrouz. A.
Forouzan, Thomson Course Technology
4. Fundamentals of Data Structures, Ellis Horowitz and SartazSahni

List of Practical’s
Experiments:
1. Write a program in C to count the frequency of each element of an array.
2. Write a program in C to count a total number of duplicate elements in an array.
3. Write a program in C to insert New value in the array (sorted list).
4. Write an algorithm and find the efficiency of the same for following problems:
a. Finding Factorial – Iterative Approach and Recursive Approach
b. Printing Fibonacci Series – Iterative Approach and recursive approach
5. Design an algorithm and implement programs for any 3 of the below:
a. Insertion Sort
b. Selection Sort
c. Bubble Sort
d. Count Sort
e. Linear Search
6. Design an algorithm and implement a program for:
a. Merge Sort
b. Binary Search
7. Design an algorithm and implement a program to solve Knapsack Problem
8. C Program to Reverse a Stack using Recursion.
9. C Program to Implement Two Stacks using a Single Array & Check for Overflow &
Underflow.
10. C Program to Check String is Palindrome using Stack.
11. C Program to Identify whether the String is Palindrome or not using Stack.
12. C Program to Implement Queues using Stacks.
13. Write a program to implement a linked list and traverse the list. Print all the elements
traversed.
14. Write a program to illustrate insertion in linked list as per following:
a. Insertion in the beginning.
b. insertion at the end
c. insertion in the intermediate position given by user.
15. Write a program to illustrate deletion in linked list as per following:
a. deletion in the beginning.
b. deletion at the end
c. deletion in the intermediate position given by user.
16. Write a program to reverse the linked list.
17. Write a program to sort the elements in linked list.
18. Write a program to illustrate insertion in circular linked list as per following:
a. Insertion in the beginning.
b. insertion at the end
c. insertion in the intermediate position given by user.
19. Write a program to implement binary tree.
20. Write a program to implement AVL tree.
21. Write a program to implement binary max heap.
22. Write a program to implement breadth first search using necessary data structure.
23. Write a program to find minimum spanning tree in graph using prims algorithm.
24. Write a program to find minimum spanning tree in graph using kruskals algorithm.
Course Name: Database Management Systems
Course Code:
Course Objectives:
• Provide an introduction to the management of different database systems.
• Emphasize the understanding of the fundamentals of relational systems including data models,
database architectures, and database manipulations.
• Learn new developments and trends such as Internet database environment and data
warehousing.
• Gain knowledge on database problem-based approach.

Course Content:
Theory

Module 1: Comparison between different databases, RDBMS and SQL

Significance of Databases, Database System Applications, Advantages and Disadvantages of different
Database Management systems, Comparison between DBMS, RDBMS, Distributed and Centralized
DB. RDBMS and SQL: Relational Query Languages, The SQL Query Language, Querying Multiple
Relations, Creating Relations in SQL, Destroying and Altering Relations, Adding and Deleting
Tuples, Integrity Constraints (ICs), Primary and Candidate Keys in SQL, Foreign Keys, Referential
Integrity in SQL, Enforcing Referential Integrity, Categories of SQL Commands, Data Definition,
Data Manipulation Statements: SELECT - The Basic Form Subqueries, Functions, GROUP BY
Feature, Updating the Database, Data Definition Facilities, Views, Embedded SQL *, Declaring
Variables and Exceptions, Embedding SQL Statements, Transaction Processing, Consistency and
Isolation, Atomicity and Durability, Dynamic SQL.

Module 2: Normalization and Query Optimization

Functional Dependency, Anomalies in a Database, The normalization process: Conversion to first
normal form, Conversion to second normal form, Conversion to third normal form, The boyce-code
normal form(BCNF), Fourth Normal form and fifth normal form, normalization and database design,
Denormalization Query Optimization: Algorithm for Executing Query Operations: External sorting,
Select operation, Join operation, PROJECT and set operation, Aggregate operations, Outer join,
Heuristics in Query Optimization, Semantic Query Optimization, Converting Query Tree to Query
Evaluation Plan, multi query optimization and application, Efficient and extensible algorithms for
multi-query optimization, execution strategies for SQL sub queries, Query Processing for SQL
Updates Query Execution: Introduction to Physical-Query-Plan Operators, One-Pass Algorithms for
Database, Operations, Nested-Loop Joins, Two-Pass Algorithms Based on Sorting, Two-Pass,
Algorithms Based on Hashing, Index-Based Algorithms, Buffer Management, Parallel Algorithms for
Relational Operations, Using Heuristics in Query Optimization, Basic Algorithms for Executing
Query Operations.

Module 3: Adaptive Query Processing and Query Evaluation

Query processing mechanism:eddy , eddy architecture , how eddy allows for extreme flexibility ,
properties of query processing algorithms, why adaptive query processing is needed, , where it is most
appropriately used, Hardware and Workload Complexity , User Interface Complexity, Data
Complexity, Synchronization Barriers in query processing, Robust Query Processing through
Progressive Optimization. query evaluation techniques for large databases, Query evaluation
plans Concurrency Control Serializability: Enforcing, Serializability by Locks, Locking Systems
With Several, Lock Modes, Architecture for a Locking Scheduler Managing Hierarchies of Database
Elements, Concurrency Control by Timestamps, Concurrency Control by Validation, Database
recovery management.
Transaction processing: Introduction of transaction processing, advantages and disadvantages of
transaction processing system, online transaction processing system, serializability and recoverability,
view serializability, resolving deadlock, distributed locking. Transaction management in multi-
database system, long duration transaction, high-performance transaction system.

Module 4: Parallel Database Architectures and Object Oriented DBMS

Parallel Database Architectures for parallel databases: Parallel query evaluation, Parallelizing
individual operations, I/O Parallelism, Inter query Parallelism, Intra query Parallelism, Intra operation
Parallelism, Interoperation Parallelism, Design of Parallel Systems. Object Oriented DBMS Overview
of object: oriented paradigm, OODBMS architectural approaches, Object identity, procedures and
encapsulation, Object oriented data model: relationship, identifiers, Basic OODBMS terminology,
Inheritance , Basic interface and class structure, Type hierarchies and inheritance, Type extents and
persistent programming languages, OODBMS storage issues.
DDB: Distributed Database Introduction of DDB, DDBMS architectures, Homogeneous and
Heterogeneous databases, Distributed data storage, Advantages of Data Distribution, Disadvantages of
Data Distribution Distributed transactions, Commit protocols, Availability, Concurrency control &
recovery in distributed databases, Directory systems, Data Replication, Data Fragmentation.
Distributed database transparency features, distribution transparency.

Module 5: Object Relational and Extended Relational Databases, XML

Object Relational and Extended Relational Databases: design techniques used in RDBMS, extension
techniques in RDBMS, standards for OODBMS products and applications: ODMG-93 standards,
ODMG Smalltalk binding, SQL3, Nested relations and collections, Storage and access methods ,
Implementation issues for extended type , Comparing RDBMS, OODBMS &ORDBMS. XML Query
processing and Database application: XML query languages: XML-QL, Lorel, Quilt, XQL, XQuery,
and Approaches for XML query processing, Query processing on relational structure and storage
schema, XML database management system.
Database application: Active database: starburst, oracle, DB2, chimera, Applications of active
database, design principles for active rules, Temporal database, special, text and multimedia database.
Video database management: storage management for video, video preprocessing for content
representation and indexing, image and semantic-based query processing, real time buffer
management.

Course Outcomes:
Students will be able to:
• Choose various advance SQL queries related to Transaction Processing and Locking using
concept of Concurrency control.
• Experiment with various Normalization techniques for building robust databases.
• Employ PL/SQL programming using concept of Cursor Management, Error Handling, Package
and Triggers.
• Examine a simple database system and demonstrate competence with the fundamental tasks
involved with modelling, designing, and implementing a DBMS.
• Explain process query and techniques involved in query optimization.

Text Books:

1. McGraw Hill- 7th edition (21 july 2021)- McGraw Hill Education( India) Private Limited-
 “Database System Concepts.”
2. Vayu Education of India (1 January 2021)- India- Zero to Mastery in Database Management
System- Author-Dr. R.K Jain.

Reference Books:
1. BPB Publications (11January 2021)- Database Technologies: “A” Level Made Simple- By
Prof. Satish Jain (Author), Shashi Singh (Author)

List of Practical’s
Experiments:
1. Perform queries for DCL Commands and Locks
2. Implement authorization, authentication, privileges on database.
3. Perform queries to Create synonyms, sequence and index
4. Implement PL/SQL programmes using control structures
5. Advanced SQL
a. Create a table and get alternative odd records from it.
b. Retrieve common records from two tables.
c. Convert decimal number to binary number and vice-versa.
6. Implement PL/SQL programmes using exception handling.
7. Write a program to use JDBC API to call stored procedures
8. Implement user defined procedures and functions using PL/SQL blocks
9. Implement various triggers
10. Implement and Practice on functional dependencies
11. Implement and Practice on Normalization –using any database perform various normal forms.
12. Implement and Practice on transaction processing.
Course Name: Operating System Principles
Course Code:
Course Objectives:
• Introduction to the fundamentals of distributed computer systems and data transmission.
• Illustrate the importance of synchronization and deadlocks
• Characterize resource and process management by operating systems.
• Work on storage unit like file system with its features like file sharing, replication, and Fault
tolerance

Course Content:
Theory

Module 1: Introduction to Operating System

Objectives and Functions of OS, Evolution of OS, OS Structures, OS Components, OS Services,
System calls, System programs, Virtual Machines.
History of UNIX, Features & Benefits, Versions of UNIX, Features of UNIX File System,,
Commonly Used Commands and getting Started (Login/Logout) . Creating and viewing files using
cat, file comparisons, View files, disk related commands, checking disk free spaces.

Module 2: Process Management – Processes and Threads

Processes: Process concept, Process scheduling, Co-operating processes, Inter process
Communication.
Threads: Introduction to Threads, Single and Multi-threaded processes.
CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling Algorithms, Multiple Processor
Scheduling, Real-time Scheduling
Unix Process Management: The Structure of Processes: Process States and Transitions, Layout of
system memory, Context of a process.
Process Control: Process Creation, Signals, Process Termination, Invoking other programs, PID &
PPID, Shell on a Shell.

Module 3: Process Management – Synchronization and Deadlocks

Process Synchronization: Mutual Exclusion, Critical, section problem, Synchronization hardware,
Semaphores, Classic problems of synchronization, Critical Regions, Monitors, OS Synchronization,
Atomic Transactions. Deadlocks: System Model, Deadlock characterization, Methods for handling
Deadlocks, Deadlock prevention, Deadlock Avoidance, Deadlock Detection, Recovery from
Deadlock.

Module 4: Storage Management

Memory Management: Logical and physical Address Space, Swapping, Contiguous Memory
Allocation, Paging, Segmentation with Paging.
Virtual Memory Management: Demand paging, Process creation, Page Replacement Algorithms,
Allocation of Frames, Thrashing,
File-System Interface: File concept, Access Methods, Directory structure, File- system Mounting, File
sharing, Protection and consistency semantics.
File-System Implementation: File-System structure. Directory Implementation, Allocation Methods,
Free-space Management, Efficiency and Performance, Recovery. Disk Management: Disk Structure,
Disk Scheduling, Disk Management, Swap-Space Management, Disk Attachment, stable-storage
Implementation.
The Unix File System:Inodes, Structure of a regular file, Directories, Conversion of a path name to an
inode, Super block, Inode assignment to a new file, Allocation of disk blocks. System calls for the file
System: Open, Read, Write, Lseek, Close, File creation, Creation of special files, Changing directory
and root, changing owner and mode, stat and fstat, pipes, Dup, Mounting and Un mounting file
systems, Link and Un link

Module 5: Protection and Security

Protection: Goals of Protection, Domain of Protection, Security: Security Problem, User
Authentication, One – Time Password, Program Threats, System Threats,
Unix System Administration: Common administrative tasks, identifying administrative files
configuration and log files, Role of system administrator, Managing user accounts-adding & deleting
users, changing permissions and ownerships, Creating and managing groups, modifying group
attributes, Temporary disabling of user’s accounts, creating and mounting file system, checking and
monitoring system performance file security & Permissions, becoming super user using su. Getting
system information with uname, host name, disk partitions & sizes, users, kernel, installing and
removing packages with rpm command

Course Outcomes:
After successful completion of the course, the students would be able to:
• Summarize distributed computing techniques, synchronization and handling remote
procedures.
• Explain the Process Migration and the concept of Threads
• Identify Resource Management Based Scheduling Algorithms and their suitability.
• Summarize File Systems and Memory Management.
• Interpret synchronization, consistency and replication, fault tolerance, security and protection
Text Books:
1. Operating Systems: Design and Implementation., Andrew S. Tanenbaum
Reference Books:
1. Operating System Concepts and design by Milan Milonkovic, McGraw Hill.
2. Operation System Concepts by Tanenbaum, Pearson Education.
3. Operating System by Silberschatz / Galvin / Gagne,WSE (WILEY Publication)
4. Operating System by William Stallings, Pearson Education.
5. Operating System by H.M.Deitel ,Pearson Education
 List of Practical’s
Experiments:
1. Execute 25 basic commands of UNIX.
2. Basics of functionality and modes of VI Editor.
3. WAP that accepts user name and reports if user is logged in.
4. WAP which displays the following menu and executes the option selected by user:
a. Ls
b. Pwd
c. ls l
d. psfe
5. WAP to print 10 8 7 6 5 4 3 21.
6. WAP that replaces all “*.txt” file names with “*.txt.old” in the current working directory.
7. WAP that echoes itself to stdout, but backwards.
8. WAP that takes a filename as input and checks if it is executable, if not make it executable.
9. WAP to take string as command line argument and reverse it.
10. Create a data file called employee in the format given below:
a. EmpCode_Character
b. EmpName_Character
c. Grade_Character
d. Years of experience_Numeric
e. Basic Pay_Numeric
$vi employee
A001 ARJUN E1 01 12000.00
A002 Mohan E2 02 13000.00
A004 Williams E1 01 12000.00
A005 John E2 01 14500.00
A006 Anand E1 01 12450.00
A009 Denial Smith E2 04 17500.00
A010 Rajesh E2 03 14500.00

11. Perform the following functions on the file:

a. Sort the file on EmpCode.
b. Sort the file on
i. Decreasing order of basic pay
ii. Increasing order of years of experience.
c. Display the number of employees whose details are included in the file.
d. Display all records with ‘smith’ a part of employee name.
e. Display all records with EmpName starting with ‘B’.
f. Display the records on Employees whose grade is E2 and have work experience of 2 to
5 years.
g. Store in ‘file 1’ the names of all employees whose basic pay is between 10000 and
15000.
h. Display records of all employees who are not in grade E2
 Semester- 02
Subject Category External Internal
Subject Name Marks Credits
Code of Sub. Marks Marks
1 Inferential Statistics Core 60 40 100 3
2 Artificial Neural Networks Core 60 40 100 3
3 Machine Learning Core 60 40 100 3
4 Natural Language Processing Core 60 40 100 3
5 Digital Image Processing Core 60 40 100 3
Principles & Practices of management
(PPM)
6 Allied 30 20 50 2
OR
Green Computing
7 LAB- Artificial Neural Networks DSEC 30 20 50 1
8 LAB-Machine Learning DSEC 30 20 50 2
9 LAB- Natural Language Processing DSEC 30 20 50 1
10 LAB- Digital Image Processing DSEC 30 20 50 1
Total 750 22
Course Name: Inferential Statistics
Course Code:
Course Objectives:

• To understand the basic concepts of statistical inference and different estimation methods.
• To understand testing of hypothesis with important terminologies related with testing of
hypothesis.
• To know the difference between large and small sample test.
• To know about the non-parametric testing procedures

Course Content:
Theory

Module 1:
Introduction to Statistical Inference
Introduction to Statistical Inference, Estimation of Parameters, Point estimation, Properties of a good
estimate.
Methods of estimation: Maximum Likelihood method.
Interval estimation: Confidence Interval for mean, variance and proportion.

Module 2:
Testing of Hypothesis:
Introduction, Type I and Type II error, Null hypothesis and Alternative hypothesis, Simple and
Composite hypothesis, Critical Region of the test, Significance level of the test, Power of the test, p
value, Procedure for a statistical test.

Module 3:
Large Sample Test:
Test for specified mean, test for equality of means, test for a specified proportion, and test for equality
of proportions.

Module 4:
Small Sample Test:
Test for specified mean, test for equality of means, Paired t test, test for specified variance, and test for
equality of variances.

Module 5:
Chi Square Test:
Goodness of fit, test for independence, test of homogeneity.
Analysis of Variance: Introduction, one way classification, two-way classification.

Course Outcomes:
After completing this course, students will be able to:
• Implement the concepts of inferential statistics in real world scenarios.
• They will be able to apply hypothesis testing
• Implement various statistical tools to test the homogeneity and independence.
• Student will able to understand the Testing of hypothesis.
• Student will able to analyze test for equality of variances.
Text Books:
1. S.C. Gupta and V.K. Kapoor: Fundamentals of Mathematical Statistics, Sultan, Chand & Sons.
2. S.P. Gupta: Statistical Methods, Sultan, Chand & Sons.
3. Rao C R,Linear Statistical Inference and its Applications, Wiley Eastern Limited.
Reference Books:
1. Miller and Freund: Probability and Statistics for Engineers, Pearson Education.
2. B.L. Agarwal: Basic Statistics, New Age International (P) Ltd.
3. B.S. Grewal: Higher Engineering Mathematics, Khanna Publishers.
Course Name: Artificial Neural Networks
Course Code:
Course Objectives:
• To understand the importance of neural network system and its components
• To understand the neural network learning and adaptation in data science
• To understand the mechanism of single layer perceptron in neural network models
• To understand the advantage of multilayer perceptron over single layer perceptron
• To understand broad application of neural networks in different field of businesses
Course Content:
Theory

Module 1: Introduction to Neural Network System:

Introduction to biological neurons and their artificial models, history of artificial neural systems
development, Simple Memory and Restoration of Patterns, basic concepts related to neural networks :
three layers of neural network systems, units, connections, site, mode, perceptron, single layer and
multiple layer perceptron, McCulloch-Pitts Neuron Model, Neuron Modelling for Artificial Neural
System, Models of neural networks : feedforward and feedback networks, neural processing.

Module 2: Neural Network Learning and Adaptation:

Introduction to neural network learning and adaptation, Learning as approximation or Equilibria
Encoding, concepts of supervised and unsupervised learning, neural network learning rules :Hebbian
learning rule, perceptron learning rule, delta learning rule, Widrow-Hoff Learning Rule, correlation
learning rule, Winner- Take-All learning rule, Outstar learning rule, summary and comparison of
artificial neural network learning rules.

Module 3: Single Layer Perceptron Classifiers:

Introduction to single layer perceptron, classification model, features and decision tree, discriminant
functions, linear machine and minimum distance classification, non-parametric training concepts,
training and classification using the discrete perceptron, single layer continuous perceptron neural
networks for linearly separable classification, multi category single layer perceptron neural networks.
Module 4: Multilayer feed forward Neural Networks:
Introduction to multilayer perceptron neural networks, linearly non separable pattern classification,
delta learning rule for multilayer perceptron networks, generalized delta learning rule, Feedforward
recall and error Back-Propagation training, training errors, Multilayer Feedforward Networks as
Universal Approximators, Learning Factors: Initial Weights, cumulative weight adjustments vs
incremental updating, learning constant and momentum method, classifying and expert layered
networks, Character Recognition Application, expert systems applications, learning time sequences.
Module 5: Single-Layer Feedback Neural Networks :
Introduction to single layer feedback neural networks, basic concepts of dynamic systems,
Mathematical Foundations of Discrete-Time and gradient type Hopfield Networks, Transient
Response of Continuous-Time Networks, Relaxation Modelling in Single-Layer Feedback Networks,
Summing Network with Digital Outputs, Minimization of the Traveling Salesman Tour Length.
Course Outcomes:
On successful completion of the module students will be able to:
• Know the basic concepts of neural networks and its components
 • Know neural network learning and adaption techniques
• Know the detailed concepts of single layer perceptron neural networks
• Know the detailed concepts of multilayer perceptron neural networks
• Explain the different field of application on neural network models
Text Books:
1. Introduction to Artificial Neural Systems – Jacek M Zurada, West Publishing Company.
Reference Books:
1. An introduction to neural networks - Kevin Gurney, UCL Press.
2. Principles of Artificial Neural Networks, Daniel Graupe, World Scientific Publishing Co. Pte.
Ltd.
List of Practical’s
Experiments:
1. Design and train perceptron for identifying ODD and EVEN number?
2. Write a program to Implement McCulloch-pitts model of Neuron:
a. Design and train a perceptron for AND gate?
b. Design and train a perceptron for OR gate?
c. Design and train a perceptron for EX-OR gate?
d. Design and train a perceptron for NOR gate?
3. Create a bidirectional Associative memory (BAM) for ID and telephone number?
4. Design and train the Hopfield net to map the input vector with the stored vector and correct them?
5. Write a program for back propagation algorithm?
6. Write a program to implement Delta rule?
7. Write a program of perceptron training algorithm?
8. Write a program to test and train a dataset (dataset can be anything: eg: wine dataset)?
9. Write a program for Error back propagation Algorithm?
10. Write a program to implement Hebb’s rule(unsupervised learning algorithm)
11. Write a program for back propagation algorithm, then user will provide the i/ps according to
requirement & display the o/ps:
a. Given a set of i/p – o/p patterns (Al, Bl) l = 1,2,……L .Where the l i/p vector Al = (Al1
, Al2 , …….., AlI )T & o/p vector Bl = (Bl1 , Bl2, …….., Blk)T
b. Assume only one hidden layer & initial setting of weights to be arbitrary .Assumei/p
layer with only liner units
c. Then o/p signal is equal to i/p activation value for each of these units. Let ηη
12. Write a program to solve XOR Problem. Solution to XOR in (MLP) Multi-Layer Perceptron
where Th = 2.5, To = 1.0 . Determine the weight values for XOR Problem so that o/p should be:
Course Name: Machine Learning
Course Code:
Course Objectives:
• To understand the basic concepts of statistical learning methods and models.
• To understand the importance of supervised learning in multivariate data sets.
• To understand the estimation procedure for multiple regression coefficients
• To understand the assumptions in estimating regression coefficients using OLS method.
• To understand the importance of supervised learning and unsupervised learning algorithms for
prediction.
Course Content:
Theory

Module 1: Introduction to Machine Learning Algorithms:

Introduction to Machine learning – Statistical Learning – types of Machine Learning –learning
models: geometric, probabilistic and logistic models, introduction to supervised, unsupervised and
reinforcement learning – model evaluation – model implementation – model accuracy indicators.

Module 2: Supervised Learning –Regression Analysis:

Introduction to parametric machine learning method, assumptions of parametric machine learning
methods, linear model and its assumptions, simple linear regression, parameter estimation, properties
of regression parameters, testing the significance of regression parameters, estimation of σ^2, Interval
Estimation of the Mean Response, prediction of new observations, Confidence interval for β_0, β_1
and σ^2, Multiple linear Regression analysis, parameter estimation, and significance of coefficients,
assumptions of multiple linear regression parameters.

Module 3: Classification Techniques – Decision Tree:

Introduction to decision tree algorithms, classification tree, characteristics of classification tree – size
and hierarchical nature of tree, training and testing data set, induction algorithms, probability
estimation in decision tree – Laplace correction and no match method, stopping criteria for tree
development, pruning techniques and pruned tree, evaluation of decision tree classifiers,
generalization error, F measure, Confusion matrix, ROC curve, Hit Rate Curve, Lift curve,
McNemar’s Test, Resample paired t test, K-fold cross validated paired t test, prediction using better
model, Decision tree ensembles methods.

Module 4: Classification Techniques – Logistic Regression:

Introduction to logistic regression, assumptions involved in logistic regression, concepts on odds and
odds ratio, maximum likelihood estimation, binomial logistic regression, parameter estimation,
properties of logistic regression coefficients, logistic regression for correlated data, model accuracy
testing, confusion matrix, Receiver Operating Characteristic Curve, area under curve, likelihood ratio
test, concepts and interpretation of Pseudo R square tests, Hosmer-Lemeshow Test, Wald Test,
prediction using better fit model and interpretation.

Module 5: Unsupervised Learning:

Introduction to data dimension reduction techniques, linearity of variables, assumptions of linearity
among variables, general purpose and description of principle component analysis, extraction of
principle components, extraction techniques, orthogonal and oblique rotation of linear combination of
variables, factor analysis and its relevance with business application, introduction to cluster analysis
and its validations.

Course Outcomes:
• Understand the difference between continuous class label and discrete class label classification
methods.
• Predict the continuous class variable using linear regression analysis.
• Predict the binary class variable using decision tree and random forest.
• Understand the importance of Logistic regression and its application in business.
• Understand the important concepts of neural networks and its prediction techniques.

Text Books:
1. Introduction To Linear Regression Analysis, Douglas C. Montgomery, Elizabeth A. Peck, G.
Geoffrey Vining, A John Wiley & Sons, Inc., Publication

Reference Books:
1. Introduction to Machine Learning - EthemAlpaydm, The MIT Press
2. Applied Regression Analysis, Third Edition – Norman R Draper, Harry Smith, John Wiley & Sons.
3. Using Multivariate Statistics - Barbara G. Tabachnick, Linda S. Fidell, Pearson Education
 List of Practical’s
Experiments:
1. Exercise:1
Consider the following table on Air Quality

S.No Ozone Solar R Wind Temp Month Day

1 41 190 7.4 67 5 1

2 36 118 8 72 5 2

3 12 149 12.6 74 5 3

4 18 313 11.5 62 5 4

5 27 192 14.3 56 5 5

6 28 193 14.9 66 5 6

7 23 299 8.6 65 5 7

8 19 99 13.8 59 5 8

9 8 19 20.1 61 5 9

10 24 194 8.6 69 5 10

11 7 152 6.9 74 5 11

12 16 256 9.7 69 5 12

13 11 290 9.2 66 5 13

14 14 274 10.9 68 5 14

15 18 65 13.2 58 5 15

16 14 334 11.5 64 5 16

17 34 307 12 66 5 17

18 6 78 18.4 57 5 18

19 30 322 11.5 68 5 19

20 11 44 9.7 62 5 20

a. Summarize the above table in R

b. Create the above table in data frame format in R without importing from outer source.
c. Find the linear regression line on given table taking ozone as dependent variable.
d. Predict 21st day of ozone level in the air with given factors.
e. Find the autocorrelation of error produced from the fitted line
 f. Analyse multi collinearity among independent variables and find the suitable solution
to remove multi collinearity.
g. Find the variance among error terms and comment on the equal variance among error
terms in the output.
h. Estimate the presence of autocorrelation using Durbin – Watson test statistic.
2. Exercise: 2
a. Estimate appropriate regression line with suitable predictors. Compare different
regression lines and comment on regression coefficients.
b. Estimate the significance of regression coefficients using ANOVA and compare with F
and partial t test.
c. Model fit using R Square and Adjusted R square values.
d. Estimate Cook Statistic and Press Statistic for diagnostic checking
e. Post model statistical testing for the better fit and error free prediction.
f. Normality testing on error terms of fitted model
3. Exercise: 3
a. Plot residual versus Fitted values using plot command
b. Plot residual versus Observed using Plot command
c. Plot observed versus and fitted values using plot command
d. Find out the leverage value in the fitted values using which.max command.
e. Interpret the residual summary from the lm( ) command.
f. Find out the VIF values using inbuilt function available in R.
Course Name: Natural Language Processing
Course Code:
Course Objectives:
• To understand the pre-processing of text for natural language processing.
• To understand the importance of considering syntactic parsing.
• To understand the mechanism of natural language generation in processing of natural
language.
• To understand the importance of corpus creation in natural language processing.
• To understand the different statistical techniques used in natural language processing.
Course Content:
Theory

Module 1: Introduction to Natural Language Processing:

Introduction to text pre-processing, terminologies related with text processing, challenges of text pre-
processing, tokenization, sentence segmentation, introduction to lexical analysis, finite state
morphonology, finite state morphology, morphology vs lexical analysis, paradigm based lexical
analysis.

Module 2: Syntactic Parsing and Semantic Analysis:

Introduction to syntactic parsing, The Cocke–Kasami–Younger Algorithm, parsing as deduction,
Implementing Deductive Parsing, LR Parsing, Constraint-based Grammars, Issues in Parsing, Basic
Concepts and Issues in Natural Language Semantics, Theories and Approaches to Semantic
Representation, Relational Issues in Lexical Semantics, Fine-Grained Lexical-Semantic Analysis.

Module 3: Natural Language Generation:

Introduction to natural language generation, simple Examples of Generated Texts, The Components of
a Generator: Components and level of representation, Approaches to Text Planning: The Function of
the Speaker, Desiderata for Text Planning, Pushing vs. Pulling, Planning by Progressive Refinement
of the Speaker’s Message, Planning Using Rhetorical Operators, Text Schemas, The Linguistic
Component: Surface Realization Components, Relationship to Linguistic Theory, Chunk Size,
Assembling vs. Navigating, Systemic Grammars, Functional Unification Grammars.

Module 4: Corpus Creation:

Introduction and definition of corpus in natural language processing, corpus size, Balance,
Representativeness, and Sampling, Data Capture and Copyright, Corpus Markup and Annotation,
Multilingual Corpora, Multimodal Corpora, Corpus Annotation Types, Morphosyntactic Annotation,
Tree banks: Syntactic, Semantic, and Discourse Annotation, The Process of Building Treebanks,
application of Treebanks.

Module 5: Statistical Techniques in Natural Language Processing:

Introduction to statistics and its importance in natural language processing, general linear model,
binary linear classification, one versus all method for multi-category classification, maximum
likelihood estimation in parameter estimation in linear classification techniques, concepts of
generative and discriminative models, introduction to sequence prediction model and its application in
natural language processing.

Course Outcomes:
 • Outline the basic concepts of natural language processing and its important terminologies.
• Analyse the key role of syntactic parsing and semantic analysis in natural language processing
in unstructured data.
• Create language generation as a part of sentimental analysis.
• Create corpus for text analysis in natural language processing.
• Evaluate important statistical techniques used in natural language processing.

Text Books:
1. Natural Language Processing Paperback, by Ela Kumar.

Reference Books:
1. Natural Language Processing and Information Retrieval (Oxford Higher Education) Paperback
– Illustrated.

List of Practical’s
Experiments:

1. Autocomplete feature using NLP techniques.

2. Predictive text generator.
3. Language Identifier.
4. Sentiment analysis of a product with twitter data.
5. Classification of groups in incident management system.
6. Language translation form one to another.
7. Speech Analysis.
8. Develop a small conversational chatbot.
9. Text matching among different documents.
10. Sentiment analysis of Positive, negative and Neutral for Movie reviews.
Course Name: Digital Image Processing
Course Code:
Course Objectives:
• To learn to analyze and implement the concept of image processing.
• To understand the concept of image manipulation and exhibit it.
• To gain knowledge about storing different image formats.
• To understand the techniques and procedure to apply the internals of Open CV.
• To understand the image processing techniques and concepts and develop a face detection
application from scratch.
Course Content:
Theory

Module 1: Introduction
Overview: Digital Image Representation, Fundamental Steps in Image Processing, Elements of a
Digital Image Processing System -Digital Image Fundamentals: Elements of Visual Perception, A
Simple Image Model, Sampling and Quantization, Some Basic Relationships between Pixels,
Imagining Geometry. Image File Formats: BMP, TIFF and JPEG. Colour Models (RGB, HSI, YUV).

Module 2: Image Enhancement and Representation

Spatial Domain Methods, Frequency Domain Methods, Some Simple Intensity Transformations,
Histogram Processing, Image Subtraction, Image Averaging, Background- Smoothing Filters,
Sharpening Filters, Lowpass Filtering, Highpass Filtering, Generation of Spatial Masks from
Frequency Domain Specifications. Homomorphic Filtering, Detection of Discontinuities, Edge
Linking using Hough Transform, Thresholding, Region based Segmentation, Split and Merge
Technique, Image Representation and Description, Chain Code, Polygonal, Representation, Shape
Number, Moments.

Module 3: Image Segmentation and Binary Image Processing

Segmentation: Mean Shift Segmentation – Active Contour Models – Geometric Deformable Models –
Fuzzy Connectivity – 3D Graph Based Image Segmentation – Graph Cut Segmentation - Optimal
Surface Segmentation. Shape Representation and Description: Hough Transform – Hadamard
Transform - Region Identification – Contour Based and Region Based Shape Representation and
Description – Shape Classes, Binary Morphological Operators, Hit-or-Miss Transformation,
Boundary Extraction, Region Filling, Thinning and Thickening, Connected Component Labeling,
Iterative Algorithm and Classical Algorithm.

Module 4: Image Transform

Introduction to the Fourier Transform, The Discrete Fourier Transform, Some Properties of the Two
Dimensional Fourier Transform Fast Fourier Transform(FFT), Discrete Hadamard Transform(DHT),
Fast Hadamard Transform(FHT), Discrete Cosine Transform(DCT), Discrete Wavelet
Transform(DWT), Fundamentals – Coding Redundancy, Inter-pixel Redundancy, Psych visual
Redundancy, Fidelity Criteria.

Module 5: Image Restoration and Compression

Model of Image Degradation/Restoration Process - Noise Models - Inverse Filtering – Least Mean
Square Filtering - Constrained Least Mean Square Filtering. Edge Detection - Thresholding - Region
Based Segmentation - Boundary Representation, Image Compression Models – The Source Encoder
and Decoder, Lossless Compression Techniques: Run Length Coding, Arithmetic Coding, Huffman
Coding, Differential PCM, Lossy Compression Techniques: Improved Gray Scale Quantization,
Vector Quantization, JPEG,MPEG

Course Outcomes:
• Apply the concept of image processing.
• Demonstrate the concept of image manipulation.
• Apply the concept of storing different image formats.
• Illustrate and apply the internals of OpenCV.
• Develop face detection application from scratch.

Text Books:
1. Digital Image Processing – by R.C. Gonzalez And R.E. Woods,, 2nd Ed., Prentice Hall Of
India, New Delhi
Reference Books:
1. M. Sonka, V. HlavacAnd R. Boyle, Image Processing Analysis And Machine Vision,
Brooks/Colic, Thompson Learning.
2. Image Processing, Analysis And Machine Vision: Milan Sonka, Vaclav Hlavac, Roger Boyle
(Thomson Brooks / Cole Edition).
3. Fundamentals Of Digital Image Processing: Anil K. Jain (Prentice Edition Hall Of India)

List of Practical’s
Experiments:
1. Basic image functions using python programming
2. Understanding image enhancement and segmentation methods
3. Turn your webcam feed into a pencil drawing wizard.
4. Counting the circles and ellipses.
5. Detect a specific object using your webcam and also find the specific pattern in an image.
6. Detect the car and pedestrians in videos.
7. Handwritten Digit classification – Classify the hand written digits from 0 to 9.
8. Facial Recognition – Make your computer recognize facial expressions.
9. Photo restoration.
10. Automatic Number plate recognition.