Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

CS8691 AI Model Exam Answer Key

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 6

LOYOLA INSTITUTE OF TECHNOLOGY AND SCIENCE,THOVALAI

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


Sixth Semester (III CSE)

CS8691 Artificial Intelligence –Answer Key

(Regulations 2017)
Time: 3 Hours Answer ALL Questions Max. Marks 100
PART- A (10 x 2 = 20 Marks)

1.
What are the applications of AI?
i. Airline travel problem.
ii. Touring problem.
iii. Traveling salesman problem.
iv. VLSI Layout problem
v. Robot navigation
vi. Automatic Assembly
vii. Internet searching
2.
Name the elements of an agent and list out the characteristics of Intelligent agent.
 Situatedness
The agent receives some form of sensory input from its environment, and it performs some action
that changes its environment in some way. Examples of environments: the physical world and the
Internet.
 Autonomy
The agent can act without direct intervention by humans or other agents and that it has control
over its own actions and internal state.
 Adaptivity
The agent is capable of (1) reacting flexibly to changes in its environment; (2) taking goal-
directed initiative (i.e., is pro-active), when appropriate; and (3) learning from its own
experience, its environment, and interactions with others.
 Sociability
The agent is capable of interacting in a peer-to-peer manner with other agents or humans.
3.
Differentiate between uninformed and informed search algorithms.
 An uninformed search is a searching technique that has no additional information about the
distance from the current state to the goal.
 Informed Search is another technique that has additional information about the estimate distance
from the current state to the goal.
4.
List out the classification of CSP with respect to constraints.
There are 5 types,
a. Unary constraints relates one variable.
b. A binary constraint relates two variables.
c. Higher order constraints relate more than two variables.
d. Absolute constraints.
e. Preference constraints.
5.
Compare forward chaining and backward chaining.
 Forward chaining as the name suggests, start from the known facts and move forward by applying
inference rules to extract more data, and it continues until it reaches to the goal, whereas backward
chaining starts from the goal, move backward by using inference rules to determine the facts that
satisfy the goal.
 Forward chaining is called a data-driven inference technique, whereas backward chaining is called a
goal-driven inference technique.
6.
What are the elements and symbols of first order logic?
Symbols and Interpretations:
• The basic syntactic elements of first-order logic are the symbols that stand for objects, relations
and functions
Kinds of Symbols
• The symbols come in three kinds namely,
 Constant Symbols standing for Objects (Ex:- Richard)
 Predicate Symbols standing for Relations (Ex:- King)
 Function Symbols stands for functions (Ex:- LeftLeg)
7.
What is a software agent?
Agent architectures, like software architectures, are formally a description of the elements from
which a system is built and the manner in which they communicate. Further, these elements can be
defined from patterns with specific constraints
8.
What do you understand about the term agent communication?
In the domain of multi-agent systems, communication is an important characteristic to support both
coordination and the transfer of information. Agents also require the ability to communicate actions
or plans. But how the communication takes place is a function of its purpose.
1. Agents communicate in order to achieve better the goals of themselves or of the society/system in
which they exist.
2. Communication can enable the agents to coordinate their actions and behavior, resulting in
systems that are more coherent.
9.
State the advantages of horizontal layered architectures.
In horizontally layered architectures (Figure 1.6(a)), the software layers are each directly connected
to the sensory input and action output. In effect, each layer itself acts like an agent,producing
suggestions as to what action to perform.
10.
Define Ontology.
The definition of Ontology states that it is the study of existence. Ontology is part of the school of
thought of philosophy and more closely a branch of metaphysics, which investigates the nature of
things including their cause and identity.

PART- B (5 x 16 = 80 Marks)

11. Define Artificial Intelligence (AI). Explain the techniques of AI and describe 16
the characteristics of AI.
Artificial Intelligence is the branch of computer science concerned with making computers
behave like humans.
Systems that think like humans Systems that think rationally
“The exciting new effort to make computers think “The study of mental faculties through the use of
… machines with minds,in the full and literal computer models.”
sense.”(Haugeland,1985) (Charniak and McDermont,1985)

Systems that act like humans Systems that act rationally


The art of creating machines that perform functions “Computational intelligence is the study of the
that require intelligence when performed by design of intelligent agents.”(Poole et al.,1998)
people.”(Kurzweil,1990)

12.
i) Define Heuristic search. What are the advantages of Heuristic search? 3

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
ii) Describe the mini max algorithm with an example. 13
An algorithm for minimax decision

function MINIMAX-DECISION (state) returns an action


inputs: state, current state in game
v <- MAX-VALUE(state)
return the action in SUCCESSORS(state) with value v

function MAX-VALUE(state) returns a utility value if TERMINAL-


TEST(state) then return UTILITY(state) v<- - ¥
for a, s in SUCCESSORS(state) do v <-
MAX(v, MIN-VALUE(s))
return v

function MIN-VALUE(state) returns a utility value


if TERMINAL-TEST(state) then return
UTILITY(state)
V <- 
for a, s in SUCCESSORS(state)do'
v <- MIN(v, MAX-VALUE(s))
return v
The minimax algorithm computes the minimax decision from the current
state. It uses a simple recursive computation of the minimax values of each
successor state, directly implementing the defining equations. The recursion
proceeds all the way down to the leaves of the tree, and then the minimax
values are backed up through the tree as the recursion unwinds.
For Example
13.
Consider the following sentences: 16
Marcus was a man
Marcus was a Pompeian
Marcus was born in 40 AD
All men are mortal
All Pompeian’s died the Volcano erupted in 79 AD
No mortal lives for more than 150 years
i). convert them to clause form.
ii). Answer the question “ is Marcus dead now” in two different
ways. Clearly state the assumption made.
14.
With diagrammatic representation, explain Trust and Reputation in Multi- 16
agent systems in detail.
Direct experiences are the most relevant and reliable information source for individual
trust/reputation
1. Type 1: Experience based on direct interaction with the
2. Type 1: Experience with the partner
1. Used by almost all models
2. How to:
• trust value about that partner increases with good experiences,
• it decreases with bad ones
3. Problem: how to compute trust if there is no previous interaction?
3. Type 2: Experience based on observed interaction of other members
4. Prior-derived: agents bring with them prior beliefs about strangers
Used by some models to initialize trust/reputation values
5. Group-derived:
6. Propagated:

15. Explain the concept of machine translation in detail. 16

Machine translation systems


All translation systems must model the source and target languages, but systems vary in the
type of models they use.Some systems attempt to analyze the source language text all the
way into an interlingua knowledge representation and then generate sentences in the target
language from that representation. This is difficult because it involves three
unsolved problems: creating a complete knowledge representation of everything; parsing
into that representation; anD generating sentences from that representation. Other systems are based on a
transfer model.
Statistical machine translation
1. Find parallel texts:
2. Segment into sentences:
3. Align sentences
4. Align phrases
5. Extract distortions
6. Improve estimates with EM

You might also like