DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

COURSE FILE

Faculty In-Charge: G.PRANAVI

Course Code: 23CM404PC

Course Name: Introduction to Artificial

Intelligence
Dept/Year/Sem/Section CSE(AI&ML)/II/II

Academic Year: 2024-25

Course-Coordinator HOD
 COURSE FILE CONTENT

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

S.NO. CONTENT
1 PEOs,POs, PSOs
2 Class Time Table
3 Course Time Table
4 Student Name list
Course Plan
5.1 Syllabus
5.2 Course Objective
5.3 course Outcome (Cos)
5.4 Course Mapping with POs and PSOs
5 5.5 Lesson Plan ( Along with Teaching Aids)
5.6 Content beyond Syllabus
5.7 Assessment Methodologies
 Direct Assessment
 Indirect Assessment
6 Class Notes ( All 5 units)
7 Question Bank
8 Assignment -1 Questions (Along with mapping of COs)
9 Class Test (1 & 2) Questions (Along with mapping of COs)
10 MID Exam-I Questions (Along with mapping of COs)
Result Analysis for Continuous Assessment I (Assignment+ class test 1 & 2
11
+MID Exam-I)
List of Slow learners, List of Advanced learner and Time table for Remedial
12
class for slow learner
13 Assignment -2 Questions (Along with mapping of COs)
14 Class Test (3 & 4) Questions (Along with mapping of COs)
15 MID Exam-II Questions (Along with mapping of COs)
Result Analysis for Continuous Assessment II (Assignment+ class test 1 & 2
16
+MID Exam-I)
17 Internal Mark list
18 Course End Survey (Indirect Assessment of Cos)
19 End Exam Question Paper (University)
20 Result analysis for End semester Exam.
20 Calculation of COs Attainment
21 Calculation of POs and PSOs attainment
22 Attainment with Gap analysis and action taken for continuous Improvement
23 Log book/ Attendance Register

Course-Coordinator HOD
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Department Vision, Mission and PEO’s

Vision:
To emerge as a center of excellence in Computer Science and Engineering providing quality
technical education, empowering young engineers to achieve global excellence and
contributing innovatively to societal advancement.

Mission
To provide quality education in Computer Science and Engineering, equipping students with
the skills to excel globally.

To foster innovation and empower students to develop practical solutions that benefit society.

To build strong collaborations with industry and academia, promoting entrepreneurship and
professional growth.

Program Educational Objectives (PEOs) :

1. Fundamental Knowledge: Graduates will build a strong foundation in mathematics,
science, and basic engineering principles to analyze and solve complex problems in
Computer Science and Engineering.

2. Core Competencies: Graduates will develop expertise in computer science and

engineering domains, enabling them to design, develop, and implement innovative
solutions for real-world challenges.

3. Breadth: Graduates will acquire interdisciplinary knowledge and skills, preparing

them to adapt to diverse roles in technology-driven industries and address emerging
global trends.

4. Professionalism: Graduates will exhibit ethical responsibility, effective

communication, and leadership skills, contributing to team success and achieving
professional excellence.

5. Learning Environment: Graduates will engage in lifelong learning through

advanced education, certifications, and self-directed efforts in a dynamic and
inclusive learning environment that fosters innovation and creativity.
 PROGRAM OUTCOMES
PO1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.

PO2. Problem analysis: Identify, formulate, research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.

PO3. Design/development of solutions: Design solutions for complex engineering problems

and design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.

PO4. Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data, and
synthesis of the information to provide valid conclusions.

PO5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.

PO6. The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent responsibilities
relevant to the professional engineering practice.

PO7. Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need
for sustainable development.

PO8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.

PO9. Individual and team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.

PO10. Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.

PO11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
PO12. Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological change.

PSOs - CSE

PSO1: Graduates will demonstrate the knowledge in allied areas of Computer Science &
Engineering.

PSO2: The learners will be able to gain desired knowledge for the Competitive Environment
 SYLLABUS

23CM404PC INTRODUCTION TO 3L:0T:0P 3 Credits

ARTIFICIAL INTELLIGENCE
J23 CSE(AI&ML)
UNIT-I : Introduction to AI Hrs
Intelligent Agents, Problem-Solving Agents, 12
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 12
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, 11
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 10
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 12
Its Use, Probabilistic Reasoning, Representing Knowledge in an
Uncertain Domain, The Semantics of Bayesian Networks, Efficient
Representation of Conditional Distributions, Approximate Inference in
Bayesian Networks, Relational and First- Order Probability.

Total 55
 TEXT BOOKS:
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.

Course-Coordinator HOD
J-23 B.Tech CSE(AI&ML)

23CM404: Introduction to Artificial Intelligence

Course Objectives:

S.No. Course Objective

1 To learn the distinction between optimal reasoning Vs. human like reasoning.

2 To understand the concepts of state space representation, exhaustive search,

heuristic search together with the time and space complexities.

3 To learn different knowledge representation techniques.

4 To understand the applications of AI, namely game playing, theorem proving, and
machine learning.

Course Outcomes:

COs Upon completion of this course, the student will be able to:

CO1 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.

