DBATU Final Year IT syllabus

DBATU · Final Year B.Tech Information Technology · Non-NEP

Artificial Intelligence

BTITC702 · Semester VII · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60

All notes for this subject
  1. Unit 1: Introduction and Intelligent Agents

    AI problems and techniques; the tic-tac-toe problem; agents and environments, the nature of environments, the structure of agents; goal-based, utility-based and learning agents.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • AI: history and types
    • AI problems and techniques: tic-tac-toe
    • Intelligent agents and PEAS
    • Types of agents
  2. Unit 2: Problem Solving and Search

    Defining a problem as state-space search; production systems; problem characteristics and search-program design; problem-solving agents; uninformed strategies: breadth-first, depth-first, depth-limited and bidirectional search, compared.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Problem formulation and state space
    • Production systems and problem characteristics
    • Uninformed search: BFS, DFS and uniform cost
    • Depth-limited and bidirectional search
  3. Unit 3: Heuristic and Adversarial Search

    Greedy best-first and A* search; memory-bounded heuristic search; hill climbing, simulated annealing, local beam search and genetic algorithms; constraint satisfaction problems; games, minimax, alpha-beta pruning and iterative deepening.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Informed search: greedy best-first and A*
    • Hill climbing and local search
    • Simulated annealing, beam search and genetic algorithms
    • Constraint satisfaction problems
    • Adversarial search: minimax and alpha-beta pruning
  4. Unit 4: Knowledge and Reasoning

    Knowledge representation issues and approaches; predicate logic, ISA relationships, resolution and natural deduction; procedural and declarative knowledge, logic programming, forward and backward reasoning; Bayesian networks and Dempster–Shafer theory.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Knowledge representation and resolution
    • Propositional and predicate logic
    • Forward and backward chaining, expert systems
    • Bayesian networks and Dempster-Shafer theory
  5. Unit 5: Planning, NLP, Learning and Expert Systems

    Goal-stack and hierarchical planning; syntactic, semantic, discourse and pragmatic processing; inductive, decision-tree, explanation-based, neural and genetic learning; expert system shells and knowledge acquisition; fuzzy sets and fuzzy logic.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Planning: goal stack and hierarchical planning
    • NLP in AI: syntactic, semantic and pragmatic processing
    • Decision trees
    • Learning: inductive, explanation-based, neural and genetic
    • Expert systems and fuzzy logic

Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).