Scribd
Upload
170 views9 pages

Which Search Strategy Is Also Called As Blind Search? A. Uninformed Search B. Exhaustive Search C. Simple Reflex Search D. Heuristic Search

The document contains 30 multiple choice questions in Section A testing knowledge of search strategies and artificial intelligence concepts. Section B contains 5 additional multiple choice questions worth 2 marks each. Section C offers a choice between two long answer questions, with the first asking to differentiate simple and steepest hill climbing, list search strategy evaluation criteria, and the second describing the IDA* search algorithm and issues with heuristic overestimation.

Uploaded by

Anush Bhatia
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
170 views9 pages

Which Search Strategy Is Also Called As Blind Search? A. Uninformed Search B. Exhaustive Search C. Simple Reflex Search D. Heuristic Search

The document contains 30 multiple choice questions in Section A testing knowledge of search strategies and artificial intelligence concepts. Section B contains 5 additional multiple choice questions worth 2 marks each. Section C offers a choice between two long answer questions, with the first asking to differentiate simple and steepest hill climbing, list search strategy evaluation criteria, and the second describing the IDA* search algorithm and issues with heuristic overestimation.

Uploaded by

Anush Bhatia
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
You are on page 1/ 9

Section A ( 30 MCQs and each question carries 1 Marks)

1. Which search strategy is also called as blind search?


a. Uninformed search
b. Exhaustive search
c. Simple reflex search
d. Heuristic search

2. The search strategy will select the best expansion node at first for evaluation?
a. Greedy best-first search
b. Breadth-first search
c. Depth-first search
d. None of the mentioned

3. Which search method will expand the node based on minimal heuristic cost?
a. Depth first search
b. Bidirectional search
c. A*search
d. None of the mentioned

4. Which search technique imposes the working of BFS and DFS in a hybrid fashion?
a. Depth-limited search
b. Uniform Cost search
c. Iterative deepening search
d. Bidirectional search

5. Depth limited search technique in terms of evaluation based on optimality and completeness is
a. Both Complete and Optimal
b. Complete but not optimal
c. Optimal but not Complete
d. Not Optimal and not Complete

6. Which is the best way to go for Game playing problem?


a. Linear approach
b. Heuristic approach
c. Random approach
d. Stratified approach.

7. Identify the strategies which know one non goal states are better or promising than other
non goal state
a. Forward search
b. Backward search search
c. Systematic search
d. Heuristic search

8. Which Data structure is implemented for Uniform Cost Search?


a. Stack
b. Queue
c. Priority Queue
d. Tree

9. Which search algorithm will use limited amount of memory?


a. RBFS
b. SMA*
c. Hill-climbing search algorithm
d. Both a & b

10. A space where neighbourhood states have the same value as the parent state and causes a
problem in the hill climbing is,
a. Global maxima
b. Local maxima
c. Plateau
d. Ridges
11. What helps Simulated Annealing get out of local minima?
a. The acceptance threshold is established probabilistically.
b. The exponential form of the Metropolis condition, i.e., that p is less than exp (-
DE/kT) where DE is the change in energy, T the temperature, and k is a constant.
c. Annealing follows a declining temperature schedule.
d. Positive energy changes are not discarded automatically.

12. A knowledge-based agent needs a _____________

a. Knowledge base
b. Inference mechanism
c. Both (a) and (b)
d. Neither (a) and (b)
13. What is meant by simulated annealing in artificial intelligence?
a. Returns an optimal solution when there is a proper cooling schedule
b. Returns an optimal solution when there is no proper cooling schedule
c. It will not return an optimal solution when there is a proper cooling schedule
d. None of the mentioned

14. The search methods that work on one state, with an aim to improve it step-wise belong to
the category of
a. Best first search
b. Depth first search
c. AO*
d. Local search methods

15. If heuristic is admissible, then A* guarantees that it will be


a. Complete
b. Optimal
c. Both (a) and (b)
d. Time efficient

16. Properties of quantifiers ______


a. x y is same as y x
b. x y is the same as y x
c. x y is not same as y x
d. x y is not same as y x
17. Deriving sentences from other sentences is referred as _________
a. Inference
b. Completeness
c. Syntax
d. Semantics

18. _____________ is a collection of facts expressed in predicate calculus.


a. Fact base
b. Clause form
c. Logic
d. Unification

19. Given expression sinks(X)  dissolves(X, water)  ¬denser(X, water) is referred as


a. Fact base
b. Clause form
c. Both (a) and (b)
d. Neither (a) and (b)

20. Semantic networks can show inheritance based on,


a. have-a, to relationship
b. is-a, has-a relationship
c. belongs-to relationship
d. Both (a) and (b)

21. Find out the contradiction preposition

a. P ∨ ~P
b. P ∧ ~P
c. P ⇒ P
d. P ⇔ P

22. Choose the ISA relationship in the following


a. Tendulkar - Batsman
b. Stumps - Bails
c. Warne - Wickets
d. Batsman – Cricketer
23. Clause with at most one positive literal is known as
a. CNF
b. DNF
c. Horn Clause
d. Both CNF and DNF
24. Inference algorithm is complete only if _____________
a) It can derive any sentence
b) It can derive any sentence that is an entailed version
c) It is truth preserving
d) It can derive any sentence that is an entailed version & It is truth preserving
25. Which is also called single inference rule?
a. Reference
b. Resolution
c. Reform
d. None of the mentioned
26. A _________ is used to demonstrate, on a purely syntactic basis, that one formula is
a logical consequence of another formula.
a. Deductive Systems
b. Inductive Systems
c. Reasoning with Knowledge Based Systems
d. Search Based Systems
27. What are the undesirable properties of knowledge?
a. Voluminous
b. Difficult to characterize
c. Variability
d. All of the above
28. Judgemental or commonsense part of problem solving is referred by the term,
a. Heuristic
b. Critical
c. Value based
d. Analytical
29. Choose the equivalent preposition for the preposition (~a V ~b)

