Question

1.Who is the father of AI______

2.AI is perfectly suited to recommending products to______ customers
3.____are the devices which affect the environment
4.Utility describes how _____ the agent is.
A model-based agent can handle ____ environment by use of model about the wo
process of looking for action sequence is called as _____
7.____is an algorithm for traversing or searching a tree structure or graph
A* algorithm is similar to UCS except that it uses _____
A* search algorithm finds the _____ through the search space using the heuristic10.A ____ is an abstract data
structure that follows the first-in-first-out methodolog What is Artificial intelligence?
Artificial Intelligence has its expansion in the following application.
Agents behavior can be best described by ____________14. Rational agent is the one who always does the right
thing.
Performance Measures are fixed for all agents.
The Task Environment of an agent consists of ____________
Categorize Crossword puzzle in Fully Observable / Partially Observable. The
game of Poker is a single agent.
An agent is composed of ________
Which is not the commonly used programming language for AI?
What is rational at any given time depends on?
Which search strategy is also called as blind search?
How many types are available in uninformed search method?
Which search is implemented with an empty first-in-first-out queue?
When is breadth-first search is optimal?
How many successors are generated in backtracking search?
What is the space complexity of Depth-first search?
How many parts does a problem consists of?
Which algorithm is used to solve any kind of problem?
Which search algorithm imposes a fixed depth limit on nodes?
Which search implements stack operation for searching the states?

Answer
John McCarthy
E-commerce
Effectors
happy
partially observe
search DFS
g(n) + h(n) shortest path queue
Making a Machine intelligent
All of the mentioned
Agent function
TRUE
TRUE
All of the mentioned
Fully Observable
FALSE
Architecture and Program
Perl
All of the mentioned
Uninformed search
5
Breadth-first search
When all step costs are equal
1
O(bm)
4
Tree algorithm
Depth-limited search
Depth-first search