Artificial Intelligence (AI) SPPU Endsem Question Paper May 2025
All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.
- Subject code
- 310253
- Pattern
- 2019 pattern
- Exam
- Endsem
- Session
- May 2025
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- VI
- Paper code
- [6403]-45
Printed for: T.E. (Computer Engineering)
Instructions to the candidates
- Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
- Neat diagrams must be drawn wherever necessary.
- Figures to the right side indicate full marks.
- Assume Suitable data if necessary.
Questions
Q1
- a)[9]
Explain Alpha-Beta tree search and cut off procedure with example.
Also asked:Oct 2025
- b)[8]
Explain in details the concept of backtracking and constraint propagation to solve n-queens problem.
OR- a)
Q2
- a)[5]
What is constraint satisfaction problem? Explain with example.
- b)[4]
Compare and contrast the stochastics games and partial observable games.
- c)[8]
How AI technique is used to solve tic-tac-toe problem.
- a)
Q3
- a)[9]
Explain Wumpus world environment with PEAS description.
- b)[8]
What is knowledge representation in propositional logic? Compare and contrast PL and FOL.
OR- a)
Q4
- a)[9]
Explain different inference rules in FOL with suitable example.
- b)[8]
What is an agent? Explain knowledge based agent with architecture diagram, also state the significance of inference engine.
- a)
Q5
- a)[9]
Illustrate with an example the use of the unification algorithm to prove the concept of resolution.
- b)[9]
Define and explain the forward changing with example, analyze the differences between forward and backward changing. 2
OR- a)
Q6
- a)[9]
Describe Ontological Engineering w. r t. Categories, Objects and Model.
- b)[9]
Define First order Logic, Explain FOL inference for following classifiers. i) Universal Generalization ii) Universal Instantiation iii) Extential Instantiation iv) Extential Introduction
- a)
Q7
ORQ8