CO2 Apply AI techniques to solve problems of game playing, theorem proving, and
machine learning.

CO3 Learn different knowledge representation techniques.

CO4 Understand the concepts of state space representation, exhaustive search,

heuristic search together with the time and space complexities

CO5 Comprehend the applications of Probabilistic Reasoning and Bayesian

Networks. Analyze Supervised Learning Vs. Learning Decision Trees
CO & PO Mapping

CO P P P P P P P P P PO PO PO PS PS
PO O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 O1 O2
CO1 3 3 2 3 2
CO2 3 3 3 3 3
CO3 3 3 2 2
CO4 3 3 4 3 2
CO5 3 3 31 3
Average 3 2 1.5 3 1.5 2.5 2.25 2.24

Course-Coordinator HOD
 ASSESSMENT METHODOLOGIES

DIRECT ASSESSMENT INDIRECT ASSESSMENT

Internal Class Tests (1 to 4) Course Exit Survey
Assignment (1-2)
Mid Exam (1-2)
External End Semester Exam

Tools Overall Weightage in Cos

Direct Internal 40% 70%
External 60%
Indirect 30%

Course-Coordinator HOD
 II B.Tech. II Sem , JANUARY- 2024 - 2025
CLASS TEST-I

Introduction to Artificial Intelligence-(J-23 Curriculum)

Time : 60 Minutes CSE(AIML) – B Maximum : 10Marks

(Answer All Questions)
Date: 17-01-2025 Time:3:15PM-4:15PM

S. Mapping
Question Pattern Marks
No COs
1 Define agent? Explain types of agents with structures?

2 Describe BFS,DFS and Uninformed search algorithms?

3 Summarize deep limited and IDDFS search algorithms?

Describe Uniform cost search and Bidirectional search

4
algorithms?
Explain the following of Hill climbing algorithms?
5
a)Features b)state space diagram
 II B.Tech. II Sem , JANUARY- 2024 - 2025
CLASS TEST-II

Introduction to Artificial Intelligence-(J-23 Curriculum)

Time : 60 Minutes CSE(AIML) – B Maximum : 10Marks

(Answer All Questions)
Date: 17-01-2025 Time:3:15PM-4:15PM

S. Mapping
Question Pattern Marks
No COs
What is Gaming in AI? Write short notes on Propositional
1 Knowledge CO1 (2)
Logic?
What is Adversarial Search? Explain about MIN_MAX
2 Knowledge CO2 (2)
algorithm?
What is Pruning? Explain Alpha-Beta Pruning with an
3 Analyze CO2 (2)
example?
Define Constraint satisfaction problem (CSP)? Explain about
4 Understand CO2 (2)
knowledge based agents?
What is Backtracking algorithm explain algorithm with RGB
5 Apply CO2 (2)
map coloring problem?
 CLASS TEST-1 MARKS ANALYSIS
BRANCH : CSM – B
Name of the Subject: Introduction to Artificial Intelligence
Faculty Name: G.PRANAVI

Sl.No. H.T.No. Name of the Student

CT-1(10)

1 23271A6660 GURRAM ABHINAY REDDY A

9 23271A6661 PITTALA AJAY KUMAR 9

3 23271A6662 BODAPATLA AKHILA 9

4 23271A6663 GUNDU AKSHAYA 10

5 23271A6664 CHIRUTHA AKSHAYA 10
6 23271A6665 BANDI AKSHAYCHANDRA A
7 23271A6666 THOTA AKSHITHA 10
8 23271A6667 DASARI ANKITHA 10
9 23271A6668 ARUKALA ANU 10
10 23271A6669 KOTHURI ARAVIND 10
11 23271A6670 PARAMANDLA ARAVIND 9
12 23271A6671 SIRGADI ARTHI 10
13 23271A6672 KOTHURI ASHWINI 10
14 23271A6674 MOHAMMAD ASLAM 9
15 23271A6675 VEMULA CHETHAN 9
16 23271A6676 SOMISHETTI DURGARAJ 8.5
17 23271A6677 SYED FAIZAN 9
18 23271A6678 POLUDASARI GANESH 9
19 23271A6679 RAPOLU HARSHA VARDHAN 9
20 23271A6680 BEJJANKI HARSHINI 9
21 23271A6681 PANJALA KALYAN 9
22 23271A6682 NAKKA KAVYA 10
23 23271A6683 YAMSANI KOUSHAL 9
24 23271A6684 PISKA MAHESH 9
25 23271A6685 ERABOINA MALLIKARJUN 8
26 23271A6686 KADAVA MANASA 9
27 23271A6687 ARSAM MANASA 10
28 23271A6688 RENIKUNTA NARESH 8.5
29 23271A6689 GURRAM RAJ KIRAN 8.5
30 23271A6690 MEDIPALLI RUSHIKESH REDDY 9
31 23271A6691 PALLE SAMANVITHA 10
32 23271A6692 SANA FATHIMA 9
33 23271A6693 BANDARI SANDHYA 9
34 23271A6694 RAPARTHI SHASHANK 8.5
35 23271A6695 BODUGAM SHASHIVARDHAN 9
36 23271A6696 GAJULA SHIVA SHANKAR 9
37 23271A6697 ANAVENI SHRAVYA 10
38 23271A6698 UPPU SHRUTHI 10
39 23271A6699 VATTIMALLA SINDHU 9
40 23271A66A0 PONNAM SOHAN 9
41 23271A66A1 VEYEGANDLA SPANDANA 8.5
42 23271A66A2 MUDDASANI SPANDANA 10
43 23271A66A3 PONNAM SRI HARSHINI 10
44 23271A66A4 GODISELA SRINITHA 10
45 23271A66A5 TAYYABA TASNEEM 10
46 23271A66A6 RAGALLA VARSHITHA 8.5
47 23271A66A7 CHADA VENKAT REDDY 9
48 23271A66A8 ARRA VENKATESH 10
49 23271A66A9 MUTTARAM VISHNUVARDHAN 9
50 24275A6601 B.VARSHINI 9
51 24275A6602 T.SAITEJA 8
Mark Scored Below 50% 0
Mark Scored B/W 50% to 60% 0
Mark Scored B/W 61% to 70% 0
Mark Scored B/W 71% to 80% 1
Mark Scored B/W 81% to 90% 28
Mark Scored B/W 91% to 100% 17
 Analysis and Corrective Action

Total No of Students 51
No of student Appeared 49
No of student Absent 02
No of student Passed 49
No of Weak Student 01

Distributed Marks

Range Below B/W B/W B/W 71% B/W B/W 91% to

50% 50% to 61% to to 80% 81% to 100%
60% 70% 90%
No of students 0 0 0 1 28 17

Root Cause Analysis Identify the Weak student from the class Test 1.
The student are need to take more practice in the
loca l sea rc h a lgo rith ms.

Corrective Action Taken Conduct additional class for search algorithms.

Course Co-Ordinator HOD

 CLASS TEST-2 MARKS ANALYSIS
BRANCH : CSM – B
Name of the Subject: Introduction to Artificial Intelligence
Faculty Name: G.PRANAVI

Sl.No. H.T.No. Name of the Student

CT-2(10)

1 23271A6660 GURRAM ABHINAY REDDY A

2 23271A6661 PITTALA AJAY KUMAR A

3 23271A6662 BODAPATLA AKHILA 10

4 23271A6663 GUNDU AKSHAYA 10

5 23271A6664 CHIRUTHA AKSHAYA 10
6 23271A6665 BANDI AKSHAYCHANDRA 8.5
7 23271A6666 THOTA AKSHITHA 10
8 23271A6667 DASARI ANKITHA 9.5
9 23271A6668 ARUKALA ANU 9.5
10 23271A6669 KOTHURI ARAVIND A
11 23271A6670 PARAMANDLA ARAVIND A
12 23271A6671 SIRGADI ARTHI 8.5
13 23271A6672 KOTHURI ASHWINI 10
14 23271A6674 MOHAMMAD ASLAM A
15 23271A6675 VEMULA CHETHAN 6.5
16 23271A6676 SOMISHETTI DURGARAJ 9
17 23271A6677 SYED FAIZAN 7
18 23271A6678 POLUDASARI GANESH A
19 23271A6679 RAPOLU HARSHA VARDHAN A
20 23271A6680 BEJJANKI HARSHINI A
21 23271A6681 PANJALA KALYAN A
22 23271A6682 NAKKA KAVYA 9.5
23 23271A6683 YAMSANI KOUSHAL A
24 23271A6684 PISKA MAHESH 9
25 23271A6685 ERABOINA MALLIKARJUN 9
26 23271A6686 KADAVA MANASA 9.5
27 23271A6687 ARSAM MANASA 9.5
28 23271A6688 RENIKUNTA NARESH A
29 23271A6689 GURRAM RAJ KIRAN 9
30 23271A6690 MEDIPALLI RUSHIKESH REDDY 8
31 23271A6691 PALLE SAMANVITHA 9
32 23271A6692 SANA FATHIMA 9
33 23271A6693 BANDARI SANDHYA 10
34 23271A6694 RAPARTHI SHASHANK A
35 23271A6695 BODUGAM SHASHIVARDHAN 7
36 23271A6696 GAJULA SHIVA SHANKAR A
37 23271A6697 ANAVENI SHRAVYA 10
38 23271A6698 UPPU SHRUTHI 9.5
39 23271A6699 VATTIMALLA SINDHU 10
40 23271A66A0 PONNAM SOHAN 9
41 23271A66A1 VEYEGANDLA SPANDANA A
42 23271A66A2 MUDDASANI SPANDANA 7.5
43 23271A66A3 PONNAM SRI HARSHINI 10
44 23271A66A4 GODISELA SRINITHA 10
45 23271A66A5 TAYYABA TASNEEM 10
46 23271A66A6 RAGALLA VARSHITHA 9.5
47 23271A66A7 CHADA VENKAT REDDY 9
48 23271A66A8 ARRA VENKATESH 8
49 23271A66A9 MUTTARAM VISHNUVARDHAN 6
50 24275A6601 B.VARSHINI 9.5
51 24275A6602 T.SAITEJA 8.5
Mark Scored Below 50% 0
Mark Scored B/W 50% to 60% 1
Mark Scored B/W 61% to 70% 1
Mark Scored B/W 71% to 80% 5
Mark Scored B/W 81% to 90% 12
Mark Scored B/W 91% to 100% 18
 Analysis and Corrective Action

