DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY

UTTAR PRADESH, LUCKNOW

EVALUATION SCHEME & SYLLABUS

FOR
B. TECH THIRD YEAR

Artificial Intelligence and Machine Learning

Based On

NEP2020

(Effective from the Session: 2024-25)

 B.TECH.
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
CURRICULUM STRUCTURE
SEMESTER- V

End
Subject Codes Periods Evaluation Scheme
Sl. Semester
Subject Total Credit
No.
L T P CT TA Total PS TE PE
Database Management
1 BCS501 3 1 0 20 10 30 70 100 4
System
2 BCAI501 Artificial Intelligence 3 1 0 20 10 30 70 100 4

Design and Analysis of

3 BCS503 3 1 0 20 10 30 70 100 4
Algorithm

4 BCS054 Object Oriented System 3 1 0 20 10 30 70 100 3

Design with C++

5 BCAM051 Cloud Computing 3 1 0 20 10 30 70 100 3

Database Management
6 BCS551 0 0 2 50 50 100 1
System Lab

7 BCAI551 Artificial Intelligence Lab 0 0 2 50 50 100 1

Design and Analysis of

8 BCS553 0 0 2 50 50 100 1
Algorithm Lab

Mini Project or Internship

9 BCS554 0 0 2 50 50 100 2
Assessment*
Constitution of India/
Essence of Indian
BNC501/ Traditional Knowledge
10 2 0 0 20 10 30 70
BNC502

Total 900 23

*The Mini Project or Internship (4 weeks) conducted during summer break after IV semester and will be assessed during V
semester.
*It is desirable that the students should do their Summer Internship or Mini Project in their specialization area in line with the
B.Tech. program.
 B.TECH.
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

BCS501 Database Management System

Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
CO 1 Apply knowledge of database for real life applications. K3
CO 2 Apply query processing techniques to automate the real time problems of databases. K3, K4
CO 3 Identify and solve the redundancy problem in database tables using normalization. K2, K3
Understand the concepts of transactions, their processing so they will familiar with broad range K2, K4
CO 4 of database management issues including data integrity, security and recovery.
CO 5 Design, develop and implement a small database project using database tools. K3, K6
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Overview, Database System vs File System, Database System Concept and
Architecture, Data Model Schema and Instances, Data Independence and Database Language and
Interfaces, Data Definitions Language, DML, Overall Database Structure. Data Modeling Using the
I Entity Relationship Model: ER Model Concepts, Notation for ER Diagram, Mapping Constraints, 08
Keys, Concepts of Super Key, Candidate Key, Primary Key, Generalization, Aggregation,
Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher Degree.

Relational data Model and Language: Relational Data Model Concepts, Integrity Constraints,
Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Algebra,
Relational Calculus, Tuple and Domain Calculus. Introduction on SQL: Characteristics of SQL,
Advantage of SQL. SQl Data Type and Literals. Types of SQL Commands. SQL Operators and
II 08
Their Procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions. Insert,
Update and Delete Operations, Joins, Unions, Intersection, Minus, Cursors, Triggers, Procedures in
SQL/PL SQL

Data Base Design & Normalization: Functional dependencies, normal forms, first, second, 8 third
III normal forms, BCNF, inclusion dependence, loss less join decompositions, normalization using 08
FD, MVD, and JDs, alternative approaches to database design
Transaction Processing Concept: Transaction System, Testing of Serializability, Serializability
of Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery from Transaction
IV Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Distributed Database: Distributed 08
Data Storage, Concurrency Control, Directory System.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency
V Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple 08
Granularity, Multi Version Schemes, Recovery with Concurrent Transaction, Case Study of Oracle.
Text books:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. Date C J, “An Introduction to Database Systems”, Addision Wesley 3. Elmasri, Navathe,
“ Fundamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. RAMAKRISHNAN"Database Management Systems",McGraw Hill
6. Leon & Leon,”Database Management Systems”, Vikas Publishing House
7. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications
8. Majumdar & Bhattacharya, “Database Management System”, TMH
 BCAI501 ARTIFICIAL INTELLIGENCE
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
Understand the basics of the theory and practice of Artificial Intelligence as a discipline and K2
CO 1 about intelligent agents.
CO 2 Understand search techniques and gaming theory. K2, K3
The student will learn to apply knowledge representation techniques and problem solving K3 , K4
CO 3 strategies to common AI applications.
CO 4 Student should be aware of techniques used for classification and clustering. K2 , K3
CO 5 Student should aware of basics of pattern recognition and steps required for it. K2 , K4
DETAILED SYLLABUS 3-0-0

