AI Question bank for mid-1

UNIT-1
1. Define Artificial Intelligence. Discuss its Objectives and Applications.
2. Discuss different types of Intelligent agents.
3. Describe production system? Construct production system for the following
A) Water jug problem B) Missionaries cannibal’s problem.
4. What is state space tree? Construct state space tree for 8-Puzzle problem.
5. Demonstrate Exhaustive search techniques with examples. (BFS & DFS)
6. Discuss Hill Climbing algorithm with its limitations.
7. Explain A* algorithm with an example.
8. Compare informed and uninformed search techniques.

UNIT-2
1. Discuss the role of AI in game playing.
2. Elaborate on NIM game with a strategy for MAX player and illustrate any two valid
cases for winning of MAX player.
3. Write MINIMAX algorithm and Alpha-Beta pruning Algorithm. apply them on some
tree.
4. Solve Constraint satisfaction problem.
5. Write short notes on the following
A) Natural deduction system B) Axiomatic System 3) Semantic tableau 4)
Resolution refutation
6. Write unification algorithm.
7. Discuss on predicate logic.
8. Discuss on propositional logic.
9. “If it is hot then it is humid. If it is humid then it will rain. It is hot”. Prove that “it will
rain “using resolution refutation method in prepositional logic.
10. Represent the following English sentences as predicate logic expression.
a. Everybody is happy.
b. John likes some animals.
c. Nobody likes Mary.
d. Everybody who is born in Telangana speaks telugu.
e. All the children like sweet.

UNIT-3
1. What is knowledge representation? List various approaches used for knowledge
representation.
2. What is Semantic Net? How is it used to represent knowledge? Explain using a suitable
example.
3. Design a semantic network representing following knowledge.
“Every vehicle is a physical object. Every car is a vehicle. Every car has four
wheels. Electric system is a part of car. Battery is part of electric system.
Pollution system is a part of every vehicle. Vehicle is used in transportation.
Swift is a car.”
4. Discuss Extended semantic network using an example.
5. Explain how frame is used to represent knowledge with suitable example.
6. Develop Frame based system for university.
 Objective questions
UNIT-1
1. What is Artificial Intelligence?
Artificial Intelligence is a field that aims to develop intelligent machines
2. Who is the inventor of Artificial Intelligence?
a) Geoffrey Hinton
b) Andrew Ng
c) John McCarthy
d) Jürgen Schmidhuber
3. Write few application of Artificial Intelligence?
Virtual assistants like Siri and Alexa. Recommendation systems used in e-commerce
platforms. Fraud detection in financial institutions etc.
4. What is the function of an Artificial Intelligence “Agent”?
Mapping of precept sequence to an action
5. Which of the following is an advantage of artificial intelligence?
a) Reduces the time taken to solve the problem
b) Helps in providing security
c) Have the ability to think hence makes the work easier
d) All of the above
6. Which of the following can improve the performance of an AI agent?
a) Perceiving
b) Learning
c) Observing
d) All of the mentioned
7. Which of the following is/are the composition for AI agents?
a) Program only
b) Architecture only
c) Both Program and Architecture
d) None of the mentioned
8. An AI agent perceives and acts upon the environment using___.
a. Sensors
b. Perceiver
c. Actuators
d. Both a and c

9. What is an AI ‘agent’?
An AI agent is defined as anything that uses sensors and actuators to perceive and act
on the environment. It receives information from its surroundings via sensors,
executes operations, and outputs via actuators.

10. Which agent deals with the happy and unhappy state?
 Utility-based agent
Model-based agent
Goal-based Agent
Learning Agent

11. List different types of agents that are there in artificial intelligence?
The four types of agents are Simple reflex, Model based, Goal based and Utility based
agents.
12. The main function of problem-solving agent is to________.
a. Solve the given problem and reach the goal
b. Find out which sequence of action will get it to the goal state.
c. Both a & b
d. None of the above

13. In which agent does the problem generator is present?

a) Learning agent
b) Observing agent
c) Reflex agent
d) None of the mentioned
14. Draw the architecture diagram of an Agent.

15. What is state space?

A space state tree is a tree that represents all of the possible states of the problem,
from the root as an initial state to the leaf as a terminal state.
16. A search algorithm takes _________ as an input and returns ________ as an output.
a) Input, output
b) Problem, solution
c) Solution, problem
d) Parameters, sequence of actions
17. A production rule consists of ____________
Set of Rule & sequence of steps

18. Which search method takes less memory?

