SUB: ARTIFICIAL INTELLIGENCE QUESTION BANK AY:2025-26(I SEM)

CO COURSEOUTCOMES
CO1 Understanding the process of how an agent works (K2) .
CO2 Apply Searching Techniques for Solving a problem. (K3)
CO3 Understanding Knowledge Representation Techniques. (K2)
CO4 Understanding how predicate logic is used for representing AI problems (K2)
CO5 Understand the concept of Expert Systems. (K2)

UNIT - I
LONG ANSWER QUESTIONS

1. What are the problems of AI? [CO1, K2]

2. In detail discuss about Foundations of AI. [CO1, K2]
3. Discuss in brief about history of disciplines that contributed ideas, viewpoints and
techniques to AI. [CO1, K2]
4. Explain agents and Environments? [CO1, K2]
5. (a)What is concept of rationality? [CO1, K3]
(b) Explain nature of Environments? [ CO1, K2]
6. How do the agents interact with environments through sensors and actuators? [CO1, K2]
7. Explain problem solving agent with an example. [CO1, K3]
8. Illustrate the problem formulation? [CO1,K3]

SHORT ANSWER QUESTIONS

1. What is AI? [CO1, K1]

2. Define an agent. [CO1, K1]
3. What is an agent function? [CO1, K2]
4. Define the problem solving agent. [CO1, K2]
5. What is PEAS representation for Taxi Driver? [CO1, K2]

UNIT - II
LONG ANSWER QUESTIONS

1. Whatismeantbysearchstrategies?Explainuninformedandinformedsearch strategies? CO2,K2]

2. Whatismeantbyheuristicsearchexplainwithanexample?[CO2,K3]
3. Explainmin-maxalgorithmwithanexample?[CO2,K3]
4. Whatisgameplayingproblem explain with an example?[CO2,K2]
5. WhatisAlpha–Betapruning explain with an example?[CO2,K3]
6. ExplainA*andAO*algorithms?[CO2,K3]
7. ExplainHill–climbingalgorithm?[CO2,K3]
8. Illustrate the evaluation functions? [CO2, K3]

SHORT ANSWER QUESTIONS

1. List the criteria to measure the performance of different search strategies. [CO2,K1]
2. Differentiate Uninformed Search (Blind search) and Informed
Search (Heuristic Search) strategies. [CO2, K2]
3. Define Best-first-search. [CO2, K1]
4. WhatarethetypesofUninformedSearchStrategies?[CO2,K2]
5. WhatarethetypesofInformedSearchStrategies?[CO2,K1]

UNIT - III

LONG ANSWER QUESTIONS

1. Whatisknowledge-base?Explainknowledgerepresentationissues?[CO3,K2]
2. Whataretherulesusedinknowledgerepresentation?[CO3,K2]
3. Explainconstraintpropagation?[CO3,K1]
4. ExplainBayesprobabilisticinterferences?[CO3,K3]
5. ExplainpredicatelogicinArtificialIntelligence?[CO3, K2]
6. Demonstrate semantic nets- frames and inheritance? [CO3,K3]
7. Illustrate rule based deduction system? [CO3,K3]
8. Illustrate Reasoning under uncertainty? [CO3,K3]

SHORT ANSWER QUESTIONS

1. Whatispredicatelogic,giveanexample?[CO3, K2]
2. What are semantic nets and how do they represent Knowledge?[CO3, K1]
3. What isconstraintpropagation in AI?[CO3,K1]
4. What is Baye’sTheorem and how is it used in AI reasoning?[CO3,K2]
5. Whatarethe main issues in knowledgerepresentationin AI?[CO3,K2]

UNIT - IV

LONG ANSWER QUESTIONS

1. WhatisFOL?ExplaininferencesofFOLwithanexample?[CO4,K2]
2. Explainforwardchainingandbackwardchaining?[CO4,K1]
3. Explain [CO4,K3]
a. unificationandlifting
b. resolution
c. propositionalvsFOL
4. Whatisreinforcementlearning?Explainwithanexample?[CO4,K2]
5. ExplainaboutsyntaxandsemanticsofFOL?[CO4,K1]
6. ExplainDecisiontreeswithanexample?[CO4, K3]
7. Demonstrate Learning from observation Inductive learning? [CO4,K3]
8. Illustrate Statistical Learning methods? [CO4,K3]