Total No of Students 51
No of student Appeared 40
No of student Absent 11
No of student Passed 40
No of Weak Student 3

Distributed Marks

Range Below B/W B/W B/W 71% B/W B/W 91% to

50% 50% to 61% to to 80% 81% to 100%
60% 70% 90%
No of students 0 1 1 5 12 18

Root Cause Analysis Identify the Weak student from the class Test 2.
The students are need to take more practice in the.
Adversarial search.

Corrective Action Taken Conduct additional class for constraint satisfaction

problem.

Course Co-Ordinator HOD

 II-B.Tech. I Sem - J23-Regulation SET-II
SECOND MID EXAMINATIONS - OCTOBER-2024
OPERATING SYSTEMS
COMPUTER SCIENCE AND ENGINEERING(AI&ML-A,B&C)
TIME: 2 Hours Max. Marks: 30
PART-A (Compulsory)
10 X 1 = 10 Marks
S.No. Questions Marks COs RBT

Which of the following is a component of Artificial Intelligence? [ ]

1 a) a) Learning b) Training c) Designing d) Puzzling 1 CO2 L1

b) CSP stands for ________ 1 CO2 L1

_________ number of informed search method are there in Artificial

c) Intelligence. 1 CO2 L2

. The total number of proposition symbols in AI are ________

d) 1 CO3 L1

The total number of logical symbols in AI are ____________

e) 1 CO3 L1

Artificial Intelligence has evolved extremely in all the fields except for
f) 1 CO3 L3
_________
. Who is the inventor of Artificial Intelligence? [ ]
a) Geoffrey Hinton b) Andrew Ng c) John McCarthy d) Jürgen
g)
Schmidhuber 1 CO1 L1

Which of the following is the branch of Artificial Intelligence []

h) a) Machine Learning b) Cyber forensics c) Full-Stack Developer d) 1 CO1 L2

Network Design
What is the goal of Artificial Intelligence? []
i) a) To solve artificial problems b) To extract scientific causes c) To explain 1 CO1 L1

various
In how many categories process of Artificial Intelligence is categorized? [ ]
a) categorized into 5 categories b) processes are categorized based on
j) 1 CO2 L1
the input provided c) categorized into 3 categories d) process is not
categorized
 PART-B
Note: Answer any four questions
Each question carry equal marks 4 X 5 = 20
Marks
S.No. Questions Marks COs RBT

Explain Breadth First Search and Depth First Search algorithm 5 CO1 L2
Q2
Explain briefly Alpha -Beta pruning algorithm 5 CO2
Q3 L2

Explain Propositional logic 5

Q4 CO2 L2

Explain First-order Logic with basic elements and quantifiers 5 CO3 L2

Q5
Define Intelligent agent and explain types of Intelligent agents? 5
CO1 L2
Q6

Define Hill climbing with neat diagram and explain types of Hill climbing. 5
Q7 CO1 L3
 MID Exam I
MARKS ANALYSIS
BRANCH : CSM – B
Name of the Subject: Introduction to Artificial Intelligence
Faculty Name: G. Pranavi

s.no H.T.No. Name of the Student

Mid-1(30)

1 23271A6660 GURRAM ABHINAY REDDY 5

2 23271A6661 PITTALA AJAY KUMAR 23

3 23271A6662 BODAPATLA AKHILA 21

4 23271A6663 GUNDU AKSHAYA 30

