SCHEME OF INSTRUCTION AND EXAMINATION

B.E (AIML)
SEMESTER- V
Scheme of Scheme of
Contact Credits
SNo Code Course Title Instruction Hrs/Wk Examination
L T P Hrs CIE SEE
Theory
Automata
1 PC 501AI Languages and 3 0 - 3 40 60 3
Computation
PC 502CS Database
2 Management 3 0 - 3 40 60 3
Systems
PC 503AI Design and
3 Analysis of 3 0 - 3 40 60 3
Algorithms
PC 504AI
4 Machine Learning 3 0 - 3 40 60 3
PC 505AI
5 Operating Systems 3 0 - 3 40 60 3
6 Professional Elective – II
PE 511AI Number Theory &
Cryptography
PE 512AI Image Processing
3 0 - 3 40 60 3
PE 513AI Geo Spatial Data
Analysis
PE 514AI Data Mining

Practicals
Database
7 PC 552CS Management - - 2x2 3 25 50 2
Systems Lab
PC 552AI Design and
8 Analysis of - - 2 3 25 50 1
Algorithms Lab
PC 553AI Machine Learning
9 Lab
- - 2 3 25 50 1
Total 18 0 8 315 510 22
 PC 501 AI AUTOMATA LANGUAGES AND COMPUTATION

Prerequisites Data Structures L T P C

3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives
1 Introduce the concept of formal specification of languages and different classes of formal
Languages
2 Discuss automata models corresponding to different levels of Chomsky hierarchy.
3 Understand the concept of computability and decidability

Course Outcomes
On completion of this course, the student will be able to
CO1 Design Finite State Machine, Pushdown Automata, and Turing Machine
CO2 Determine the Chomsky hierarchy and regular, context-free, and recursively enumerable
Grammars
CO3 Convert the languages from DFAs, NFAs, and regular expressions, and between PDAs and
CFGs.
CO4 Analyze the halting problem, relationships between classes.

UNIT – I
Introduction: Finite state automata, Non-deterministic finite state automata, FA with ε-
transitions, Regular expressions, FA with outputs, Applications of FA. Properties of regular sets-
Pumping Lemma, Closure properties, Myhill-Nerode Theorem, Minimization of FA, Decision
Algorithms.

UNIT – II
Context Free Grammars and Languages: Derivations, Parse-trees, Ambiguity in Grammars and
Languages.
Pushdown Automata–Definitions, The languages of PDA, Equivalence of PDAs and CFGs,
Deterministic Pushdown Automata (DPDA).

UNIT – III
Properties of CFLs: Normal forms for CFGs, Pumping Lemma, Closure properties, Decision
algorithms, Deterministic Context Free Languages, Predicting machines, Decision properties, LR(0)
grammars, LR(0) and DPDA, LR(k) grammars.

UNIT – IV
Turing Machines: Introduction, Computational Languages and Functions, Techniques for
construction of Turing machines. Modifications of TM, TM as enumerator, Restricted TM.

UNIT – V
Undecidability: Recursive and Recursively enumerable languages, UTM and undecidable problem,
Rice Theorem, Post‟s correspondence problem. Chomsky‟s Hierarchy – Regular grammars,
Unrestricted grammar, CSL, Relationship between classes of languages.
Suggested Reading:
1 John E. Hopcroft, Jeffrey D. Ullman, Introduction to Automata Theory, Languages and
Computation, Narosa, 1979.
2 Zvi Kohavi, Switching and Finite Automata Theory, TMH, 1976.
 PC 502 CS DATABASE MANAGEMENT SYSTEMS

Prerequisites Data Structures L T P C

3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives
1 To introduce three schema architecture and DBMS functional components
2 To learn formal and commercial query languages of RDBMS
3 To understand the principles of ER modeling and theory of normalization
4 To study different file organization and indexing techniques
5 To familiarize theory of serializablity and implementation of concurrency control, and
Recovery

Course Outcomes
On completion of this course, the student will be able to
CO1 Understand the mathematical foundations on which RDBMS are built
CO2 Model a set of requirements using the Extended Entity Relationship Model (EER), transform an
EER model into a relational model, and refine the relational model using theory of
Normalization.
CO3 Develop Database application using SQL and Embedded SQL
CO4 Use the knowledge of file organization and indexing to improve database application
Performance.
CO5 Understand the working of concurrency control and recovery mechanisms in RDBMS.