SHORT ANSWER QUESTIONS

1. What is First Order Logic (FOL)?[CO4,K1]

2. Whatisresolution in logic?[CO4,K1]
3. What are decision trees? [CO4,K1]
4. Definebackwardchaining?[CO4, K1]
5. Definereinforcementlearning?[CO4,K2]
UNIT - V

LONG ANSWER QUESTIONS

1. Explain thearchitecture of ExpertSystems?[CO5,K3]

2. Explain the different roles of Expert systems? [CO5,K3]
3. Illustrate MYCIN typical expert system? [CO5,K3]
4. Illustrate DART typical expert system? [CO5,K3]
5. Illustrate XCON typical expert system? [CO5,K3]
6. What is an Expert System Shell and how is it used? [CO5,K2]
7. Discuss the role and applications of typical expert systems like MYCIN, DART, and XCON.[CO5,K3]
8. Explain the Roles of an Expert System in Real-World Applications.[CO5, K2]

SHORT ANSWER QUESTIONS

1. DefineExpertsystems?[CO5,K1]
2. Whatarethecomponents of an ExpertSystems Architecture?[CO5,K1]
3. Name two examples of Expert systems? [CO5,K1]
4. Whatis the role of heuristics in Expert Systems?[CO5, K1]
5. Whatistheroleof an ExpertSystem Engineer?[CO5,K1]

BITBANK
UNIT I:

1. Which of the following is NOT considered a foundational area of AI?

A. Machine Learning
B. Natural Language Processing
C. Relativity Theory
D. Computer Vision
Answer: C
2. What does the term "AI" primarily refer to?
A. Artificial networking of devices
B. Automation of industrial tasks
C. Simulation of human intelligence by machines
D. Analysis of internal software errors
Answer: C
3. Who is considered the father of Artificial Intelligence?
A. Alan Turing
B. John McCarthy
C. Marvin Minsky
D. Herbert Simon
Answer: B
4. Which test is used to evaluate a machine’s ability to exhibit intelligent behavior equivalent
to or indistinguishable from that of a human?
A. IQ Test
B. Loebner Test
C. Turing Test
D. Watson Test
Answer: C
5. Which decade saw the coining of the term "Artificial Intelligence"?
A. 1940s
B. 1950s
C. 1960s
D. 1980s
Answer: B
6. An intelligent agent perceives its environment through:
A. Sensors
B. Cameras only
C. Actuators
D. Controllers
Answer: A
7. The part of an agent that acts upon the environment is called:
A. Sensor
B. Effector
C. Actuator
D. Controller
Answer: C
8. Which of the following best defines an intelligent agent?
A. A static rule-based program
B. A human-like robot
C. An entity that perceives and acts in an environment
D. A program that stores large datasets
Answer: C
9. Which of the following is NOT a type of environment in AI?
A. Fully Observable
B. Deterministic
C. Single-agent
D. Irrelevant
Answer: D
10. In the context of AI agents, the term 'rationality' refers to:
A. The emotional response of the agent
B. The agent’s ability to always make correct decisions
C. Acting to achieve the best expected outcome
D. The agent’s human-like behavior
Answer: C
11. Which of the following environments is considered fully observable?
A. Chess game
B. Driving a car in traffic
C. Medical diagnosis
D. Poker game
Answer: A
12. In a deterministic environment:
A. Outcomes are based on chance
B. Outcomes are unpredictable
C. Outcomes are determined solely by the current state and action
D. No agent can function
Answer: C
13. What characterizes a stochastic environment?
A. It has no randomness
B. It is fully observable
C. It involves randomness or uncertainty
D. Only one agent acts in the environment
Answer: C
14. Which of the following is a multi-agent environment?
A. Solitaire
B. Robotic vacuum in an empty room
C. Soccer game
D. Tic-tac-toe with one player
Answer: C
15. Static environments are those where:
A. The environment changes while the agent is deliberating
B. The environment remains unchanged while the agent makes decisions
C. The agent controls the environment
D. No sensors are required
Answer: B
16. Which of the following is part of an agent’s structure?
A. Sensors only
B. Performance measure
C. Agent function and architecture
D. Environment
Answer: C
17. A simple reflex agent acts only based on:
A. Past memory
B. A model of the world
C. The current percept
D. A predefined plan
Answer: C
18. Which type of agent uses an internal model to maintain information about the world?
A. Simple reflex agent
B. Model-based reflex agent
C. Goal-based agent
D. Utility-based agent
Answer: B
19. What is the first step in designing a problem-solving agent?
A. Select a search algorithm
B. Implement the performance measure
C. Formulate the problem
D. Build the environment
Answer: C
20. In problem formulation, the problem definition must include:
A. Only the initial state
B. Only the goal test
C. Initial state, actions, transition model, goal test, and path cost
D. Just the goal state
Answer: C

