DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

Subject code: 21AID02 Branch/Year/Sem: AIDS/II/III

Subject Name: FOUNDATION OF ARTIFICIAL INTELLIGENCE Batch:2019-2023
Staff Name: K.SENTHILKUMARARAJA Academic year:2023-2024(ODD)

UNIT I INTRODUCTION

S.NO PART-A

What is AI?
Artificial Intelligence is the branch of computer science concerned with making
1 computers behave like humans. "the study and design of intelligent agents," where an
intelligent agent is a system that perceives its environment and takes actions which
maximize its chances of success.
 UNIT I INTRODUCTION

List out the applications of AI.

Autonomous planning,
2
Control and scheduling.
Game Playing and Robotics.

Define an agent.
An agent is anything that can be viewed as perceiving its environment through sensors
3
and
SENSOR acting upon that environment through actuators.

List the various type of agent program.

Simple reflex agent program.
Agent that keep track of the world.
4 Goal based agent program.
Utility based agent program.

Define Agent function

Mathematically speaking, we say that an agent's behavior is described by the agent
function
5 that maps any given percept sequence to an action.
 UNIT I INTRODUCTION

What is rational agent?

A rational agent is one that does the right thing-conceptually speaking; every entry in
6 the table for the agent function is filled out correctly.
 Obviously, doing the right thing is better than doing the wrong thing.
 The right action is the one that will cause the agent to be most successful.

List out the properties of task environments.

7 ● Fully observable vs. partially observable

● Deterministic vs. stochastic
● Episodic vs. sequential
● Static vs. dynamic
● Discrete vs. continuous
● Single agent vs. multiagent
 UNIT I INTRODUCTION

Compare single agent Vs multi agent

Single agent vs. multiagent.

8 ● An agent solving a crossword puzzle by itself is clearly in a single-agent

environment,
● Where as an agent playing chess is in a two-agent environment.
● Multiagent is further classified in to two ways
● Competitive multiagent environment
● Cooperative multiagent environment

Define Simple reflex agents

Simple reflex agents are based on condition-action rules, implemented with an
9
appropriate production system. They are stateless devices which do not have memory
of past world states.

Compare mapping actions to agents.

An agent program maps from percept to action and updates internal state.
- Reflex agents respond immediately to percepts.
10 • simple reflex agents
• model-based reflex agents
- Goal-based agents act in order to achieve their goal(s).
- Utility-based agents maximize their own utility function
 UNIT I INTRODUCTION

Define Omniscience agent.

An omniscient agent knows the actual outcome of its actions and can act accordingly;
11
but omniscience is impossible in reality. Doing actions in order to modify future
percepts-sometimes called information gathering-is an important part of rationality.

Agent Performanc Environments Actuators Sensors

Type e
Measure
Taxi Safe: fast, Roads,other Steering,acceler Cameras,sonar,
12 driver legal, traffic,pedestrians ator, Speedometer,G
comfortabl , customers brake, PS,
e trip, Signal,horn,disp Odometer,engin
maximize lay e
profits sensors,keyboar
ds, accelerator.

Give an example for Performance measures in agents

 UNIT I INTRODUCTION

Compare Deterministic vs. stochastic.

Deterministic vs. stochastic.
13  If the next state of the environment is completely determined by the current state
and the action executed by the agent, then we say the environment is deterministic;
 Otherwise, it is stochastic.

How to represent model reflex agent.

14

Classify the components used in learning elements.

A learning agent can be divided into four conceptual components, as,
• Learning element
15
• Performance element
• Critic
• Problem generator
 UNIT I INTRODUCTION

PART-B

1 Explain properties of environments.

2 Explain in detail the structure of different intelligent agents.

3 Define agents. Specify the PEAS measures with an example.

4 Explain the components of problem definition with an example.

 UNIT II PROBLEM SOLVING METHODS

S.NO PART-A

Define Uninformed Search Strategies

