AI

Artificial Intelligence

AD203

Department of Computer Science • IIITDM Kurnool

Artificial Intelligence

AD203 • Autumn 2026

Build strong foundations in Artificial Intelligence through intelligent agents, search, reasoning, reinforcement learning, deep learning, and modern Large Language Models.

6

Modules

14

Teaching Weeks

5

Programming Assignments

3

Credits

Scroll to Explore

Course Objectives

What This Course Aims to Teach

  • ✓ Understand intelligent agents and rational decision making.
  • ✓ Learn classical search and heuristic search algorithms.
  • ✓ Solve game-playing and constraint satisfaction problems.
  • ✓ Apply probabilistic reasoning using Bayesian Networks.
  • ✓ Understand Markov Decision Processes and Reinforcement Learning.
  • ✓ Explore modern AI including Deep Learning, Transformers and Large Language Models.
  • ✓ Learn the importance of Responsible AI and AI Safety.

Course Overview

Course Information

Everything students need to know before starting the course.

Instructor

Dr. Alapan Kuila

Assistant Professor, Department of Computer Science

Teaching Assistant

Enjamul Islam Khan

Teaching Assistant

Credits

3-0-3

Lecture • Tutorial • Practical

Classroom

CS102

IIITDM Kurnool

Class Schedule

Wednesday • 10:00 – 11:00
Thursday • 09:00 – 10:00
Friday • 10:00 – 11:00

Autumn 2026

Email

alapan.cse@iiitk.ac.in

Office Hours: TBA

Prerequisites

Python Programming, Data Structures, Discrete Mathematics, Basic Probability, Linear Algebra

Learning Journey

What You'll Learn

This course takes you from the fundamentals of Artificial Intelligence to modern Large Language Models through a carefully designed sequence of topics.

01

AI Foundations

Understand intelligent agents, PEAS, rationality and problem formulation.

02

Search & Planning

Learn BFS, DFS, A*, heuristic search, local search and optimization.

03

Reasoning & Games

Master Minimax, Alpha-Beta pruning and Constraint Satisfaction Problems.

04

Probabilistic AI

Bayesian Networks, inference, uncertainty and decision making.

05

Reinforcement Learning

Markov Decision Processes, Q-Learning, SARSA and Policy Iteration.

06

Modern AI

Deep Learning, Transformers, LLMs, Responsible AI and AI Safety.

Course Syllabus

Course Modules

Explore each module to see the topics covered throughout the semester.

History and Evolution of AI
Philosophy of AI
Definitions of AI
Applications of AI
Intelligent Agents
Rationality
PEAS Framework
Environment Types
Agent Architectures
Problem Formulation
State-Space Representation
State-Space Search
Breadth First Search (BFS)
Depth First Search (DFS)
Depth Limited Search (DLS)
Iterative Deepening Search (IDS)
Uniform Cost Search (UCS)
Bidirectional Search
Heuristic Search
Greedy Best First Search
A* Search
Admissible Heuristics
Consistent Heuristics
Local Search
Hill Climbing
Simulated Annealing
Genetic Algorithms
Games
Minimax Algorithm
Alpha-Beta Pruning
Evaluation Functions
Constraint Satisfaction Problems (CSP)
Constraint Graphs
Backtracking
Variable Ordering Heuristics
Value Ordering Heuristics
Constraint Propagation
Arc Consistency
Local Search
Probability Review
Bayes Theorem
Bayesian Networks
Conditional Independence
Exact Inference
Approximate Inference
Sampling
Parameter Learning
Structure Learning
Decision Theory
Utility
Decision Networks
Markov Decision Processes (MDP)
Bellman Equations
Policy Evaluation
Value Iteration
Policy Iteration
Exploration vs Exploitation
Multi-Armed Bandits
Monte Carlo Methods
Temporal Difference Learning
Q-Learning
SARSA
Perceptron
Multi-Layer Perceptron (MLP)
Backpropagation
Convolutional Neural Networks (CNN)
Recurrent Neural Networks (RNN)
Deep Q Networks (DQN)
Policy Gradient Methods
Actor-Critic Methods
Transformers Overview
Large Language Models Overview
Explainable AI
Responsible AI
AI Safety

Weekly Teaching Plan

Semester Schedule

Weekly lecture plan based on the official course syllabus.

Week 1

Introduction to Artificial Intelligence

History of AI, Philosophy of AI, Definitions and Applications

Week 2

Agents & Problem Formulation

Intelligent Agents, PEAS, Environment Types, State Space Representation

Week 3

Uninformed Search

BFS, DFS, DLS, IDS, Uniform Cost Search

Week 4

Informed Search

Greedy Search, A*, Heuristics

Week 5

Local Search

Hill Climbing, Simulated Annealing, Genetic Algorithms

Week 6

Adversarial Search

Games, Minimax, Alpha-Beta Pruning

Week 7

Constraint Satisfaction

CSP, Backtracking, Arc Consistency

Week 8

Probability

Probability Review, Bayes Theorem

Week 9

Bayesian Networks

Conditional Independence, Inference, Sampling

Week 10

Decision Theory

Utility, Decision Networks

Week 11

Markov Decision Processes

Bellman Equations, Policy Evaluation, Value Iteration

Week 12

Reinforcement Learning

Monte Carlo, TD Learning, Q-Learning, SARSA

Week 13

Deep Learning & Deep RL

Perceptron, MLP, CNN, RNN, DQN, Actor-Critic

Week 14

LLMs, Ethics & Revision

Transformers, Large Language Models, Responsible AI, Revision

Instructor

Meet Your Instructor

AK

Dr. Alapan Kuila

Assistant Professor

Department of Computer Science
IIITDM Kurnool
alapan@iiitk.ac.in
Office Hours: Monday 2PM–4PM

Grading Policy

Course Assessment

Programming Assignments

10%

Mid Semester Examination

30%

End Semester Examination

50%

Quiz

10%

Class Participation

Extra Credit