0% found this document useful (0 votes)
440 views12 pages

AI 5 Semester - Questions & Answers - Set 1 06-01-2025

Uploaded by

bharathraj01ja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
440 views12 pages

AI 5 Semester - Questions & Answers - Set 1 06-01-2025

Uploaded by

bharathraj01ja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Artificial Intelligence (AI) 5th Semester (P22CS5034)

1. Define Artificial Intelligence (AI).


The study of how to make computers do things at which at the moment, people are better.
➢ Systems that think like humans
➢ Systems that act like humans
➢ Systems that think rationally
➢ Systems that act rationally
2. Define Artificial Intelligence in terms of human performance.
The art of creating machines that performs functions that require intelligence when performed
by people.
3. Define Artificial Intelligence in terms of rational acting.
A field of study that seeks to explain and emulate intelligent behaviors in terms of
computational processes-Schalkoff.
The branch of computer science that is concerned with the automation of intelligent behavior-
Luger & Stubblefield.
4. Define Artificial Intelligence in terms of rational acting.
A field of study that seeks to explain and emulate intelligent behaviors in terms of
computational processes-Schalkoff.
The branch of computer science that is concerned with the automation of intelligent behaviour-
Luger & Stubblefield.
5. Define Artificial in terms of rational thinking.
The study of mental faculties through the use of computational models- Charniak & McDermott.
The study of the computations that make it possible to perceive, reason and act-Winston.
6. Define Rational Agent.
It is one that acts, so as to achieve the best outcome (or) when there is uncertainty, the best
expected outcome.
7. Define Agent.
An Agent is anything that can be viewed as perceiving (i.e.) understanding its environment
through sensors and acting upon that environment through actuators.
8. Define an Omniscient agent.
An omniscient agent knows the actual outcome of its action and can act accordingly; but
omniscience is impossible in reality.
9. What are the factors that a rational agent should depend on at any given time?
➢ The performance measure that defines degree of success.
➢ Ever thing that the agent has perceived so far. We will call this complete perceptual history
the percept sequence.
➢ When the agent knows about the environment.
➢ The action that the agent can perform.
10. Define Architecture.
The action program will run on some sort of computing device which is called as Architecture.
11. List the various type of agent program.
➢ Simple reflex agent program.
➢ Agent that keep track of the world.
➢ Goal based agent program.
➢ Utility based agent program

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 1 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

12. Give the structure of agent in an environment?


Agent interacts with environment through sensors and actuators. An Agent is anything that can
be viewed as perceiving (i.e.) understanding its environment through sensors and acting upon
that environment through actuators.

13. Define Percept Sequence.


An agent’s choice of action at any given instant can depend on the entire percept sequence
observed to elate.
14. Define Agent Function.
It is a mathematical description which deals with the agent’s behavior that maps the given
percept sequence into an action.
15. Define Agent Program.
Agent function for an agent will be implemented by agent program.
16. How agent should act?
Agent should act as a rational agent. Rational agent is one that does the right thing, (i.e.) right
actions will cause the agent to be most successful in the environment.
17. How to measure the performance of an agent?
Performance measure of an agent is got by analyzing two tasks. They are How and When
actions.
18. Define performance measures.
Performance measure embodies the criterion for success of an agent’s behavior.
19. Define Ideal Rational Agent.
For each possible percept sequence, a rational agent should select an action that is expected
to maximize its performance measure, given the evidence provided by the percept sequence
and whatever built in knowledge the agent has.
20. Define Omniscience.
An Omniscience agent knows the actual outcome of its actions and can act accordingly.
21. Define Information Gathering.
Doing actions in order to modify future Percepts sometimes called information gathering.
22. What is autonomy?
A rational agent should be autonomous. It should learn what it can do to compensate for partial
(or) in correct prior knowledge.
23. What is important for task environment?
PEAS → P- Performance measure
E - Environment
A- Actuators
S – Sensors
Example
Performance measure: Interactive English tutor performance measure maximize student’s
score on test.
Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 2 of 12
Artificial Intelligence (AI) 5th Semester (P22CS5034)

Environment: Set of students testing Agency