Uninformed Search Strategies have no additional information about states beyond
1 that provided in the problem definition.
✔ Strategies that know whether one non goal state is "more promising" than
another are called Informed search or heuristic search strategies.

Categorize the uninformed search strategies

There are five uninformed search strategies as given below.

2
● Breadth-first search
● Uniform-cost search
● Depth-first search
● Depth-limited search
● Iterative deepening search
● Bidirectional Search
 UNIT II PROBLEM SOLVING METHODS

Compare blind search& heuristic search

3
Blind search has no information about the no. of steps or the path cost from the
current state to the goal, they can distinguish a goal state from nongoal state.
Heuristic search knowledge given. Problem specification solution is best.

Compare BFS and DFS

List the time&space complexity associated with depth limited

search.
[CO2,L1,Apr/May-14]
5 Time complexity =O (bd) , b-branching factor, d-depth of tree
Space complexity=o (bl)

Whether uniform cost search is optimal? [CO2-L1-Apr/May-14]

Uniform cost search is optimal & it chooses the best solution
6
depending on the path
cost.
 UNIT II PROBLEM SOLVING METHODS

Describe CSP[CO2-L1-Apr/May-14]
A constraint satisfaction problem is a special kind of problem satisfies some
7 additional structural properties beyond the basic requirements for problem in general.
In a CSP; the states are Described by the values of a set of variables and the goal test
specifies a set of constraint that the value must obey.

Define heuristic function

8
A heuristic function or simply a heuristic is a function that ranks alternatives in
various search algorithms at each branching step basing on an available information
in order to make a decision which branch is to be followed during a search.

Define backtracking search

9
The term backtracking search is used for depth-first search that chooses values for
one variable at a time and backtracks when a variable has no legal values left to
assign.

What is Constraint propagation

10 Constraint propagation is the general term for propagating the implications of a
constraint on one variable onto other variables.
 UNIT II PROBLEM SOLVING METHODS

Describe iterative deepening search.

11
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.

What is called as bidirectional search?

12
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.

Explain depth limited search.

13
Depth limited avoids the pitfalls of DFS by imposing a cut off of the maximum depth
of a path. This cutoff can be implemented by special depth limited search algorithm
or by using the general search algorithm with operators that keep track of the depth.

Carryout the criteria for the evaluation of search strategy.

There are 4 criteria:
● Completeness
14
● time complexity
● space complexity
● optimality.
 UNIT II PROBLEM SOLVING METHODS

List the various informed search strategy.

● Best first search –greedy search

● A* search
● Memory bounded search-Iterative deepening A*search
● simplified memory bounded
15

● A*search Iterative improvement search –hill climbing

● simulated annealing.

PART-B

1 Explain BFS and DFS in detail.

 UNIT II PROBLEM SOLVING METHODS

2 Summarize the back tracking search for CSPs

3 Discuss in detail about the crypt arithmetic problems in CSPs.

4 Explain hill climbing in detail.

5 Discuss in detail about A* and AO*algorithm,

6 Discuss in detail about alpha-beta pruning process.

 UNIT III KNOWLEDGE REPRESENTATION

PART-A

Describe a Sentence.
Each individual representation of facts is called a sentence. The sentences are
1 expressed in a language called as knowledge representation language.

Define First Order Logic.

• First-order logic (FOL) models the world in terms of
– Objects, which are things with individual identities
2 – Properties of objects that distinguish them from other objects
– Relations that hold among sets of objects
– Functions, which are a subset of relations where there is only one “value” for
any given “input”

What are the types of Quantifiers?

3
Universal Quantifiers & Existential Quantifiers
 UNIT III KNOWLEDGE REPRESENTATION

What is Universal Quantification?

Universal quantification
4 a. x)P(x) means that P holds for all values of x in the domain associated with that

b. mammal(x)→x) dolphin(x) ∀E.g.,