UNIT II:

1. Which of the following is a characteristic of breadth-first search (BFS)?

A. Explores deepest nodes first
B. Uses a stack
C. Always finds the shallowest goal node
D. May get trapped in loops
Answer: C
2. Which data structure is typically used in depth-first search (DFS)?
A. Queue
B. Priority queue
C. Stack
D. Heap
Answer: C
3. In DFS, the time complexity in the worst case is:
A. O(b^d)
B. O(d)
C. O(b^m)
D. O(m)
Answer: C (b = branching factor, m = maximum depth)
4. Which of the following search strategies is both complete and optimal?
A. DFS
B. BFS
C. Greedy Best First
D. Hill Climbing
Answer: B
5. Which search algorithm is most suitable when the solution is at the maximum depth of the
tree and memory is a constraint?
A. BFS
B. DFS
C. A*
D. Hill Climbing
Answer: B
6. A heuristic function is used to:
A. Always return the optimal solution
B. Improve search speed by estimating cost to the goal
C. Generate random search paths
D. Replace the need for search
Answer: B
7. Which of the following is a characteristic of hill climbing?
A. May get stuck at local maxima
B. Uses backtracking
C. Guarantees optimal solution
D. Explores all paths
Answer: A
8. The A algorithm uses which of the following functions?*
A. h(n)
B. g(n)
C. f(n) = g(n) + h(n)
D. f(n) = h(n) – g(n)
Answer: C
9. If a heuristic is admissible, it means that:
A. It always returns the highest cost
B. It never overestimates the cost to reach the goal
C. It always chooses the shortest path
D. It underestimates time complexity
Answer: B
10. AO algorithm is designed for:*
A. Linear problems
B. AND-OR graphs
C. Greedy search problems
D. Tree-structured environments only
Answer: B
11. Problem reduction is mainly useful in:
A. Game search
B. Decision trees
C. Goal-based planning
D. Constraint satisfaction
Answer: C
12. What is the key idea of adversarial search?
A. Finding optimal routes in networks
B. Handling randomness in sensor data
C. Making decisions against an opponent
D. Optimizing hill climbing functions
Answer: C
13. Which of the following is used in two-player games like chess?
A. A* algorithm
B. AO* algorithm
C. Minimax algorithm
D. Hill climbing
Answer: C
14. The minimax algorithm assumes that the opponent will:
A. Act randomly
B. Make optimal moves
C. Always lose
D. Skip turns
Answer: B
15. In a minimax tree, MAX tries to:
A. Minimize opponent's score
B. Maximize opponent’s gain
C. Maximize its own utility
D. Block the opponent’s turn
Answer: C
16. What is the purpose of alpha-beta pruning?
A. To find optimal solution in hill climbing
B. To reduce the number of nodes evaluated in minimax
C. To improve pathfinding in A*
D. To enhance probability estimation
Answer: B
 17. Alpha-beta pruning is guaranteed to give the same result as:
