Assignment 2 Flashcards
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
How many main types are available in uninformed search method as our lectures?
a) 3
b) 4
c) 5
d) 6
c) 5
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
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
What is the space complexity of Depth-first search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
d) O(bm)
How many parts does a problem consists of?
a) 1
b) 2
c) 3
d) 4
d) 4
Which algorithm is expected 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
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
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
Blind searching is general term for
a) Informed Search
b) Uninformed Search
c) Informed & Unformed Search
d) Heuristic Search
b) Uninformed 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
d) Informed & Heuristic Search
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
Which data structure conveniently used to implement BFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
b) Queues
Which data structure conveniently used to implement DFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
a) Stacks
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 is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. State whether true or false.
True
False
False
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
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
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
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
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
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
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
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
True
False
True
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
A problem in a search space is defined by one of these state.
a) Initial state
b) Last state
c) Intermediate state
d) All of the above
a) Initial state
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
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.
True
False
True
The process of removing detail from a given state representation is called______
a) Extraction
b) Abstraction
c) information Retrieval
d) Mining of data
b) Abstraction
A problem solving approach works well for
a) 8-Puzzle problem
b) 8-queen problem
c) Finding an optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)
e) All of the mentioned
e) All of the mentioned
The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
a) Finding shortest path between a source and a destination
b) Travelling Salesman problem
c) Map coloring problem
d) Depth first search traversal on a given map represented as a graph
b) Travelling Salesman problem
Web Crawler is a/an
a) Intelligent goal-based agent
b) Problem-solving agent
c) Simple reflex agent
d) Model based agent
a) Intelligent goal-based agent
Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
a) Depth-First Search
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
b) Heuristic approach (Some knowledge is stored)
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
How many types of informed search method are in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
d) 4
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
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
b) Best-first search
What is the heuristic function of greedy best-first search?
a) f(n) != h(n)
b) f(n) < h(n)
c) f(n) = h(n)
d) f(n) > h(n)
c) f(n) = h(n)
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
d) None of the mentioned
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
d) A* 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
Which search method will expand the node that is closest/fastest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned
b) Greedy best-first search
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
A* algorithm is based on
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
c) Best-First-Search
The search strategy that 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
Uninformed search strategies are better than informed search strategies.
True
False
False
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
a) Evaluation function returning lowest evaluation
Best-First search can be implemented using the following data structure.
a) Queue
b) Stack
c) Priority Queue
d) Circular Queue
c) Priority Queue
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
Heuristic function h(n) is ____
a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node
d) Average path cost
c) Estimated cost of cheapest path from root to goal node
Greedy search strategy chooses the node for expansion
a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost
c) The one closest to the goal node
In greedy approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
a) Heuristic function
What is the space complexity of Greedy search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
d) O(bm)
In A* approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
c) Path cost from start node to current node + Heuristic cost
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
