Scribd
Upload
6 views

R22B.Tech.CSE(AIML) IIYearSyllabus

The document outlines the syllabus for the Introduction to Artificial Intelligence course for B.Tech. CSE (AI and ML) at JNTU Hyderabad. It includes course objectives, outcomes, and detailed units covering topics such as problem-solving agents, game theory, first-order logic, planning, and probabilistic reasoning. The syllabus also lists the main textbook and several reference books for further study.

Uploaded by

Lavanya Venkata
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
6 views

R22B.Tech.CSE(AIML) IIYearSyllabus

The document outlines the syllabus for the Introduction to Artificial Intelligence course for B.Tech. CSE (AI and ML) at JNTU Hyderabad. It includes course objectives, outcomes, and detailed units covering topics such as problem-solving agents, game theory, first-order logic, planning, and probabilistic reasoning. The syllabus also lists the main textbook and several reference books for further study.

Uploaded by

Lavanya Venkata
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/ 2

R22 B.Tech.

CSE (AI and ML) Syllabus JNTU Hyderabad

INTRODUCTION TO ARTIFICIAL INTELLIGENCE

B.Tech. II Year II Sem. L T P C


3 0 0 3
Prerequisite: Knowledge on Data Structures.

Course Objectives:
● To learn the distinction between optimal reasoning Vs. human like reasoning.
● To understand the concepts of state space representation, exhaustive search, heuristic
● search together with the time and space complexities.
● To learn different knowledge representation techniques.
● To understand the applications of AI, namely game playing, theorem proving, and machine
learning.

Course Outcomes:
● Learn the distinction between optimal reasoning Vs human like reasoning and formulate an
efficient problem space for a problem expressed in natural language. Also select a search
algorithm for a problem and estimate its time and space complexities.
● Apply AI techniques to solve problems of game playing, theorem proving, and machine
learning.
● Learn different knowledge representation techniques.
● Understand the concepts of state space representation, exhaustive search, heuristic search
together with the time and space complexities.
● Comprehend the applications of Probabilistic Reasoning and Bayesian Networks.
● Analyze Supervised Learning Vs. Learning Decision Trees

UNIT - I
Introduction to AI - Intelligent Agents, Problem-Solving Agents,
Searching for Solutions - Breadth-first search, Depth-first search, Hill-climbing search, Simulated
annealing search, Local Search in Continuous Spaces.

UNIT-II
Games - Optimal Decisions in Games, Alpha–Beta Pruning, Defining Constraint Satisfaction Problems,
Constraint Propagation, Backtracking Search for CSPs, Knowledge-Based Agents, Logic-
Propositional Logic, Propositional Theorem Proving: Inference and proofs, Proof by resolution, Horn
clauses and definite clauses.

UNIT-III
First-Order Logic - Syntax and Semantics of First-Order Logic, Using First Order Logic, Knowledge
Engineering in First-Order Logic. Inference in First-Order Logic: Propositional vs. First-Order Inference,
Unification, Forward Chaining, Backward Chaining, Resolution.
Knowledge Representation: Ontological Engineering, Categories and Objects, Events.

UNIT-IV
Planning - Definition of Classical Planning, Algorithms for Planning with State Space Search, Planning
Graphs, other Classical Planning Approaches, Analysis of Planning approaches. Hierarchical Planning.

UNIT-V
Probabilistic Reasoning:
Acting under Uncertainty, Basic Probability Notation Bayes’ Rule and Its Use, Probabilistic Reasoning,
Representing Knowledge in an Uncertain Domain, The Semantics of Bayesian Networks, Efficient
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

Representation of Conditional Distributions, Approximate Inference in Bayesian Networks, Relational


and First- Order Probability.

TEXT BOOK:
1. Artificial Intelligence: A Modern Approach, Third Edition, Stuart Russell and Peter Norvig,
Pearson Education.

REFERENCE BOOKS:
1. Artificial Intelligence, 3rd Edn., E. Rich and K. Knight (TMH)
2. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.
3. Artificial Intelligence, Shivani Goel, Pearson Education.
4. Artificial Intelligence and Expert systems – Patterson, Pearson Education.

You might also like