A. A*
B. Hill climbing
C. Unpruned minimax
D. BFS
Answer: C
18. The alpha value in alpha-beta pruning represents:
A. The worst value that the maximizer can guarantee
B. The best value the opponent can achieve
C. The number of nodes visited
D. Probability of winning
Answer: A
19. Evaluation functions in game playing are used to:
A. Determine whether to expand a node
B. Rank the opponent
C. Estimate the desirability of a game state
D. Replace the game tree
Answer: C
20. In which scenario is using an evaluation function most important?
A. When the game tree is very shallow
B. When all end states are known
C. When a full minimax search is impractical
D. When there is only one player
Answer: C

UNIT III:

1. Which of the following is NOT a challenge in knowledge representation?

A. Expressiveness
B. Ambiguity
C. Redundancy
D. Compilation
Answer: D. Compilation
2. A good knowledge representation system should have which of the following properties?
A. Incompleteness
B. Inferential adequacy
C. Memory leak
D. Static nature
Answer: B. Inferential adequacy
3. Predicate logic is more powerful than propositional logic because it:
A. Can handle only true/false values
B. Allows the use of variables and quantifiers
C. Is easier to implement
D. Uses symbolic constants only
Answer: B. Allows the use of variables and quantifiers
4. In predicate logic, the statement "All humans are mortal" is best represented as:
A. ∃ x Human(x) → Mortal(x)
B. ∀ x (Human(x) → Mortal(x))
C. Human → Mortal
D. ∃ x (Mortal(x) ∧ Human(x))
Answer: B. ∀ x (Human(x) → Mortal(x))
5. Which language is primarily used in logic programming?
A. Lisp
B. Python
C. Prolog
D. C++
Answer: C. Prolog
6. Semantic networks represent knowledge in the form of:
A. Mathematical equations
B. Directed graphs
C. Truth tables
D. Syntax trees
Answer: B. Directed graphs
7. Which of the following best describes a "frame" in knowledge representation?
A. A truth value assigned to a proposition
B. A data structure representing a stereotyped situation
C. A logical formula
D. An inference engine
Answer: B. A data structure representing a stereotyped situation
8. Inheritance in semantic networks allows:
A. New data structures to be created
B. Variables to be used universally
C. Child nodes to inherit properties from parent nodes
D. Logic to be compiled
Answer: C. Child nodes to inherit properties from parent nodes
9. Constraint propagation is used in:
A. Game development
B. Visual design
C. Solving constraint satisfaction problems
D. Compiling programs
Answer: C. Solving constraint satisfaction problems
10. Which algorithm is commonly associated with constraint propagation?
A. A*
B. AC-3
C. DFS
D. Minimax
Answer: B. AC-3
11. A production rule is typically of the form:
A. If <condition> then <action>
B. For all x, do y
C. While x, repeat y
D. Case x of y
Answer: A. If <condition> then <action>

12. A rule-based system consists of:

A. Only inference engine
B. Rules and compiler
C. Knowledge base and inference engine
D. Variables and quantifiers
Answer: C. Knowledge base and inference engine
13. Which method is commonly used for reasoning in rule-based systems?
A. Depth-first search
B. Breadth-first search
C. Forward and backward chaining
D. Neural networks
Answer: C. Forward and backward chaining
14. Which of the following is used for reasoning under uncertainty?
A. Predicate logic
B. Deterministic algorithms
 C. Probability theory
D. Truth tables
Answer: C. Probability theory
15. A system that uses probabilistic inference must deal with:
A. Certainty
B. Ignorance
C. Inference
D. Uncertainty
Answer: D. Uncertainty
16. Bayes' theorem is used to:
A. Calculate averages
B. Calculate the frequency of an event
C. Update probability based on new evidence
D. Determine logical equivalence
Answer: C. Update probability based on new evidence
17. The conditional probability P(A|B) is defined as:
A. P(A) + P(B)
B. P(A) / P(B)
C. P(A and B) / P(B)
D. P(A or B)
Answer: C. P(A and B) / P(B)
18. Bayesian networks represent relationships between variables using:
A. Truth tables
B. Probability matrices
C. Directed acyclic graphs
D. Binary trees
Answer: C. Directed acyclic graphs
19. Which of the following is NOT an assumption in naive Bayes classification?
A. Features are independent
B. Probabilities are known
C. Prior probabilities are equal
D. Features are dependent
Answer: D. Features are dependent
20. Dempster-Shafer theory is used for:
A. Exact inference
B. Combining evidence from different sources
C. Logical entailment
D. Rule compilation
Answer: B. Combining evidence from different sources