5 23271A6664 CHIRUTHA AKSHAYA 28
6 23271A6665 BANDI AKSHAYCHANDRA 20
7 23271A6666 THOTA AKSHITHA 13
8 23271A6667 DASARI ANKITHA 20
9 23271A6668 ARUKALA ANU 21
10 23271A6669 KOTHURI ARAVIND 20
11 23271A6670 PARAMANDLA ARAVIND 17
12 23271A6671 SIRGADI ARTHI 15
13 23271A6672 KOTHURI ASHWINI 13
14 23271A6674 MOHAMMAD ASLAM 20
15 23271A6675 VEMULA CHETHAN 13
16 23271A6676 SOMISHETTI DURGARAJ 15
17 23271A6677 SYED FAIZAN 13
18 23271A6678 POLUDASARI GANESH 19
19 23271A6679 RAPOLU HARSHA VARDHAN 14
20 23271A6680 BEJJANKI HARSHINI 26
21 23271A6681 PANJALA KALYAN 16
22 23271A6682 NAKKA KAVYA 24
23 23271A6683 YAMSANI KOUSHAL 16
24 23271A6684 PISKA MAHESH 22
25 23271A6685 ERABOINA MALLIKARJUN 20
26 23271A6686 KADAVA MANASA 24
27 23271A6687 ARSAM MANASA 27
28 23271A6688 RENIKUNTA NARESH 12
29 23271A6689 GURRAM RAJ KIRAN 13
30 23271A6690 MEDIPALLI RUSHIKESH REDDY 9
31 23271A6691 PALLE SAMANVITHA 19
32 23271A6692 SANA FATHIMA 26
33 23271A6693 BANDARI SANDHYA 24
34 23271A6694 RAPARTHI SHASHANK 9
35 23271A6695 BODUGAM SHASHIVARDHAN 8
36 23271A6696 GAJULA SHIVA SHANKAR 22
37 23271A6697 ANAVENI SHRAVYA 20
38 23271A6698 UPPU SHRUTHI 29
39 23271A6699 VATTIMALLA SINDHU 26
40 23271A66A0 PONNAM SOHAN 22
41 23271A66A1 VEYEGANDLA SPANDANA 16
42 23271A66A2 MUDDASANI SPANDANA 22
43 23271A66A3 PONNAM SRI HARSHINI 29
44 23271A66A4 GODISELA SRINITHA 23
45 23271A66A5 TAYYABA TASNEEM 26
46 23271A66A6 RAGALLA VARSHITHA 24
47 23271A66A7 CHADA VENKAT REDDY 23
48 23271A66A8 ARRA VENKATESH 22
49 23271A66A9 MUTTARAM VISHNUVARDHAN 23
50 24275A6601 B.VARSHINI 29
51 24275A6602 T.SAITEJA 23
Mark Scored Below 50% 11
Mark Scored B/W 50% to 60% 04
Mark Scored B/W 61% to 70% 09
Mark Scored B/W 71% to 80% 11
Mark Scored B/W 81% to 90% 05
Mark Scored B/W 91% to 100% 11
 Analysis Corrective Action(MID-I) for CSE-A

Root Cause Analysis Identify the Weak student from the MID Exam-I.
The student is needed to take more practice 1st
unit

Corrective Action Taken Conduct additional class for search algorithms.

Total No of Students 51
No of student Appeared 51
No of student Absent 00
No of student Passed 09
No of Weak Student 04

Distributed Marks

Range Below B/W B/W B/W 71% B/W B/W 91% to

50% 50% to 61% to to 80% 81% to 100%
60% 70% 90%
No of students 11 4 9 11 5 11

Course Co-Ordinator HOD

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING(AI&ML)

ASSIGNMENT-I
SUBJECT: INTRODUCTION TO ARTIFICIAL INTELLIGENCE

YEAR-SEM: II B.TECH – II SEM SECTION:CSM(A,B,C)

Mode of Submission: Offline
Assigned Date :00-00 -2025 Last Date of submission : 00-00-2025
Max. Mark 5
Need to Attempt 3 Questions
Q.NO. Questions COs Level

Q1 Discuss about AI and explain AI agents. C01 L2

Q2 Explain Uniformed search strategies

CO1 L2
Q3 Describe briefly A* Search algorithm. CO1 L1

Q4 Describe briefly Hill-climbing search. L1

CO1
Q5 What is Gaming in AI? Explain Adversarial search ? L2
CO2
Q6 What is Resolution? Explain Wumpus world logic? CO2 L2

Q7 Define Constraint satisfaction problem (CSP)? Explain about CO2 L1&L2

knowledge based agents?

Q8 Explain Alpha-Beta Pruning with an example? L2

CO2
Q9 Discuss about Knowledge Engineering in First-Order Logic. L2
CO3
 Note: Student need to answer the Assignment Question Group wise

Group Student H.T.No Group of Questions

No.

I 23271A6601-23271A6620 Q1, Q5 & Q9

II 23271A6621-22271A6640 Q4 ,Q2 &Q6

III 23271A6641-23271A6660 Q7, Q8 & Q3

IV 23271A6661-23271A6680 Q1, Q5 & Q9

V 23271A6681-22271A66A0 Q4 ,Q2 &Q6

VI 23271A66A1-23271A66C0 Q7, Q8 & Q3

VII 23271A66C1-23271A66E0 Q1, Q5 & Q9

VIII 23271A66E1-22271A66G0 Q4 ,Q2 &Q6

IX 23271A66G1-23271A66I7 Q7, Q8 & Q3

24275A6601-24275A6606

Faculty In charge HOD CSE

 Assignment -1/Marks
Name of the Subject: Introduction to Artificial Intelligent
Branch: CSM-B

S.NO H.T.No. Name of the Student

Assignment(5)

1 23271A6660 GURRAM ABHINAY REDDY 3

2 23271A6661 PITTALA AJAY KUMAR 5

3 23271A6662 BODAPATLA AKHILA 5

