Scribd
Upload
102 views1 page

Mid-Term 2ndqpaper

This document is an examination paper for the B.Tech programs under USICT for the 6th semester, focusing on Artificial Intelligence and Machine Learning. It includes a set of questions covering topics such as state space search, logic, search algorithms, and inference rules, with a total of 30 marks available. Students are required to attempt question 1 and any two additional questions from the remaining options.

Uploaded by

Anmol Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
102 views1 page

Mid-Term 2ndqpaper

This document is an examination paper for the B.Tech programs under USICT for the 6th semester, focusing on Artificial Intelligence and Machine Learning. It includes a set of questions covering topics such as state space search, logic, search algorithms, and inference rules, with a total of 30 marks available. Students are required to attempt question 1 and any two additional questions from the remaining options.

Uploaded by

Anmol Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

(Please write your Enrolment No. immediately) Enrolment No.

__________

MID TERM EXAMINATION


B.TECH PROGRAMMES (UNDER THE AEGIS OF USICT)
6th Semester, April, 2024

Paper Code: AI-316T Subject: Artificial Intelligence and Machine Learning

Time: 1½ Hrs. Max. Marks: 30

Note: Attempt Q. No. 1 which is compulsory and any two more questions from remaining.

Q. No. Question Max.


Marks
1 a) What is state space search? (2)
b) State the difference between Propositional Logic and Predicate Logic. (2)
c) A Problem-solving search can proceed forward or backward. What factors (2)
determine the choice of direction for a particular problem?
d) Explain Turing Test for AI. (2)
e) State clearly the characteristics of a good heuristic function. (2)
2 a) What is Uninformed and Informed Search? Explain Breadth First & Depth First (3)
search with its algorithm
b) Given an initial state of a 8-puzzle problem and final state to be reached-

(7)
Find the most cost-effective path to reach the final state from initial state using A*
Algorithm.
Consider g(n) = Depth of node and h(n) = Number of misplaced tiles.
3 a) What are literals? Discuss the steps to convert a statement to clausal form. (5)

b) Discuss the characteristic quantifiers in First order Logic.


Convert the following into First Order Logic:
(i) Mary loves everyone (5)
(ii) Everyone loves himself
(iii) Every student smiles
(iv) Every student except George smiles.
(v) Every student who walks talks.
4 a) Explain the inference rule in propositional logic. Explain the rules to unify (4)
two predicates.
b) Explain constraint satisfaction problem. Solve the crypt arithmetic puzzle:
EAT
+T H A T (6)
-----------
APPLE

You might also like