Artificial Intelligence - 2 Marks Questions and Answers

1. Q: Define the term AI.

A: AI (Artificial Intelligence) is the branch of computer science that aims to create machines
capable of performing tasks that normally require human intelligence, such as learning,
reasoning, and problem solving.

2. Q: Differentiate between Agent and Program.

A: Agent perceives environment and acts upon it, having sensors and actuators. A program
executes predefined instructions without perception.

3. Q: What is meant by meta reasoning?

A: Meta reasoning is reasoning about the reasoning process itself — an AI system analyzing
or controlling its own problem-solving strategies.

4. Q: What is meant by knowledge base?

A: A knowledge base is a collection of facts, rules, and relationships used by an AI system to

reason and make decisions.

5. Q: Write the goal of recursive best first search.

A: The goal of Recursive Best First Search (RBFS) is to find the least-cost path to the goal
while using limited memory, similar to A* but with lower space requirements.

6. Q: Define the term uncertainty.

A: Uncertainty refers to the lack of complete information about the environment or

outcomes, leading to probabilistic decision-making in AI systems.

7. Q: What is meant by Alpha–Beta pruning?

A: Alpha–Beta pruning is a search optimization technique for the minimax algorithm that
eliminates branches in the game tree which cannot affect the final decision.
8. Q: What is called constraint propagation?

A: Constraint propagation is the process of deducing new constraints from existing ones to
reduce the search space in a Constraint Satisfaction Problem (CSP).

9. Q: Differentiate between forward chaining and backward chaining.

A: Forward chaining starts from facts to reach conclusions (data-driven). Backward

chaining starts from a goal and works backward to find supporting facts (goal-driven).

10. Q: What are the different types of logics used in reasoning?

A: Propositional Logic, First Order Logic, Modal Logic, and Temporal Logic.

11. Q: Define Bayes’ theorem.

A: Bayes’ theorem gives the probability of a hypothesis (H) given evidence (E): P(H|E) =
[P(E|H) * P(H)] / P(E).

12. Q: What are the techniques used to overcome uncertainty inherent?

A: Bayesian Networks, Fuzzy Logic, Certainty Factors, and Dempster–Shafer Theory.

13. Q: Write down the benefits of AI.

A: Reduces human error, increases efficiency, automates repetitive tasks, and enables smart
decision-making.

14. Q: What do you mean by Intelligent agent?

A: An intelligent agent is a system that perceives its environment through sensors and acts
rationally using actuators to achieve goals.

15. Q: Name the uninformed search strategies.

A: Breadth First Search (BFS), Depth First Search (DFS), Uniform Cost Search, Depth Limited
Search, and Iterative Deepening Search.

16. Q: What is meant by Iterative deepening?

A: Iterative Deepening Search repeatedly applies depth-limited search with increasing

depth limits, combining BFS’s optimality and DFS’s low space use.

17. Q: What are called stochastic games?

A: Stochastic games are multi-agent games involving probabilistic transitions between

states based on players’ actions.

18. Q: Write down the syntax and semantics of First Order Logic.

A: Syntax uses symbols (constants, variables, predicates, quantifiers); semantics assigns

meaning by mapping symbols to entities and truth values.

19. Q: What do you mean by ontological engineering?

A: Ontological engineering is the process of creating a structured representation (ontology)

of knowledge within a domain to support AI reasoning.

20. Q: How to do reasoning with default information?

A: Reasoning with default information uses default logic, allowing conclusions to be drawn
in the absence of complete knowledge, assuming defaults until contradicted.

21. Q: What is called Intelligence?

A: Intelligence is the ability to learn, reason, understand, and adapt to new situations
effectively.

22. Q: What are called redundant paths?

A: Redundant paths are repeated or unnecessary paths in a search tree that lead to the same
state multiple times, causing inefficiency.

23. Q: What is meant by Heuristic search?

A: Heuristic search uses heuristic functions to estimate cost to reach the goal and guides the
search efficiently (e.g., A* algorithm).

24. Q: How to do local search in continuous spaces?

A: Local search in continuous spaces uses methods like hill climbing, simulated annealing,
and gradient descent to iteratively improve solutions.

25. Q: Define forward pruning.

A: Forward pruning is a technique in game search that ignores certain moves or branches
ahead in the tree that are unlikely to affect the final decision.

26. Q: What are the limitations of game search?

A: High computational cost, large branching factor, limited look-ahead depth, and time
constraints in real-time play.

27. Q: Write a note on First Order Logic.

A: First Order Logic (FOL) extends propositional logic with quantifiers, variables, and
predicates, enabling reasoning about objects and their relationships.

28. Q: How to do Automated planning?

A: Automated planning defines initial and goal states and uses search algorithms (like
STRIPS or GraphPlan) to find a sequence of actions achieving goals.

29. Q: Name different types of learning.

A: Supervised Learning, Unsupervised Learning, Reinforcement Learning, and Semi-
supervised Learning.

30. Q: Write any two methods to handle uncertainty.

A: Bayesian Networks and Fuzzy Logic.

31. Q: Write down the risks in AI.

A: Job displacement, bias, privacy invasion, and ethical misuse.

32. Q: What are the components of Intelligent agent?

A: Sensors, Actuators, Perception, and Decision-making (Agent Program).

33. Q: Write the concept behind Simulated Annealing.

A: Simulated Annealing is a probabilistic local search that allows occasional worse moves to
escape local optima, inspired by metal cooling.

34. Q: What is local beam search?

A: Local Beam Search keeps k best states at each step and generates successors, focusing on
the most promising paths.

35. Q: What are the merits of forward pruning?

A: Reduces computation time, decreases memory usage, and speeds up decision-making in

games.

36. Q: How do we define AI problems?

A: AI problems are defined using state space representation: Initial state, Actions,
Transition model, Goal test, and Path cost.
37. Q: Name the various search strategies in AI.

A: Uninformed Search (BFS, DFS, UCS), Informed Search (A*, Greedy), and Local Search (Hill
Climbing, Simulated Annealing).

38. Q: How will you define Constraint Satisfaction Problem (CSP)?

A: A CSP is a problem where the goal is to assign values to variables satisfying all given
constraints (e.g., Sudoku).

39. Q: Give an example for propositional logic.

A: Example: If it rains, then the ground is wet. → R → W.

40. Q: What do you mean by Unification?

A: Unification is the process of making two logical expressions identical by finding a suitable
substitution of variables.

41. Q: What do you mean by agents in AI?

A: Agents in AI are autonomous entities that perceive their environment and act to achieve
specific goals.

42. Q: What is Beta tree search?

A: Beta tree search refers to Alpha–Beta pruning applied to game trees, where β represents
the minimum score the maximizing player can achieve.

43. Q: How theorem proving is carried out using propositional logic?

A: Theorem proving uses inference rules like Modus Ponens or Resolution to derive
conclusions from known facts and axioms.

44. Q: Mention the various methods of Knowledge representation.

A: Semantic Networks, Frames, Rules (If–Then), Logic (Propositional/Predicate), and
Ontologies.

45. Q: What is called classical planning?

A: Classical planning assumes a fully observable, deterministic, and static environment,

aiming to find a sequence of actions to reach the goal.