The Strategic Computing Program is a project of the:

Defense Advanced Research Projects Agency

Which of the following are true about the planning graph?

The propositions in a layer combine with each other to form a state

An evaluation function is needed in a game like Chess because

game tree is too big to be fully explored&we need to evaluate non-leaf node

An ant in Ant Colony Optimization algorithm for TSP produces a tour by

a stochastic greedy constructive method

Isaac Asimov's “Three Laws of Robotics” _______________________

were designed to protect humans from robots

We say that a state S is progressed through the action a to state S'

S’ = {S - effects−−(a)} ⋃ effects++(a)

The action A0A0 in a partial plan

is a dummy action whose effects are the start state propositions

The relation between the pheromone deposited by an ant on an edge and cost of tour generated by it in the ACO algorithm?

Pheromone deposited each tour is inversely proportional to cost of tour

The most general definition of a machine is that it is _______________________

a device that is controlled by a set of rules or instructions

A genetic algorithm (GA) for optimization is most likely to succeed given _______________

a large diverse population of fit individuals

Representing your problem with variable and parameter

The start node in the plan space search represents

always contains exactly two actions

The action A∞A∞ in a partial plan

is a dummy action whose preconditions are the goal state propositions

The “Turing Test” is _______________________

a test of whether a machine is intelligent prescribed by Turing

“The Imitation Game” is _______________________

a test for intelligence devised by Alan Turing

"Shakey" was______________

a mobile robot built in the Stanford Research Institute

When the algorithms MiniMax, AlphaBeta and SSS* search a game tree with k-ply lookahead

They compute the same minimax value

studbud

Artificial intelligence

75 termsStudBud Administration218 plays

Imported from external platform

Flashcards75 cardsFPractice quizPHost liveL

Questions 75

Answers