a. (a ∧ b)
b. ~(a ∧ b)
c. (a ∨ b)
d. ~(a ∨ b)
30. Identify the following which would fail when Unification algorithm is applied,
a. Unify(Friends(Ram, x),Friends(Rita,Lakshman)
b. Unify(Friends(Ram, x),Friends(x, Kannan))
c. Unify(Friends(Ram, x), Friends(y, Ravi))
d. Unify(Friends(Ram, x), Friends(z, Murugan))

Section B (Each question carries two marks)


31. Identify the condition, at which breadth first algorithm is optimal.
a. Less number of nodes present
b. All the step costs are equal
c. Each step costs are not same
d. Step cost increases or decreases linearly

32. Which Data structure is implemented effectively for BFS and DFS?
i. FIFO Queue for BFS
ii. LIFO Stack for DFS
iii. FIFO Queue for DFS
iv. LIFO Stack for BFS
a. i & ii
b. i & iv
c. ii & iii
d. All the above

33. Which of the following predicate calculus statements is / are valid:

a) (∀ x) P (x) V (∀x) Q (x)  (∀x) {P (x) V Q (x)}


b) (Ǝ x) P (x) Ʌ (Ǝ x) Q(x)  (Ǝ x) {P(x) Ʌ Q(x)}
c) ( x) {P (x) V Q(x)}  ( x) P (x) V ( x) Q (x)
d) (Ǝ x) {P (x) V Q(x)}  ~ ( x) P (x) V (Ǝ x) Q (x)

34. Which one of the following is the most appropriate logical formula to represent the statement?
“ Gold and silver ornaments are precious”.

G(x): x is a gold ornament


S(x): x is a silver ornament
P(x): x is precious
a) x (P(x)  (G(x) Ʌ S(x) ) )
b) x ((G(x) Ʌ S(x)) P(x) )
c) Ǝ x ((G(x) Ʌ S(x)) P(x) )
d) ∀x ((G(x) V s(x))  P(x))

35. If F1, F2 and F3 are propositional formulae such that F1 Ʌ F2  F3 and F1 Ʌ F1 ~ F2 are both
Tautologies, then which of the following is true:

a) Both F1 and F2 are tautologies


b) The conjunction F1 Ʌ F2 is not satisfiable
c) The conjunction F1 Ʌ F2 is not satisfiable
d) Neither is satisfiable

Section C

36. A. (i) Differentiate simple hill Climbing and Steepest Hill climbing. (3 Marks)

Simple hill climbing:


(i) Does not aggressively select the next best node
(ii) Do not exhaustively search for the next best node
(iii) Also called heuristic based search method
Steepest Hill climbing:
(i) Aggressive in selecting next best successor node
(ii) Generates maximum successor nodes with all possible moves and selects the very
best node
(iii) Has higher complexity than simple hill climbing
(ii) List the criteria to measure the performance of search strategies. (2 Marks)

Completeness
Optimality
Time complexity
Space complexity
(Atleast a single line about each criteria)

(or)
36. B. (i) Write the stepwise approach taken in IDA* algorithm. (3 Marks)
Step 1: At firswt, set the limit =h(root). We can call this as f-limit
Step 2: The next step is pruning if any node does not satisfy the limit condition,
(i.e.) prune if f(node) > f-limit
Step 3: Set f-limit to be equal to the minimum cost of any node that is pruned

(ii) Brief the problem with overestimating of h(n) in A* algorithm (2 Marks)


In any graph where the edge cost or path cost is overestimated, the quality of the
estimated cost will lead to selection of paths which at the end be a costlier path when some
ideal path exist. (Any example, diagrams)
37. A. Convert the following rule into Conjunctive Normal Form (CNF) (5 Marks)
B[1,1]  P[1,2] V P[2,1]
Write the stepwise conversion into CNF form.

B[1,1] <-> P[1,2] V P[2,1]


Steps:
1. Eliminate <-> with -> ^ ->
(B[1,1] -> (P[1,2] V P[2,1])) ^ ((P[1,2] V P[2,1]) -> B[1,1])
2. Eliminate ->
A -> B can be written as ~A V B
(~B[1,1] V P[1,2] V P[2,1]) ^ (~(P[1,2] V P[2,1]) V B[1,1])
3. CNF requires negation only for literals
Demorgan's law ~(A V B) = ~A ^ ~B
(~B[1,1] V P[1,2] V P[2,1]) ^ (~P[1,2] ^ ~P[2,1]) V B[1,1]
4. According to CNF, it is the conjunction of disjunction of literals
According to distributive law, (A ^ C) V B = (AV B) ^ (C V B)
(~B[1,1] V P[1,2] V P[2,1]) ^ (~P[1,2] V B[1,1]) ^ (~P[2,1] V B[1,1])

(or)

37. B. (i) Explain Proof by Refutation with a simple example. (3 Marks)


Any propositional logic statement using symbols.
Check the logic, (A is a symbol for a propositional logic)
if A is valid, then ~A is unsatisfiable and it should be proved that A is satisfiable if ~A is not
valid
(ii) Distinguish Declarative and Procedural knowledge. (2 Marks)
Declarative: Knowledge is specified but the extent upto which the knowledge is required is
not specified. It should be augmented with the program that specifies what is to be done and
how it is to be done.

Procedural: The control information required to make use of the knowledge is embedded in
the knowledge. An interpreter is required that understands the instructions in the knowledge.
It has heuristic too to have the result generated.

You might also like