Actuators: Display exercises suggestions, corrections.
Sensors: Keyboard entry
24. What is environment program?
It defines the relationship between agents and environments.
25. List the properties of environments.
➢ Fully Observable Vs Partially Observable
➢ Deterministic Vs Stochastic
➢ Episodic Vs Sequential
➢ Static Vs Dynamic
➢ Discrete Vs Continuous
➢ Single Agent Vs Multi agent
✓ Competitive Multi agent
✓ Co – operative Multi agent
26. What is Environment Class (EC) and Environment Generator (EG)?
EC – It is defined as a group of environments.
EG – It selects the environment from environment class in which the agent has to Run.
27. What is the structure of intelligent Agent?
Intelligent Agent = Architecture + Agent Program
28. Define problem solving agent.
Problem solving agent is one kind of goal-based agent, where the agent Should select one
action from sequence of actions which lead to desirable states.
29. List the steps involved in simple problem-solving technique.
1. Goal formulation
2. Problem formulation
3. Search
4. Solution
5. Execution phase
30. What are the different types of problem?
Single state problem, multiple state problems, Contingency problem, Exploration problem.
31. What are the components of a problem?
They are
1. initial state
2. Successor function
3. Goal test
4. Path cost
5. Operator
6. state space
7. path

32. Define State Space.


The set of all possible states reachable from the initial state by any sequence of action is called
state space.
33. Define Path.
A path in the state space is a sequence of state connected by sequence of actions.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 3 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

34. Define Path Cost.


A function that assigns a numeric cost to each path, which is the sum of the cost of each action
along the path.
35. Give example problems for Artificial Intelligence.
1. Toy problems
2. Real world problems
36. Give example for real world end toy problems. Real world problem examples:
1. Airline travel problem.
2. Touring problem.
3. Traveling salesman problem.
4. VLSI Layout problem
5. Robot navigation
6. Automatic Assembly
7. Internet searching
Toy problem Examples:
1. Vacuum world problem.
2. 8 – Queen problem
3. 8 – Puzzle problem
37. Define search tree.
The tree which is constructed for the search process over the state space is called search tree.
38. Define search node.
The root of the search tree that is the initial state of the problem is called search node.
39. Define fringe.
The collection of nodes that have been generated but not yet expanded, this collection is called
fringe or frontier.
40. List the performance measures of search strategies.
1. Completeness
2. Optimality
3. Time complexity
4. Space complexity
41. Define branching factor.
The number of nodes which is connected to each of the node in search tree is called Branching
factor.
42. Differentiate Blind Search and Heuristic Search.
Blind search
➢ No information about the path cost m the current state to goal state.
➢ Problem is solved with the information we which we know.
➢ Example
✓ Breadth first search
✓ Uniform cost search
✓ Depth first Search
✓ Depth limited search

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 4 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

✓ Iterative deepening search


✓ Bi – Directional Search
Heuristic search
➢ We have some information path caused to move like minimum
➢ Problem can be solved by the information which is already given.
➢ Example
✓ Best first search
✓ Greedy search
✓ A* search
43. Define Backtracking search.
The variant of depth first search called backtracking search. Only one successor is generated
at a time rather than all successor, partially expanded node remembers which successor
generate next is called Backtracking search.
44. Define Uniform cost search.
Uniform cost search expands the node ‘n’ with the lowest path cost instead of expanding the
shallowest node.
45. Define Depth first search.
It expands the deepest node in the current fringe of the search tree.
46. Define depth limited search.
The problem of unbounded trees can be avoided by supplying depth limit 1(i.e.) nodes at depth
1 are treated as if they have no successors. This is called Depth Limited search.
47. What is informed search?
One that uses problem – specific knowledge beyond the definition of the problem itself and it
can find solutions more efficiently than an uninformed strategy.
48. What is the use of QUEUING_FN?
QUEUING_FN inserts asset of elements into the queue. Different varieties of queuing fn
produce different varieties of the search algorithm.
49. Mention the criteria for the evaluation of search strategy.
There are 4 criteria:
➢ Completeness,
➢ time complexity,
➢ space complexity,
➢ optimality
50. List the various search strategies.
1. BFS
2. Uniform cost search
3. DFS
4. Depth limited search
5. Iterative deepening search
6. Bidirectional search
51. List the various informed search strategy.
Informed search algorithms use domain knowledge. In an informed search, problem
information is available which can guide the search. Informed search strategies can find a

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 5 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