1
The Strategic Computing Program is a project of the:
None of the above
National Science Foundation
Defense Advanced Research Projects Agency
Jet Propulsion Laboratory
2
The field that investigates the mechanics of human intelligence is
psychology
History
cognitive science
sociology
3
Which of the following are true about the planning graph?
All actions in a layer in the planning graph can be executed simultaneosly
The propositions in a layer combine with each other to form a state
All the propositions in a layer in the planning graph constitute a state
All propositions in layer in the planning graph can be true simultaneously
4
Decision support programs are designed to help managers make:
business decisions
budget projections
vacation schedules
visual presentations
5
An evaluation function is needed in a game like Chess because
game tree is too big to be fully explored&we need to evaluate non-leaf node
even though,game tree can be fully explored we can still harness knowledge
to be able to generate an explanation for the move played by the computer
none of the above
6
An ant in Ant Colony Optimization algorithm for TSP produces a tour by
a stochastic perturbation of the previous tour
a deterministic perturbation of the previous tour
a stochastic greedy constructive method
a deterministic greedy constructive method
7
The space explored in Plan Space Planning (PSP)
contains both states and actions
contains only states
contains plans
contains only actions
8
We call programs intelligent if they exhibit human behaviours.
False
True
9
A search node in Plan Space Planning (PSP) consists of
a list of states explored
a partial plan
the current state
the goal state
10
Isaac Asimov's “Three Laws of Robotics” _______________________
none of the above
were designed to protect humans from robots
are analogous to the four laws of thermodynamics
are laws laid down by the Supreme Court
11
In Plan Space Planning the producer-consumer relationship is represented by _________________
a threat
a casual link
a binding constraint
an ordering constraint
12
Which is not the commonly used programming language for AI?
LISP
Perl
PROLOG
Java
13
One of the leading American robotics centers is the Robotics Institute located at:
RAND
CMU
MIT
None of the above
14
We say that a state S is progressed through the action a to state S'
S’ = {S - effects−−(a)} ⋃ effects++(a)
S’ = {S - effects−−(a)} ⋂ effects++(a)
S = {S - effects−−(a)} ⋃ effects++(a)
S = {S - effects−−(a)} ⋂ effects++(a)
15
AI has its expansion in which of the following applications?
Game Playing
All the above
Diagonosis
Planning and scheduling
16
The action A0A0 in a partial plan
is always exactly the same in all planning problems
is a dummy action whose effects are the start state propositions
is always a dummy action with no preconditions and no effects
is a dummy action whose preconditions are start state propositions
17
Who is called the grandfather of AI?
Thomas hobbes
Gallileo Gallilei
Alan Turing
John MCarthy
18
The relation between the pheromone deposited by an ant on an edge and cost of tour generated by it in the ACO algorithm?
Pheromone deposited each tour is inversely proportional to cost of tour
The pheromone deposited on each edge depends upon the length of that edge
Pheromone deposited on each edge is directly proportional to cost of tour
The pheromone deposited on each edge is constant
19
The most general definition of a machine is that it is _______________________
a device that converts electrical energy into kinetic energy
a device that converts potential energy into kinetic energy
a device that is controlled by a set of rules or instructions
a device made of metal
20
A genetic algorithm (GA) for optimization is most likely to succeed given _______________
a large diverse population of fit individuals
a small population of fit and similar individuals
a small diverse population of fit individuals
a large population of fit and similar individuals
21
Which search method takes less memory?
Breadth first search
Linear search
Depth First search
Optimal search
22
A network with named nodes &labelled arcs that can be used to represent certain natural language grammars to facilitate
parsing transition network
parsing star network
parsing Tree network
parsing complete network
23
Rational agent is the one who always does the right thing.
True
False
24
In searle's thought experiment, manipulating symbols is not enough to pass the Turing test.
False
True
25
What is state space?
The whole problem
Your definition to a problem
Problem you design
Representing your problem with variable and parameter
26
Which of the following is the most expensive phase in the working of a rule-based system?
Generating the Rete network of rules
Resolving conflict set to select a rule with its data
Execute the rule selected from the conflict set
Matching WMEs with rules
27
Natural language processing is divided into the two subfields of
algorithmic and heuristic
time and motion
understanding and generation
symbolic and numberic
28
The start node in the plan space search represents
contains all actions applicable in the start state
contains all actions relevant to the goal state
always contains exactly two actions
is always empty set
29
A problem in a search space is defined by one of these state .
Initial state
All the above
Intermediate state
Last state
30
A bi-directional feedback loop links computer modelling with :
heuristic processing
human intelligence
artificial science
cognitive science
31
The action A∞A∞ in a partial plan
is a dummy action whose preconditions are the goal state propositions
is a dummy action whose effects are the goal state propositions
is always a dummy action with no preconditions and no effects
is always exactly the same in all planning problems
32
In LISP,the function X(x).(2x+I) would be rendered as
(lambda (x) (+1 (* 2x)
(lambda (x) (+(*2 x)l))
(* lambda(x) (+2x1)
(+ lambda (x) 1 (*2x))
33
visual clues that are helpful in computer vision include:
height and weight
both a and b
depth and texture
colour and motion
34
The “Turing Test” is _______________________
none of the above
a test devised by Alan Turing to determine whether a secret code is breaka
a test to determine whether a Turing Machine will halt
a test of whether a machine is intelligent prescribed by Turing
35
“The Imitation Game” is _______________________
none of the above
a game played by students pretending to be teachers
a game in which one player imitates the other
a test for intelligence devised by Alan Turing
36
What is the main task of a problem-solving agent?
both the above
To find out which sequence of action will get it to the goal state
none
solve the given problem and reach to goal
37
Which of the following is complete in a finite search space?
Best first search
none of the above
Beam search with beam width=4
Hill climbing
38
What is the major component/s for measuring the performance of problem solving?
All the above
Optimality
completeness
Time and space complexity
39
Prior to the invention of time sharing, the prevalent method of computer access was:
telecommunication
All of the above
remote access
batch processing
40
Web crawler is a/an ____________
Problem-solving agent
Model based agent
Simple reflex agent
Intelligent goal-based agent
41
Ambiguity may be caused by:
unclear antecedents
syntactic ambiguity
All the above
mulmultiple word meanings
42
"Shakey" was______________
none of the above
an algorithm to filter out prime numbers using the Sieve of Eratosthenes
a mobile robot built in the Stanford Research Institute
the title of a book questioning the posibility of creating an AI
43
Strong AI
claims that the computer can think
both a and c
claims that humans cannot think
claims that we can create minds
44
An AI technique that allows computer to understand associations and relationship between objects &events is called:
heuristic processing
pattern matching
relative symbolism
cognitive science
45
In LISP,the addition 3+2 is entered as
3+2=
(+3 2)
3+2
3 add 2
46
A problem is first connected to its proposed solution during the ______stage
implementation
conceptualization
identification
formalisation
47
__________is an extreme of exploitation and ___________ is an extreme of exploration
Random Walk, Hill Climbing
Hill Climbing, Random Walk
Simulated Annealing, Tabu Search
Tabu Search, Simulated Annealing
48
The explanation facility of an expert system may be used to
construct a diagnostics model
expedite the debugging process
both b and c
explain the system's reasoning process
49
A process that is repeated,evaluated,and refined is called:
descriptive
diagonostic
iterative
interpretive
50
In LISP, the function returns the first element of a list Is
first
set
None of the above
car
51
When the algorithms MiniMax, AlphaBeta and SSS* search a game tree with k-ply lookahead
None of the above
SSS* computes a more accurate values because it searches in a BFS manner
MiniMax computes a more accurate value because it searches the entire tree
They compute the same minimax value
52
In reality the “Von Kempelen's Chess Playing Turk” was _______________________
none of the above
a chess playing machine with a human hidden inside
a chess playing machine with a human hidden inside
a chess playing autonomous machine
53
Which type of actuator generates a good deal of power but tends to be messy?
Pneumatic
Hydraulic
Electric
None of the above
54
The basic idea behind Genetic Algorithms is to work with a population
of problem solvers each of which does an independent heuristic search
of problem solvers that interact with each other through signs
of candidate solutions to try and create better candidates by mixing genes
of candidate solutions in which each candidate is heuristically refined
55
Nils Nilsson headed a team at SRI that created a mobile robot named:
vax
Shakey
Dedalus
Robitics
56
In which of the following areas may ICAI programs prove to be useful?
All the above
department of Defence
corporations
educational institutions
57
In a rule-based system, procedural domain knowledge is in the form of:
meta-rules
producing rules
None of the above
rule interpreters
58
The motivation behind employing Rete algorithm is
to reduce the space complexity of long term memory
to generate the Rete network of rules
to select a rule with its data from the conflict set
to improve upon the process of matching WMEs with rules
59
Progression operation is _________ over state space where as Regression operation is __________ over state space
complete,sound
Not closed,closed
closed,not closed
sound,complete
60
Weak AI is the view that computer models can be a useful way of studying the mind.
True
False
61
The field that investigates the mechanics of human intelligence is:
none of the above
cognitive science
psychology
history
62
To invoke the LISP system, you must enter
LISP
both b and c
CL(common LISP)
AI
63
The process of removing detail from a given state representation is called _____________
Information Retrieval
Abstraction
Extraction
Mining of data
64
Agents behaviour can be described by __________________
Perception sequence
Environment in which agent is performing
Agent function
Sensors and actuators
65
The person who is often referred to as the “first programmer” is _______________________
Charles Babbage
Lady Ada Lovelace
Thomas Hobbes
Alan Turing
66
What is the term used for describing the judgmental or commonsense part of problem solving?
Value based
Critical
Analytical
Heuristic
67
Who said the following? - “Thoughts themselves are symbolic representations”
Galileo Galilei
Rene Descartes
Issac Newton
Gotfried Wilhelm von Leibniz
68
Weak AI is
All the above
study of mental faculties through mental models, implemented on a computer
the embodiment of human intellectual capabilities within a computer.
a set of computer programs produces output reflecting intelligence
69
The name “Artificial Intelligence” was first coined by _______________________
David Hume
John McCarthy
Lady Ada Lovelace
Thomas Hobbes
70
A problem solving approach works well for _______________
Mars Hover(Robot navigation)
Finding a optimal path from a given source to a destination
8-queen problem
8-puzzle problem
71
High-resolution,bit-mapped displays are useful for displaying
clearer characters
more characters
All the above
Graphics
72
Performance measures are fixed for all agents.
False
True
73
The new organization established to implement the Fifth Generation Project is called:
Institute for new generation computer technology
Ministry of International Trade and Industry
Micro-electronics and Computer Technology Corporation
none of the above
74
A computer program that contains expertise in a particular domain is called an:
automatic processor
intelligent planner
expert system
None of the above
75
Which is the best way to go for Game playing problem?
Heuristic approach
Linear approach
Random approach
An Optimal approach

Artificial intelligence Flashcards | StudBud