Proposed
Unit Topic Lecture
I INTRODUCTION: 08
Introduction–Definition – Future of Artificial Intelligence – Characteristics of Intelligent Agents–
Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
II PROBLEM SOLVING METHODS 08
Problem solving Methods – Search Strategies- Uninformed – Informed – Heuristics – Local Search
Algorithms and Optimization Problems – Searching with Partial Observations – Constraint
Satisfaction Problems – Constraint Propagation – Backtracking Search – Game Playing – Optimal
Decisions in Games – Alpha – Beta Pruning – Stochastic Games
III KNOWLEDGE REPRESENTATION 08
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward
Chaining – Resolution – Knowledge Representation – Ontological Engineering-Categories and
Objects – Events – Mental Events and Mental Objects – Reasoning Systems for Categories –
Reasoning with Default Information

IV SOFTWARE AGENTS 08
Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining –
Argumentation among Agents – Trust and Reputation in Multi-agent systems.
V APPLICATIONS 08
AI applications – Language Models – Information Retrieval- Information Extraction – Natural
Language Processing – Machine Translation – Speech Recognition – Robot – Hardware –
Perception – Planning – Moving

Text books:
1. S. Russell and P. Norvig, “Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition, 2009.
2. I. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-Wesley Educational Publishers Inc.,
2011.
3. M. Tim Jones, ―Artificial Intelligence: A Systems Approach (Computer Science) ‖, Jones and Bartlett Publishers,
Inc.; First Edition, 2008
4. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
5. William F. Clocksin and Christopher S. Mellish, ‖ Programming in Prolog: Using the ISO Standard‖, Fifth Edition,
Springer, 2003.
6. Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
7. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents‖,
Cambridge University Press, 2010.
BCS503 DESIGN AND ANALYSIS OF ALGORITHM

Course Outcome (CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to understand

Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime K4, K6
CO 1
and memory demands.
Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem K5, K6
CO 2
correctly (validate).
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know K2, K5
CO 3
many practically important problems that do not admit any efficient algorithms.
CO 4 Apply classical sorting, searching, optimization and graph algorithms. K2, K4

Understand basic techniques for designing algorithms, including the techniques of recursion, K2, K3
CO 5
divide-and-conquer, and greedy.
DETAILED SYLLABUS 3-1-0

Unit Topic Proposed

Lecture
Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of Functions,
I Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge 08
Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time.
Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps,
II Tries, Skip List 08
Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and
Searching.
III Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum 08
Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and
Bellman Ford Algorithms.
Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s
and Floyd’s Algorithms, Resource Allocation Problem. Backtracking, Branch and Bound with
IV Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian 08
Cycles and Sum of Subsets.
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP
V Completeness, Approximation Algorithms and Randomized Algorithms 08
Text books:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)", McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
7. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples,
Second Edition, Wiley, 2006.
8. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
9. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
10. Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press.
11. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.
BCS054 OBJECT ORIENTED SYSTEM DESIGN with C++
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to:
To understand the application development and analyze the insights of object-oriented K2, K4
CO 1
programming to implement application
CO 2 To understand, analyze and apply the role of overall modeling concepts (i.e. System, structural) K2, K3
CO 3 To understand, analyze and apply oops concepts (i.e. abstraction, inheritance) K2, K3, K4
CO 4 To understand the basic concepts of C++ to implement the object-oriented concepts K2, K3
CO 5 To understand the object- oriented approach to implement real world problem. K2, K3
DETAILED SYLLABUS 3-0-0

Unit Topic Proposed

Lecture
Introduction: The meaning of Object Orientation, object identity, Encapsulation, information hiding,
I polymorphism, generosity, importance of modelling, principles of modelling, object-oriented 08
modelling, Introduction to UML, conceptual model of the UML, Architecture.
Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams. Class
&Object Diagrams: Terms, concepts, modelling techniques for Class & Object Diagrams.
Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in collaboration
Diagrams, iterated messages, use of self in messages. Sequence Diagrams: Terms, concepts,
II depicting asynchronous messages with/without priority, call-back mechanism, broadcast messages. 08
Basic Behavioural Modeling: Use cases, Use case Diagrams, Activity Diagrams, State Machine ,
Process and thread, Event and signals, Time diagram, interaction diagram, Package diagram.
Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.