4 23271A6663 GUNDU AKSHAYA 5
5 23271A6664 CHIRUTHA AKSHAYA 5
6 23271A6665 BANDI AKSHAYCHANDRA 5
7 23271A6666 THOTA AKSHITHA 4
8 23271A6667 DASARI ANKITHA 5
9 23271A6668 ARUKALA ANU 5
10 23271A6669 KOTHURI ARAVIND 5
11 23271A6670 PARAMANDLA ARAVIND 5
12 23271A6671 SIRGADI ARTHI 4
13 23271A6672 KOTHURI ASHWINI 5
14 23271A6674 MOHAMMAD ASLAM 5
15 23271A6675 VEMULA CHETHAN 3
16 23271A6676 SOMISHETTI DURGARAJ 4
17 23271A6677 SYED FAIZAN 3
18 23271A6678 POLUDASARI GANESH 5
19 23271A6679 RAPOLU HARSHA VARDHAN 4
20 23271A6680 BEJJANKI HARSHINI 5
21 23271A6681 PANJALA KALYAN 4
22 23271A6682 NAKKA KAVYA 5
23 23271A6683 YAMSANI KOUSHAL 4
24 23271A6684 PISKA MAHESH 5
Course Co-Ordinator HOD
 LESSON PLAN

COURSE TITLE WITH COIRSE CODE 23CM404PC:INTRODUCTION TO ARTIFICIAL

INTELLIGENCE
REGULATION R23
COURSE CO-ORDINATOR G.PRANAVI
YEAR/SEM/CLASS II /II /CSM(A,B,C)
BRANCH CSE(AI&ML)
No.of. Mode of
S.No. Topic Remarks
Hours Teaching
Unit-1 Introduction to AI
Definition, history of AI 1 Chalk & Talk
1
Applications of AI 1 Chalk & Talk
2

3 Intelligent Agents, types of Agents 1 Chalk & Talk

Problem solving in AI, Techniques to solve 1 Chalk & Talk

4
Searching Introduction(Uninformed, Informed) 1 Chalk & Talk
5
BFS with an example 1 Chalk
6
&Talk
7 DFs with an example 1 Chalk& Talk

Hill climbing search 1 Chalk & Talk

8
9 Simulated annealing search 1 PPT

Local search in continuous spaces 1 PPT

10
AI advantages and Disadvantages 1 DEMO
11
12 Revision 1 Chalk & Talk Class Test-1

Unit-2 Gaming
13 Optimal Decisions in Games, Adversarial search 1 Chalk & Talk

14 Min-Max algorithm with an example 1 Chalk & Talk

15 Alpha-Beta pruning 1 Chalk & Talk

16 Defining constraint satisfaction problem(CSP) 1 Chalk & Talk

17 Examples 1 Chalk & Talk

18 Backtracking CSP 1 Chalk & Talk

19 Forward Checking, Constraint Propagation 1 Chalk & Talk

20 Knowledge based agents 1 Chalk & Talk

21 Logic: Propositional logic 1 Chalk & Talk

22 Theorem Proving: Wumpus world logic 1 Chalk & Talk

23 Proof by Resolution(CNF) 1 Chalk & Talk

24 Horn clauses, Definite clauses 1 Chalk & Talk Class Test-2

Unit-3- First order logic(FOL)

25 FOL syntax and semantics 1 Chalk & Talk

26 Quantifiers in FOL 1 Chalk & Talk

27 Knowledge Engineering in FOL 1 Chalk & Talk

28 Unification Theorem 1 Chalk & Talk

29 Inference and Resolution in FOL 1 Chalk & Talk

30 Propositional vs First order 1 PPT

31 Forward chaining, backward chaining 1 Chalk & Talk

32 Knowledge representation types 1 Chalk & Talk

33 Ontological Engineering 1 Chalk & Talk

34 Objects and Events 1 Chalk & Talk

35 Revision 1 DEMO Class Test-3

Unit-4- Planning
36 Definition of Classical planning 1 Chalk & Talk

37 Algorithms of planning with state space search 1 Chalk & Talk

38 Planning Graphs 1 Chalk & Talk

39 Real World examples 1 Chalk & Talk

40 Other classical planning approaches 1 Chalk & Talk

41 Analysis of planning approaches 1 Chalk & Talk

42 Planning Hierarchies 1 Chalk & Talk

43 Planning and acting in real world 1 Chalk & Talk

44 Multi agent planning 1 Chalk & Talk

45 Revision 1 DEMO Class Test-4

Unit-5- Probabilistic Reasoning

46 Acting under Uncertainty 1 Chalk & Talk

47 Basic probability notation 1 Chalk & Talk

48 Baye’s rule and its use 1 Chalk & Talk

49 Probabilistic reasoning 1 Chalk & Talk

50 Representing knowledge under uncertain domain 1 Models

51 Semantics of Bayesian networks 1 PPT

52 Efficient representation of conditional distributions 1 Chalk & Talk

53 Approximate inference in Bayesian networks 1 Chalk & Talk

54 Relational and First order probability 1 Chalk & Talk

55 Revision 1 Chalk & Talk

Total 55

No. of hours prescribed in the syllabus

Total number of hours planned as per the time table 60

Tentative Dates of Events

Reopening Date 25.11.2024
Last Working Day 19.03.2025
I MID Examination 21.01.2025
II MID Examination 21.03.2025
 Course Co-ordinator HOD

II B.Tech. II Sem , MARCH- 2024 - 2025

CLASS TEST-III

Introduction to Artificial Intelligence-(J-22 Curriculum)

Time : 60 Minutes CSE(AIML) – A,B,C ,CMaximum : 10Marks