solution more efficiently than an uninformed search strategy. Informed search is also called a
Heuristic search. A heuristic is a way which might not always be guaranteed for best solutions
but guaranteed to find a good solution in reasonable time. Informed search can solve much
complex problem which could not be solved in another way.
An example of informed search algorithms is a traveling salesman problem.
➢ Greedy Search
➢ A* Search
52. What is Best First Search?
Best First Search is an instance of the general TREE SEARCH or GRAPH SEARCH algorithm
in which a node is selected for expansion based on an evaluation function, f(n).
53. Define Evaluation function, f(n).
A node with the lowest evaluation is selected for expansion, because evaluation measures
distance to the goal.
54. Define Heuristic function, h (n).
h (n) is defined as the estimated cost of the cheapest path from node n to a goal node.
55. Define Greedy Best First Search.
It expands the node that is closest to the goal (i.e.) to reach solution in a quicker way. It is done
by using the heuristic function: f(n) = h(n).
56. Define A* search.
A* search evaluates nodes by combining g(n), the cost to reach the node and h(n), the cost to
get from the node to the goal.
f(n) = g(n) + h(n)
57. Define Admissible heuristic h (n).
In A* search, if it is optimal then, h(n) is an admissible heuristic which means h(n) never
overestimates the cost to reach the goal.
58. What is triangle inequality?
It states that each side of a triangle cannot be longer than the sum of the other two slides of
the triangle.
59. What are the 2 types of memory bounded heuristic algorithms?
1. Recursive Best First Search(RBFS)
2. Memory bounded A*(MA*)
60. Differentiate BFS & DFS.
BFS means breath wise search. Space complexity is more. Do not give optimal solution
Queuing fn is same as that of queue operator
DFS means depth wise search. Space complexity is less Gives optimal solution Queuing fn is
somewhat different from queue operator.
61. What is RBFS?
It keeps track of the f-value of the best alternative path available from any ancestor of the
current node. RBFS remembers the f-value of the best leaf in the forgotten sub tree and
therefore decide whether its worth re expanding the sub tree sometimes later.
62. Define iterative deepening search.
Iterative deepening is a strategy that sidesteps the issue of choosing the best depth limit by
trying all possible depth limits: first depth 0, then depth 1, then depth 2& so on.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 6 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

63. What are the 2 ways to use all available memory?


1. Memory bounded A*(MA*)
2. Simplified Memory bounded A*(SMA*)
64. What is SMA* search?
SMA* expands the best leaf until memory is full and it drops the oldest worst leaf node and
expands the newest best leaf node.
65. What is called as bidirectional search?
The idea behind bidirectional search is to simultaneously search both forward from the initial
state & backward from the goal & stop when the two searches meet in the middle.
66. What is metalevel state space?
Each state in a metalevel state space captures the internal state of a program that is searching
in an object level state space.
67. What is Manhattan distance, h2?
The sum of the horizontal and vertical distances of the tiles from their goal positions in a 15-
puzzle problem is called Manhattan distance (or) city block distance.
68. Give the drawback of DFS.
The drawback of DFS is that it can get stuck going down the wrong path. Many problems have
very deep or even infinite search tree. So DFS will never be able to recover from an unlucky
choice at one of the nodes near the top of the tree. So DFS should be avoided for search trees
with large or infinite maximum depths.
69. Define Branching factor b*.
Uniform tree of depth d would have to be in order to contain N+1 nodes is called branching
factor.
70. Write the time & space complexity associated with depth limited search.
Time complexity =O (bd),
Space complexity=o (bl)
b-branching factor, d-depth of tree
71. What is local search?
It operates using a single current state rather than multiple paths and generally moves only to
neighbours of that state.
72. Define Optimization Problems.
The aim of this problem is to find the best state according to an objective function.
73. What are the 2 parts of Landscape?
➢ Location defined by the state.
➢ Elevation defined by the value of the heuristic cost function (or) objective function.
74. Define Global minimum.
If elevation corresponds to cost, then the aim is to find the lowest valley is called global
minimum.
75. Define Global Maximum.
If elevation corresponds to an objective function, then the aim is to find the highest peak is
called global maximum.
76. Define Hill Climbing search.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 7 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

