Define Artificial Intelligence, Intelligent Agent and its use.
Artificial Intelligence Question Papers - SPPU University
Access and download Artificial Intelligence question papers from Savitribai Phule Pune University (SPPU). Our collection includes INSEM (Internal Semester) and ENDSEM (End Semester) exam papers.
Available Artificial Intelligence Papers
We offer 11 question papers for Artificial Intelligence, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
INSEM Papers for Artificial Intelligence
Prepare for mid-term evaluations with Artificial Intelligence INSEM papers, aligned with the SPPU exam pattern and syllabus.
ENDSEM Papers for Artificial Intelligence
Access Artificial Intelligence ENDSEM papers covering the entire syllabus, essential for final exam preparation.
Online PDF Viewer Features
Our question-paper viewer enables you to:
- View papers in single or split-screen mode.
- Compare multiple papers simultaneously.
- Use fullscreen mode for better readability.
- Filter by exam type (INSEM/ENDSEM).
- Download papers for offline study.
About SPPU Question Papers Hub
SPPU Question Papers Hub is focused entirely on SPPU previous year papers, with cleaner discovery by branch, semester, and subject.
Study Materials for Artificial Intelligence
Artificial Intelligence is a key subject in the SPPU curriculum. Our question paper collection helps students understand exam patterns, practice effectively, and improve academic performance.
Relevant Keywords & Topics
Explore Artificial Intelligence resources including SPPU question papers from Savitribai Phule Pune University. Find INSEM and ENDSEM papers for effective examination preparation. Our platform offers academic resources, a PDF viewer for online study, university question papers, and materials for semester examinations.
Artificial Intelligence
Download Artificial Intelligence Papers
INSEM Papers
Download all INSEM question papers as ZIP
ENDSEM Papers
Download all ENDSEM question papers as ZIP
All Papers
Download all question papers (INSEM + ENDSEM) as ZIP
Artificial Intelligence Questions
Pre-rendered question cards from available structured metadata.
2025 Aug INSEM
Q1
15 MarksList advantages of Artificial Intelligence.
Describe Learning Agent Architecture with diagram.
Q2
15 MarksWrite a note on ‘Evaluation of search strategy’.
Explain different search strategies.
What is Heuristic function?
Q3
15 MarksDescribe Hill climbing search with suitable example. List disadvantage of hill climbing process.
Differentiate between Blind search and Heuristic search.
Q4
15 MarksList steps involved in simple problem solving technique with suitable example.
Explain A* algorithm with suitable example.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | 6579-429 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2025 Aug INSEM |
| Watermark | ['CEGP013091', '49.248.216.237 26/08/2025 10:32:52 static-237'] |
2024 Sep INSEM
Q1
15 MarksDefine Artificial Intelligence. State and explain the four approaches of Artificial Intelligence?
What is an agent? Draw and explain the Architecture of General Learning Agent.
Enlist the advantages of Artificial Intelligence.
Q2
15 MarksWhat is an Environment for an agent? Explain various types of Environments.
List different types of agent programs. Draw and explain any two agent programs.
Explain the attributes used in agent design. Write PEAS description for following systems. i) A Vacuum Cleaner world system ii) Interactive English Tutor system
Q3
15 MarksDefine problem? Write & explain the five components of Well-defined problem.
Explain different search strategies.
Explain Hill climbing algorithm. Explain Local Maxima, Global Maxima and plateau for an example.
Q4
15 MarksExplain A* algorithm with suitable example.
What is Heuristic function?
Explain Depth-limited search and Iterative deepening depth-first search. Compare both search strategies w.r.t. Completeness, Optimality, Space Complexity and Time Complexity.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6360]-128 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2024 Sep INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 04/09/2024 10:42:50 static-238'] |
2023 Sep INSEM
Q1
15 MarksExplain different forms of Agent. With example.
Explain the significance of PEAS in AI.
Q2
15 MarksExplain any four type of task environment with example.
Explain ‘‘Simple Reflex based Agent’’ with the help of schematic diagram or pseudo code.
Q3
15 MarksExplain A*algorithm and write its pseudo code.
Write Min-max Search Algorithm for two players. How use of alpha and beta cut-offs will improve performance?
Q4
15 MarksExplain hill climbing algorithm. Explain plateau, ridge, local maxima and global maxima.
Define Heuristics. Explain the significance of Heuristic function in the informed search with suitable example.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6187]-530 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2023 Sep INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 07/09/2023 10:44:34 static-238'] |
2022 Oct INSEM
Q1
15 MarksWhat is AI? Explain risk and benefits of AI.
What is Intelligent Agent? Explain structure of agent and example with PEAS Property for Automatic Taxi Driving.
Q2
15 MarksDifferentiate between informed and uninformed search algorithms also explain iterative deepening search in short.
i) Define state-space search technique ii) Define CSP. Solve SEND + MORE
Q3
15 MarksExplain the concept of Rationality
i) Explain problem solving agents with suitable example. ii) Explain learning agents with its components.
Q4
15 MarksDifferentiate between model-based agents & utility-based agents
Explain Min Max Tree. Solve alpha-beta tree search for following search problem. Also given minimum two advantages of alpha beta algorithm over min max algorithm.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | 631 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2022 Oct INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 07/10/2022 10:37:06 static-238'] |
2025 May Jun ENDSEM
Q1
18 MarksExplain Min-Max search procedure with an example.
Explain alpha beta pruning with example.
Q2
18 MarksExplain how constraint propagation is carried out in CSP.
Explain and represent N-Queen problem as CSP.
Q3
17 MarksWrite the algorithm for deciding entailment in prepositional logic.
Explain property inheritance algorithm with example.
Q4
17 MarksConsider the following sentences. • John likes all kinds of food • Apples are food • Chicken is food • Anything anyone eats and isn’t killed by is food • Bill eats peanuts and is still alive • Sue eats everything bill eats i) Translate these sentences into formulas in predicate logic ii) Prove that John likes peanuts using backward chaining iii) Convert the formulas of a part into clause form iv) Prove that john likes peanuts using resolution
Discuss and define following words in the context of AI. i) Intelligence ii) Knowledge iii) Information iv) Logical Reasoning
Q5
18 MarksExplain Non Monotonic reasoning and discuss Various logic associated with it.
Explain unification algorithm used for reasoning under predicate logic with an example.
Q6
18 MarksConvert following sentences into FOL representation. i) Every student who takes English passes it. ii) John likes books and music. iii) All elephants are gray in color. iv) Not all students take both History and Biology. v) Sue eats everything Bill eats. vi) If the car belongs to John then it is green. vii) Anything any one eats and isn’t kill by food viii) Only one student failed in History. ix) Some students take English in summer 2020.
What are fuzzy membership function explain with example.
Q7
17 MarksWrite short note on circumscription.
Discuss theory of beliefs.
What do you mean by ontology of situation calculus?
Q8
17 MarksWrite short note on AI architecture.
Discuss and Analyze various planning approaches.
Explain terms time and schedule from perspective of temporal planning.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | V |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6403]-52 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence & Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 21/05/2025 09:44:54 static-237'] |
2025 Nov Dec ENDSEM
Q1
18 MarksExplain the Min Max Algorithm with an example. Comment on the efficiency of the Min-Max Algorithm improvement using Alpha Beta Pruning.
Solve the crypt-arithmetic problem and show the search space tree for the problem, TWO + TWO = FOUR. Identify the variables, domain and constraints.
Q2
18 MarksExplain and solve the graph coloring problem, using constraint satisfaction.
Explain with an example the Monte Carlo Tree Search.
Q3
17 MarksExplain Wumpus world environment giving its PEAS description.
What is a Knowledge Agent? What are the aspects to be taken into consideration for designing a knowledge-based agent to assist with medical diagnosis?
Q4
17 MarksWrite in predicate logic the following statements. • John likes all kinds of food. • Apples are food. • Chicken are food. • Anything anyone eats and isn't killed by is food. • Bill eats peanuts and is still alive.
Differentiate between propositional logic and First-order logic.
Q5
18 MarksExplain forward chaining and backward chaining for a simple example.
Explain the process of resolution with a proper example.
Q6
18 MarksExplain the Unification Algorithm, wherever necessary take an example to explain the steps.
Explain the key aspects of ontological engineering, which plays a crucial role in knowledgere presentation.
Q7
17 MarksExplain goal stack planning with an example of a blocks world.
Explain the components of a planning system for a simple Blocks World example.
What are the ethical considerations and potential limitations that arise in AI development?
Q8
17 MarksExplain in brief Planning and its types.
What emerging trends and challenges in the future of AI.
Comment on AI Architecture.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | V |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6583]-57 |
| Academic Year | T.E. |
| Branch Name | A.I.& D.S. / Computer Science & Engg.(Data Science) |
| Exam Type | ENDSEM |
| Exam Session | 2025 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 18/12/2025 09:59:01 static-237'] |
2024 May Jun ENDSEM
Q1
18 MarksExplain min Max and Alpha Beta pruning algorithm for adversarial search with example
Define and explain Constraints satisfaction problem.
Q2
18 MarksExplain with example graph coloring problem.
How Al technique is used to solve tic-tac-toe problem.
Q3
17 MarksExplain Wumpus world environment giving its PEAS description.
Explain different inference rules in FOL with suitable example.
Q4
17 MarksWrite an propositional logic for the statement, i) “All birds fly” ii) “Every man respect his parents”
Differentiate between propositional logic and First order logic.
Q5
18 MarksExplain Forward chaining algorithm with the help of example.
Write and explain the steps of knowledge engineering process.
Q6
18 MarksExplain Backward chaining algorithm with the help of example.
Write a short note on i) Resolution and ii) Unification
Q7
17 MarksWrite a short note on planning agent, state goal and action representation
Explain different components of planning system.
Explain the components of AI.
Q8
17 MarksWhat are the types of planning? Explain in detail.
Explain Classical Planning and its advantages with Example.
Write note On hierarchical task network planning.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6262]-52 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence & Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2024 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 25/05/2024 09:48:28 static-238'] |
2024 Nov Dec ENDSEM
Q1
17 MarksDefine Game theory,, Differentiate between stochastic and partial games with examples.
What is Constraint satisfaction problem, State Types of consistencies Solve the following coloring problem using constraints satisfaction problem. Variables WA, NT, Q, NSW, V,SA, T. Domains Di = {red, green, blue}. Constraints: adjacent regions must have different colors e.g., WA NT
Q2
17 MarksList All the strategies of problem solving. What is backtracking, explain with n queen problem with Branch and Bound or Backtracking strategy.
How to make Optimal decision in Games, Explain Monte Carlo Tree search algorithm with all steps and one example.
Q3
18 MarksExplain Knowledge based agent with Wumpus World.
What is Knowledge Engineering, Explain in short semantic Network with example? And Draw Semantic Network for below example: Tom is Cat, Tom is Grey in Color, Tom is Mammal, Tom is owned by Sam
Q4
18 MarksExplain inference in Propositional Logic Write the following sentences in FOL (using types of quantifiers) (any 2) : i) No one has climbed every mountain in the Himalayas ii) Someone has visited every country in the world except Libya iii) Not all cars have carburetors iv) Some numbers are not real
i) Differentiate between Propositional logic and First Order Logic. Any 4 points ii) Explain Syntax and Semantics of FOL
Q5
17 MarksExplain Forward Chaining and Backward Chaining. “The law says that it is crime for an American to sell weapons to hostile nations. The country Nono, an enemy of America, has some missiles, and all of its missiles were sold to it by colonel West, who is American” Now prove that West is a Criminal. With forward Chaining OR Backward Chaining.
Explain: Unification Algorithm in FOL. Solve stepwise with proper comments if p(x,g(x)) is equal to or not equal to p(z,y).
Q6
17 MarksExplain FOL inference for following Quantifiers : • Universal Generalization • Uhiversal Instantiation • Existential Instantiation • Existential introduction
Define and Explain Ontological Engineering indetails, with Definition Categories and Objects Models.
Q7
18 MarksExplain : i) Classical planning ii) Hierarchal planning
Explain with example, how planning is different from problem solving.
Explain AI components and AI architecture.
Q8
18 MarksExplain Planning in non-deterministic domain.
Explain i) Importance of planning ii) Algorithm for classical planning
What is AI Explain Scope of AI in all walks of Life also explain Future opportunities with AI.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6353]-52 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2024 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 17/12/2024 09:43:35 static-237'] |
2023 May Jun ENDSEM
1
18 MarksWhat are the issues that need to be addressed for solving CSP efficiently? Explain the Solutions to them.
Explain heuristic function that can be used in cutting off search in detail.
2
18 MarksExplain Alpha-Beta Tree search and cutoff procedure in detail with an.example.
Define constraints in CSPs. Explain any two types of Constrains in detail.
What are the limitations of Game search algorithms?
3
17 MarksWhat are the various approaches to knowledge representation? Explain in detail.
Detail the algorithm for deciding entailment in proposition logic.
4
17 MarksDifferentiate propositional logic with First order logic. List the Inference rules along with suitable examples for first order logic.
Explain Knowledge representation structures and compare them.
5
18 MarksExplain Unification algorithm with suitable example.
What is knowledge engineering? Explain ontology of situation calculus.
6
18 MarksExplain the forward chaining process and efficient forward chaining with example. State its usage.
What are the reasoning patterns in Propositional logic? Explain them in detail.
Write a note on: categories and objects.
7
17 MarksExplain time, schedules and resources in temporal domain with an example.
Discuss Al and its ethical concerns. Explain Limitations of Al.
8
17 MarksAnalyze various planning approaches in detail.
Explain Al Architecture with a suitable diagram.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6003]-537 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2023 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 06/07/2023 10:40:54 static-238'] |
2023 Nov Dec ENDSEM
Q1
18 MarksExplain Min Max and Alpha Beta pruning algorithm for adversarial search with example
Define and explain Constraints satisfaction problem.
Q2
18 MarksExplain with example graph coloring problem.
How AI technique is used to solve tic-tac-toe problem.
Q3
17 MarksExplain Wumpus world environment giving its PEAS description.
Explain different inference rules in FOL with suitable example.
Q4
17 MarksWrite an propositional logic for the statement, i) “All birds fly” ii) “Every man respect his parents”
Differentiate between propositional logic and First order logic.
Q5
18 MarksExplain Forward chaining algorithm with the help of example.
Write and explain the steps of knowledge engineering process.
Q6
18 MarksExplain Backward chaining algorithm vith the help of example.
Write a short note on i) Resolution and ii) Unification
Q7
17 MarksWrite a short note on planning agent, state goal and action representation.
Explain different components of planning system.
Explain the components of AI
Q8
17 MarksWhat are the types of planning? Explain in detail.
Explain Classical Planning and its advantages with Example.
Write note on hierarchical task network planning.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6180]-63 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence & Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2023 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 06/12/2023 09:45:03 static-238'] |
2022 Nov Dec ENDSEM
Q1
18 MarksWhat are the issues that need to be addressed for solving CSP efficiently? Explain the Solutions to them.
Explain heuristic function that can be used in cutting off search in detail.
Q2
18 MarksExplain Alpha-Beta Tree search and cutoff procedure in detail with an example.
Define constraints in CSPs. Explain any two types of Constrains in detail.
What are the limitations of Game search algorithms?
Q3
17 MarksWhat are the various approaches to knowledge representation? Explain in detail.
Detail the algorithm for deciding entailment in proposition logic.
Q4
17 MarksDifferentiate propositional logic with First order logic. List the Inference rules along with suitable examples for first order logic.
Explain Knowledge representation structures and compare them.
Q5
18 MarksExplain Unification algorithm with suitable example.
What is knowledge engineering? Explain ontology of situation calculus.
Q6
18 MarksExplain the forward chaining process and efficient forward chaining with example. State its usage.
What are the reasoning patterns in Propositional logic? Explain them in detail.
Write a note on: categories and objects.
Q7
17 MarksExplain time, schedules and resources in temporal domain with an example.
Discuss AI and its ethical concerns. Explain Limitations ofAI.
Q8
17 MarksAnalyze various planning approaches in detail.
Explain AI Architecture with a suitable diagram.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [5926]-242 |
| Academic Year | T.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2022 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 18/01/2023 13:33:35 static-238'] |