AI Revision With Ans

Artificial Intelligence
Second Semester 2022-2023

Prof. Dr.Mohamed K. Heussein
Choose the correct answer

1. _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of
constraints or limitations.
a) Constraints Satisfaction Problems
b) Uninformed Search Problems
c) Local Search Problems
d) All of the mentioned
2. Which of the following is a local search technique?

a) Hill climbing
b) Simulated annealing
c) Tabu search
d) All the mentioned
3. Which of the following algorithms can be used for map coloring problems?
a) Genetic algorithms
b) Ant colony optimization
c) Simulated annealing
4. Which of the Following problems can be modeled as CSP?

a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem
5. Which of the following heuristics choose variable with the fewest legal moves in a constraint satisfaction
problem?
a) Minimum remaining values
b) Most constraint variables
c) Least constraining value
Page 1 of 13
d) Forward checking
6. Which of the following heuristics choose the variable with the most constraints on remaining variables?
a) Minimum remaining values
b) Most constraint variables
c) Least constraining value
d) Forward checking
7. The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns
when a variable has no legal values left to assign.
a) Forward checking
b) Backtrack search
c) Depth search
d) Breadth search
8. To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________
a) Forward checking
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals
9. Consider a problem of preparing a schedule for a class of student. What type of problem is this?
a) Depth first search Problem
b) Backtrack Problem
c) Constraints Satisfaction Problem
d) Breadth first search Problem
10. Which of the following algorithm is generally used in CSP search problems?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Uniform cost search algorithm
Page 2 of 13
d) None of the mentioned
11. Forward chaining systems are ______ while backward chaining systems are _______
a) Goal-driven, goal-driven
b) Goal-driven, data-driven
c) Data-driven, goal-drive
d) Data-driven, data-driven
12. Which condition is used to cease the growth of forward chaining?

a) Atomic sentences
b) Complex sentences
c) No further inference
13. Which closely resembles propositional definite clause?

a) Resolution ‫دول ملغيني‬
b) Inference
c) Conjunction
d) First-order definite clauses
14. Which algorithm will work backward from the goal to solve a problem?
a) Forward chaining
b) Backward chaining
c) Depth chaining
15. Which search is implemented with a first-in-first-out queue?

a) Depth-first search
b) Breadth-first search
c) Bidirectional search
Page 3 of 13
16. Artificial Intelligence has its expansion in the following application.

a. Planning and Scheduling
b. Game Playing
c. Robotics
d. All of the above
17. Which of the following is a measure for the performance of a search algorithm?
a) Completeness
b) Optimality
c) Time and Space complexity
18. Which search method takes less memory?

a) Depth-First Search
b) Breadth-First search
c) Uniform cost Search
d) Bidirectional search
19. When is breadth-first search is optimal?

a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
20. What is the space complexity of Depth-first search?

a) O(b)
b) O(bm)
c) O(bd)
d) O(bm)
Page 4 of 13
21. Which search algorithm imposes a fixed depth limit on nodes to be complete?
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?
c) All the mentioned
23. What is the general term of Blind searching?

a) Informed Search
b) Uninformed Search
c) Informed & Unformed Search
d) Heuristic Search
24. Which of the following is/are Uninformed Search technique/techniques?

a) Breadth First Search (BFS)
b) Depth First Search (DFS)
c) Bidirectional Search
25. Which data structure conveniently used to implement BFS (Breadth first search)?
a) Stacks
b) Queues
c) Priority Queues
Page 5 of 13
26. Which data structure conveniently used to implement DFS?

a) Stacks
b) Queues
c) Priority Queues
27. uniform-cost search expands the node n with the __________

a) Lowest path cost
b) Heuristic cost
c) Highest path cost
d) Average path cost
28. Depth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
29. Breadth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
30. Optimality of BFS is ___________

a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
Page 6 of 13
31. DFS is ______ efficient and BFS is __________ efficient.

a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space
32. What is the other name of informed search strategy?

a) Simple search
b) Heuristic search
c) Online search
33. Which search uses the problem specific knowledge beyond the definition of the problem?
a) Informed search
c) Breadth-first search
d) Uninformed search
34. What is the heuristic function of greedy best-first search?

a) f(n) = h(n)
b) f(n) = h(n) + g(n)
c) f(n) < h(n)
d) f(n) < h(n) + g(n)
35. What is the heuristic function of A* search?

a) f(n) = h(n)
b) f(n) = h(n) + g(n)
c) f(n) < h(n)
d) f(n) < h(n) + g(n)
Page 7 of 13
36. Which search is complete and optimal?

a) Best-first search
c) Both Best-first & Depth-first search
d) A* search
37. 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
38. A* algorithm is based on ___________

a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
39. The search strategy the uses a problem specific knowledge is known as ___________
a) Informed Search
b) Best First Search
c) Heuristic Search
40. Best-First search is a type of informed search, which uses ________________ to choose the best next node for
expansion.
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
41. Heuristic function h(n) is ________

a) Lowest path cost
Page 8 of 13
b) Cheapest path from root node to goal node

c) Estimated cost of cheapest path from node to goal node
d) Average path cost
42. What is the evaluation function in A* 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 from start node to current node and Heuristic cost
43. What is time complexity with respect to search algorithms?

a) An estimate of how many search steps it takes to find a solution.
b) An estimate of how much information the algorithm needs to store for finding a solution.
c) An estimate of how many nodes will be on the memory
d) If there is a distinction between the quality of goal states, the agent will find the best one.
44. A game can be formally defined as a kind of search problem with the following components.
a) states and Initial State
b) Successor Function and Terminal Test
c) Utility Function
45. General algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms
46. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
Page 9 of 13
c) Alpha-beta pruning
47. Which search is similar to minimax search?

