Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

AI > Test1 > Flashcards

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q 
How many main types are available in uninformed search method as our lectures?
3
4
5
6
A

5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q 
What is the space complexity of Depth-first search?
O(b)
O(bl)
O(m)
O(bm)
A

O(bm)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q 
How many parts does a problem consists of?
1
2
3
4
A

4

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q 
Blind searching is general term for
Informed Search
Uninformed Search
Informed & Unformed Search
Heuristic Search
A

Uninformed Search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q 
Which data structure conveniently used to implement BFS?
Stacks
Queues
Priority Queues
All of the mentioned
A

Queues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q 
Which data structure conveniently used to implement DFS?
Stacks
Queues
Priority Queues
All of the mentioned
A

Stacks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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
Q 
A search algorithm takes \_\_\_\_\_\_\_\_\_ as an input and returns \_\_\_\_\_\_\_\_ as an output.
Input, output
Problem, solution
Solution, problem
Parameters, sequence of actions
A

Problem, solution

26
Q 
A problem in a search space is defined by one of these state.
Initial state
Last state
Intermediate state
All of the above
A

Initial state

27
Q

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

A

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

28
Q

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).

A

True

29
Q 
The process of removing detail from a given state representation is called\_\_\_\_\_\_
Extraction
Abstraction
Information Retrieval
Mining of data
A

Abstraction

30
Q

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

A

Travelling Salesman problem

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

Intelligent goal-based agent

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

Depth-First Search

33
Q

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

A

Heuristic approach (Some knowledge is stored)

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

Heuristic search

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

4

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

Informed search

37
Q 
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
A

Best-first search

38
Q 
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)
A

f(n) = h(n)

39
Q 
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

A* search

40
Q 
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
A

Quality of heuristic function

41
Q 
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
A

Greedy best-first search

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

Best-First-Search

43
Q

Uninformed search strategies are better than informed search strategies.
(True/false)

A

False

44
Q

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
A

Evaluation function returning lowest evaluation

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

Priority Queue

46
Q

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.

A

True

47
Q 
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
A

Estimated cost of cheapest path from root to goal node

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

The one closest to the goal node

49
Q

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

A

Heuristic function

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

O(bm)

51
Q

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
A

Path cost from start node to current node + Heuristic cost

52
Q

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)

A

False

53
Q

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

A

Travelling Salesman problem

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

None of the mentioned

55
Q

The search strategy that uses a problem specific knowledge is known as

  • Informed Search
  • Best First Search
  • Heuristic Search
  • All of the mentioned
A

All of the mentioned

AI (2 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions