Explain Alpha - Beta Tree search and cutoff procedure in deatil with example.
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 9 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
Explain Alpha - Beta Tree search and cutoff procedure in deatil with example.
What are the issues that need to be addressed for solving esp efficiently? Explain the solutions to them.
Explain in detail the concepts of back tracking and constraint propagation and solve the N-queen problem using these algorithms.
Write a short note on Monte Carlo Tree search and list its limitations.
Apply constraint satisfaction method to solve following Problem SEND + MORE = MONEY. (TWO + TWO = FOUR, CROSS+ ROADS= DANGER)
List the inference rules used in prepositional logic? Explain them in detail with suitable example.
Explain syntax and semantics of First Order Logic in detail.
Detail the algorithm for deciding entailment in prepositional logic.
Explain knowledge representation structure and compare them.
Explain Forward and Backward chaining. What factors justify whether reasoning is tobe done in forward or backward chaining.
What are the reasoning patterns in propositional logic? Explain them in detail.
Explain unification algorithm with an example.
Explain knowledge representation structures and compare them.
What do you mean by Ontology of situation calculus?
Analyse various planning approaches in detail.
Discuss AI and its ethical concerns. Explain limitations of AI.
Explain the terms for time and schedule from perspective of temporal planning.
Write a detailed note on AI Architecture.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [5870] - 1135 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2022 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 06/07/2022 08:32:44 static-238'] |
List All problem solving strategies. What is backtracking, explain with n queen problem, with Branch and bound or Backtracking.
Explain Monte Carlo Tree Search with all steps and Demonstrate with one Example.
i) Explain limitations of game search algorithm, Differentiate between stochastic and partial games AND. ii) Explain How use ofaipha and beta cut-offs will improve performance of mini max algorithm?
Define is Constraint satisfaction problem, State the types ofconsistencies Solve the following Crypt Arithmetic Problem. SEND +MORE MONEY
What is an Agent. Name any 5 agents around you Explain Knowledge based agent with Wumpus World. List and explain in short the various steps of knowledge engineering process.
Consider the following axioms: If a triangle is isosceles, then its two sides AB and AC are equal, If AB and AC are equal, then angle B and C are equal ABC is an equilateral triangle, Represent these facts in predicate’logic. Explain Inference in Propositional Logic.
Write the following sentences in FOL (any 2) (using types of quantifiers). i) Every number is either negative or has a square root . ii) Every connected and circuit-free graph is a tree . iii) Some people are either religious or pious iv) There is a barber who shaves all men in the town who do not shave themselves.
What is Resolution? Solve the following statement by using resolution algorithm. Draw suitable resolution graph. i) Rajesh like all kind of food. ii) Apple and vegetables are food. iii) Anything anyone eats and is not killed is food. iv) Ajay eats peanuts and still alive. Prove that Rajesh like bananas.
Explain Forward Chaining and Backward Chaining. With its Properties, with one. example.
Explain Unification Algorithm in FOL. Solve stepwise with proper comments if p(x,g(x)) is equal to or not equal to f (prime, f(prime))
Explain FOL inference for following Quantifiers. i) Universal Generalization. ii) Universal Instantiation. iii) Existential Instantiation. iv) Existential introduction
What is Ontological Engineering ,in details with its categories object and Model.
Explain with an example State Space 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
Explain Limits of AI and Future opportunities with AI.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6003]-356 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2023 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 26/06/2023 10:32:46 static-238'] |
List all problem solving strategies. What is backtracking, explain with n queen problem.
Write Minimax Search Algorithm for two players. How use of alpha and beta cut-offs will improve performance?
Define Game theory, Differentiate between stochastic and partial games with examples.
Define is Constraint satisfaction problem, state the types of consistencies solve the following Crypt Arithmetic Problem. B A S E + B A L L = G A M E S
What is an Agent? Name any 5 agents around you explain knowledge based agent with Wumpus World. List and explain in short the various steps of knowledge engineering process
Consider the following axioms: If a triangle is equilateral then it is isosceles. If a triangle is isosceles, then its two sides AB and AC are equal. If AB and AC are equal, then angle B and C are equal. ABC is an equilateral triangle. Represent these facts in predicate logic.
Write the following sentences in FOL(using types of quantifiers) i) All birds fly ii) Some boys play cricket iii) A first cousin is a child of a parent’s sibling iv) You can fool all the people some of the time, and some of the people all the time, but you cannot fool all the people all the time.
What is Knowledge Representation using propositional logic? Compare propositional and predicate Logic.
Explain Forward Chaining and Backward Chaining. With its properties, advantages and disadvantages.
Explain: i) Unification in FOL ii) Reasoning with Default information
Explain FOL inference for following Quantifiers. i) Universal Generalization ii) Universal Instantiation iii) Existential Instantiation iv) Existential introduction
What is Ontological Engineering, in details with its categories object and Model.
Explain with an example Goal Stack Planning (STRIPS algorithm).
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 opprotunities with AI.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6262]-45 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2024 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 21/05/2024 09:44:03 static-238'] |
Explain Alpha-Beta tree search and cut off procedure with example.
Explain in details the concept of backtracking and constraint propagation to solve n-queens problem.
What is constraint satisfaction problem? Explain with example.
Compare and contrast the stochastics games and partial observable games.
How AI technique is used to solve tic-tac-toe problem.
Explain Wumpus world environment with PEAS description.
What is knowledge representation in propositional logic? Compare and contrast PL and FOL.
Explain different inference rules in FOL with suitable example.
What is an agent? Explain knowledge based agent with architecture diagram, also state the significance of inference engine.
Illustrate with an example the use of the unification algorithm to prove the concept of resolution.
Define and explain the forward changing with example, analyze the differences between forward and backward changing.
Describe Ontological Engineering w. r t. Categories, Objects and Model.
Define First order Logic, Explain FOL inference for following classifiers. i) Universal Generalization ii) Universal Instantiation iii) Extential Instantiation iv) Extential Introduction
Explain the algorithm for classical planning with an example.
Analyze various planning approaches in AI.
Explain the Hierarchical planning with relevant example.
Explain with example how planning is different than problem solving.
Explain types of planning in details.
Explain AI components and AI Architecture.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | VI |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6403]-45 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.237 30/05/2025 09:33:33 static-237'] |
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 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 | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [5926]-67 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2022 Nov Dec Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 17/01/2023 09:36:20 static-238'] |
List All problem solving strategies. What is backtracking, explain with n queen problem.
Write Minimax Search Algorithm for two players. How use of alpha and beta cut-offs will improve performance?
Define Game theory, Differentiate between stochastic and partial games with examples.
Define is Constraint satisfaction problem, State the types of consistencies Solve the followiig Crypt Arithmetic Problem. B A S E + B A L L G A M E S
What is an Agent. Name any 5 agents around you Explain Knowledge based agent with Wumpus World. List and explain in short the various steps of knowledge engineering process
Consider the following axioms:If a triangle is equilateral then it is isosceles. If a triangle is isosceles, then its two sides AB and AC are equal. If AB and AC are equal, then angle B and C are equal.ABC is an equilateral triangle. Represent these facts in predicate logic.
Write the following sentences in FOL(using types of quantifiers) i) All birds fly ii) Some boys play cricket iii) A first cousin is a child of a parent’s sibling iv) You can fool all the people some of the time and some of the people all the time, but you cannot fool all the people all the time
What is Knowledge Representation using propositional Logic? Compare propositional and predicate Logic.
Explain Forward Chaining and Backward Chaining. With its Properties, advantages and Disadvantages.
Explain : i) Unification in FOL ii) Reasoning with Default information
Explain FOL inference for following Quantifiers • Universal Generalization • Universal Instantiation • Existential Instantiation • Existential introduction
What is Ontological Engineering, in details with its categories object and Model.
Explain with an example Goal Stack Planning (STRIPS algorithm).
Explain with example, how planning is diffeent 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 | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6180]-55 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2023 Nov Dec Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 14/12/2023 09:45:00 static-238'] |
Define Game Theory. What are the components, defining game as a Search Problem? Draw a Game Tree for tic-tac-toe.
What do you understand by Constraint Propagation? Write short notes on Node Consistency and Arc Consistency.
Explain how Minimax and alpha-beta algorithms change for two-players, non zero-sum games in which each player has his or her own utility function.
Define Constraint Satisfaction Problem. Explain Map Coloring Example Problem. Formulate the Map Coloring Problem as CSP.
Define Knowledge base and Sentence. Describe in detail about Wumpus World Environment along with brief description to find out the agent. Explain Task Environment.
Represent the followings into First Order Logic form: i) All employees earning Rs.45000 or more pay tax. ii) Sita is a marine engineer and she is also an artist. iii) Children love icecream. iv) If Humidity is high,temperature is high then a person cannot feel comfortable. v) Puppies are cute. If AB and AC are equal, then angle B and C are equal. ABC is an equilateral triangle. Represent these facts in predicate logic.
Write Short notes on followings: i) Syntax and Semantics ii) Proposition Logic Vs First Order Logic iii) Knowledge Engineering Process in First Order Logic
Show the following Sentences are valid or not. a) (P ∧ Q) → (P ∨ Q) b) (¬A ∨ B) ∧ (¬B ∨ C) → (¬A ∨ ¬C)
Prove that Universal Instantiation is sound and that Existential Instantiation produces an inferentially equivalent knowledge base.
Write Short notes on : i) Forward Chaning ii) Categories and Objects iii) Back ward Chaining
What do you understand by Resolution? Describe the Procedure to convert into CNF? Find the clause of the expression: (P ∧ Q) → R
What are the reasoning systems for Catgories? Explain Semantic Network and Description Logic .
Describe the differences and similarities between problem solving and planning.
Explain AI components and AI architecture
What are the different types of planning? How planning algorithm can be represented as state space search?
Explain What are Planning approaches?
Explain The Blocks World in detail.
What are the limitations of AI? Explain What are the Future Scopes with AI?
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 70 |
| Total Questions | 5 |
| Duration | 2½ Hours |
| Paper Number | 6353-45 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2024 Nov Dec Endsem |
| Watermark | ['CEGP013091', '49.248.216.237 30/11/2024 09:38:20 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 | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6009]-324 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | INSEM |
| Exam Session | 2023 Feb Insem |
| Watermark | ['CEGP013091', '49.248.216.238 06/04/2023 12:03:34 static-238'] |
Analyse the properties of agent task environment.
What is an agent and its environment in AI? List the different types of environments with examples.
Describe Real life applications of AI.
List and explain the potential risks and benefits of AI.
Define rationality and rational agent. Explain with example.
Write a note on the History of AI. Explain different applications of AI.
Explain A* algorithm in detail with a suitable example.
Explain in detail about problem solving agent with an example.
Describe the local search and optimization problem.
Elaborate Hill Climbing Search with suitable examples. List the disadvantages of Hill Climbing Search.
How is a Huristics search different from a Blind search? Explain.
Compare and Contrast Depth First and Best First Search methods.
| Subject Name | Artificial Intelligence |
|---|---|
| Semester | II |
| Pattern Year | 2019 |
| Subject Code | 310253 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | 6269-319 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | INSEM |
| Exam Session | 2024 March Insem |
| Watermark | ['CEGP013091', '49.248.216.238 22/03/2024 10:35:43 static-238'] |
Select a question to generate an answer