It is a loop that continually moves in an increasing value direction (i.e.) up hill and terminates
when it reaches a “peak” where no neighbour has a higher value.
77. List some drawbacks of hill climbing process.
Local maxima: A local maxima as opposed to a goal maximum is a peak that is lower that the
highest peak in the state space. Once a local maxima is reached the algorithm will halt even
though the solution may be far from satisfactory.
Plateaux: A plateaux is an area of the state space where the evaluation fn is essentially flat.
The search will conduct a random walk.
78. What is the meaning for greedy local search?
It goals (picks) a good neighbour state without thinking ahead about where to go next.
79. Define Local maxima.
A local maximum is a peak that is higher than each of its neighbouring states, but lower than
the global maximum.
80. What are the variants of hill climbing?
1. Stochastic hill climbing
2. First choice hill climbing
3. Simulated annealing search
4. Local beam search
5. Stochastic beam search
81. Define annealing.
Annealing is the process used to harden metals (or) glass by heating them to a high
temperature and then gradually cooling them, thus allowing the material to coalesce into a low
energy crystalline state.
82. Define simulated annealing.
This algorithm, instead of picking the best move, it picks a random move. If the move improves
the situation, it is always accepted.
83. What is the advantage of memory bounded search techniques?
We can reduce space requirements of A* with memory bounded algorithm such as IDA* &
SMA*.
84. Give the procedure of IDA* search.
Minimize f(n)=g(n)+h(n) combines the advantage of uniform cost search + greedy search A* is
complete, optimal. Its space complexity is still prohibitive.
Iterative improvement algorithms keep only a single state in memory, but can get stuck on local
maxima. In this algorithm each iteration is a DFS just as in regular iterative deepening. The
depth first search is modified to use an f-cost limit rather than a depth limit. Thus, each iteration
expands all nodes inside the contour for the current f-cost.
85. List some properties of SMA* search.
➢ It will utilize whatever memory is made available to it.
➢ It avoids repeated states as for as its memory allow.
➢ It is complete if the available memory is sufficient to store the shallowest path.
➢ It is optimal if enough memory is available to store the shallowest optimal solution path.
Otherwise, it returns the best solution that can be reached with the available memory.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 8 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

When enough memory is available for entire search tree, the search is optimally efficient.
➢ Hill climbing.
➢ Simulated annealing.
86. What are Genetic Algorithms?
Genetic Algorithm is a variant of stochastic beam search in which successor states are
generated by combining two parent states, rather than by modifying a single state.
87. Define CSP.
Constraint Satisfaction problem (CSP) is defined by a set of variables X1,X2,…Xn and set of
constraints C1,C2,…Cm.
88. Define Successor function.
A value can be assigned to any unassigned variable, provided that does not conflict with
previously assigned variables.
89. Define Tree decomposition.
The constraint graph is divided into a set of connected sub problems. Each sub problem is
solved independently and the resulting solutions are then combined. This process is called tree
decomposition.
90. Define Alpha beta pruning.
Alpha beta pruning eliminates away branches that cannot possibly influence the final decision.
91. Define FOL.
FOL is a first order logic. It is a representational language of knowledge which is powerful than
propositional logic (i.e.) Boolean Logic. It is an expressive, declarative, compositional
language.
92. Define a knowledge Base:
Knowledge base is the central component of knowledge base agent and it is described as a
set of representations of facts about the world.
93. With an example, show objects, properties functions and relations.
Example
“EVIL KING JOHN BROTHER OF RICHARD RULED ENGLAND IN 1200”
Objects : John, Richard, England, 1200
Relation : Ruled
Properties : Evil, King
Functions : BROTHER OF
94. Define a Sentence?
Each individual representation of facts is called a sentence. The sentences are expressed in a
language called as knowledge representation language.
95. Define an inference procedure
An inference procedure reports whether or not a sentence is entitled by knowledge base
provided a knowledge base and a sentence. An inference procedure ‘i’ can be described by
the sentences that it can derive. If i can derive from knowledge base, we can write. KB --Alpha
is derived from KB or i derives alpha from KB.
96. Define Ontological commitment.
The difference between propositional and first order logic is in the ontological commitment. It
assumes about the nature of reality.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 9 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

97. Define Epistemological commitment.


