Scribd
Upload
227 views4 pages

Ai 2025 Syllabus

The document outlines the B.Tech course in Artificial Intelligence for the academic year 2022-23, detailing course outcomes, assessment patterns, and syllabus content. Students will learn about intelligent agents, search techniques, deep learning, natural language processing, and computer vision. The course aims to equip students with practical skills to solve engineering problems using AI methodologies.

Uploaded by

student -1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
227 views4 pages

Ai 2025 Syllabus

The document outlines the B.Tech course in Artificial Intelligence for the academic year 2022-23, detailing course outcomes, assessment patterns, and syllabus content. Students will learn about intelligent agents, search techniques, deep learning, natural language processing, and computer vision. The course aims to equip students with practical skills to solve engineering problems using AI methodologies.

Uploaded by

student -1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

B.Tech.

Information Technology 2022-23

Category L T P Credit
22IT620 ARTIFICIAL INTELLIGENCE
PCC 3 0 0 3

Preamble
This course deals with the development of intelligent information systems that can be used
to solve well-defined problems with the knowledge of Search techniques, Deep Learning,
Natural language processing and Computer Vision systems.
Prerequisite
• NIL
Course Outcomes
On the successful completion of the course, students will be able to
CO Course Outcome Statement TCE Expected Expected
Numb Proficien Proficiency Attainment
er cy Scale in % Level %
CO1 Explain the key characteristics of intelligent TPS2 80 90
agents
CO2 Find the optimal move for a given game using TPS3 80 80
adversarial search
CO3 Solve Constraint Satisfaction Problems such as TPS3 80 80
Map Coloring , Job-Shop Scheduling etc
Using backtracking search.
CO4 Develop a conversational agent that uses natural TPS3 80 70
language understanding and generation.
CO5 Perform Image classification and Detection of TPS3 70 70
objects with the knowledge of Computer Vision
CO6 Examine various Search techniques , Deep TPS4 70 70
learning, Computer Vision techniques for
solving engineering problems in the fields of
science, medicine, finance etc.

Mapping with Programme Outcomes


COs P P PO PO PO PO PO PO PO PO1 PO1 PO1 PS PS PS
O O 3 4 5 6 7 8 9 0 1 2 O1 O2 O3
1 2
CO1 M L L
CO2 S M L M L L L L M M M L
CO3 S M L M L L L L M L
CO4 S M L M L M M M L M M M L
CO5 S M L M L M M M L M M M L
CO6 S S M L M L L M M M L S M M M
S- Strong; M-Medium; L-Low

Passed in Board of Studies Meeting on 27.04.2023 Approved in 65th Academic council meeting on 27.5.2023
B.Tech. Information Technology 2022-23

Assessment Pattern
CO Theory Theory Terminal
CAT1 Assignment 1 CAT2 Assignment 2
TPS Scale 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 5 6
CO1 2 10 2 5
CO2 2 12 30 50 2 5 10
CO3 2 12 30 50 2 5 10
CO4 2 12 20 25 2 5 10
CO5 2 12 20 25 2 5 10
CO6 2 10 20 20 30 5 20

*Terminal examination should cover all Course Outcomes in the appropriate TPS Scale
level.
Syllabus

Introduction to AI and Intelligent Agents : The Foundations of Artificial Intelligence-The


History of Artificial Intelligence- Risks and Benefits of AI , Intelligent agents: Agents and
Environments- The Structure of Agents, Ethics in AI

Solving Problems by Searching: Problem-Solving Agents- Search Algorithms-Uninformed


Search Strategies – Informed (Heuristic) Search Strategies – Heuristic Functions- Search in
Complex Environments : Local Search and Optimization Problems- Hill-climbing search-
Simulated annealing – Local beam search

Adversarial Search and Games: Game Theory- Optimal Decisions in Games –Heuristic
Alpha–Beta Tree Search –Monte Carlo Tree Search- Stochastic Games –Limitations of
Game Search Algorithms

Constraint Satisfaction Problem: Defining Constraint Satisfaction Problems-Sudoku, tic-


tac-toe, map coloring, cryptarithmetic puzzle, Constraint Propagation: Inference in CSPs-
Backtracking Search for CSPs.