UNIT – I
Introduction: Database System Applications, Purpose of Database Systems, View of
Values, Nested Sub-queries, Complex Queries, Views, Modification of the Database, Joined Relations
Data, Database Languages, Relational Databases, Database Design, Object–based and Semi- structured
Databases, Data Storage and Querying, Transaction Management, Data Mining and Analysis, Database
Architecture, Database Users and Administrators.
Database Design and the E-R Model: Overview of the Design Process, The Entity- Relationship Model,
Constraints, Entity-Relationship Diagrams, Entity – Relationship Design Issues, Weak Entity Sets,
Extended E-R Features, Database Design for Banking Enterprise, Reduction to Relational
Schemas, Other Aspects of Database Design

UNIT – II
Relational Model: Structure of Relational Databases, Fundamental Relational-Algebra
Operations, Additional Relational – Algebra Operations, Extended Relational - Algebra Operations,
Null Values, Modification of the Databases.
Structured Query Language: Data Definition, Basic Structure of SQL Queries, Set Operations,
Aggregate Functions, Null.

UNIT – III
Advanced SQL: SQL Data Types and Schemas, Integrity Constraints, Authorization,
 Embedded SQL, Dynamic SQL, Functions and Procedural Constructs, Recursive Queries,
Advanced

SQL Features. Relational Database Design: Features of Good Relational Design, Atomic Domains and
First Normal Form, Functional-Dependency Theory, Decomposition using Functional Dependencies.

UNIT – IV
Indexing and Hashing: Basic Concepts, Ordered Indices, B+-tree Index Files, B-tree Index Files,
Multiple Key Access, Static Hashing, Dynamic Hashing, Comparison of Ordered Indexing and Hashing,
Bitmap Indices.
Index Definition in SQL Transactions: Transaction Concepts, Transaction State,
Implementation of Atomicity and Durability, Concurrent Executions, Serializability,
Recoverability, Implementation of Isolation, Testing for Serializability.

UNIT – V
Concurrency Control: Lock-based Protocols, Timestamp-based Protocols, Validation-based Protocols,
Multiple Granularity, Multi-version Schemes, Deadlock Handling, Insert and Delete Operations, Weak
Levels of Consistency, Concurrency of Index Structures.
Recovery System: Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based
Recovery, Recovery with Concurrent Transactions, Buffer Management, Failure with Loss of
Nonvolatile Storage, Advanced Recovery Techniques, Remote Backup Systems.

Suggested Reading:
Abraham Silberschatz, Henry F Korth, S Sudarshan, Database System Concepts, McGraw-Hill
1
International Edition, 6th Edition, 2010
Ramakrishnan, Gehrke, Database Management Systems, McGraw-Hill International Edition,
2
3rd Edition, 2003.
Elmasri, Navathe, Somayajulu, Fundamentals of Database Systems, Pearson Education, 4th
3
Edition, 2004.
 PC 503 AI DESIGN AND ANALYSIS OF ALGORITHMS
Prerequisites Data Structures L T P C
3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives
1 Analyze the asymptotic performance of algorithms.
2 Write rigorous correctness proofs for algorithms
3 Demonstrate a familiarity with major algorithms and data structures.
4 Apply important algorithmic design paradigms and methods of analysis.
5 Synthesize efficient algorithms in common engineering design situations.

Course Outcomes
On completion of this course, the student will be able to
CO1 Analyze the complexity of the algorithm in asymptotic notations.
CO2 Apply the various algorithm approaches based on the complexities and analyze the graph
traversal techniques
CO3 Develop the dynamic programming algorithms, and analyze it to determine its computational
Complexity

UNIT – I
Introduction: Characteristics of algorithm, Analysis of algorithm: Asymptotic analysis of complexity
bounds – best, average and worst-case behavior; Performance measurements of Algorithm, Time
and space trade-offs, Analysis of recursive algorithms through recurrence
relations: Substitution method, Recursion tree method and Masters’ theorem

UNIT – II
Fundamental Algorithmic Strategies: Brute-Force, Greedy, Dynamic Programming, Branch and-
Bound and Backtracking methodologies for the design of algorithms; Illustrations of these techniques
for Problem-Solving, Bin Packing, Knap Sack and Travelling Salesman problem.

UNIT – III
Graph and Tree Algorithms: Depth First Search (DFS) and Breadth First Search (BFS);
Shortest path algorithms, Transitive Closure, Minimum Spanning Tree, Topological Sorting,
Network Flow Algorithm.

UNIT – IV
Tractable and Intractable Problems: Computability of Algorithms, Computability classes – P, NP,
NP-complete and NP-hard. Cook’s theorem, Standard NP-Complete problems and Reduction
techniques.

UNIT – V
Advanced Topics: Approximation algorithms, Randomized algorithms, Class of problems beyond NP
– P SPACE.
Suggested Reading:
Introduction to Algorithms, Thomas H Cormen, Charles E Lieserson,
1
Ronald L Rivest and Clifford Stein, MIT Press/McGraw-Hill, 4th Edition, 2002
2 Fundamentals of Algorithms – E. Horowitz, Satraj Sahani, Computer Science Press, 1997
3 Algorithm Design, First Edition, Jon Kleinberg and ÉvaTardos, Pearson, 2006
Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition,
4
Michael T Goodrich and Roberto Tamassia, Wiley Publishers, 2006
5 Algorithms - A Creative Approach, 3rd Edition, UdiManber, Addison-Wesley, 1995.
PC 504 AI MACHINE LEARNING
L T P C
Pre-requisites
3 - - 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives :
1 To introduce the basic concepts of machine learning and range of problems that
can be handled by machine learning
2 To introduce the concepts of instance based learning and decision tree induction
3 To introduce the concepts of linear separability, Perceptron and SVM
4 To learn the concepts of probabilistic inference, graphical models and evolutionary
learning
5 To learn the concepts of ensemble learning, dimensionality reduction and
Clustering

Course Outcomes :
On completion of this course, the student will be able to :
CO-1 Explain strengths and weakness of different machine learning techniques
CO-2 Select suitable model parameter for different machine learning technique
CO-3 Design & implement various machine learning algorithms to a wide range of real
world applications
CO-4 Evaluate available learning methods to develop the research based solutions in
different domains.

UNIT – I
Introduction: Learning, Types of Machine Learning, Machine Learning Examples , Decision
Tree Learning
Concept learning: Introduction, Version Spaces and the Candidate Elimination Algorithm.
Learning with Trees: Decision Tree Learning, the Big Picture
Linear Discriminants: Learning Linear Separators , The Perceptron Algorithm , Margins

UNIT – II
Estimating Probabilities from Data, Bayes Rule, MLE, MAP
Naive Bayes: Conditional Independence, Naive Bayes: Why and How, Bag of Words Logistic
Regression : Maximizing Conditional likelihood , Gradient Descent Kernels: Kernalization
Algorithm, Kernalizing Perceptron,
Discriminants: The Perceptron, Linear Separability, Linear Regression
Multilayer Perceptron (MLP): Going Forwards, Backwards, MLP in practices, Deriving back
Propagation.
UNIT– III
Support Vector Machines: Geometric margins, Primal and Dual Forms, Kernalizing SVM
Generalization & Overfitting: Sample Complexity, Finite Hypothesis classes, VC Dimension
Based Bounds
Some Basic Statistics: Averages, Variance and Covariance, The Gaussian, The Bias-Variance
Tradeoff Bayesian learning: Introduction, Bayes theorem. Bayes Optimal Classifier, Naive
Bayes Classifier.
Graphical Models: Bayesian networks, Approximate Inference, Making Bayesian Networks,
Hidden Markov Models, The Forward Algorithm.

UNIT – IV
Model Selection & Regularization: Structural Risk Minimization, Regularization, k-Fold
Cross validation
Linear Regression: Linear regression, minimizing squared error and maximizing data
Likelihood
Neural Networks: Back Propagation,
Deep Neural Networks: Convolution, Convolution Neural Networks, LeNet-5 architecture
Boosting: Boosting Accuracy, Ada Boosting, Bagging

UNIT –V
Clustering: Introduction, Similarity and Distance Measures, Outliers, Hierarchical Methods,
Partitional Algorithms, Clustering Large Databases, Clustering with Categorical Attributes,
Comparison.
Dimensionality Reduction: Linear Discriminant Analysis, Principal Component Analysis
Interactive Learning: Active Learning, Active Learning, Common heuristics, Sampling bias ,
Safe Disagreement Based Active Learning Schemes
Semi-Supervised Learning: Semi-supervised Learning, Transductive SVM, Co-training
Reinforcement Learning: Markov Decision Processes, Value Iteration, Q-Learning

