Artificial Intelligence Algorithms Questions And Answers

21⟩ What do we mean by simulated annealing in artificial intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling schedule c) It will not return an optimal solution when there is a proper cooling schedule d) None of the mentioned

a) Returns an optimal solution when there is a proper cooling schedule.

Explanation:

Refer to the definitions of annealing search

Is this answer helpful? 0 Yes | 0 No

Answer This Question

252 views

22⟩ What is knowledge in artificial intelligence algorithms?

Knowledge in artificial intelligence algorithms may be declarative and procedural.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

226 views

23⟩ When an algorithm A is admissible in artificial intelligence algorithms?

An algorithm A is admissible if It is guaranteed to return an optimal solution when one exists.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

220 views

24⟩ What is the goal of artificial intelligence algorithms?

The scientific goal of artificial intelligence is to explain various sorts of intelligence.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

245 views

25⟩ 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.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

221 views

26⟩ List the types of linked list with aid of diagram?

List down the types of linked list with aid of diagram yourself

Is this answer helpful? 0 Yes | 0 No

Answer This Question

240 views

27⟩ Flexible CSPs relax on a) Constraints b) Current State c) Initial State d) Goal State

a) Constraints

Explanation:

Definition of flexible CSPs.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

264 views

28⟩ What are taken into account of state-space search? a) Post conditions b) Preconditions c) Effects d) Both b & c

d) Both b & c

Explanation:

The state-space search takes both precondition and effects into account for solving a problem.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

276 views

29⟩ Why the parsing is used? a) Interpretation b) Building a parse tree c) Recognition d) All of the mentioned

b) Building a parse tree

Explanation:

Parsing is the process of building a parse tree for an input string.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

242 views

30⟩ How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

b) 2

Explanation:

There are two ways available to solve the state-space search. They are forward from the initial state and backward from the goal.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

244 views

31⟩ what is software cycle? Give a diagrammatic representation?

Explain what is software cycle

Is this answer helpful? 0 Yes | 0 No

Answer This Question

213 views

32⟩ Which is true regarding BFS in artificial intelligence algorithms?

Regarding BFS, the entire tree so far been generated must be stored in BFS.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

232 views

33⟩ How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

d) 4

Explanation:

There are four states available in state-space search. They are initial state, actions, goal test and step cost.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

217 views

34⟩ What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

c) Relevant actions

Explanation:

The main advantage of backward search will allows us to consider only relevant actions.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

244 views

35⟩ Tell me 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.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

213 views

36⟩ What is the other name of backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

a) Regression planning

Explanation:

Backward state-space search will find the solution from goal to the action, so it is called as Regression planning.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

238 views

37⟩ What is Back propagation in Neural Networks?

A back-propagation neural network is only practical in

certain situations. Following are some guidelines on when

you should use another approach:

Can you write down a flow chart or a formula that

accurately describes the problem? If so, then stick with a

traditional programming method.

Is there a simple piece of hardware or software that

already does what you want? If so, then the development

time for a NN might not be worth it.

Do you want the functionality to "evolve" in a direction

that is not pre-defined? If so, then consider using a

Genetic Algorithm (that's another topic!).

Do you have an easy way to generate a significant number of

input/output examples of the desired behavior? If not, then

you won't be able to train your NN to do anything.

Is the problem is very "discrete"? Can the correct answer

can be found in a look-up table of reasonable size? A look-

up table is much simpler and more accurate.

Are precise numeric output values required? NN's are not

good at giving precise numeric answers.

Conversely, here are some situations where a BP NN might be

a good idea:

A large amount of input/output data is available, but

you're not sure how to relate it to the output.

The problem appears to have overwhelming complexity, but

there is clearly a solution.

It is easy to create a number of examples of the correct

behavior.

The solution to the problem may change over time, within

the bounds of the given input and output parameters (i.e.,

today 2+2=4, but in the future we may find that 2+2=3.8).

Outputs can be "fuzzy", or non-numeric.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

234 views

38⟩ What is idempotency law in artificial intelligence algorithms?

Idempotency Law in artificial intelligence algorithms is P V P = P.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

251 views

39⟩ Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

b) State-space search

Explanation:

The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

233 views

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

Explanation:

The process of removing detail from a representation is called abstraction.

Is this answer helpful? 0 Yes | 0 No

Answer This Question

229 views

Artificial Intelligence Algorithms

Home Business and Economy Artificial Intelligence Algorithms

57 Artificial Intelligence Algorithms Questions And Answers

22⟩ What is knowledge in artificial intelligence algorithms?

23⟩ When an algorithm A is admissible in artificial intelligence algorithms?

24⟩ What is the goal of artificial intelligence algorithms?

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

26⟩ List the types of linked list with aid of diagram?

27⟩ Flexible CSPs relax on a) Constraints b) Current State c) Initial State d) Goal State

28⟩ What are taken into account of state-space search? a) Post conditions b) Preconditions c) Effects d) Both b & c

29⟩ Why the parsing is used? a) Interpretation b) Building a parse tree c) Recognition d) All of the mentioned

30⟩ How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

31⟩ what is software cycle? Give a diagrammatic representation?

32⟩ Which is true regarding BFS in artificial intelligence algorithms?

33⟩ How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

34⟩ What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

35⟩ Tell me 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

36⟩ What is the other name of backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

37⟩ What is Back propagation in Neural Networks?

38⟩ What is idempotency law in artificial intelligence algorithms?

39⟩ Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

40⟩ The process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

Quick Links:

Artificial Intelligence Algorithms

Home Business and Economy Artificial Intelligence Algorithms

57 Artificial Intelligence Algorithms Questions And Answers

22⟩ What is knowledge in artificial intelligence algorithms?

23⟩ When an algorithm A is admissible in artificial intelligence algorithms?

24⟩ What is the goal of artificial intelligence algorithms?

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

26⟩ List the types of linked list with aid of diagram?

27⟩ Flexible CSPs relax on a) Constraints b) Current State c) Initial State d) Goal State

28⟩ What are taken into account of state-space search? a) Post conditions b) Preconditions c) Effects d) Both b & c

29⟩ Why the parsing is used? a) Interpretation b) Building a parse tree c) Recognition d) All of the mentioned

30⟩ How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

31⟩ what is software cycle? Give a diagrammatic representation?

32⟩ Which is true regarding BFS in artificial intelligence algorithms?

33⟩ How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

34⟩ What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

35⟩ Tell me 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

36⟩ What is the other name of backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

37⟩ What is Back propagation in Neural Networks?

38⟩ What is idempotency law in artificial intelligence algorithms?

39⟩ Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

40⟩ The process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

BE THE FIRST TO KNOW

Quick Links: