Top 80+ Solved Advanced Neural Network and Fuzzy System MCQ Questions Answer

From 61 to 75 of 77

Q. Which function will select the lowest expansion node atfirst for evaluation?

a. greedy best-first search

b. best-first search

c. both a & b

d. none of the mentioned

  • b. best-first search

Q. What is the heuristic function of greedy best-first search?

a. f(n) != h(n)

b. f(n) < h(n)

c. f(n) = h(n)

d. f(n) > h(n)

  • c. f(n) = h(n)

Q. Which search uses only the linear space for searching?

a. best-first search

b. recursive best-first search

c. depth-first search

d. none of the mentioned

  • b. recursive best-first search

Q. Which method is used to search better by learning?

a. best-first search

b. depth-first search

c. metalevel state space

d. none of the mentioned

  • c. metalevel state space

Q. Which search is complete and optimal when h(n) is consistent?

a. best-first search

b. depth-first search

c. both a & b

d. a* search

  • d. a* search

Q. Which is used to improve the performance of heuristic search?

a. quality of nodes

b. quality of heuristic function

c. simple form of nodes

d. none of the mentioned

  • b. quality of heuristic function

Q. Which search method will expand the node that is closest to the goal?

a. best-first search

b. greedy best-first search

c. a* search

d. none of the mentioned

  • b. greedy best-first search

Q. Which data structure is used to give better heuristic estimates?

a. forwards state-space

b. backward state-space

c. planning graph algorithm

d. none of the mentioned

  • c. planning graph algorithm

Q. Which is used to extract solution directly from the planning graph?

a. planning algorithm

b. graph plan

c. hill-climbing search

d. all of the mentioned

  • b. graph plan

Q. What are present in the planning graph?

a. sequence of levels

b. literals

c. variables

d. heuristic estimates

  • a. sequence of levels

Q. What is the starting level of planning graph?

a. level 3

b. level 2

c. level 1

d. level 0

  • d. level 0

Q. What are present in each level of planning graph?

a. literals

b. actions

c. variables

d. both a & b

  • d. both a & b

Q. Which kind of problem is suitable for planning graph?

a. propositional planning problem

b. planning problem

c. action problem

d. none of the mentioned

  • a. propositional planning problem

Q. What is meant by persistence actions?

a. allow a literal to remain false

b. allow a literal to remain true

c. both a & b

d. none of the mentioned

  • b. allow a literal to remain true

Q. When will further expansion is unnecessary for planning graph?

a. identical

b. replicate

c. not identical

d. none of the mentioned

  • a. identical
Subscribe Now

Get All Updates & News