UNIT IV:

1. Which of the following is NOT a component of first-order logic?

A. Constants
B. Functions
C. Operators
D. States
Answer: D. States
2. Which of the following symbols represents universal quantification in first-order logic?
A. ∃
B. ∀
C. →
D. ∧
Answer: B. ∀
3. Which of the following inference rules is commonly used in first-order logic?
A. Modus tollens
B. Generalization
C. Unification
D. Addition
Answer: C. Unification
4. Which of the following is an inference algorithm for first-order logic?
A. Breadth-first search
B. DPLL
C. Resolution
D. Bellman-Ford
Answer: C. Resolution
5. What makes first-order logic more expressive than propositional logic?
A. Use of probabilities
B. Use of graphs
C. Use of variables and quantifiers
D. Use of truth tables
Answer: C. Use of variables and quantifiers
6. Propositional logic cannot express:
A. Complex formulas
B. Relationships among objects
C. Truth values
D. Logical connectives
Answer: B. Relationships among objects
7. What does the process of unification do?
A. Proves validity of a formula
B. Matches variables in logical expressions
C. Computes logical equivalence
D. Applies quantifiers to propositions
Answer: B. Matches variables in logical expressions
8. Lifted inference operates on:
A. Propositions only
B. Grounded atoms
C. First-order logic representations
D. Syntax trees
Answer: C. First-order logic representations
9. Forward chaining is most suitable for:
A. Goal-driven reasoning
B. Fact-based reasoning
C. Recursive logic
D. Backtracking
Answer: B. Fact-based reasoning
10. Backward chaining starts from:
A. Initial facts
B. Conclusions and works backward
C. Axioms
D. Statistical data
Answer: B. Conclusions and works backward
11. Resolution in first-order logic is a technique for:
A. Assigning truth values
B. Simplifying formulas
C. Refutation proof
D. Creating decision trees
Answer: C. Refutation proof
12. Which form must the sentences be converted into for resolution?
A. Normal form
B. Disjunctive normal form
C. Conjunctive normal form
D. Functional normal form
Answer: C. Conjunctive normal form
13. Inductive learning involves:
A. Drawing general rules from specific examples
B. Deductive reasoning from axioms
C. Using only labeled data
D. Rule-based systems
Answer: A. Drawing general rules from specific examples
14. A drawback of inductive learning is:
A. It cannot handle data
B. It requires labeled data only
C. Overfitting to training examples
D. It is always probabilistic
Answer: C. Overfitting to training examples
15. Which algorithm is commonly used to build decision trees?
A. ID3
B. BFS
C. Q-learning
D. Unification
Answer: A. ID3
16. In a decision tree, internal nodes represent:
A. Decisions
B. Outputs
C. Attributes/tests
D. Probabilities
Answer: C. Attributes/tests
17. Explanation-based learning aims to:
A. Generalize from examples
B. Use statistical models
C. Derive general rules from a single example by explanation
D. Perform random exploration
Answer: C. Derive general rules from a single example by explanation
18. A key requirement for explanation-based learning is:
A. No background knowledge
B. No labeled data
C. A domain theory
D. Reinforcement
Answer: C. A domain theory
19. Statistical learning typically relies on:
A. Logic programming
B. Probabilities and data distributions
C. Truth tables
D. Semantic networks
Answer: B. Probabilities and data distributions
20. Which of the following is an example of a statistical learning method?
A. Rule-based inference
B. Decision tree learning
C. Naive Bayes classifier
D. Resolution
Answer: C. Naive Bayes classifier

