What are the issues that need to be addressed for solving CSP efficiently? Explain the Solutions to them.
Please rotate your device horizontally for split view
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.
We offer 10 question papers for Artificial Intelligence, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
Prepare for mid-term evaluations with Artificial Intelligence INSEM papers, aligned with the SPPU exam pattern and syllabus.
Access Artificial Intelligence ENDSEM papers covering the entire syllabus, essential for final exam preparation.
Our question-paper viewer enables you to:
SPPU Question Papers Hub is focused entirely on SPPU previous year papers, with cleaner discovery by branch, semester, and subject.
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.
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.
Download all INSEM question papers as ZIP
Download all ENDSEM question papers as ZIP
Download all question papers (INSEM + ENDSEM) as ZIP
What 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.
Explain 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?
What are the various approaches to knowledge representation? Explain in detail.
Detail the algorithm for deciding entailment in proposition logic.
Differentiate 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.
Explain Unification algorithm with suitable example.
What is knowledge engineering? Explain ontology of situation calculus.
Explain 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.
Explain time, schedules and resources in temporal domain with an example.
Discuss Al and its ethical concerns. Explain Limitations of Al.
Analyze 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'] |
Explain min Max and Alpha Beta pruning algorithm for adversarial search with example
Define and explain Constraints satisfaction problem.
Explain with example graph coloring problem.
How Al technique is used to solve tic-tac-toe problem.
Explain Wumpus world environment giving its PEAS description.
Explain different inference rules in FOL with suitable example.
Write an propositional logic for the statement, i) ‘All birds fly’ ii) ‘Every man respect his parents’
Differentiate between propositional logic and First order logic.
Explain Forward chaining algorithm with the help of example.
Write and explain the steps of knowledge engineering process.
Explain Backward chaining algorithm with the help of example.
Write a short note on i) Resolution and ii) Unification
Write a short note on planning agent, state goal and action representation
Explain different components of planning system.
Explain the components of AI.
What 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'] |
Explain Min-Max search procedure with an example.
Explain alpha beta pruning with example.
Explain how constraint propagation is carried out in CSP.
Explain and represent N-Queen problem as CSP.
Write the algorithm for deciding entailment in prepositional logic.
Explain property inheritance algorithm with example.
Consider 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
Explain Non Monotonic reasoning and discuss Various logic associated with it.
Explain unification algorithm used for reasoning under predicate logic with an example.
Convert 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.
Write short note on circumscription.
Discuss theory of beliefs.
What do you mean by ontology of situation calculus?
Write 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'] |
What 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.
Explain 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?
What are the various approaches to knowledge representation? Explain in detail.
Detail the algorithm for deciding entailment in proposition logic.
Differentiate 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.
Explain Unification algorithm with suitable example.
What is knowledge engineering? Explain ontology of situation calculus.
Explain 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.
Explain time, schedules and resources in temporal domain with an example.
Discuss AI and its ethical concerns. Explain Limitations ofAI.
Analyze 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'] |
Explain Min Max and Alpha Beta pruning algorithm for adversarial search with example
Define and explain Constraints satisfaction problem.
Explain with example graph coloring problem.
How AI technique is used to solve tic-tac-toe problem.
Explain Wumpus world environment giving its PEAS description.
Explain different inference rules in FOL with suitable example.
Write an propositional logic for the statement, i) “All birds fly” ii) “Every man respect his parents”
Differentiate between propositional logic and First order logic.
Explain Forward chaining algorithm with the help of example.
Write and explain the steps of knowledge engineering process.
Explain Backward chaining algorithm vith the help of example.
Write a short note on i) Resolution and ii) Unification
Write a short note on planning agent, state goal and action representation.
Explain different components of planning system.
Explain the components of AI
What 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'] |
Define 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
List 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.
Explain 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
Explain 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
Explain 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).
Explain 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.
Explain : i) Classical planning ii) Hierarchal planning
Explain with example, how planning is different from problem solving.
Explain AI components and AI architecture.
Explain 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'] |
Define Artificial Intelligence, Intelligent Agent and its use.
List advantages of Artificial Intelligence.
Describe Learning Agent Architecture with diagram.
Write a note on ‘Evaluation of search strategy’.
Explain different search strategies.
What is Heuristic function?
Describe Hill climbing search with suitable example. List disadvantage of hill climbing process.
Differentiate between Blind search and Heuristic search.
List 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 August Insem |
| Watermark | ['CEGP013091', '49.248.216.237 26/08/2025 10:32:52 static-237'] |
What 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.
Differentiate 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
Explain the concept of Rationality
i) Explain problem solving agents with suitable example. ii) Explain learning agents with its components.
Differentiate 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 | TE-Insem-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'] |
Explain different forms of Agent. With example.
Explain the significance of PEAS in AI.
Explain any four type of task environment with example.
Explain “Simple Reflex based Agent” with the help of schematic diagram or pseudo code.
Explain 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?
Explain 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'] |
Define 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.
What 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
Define 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.
Explain 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'] |
Select a question to generate an answer