BAMU · Second Year B.E./B.Tech Artificial Intelligence / AI & ML / AI & DS · NEP 2020
Introduction to AI
PCCT-1 · Semester IV · 3 credits · CIA 40 + SEE 60
Module 1: Fundamentals of AI and Problem Solving; Search Strategies
15 hoursDefinition, history and applications of AI; intelligent agents, environments, rationality and the Turing test; problem formulation; generate and test, DFS, BFS, depth-bounded and iterative deepening DFS; heuristic functions and hill climbing.
Examined in the 60-mark end-semester paper
- What AI is and its history
- Intelligent agents and environments
- Problem-solving agents
- Uninformed search: BFS, DFS and uniform cost
- Iterative deepening search
- Heuristic functions
- Local search: hill climbing and simulated annealing
Module 2: Advanced Search Techniques; Game Playing
15 hoursBrute force, branch and bound, Dijkstra's algorithm, A*, admissible A* and IDA*, beam and tabu search; minimax, multiplayer games, alpha–beta pruning and evaluation functions.
Examined in the 60-mark end-semester paper
- Branch and bound search
- Informed search: greedy and A*
- Beam search and tabu search
- Minimax and optimal decisions in games
- Alpha-beta pruning
- Evaluation functions
Module 3: Constraint Solving; AI Applications and Learning
15 hoursConstraint satisfaction problems, N-queens, constraint propagation, scene labelling, higher-order consistency, backtracking and look-ahead; learning from observation, inductive learning, supervised, unsupervised and reinforcement learning, and AI in healthcare, finance and robotics.
Examined in the 60-mark end-semester paper
- Constraint satisfaction problems
- Constraint propagation and backtracking
- Learning from observation and inductive learning
- Types of machine learning
- Applications of AI
Module contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).