AI EXAM 1

How many categories are there in artificial intelligence? 1 2 3 4

4

How many types of informed search method are in artificial intelligence? 1 2 3 4

4

Which search is complete and optimal when h(n) is consistent? Best-first search Depth-first search Both Best-first & Depth-first search A* search

A* search

The process of removing detail from a given state representation is called______ Extraction Abstraction Information Retrieval Mining of data

Abstraction

A heuristic is a way of trying To discover something or an idea embedded in a program To search and measure how far a node in a search tree seems to be from a goal To compare two nodes in a search tree to see if one is better than another All of the mentioned

All of the mentioned

A problem solving approach works well for 8-Puzzle problem 8-queen problem Finding an optimal path from a given source to a destination Mars Hover (Robot Navigation) All of the mentioned

All of the mentioned

An 'agent' is anything that...? Perceives its environment through sensors and acting upon that environment through actuators Takes input from the surroundings and uses its intelligence and performs the desired operations A embedded program controlling line following robot All of the mentioned

All of the mentioned

Artificial Intelligence has its expansion in the following application. (Mark all that apply) Planning and Scheduling Game Playing Diagnosis All of the mentioned

All of the mentioned

The Task Environment of an agent consists of Sensors Actuators Performance Measures All of the mentioned

All of the mentioned

The following could be the approaches to Artificial Intelligence Strong Artificial Intelligence Weak Artificial Intelligence Applied Artificial Intelligence All of the mentioned

All of the mentioned

The following task/tasks Artificial Intelligence could not do yet Understand natural language robustly Web mining Construction of plans in real time dynamic systems All of the mentioned

All of the mentioned

The search strategy that uses a problem specific knowledge is known as Informed Search Best First Search Heuristic Search All of the mentioned

All of the mentioned

What among the following is/are the example of the intelligent agent/agents? Human Robot Autonomous Spacecraft All of the mentioned

All of the mentioned

What could possibly be the environment of a Satellite Image Analysis System? Computers in space and earth Image categorization techniques Statistical data on image pixel intensity value and histograms All of the mentioned

All of the mentioned

What is rational at any given time depends on The performance measure that defines the criterion of success The agent's prior knowledge of the environment The actions that the agent can perform All of the mentioned

All of the mentioned

The Face Recognition system is based on Strong Artificial Intelligence approach Weak Artificial Intelligence approach Cognitive Artificial Intelligence approach Applied Artificial Intelligence approach

Applied Artificial Intelligence approach

A* algorithm is based on Breadth-First-Search Depth-First -Search Best-First-Search Hill climbing

Best-First-Search

Which function will select the lowest expansion node at first for evaluation? Greedy best-first search Best-first search Depth-first search None of the mentioned

Best-first search

What kind of observing environments are present in artificial intelligence? Partial Fully Learning Both Partial & Fully

Both Partial & Fully

What are the composition for agents in artificial intelligence? Program Architecture Both Program & Architecture None of the mentioned

Both Program & Architecture

Which action sequences are used to achieve the agent's goal? Search Plan Retrieve Both Search & Plan

Both Search & Plan

An Artificial Neural Network Is based on Strong Artificial Intelligence approach Weak Artificial Intelligence approach Cognitive Artificial Intelligence approach Applied Artificial Intelligence approach

Cognitive Artificial Intelligence approach

What is meant by agent's percept sequence? Used to perceive the environment Complete history of actuator Complete history of perceived things None of the mentioned

Complete history of perceived things

Short Essay: What are two main factors that had slowed down AI's development in the past decades?

Computing Power Big Data

What is the rule of simple reflex agent? Simple-action rule Condition-action rule Simple & Condition-action rule None of the mentioned

Condition-action rule

Which is used to provide the feedback to the learning element? Critic Actuators Sensor None of the mentioned

Critic

The action of the Simple reflex agent completely depends upon Perception history Current perception Learning theory Utility functions

Current perception

Which search method takes less memory? Depth-First Search Breadth-First search Linear Search Optimal search

Depth-First Search

Which environment is called as semi dynamic? Environment does not change with the passage of time Agent performance changes Environment will be changed Environment does not change with the passage of time, but Agent performance changes

Environment does not change with the passage of time, but Agent performance changes

Heuristic function h(n) is ___ Lowest path cost Cheapest path from root to goal node Estimated cost of cheapest path from root to goal node Average path cost

Estimated cost of cheapest path from root to goal node

Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. Evaluation function returning lowest evaluation Evaluation function returning highest evaluation Evaluation function returning lowest & highest evaluation None of them is applicable

Evaluation function returning lowest evaluation

A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. True False

False

Uninformed search strategies are better than informed search strategies. True False

False

Categorize Crossword puzzle in Fully Observable / Partially Observable. Fully Observable partially Observable All of the mentioned None of the mentioned

Fully Observable

Which search method will expand the node that is closest/fastest to the goal? Best-first search Greedy best-first search A* search None of the mentioned

Greedy best-first search

Which is the best way to go for Game playing problem? Linear approach Heuristic approach (Some knowledge is stored) Random approach An Optimal approach

Heuristic approach (Some knowledge is stored)

In greedy approach evaluation function is Heuristic function Path cost from start node to current node Path cost from start node to current node + Heuristic cost Average of Path cost from start node to current node and Heuristic cost

Heuristic function

What is the other name of informed search strategy? Simple search Heuristic search Online search None of the mentioned

Heuristic search

Which search uses the problem specific knowledge beyond the definition of the problem? Informed search Depth-first search Breadth-first search Uninformed search

Informed search

