(A) 0 log 0, 0
(B) 0 log 10, 1
(C) 0 log 0, 1
(D) 1 log 1, 1
Related Posts 👇
-
We use graph to represent problems and their solution spaces:
(A) True
(B) False
(C) NA
(D) NA
-
Hit and trial is classical approach to solve the __ problem easily.
(A) Trivial
(B) Medium
(C) Least
(D) None of the give
-
In optimal path searches we try to find the __ solution.
(A) Worst
(B) Least
(C) Least but not worst
(D) Best
-
Genetic Algorithms is a search method in which multiple search paths are followed in __.
(A) Series
(B) Parallel
(C) Sequential
(D) None of the give
-
Searching is a formal mechanism to explore:
(A) Alternatives
(B) Recursive
(C) Best
(D) Fitness
-
Semantic networks are computationally expensive at __.
(A) Run time
(B) Compile Time
(C) Start Time
(D) End Time
-
Which one of the following is involved in an ES development project:
(A) The domain expert
(B) The knowledge engineer
(C) The end user
(D) All of the given
-
An expert system is different Separate from conventional programs in the sense that program control and knowledge are __.
(A) Separate
(B) Defined
(C) Together
(D) Common