RTMNU · Second Year B.Tech Computer Science & Engineering (AI & ML) · NEP 2020
Artificial Intelligence
BCSEAI&ML3T10 · Semester III · 3 credits · College 30 + university 70
Unit 1: Introduction to AI
8 hoursWhat AI is, its foundations, history and state of the art, and its risks and benefits; agents and environments, rationality, the nature of environments and the structure of agents.
Examined in the 70-mark end-semester paper
- What AI is and its history
- Applications of AI
- Intelligent agents and environments
- Rationality and task environments
- Structure of agents
Unit 2: Uninformed Search Strategies
6 hoursProblem-solving agents, example problems and search algorithms; breadth-first, uniform-cost, depth-first, bidirectional, depth-limited and iterative-deepening search.
Examined in the 70-mark end-semester paper
- Problem-solving agents
- Uninformed search: BFS, DFS and uniform cost
- Iterative deepening search
- Bidirectional and depth-limited search
Unit 3: Informed Search Strategies
6 hoursHeuristic search and knowledge, designing heuristic functions; generate-and-test, best-first search, problem reduction, hill climbing, constraint satisfaction and means–ends analysis.
Examined in the 70-mark end-semester paper
- Heuristic functions
- Informed search: greedy and A*
- Generate-and-test and means–ends analysis
- Local search: hill climbing and simulated annealing
- Problem reduction and AND-OR graphs
- Constraint satisfaction problems
Unit 4: Knowledge Representation using Predicate Logic
8 hoursRepresentations and mappings, approaches to and issues in representation; representing simple facts, instance and ISA relationships in logic; computable functions and predicates; resolution.
Examined in the 70-mark end-semester paper
- Approaches to knowledge representation
- First-order logic
- Unification
- Resolution
Unit 5: Adversarial Search and Games
8 hoursGame theory and optimal decisions in games; minimax search and alpha–beta pruning with additional refinements; Monte Carlo tree search; stochastic and partially observable games; limitations of game search.
Examined in the 70-mark end-semester paper
- Minimax and optimal decisions in games
- Alpha-beta pruning
- Evaluation functions
- Monte Carlo tree search
- Stochastic and partially observable games
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).