Suggested Reading:
1 Tom M. Mitchell, Machine Learning, Mc Graw Hill, 1997

2 Chistopher Bishop, Pattern recognition & Machine Learning, Springer 2006.

Stephen Marsland, Machine Learning - An Algorithmic Perspective, CRC Press,
3 2009.
4 Margaret H Dunham, Data Mining, Pearson Edition., 2003.
Galit Shmueli, Nitin R Patel, Peter C Bruce, Data Mining for Business Intelligence,
5 Wiley India Edition, 2007

6 Rajjan Shinghal, Pattern Recognition, Oxford University Press, 2006.

 PC 505 AI OPERATING SYSTEMS
Prerequisites Programming in C and L T P C
Data Structures 3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives
1 To introduce the concepts of OS structure and process synchronization
2 To study different memory management strategies
3 To familiarize the implementation of file system
4 To understand the principles of system security and protection
5 To discuss the design principles and structure of Windows 7 and Linux

Course Outcomes
On completion of this course, the student will be able to
CO1 Evaluate various process scheduling algorithms
CO2 Analyze the steps in address translation and different page replacement strategies
CO3 Compare file allocation methods and choose appropriate allocation strategies for a file.
CO4 Apply the appropriate mechanisms to control access to resources

UNIT – I
Introduction to Operating Systems: OS structure and strategies, Process concepts, Multithreaded
Programming, Process scheduling, Process synchronization, Deadlocks.

UNIT – II
Memory management strategies with example architectures: Swapping, Contiguous allocation, Paging,
Segmentation, Segmentation with paging, Virtual memory management: Demand paging, Page
replacement, Thrashing.

UNIT – III
File system interface: File concepts, Access methods and protection. File system implementation:
File system structure, Allocation methods, Directory implementation of file systems, Mass storage
structures, I/O systems.

UNIT – IV
System Protection: Principles and Domain, Access Matrix and implementation, Access control and
access rights, Capability based systems, Language based Protection.
System Security: Problem, Program threats, cryptography, user authentication, implementing
security defenses, Firewalling, Computer security Classification.

UNIT – V
Case Studies: The Linux System–Design principles, Kernel modules, Process management,
Scheduling, Memory management, File systems, Input and Output, Inter process communication.
Windows 7 –Design principles, System components, Terminal services and fast user switching
File systems, Networking, Programmer Interface.
Suggested Reading:

1 Abraham Silberschatz, Peter B Galvin, Operating System Concepts, 9th Edition, Wiley, 2016

2 William Stallings, Operating Systems-Internals and Design Principles, 8th Edition, Pearson,
2014
3 Andrew S Tanenbaum, Modern Operating Systems, 4th Edition, Pearson, 2016.
 PROFESSIONAL ELECTIVE-II
PE 511 AI NUMBER THEORY AND CRYPTOGRAPHY
Prerequisites Discrete Mathematics L T P C
3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives
1 To Learn basics in number theory and cryptology
2 To identify and apply various properties of and relating to the integers and understand the
concept of a congruence
3 To impart the knowledge of encryption and decryption techniques and their applications

Course Outcomes
On completion of this course, the student will be able to
CO1 Solve problems in elementary number theory
CO2 Apply elementary number theory to cryptography
CO3 Develop a conceptual understanding of the theoretical basis of number theory and identify
how number theory is related to and used in cryptography

UNIT – I
Elementary Number Theory: Time estimates for doing arithmetic, Divisibility and Euclidean
algorithm, congruence‘s, applications to factoring.

UNIT – II
Finite Fields and Quadratic Residues: Finite fields, Legendre symbol, quadratic residues and
reciprocity, Jacobi symbol. Galois field in Cryptography, Chinese Remainder Theorem.

UNIT – III
Cryptography: Cryptosystems, diagraph transformations, enciphering matrices, Symmetric key
cryptosystem, traditional techniques, Key range and size, Deffie-Hellman key exchange, various types of
attacks, algorithm types and modes, various symmetric key algorithms (DES, IDEA, RC5,
Blowfish).

UNIT – IV
Asymmetric key Cryptography: concept, RSA algorithm, digital envelope, concept of message
digest, MD5 algorithm, Authentication requirements, Digital signatures, message authentic codes,
Knapsack algorithm.

