<br>

AI
Unit-3 (85 questions)

1. Which approach is based on computing the distance between each pair of

distinct points and finding a pair with the smallest distance?
(a) Brute force
(b) Exhaustive search
(c) Divide and conquer
(d) Branch and bound

2. What is the other name of informed search strategy?

(a) Simple search
(b) Heuristic search
(c) Onlinesearch
(d) None of the mentioned

3. How many types of informed search method are in artificial intelligence?

(a) 1

(b) 2
(c) 3
(d) 4

4. Which search uses the problem-specific knowledge beyond the definition of the
problem?
(a) Informed search
(b) Depth-first search
(c) Breadth-first search
(d) Uninformed search

5. What is the runtime efficiency of using brute force technique forthe closest pair
problem?
(a) O(N)
(b) O(N log N)
(c) O(N)
(d) o(N° log N)
<br>

6. Which function will select the lowest expansion node at first for evaluation?
(a) Greedy best-first search
(b) Best-first search
(c) Depth-first search
(d) None of the mentioned

7. What is the heuristic function of greedy best-first search?

(a) (f(n)! = h(n)
(b) f(n) < h(n)
(c) f(n) = h(n)
(d) f(n) > h(n)

8. Which search uses only the linear space for searching?

(a) Best-first search
(b) Recursive best-first search
(c) Depth-firstsearch
(d) None of the mentioned

9. Which search is complete and optimal when h(n) is consistent?

(a) Best-first search
(b) Depth-first search
(c) Both Best-first & Depth-first search
(d) search*
A

10. Which is used to improve the performance of heuristic search?

(a)Quality of nodes
(b) Quality of heuristic function
(c) Simple form of nodes
(d) None of the mentioned

11. Which search method will expand the node that is closest to the goal?
(a) Best-first search
(b) Greedy best-first search
(c) A* search
(d) None of the mentioned
<br>

12. Which search strategy is also called blind search?

(a) Uninformed search
(b) Informed search
(c) Simple reflex search
(d) Allof the mentioned

13. How many types are available in uninformed search method?

(a) 3
(b) 4
(c) 5
(d) 6

14. Which search is implemented with an empty first-in-first-out queue?

(a) Depth-first search
(b) Breadth-first search
(c) Bidirectional search
(d) None of the mentioned

15. When is breadth-first search optimal?

(a) When there is less number of nodes
(b)When all step costs are equal
(c) When all step costs are unegqual
(d) None of the mentioned

16. How many successors are generated in backtracking search?

(a) 1

(b) 2
(c) 3
(d) 4

Correct Answer: (a) 1

17. What is the space complexity of Depth-first search?

(a) O(b)
(b) O(bl)
(c) O(m)
(d) o(bm)
<br>

18. How many parts does a

problem consists of?
(a) 1

(b) 2
(c) 3
(d) 4

19. How many parts does a problem consist of?

(a) 1

(b) 2
(c) 3
(d) 4

20. Which algorithm is used to solve any kind of problem?

(a) Breadth-first algorithm
(b) Tree algorithm
(c) Bidirectional search algorithm
(d) None of the mentioned

21. Which search algorithm imposes a fixed depth limit on nodes?

(a) Depth-limited search
(b) Depth-first search
(c) Iterative deepening search
(d) Bidirectional search

22. Which search implements stack operation for searching the states?
(a) Depth-limited search
(b) Depth-first search
(c) Breadth-first search
(d) None of the mentioned

23. What is the first step towards searching a solution to the problem in an Al
systemn?
(a) Searching for relevant data in the surroundings
(b) Searching into its own knowledge base for solutions
(c) Seeking for human inputs for approaching towards the solution
(d) None of the above
<br>

24. Which of the following mentioned searches are heuristic searches?

(a) Only iv.
(c) ii. and iv.
(b) All i., ii.,
ii. and iv.
(d) None of the above

25. Which property of heuristic search differentiates it from other searches?

(a) It provides solution in a reasonable time frame
(b) lt provides reasonably accurate direction to a goal
(c) It considers both actual and approximate costs
(d) All of the above

26. Which search algorithm is described: "First one side completely traverse, then
the other side"?
(a) The Breadth First Search (BFS)
(b) The Depth First Search (DFS)
(c) The A* search
(d) None of the above

27. In Alsearch algorithms, optimized solutions in terms of time and cost are
required. True or False?
(a) True
(b) False

28. A production rule consists of:

(a) A set of Rule
(b) sequence of steps
A

(c) Both (a) and (b)

(d) Arbitrary representation to problem

29. Which search method takes less memory?

(a) Depth-First Search
(b) Breadth-First Search
(c) Both (a) and (b)
(d) Linear Search
<br>

30. A heuristic is a way of trying:

(a) To discover something embedded in a program
(b) To search and measure node's distance to goal
(c) To compare two nodes
(d) Only (a), (b) and (c)

31. A algorithm is based on:*

(a) Breadth-First-Search
(b) Depth-First-Search
(c) Best-First-Search
(d) Hill climbing

32. Breadth-first search is not optimal when all step costs are equal?
(a) TRUE
(b) FALSE

33. DFS is efficient in BFS is efficient in

(a) Space, Time
(b) Time, Space
(c) Time, Time
(d) Space, Space

34. Bidirectional search reduces time complexity by searching from both sides.
(a) TRUE
(b) FALSE

35. Which search uses the problem specific knowledge beyond the definition of the
problem?
(a) Informed search
(b) Depth-first search
(c) Breadth-first search
(d) Uninformed search
<br>

36. Which function selects the lowest expansion node first?

(a) Greedy best-first search
(b) Best-first search
(c) Depth-first search
(d) None of the mentioned

37. Which search is complete and optimal when h(n) is consistent?

(a) Best-first search
(b) Depth-first search
(c) Both Best-first & Depth-first search
(d) A search*

38. Which search method will expand the node closest to the goal?
(a) Best-first search
(b) Greedy best-first search
(c) A*search
(d) None of the mentioned

39. A heuristic is a way of trying:

(a) Discover something
(b) Search and measure distance
(c) Compare two nodes
(d) Allof the mentioned

40. A algorithm is based on:*

(a) Breadth-First-Search
(b) Depth-First-Search
(c) Best-First-Search
(d) Hill climbing

41. Best-First search is a type of informed search, which uses expansion to choose
the best next node for:
(a) Evaluation function returning lowest evaluation
(b) Evaluation function returning highest evaluation
(c) Evaluation function returning lowest & highest evaluation
(d) None of them is applicable
<br>

42. Best-First search can be implemented using which data structure?

(a) Queue
(b)Stack
(c) Priority Queue
(d) Circular Queue

43. Heuristic function h(n) is:

(a) Lowest path cost
(b) Cheapest path from root to goal node
(c) Estimated cost of cheapest path from root to goal node
(d) Average path cost

44. What is the evaluation function in greedy approach?

(a) Heuristic function
(b) Path cost from start node to current node
(c) Path cost from start node to current node + Heuristic cost
(d) Average of Path cost and Heuristic cost

45. What is the evaluation function in A approach?*

(a) Heuristic function
(b) Path cost from start node to current node
(c) Path cost + Heuristic cost
(d) Average of Path cost and Heuristic cost

46. ls an algorithm a loopthat continually mnoves in the direction of increasing

value that is uphill?
(a) Up-Hill Search
(b)Hill-Climbing
(c) Hill algorithm
(d) Reverse-Down-Hill search

47. When will Hill-Climbing algorithm terminate?

(a) Stopping criterion met
(b) Global Min/Max achieved
(c) No neighbor has higher value
(d) All of the mentioned
<br>

48. What are the main cons of hill-climbing search?

(a) Terminates at local optimum & Does not find optimum solution
(b) Terminates at global optimum
(c)Does not find optimum solution & Fail to find a solution
(d) Fail to find a solution

49. Stochastic hill climbing chooses randomly among uphill moves; the probability
varies with steepness.
(a) TRUE
(b) FALSE

50. Hill climbing is sometimes called because it grabs a good neighbor without
looking ahead.
(a) Needy local search
(b) Heuristic local search
(c) Greedy local search
(d) Optimal local search

51. Hill-Climbing approach can get stuck because of:

(a) Local maxima
(b) Ridges
(c) Plateaux
(d) All of the mentioned

52. are mathematical problems defined as objects that must satisfy

constraints.
(a) Constraint Satisfaction Problems
(b)Uninformed Search Problems
(c) Local Search Problems
(d) All of the mentioned

53. Which problems can be modeled as Constraint Satisfaction Problem?

(a) 8-Puzzle problem
(b) 8-Queen problem
<br>

(c) Map coloring problem

(d) All of the mentioned

54. What constitutes the incremental formulation of CSP?

(a) Path cost
(b) Goal cost
(c) Successor function
(d) All of the mentioned

55. The term used for DFS choosing values one variable at a time, returning when
no legal values are left is:
(a) Forward search
(b) Backtrack search
(c) Hill algorithm
(d) Reverse-Down-Hill search

56. To eliminate backtracking in CSP, which is used?

(a) Forward Searching
(b)Constraint Propagation
(c) Backtrack after forward search
(d) Omitting constraints

57. Preparing a schedule for a class of students is a:

(a) Search Problem
(b) Backtrack Problem
(c) Constraint Satisfaction Problem
(d) Planning Problem

58. CSPs on finite domains are solved using:

(a) Search Algorithms
(b) Heuristic Search Algorithms
(c) Greedy Search Algorithms
(d) Al of the mentioned
<br>

59. Solving CSP on finite domain is:

(a) P complete
(b) NP complete
(c) NP hard
(d) Domain dependent

60. Flexible Constraint Satisfaction Problems relax on:

(a) Constraints
(b) Current State
(c) Initial State
(d) Goal State

61. Language used for programming Constraint Programming includes:

(a) Prolog
(b) C#
(c) C
(d) Fortran

62. Backtracking is based on:

(a) Last in first out
(b) First in first out
(c) Recursion
(d) Both Last in first out & Recursion

63. Constraint Propagation technique modifies the CSP.

(a) TRUE
(b) FALSE

64. Commonly used algorithm for CSP search is:

(a) Breadth-first search algorithm
(b) Depth-first search algorithm
(c) Hill-climbingsearch algorithm
(d) None of the mentioned
<br>

65. How many successors are produced in backtracking search?

(a) 4
(b) 2
(c) 3
(d) 1

66. Which search is implemented with an empty FIFO queue?

(a) Depth-first search
(b) Bidirectional search
(c) Breadth-first search
(d) None of these

67. How many kinds are there in uninformed search method?

(a) 5
(b) 7
(c) 2
(d) 6

68. Which Al algorithm enforces a fixed depth limit?

(a) Bidirectional search
(b) Depth-first search
(c) lterative deepening search
(d) Depth-limited search

69. Which is true regarding BFS?

(a) BFS will get trapped exploring a single path
(b) The entire tree so far generated must be stored
a
(c) BFS is not guaranteed to find solution if exists
(d) BFS is Binary First Search

70. A is optimal if heuristic never underestimates cost to goal. *

(a) True
(b) False
(c) Partially true
(d) None of these
<br>

71. Evaluation function in greedy technique is:

(a) Heuristic function
(b) Path cost from start to current node
(c) Path cost + Heuristic cost
(d) Average of path and heuristic cost

72. A Search Algorithm:*

(a) Does not expand the node with lowest f(n)
(b) Finds shortest path using f(n)=g(n)+h(n)
(c) Terminates if goal node not found
(d) All of the above

73. Domain knowledge is used to choose child nodes in:

(a) Depth First Search
(b) Breadth First Search
(c) Heuristic Search
(d) Depth Limited Search

74. The principal gain of heuristic function is:

(a) Use of domain knowledge
(b) Estimate of path
(c) Reduction of search space
(d) Rank child nodes

75. Combining advantages of DFS and BFS is called:

(a) Iterative Deepening Depth First Search
(b) Bidirectional Search
(c) Best First Search
(d) Depth Limited Search

76. A generates an optimal solution if:*

(a) A* never generates an optimal solution
(b) Only Condition 1

(c) Both Condition 1 and Condition 2

(d) Only Condition 2
<br>

77. If the path to goal is irrelevant, it can be solved using:

(a) Informed Search Techniques
(b)Uninformed Search Techniques
(c) Local Search Techniques
(d) Informed &Uninformed Search Techniques

78. Key advantages of local search algorithms:

(a) Less memory
(b) More time
(c) Finds solution in large infinite space
(d) Less memory & Finds solution in large infinite space

79. A complete local search algorithm always finds a goal if it exists, and an
optimal algorithm always finds a global minimum/maximum.
(a) True
(b) False

80. Is an algorithm a loop that continually moves uphill?

(a) Up-Hill Search
(b) Hill-Climbing
(c) Hill algorithm
(d) Reverse-Down-Hill search

81. When will Hill-Climbing algorithm terminate?

(a) Stopping criterion met
(b) Global Min/Max achieved
(c) No neighbor has higher value
(d) All of the mentioned

82. What are the main cons of hill-climbing search?

(a) Terminates at local optimum & Does not find optimum solution
(b) Terminates at global optimum
(c) Does not find optimum solution & Fail to find a solution
(d) Fail to find a solution
<br>

83. Stochastic hill climbing chooses randomly among uphill moves.

(a) True
(b) False

84. Hill climbing sometimes called because it grabs a good neighbor:

(a) Needy local search
(b) Heuristic local search
(c) Greedy local search
(d) Optimal local search

85. Hill-Climbing approach stuck for which of the following reasons?

(a) Local maxima
(b) Ridges
(c) Plateaux
(d) Al of the mentioned