1. What is a Cybernetics?

(a) Study of communication between two machines
(b) Study of communication between human and machine
(c) Study of communication between two humans
(d) Study  of Boolean values
(e) Study of communication between logic circuits.

2. What is the goal of artificial intelligence?

(a) To solve real-world problems
(b) To solve artificial problems
(c) To explain various sorts of intelligence
(d) To extract scientific causes
(e) To restrict problems.

3. An algorithm is complete if

(a) It terminates with a solution when one exists
(b) It starts with a solution
(c) It does not terminate with a solution
(d) It has a loop
(e) It has a decision parameter.

4. Which is true regarding BFS?

(a) BFS will get trapped exploring a single path
(b) The entire tree so far been generated must be stored in BFS
(c) BFS is not guaranteed to find a solution, if exists
(d) BFS is nothing but Binary First Search
(e) BFS is one type of sorting.

5. What is a heuristic function?

(a) A function to solve mathematical problems
(b) A function which takes parameters of type string and returns an integer value
(c) A function whose return type is nothing
(d) A function which returns an object
(e) A function that maps from problem state descriptions to measures of desirability.

6. 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)
(e) O(2n).

7. The problem space of means-end analysis has

(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
(e) No goal state.

8. 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
(e) It returns no solutions at all.

9. Knowledge may be

I.     Declarative.
II.     Procedural.
III.    Non-procedural.

(a) Only (I) above
(b) Only (II) above
(c) Only (III) above
(d) Both (I) and (II) above
(e) Both (II) and (III) above.

10. Idempotency law is

I.     P ν P = P.
II.     P Λ P = P.
III.    P + P = P.

(a) Only (I) above
(b) Only (II) above
(c) Only (III) above
(d) Both (I) and (II) above
(e) Both (II) and (III) above.