UNIT – V
Primality and Factoring, Pseudo-primes, Carmichael number, Primality tests, Strong Pseudo-primes,
Monte Carlo method, Fermat factorization, Factor base, Implication for RSA, Continued fractionmethod.
Elliptic curves - basic facts, Elliptic curve cryptosystems.

Suggested Reading:
1 Neal Koblitz, A Course in Number Theory and Cryptology, Graduate Texts in
Mathematics, Springer, 1994
2 Williams Stallings, Cryptography & Network Security, Pearson Education 3rd Edition,
2004
3 Atul Kahate, Cryptography & Network Security, Tata McGraw Hill, New Delhi, 2005.
 PROFESSIONAL ELECTIVE-II
PE512AI IMAGE PROCESSING
Prerequisites signals and systems L T P C
3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives :

To introduce students to the Basic concepts and analytical methods of analysis of digital
1.
images.

To Study fundamental concepts of Digital Image Processing and basic relations among
2.
pixels.

3. To Study different Spatial and Frequency domain concepts.

4. To understand Restoration process of degraded image and Multi resolution processing.

5. To understand image compression and Segmentation Techniques.

Course Outcomes : At the end of the course the student will be able to:

1. Understand different components of image processing system

2. Describe various image transforms, enhancement techniques using various processing

methods.

3. Illustrate the compression and segmentation techniques on a given image

4. Demonstrate the filtering and restoration of images(pixels) with examples

5. Illustrate the various schemes for image representation and edge detection techniques with
examples

UNIT – I

Introduction: Digital Image Processing, Fundamental Steps in Digital Image Processing,

Components of an Image Processing System. Digital Image Fundamentals: Elements of Visual
Perception, Image Sensing and Acquisition, Image Sampling and Quantization, Some basic
Relationships between Pixels

UNIT – II

Image Enhancement in the Spatial Domain: Some Basic Gray Level Transformation, Histogram
Processing, Enhancement Using Arithmetic/Logic Operations, Basics of Spatial Filtering,
Smoothing spatial Filters, Sharpening spatial Filters.

Image Enhancement in the Frequency Domain: Introduction to the Fourier Transform and the
Frequency Domain, Smoothing frequency-domain Filters, Sharpening Frequency-domain Filters,
Homomorphic Filtering, Implementation.

UNIT – III

Image Restoration: A Model of the Image Degradation/Restoration Process, Linear, Position

Invariant Degradations, Inverse Filtering, Minimum Mean Square Error (Wiener) Filtering,
Constrained Least Squares Filtering. Wavelets and Multi resolution Processing: Multi resolution
Expansions, Wavelet Transforms in one Dimension, The Fast Wavelet Transform, Wavelet
Transforms in Two Dimensions.

UNIT – IV

Image Compression: Image Compression Models, Error-free Compression, Lossy Compression,

Image Compression Standards. Image Segmentation: Detection of Discontinuities, Edge Linking and
Boundary Detection, Thresholding, Region-Based Segmentation

UNIT – V

Representation and Description: Various schemes for representation, boundary descriptors, and
regional descriptors.

References:

1. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing. Prentice Hall
India/Pearson Education.

2. A.K.Jain, Fundamentals of Digital Image Processing. Prentice Hall India.

Suggested Readings:

1. Madhuri.A.Joshi, Digital Image Processing, PHI.

2. Sonka, Image Processing, Analysis and Machine Vision. Cengage Publications.

 PE 513 AI GEO-SPATIAL DATA ANALYSIS
Prerequisites signals and systems L T P C
3 0 0 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives :

1. . To introduce the Concepts of GeoSpatial Data Analysis

2. To introduce the use of various tools for handling large volume of data
3. To introduce the concepts behind hosting large data on Cloud
4. To enable students know the details of Implementing various AWS related tools.

Course Outcomes : After completion of course, students will be able to:

1. Understand the importance of Geo-spatial Analytics

2. Use various tools for manipulating large data

3. Learn use of AWS related tools for data storage

4. Learn and use AWS for Analyzing and Visualizing Geospatial Data

UNIT – I

An Overview Of Geospatial Analytics, Core Concepts: Key Issues And Extreme Over
generalizations, Getting Started With Map Tools And Types

UNIT – II

Mapping Data, More Tools, And Analysis , Innovations: Platforms, IoT, And Mathematics , Big Data
Analytics And Systems Of Scale

UNIT – III