a) Hill-climbing search
c) Breadth-first search
48. Which value is assigned to alpha and beta in the alpha-beta pruning?
a) Alpha = max
b) Beta = min
c) Beta = max
d) Both Alpha = max & Beta = min
49. Which of the following is a component of the expert systems?

a) Inference Engine
b) Knowledge Base
c) User interface
50. In some problems the path to the goal is not important, this class of problems can be answered using which of
the following Techniques?
a) Informed Search
b) Uninformed Search
d) Local Search
d) Constraint Satisfaction Problem
51. A loop that constantly moves in the direction of growing value that is uphill, ....... is an algorithm.
a) Up-Hill Search
b) Hill-Climbing
c) Simulated annealing
d) Tabu Search
Page 10 of 13
52. Hill-Climbing algorithm terminates in which of the following conditions?

a) After a certain number of iterations
b) Global Min/Max is found
c) No neighbor has a higher value
d) All of these
53. Which of the following are the main disadvantages of a hill-climbing search?
a) Stops at local optimum and cannot find the optimum solution
b) Stops at global optimum and cannot find a solution
c) Cannot find the local optimum solution
d) Fail to find a guaranteed solution
54. Which of the following is the main advantage of the local search algorithms?
a) A big memory required
b) Less time required
c) Must search a solution in a big infinite space
d) Less memory and search a solution in a big infinite space
55. A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible
consequences, including chance event outcomes, resource costs, and utility.
a) Decision tree
b) Local search
c) Heuristics Search
d) Ant colony optimization
56. In decision tree, the _______is the measure of uncertainty of a random variable, it characterizes the impurity of
an arbitrary collection of examples.
a) Information Gain
b) Gini Index
c) Entropy
d) none of these
Page 11 of 13
57. Which subdomain of AI teaches how to make a decision and make an interface based on previous experience?
a) Heuristic search
b) Uninformed search
c) Machine learning
58. ...... learning model is able to identify hidden patterns from the training data.
a) Supervised
b) Unsupervised
c) Reinforcement
59. ...... learning model must provide labeled data to train the model.
a) Supervised
b) Unsupervised
c) Reinforcement
60. ...... learning model learns on the basis of the reward/punishment received from the last action.
a) Supervised
b) Unsupervised
c) Reinforcement
Choose (A) for the true statement and (B) for the false statement.
1. A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost
function, and an optimal solution has the lowest path cost among all solutions. ُTrue
2. Breadth-first search is not optimal when all step costs are equal. False
Page 12 of 13
3. The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously
from start node and another from goal node. ُTrue
4. Uninformed search strategies are better than informed search strategies. False
5. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never overestimates the cost to reach
the goal.ُTrue
6. Breadth first search is not optimal in case actions have different cost.ُTrue
7. Greedy search is a special case of uniform cost search. False
8. If uniform cost search is complete, it is also optimal. ُTrue
9. If a heuristic function h() is admissible, greedy search is optimal.False
10. The Depth first search can be implemented using queue. False
11. Alpha-beta pruning can alter the computed minimax value of the root of a game search tree. False
12. There are primarily two modes for an inference engine: forward chaining and backward chaining.
true ‫غالبًا الدكتور هيقول ملغيه برضو بس هي‬
13. A complete, local search algorithm forever finds target if one exists, an optimal algorithm forever finds a
global minimum/maximum. ُTrue
14. Simulated annealing is more likely to accept a bad move late in the search than earlier. False
15. Decision Trees can be used for Classification Tasks.ُTrue
16. The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously
from start node and another from goal node. ُTrue
17. Greedy search is an uninformed search.False
18. Informed search strategies are better than uninformed search strategies. ُTrue
19. If a heuristic function h() is admissible, greedy search is optimal. False
20. Decision Trees is a machine learning algorithm. ُTrue
Page 13 of 13

AI Revision With Ans

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

AI Revision With Ans

Uploaded by

Copyright:

Available Formats

Artificial Intelligence

Second Semester 2022-2023

Choose the correct answer

2. Which of the following is a local search technique?

4. Which of the Following problems can be modeled as CSP?

d) None of the mentioned

12. Which condition is used to cease the growth of forward chaining?

13. Which closely resembles propositional definite clause?

15. Which search is implemented with a first-in-first-out queue?

16. Artificial Intelligence has its expansion in the following application.

18. Which search method takes less memory?

19. When is breadth-first search is optimal?

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

23. What is the general term of Blind searching?

24. Which of the following is/are Uninformed Search technique/techniques?

26. Which data structure conveniently used to implement DFS?

27. uniform-cost search expands the node n with the __________

30. Optimality of BFS is ___________

31. DFS is ______ efficient and BFS is __________ efficient.

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

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

35. What is the heuristic function of A* search?

36. Which search is complete and optimal?

38. A* algorithm is based on ___________

41. Heuristic function h(n) is ________

b) Cheapest path from root node to goal node

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

43. What is time complexity with respect to search algorithms?

47. Which search is similar to minimax search?

49. Which of the following is a component of the expert systems?

52. Hill-Climbing algorithm terminates in which of the following conditions?

7. Greedy search is a special case of uniform cost search. False

8. If uniform cost search is complete, it is also optimal. ُTrue

9. If a heuristic function h() is admissible, greedy search is optimal.False

15. Decision Trees can be used for Classification Tasks.ُTrue

17. Greedy search is an uninformed search.False

19. If a heuristic function h() is admissible, greedy search is optimal. False

20. Decision Trees is a machine learning algorithm. ُTrue

You might also like

31. DFS is efficient and BFS is ____ efficient.