Test1 Flashcards
1
Q
Which search strategy is also called as blind search? Uninformed search Informed search Simple reflex search All of the mentioned
A
Uninformed search
2
Q
How many main types are available in uninformed search method as our lectures? 3 4 5 6
A
5
3
Q
Which search is implemented with an empty first-in-first-out queue? Depth-first search Breadth-first search Bidirectional search None of the mentioned
A
Breadth-first search
4
Q
When is breadth-first search is optimal? When there is less number of nodes When all step costs are equal When all step costs are unequal None of the mentioned
A
When all step costs are equal
5
Q
What is the space complexity of Depth-first search? O(b) O(bl) O(m) O(bm)
A
O(bm)
6
Q
How many parts does a problem consists of? 1 2 3 4
A
4
7
Q
Which algorithm is expected to solve any kind of problem? Breadth-first algorithm Tree algorithm Bidirectional search algorithm None of the mentioned
A
Tree algorithm
8
Q
Which search algorithm imposes a fixed depth limit on nodes? Depth-limited search Depth-first search Iterative deepening search Bidirectional search
A
Depth-limited search
9
Q
Which search implements stack operation for searching the states? Depth-limited search Depth-first search Breadth-first search None of the mentioned
A
Depth-first search
10
Q
Blind searching is general term for Informed Search Uninformed Search Informed & Unformed Search Heuristic Search
A
Uninformed Search
11
Q
Strategies that know whether one non-goal state is "more promising" than another are called Informed & Unformed Search Unformed Search Heuristic & Unformed Search Informed & Heuristic Search
A
Informed & Heuristic Search
12
Q
Which of the following is/are Uninformed Search technique/techniques Breadth First Search (BFS) Depth First Search (DFS) Bidirectional Search All of the mentioned
A
All of the mentioned
13
Q
Which data structure conveniently used to implement BFS? Stacks Queues Priority Queues All of the mentioned
A
Queues
14
Q
Which data structure conveniently used to implement DFS? Stacks Queues Priority Queues All of the mentioned
A
Stacks
15
Q
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.) O(bd+1) and O(bd+1) O(b2) and O(d2) O(d2) and O(b2) O(d2) and O(d2)
A
O(bd+1) and O(bd+1)
16
Q
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.
A
False
17
Q
uniform-cost search expands the node n with the\_\_\_\_\_\_\_\_\_\_ Lowest path cost Heuristic cost Highest path cost Average path cost
A
Lowest path cost
18
Q
Depth-first search always expands the \_\_\_\_\_\_ node in the current fringe of the search tree. Shallowest Child node Deepest Minimum cost
A
Deepest
19
Q
Breadth-first search always expands the \_\_\_\_\_\_ node in the current fringe of the search tree. Shallowest Child node Deepest Minimum cost
A
Shallowest
20
Q
Optimality of BFS is When there is less number of nodes When all step costs are equal When all step costs are unequal None of the mentioned
A
When all step costs are equal
21
Q
We often regard a LIFO as a \_\_\_\_\_\_ and an FIFO as \_\_\_\_\_\_\_\_ Stack, Queue Queue, Stack Priority Queue, Stack Stack. Priority Queue
A
Stack, Queue
22
Q
The main task of a problem-solving agent is
Solve the given problem and reach to goal
To find out which sequence of action will get it to the goal state
All of the mentioned
None of the mentioned
A
All of the mentioned
23
Q
What is state space? The whole problem Your Definition to a problem Problem you design Representing your problem with variable and parameter
A
Representing your problem with variable and parameter
24
Q
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. (True or False)
A
True
25
```
A search algorithm takes _________ as an input and returns ________ as an output.
Input, output
Problem, solution
Solution, problem
Parameters, sequence of actions
```
Problem, solution
26
```
A problem in a search space is defined by one of these state.
Initial state
Last state
Intermediate state
All of the above
```
Initial state
27
The Set of actions for a problem in a state space is formulated by a ___________
Intermediate states
Initial state
Successor function, which takes current action and returns next immediate state
None of the mentioned
Successor function, which takes current action and returns next immediate state
28
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. (True or false).
True
29
```
The process of removing detail from a given state representation is called______
Extraction
Abstraction
Information Retrieval
Mining of data
```
Abstraction
30
The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
8-Puzzle problem
8-queen problem
Finding an optimal path from a given source to a destination
Mars Hover (Robot Navigation)
Travelling Salesman problem
All of the mentioned
Travelling Salesman problem
31
```
Web Crawler is a/an
Intelligent goal-based agent
Problem-solving agent
Simple reflex agent
Model based agent
```
Intelligent goal-based agent
32
```
Which search method takes less memory?
Depth-First Search
Breadth-First search
Linear Search
Optimal search
```
Depth-First Search
33
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)
34
```
What is the other name of informed search strategy?
Simple search
Heuristic search
Online search
None of the mentioned
```
Heuristic search
35
```
How many types of informed search method are in artificial intelligence?
1
2
3
4
```
4
36
```
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
37
```
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
38
```
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)
39
```
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
40
```
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
41
```
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
42
```
A* algorithm is based on
Breadth-First-Search
Depth-First –Search
Best-First-Search
Hill climbing
```
Best-First-Search
43
Uninformed search strategies are better than informed search strategies.
(True/false)
False
44
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
45
```
Best-First search can be implemented using the following data structure.
Queue
Stack
Priority Queue
Circular Queue
```
Priority Queue
46
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
47
```
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
48
```
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
49
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
50
```
What is the space complexity of Greedy search?
O(b)
O(bl)
O(m)
O(bm)
```
O(bm)
51
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
52
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
53
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
54
```
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
55
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
