Neural Network and Fuzzy Logic Objective Questions Answers for Practice

76. Which condition is used to influence a variable directly by all the others?

1. Partially connected
2. Fully connected
3. Local connected
4. None of the mentioned

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

1. Forwards state-space
2. Backward state-space
3. Planning graph algorithm
4. None of the mentioned

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

1. Greedy best-first search
2. Best-first search
3. Both a & b
4. None of the mentioned

79. Which is more suitable normal form to be used with definite clause?

1. Positive literal
2. Negative literal
3. Generalized modus ponens
4. Neutral literal

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

1. Planning algorithm
2. Graph plan
3. Hill-climbing search
4. All of the mentioned

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

1. Quality of nodes
2. Quality of heuristic function
3. Simple form of nodes
4. None of the mentioned

82. Which is used to mediate between syntax and semantics?

1. Form
2. Intermediate form
3. Grammar
4. All of the mentioned

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

1. Propositional planning problem
2. Planning problem
3. Action problem
4. None of the mentioned

84. Which knowledge base is called as fixed point?

1. First-order definite clause is similar to propositional forward chaining
2. First-order definite clause is mismatch to propositional forward chaining
3. Both a & b
4. None of the mentioned

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

1. Best-first search
2. Depth-first search
3. Metalevel state space
4. None of the mentioned

86. Which of the following are examples of software development tools?

1. debuggers
2. editors
3. assemblers, compilers and interpreters
4. All of the mentioned

87. Which of the following is used for probability theory sentences?

1. Conditional logic
2. Logic
3. Extension of propositional logic
4. None of the mentioned

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

1. Best-first search
2. Depth-first search
3. Both a & b
4. A* search

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

1. Best-first search
2. Greedy best-first search
3. A* search
4. None of the mentioned

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

1. Best-first search
2. Recursive best-first search
3. Depth-first search
4. None of the mentioned