UNIT V:
1. Which of the following is NOT a main component of an expert system?
A. Knowledge base
B. Inference engine
C. Database management system
D. User interface
Answer: C. Database management system
2. The component of an expert system that contains domain-specific facts and heuristics is called:
A. Inference engine
B. Knowledge base
C. Control strategy
D. Working memory
Answer: B. Knowledge base
3. Which part of an expert system applies logical rules to the knowledge base to draw conclusions?
A. Knowledge acquisition system
B. Explanation subsystem
C. Inference engine
D. Shell
Answer: C. Inference engine
4. The explanation subsystem in expert systems is used to:
A. Diagnose hardware faults
B. Explain reasoning or decisions to the user
C. Control inference direction
D. Update the knowledge base automatically
Answer: B. Explain reasoning or decisions to the user
5. A key feature of expert system architecture that separates domain knowledge from problem-
solving methods is known as:
A. Meta-knowledge
B. Decoupling
C. Shell
D. Inference
Answer: A. Meta-knowledge
6. Expert systems are mainly designed to:
A. Replace human experts in all domains
B. Automate general-purpose programming
C. Support decision-making in complex domains
D. Replace operating systems
Answer: C. Support decision-making in complex domains
7. Knowledge acquisition in expert systems refers to:
A. Accessing online databases
B. Extracting and structuring expert knowledge
C. Building user interfaces
D. Programming heuristics manually
Answer: B. Extracting and structuring expert knowledge
8. A major challenge in building expert systems is:
A. Lack of programming languages
B. Limited computing power
C. Knowledge acquisition from human experts
D. Operating system dependency
Answer: C. Knowledge acquisition from human experts
9. Heuristics in expert systems are:
A. Scientific laws
B. Strictly defined rules
C. Rules of thumb or informal guidelines
D. Data structures
Answer: C. Rules of thumb or informal guidelines
10. Which expert system component handles newly acquired rules?
A. Shell
B. Inference engine
C. Knowledge acquisition module
D. Explanation subsystem
Answer: C. Knowledge acquisition module
11. MYCIN is an expert system developed for the domain of:
A. Computer networking
B. Medical diagnosis
C. Aircraft tracking
D. Business planning
Answer: B. Medical diagnosis
12. MYCIN was one of the first expert systems to use:
A. Deep learning
B. Backpropagation
C. Certainty factors
D. Reinforcement learning
Answer: C. Certainty factors
13. DART, an expert system used in military logistics, stands for:
A. Decision Assistance for Radiology Training
B. Distributed Automated Routing Tool
C. Defense Analysis Routing Technique
D. Data Analysis and Retrieval Terminal
Answer: B. Distributed Automated Routing Tool
14. XCON was used to configure:
A. Diagnostic rules in hospitals
B. Air traffic control systems
C. VAX computer systems
D. Medical prescriptions
Answer: C. VAX computer systems
15. A commonality among MYCIN, DART, and XCON is that they:
A. All use neural networks
B. Are designed for mobile devices
C. Are rule-based expert systems
D. Depend on external cloud systems
Answer: C. Are rule-based expert systems
16. An expert system shell is:
A. A full expert system for any domain
B. A software tool for building expert systems
C. The command line interface of an OS
D. A database used in expert systems
Answer: B. A software tool for building expert systems
17. Which of the following is a popular expert system shell?
A. TensorFlow
B. CLIPS
C. Android Studio
D. Visual Studio Code
Answer: B. CLIPS
18. Expert system shells provide:
A. Complete domain knowledge
B. Inference mechanisms and user interface, but not domain knowledge
C. Neural network tools
D. Statistical processing only
Answer: B. Inference mechanisms and user interface, but not domain knowledge
19. The benefit of using an expert system shell is:
A. It writes domain rules automatically
B. No programming is needed
C. It speeds up expert system development
D. It eliminates the need for expert knowledge
Answer: C. It speeds up expert system development
20. Expert system shells typically support which reasoning method?
A. Genetic algorithms
B. Forward and backward chaining
C. Gradient descent
D. Fuzzy clustering
Answer: B. Forward and backward chaining