The logic that allows the possible states of knowledge with respect to each fact.
98. Define domain and domain elements.
The set of objects is called domain, sometimes these objects are referred as domain elements.
99. What are the three levels in describing knowledge-based agent?
1. Logical level
2. Implementation level
3. Knowledge level or epistemological level
100. Define Syntax?
Syntax is the arrangement of words. Syntax of a knowledge describes the possible
configurations that can constitute sentences. Syntax of the language describes how to make
sentences.
101. Define Semantics
The semantics of the language defines the truth of each sentence with respect to each possible
world. With this semantics, when a particular configuration exists within an agent, the agent
believes the corresponding sentence.
102. Define Logic
Logic is one which consist of
➢ A formal system for describing states of affairs, consisting of
1. Syntax
2. Semantics.
➢ Proof Theory
1. a set of rules for deducing the entailment of a set sentences.
103. What are the 3 types of symbols which is used to indicate objects, relations and functions?
1. Constant symbols for objects
2. Predicate symbols for relations
3. Function symbols for functions
104. Define terms.
A term is a logical expression that refers to an object. We use 3 symbols to build a term.
105. Define Atomic sentence.
Atomic sentence is formed by both objects and relations.
Example
Brother (William, Richard) William is the brother of Richard.
106. Define Quantifier and its types.
Quantifiers are used to express properties of entire collection of objects rather than
representing the objects by name.
Types:
1. Universal Quantifier
2. Existential Quantifier
3. Nested Quantifier.
107. What are the two we use to query and answer in knowledge base?
ASK and TELL.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 10 of 12


Artificial Intelligence (AI) 5th Semester (P22CS5034)

108. Define kinship domain.


The domain of family relationship is called kinship domain which consists of objects unary
predicate, binary predicate, function, relation.
109. Define syntactic sugar.
Extension to the standard syntax (i.e.) procedure that does not change the semantics (i.e.)
meaning is called syntactic sugar.
110. Define synchronic and diachronic sentence.
Sentences dealing with same time are called synchronic sentences. Sentences that allow
reasoning “a cross time” are called diachronic sentence.
111. What are the 2 types of synchronic rules?
1. Diagnostic rules
2. Casual rules.
112. Define skolem constant.
The existential sentence says there is some object satisfying a condition, and the instantiation
process is just giving a name to that object. That name must not belong to another object. The
new name is called skolem constant.
113. What is truth Preserving
An inference algorithm that derives only entailed sentences is called sound or truth preserving.
114. Define a Proof
A sequence of application of inference rules is called a proof. Finding proof is exactly finding
solution to search problems. If the successor function is defined to generate all possible
applications of inference rules then the search algorithms can be applied to find proofs.
115. Define a Complete inference procedure
An inference procedure is complete if it can derive all true conditions from a set of premises.
116. Define Interpretation
Interpretation specifies exactly which objects, relations and functions are referred to by the
constant predicate, and function symbols.
117. Define Validity of a sentence
A sentence is valid or necessarily true if and only if it is true under all possible interpretation in
all possible world.
118. Define Satisfiability of a sentence
A sentence is satisfiable if and only if there is some interpretation in some world for which it is
True.
119. Define true sentence
A sentence is true under a particular interpretation if the state of affairs it represents is the
case.
120. What are the basic Components of propositional logic?
Logical Constants (True, False)
121. Define Modus Ponen’s rule in Propositional logic?
The standard patterns of inference that can be applied to derive chains of conclusions that lead
to the desired goal is said to be Modus Ponen’s rule.
122. Define AND –Elimination rule in propositional logic
Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 11 of 12
Artificial Intelligence (AI) 5th Semester (P22CS5034)

AND elimination rule states that from a given conjunction it is possible to inference any of the
conjuncts. OR-Introduction rule states that from, a sentence, we can infer its disjunction with
anything.
123. Define Unification.
Lifted Inference rule require finding substitutions that make different logical expressions look
identical (same). This is called Unification.
124. Define Occur check.
When matching a variable in 2 expressions against a complex term, one must check whether
the variable itself occurs inside the term, If it does the match fails. This is called occur check.
125. Define pattern matching.
The inner loop of an algorithm involves finding all the possible unifiers with facts in the KB. This
is called pattern matching.
126. Explain the function of Rete Algorithm?
This algorithm preprocess the set of rules in KB to constant a sort of data flow network in which
each node is a literals from rule a premise.
127. Define magic set.
To rewrite the rule set, using information from the goal, so that only relevant variable bindings
called magic set.
128. Define backward chaining.
This algorithm works backward from the goal, chaining through rules to find known facts that
support the proof.
129. Define Prolog program.
It is a set of definite clauses written in a notation somewhat different from standard FOL.

Dr. R. Girisha, Professor, Dept. of CSE, PESCE, Mandya Page 12 of 12

You might also like