Computer Science and Engineering (CSE) / Information Technology(IT)
CS/B.TECH/CSE(New)/SEM-7/CS-703C/2013-14
2013
ARITIFICIAL INTELLIGENCE
Time Allotted : 3 Hours Full Marks : 70
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
as far as practicable.
GROUP – A
(Multiple Choice Type Question)
1. Choose the correct alternatives for the following: 10 x 1 = 10
i) Algorithm that gives optimal solution is
a) Hill climbing b) BFS
c) Blind Search d) A*
ii) Skolem function is used in
a) unification algorithm
b) natural deduction
c) conversion of clausal form
d) none of these.
iii) The most appropriate representation for “Alive means not dead” is
a) ∀x: ∃y:[alive(x, y)→¬dead(x,y)]
b) ∀x: ∀y:[alive(x, y)→¬dead(x,y)]
c) ∀x: ∀y:[alive(x, y)→¬dead(x,y)]∧[¬dead(x, y)→alive(x,y)]
d) ∃x: ∀y:[alive(x, y)→¬dead(x,y)]∧[¬dead(x, y)→alive(x,y)]