Object Oriented Analysis: Object oriented design, Object design, combining three models, Designing
algorithms, design optimization, Implementation of control, Adjustment of inheritance, Object
representation, Physical packaging, Documenting design considerations.
Structured analysis and structured design (SA/SD), Jackson Structured Development (JSD).
III Mapping object-oriented concepts using non-object-oriented language, Translating classes into data 08
structures, Passing arguments to methods, Implementing inheritance, associations encapsulation.
Object oriented programming style: reusability, extensibility, robustness, programming in the large.
Procedural v/s OOP, Object oriented language features. Abstraction and Encapsulation.
C++ Basics: Overview, Program structure, namespace, identifiers, variables, constants, enum,
operators, typecasting, control structures
IV C++ Functions: Simple functions, Call and Return by reference, Inline functions, Macro Vs. Inline 08
functions, Overloading of functions, default arguments, friend functions, virtual functions

Objects and Classes: Basics of object and class in C++, Private and public members, static data and
function members, constructors and their types, destructors, operator overloading, type conversion.
Inheritance: Concept of Inheritance, types of inheritance: single, multiple, multilevel, hierarchical,
V hybrid, protected members, overriding, virtual base class 08
Polymorphism: Pointers in C++, Pointes and Objects, this pointer, virtual and pure virtual functions,
Implementing polymorphism
Text Books
1. James Rumbaugh et. al, “Object Oriented Modeling and Design”, 2nd Edition Pearson Education
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”,
Pearson Education
3. Object Oriented Programming With C++, E Balagurusamy, McGraw-Hill Education
4. C++ Programming, Black Book, Steven Holzner, dreamtech
5. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
6. Object Oriented Programming with ANSI and Turbo C++, Ashok Kamthane, Pearson
7. The Compete Reference C++, Herbert Schlitz, McGraw-Hill Education
 BCAM051 CLOUD COMPUTING
Course Outcome (CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to:

CO 1 Describe architecture and underlying principles of cloud computing. K3

Explain need, types and tools of Virtualization for cloud. K3, K4

CO 2
Describe Services Oriented Architecture and various types of cloud services. K2, K3
CO 3
CO 4 Explain Inter cloud resources management cloud storage services and their providers Assess K2, K4
security services and standards for cloud computing.
CO 5 Analyze advanced cloud technologies. K3, K6

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed

Lecture
I Introduction To Cloud Computing: Definition of Cloud – Evolution of Cloud Computing – 08
Underlying Principles of Parallel and Distributed Computing – Cloud Characteristics – Elasticity in
Cloud – On‐demand Provisioning.

II Cloud Enabling Technologies Service Oriented Architecture: REST and Systems of Systems – 08
Web Services – Publish, Subscribe Model – Basics of Virtualization – Types of Virtualization –
Implementation Levels of Virtualization – Virtualization Structures – Tools and Mechanisms –
Virtualization of CPU – Memory – I/O Devices –Virtualization Support and Disaster Recovery.

III Cloud Architecture, Services And Storage: Layered Cloud Architecture Design – NIST Cloud 08
Computing Reference Architecture – Public, Private and Hybrid Clouds – laaS – PaaS – SaaS –
Architectural Design Challenges – Cloud Storage – Storage‐as‐a‐Service – Advantages of Cloud
Storage – Cloud Storage Providers – S3.

IV Resource Management And Security In Cloud: Inter Cloud Resource Management – Resource 08
Provisioning and Resource Provisioning Methods – Global Exchange of Cloud Resources – Security
Overview – Cloud Security Challenges – Software‐as‐a‐Service Security – Security Governance –
Virtual Machine Security – IAM – Security Standards.
V Cloud Technologies And Advancements Hadoop: MapReduce – Virtual Box — Google App 08
Engine – Programming Environment for Google App Engine –– Open Stack – Federation in the
Cloud – Four Levels of Federation – Federated Services and Applications – Future of Federation.

Text books:
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, “Distributed and Cloud Computing, From Parallel Processing to
the Internet of Things”, Morgan Kaufmann Publishers, 2012.
2. Rittinghouse, John W., and James F. Ransome, ―Cloud Computing: Implementation, Management and Security,
CRC Press, 2017.
3. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, ―Mastering Cloud Computing, Tata Mcgraw Hill, 2013.
4. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing – A Practical Approach, Tata Mcgraw Hill, 2009.
5. George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in the Cloud:
Transactional Systems for EC2 and Beyond (Theory in Practice), O’Reilly, 2009.
BCS551 DATABASE MANAGEMENT SYSTEMS LAB

Course Outcome (CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to:

Understand and apply oracle 11 g products for creating tables, views, indexes, sequences and K2, K4
CO 1 other database objects.
Design and implement a database schema for company data base, banking data base, library K3, K5,
CO 2
information system, payroll processing system, student information system. K6
CO 3 Write and execute simple and complex queries using DDL, DML, DCL and TCL K4, K5

CO 4 Write and execute PL/SQL blocks, procedure functions, packages and triggers, cursors. K4, K5

Enforce entity integrity, referential integrity, key constraints, and domain constraints on K3, K4
CO 5 database.
DETAILED SYLLABUS

1. Installing oracle/ MYSQL

2. Creating Entity-Relationship Diagram using case tools.
3. Writing SQL statements Using ORACLE /MYSQL:
a). Writing basic SQL SELECT statements.
b). Restricting and sorting data.
c). Displaying data from multiple tables.
d). Aggregating data using group function.
e). Manipulating data.
f). Creating and managing tables.
4. Normalization
5. Creating cursor
6. Creating procedure and functions
7. Creating packages and triggers
8. Design and implementation of payroll processing system
9. Design and implementation of Library Information System
10. Design and implementation of Student Information System
11. Automatic Backup of Files and Recovery of Files
12. Mini project (Design & Development of Data and Application) for following: a) Inventory Control System.
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Timetable Management System.
h) h) Hotel Management System
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab (MySQL , SQL server ,
Oracle ,MongoDB ,Cubrid ,MariaDBetc)
Database Management Systems Lab (BCS551): Mapping with Virtual Lab

