Day 5

Question 1

Problem-solving agents are the goal-based agents and use atomic representation
True
False

Answer 1

True

Question 2

Properties of Search Algorithms:

Answer 2

o Completeness
o Optimality
o Time Complexity
o Space Complexity

Question 3

Completeness: A search algorithm is said to be complete if it guarantees to return a
solution if at least any solution exists for any random input.
True
False

Answer 3

True

Question 4

Optimality: If a solution found for an algorithm is guaranteed to be the best solution
(lowest path cost) among all other solutions, then such a solution for is said to be an
optimal solution.

Answer 4

True

Question 5

Time Complexity: Time complexity is a measure of time for an algorithm to complete its task.

Answer 5

True

Question 6

Space Complexity: It is the maximum storage space required at any point during the
search, as the complexity of the problem.

Question 7

A search problem can have three main factors:

Answer 7

➢ Search Space: Search space represents a set of possible solutions, which a system may have.
➢ Start State: It is a state from where agent begins the search.
➢ Goal test: It is a function which observe the current state and returns whether the goal state is achieved or not.

Question 8

—————- represents a set of possible solutions, which a system may have.

Answer 8

Search space

Question 9

———– It is a state from where agent begins the search.

Answer 9

Start State

Question 10

——— It is a function which observe the current state and returns whether the goal state is achieved or not.
➢ Goal test
➢Start State
➢ Search Space

Answer 10

➢ Goal test

Question 11

Search tree: A tree representation of search problem is called Search tree. The root of the search tree is the root node which is corresponding to the initial state.
True
False

Answer 11

True

Question 12

Actions: It gives the description of all the available actions to the agent.

Answer 12

Actions: It gives the description of all the available actions to the agent.

Question 13

Transition model: A description of what each action do, can be represented as a transition model.

Question 14

—————- It is a function which assigns a numeric cost to each path.

Answer 14

Path Cost:

Question 15

———– It is an action sequence which leads from the start node to the goal node.

Answer 15

Solution

Question 16

————— If a solution has the lowest cost among all solutions.

Answer 16

Optimal Solution

Question 17

search algorithms terminologies:
1-Search Space
2-Start state 
3-Goal solution
4-Search tree
5-Actions
6-Transition Model
7-Path coast
8-Solution
9-Optimal Solution

Question 18

Based on the search problems we can classify the search algorithms into uninformed (Blind search) search and informed search (Heuristic search) algorithms.

Answer 18

True

Question 19

—————– search does not contain any domain knowledge such as closeness, the
location of the goal. It operates in a brute-force way as it only includes information about
how to traverse the tree and how to identify leaf and goal nodes. so, it is also called blind
search. It examines each node of the tree until it achieves the goal node

Answer 19

The uninformed

Question 20

————– search algorithms use domain knowledge. In an ————- search, problem information is available which can guide the search. ———— search strategies can find a solution more efficiently than an uninformed search strategy. ——— search is also called a Heuristic search.

Answer 20

Informed

Question 21

A heuristic is a way which might always be guaranteed for best solutions but guaranteed to find a good solution in reasonable time.
True
False

Answer 21

False
A heuristic is a way which might not always be guaranteed for best solutions but guaranteed to find a good solution in reasonable time.

Question 22

uninformed search:

Answer 22

1-Breadth first search
2-Depth first search
3-Uniformed coast search
4-Depth limited search
5-Iterative deeping depth first search
6-Bidirectional Search

Question 23

Informed Search

Answer 23

Best First Search

A* Search

Question 24

Breadth-first search is the most common search strategy for traversing a tree or graph.
This algorithm searches breadthwise in a tree or graph, so it is called breadth-first search

Question 25

DFS algorithm starts searching from the root node of the tree and expands all successor node at the current level before moving to nodes of next level.
True
Fasle

Answer 25

Fasle

BFS

Question 26

Advantages
o BFS will provide a solution if any solution exists.
o If there are more than one solutions for a given problem, then BFS will provide the minimal solution which requires the least number of steps.

Question 27

Advantages
o BFS will provide a solution if any solution exists.
o If there are more than one solutions for a given problem, then BFS will provide the minimal solution which requires the least number of steps.

Answer 27

• will find the solution if is the tree

- the minimal solution(least number of steps)

Question 28

Disadvantages
o It requires lots of memory since each level of the tree must be saved into memory to
expand the next level.
o BFS needs lots of time if the solution is far away from the root node.

Question 29

Breadth-first search implemented using LIFO queue data structure.
True
False

Answer 29

False

FIFO