⟩ 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.
An algorithm A is admissible if It is guaranteed to return an optimal solution when one exists.
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
Pick out the correct option about the types of parsing a) Top-down and bottom-up parsing b) Interpretation and communication c) Roll-up and roll-down d) None of the mentioned
What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase
What is defined by set of strings? a) Signs b) Formal language c) Communication d) None of the mentioned
What is the complex system of structured message? a) Languages b) Words c) Signs d) Speech
How many things are present in conventional communication signs? a) 3 b) 4 c) 5 d) 6
What is the intentional exchange of information brought about by production and perception? a) Hearing b) Communication c) Speech d) None of the mentioned