⟩ 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
c) A goal state is reachable from every state
How many objects are available in closed classes? a) 1 b) 2 c) 3 d) 4
What are the minimum requirements for statr testing?
What is a heuristic function in artificial intelligence algorithms?
What is a cybernetics in artificial intelligence algorithms?
What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned
What is Naive Bayes Algorithm?
The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance what is the length of tour?
What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination
When does an algoritham complete?
How many states are present in parsing? a) 1 b) 2 c) 3 d) 4