(Answer All Questions)
Date: 18-2-2025 Time:3:15PM-4:15PM

Blooms Taxonomy CO
Q. Question Description
(Knowledge Level) Mapping
No.

1 Explain First order logic. What is Unification? K2 CO3

2 Explain knowledge engineering in FOL? K2 CO3

3 Summarize Inference in First-Order Logic? K2 CO3

4 Discuss First Order Logic inference rules for K2 CO3

quantifier? What is Ontological Engineering?

5 Explain Forward chaining & Backward Chaining in K3 CO3

Artificial Intelligence with an example?
 CLASS TEST-3 MARKS ANALYSIS
BRANCH : CSM – B
Name of the Subject: Introduction to Artificial Intelligence
Faculty Name: G.PRANAVI

s.no H.T.No. Name of the Student

Mid-1(30)

1 23271A6660 GURRAM ABHINAY REDDY 5

2 23271A6661 PITTALA AJAY KUMAR 23

3 23271A6662 BODAPATLA AKHILA 21

4 23271A6663 GUNDU AKSHAYA 30

5 23271A6664 CHIRUTHA AKSHAYA 28
6 23271A6665 BANDI AKSHAYCHANDRA 20
7 23271A6666 THOTA AKSHITHA 13
8 23271A6667 DASARI ANKITHA 20
9 23271A6668 ARUKALA ANU 21
10 23271A6669 KOTHURI ARAVIND 20
11 23271A6670 PARAMANDLA ARAVIND 17
12 23271A6671 SIRGADI ARTHI 15
13 23271A6672 KOTHURI ASHWINI 13
14 23271A6674 MOHAMMAD ASLAM 20
15 23271A6675 VEMULA CHETHAN 13
16 23271A6676 SOMISHETTI DURGARAJ 15
17 23271A6677 SYED FAIZAN 13
18 23271A6678 POLUDASARI GANESH 19
19 23271A6679 RAPOLU HARSHA VARDHAN 14
20 23271A6680 BEJJANKI HARSHINI 26
21 23271A6681 PANJALA KALYAN 16
22 23271A6682 NAKKA KAVYA 24
23 23271A6683 YAMSANI KOUSHAL 16
24 23271A6684 PISKA MAHESH 22
25 23271A6685 ERABOINA MALLIKARJUN 20
26 23271A6686 KADAVA MANASA 24
27 23271A6687 ARSAM MANASA 27
28 23271A6688 RENIKUNTA NARESH 12
29 23271A6689 GURRAM RAJ KIRAN 13
MEDIPALLI RUSHIKESH
30 23271A6690 9
REDDY
31 23271A6691 PALLE SAMANVITHA 19
32 23271A6692 SANA FATHIMA 26
33 23271A6693 BANDARI SANDHYA 24
34 23271A6694 RAPARTHI SHASHANK 9
35 23271A6695 BODUGAM SHASHIVARDHAN 8
36 23271A6696 GAJULA SHIVA SHANKAR 22
37 23271A6697 ANAVENI SHRAVYA 20
38 23271A6698 UPPU SHRUTHI 29
39 23271A6699 VATTIMALLA SINDHU 26
40 23271A66A0 PONNAM SOHAN 22
41 23271A66A1 VEYEGANDLA SPANDANA 16
42 23271A66A2 MUDDASANI SPANDANA 22
43 23271A66A3 PONNAM SRI HARSHINI 29
44 23271A66A4 GODISELA SRINITHA 23
45 23271A66A5 TAYYABA TASNEEM 26
46 23271A66A6 RAGALLA VARSHITHA 24
47 23271A66A7 CHADA VENKAT REDDY 23
48 23271A66A8 ARRA VENKATESH 22
49 23271A66A9 MUTTARAM VISHNUVARDHAN 23
50 24275A6601 B.VARSHINI 29
51 24275A6602 T.SAITEJA 23
Mark Scored Below 50% 11
Mark Scored B/W 50% to 60% 04
Mark Scored B/W 61% to 70% 09
Mark Scored B/W 71% to 80% 11
Mark Scored B/W 81% to 90% 05
Mark Scored B/W 91% to 100% 11
 Root Identify the Weak student from
Cause the MID Exam-I. The student is
Analysis needed to take more practice 1st
unit
Correctiv Conduct additional class for
e Action search algorithms.
Taken

Analysis Corrective Action(MID-I) for CSE-A

Total No of Students 51
No of student Appeared 51
No of student Absent 00
No of student Passed 09
No of Weak Student 04

Distributed Marks

Range Below B/W B/W B/W 71% B/W B/W 91% to

50% 50% to 61% to to 80% 81% to 100%
60% 70% 90%
No of students 11 4 9 11 5 11
 Course Co-Ordinator HOD

II B.Tech. II Sem , MARCH- 2024 - 2025

CLASS TEST-IV

Introduction to Artificial Intelligence-(J-23 Curriculum)

Time : 60 Minutes CSE(AIML) – B Maximum : 10Marks

(Answer All Questions)
Date: 06-03-2025 Time:3:15PM-4:15PM