Deep Learning: Simple Feedforward Networks- Computation Graphs for Deep Learning-
Convolutional Neural Networks – Generalization- Recurrent Neural Networks- GANs-
Transfer Learning

Natural Language Processing: Language Models – Grammar – Parsing – Augmented


Grammars –Sentiment analysis -Deep Learning for NLP: Word Embeddings –Recurrent
Neural Networks for NLP, Transformer models, speech recognition, chatbots, Voice
assistants.

Computer Vision: Image processing-Feature Extraction-Classifying Images – Object


Detection and Recognition: face recognition, pose estimation

Text Book
1. “Artificial Intelligence: A Modern Approach” by S. Russell and P. Norvig , Pearson,
Fourth Edition, 2020
Reference Books& web resources
1. Michael Negnevitsky , “ARTIFICIAL INTELLIGENCE: A Guide to Intelligent
Systems”, Addison-Wesley, Third Edition, 2011.
2. Freeman and Skapura, “Neural Networks: Algorithms, Applications and Programming
Techniques”, Pearson Education Asia, 2001.
3. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013.

Passed in Board of Studies Meeting on 27.04.2023 Approved in 65th Academic council meeting on 27.5.2023
B.Tech. Information Technology 2022-23

4. James H Martin and Daniel Jurafsky, “ Speech and Language Processing : An


Introduction to Natural Language Processing, Computational Linguistics, and Speech
Recognition” , 2014.
5. Josh Patterson and Adam Gibson, “Deep Learning: A Practitioner’s Approach” ,
O′Reilly, 2017.
6. Mohamed Elgendy , “Deep Learning for Vision Systems”, Manning,2020
7. https://nptel.ac.in/courses/106105077
8. https://www.edx.org/course/artificial-intelligence-ai
Course Contents and Lecture Schedule
Module Topic No. Of
No. Hours
1. Introduction to AI and Intelligent Agents
1.1 The Foundations of Artificial Intelligence- The History
1
of Artificial Intelligence- Risks and Benefits of AI
1.2 Intelligent Agents – Agents and Environments 1
1.3 The Structure of Agent 1
1.4 Ethics in AI 1
2. Solving Problems by Searching
2.1 Problem-Solving Agents- Search Algorithms
Uninformed Search Strategies - Informed (Heuristic) 3
Search Strategies - Heuristic Functions
2.2 Search in Complex Environments : Local Search and
1
Optimization Problems
2.3 Hill-climbing search- Simulated annealing -Local beam
1
search
3. Adversarial Search and Games
3.1 Game Theory- Optimal Decisions in Games 1
3.2 Heuristic-Alpha-Beta Tree Search -Monte Carlo Tree
2
Search
3.3 Stochastic Games -Limitations of Game Search
2
Algorithms
4 Constraint Satisfaction Problem
4.1 Defining Constraint Satisfaction Problems- Constraint
3
Propagation
4.2 Inference in CSPs- Backtracking Search for CSPs 1
5 Deep Learning
5.1 Simple Feedforward Networks- Computation Graphs
1
for Deep Learning
5.2 Convolutional Neural Networks – Generalization-
2
Recurrent Neural Networks
5.3 GANs-Transfer Learning 2
6 Natural Language Processing
6.1 Language Models - Grammar - Parsing 1
6.2 Augmented Grammars – Sentiment Analysis 2
6.3 Deep Learning for NLP: Word Embeddings -Recurrent
3
Neural Networks for NLP
6.4 Transformer Models: Speech Recognition, chatbots,
2
voice assistants
7 Computer Vision
7.1 Image Processing- Features Extraction 1
7.2 Classifying Images 2
7.3 Object Detection and Recognition 2
Total periods 36

Passed in Board of Studies Meeting on 27.04.2023 Approved in 65th Academic council meeting on 27.5.2023
B.Tech. Information Technology 2022-23

Course Designers:
1. Dr.C.Deisy, Professor, IT Department cdcse@tce.edu
2. Dr.S.Padmavathi Professor, IT Department spmcse@tce.edu

Passed in Board of Studies Meeting on 27.04.2023 Approved in 65th Academic council meeting on 27.5.2023

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy