Artificial Intelligence (AI) SPPU Endsem Question Paper May 2023
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 2023
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- II
- Paper code
- [6003]-356
Printed for: T.E. (Computer Engineering)
Instructions to the candidates
- Attempt 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 whenver necessary.
- Assume suitable data if necessary.
Questions
Q1
ORQ2
- a)[9]
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?
- b)[8]
Define is Constraint satisfaction problem, State the types ofconsistencies Solve the following Crypt Arithmetic Problem. SEND +MORE MONEY
- a)
Q3
- a)[9]
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.
- b)[9]
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. 2
OR- a)
Q4
- a)[9]
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.
- b)[9]
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. .
- a)
Q5
- a)[9]
Explain Forward Chaining and Backward Chaining. With its Properties, with one. example.
- b)[8]
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))
OR- a)
Q6
- a)[8]
Explain FOL inference for following Quantifiers. i) Universal Generalization. ii) Universal Instantiation. iii) Existential Instantiation. iv) Existential introduction
- b)[9]
What is Ontological Engineering ,in details with its categories object and Model.
- a)
Q7
ORQ8
- a)[5]
- b)[8]
Explain. i) Importance of planning ii) Algorithm for classical planning
- c)[5]
This part has equations that don’t show as text. Open the PDF to read it.