1. mmunication between two machines
(B) Communication between two humans
(C) Communication between human and machine
(D) Boolean values
(E) None of these
2. : Which of the following is a heuristic function?
(A) To solve mathematical problems
(B) That maps from problem state descriptions to measures of desirability
(C) Whose return type is nothing
(D) Which takes parameters of type string and returns an integer value
3. : The main goal of artificial intelligence is to?
(A) Explain various sorts of intelligence
(B) Solve artificial problems
(C) Solve real-world problems
(D) Extract scientific causes
4. : An algorithm is considered as a complete algorithm if it?
(A) Has a loop
(B) Starts with a solution
(C) Does not terminate with a solution
(D) Terminates with a solution when one exists
5. : An algorithm A is considered as admissible if it?
(A) Not guaranteed to return an optimal solution when one exists
(B) Guarantees to return more optimal solutions
(C) Returns more solutions, but not an optimal one
(D) Guaranteed to return an optimal solution when one exists
6. : Which can be considered as true regarding the Breadth-First Search algorithm?
(A) Breadth-First Search algorithm will get trapped exploring a single path
(B) Breadth-First Search algorithm is nothing but Binary First Search
(C) Breadth-First Search algorithm is not promised to find a solution if exists
(D) The whole tree has so far been generated must be stored in the Breadth-First Search algorithm
7. : In the traveling salesman problem, n cities with the paths and paths connecting the cities. The time required for traversing through all the cities, without the advance knowledge of the length of a minimum tour is considered as?
(A) O(n!)
(B) O(n²)
(C) O(n)
(D) O(n/2)