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

* Selected Answer: f(n) = h(n)

2. Which of the following problems can be modeled as CSP?

* Selected Answer: All of the mentioned (8-Puzzle problem, 8-Queen problem, Map coloring
problem)

3. An algorithm is complete if ________.

* Selected Answer: It terminates with a solution when one exists

4. What is an 'agent'?

* Selected Answer: All of the mentioned (Takes input from surroundings and uses its intelligence and
performs desired operations; An embedded program controlling line following robot; Perceives its
environment through sensors and acting upon that environment through actuators)

5. Depth-first search always expands the ________ node in the current fringe of the search tree.

* Selected Answer: Deepest

6. Who is the Inventor of Artificial Intelligence?

* Selected Answer: John McCarthy

7. Solving a constraint satisfaction problem on a finite domain is an/a ________ problem with
respect to the domain size.

* Selected Answer: NP complete

8. Backtracking is based on ________.

* Selected Answer: Both Last in first out & Recursion

9. Which search uses the problem specific knowledge beyond the definition of the problem?

* Selected Answer: Informed search

10. Web Crawler is a/an ________.

* Correct Answer: Intelligent goal-based agent

11. Which process makes different logical expression looks identical?

* Selected Answer: Unification

12. Which is true regarding BFS (Breadth First Search)?

* Selected Answer: The entire tree so far been generated must be stored in BFS

13. Uncertainty arises in the wumpus world because the agent's sensors give only ________.

* Selected Answer: Partial & Local Information

14. Which of the following elements constitutes the frame structure?

* Selected Answer: Facts or Data

* Correct Answer: DBMS

16. What is the evaluation function in greedy approach?

* Selected Answer: Heuristic function

17. How the compactness of the bayesian network can be described?

* Selected Answer: Locally structured

18. What is the problem space of means-end analysis?

* Selected Answer: An initial state and one or more goal states

19. What is a heuristic function?

* Selected Answer: A function that maps from problem state descriptions to measures of desirability

20. Which data structure conveniently used to implement DFS?

* Selected Answer: Stacks

21. Where does the bayes rule can be used?

* Selected Answer: Answering probabilistic query

22. What is the goal of Artificial Intelligence?

* Correct Answer: To explain various sorts of intelligence

23. The initial state and the legal moves for each side define the ________ for the game.

* Selected Answer: Game Tree

24. For general graph, how one can get rid of repeated states?

* Selected Answer: By maintaining a list of visited vertices

25. Which of the following algorithm is generally used CSP search algorithm?

* Selected Answer: Depth-first search algorithm

26. What among the following constitutes the representation of the knowledge in different forms?

* Selected Answer: All of the mentioned (Relational method, Inheritable knowledge, Inferential
knowledge)

27. What is the general term of Blind searching?

* Selected Answer: Uninformed Search

28. Which is true for Decision theory?

* Correct Answer: Decision Theory = Uncertainty + utility theory

29. ________ are mathematical problems defined as a set of objects whose state must satisfy a
number of constraints or limitations.

* Selected Answer: Constraints Satisfaction Problems

* Selected Answer: Perl

31. A Hybrid Bayesian network contains ________.

* Selected Answer: Both discrete and continuous variables

32. Wumpus World is a classic problem, best example of ________.

* Selected Answer: Reasoning with Knowledge

33. Knowledge and reasoning also play a crucial role in dealing with ________ environment.

* Selected Answer: Partially Observable

34. Zero sum game has to be a ________ game.

* Selected Answer: Two player (Marked Incorrect)

* Correct Answer: Multiplayer (Note: Typically zero-sum implies two-player in strict game theory
contexts like chess, but in broader AI contexts, it can involve more agents where total gains/losses
sum to zero. However, standard textbook definitions often link zero-sum strongly with two-player
scenarios. The provided correct answer key marks "Multiplayer".)

35. Which agent deals with happy and unhappy states?

* Selected Answer: Utility based agent

36. Which search method takes less memory?

* Selected Answer: Depth-First Search

37. To which depth does the alpha-beta pruning can be applied?

* Selected Answer: Any depth

38. Semantic Network represents ________.

* Selected Answer: Semantic relations between concepts

39. Best-First Search can be implemented using the following data structure.

* Selected Answer: Priority Queue

40. General algorithm applied on game tree for making decision of win/lose is ________.

* Selected Answer: MIN/MAX Algorithms

41. Which condition is used to influence a variable directly by all the others?

* Selected Answer: Fully connected

42. What is the function of an Artificial Intelligence "Agent"?

* Correct Answer: Mapping of percept sequence to an action

43. What is the main task of a problem-solving agent?

44. What are the composition for agents in artificial intelligence?

* Selected Answer: Both Program & Architecture

45. Which search is equal to minimax search but eliminates the branches that can't influence the
final decision?

* Selected Answer: Alpha-beta pruning

46. A heuristic is a way of trying ________.

* Selected Answer: All of the mentioned (To discover something or an idea embedded in a program;
To search and measure how far a node in a search tree seems to be from a goal; To compare two
nodes in a search tree to see if one is better than another)

47. Where did all the facts are stored to implement store and fetch function?

* Selected Answer: Knowledge base

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

* Correct Answer: All of the mentioned (Breadth First Search, Depth First Search, Bidirectional
Search)

49. Where does the values of alpha-beta search get updated?

* Selected Answer: Along the path of search

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

* Selected Answer: A* search

51. LIFO is ________ where as FIFO is ________.

* Selected Answer: Stack; Queue

52. Heuristic function h(n) is ________.

* Selected Answer: Estimated cost of cheapest path from root to goal node

53. Which function is used to calculate the feasibility of whole game tree?

* Selected Answer: Evaluation function

54. Which values are independent in minimax search algorithm?

* Correct Answer: Pruned leaves x and y

55. The total number of proposition symbols in AI are ________.

* Correct Answer: 2 proposition symbols (Likely referring to True/False or similar binary logic
constructs in basic propositional logic)

56. Which of the following is not a type of Artificial Intelligence agent?

* Selected Answer: Unity-based AI agent

* Selected Answer: Competitive Environment

58. What are Semantic Networks?

* Selected Answer: A way of representing knowledge

59. A algorithm is based on ________.*

* Selected Answer: Best-First Search

60. What does the Bayesian network provide?

* Selected Answer: Comple