variable∀(

Proposition symbols can be connected with Boolean connectives, to give more

complex meaning. Connectives ,
o Λ Logical Conjunction
5 o V Logical disjunction

o ⇔ Material Equivalence or Biconditional

o ¬ Negation

o ⇒ Material Implication or conditional

• Facts- truths in some relevant world. These are the things we want to
6 represent.
• Representation- These are the things we will actually be able to manipulate.
 UNIT III KNOWLEDGE REPRESENTATION

Define unification.
When attempting to match 2 literals, all substitutions must be made to the entire
7 literal. There may be many substitutions that unify 2 literals, the most general
unifier is always desired

Define Semantic Networks

In semantic net, information is represented as a set of nodes connected to each
8
other by a set of labelled arcs, which represent relationship among the nodes. In
this network, inheritance is used to derive the additional relation.

Define Forward Chaining.

The Generalized Modus Ponens rule can be used by Forward Chaining.
9  From the sentences in the KB which in turn derive new conclusions.
 Forward chaining is preferred when new fact is added to the database and we
want to generate its consequences.

What is Backward chaining?

10 Backward chaining is designed to find all answers to a question asked to the
knowledge base. Therefore it requires a ASK procedure to derive the answer.
 UNIT III KNOWLEDGE REPRESENTATION

What is prolog program?

A prolog program is described as a series of logical assertions each of which is a
11 Horn Clause.
 A Horn Clause is a Clause that has atmost one positive literal,
Example: - P, ¬PQ

What is Resolution?
Resolution is a complete inference procedure for first order logic
12
 Any sentence a entailed by KB can be derived with resolution
 Catch: proof procedure can run for an unspecified amount of time

How to represent categories of obtects?

13

● Predicates
● Objects
 UNIT III KNOWLEDGE REPRESENTATION

Define intrinsic and extrinsic property

14

● The property which describes a particle of an object.

● The property which describes a whole particle of an object.

How to represent mental events and objects

15
● Theory of beliefs
● Modal logic
● Syntactic theory

Define monotonic reasoning

monotonic reasoning attempts to formalie reasoning with incomplete
information.
16
(Ex) human reasoning is non-monotonic reasoning
Mathematic reasoning is monotonic reasoning
 UNIT III KNOWLEDGE REPRESENTATION

PART-B

1 Discuss in detail about First order logic with an example.

2 Explain unification algorithm in detail.

3 Explain in detail about forward and backward chaining in detail.

4 Define resolution. Explain resolution with an example.

5 Define events. Explain the necessity for mental events and objects in reasoning.

6 Illustrate the knowledge representation in detail.

 UNIT IV - SOFTWARE AGENTS

PART-A

Define Purely Reactive Agents.

A reactive system is one that maintains an ongoing interaction with its environment,
1 and responds to changes that occur in it (in time for the response to be useful)

State the advantage of vertically layered architecture.

Advantages
Low complexity.
2 If there are n layers there are n-1 interfaces between them.
If each layer is capable of suggesting m possible actions then there are at most
m2(n-1) interactions
No central control, no bottleneck in the agent’s decision making
 UNIT IV - SOFTWARE AGENTS

What are four classes of agents? Types of Agents

Agents can be grouped into four classes based on their degree of perceived
intelligence and capability :
• Simple Reflex Agents
3
• Model-Based Reflex Agents
• Goal-Based Agents
• Utility-Based Agents
• Learning Agent

Define belief-desire-intention (BDI) architectures

BDI agents
A BDI agent is a particular type of bounded rational software agent, imbued with
particular mental attitudes, viz: Beliefs, Desires and Intentions (BDI).
4 Belief-Desire-Intention (BDI) Architecture
The BDI architecture is based on practical reasoning by Bratman’s philosophical
emphasis on intentional stance (Bratman, 1987). Practical reasoning is reasoning
toward actions - the process of figuring out what to do. This is different from the
theoretical reasoning process as it derives knowledge or reaches conclusions by
using one’s beliefs and knowledge
 UNIT IV - SOFTWARE AGENTS

What are the two types of control flow within layered architectures?
There are two types of vertical layered architectures namely one-pass and two-pass
control architectures. In one-pass architecture, control flows from the initial layer
that gets data from sensors to the final layer that generates action output (see Figure
7). In two-pass architecture, data flows up the sequence of layers and control then
flows back down

5
 UNIT IV - SOFTWARE AGENTS

State the advantage of horizontal layered architectures.

The advantage of horizontal layer architecture is that only n layers are required for
mapping to n different types of behaviours.
 UNIT IV - SOFTWARE AGENTS

Define Agent Communication.

Components of communicating agents

communicating consists of the speaker and the hearer. Because for communication
to take place, the agent must be able to perform both these tasks. Both these
components can be further explained as follows on the basis of their functioning:
7
 UNIT IV - SOFTWARE AGENTS

Define the property of Coordination

 Coordination is a desired property in a Multiagent System

whose agents should perform complex tasks in a shared envi-
ronment.
 The degree of coordination in a Multiagent System de-
pends on:
-The inability of each individual agent to achieve the whole task(s)
-The dependency of one agent on others to achieve the tasks
-The need to reduce/optimize resource usage

-The need to avoid system halts The need to keep some conditions holding

8
 UNIT IV - SOFTWARE AGENTS

What are the three aspects to the formal study of communication?

Communications Process
Communications is a continuous process which mainly involves three elements viz.
sender, message, and receiver. The elements involved in the communication process
are explained below in detail:
1.Sender-The sender or the communicator generates the message and conveys it to
9
the receiver. He is the source and the one who starts the communication
2.Message-It is the idea, information, view, fact, feeling, etc. that is generated by the
sender and is then intended to be communicated further.
3.Receiver-He is the person who is last in the chain and for whom the message was
sent by the sender.

Define bargaining.
A bargaining problem deals with a situation where some players negotiate over
10 sharing a fixed sum of resources. There are two approaches to analyzing a
bargaining problem, namely the cooperative approach and the non-cooperative
approach

Define Speech acts

Speech acts are defined in terms of the effects of the cognitive state of the hearer
11 that are intended by the speaker. They are seen as parts of plans that the participants
find and execute Most other Artificial Intelligence (AI) work on speech acts is in the
area of Distributed AI.
 UNIT IV - SOFTWARE AGENTS

What is Knowledge Query and Manipulation Language?

The Knowledge Query and Manipulation Language, or KQML, is a language and
protocol for communication among software agents and knowledge-based systems.
12 It was developed in the early 1990s as part of the DARPA knowledge Sharing
Effort, which was aimed at developing techniques for building large-scale
knowledge bases which are shareable and reusable

What is Argumentation?
“A verbal and social activity of reason aimed at increasing (or decreasing) the
acceptability of a controversial standpoint for the listener or reader, by putting
13
forward a constellation of propositions (i.e. arguments) intended to justify (or refute)
the standpoint before a rational judge “the giving of reasons to support or criticize a
claim that is questionable, or open to doubt” .

Why do we need Agent Communication?

Multi agent systems allow distributed problem solving
This requires the agents to coordinate their actions
14
Agent communication facilitates this by allowing individual agents to interact
allows cooperation
allows information sharing
 UNIT IV - SOFTWARE AGENTS

PART-B

1 What are Abstract Architectures for Intelligent Agents and explain it in detail.

2 Negotiation and Bargaining theories in detail.

Briefly explain different communication levels

Define Agent Communication. Write a short note on coordination, Dimensions of

4
meaning and Message types

5 Compare and contrast about the negotiation and bargaining

6 Examine the Argumentation among Agents

 UNIT V APPLICATIONS

PART-A

Define communication.
Communication is the intentional exchange of information brought about by the
production and perception of signs drawn from a shared system of conventional
1
signs. Most animals use signs to represent important messages: food here, predator
nearby etc. In a partially observable world, communication can help agents be
successful because they can learn information that is observed or inferred by others.
 UNIT V APPLICATIONS

What is speech act?

What sets humans apart from other animals is the complex system of structured
messages known as language that enables us to communicate most of what we know
2 about the world. This is known as speech act.
Speaker, hearer, and utterance are generic terms referring to any mode of
communication.
The term word is used to refer to any kind of conventional communicative sign.

Define formal language.

A formal language is defined as a (possibly infinite) set of' strings. Each string is a
concatenation of terminal symbols, sometimes called words. For example, in the
language of first-order logic, the terminal symbols include A and P, and a typical
3 string is "P A Q." . Formal languages such as first-order logic
and Java have strict mathematical definitions. This is in contrast to natural
languages, such
as Chinese, Danish, and English, that have no strict definition but are used by a
community.
 UNIT V APPLICATIONS

Define a grammar.
A grammar is a finite set of rules that specifies a language. Formal languages always
have an official grammar, specified in manuals or books. Natural languages have no
official
4
grammar, but linguists strive to discover properties of the language by a process of
scientific
inquiry and then to codify their discoveries in a grammar.

What is parsing?
5 Parsing is the process of building a parse tree for an input string.The interior nodes
of the parse tree represent phrases and the leaf nodes represent words.

Define machine translation.

Machine translation is the automatic translation of text from one natural language
6 (the source) to another (the target). This process has proven to be useful for a
number of tasks such as Rough translation, Restricted-source translation, Pre-edited
translation
 UNIT V APPLICATIONS

List the characteristics of information retrieval.

 A document collection.
 A query posed in a query language.
7
 A result set
 presentation of the result set..

What is an Agglomerative clustering?

Agglomerative clustering: Agglomerative clustering creates a tree of clusters going
all the way down to the individual documents. We begin by considering each
document as a separate cluster. Then we find the two clusters that are closest to each
8
other according to some distance measure and merge these clusters into one. The
distance measure between two clusters can be the distance to the median of the
cluster. Agglomerative clustering takes time O(n2 ),where n is the number of
documents.
 UNIT V APPLICATIONS

Define Inforamtion extraction.

Information extraction is the process of creating database entries by skimming a text
9
and looking for occurrences of a particular class of object or event and for
relationships among those objects and event

What is an Acoustic model?

An acoustic model is created by taking audio recordings of speech, and their text
10 transcriptions, and using software to create statistical representations of the sounds
that make up each word. It is used by a speech recognition engine to recognize
speech.

List out the Speech Recognition style.

 Isolated-Understands separately spoken words

11  Connected-Allow multiple words
 Continuous-Recognize the natural, conventional speech we use in daily lives
 UNIT V APPLICATIONS

List out the applications of SR

Applications:
1.Dictation
12
2.Call centers and IVR systems.
3.Education
SRTools Kaldi,CMUSphinx,Julius,HTK,Simon

What is perception?
13 Perception is the process of acquiring ,interpreting, selecting and organizing sensory
information. Perception presumes sensation,whare various types of sensors each
convert type of simple signal into data of the system.

Define Non-linear planning

Non-linear planning
 This planning is used to set a goal stack and is included in the search space of
all possible subgoal orderings. It handles the goal interactions by interleaving
method.
Advantage of non-Linear planning
Non-linear planning may be an optimal solution with respect to plan length
14 Disadvantages of Nonlinear planning
It takes larger search space, since all possible goal orderings are taken into
consideration.
Complex algorithm to understand.
 UNIT V APPLICATIONS

PART-B

Discuss in detail about NLP and explain steps in it.

Explain about Robotics in AI and list

Discuss about planning and its types in detail.

4 Explain Information retrieval and Information extraction in detail

5 What is machine translation? Explain different types.