a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
19. Which search strategy is also called as blind search?
a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned
20. 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
21. What is the space complexity of Depth-first search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
O(bm) is the space complexity where b is the branching factor and m is the maximum
depth of the search tree.
22. Which search is implemented with first-in-first-out queue?
a) Depth-first search
b) Breadth-first search
c) Bidirectional search
d) None of the mentioned
23. DFS is ______ efficient and BFS is __________ efficient.
a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space
24. What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned
25. What are the heuristic functions used in hill climbing and A* Algorithm?
26. What are the problems with hill climbing algorithm?
Local Maximum, Plateau and Ridge
27. What is the hill climbing strategy in AI?
An Artificial Intelligence algorithm that climbs hills improves in value over time until
it reaches a peak solution.
28. 1. A heuristic is a way of trying ___________
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned
29. 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
30. 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
UNIT-2
31. _________________ are mathematical problems defined as a set of objects whose
state must satisfy a number of constraints or limitations.
Constraints Satisfaction Problems
32. Which of the Following problems can be modeled as CSP?
a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem
d) All of the mentioned
33. Which of the following algorithm is generally used CSP search algorithm?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm
d) None of the mentioned
34. 6. A game can be formally defined as a kind of search problem with the following
components.
a) Initial State
b) Successor Function
c) Terminal Test
d) All of the mentioned
35. Define game tree.
A game tree is a tree where nodes of the tree are the game states and Edges of the tree
are the moves by players. Game tree involves initial state, actions function, and result
Function
36. General algorithm applied on game tree for making decision of win/lose is
____________ MIN/MAX Algorithms
37. Which search is equal to minimax search but eliminates the branches that can’t
influence the final decision?
Alpha-beta pruning
38. What is the significance of parameters alpha and beta in Alpha-beta pruning?
The two-parameter can be defined as: Alpha: The best (highest-value) choice we have
found so far at any point along the path of Maximizer. The initial value of alpha is -∞.
Beta: The best (lowest-value) choice we have found so far at any point along the path
of Minimizer.
39. Which function is used to calculate the feasibility of whole game tree?
a) Evaluation function
b) Transposition
c) Alpha-beta pruning
d) All of the mentioned
40. Which is created by using single propositional symbol?
Atomic sentences
41. Which is used to construct the complex sentences?
Logical connectives
42. Which are needed to compute the logical inference algorithm?
a) Logical equivalence
b) Validity
c) Satisfiability
d) All of the mentioned
43. Write modus ponens rule.
 If A is true, then B is true. A is true. Therefore, B is true.
Hypotheses :    and , Consequent : 

44. Which form is called as a conjunction of disjunction of literals?

a) Conjunctive normal form
b) Disjunctive normal form
c) Normal form
d) All of the mentioned
45. Write 3 axioms axiomatic system.

• Axiom 1:       
• Axiom 2: [    ]  [       ]
• Axiom 3:       

46. Name two forward approaches used in constructing proofs and derivations.
Natural deduction system and axiomatic systems
47. Name two backword approaches used in constructing proofs and derivations.
a. Semantic tableau method
b. Resolution refutation method
48. If all paths of a tableau for a given formula  are found to be closed, it is called a
contradictory tableau
49. A path is said to be contradictory or closed (finished) whenever complementary atoms
appear on the same path of a semantic tableau.
50. Write De Morgan's Laws
 (A ˄ B )   A ˅  B
 (A ˅ B )   A ˄  B
51. What is resolution principle.
If C is a resolvent of two clauses C1 and C2, then C is called a logical consequence of
the set of the clauses {C1 , C2}. This is known as resolution principle.
52. Write predicate logic for “some linguists are bald”

ꓱ X(linguist(X) ᴧ bald(X))

53. Define First order and second order predicate calculus

• If the quantification in predicate formula is on simple variables and not on predicates
or functions, then it is called first order predicate calculus.
ꓯ X, ꓯ Y( p(X) ↔ p(Y))
• If the quantification is over predicates or functions, then it becomes second order
predicate calculus.
ꓯ p( p(X) ↔ p(Y))
• When inference rules are added to first order predicate calculus, it becomes First
Order Predicate Logic.
54. When the resolution is called as refutation-complete?
a) Sentence is satisfiable
b) Sentence is unsatisfiable
c) Sentence remains the same
d) None of the mentioned
55. Which process makes two different Logical expressions look identical?
a. Unification
b. Lifting
 c. Inference Process
d. None of the above

UNIT-3
56. 3. A knowledge-based agent can combine general knowledge with current
percepts to infer hidden aspects of the current state prior to selecting actions.
a) True
b) False
57. A) Knowledge base (KB) is consists of set of statements.
B) Inference is deriving a new sentence from the KB.
Choose the correct option.
a) A is true, B is true
b) A is false, B is false
c) A is true, B is false
d) A is false, B is true
58. What among the following constitutes the representation of the knowledge in
different forms?
a) Relational method where each fact is set out systematically in columns
b) Inheritable knowledge where relational knowledge is made up of objects
c) Inferential knowledge
d) All of the mentioned
59. What are Semantic Networks?
a) A way of representing knowledge
b) Data Structure
c) Data Type
d) None of the mentioned
60. 3. Semantic Network represents _____________
a) Syntactic relation between concepts
b) Semantic relations between concepts
c) All of the mentioned
d) None of the mentioned
61. What are the limitations of the semantic networks?
a) Intractability
b) Lack in expressing some of the properties
c) Incomplete
d) Has memory constraints
62. What is the frame?
A way of representing knowledge
63. Which of the following elements constitutes the frame structure?
a) Facts or Data
b) Procedures and default values
c) Frame names
d) Frame reference in hierarchy
64. The basic inference mechanism in semantic network in which knowledge is
represented as Frames is to follow the links between the nodes.
a) True
b) False
65. Which algorithm takes two sentences and returns a unifier?
a) Inference
b) Hill-climbing search
c) Depth-first search
d) Unify algorithm
66. In artificial Intelligence, knowledge can be represented as_______.
i. Predicate Logic
ii. Propositional Logic

67. Give the general structure of Frame.

68. Show forward reasoning inference mechanism in Extended semantic networks.
69. Show backward reasoning inference mechanism in Extended semantic networks.
70. List few relations that are represented in semantic networks.