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 the length of a minimum tour, is ……
a) O(n)
b) O(n2)
c) O(n!)
d) O(n/2)
Explanation: 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 the length of a minimum tour, is O(n!).
What is the problem space of means-end analysis?
a) An initial state and one or more goal states
b) One or more initial states and one goal state
c) One or more initial states and one or more goal state
d) One initial state and one goal state
Explanation: The problem space of means-end analysis has an initial state and one or more goal states.
An algorithm A is admissible if ……
a) It is not guaranteed to return an optimal solution when one exists
b) It is guaranteed to return an optimal solution when one exists
c) It returns more solutions, but not an optimal one
d) It guarantees to return more optimal solutions
Explanation: An algorithm A is admissible if It is guaranteed to return an optimal solution when one exists.
Knowledge may be
I. Declarative.
II. Procedural.
III. Non-procedural.
a) Only (I)
b) Only (II)
c) Only (III)
d) Both (I) and (II)
Explanation: Knowledge may be declarative and procedural.
Idempotency law is
I. P Ú P = P.
II. P Ù P = P.
III. P + P = P.
a) Only (I)
b) Only (II)
c) Only (III)
d) Both (I) and (II)
Explanation: Idempotency Law is PVP= P.
Al Statistics:
