# Artificial Intelligence Algorithms

#### Home Business and Economy Artificial Intelligence Algorithms

“AI Algorithms frequently Asked Questions by expert members with experience in Artificial Intelligence Algorithms. So get preparation for the AI Algorithms job interview”

## 57 Artificial Intelligence Algorithms Questions And Answers

### 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 e) A space where you know the solution

d) Representing your problem with variable and parameter

Explanation:

Because state space is mostly concerned with a problem, when you try to solve a problem, we have to design a mathematical structure to the problem, which can only be through variables and parameters. for example, you have given a 4-gallon jug and another 3-gallon jug. Neither has measuring marker on it. You have to fill the jugs with water. How can you get exactly 2 gallons of water in to 4 gallons.Here the state space can defined as set of ordered pairs integers(x,y),such that x=0,1,2,3 or 4 and y=0,1,2 or 3;X represents the number of gallons in 4 gallons jug and y represents quantity of water in the 3 gallons jug.

144 views

### 2⟩ A problem in a search space Is defined by a) Initial state b) Goal test c) Intermediate states d) All of the above

a) Initial state & b) Goal test

Explanation:

A problem has four components initial state, goal test, set of actions, path cost.

176 views

### 3⟩ 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 a) True b) False

a) True

Explanation:

Refer to the definition of problem-solving agent.

142 views

### 4⟩ 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

Explanation:

The most common formulation for actions uses a successor function. Given a particular state x, SUCCESSOR-FN(x) returns a set of (action, successor) ordered pairs, where each action is one of the legal actions in state x and each successor is a state that can be reached from x by applying the action.

142 views

### 5⟩ 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. a) True b) False

a) True

Explanation:

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 lowest path cost among all solutions.

130 views

### 6⟩ A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Explanation:

Problem-solving approach works well for toy problems and real-world problems.

161 views

### 7⟩ 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

Explanation:

Refer the TSP problem.

136 views

### 8⟩ 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

Explanation:

A search algorithm takes input as a problem and returns a solution to the problem as an output.

145 views

a) & b)

155 views

### 10⟩ Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

b) Online search

Explanation:

In online search, it will first take an action and then observes the environment.

161 views

### 11⟩ Backtracking is based on a) Last in first out b) First in first out c) Recursion d) Both a & c

d) Both a & c

Explanation:

Recursion uses LIFO.

178 views

### 12⟩ Constraint propagation technique actually modifies the CSP problem. a) True b) False

a) True

Explanation:

Constraints are propagated towards goal node, modifying actual problem.

162 views

d) Termination

138 views

### 14⟩ Which approach is to pretend that a pure divide and conquer algorithm will work? a) Goal independence b) Sub-goal independence c) Both a & b d) None of the mentioned

b) Sub-goal independence

Explanation:

Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.

121 views

### 15⟩ This set of Artificial Intelligence MCQ focuses on "Problem Solving Approach - 1″ 1. 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) Both a) and b) d) Neither a) nor b)

c) Both a) and b)

Explanation:

The problem-solving agents are one of the goal-based agents.

156 views

### 16⟩ Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b

d) Both a & b

Explanation:

RBFE and SMA* will solve any kind of problem that A* can't by using limited amount of memory.

174 views

### 17⟩ When do we call the states are safely explored? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

c) A goal state is reachable from every state

135 views

a) 1

165 views

### 19⟩ What is meant by consistent in state-space search? a) Change in the desired literals b) Not any change in the literals c) No change in goal state d) None of the mentioned

b) Not any change in the literals

Explanation:

Consistent means that the completed actions will not undo any desired literals.

144 views

### 20⟩ Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

b) Depth-first search algorithm

Explanation:

Provides backtrack facility.

154 views