Date:30/07/2024

Circular

As the per circular (dt: 25/07/2024) received from Dean, Directorate of Computing
the meeting is schedule on 29/07/2024 at 10:30AM chaired by Dr. P Muralidhar, Program
Coordinator for Artificial Intelligence.

Agenda:

 Suggestions on Syllabus
 Course Outcomes
 Mapping of Course Outcomes to Program Outcomes and Program Specific Outcomes
 Preparation of Course Files
 Preparation of Question Bank
 Preparation of Scheme of Evaluation.

Program Coordinator

Copy to
Dr. G Raja Vikram, Dean, Director & HOD-CSE
Dr Bysani Srinu, Associate Professor
Mrs. R Aksara, Assistant Professor
 Date: 05/08/2024

Members present for the meeting

S.No Name of the Faculty Designation Signature

1 Dr. P Muralidhar Associate Professor

2 Dr D Sunil Associate Professor

5
 Date: 18/01/2025

Course Committee Minutes of the Meeting

1. Syllabus: The current third-year batch is affiliated with JNTUH, and the university
does not permit changes to the syllabus therefore, it remains unchanged but Previous
years question paper have shown a tendency to cover topics outside the syllabus. After
reviewing previous exam questions, The subject faculty suggested to cover additional
topics, such as Definitions of AI- Acting Humanly, Thinking Humanly, Thinking
Rationally, Acting Rationally, History of AI, 8 puzzle problem, 8 Queen Problem. The
detailed recommendation on the syllabus to the university is attached in
Annexure-A.
2. Course Outcomes: The syllabus provided by JNTUH already includes the course
outcomes. It is decided to retain these outcomes by changing their order.
3. Mapping of Course Outcomes to Program Outcomes & Program Specific
Outcomes: The mapping of Course Outcomes to POs and PSOs has been revised by
categorizing the POs into domain-specific and domain-independent groups. Re-
ordered Course Outcomes and Revised CO-PO Mapping is attached in
Annexure-B.
4. Lecture Plan: A lecture plan has been formulated according to JNTUH Academic
Calendar.
5. Question Bank: The question bank has been prepared using questions from previous
years papers, emphasizing higher-order levels of Bloom's Taxonomy and Mapping
with Course Outcomes (COs), Program Outcomes (POs), and Program Specific
Outcomes (PSOs). t also includes additional topics listed in Annexure 1A. This will
help better prepare students for exams that may include these topics, closing the
gap between the syllabus and the actual exam.
6. Evaluation Scheme: The scheme of evaluation will be prepared immediately after
the completion of the Mid-1 and Mid-2 examinations.
7. Course File: Preparation of the course files has been completed according to the
standard format.

Compiled by Program Coordinator

 Annexure-A
Syllabus
Recommendation to University on Syllabus: It is recommended to the university to
specify clearly about few topics in Unit-1 & Unit-2.

JNTH Syllabus for Unit-1:

Unit-1: Introduction to AI, Intelligent Agents, problem-Solving Agents, Searching for

Solutions, Uninformed Search Strategies: Breadth-first search, Uniform cost search,
Depth-first search, Iterative deepening Depth-first search, Bidirectional search,
Informed (Heuristic) Search Strategies: Greedy best-first search, A* search, Heuristic
Functions, Beyond Classical Search: Hill-climbing search, Simulated annealing
search, Local Search in Continuous Spaces.

Recommended syllabus for Unit-1:

Unit-1: Introduction to AI, Definitions of AI- Acting Humanly, Thinking Humanly,

Thinking Rationally, Acting Rationally, History of AI, 8 puzzle problem, 8 Queen
Problem, Intelligent Agents, problem-Solving Agents, Searching for Solutions,
Uninformed Search Strategies: Breadth-first search, Uniform cost search, Depth-first
search, Iterative deepening Depth-first search, Bidirectional search, Informed
(Heuristic) Search Strategies: Greedy best-first search, A* search, Heuristic
Functions, Beyond Classical Search: Hill-climbing search, Simulated annealing
search, Local Search in Continuous Spaces