S. Mapping
Question Pattern Marks
No COs
1 What is Planning? Explain about Classical Planning? Knowledge CO4 (2)

2 Demonstrate Planning Graph with an example? Apply CO4 (2)

3 Explain algorithms for planning with state space search? Analyze CO4 (2)

Compare and contrast Total order planning and Partial order

4 Understand CO4 (2)
planning?

5 What is Hierarchical planning? Explain it in detail? Knowledge CO4 (2)

 CLASS TEST-4 MARKS ANALYSIS
BRANCH : CSM – B
Name of the Subject: Introduction to Artificial Intelligence
Faculty Name: G.PRANAVI

S.NO H.T.No. Name of the Student

CT-4

1 23271A6660 GURRAM ABHINAY REDDY

2 23271A6661 PITTALA AJAY KUMAR

3 23271A6662 BODAPATLA AKHILA

4 23271A6663 GUNDU AKSHAYA
5 23271A6664 CHIRUTHA AKSHAYA
6 23271A6665 BANDI AKSHAYCHANDRA
7 23271A6666 THOTA AKSHITHA
8 23271A6667 DASARI ANKITHA
9 23271A6668 ARUKALA ANU
10 23271A6669 KOTHURI ARAVIND
11 23271A6670 PARAMANDLA ARAVIND
12 23271A6671 SIRGADI ARTHI
13 23271A6672 KOTHURI ASHWINI
14 23271A6674 MOHAMMAD ASLAM
15 23271A6675 VEMULA CHETHAN
16 23271A6676 SOMISHETTI DURGARAJ
17 23271A6677 SYED FAIZAN
18 23271A6678 POLUDASARI GANESH
19 23271A6679 RAPOLU HARSHA VARDHAN
20 23271A6680 BEJJANKI HARSHINI
21 23271A6681 PANJALA KALYAN
22 23271A6682 NAKKA KAVYA
23 23271A6683 YAMSANI KOUSHAL

Analysis Corrective Action(MID-I) for CSE-A

Total No of Students
No of student Appeared
No of student Absent
No of student Passed
No of Weak Student

Distributed Marks

Range Below B/W B/W B/W 71% B/W 81% B/W 91% to
50% 50% to 61% to to 80% to 100%
60% 70% 90%
No of students
 Root Cause Analysis Identify the Weak student from the MID Exam-I. The student
is needed to take more practice 1st unit

Corrective Action Taken Conduct additional class for search algorithms.

Course Co-Ordinator HOD

II-B.Tech. II Sem - J23-Regulation SET-II

SECOND MID EXAMINATIONS -MARCH-2025
INTRODUCTION TO ARTIFICIAL INTELLIGENCE
COMPUTER SCIENCE AND ENGINEERING (AI&ML-A,B&C)
TIME: 2 Hours
Max. Mark:30
PART-A (Compulsory)
10 X 1 = 10 Marks

S.No. Questions Marks COs RBT

"In AI, we study the whole universe by dividing it into two
components."
Identify those two components?
A. Sky and Land
1 a)
B. Agent and environment 1 CO3 L3
C. Yes or No
D. None of the above

b) Which of the following is true with respect to uncertainty in AI systems? 1 CO5 L1

 A. Uncertainty arises when we are not 100 percent confident in our
decisions
B. Whenever uncertainty arises, there is needs to be an estimation
taken for getting to any conclusion
C. The AI agent should take certain decisions even in the situations
of uncertainty
D. All of the above

The results that we get after we apply probabilistic reasoning to a

problem are,
A. 100% accurate
c) B. Estimated values 1 CO5 L2
C. Wrong values
D. None of the above

In planning any Action can be specified with the following

A. precondition and effect
d) B. postcondition and effect 1 CO4 L2
C. precondition and postcondition
D. None of the above.
There are two types of quantifiers used to quantify the statement in the
knowledge representation in AI. What are these two types of quantifiers?
A. Universal Quantifiers
e) 1 CO3 L1
B. Subjective Quantifiers
C. Existential Quantifiers
D. Selective Quantifier
f) Forward chaining is also known as___________________4 1 CO3 L1

The chance of
g) 1 CO5 L2
occurrence of an event can be explained with__________________
h) Planning is defined as_______________________________________ 1 CO4 L1
i) PDDL is known as_______________________________ 1 CO4 L1
j) Baye’s theorem formula______________________________ 1 CO5 L1

PART-B
Note: Answer any four questions
Each question carry equal marks 4 X 5 = 20
Marks
S.N Questions Marks COs RBT
o.
a) What is Unification algorithm? Explain with suitable example? 5 CO3 L2
Q2
b) Discuss the steps involved in Knowledge-engineering in FOL?
Explain the GRAPH PLAN algorithm? Demonstrate with suitable real 5
Q3 CO4 L3
time example?
What is Hierarchical Planning? Explain? 5 CO4 L2
Q4
Differentiate Total order planning and Partial order planning? 5 CO4
Q5 L4
Q6 Define Uncertainty? Explain Probabilistic Reasoning? 5 CO5 L2
What is Bayesian Network? Analyse how it is useful in Uncertainty? 5 CO5 L4
Q7