Introduction to the Geospatial Data Ecosystem, Introduction to Geospatial Data in the Cloud, Quality and
Temporal Geospatial Data Concepts, Geospatial Data Lakes using Modern Data Architecture, Geospatial
Data Lake Architecture, Using Geospatial Data with Amazon Redshift .
UNIT – IV

Using Geospatial Data with Amazon Aurora PostgreSQL, Serverless Options for Geospatial, Querying
Geospatial Data with Amazon Athena, Analyzing and Visualizing Geospatial Data in AWS, Geospatial
Containers on AWS

UNIT – V

Using Geospatial Data with Amazon EMR, Geospatial Data Analysis Using R on AWS, Geospatial Machine
Learning with SageMaker, Using Amazon QuickSight to Visualize Geospatial Data, Accessing Open Source
and Commercial Platforms and Services

Suggested Readings:

1. Geospatial Data and Analysis by Aurelia Moser, Jon Bruner, Bill Day Released
February 2017 Publisher(s): O'Reilly Media, Inc. ISBN: 9781491940556

2. Geospatial Data Analytics on AWS: Discover how to manage and analyze geospatial data
in the cloud ByScott Bateman , Janahan Gnanachandran ,Jeff DeMuth
 PROFESSIONAL ELECTIVE-II
PE 514 AI DATA MINING
L T P C
Pre-requisites
3 - - 3
Evaluation CIE 40 Marks SEE 60 Marks

Course Objectives :
1 To introduce the basic concepts of data Mining and its applications
2 To understand different data mining techniques like classification, clustering and
Frequent Pattern mining
3 To introduce current trends in data mining

Course Outcomes :
On completion of this course, the student will be able to :
CO-1 Explain different data mining tasks and the algorithms.
CO-2 Evaluate models/algorithms with respect to their accuracy.
CO-3 Conceptualize a data mining solution to a practical problem
CO-4 Develop hypotheses based on the analysis of the results obtained and test them.

UNIT – I
Introduction: Major issues in Data Mining. Getting to know your data: Data objects and
attributed types. Basic statistical descriptions of data. Data visualization, Measuring data
similarity and dissimilarity.

UNIT – II
Mining frequent patterns, Associations and correlations, Basic concepts and methods, Basic
concepts, Frequent Item set Mining Methods, Which patterns are interesting? Pattern
evaluation methods.

UNIT– III
Classification: Basic concepts, Decision tree induction, Bayes classification methods.
Classification: Advance methods, Bayesian Belief Network, Classification by backpropagation,
Support vector machine.

UNIT – IV
Cluster Analysis: Concepts and Methods, Cluster Analysis, Partitioning Methods,
Hierarchical Methods, Density-Based Methods, Grid-Based Methods, Evaluation of
clustering.

UNIT –V
Data Mining Trends and Research Frontiers, Mining Complex Data Types, Other
Methodologies of Data Mining, Data Mining Applications, Data Mining and Society, Data
Mining trends.

Suggested Reading:

Jiawei Han, Micheline Kamber, Jin Pei, Data Mining: Concepts & Techniques, 3rd
1
Edition, Morgon Kauffman, 2011

Vikram Pudi, P.Radha Krishna, Data Mining, Oxford University Press, 1st Edition,
2
2009.
Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Introduction to Data Mining,
3
Pearson Education, 2008.
 PC 552 CS DATABASE MANAGEMENT SYSTEMS LAB
Prerequisites DBMS Theory L T P C
0 0 4 2
Evaluation CIE 25 Marks SEE 50 Marks

Course Objectives
1 To practice various DDL commands in SQL
2 To write simple and Complex queries in SQL
3 To familiarize PL/SQL

Course Outcomes
On completion of this course, the student will be able to
CO1 Design and implement a database schema for a given problem

CO2 Populate and query a database using SQL and PL/SQL

CO3 Develop multi-user database application using locks.

The list of programs suggested:

Creation of database (exercising the commands for creation).
1. Simple to Complex condition query creation using SQL Plus.
Usage of Triggers and Stored Procedures.
2. Creation of Forms for Student information, Library information, Pay roll etc.
3. Writing PL/SQL procedures for data validation.
4. Report generation using SQL reports.
5. Creating password and security features for applications.
6. Usage of File locking, Table locking facilities in applications.
7. Creation of small full- fledged database application spreading over3 sessions.
Note:-The creation of sample database for the purpose of the experiments is expected to be pre-
decided by the instructor.
BE: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING With effect from Academic year 2024-25

