AI midterm
1. Which search algorithm will use limited amount of memory? A. Hill-climbing search algorithm B. RBFS C. SMA* D. Both RBFS & SMA*
. Both RBFS & SMA*
Which are necessary for an agent to solve an online search problem? a) Actions b) Step-cost function c) Goal-test d) All of the mentioned
ALL OF THE MENTIONED
1. 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
All of the mentioned
1. An agent is composed of ________a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program
Architecture and Program
1. A* algorithm is based on ___________a) Breadth-First-Search b) Depth-First -Search c) Best-First-Search d) Hill climbing
Best-First-Search
Which function will select the lowest expansion node at first for evaluation? A. None of the mentioned B. Best-first search C. Depth-first search D. Greedy best-first search
Best-first search
1. For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges
By maintaining a list of visited vertices
1. What is the major component/components for measuring the performance of problem solving? A. All of the mentioned B. Optimality C. Time and space complexity D. Completeness
D. Completeness
In language understanding, the levels of knowledge that does not include? A. Logical B. Syntactic C. Phonological D. Empirical
D. Empirical
1. Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search
Depth-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
Depth-first search
1. Which search algorithm imposes a fixed depth limit on nodes? A. Depth-first search B. Depth-limited search C. Bidirectional search D. Iterative deepening search
Depth-limited search
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
Depth-limited search
1. Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned
Design Problem
1. What kind of environment is strategic in artificial intelligence? A. Partial B. Deterministic C. Rational D. Stochastic
Deterministic
1. Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest evaluation d) None of them is applicable
Evaluation function returning lowest evaluation
Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False
False
Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned
Greedy best-first search
Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned
Greedy best-first search
1. Which of the following algorithm is online search algorithm? A. Hill-climbing search algorithm B. Breadth-first search algorithm C. Depth-first search algorithm D. None of the mentioned
Hill-climbing search algorithm
Which of the following algorithm is online search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned
Hill-climbing search algorithm
1. 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
Informed & Heuristic Search
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
Informed & Unformed Search
Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space
Metalevel state space
The time and space complexity of BFS is (for time and space complexity problem s consider b as branching factor and d as depth of the search tree. ) A. O(bd+1) and O(bd+1) B. O(d2) and O(b2) C. O(d2) and O(d2) D. O(b2) and O(d2)
O(bd+1) and O(bd+1)
1. What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)
O(bm)
1. Satellite Image Analysis System is (Choose the one that is not applicable).a) Episodic b) Semi-Static c) Single agent d) Partially Observable
Partially Observable
1. What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent d) Observation
Problem
1. Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
Recursive best-first search
1. In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) Searchable state spaces d) All of the mentioned
Reversible state spaces
1. Which instruments are used for perceiving and acting upon the environment? A. Sensors B. None of te mentioned C. Perceiver D. Sensors and actuators
Sensors
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
Shallowest
Which agent deals with happy and unhappy states? A. Simple reflex agent B. Model based agent C. Learning agent D. Utility based agent
Utility based agent
1. 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
When all step costs are equal
Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search
a) Best-first search
What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic
a) Deterministic
Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search
a) Informed search
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)
Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm
a) RBFS & b) SMA*
1. DFS is ______ efficient and BFS is __________ efficient .a) Space, Time b) Time, Space c) Time, Time d) Space, Space
a) Space, Time
1. LIFO is ______ where as FIFO is ________ a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue
a) Stack, Queue
1. 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
1. Rational agent is the one who always does the right thing. a) True b) False
a)True
Agents behavior can be best described by ____________. A. Agent function B. Perception sequence C. Environment in which agent is performing D. Sensors and actuators
agent function
1. What could possibly be the environment of a Satellite Image Analysis System? a) Computers in space and earth b) Image categorization techniques c) Statistical data on image pixel intensity value and histograms d) All of the mentioned
all of the mentioned
The Task Environment of an agent consists of a) Sensors b) Actuators c) Performance Measures d) All of the mentioned
all of the mentioned
1. Agents behavior can be best described by ____________a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing
b) Agent function
1. What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
b) Heuristic search
Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
b) Quality of heuristic function
1. 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
b) Uninformed Search
What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search
b) Uninformed Search
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
1. What is the expansion if PEAS in task environment? a) Peer, Environment, Actuators, Sense b) Perceiving, Environment, Actuators, Sensors c) Performance, Environment, Actuators, Sensors d) None of the mentioned
c) Performance, Environment, Actuators, Sensors
1. Which is used to provide the feedback to the learning element? a) Critic b) Actuators c) Sensor d) None of the mentioned
critic
Which is used to provide the feedback to the learning element? A. Actuators B. Sensor C. Critic D. None of the mentioned
critic
1. A heuristic is a way of trying ___________a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned
d) All of the mentioned
1. What is an 'agent'? a) Perceives its environment through sensors and acting upon that environment through actuators b) Takes input from the surroundings and uses its intelligence and performs the desired operations c) A embedded program controlling line following robot d) All of the mentioned
d) All of the mentioned
1. What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent's prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned
d) All of the mentioned
1. 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
Artificial Intelligence has its expansion in the following application. a) Planning and Scheduling b) Game Playing c) Diagnosis d) All of the mentioned
d) All of the mentioned
The search strategy the uses a problem specific knowledge is known as ___________a) Informed Search b) Best First Search c) Heuristic Search d) All of the mentioned
d) All of the mentioned
Which data structure conveniently used to implement DFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned
d) All of the mentioned
How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both Mutation & Cross-over
d) Both Mutation & Cross-over
Which environment is called as semi dynamic?a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Environment does not change with the passage of time, but Agent
d) Environment does not change with the passage of time, but Agent
1. 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
1. Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach
heuristic approach (Some knowledge is stored
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Rational d) Primary
local
Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search
online search
1. Which is used to improve the agents performance? A. Learning B. Perceiving C. Observing D. None of the mentioned
perceiving
1. Which functions are used as preferences over state history? A. Award B. Implicit C. Reward D. Explicit
reward
What kind of environment is crossword puzzle?a) Static b) Dynamic c) Semi Dynamic d) None of the mentioned
static
Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor
task environment