JNTH Syllabus for Unit-2:

Unit-2: Problem Solving by Search-II and Propositional Logic, Adversarial Search:

Games, Optimal Decisions in Games, Alpha–Beta Pruning, Imperfect Real-Time
Decisions. Constraint Satisfaction Problems: Defining Constraint Satisfaction
Problems, Constraint Propagation, Backtracking Search for CSPs, Local Search for
CSPs, The Structure of Problems. Propositional Logic: Knowledge-Based Agents,
The Wumpus World, Logic, Propositional Logic, Propositional Theorem Proving:
Inference and proofs, Proof by resolution, Horn clauses and definite clauses, Forward
and backward chaining, Effective Propositional Model Checking, Agents Based on
Propositional Logic.

Recommended syllabus for Unit-2:

Unit-2: Problem Solving by Search-II and Propositional Logic, Adversarial Search:

Games, Optimal Decisions in Games, Alpha–Beta Pruning, Imperfect Real-Time
Decisions. Constraint Satisfaction Problems: Defining Constraint Satisfaction
Problems, Partially Observable games, Constraint Propagation, Backtracking Search
for CSPs, Local Search for CSPs, The Structure of Problems. Propositional Logic:
Knowledge-Based Agents, The Wumpus World, Logic, Propositional Logic,
Propositional Theorem Proving: Inference and proofs, Proof by resolution, Horn
clauses and definite clauses, Forward and backward chaining, Effective Propositional
Model Checking, Agents Based on Propositional Logic.

Note: Bold & Italic indicates possible recommendations to JNUTH.

 Annexure-B
Course Outcomes & Mapping Course Outcomes and Program Outcomes(POs),
Program Specific Outcomes(PSOs).
Course Outcomes given by University:
Course Outcomes: After completion of this course students will be able to:
 Understand search strategies and intelligent agents
 Understand different adversarial search techniques
 Apply propositional logic, predicate logic for knowledge representation
 Apply AI techniques to solve problems of game playing, and machine learning.
Recommended Course Outcomes:
Course Outcomes: After completion of this course students will be able to:
 Understand search strategies and intelligent agents
 Understand different adversarial search techniques
 Apply propositional logic, predicate logic for knowledge representation
 Apply AI techniques to solve problems of game playing, and machine learning.

Course Code Course Outcome Description Units Linked

C313.1 Understand search strategies and intelligent agents Unit-1

C313.2 Understand different adversarial search techniques Unit-2

Apply propositional logic, predicate logic for knowledge
C313.3 representation Unit-3

Apply AI techniques to solve problems of game playing, and

C313.4 machine learning. Unit-4

Apply the Uncertainty knowledge techniques in real-world

C313.5 Unit-5
decision-making and inference problems.
 Mapping of Couse Outcomes to Program Outcomes(POs) and Program Specific
Outcomes(PSOs)

Mapping of COs to POs & PSOs (Last Academic Year):

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
C305.1 3 3 3 2 3 2 3 2 3 3 2 2
C305.2 2 3 3 3 3 3 3 3 3 3 3 2
C305.3 3 2 2 3 3 3 2 3 3 3 2 3
C305.4 3 3 3 3 3 3 3 2 3 2 3 2
C305.5 3 2 2 2 2 3 2 3 2 2 3 3
Averag
e 2.8 2.6 2.6 2.6 2.8 2.8 2.6 2.6 2.8 2.6 2.6 2.4

Mapping of COs to POs & PSOs (Revised Version): The Mapping of Cos to POs and
PSOs revised based on inputs received from Subject handling faculty.

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
C305.1 3 3 2 2 1 1 1 1 2 3 2 2
C305.2 3 3 2 2 1 1 1 1 2 3 2 2
C305.3 2 2 1 1 1 1 2 3 1 1
C305.4 3 2 2 2 1 2 2 2 1 1
C305.5 3 2 2 2 1 1 1 2 2 2 2 2
Averag
e 2.8 2.4 1.8 1.8 1 0.6 0.6 1.4 2 2.6 1.6 1.6