PC 552 AI DESIGN AND ANALYSIS OF ALGORITHMS LAB

Prerequisites L T P C
- - 2 1
Evaluation CIE 25 Marks SEE 50 Marks

Course Objectives
1 To learn the importance of designing an algorithm in an effective way by consideringspace and time
complexity
2 To learn graph search algorithms.
3 To study network flow and linear programming problems
4 To learn the dynamic programming design techniques.
5 To develop recursive backtracking algorithms.

Course Outcomes
On completion of this course, the student will be able to
CO1 Design an algorithm in an effective manner
CO2 Apply iterative and recursive algorithms.
CO3 Design iterative and recursive algorithms.
CO4 Implement optimization algorithms for specific applications.
CO5 Design optimization algorithms for specific applications.

List of Programs
1. Write a program to find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. .
2. Write a program to find the shortest path in graph using Dijkstra’s algorithm.
3. Write a program that implements N Queen's problem using backtracking algorithm.
4. Write a program to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices using
backtracking principle.
5. Write a program to implement dynamic programming algorithm to solve all pairs shortest path problem.
6. Write a program to solve 0/1 knapsack problem using Greedy algorithm.
7. Write a program to solve 0/1 knapsack problem using Dynamic programming algorithm.
8.Write a program to solve 0/1 knapsack problem using Backtracking algorithm
9.Write a program to solve 0/1 knapsack problem using Branch and bound algorithm.
10.Write a program that uses dynamic programming algorithm to solve the optimal binary search tree
11.Write a program for solving traveling sales persons problem using Dynamic programming algorithm.
12. Write a program for solving traveling sales persons problem using The back tracking algorithm.
13. Write a program for solving traveling sales persons problem using Branch and Bound.
14. Write a program to obtain the Topological ordering of vertices in a given digraph using Warshall's Algo.
15.Write a program to compute the transitive closure of a given directed graph using Warshall's algorithm.
16.Write a program to print all the nodes reachable from a given starting node in a digraph using BFS.
17. Write a program to check whether a given graph is connected or not using DFS method.
18. Write a program to find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

BE (AIML), Department of CSE, UCE, OU

Page 20 of 22
BE: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING With effect from Academic year 2024-25

PC 553 AI MACHINE LEARNING LAB

Prerequisites L T P C
0 0 2 1
Evaluation CIE 25 Marks SEE 50 Marks

Course Objectives
1 Demonstration of different classifiers on different data
2 Demonstrate ensembling of classifiers for solving real world problems
3 Make use of real world data to implement machine learning models.

Course Outcomes
On completion of this course, the student will be able to
CO1 Apply machine learning algorithms: dataset preparation, model selection, model building
CO2 Evaluate various Machine Learning approaches.
CO3 Use scikit-learn, Keras and Tensorflow to apply ML. techniques. 5. Design and develop
solutions to real world problems using ML. techniques.
CO4 Apply unsupervised learning and interpret the results.

List of Experiments
1. Basic Data Preprocessing
a. Installation of python environment/Anaconda IDE for machine learning installing python
modules/Packages like scikit-learn, Keras and Tensorflow.
b. Programs involving pandas, Numpy and Scipy libraries.
2. Programs for classification
a. Build models using linear regression and logistic regression and apply it to classify a new
instance.
b. Write a program to demonstrate the following classifiers. Use an appropriate data set for
building the model. Apply the model to classify a new instance.
i) Decision tree
ii) K nearest neighbour
iii) Naïve bayes
iv) Support vector machine
3. Demonstration of Clustering algorithms using
a. K-means
b. Hierarchical algorithms
4. Demonstrate ensemble techniques like boosting, bagging, random forests
5. Build a classifier, compare its performance with an ensemble technique like random
forest.

BE (AIML), Department of CSE, UCE, OU

Page 21 of 22
BE: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING With effect from Academic year 2024-25

6. Evaluate various classification algorithms performance on a dataset using various

measures like True Positive rate, False positive rate, precision, recall.
7. Demonstrate GA for optimization (minimization or maximization problem)
8. Case study on supervised/unsupervised learning algorithm:
a) Handwritten digits classification using CNN
b) Text classification using python libraries.

BE (AIML), Department of CSE, UCE, OU

Page 22 of 22