Web Crawler is a/an Intelligent goal-based agent Problem-solving agent Simple reflex agent Model based agent

Intelligent goal-based agent

The performance of an agent can be improved by Learning Observing Perceiving None of the mentioned

Learning

Which is used to improve the agents performance? Perceiving Learning Observing None of the mentioned

Learning

In which agent does the problem generator is present? Learning agent Observing agent Reflex agent None of the mentioned

Learning agent

What is Artificial intelligence? Putting your intelligence into Computer Programming with your own intelligence Making a Machine intelligent Playing a Game

Making a Machine intelligent

Which search uses only the linear space for searching? Best-first search Recursive best-first search Depth-first search None of the mentioned

None of the mentioned

What is the space complexity of Greedy search? O(b) O(bl) O(m) O(bm)

O(bm)

Which is not the commonly used programming language for AI? Python Java LISP PHP

PHP

In A* approach evaluation function is Heuristic function Path cost from start node to current node Path cost from start node to current node + Heuristic cost Average of Path cost from start node to current node and Heuristic cost

Path cost from start node to current node + Heuristic cost

Agents behavior can be best described by Perception sequence Agent function Sensors and Actuators Environment in which agent is performing

Perception sequence

External actions of the agent is selected by Perceive Performance Learning Actuator

Performance

Which element in agent are used for selecting external actions? Perceive Performance Learning Actuator

Performance

What is the expansion if PEAS in task environment? Peer, Environment, Actuators, Sense Perceiving, Environment, Actuators, Sensors Performance, Environment, Actuators, Sensors None of the mentioned

Performance, Environment, Actuators, Sensors

Best-First search can be implemented using the following data structure. Queue Stack Priority Queue Circular Queue

Priority Queue

What is the target of task environment in artificial intelligence? Problem Solution Agent Observation

Problem

Which is used to improve the performance of heuristic search? Quality of nodes Quality of heuristic function Simple form of nodes None of the mentioned

Quality of heuristic function

Which instruments are used for perceiving and acting upon the environment? Sensors and Actuators Sensors Perceiver None of the mentioned

Sensors and Actuators

What kind of environment is crossword puzzle? Static Dynamic Semi Dynamic None of the mentioned

Static

A completely automated chess engine (Learn from previous games) is based on Strong Artificial Intelligence approach Weak Artificial Intelligence approach Cognitive Artificial Intelligence approach Applied Artificial Intelligence approach

Strong Artificial Intelligence approach

Where does the performance measure is included? Rational agent Task environment Actuators Sensor

Task environment

Greedy search strategy chooses the node for expansion Shallowest Deepest The one closest to the goal node Minimum heuristic cost

The one closest to the goal node

The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. Finding shortest path between a source and a destination Travelling Salesman problem Map coloring problem Depth first search traversal on a given map represented as a graph

Travelling Salesman problem

An omniscient agent knows the actual outcome of its actions and can act accordingly; but omniscience is impossible in reality. Rational Agent always does the right thing; but Rationality is possible in reality. State true or false True False

True

Rational agent is the one who always does the right thing. State true or false True False

True

The name "best-first search" is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function. State whether true or false. True False

True

Which agent deals with happy and unhappy states? Simple reflex agent Model based agent Learning agent Utility based agent

Utility based agent

A basic line following robot is based on Strong Artificial Intelligence approach Weak Artificial Intelligence approach Cognitive Artificial Intelligence approach Applied Artificial Intelligence approach

Weak Artificial Intelligence approach

How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4

a) 1

Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

a) Depth-limited search

A problem in a search space is defined by one of these states. a) Initial state b) Last state c) Intermediate state d) All of the above

a) Initial state

uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost

a) Lowest path cost

The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

a) O(bd+1) and O(bd+1)

Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

a) Shallowest

We often regard a LIFO as a ______ and an FIFO as ________ a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue

a) Stack, Queue

Which data structure conveniently used to implement DFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned

a) Stacks

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False

a) True

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False

a) True

Which search strategy is also called as blind search? a) Uninformed search b) Informed search c) Simple reflex search d) All of the mentioned

a) Uninformed search

Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

b) Breadth-first search

Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

b) Depth-first search

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

b) False

A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions

b) Problem, solution

Which data structure conveniently used to implement BFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned

b) Queues

Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

b) Tree algorithm

What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search

b) Uninformed Search

Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

b) When all step costs are equal

When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

b) When all step costs are equal

How many types are available in uninformed search method? a) 3 b) 4 c) 5 d) 6

c) 5

The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned

c) All of the mentioned

Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

c) Deepest

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

c) Successor function, which takes current action and returns next immediate state

How many parts does a problem consists of? a) 1 b) 2 c) 3 d) 4

d) 4

Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

d) All of the mentioned

Strategies that know whether one non-goal state is "more promising" than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

d) Informed & Heuristic Search

What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

d) O(bm)

What is state space? a) The whole problem b) Your Definition to a problem c) Problem you design d) Representing your problem with variable and parameter

d) Representing your problem with variable and parameter

What is the heuristic function of greedy best-first search? f(n) != h(n) f(n) < h(n) f(n) = h(n) f(n) > h(n)

f(n) = h(n)

Please draw a diagram that shows the states machine of 3-cell Vacuum-cleaner world problem?

|o|o|o| [ALL DIRTY] |o|o| | |o| |o| | |o|o| |o| | | | |o| | | | |o| | | | | [ALL CLEAN] (8) * PLACE OF VACUUM (3) = 24 STATES FORMULA: Number of states = x*2^x where x is number of places for vacuum