Name of the Lab Name of the Experiment

Data Definition Language (DDL) Statements: (Create table, Alter table, Drop table)
Data Manipulation Language (DML) Statements

Database Management Lab Data Query Language (DQL) Statements: (Select statement with operations like Where
(BCS551) clause, Order by, Logical operators, Scalar functions and Aggregate functions)

Transaction Control Language (TCL) statements: (Commit (make changes permanent),

Rollback (undo)
Describe statement: To view the structure of the table created
 BCAI551 ARTIFICIAL INTELLIGENCE LAB
Course Outcome (CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to

CO 1 Use of python to understand the concept of AI K3

CO 2 Implementation of Different AI Techniques K4, K5

CO 3 Application of AI techniques in practical Life K4

CO 4 Understanding of Natural Language Tool Kit. K2

CO 5 Practical Application of Natural Language Tool Kit K4, K5

DETAILED SYLLABUS

1. Write a python program to implement Breadth First Search Traversal?

2. Write a python program to implement Water Jug Problem?
3. Write a python program to remove punctuations from the given string?
4. Write a python program to sort the sentence in alphabetical order?
5. Write a program to implement Hangman game using python.
6. Write a program to implement Tic-Tac-Toe game using python.
7. Write a python program to remove stop words for a given passage from a text file using NLTK?
8. Write a python program to implement stemming for a given sentence using NLTK?
9. Write a python program to POS (Parts of Speech) tagging for the give sentence using NLTK?
10. Write a python program to implement Lemmatization using NLTK?
11. Write a python program to for Text Classification for the give sentence using NLTK
Note: The Instructor may add/delete/modify/tune experiments
BCS553 DESIGN AND ANALYSIS OF ALGORITHM LAB
Course Outcome (CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to:

CO 1 Implement algorithm to solve problems by iterative approach. K2, K4

CO 2 Implement algorithm to solve problems by divide and conquer approach K3, K5

CO 3 Implement algorithm to solve problems by Greedy algorithm approach. K4, K5

Implement algorithm to solve problems by Dynamic programming, backtracking, branch K4, K5

CO 4 and bound approach.
CO 5 Implement algorithm to solve problems by branch and bound approach. K3, K4

DETAILED SYLLABUS

1. Program for Recursive Binary & Linear Search.

2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Knapsack Problem using Greedy Solution
8. Perform Travelling Salesman Problem
9. Find Minimum Spanning Tree using Kruskal’s Algorithm
10. Implement N Queen Problem using Backtracking
11. Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for
varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus non graph sheet. The
elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how the
divide and- conquer method works along with its time complexity analysis: worst case, average case and best case.
12. Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for
varied values of n> 5000, and record the time taken to sort. Plot a graph of the time taken versus non graph sheet. The
elements can be read from a file or can be generated using the random number generator. Demonstrate how the divide
and- conquer method works along with its time complexity analysis: worst case, average case and best case.
13. Implement, the 0/1 Knapsack problem using;
(a). Dynamic Programming method
(b). Greedy method.
15. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.
16. Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's algorithm. Use Union-
Find algorithms in your program.
17. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
18. Write programs to:
(a) Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
(b) Implement Travelling Sales Person problem using Dynamic programming.
19. Design and implement to find a subset of a given set S = {Sl, S2,.......,Sn} of n positive integers whose SUM is equal to
a given positive integer d. For example, if S = {1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and {1,8}. Display a
suitable message, if the given problem instance doesn't have a solution.
20. Design and implement to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices using
backtracking principle.