www.jntuworld.

com

Code No: A107411904 Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV B.Tech. I Sem., I Mid-Term Examinations, September 2011 ARTIFICIAL INTELLIGENCE Objective Exam
Name: ______________________________ Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20. I 1. Choose the correct alternative: If the environment is deterministic except for the actions of other agent, we say that the environment is ________________ [ A. Fully Observed B. Strategic C. Episodic D. Sequential ]

2.

______________agents select actions on the basis of current percept, ignoring rest of the percept history. [ ] A. Model Based B. Goal Based C. Utility Based D. Simple-Reflex A problem can be defined formally by______________ component. A.Initial State B. Goal Test C. Path Cost D. All of the above In ____________ search root node is expanded first. A. BFS B. DFS C. None

3.

4.

5.

Greedy best first search evaluates nodes by using heuristic function___________ [ A. f (n)-h (n) B. h (n) =0 C. f (n) =h (n) D. f (n) + h (n) The most widely known form of Best First Search is called ________________ [ A. A* search B. A+ search C. B* search D. B+ search A game can be defined by ______________. i. Initial state ii. Legal actions in each state iii. Terminal Test iv. Utility Function. A. i & ii B. i & ii & iii & iv C. i & iii

6.

7.

T N

W U

R O

D L

[ D. Both A & B

D. iii & iv

8.

The mimmax algorithm computes the minmax decision from ____________ [ ] A. Previous state B. Initial state C. Next state D. Current state Greedy best first search expands nodes with __________ A. minimal h (n) B. maximal h (n) [ ] D. h (n) =1 [ ] D. DFS Cont.2

9.

C. h (n) = 0

10.

_____________ agent operates by interleaving computation and action. A. Off-line search B. Online search C. BFS

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 II 11. 12. Fill in the Blanks

:2:

Set No. 1

A _______________agent is one that does the right thing for every entry. The Turing Test, proposed by_______________, was designed to prove a satisfactory operational definition of Intelligence. PEAS stand for_____________, _____________, _______________, ________________ ________________________is the process of deciding what actions and states to consider, given a goal. Strategies that known whether one non-goal state is more promising than another are called__________________ ___________________search imposes a fixed depth limit on a DFS.

13. 14.

15.

16. 17.

The complexity of inference as a function of the number of ground facts in the data base is called__________________.

18. 19. 20.

Natural languages suffer from ______________, which would cause difficulties for thinking. CSP stands for ________________________.

________________is a stochastic hill-climbing search in which a large population of states is maintained.

T N

W U
-oOo-

R O

D L

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 Set No. 2 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV B.Tech. I Sem., I Mid-Term Examinations, September 2011 ARTIFICIAL INTELLIGENCE Objective Exam
Name: ______________________________ Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20. I 1. Choose the correct alternative: In ____________ search root node is expanded first. A. BFS B. DFS C. None [ D. Both A & B ]

2.

Greedy best first search evaluates nodes by using heuristic function___________ [ A. f (n)-h (n) B. h (n) =0 C. f (n) =h (n) D. f (n) + h (n) The most widely known form of Best First Search is called ________________ [ C. B* search D. B+ search A. A* search B. A+ search A game can be defined by ______________. i. Initial state ii. Legal actions in each state iii. Terminal Test iv. Utility Function. A. i & ii B. i & ii & iii & iv C. i & iii

3.

4.

5.

The mimmax algorithm computes the minmax decision from ____________ [ ] A. Previous state B. Initial state C. Next state D. Current state Greedy best first search expands nodes with __________ A. minimal h (n) B. maximal h (n)

6.

7.

_____________ agent operates by interleaving computation and action. A. Off-line search B. Online search C. BFS

T N

W U

R O

D L

D. iii & iv

C. h (n) = 0

[ ] D. h (n) =1 [ ] D. DFS

8.

If the environment is deterministic except for the actions of other agent, we say that the environment is ________________ [ A. Fully Observed B. Strategic C. Episodic D. Sequential

9.

______________agents select actions on the basis of current percept, ignoring rest of the percept history. [ ] A. Model Based B. Goal Based C. Utility Based D. Simple-Reflex A problem can be defined formally by______________ component. A.Initial State B. Goal Test C. Path Cost D. All of the above [ ]

10.

Cont.2

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 II Fill in the Blanks

:2:

Set No. 2

11.

________________________is the process of deciding what actions and states to consider, given a goal. Strategies that known whether one non-goal state is more promising than another are called__________________ ___________________search imposes a fixed depth limit on a DFS. The complexity of inference as a function of the number of ground facts in the data base is called__________________.

12.

13. 14.

15. 16. 17.

Natural languages suffer from ______________, which would cause difficulties for thinking. CSP stands for ________________________.

________________is a stochastic hill-climbing search in which a large population of states is maintained. A _______________agent is one that does the right thing for every entry. The Turing Test, proposed by_______________, was designed to prove a satisfactory operational definition of Intelligence. PEAS stand for_____________, _____________, _______________, ________________

18. 19.

20.

T N

W U
-oOo-

R O

D L

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 Set No. 3 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV B.Tech. I Sem., I Mid-Term Examinations, September 2011 ARTIFICIAL INTELLIGENCE Objective Exam
Name: ______________________________ Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20. I 1. Choose the correct alternative: The most widely known form of Best First Search is called ________________ [ A. A* search B. A+ search C. B* search D. B+ search A game can be defined by ______________. i. Initial state ii. Legal actions in each state iii. Terminal Test iv. Utility Function. A. i & ii B. i & ii & iii & iv C. i & iii [ ]

2.

3.

The mimmax algorithm computes the minmax decision from ____________ [ ] A. Previous state B. Initial state C. Next state D. Current state Greedy best first search expands nodes with __________ A. minimal h (n) B. maximal h (n)

4.

5.

_____________ agent operates by interleaving computation and action. A. Off-line search B. Online search C. BFS

6.

If the environment is deterministic except for the actions of other agent, we say that the environment is ________________ [ A. Fully Observed B. Strategic C. Episodic D. Sequential

7.

______________agents select actions on the basis of current percept, ignoring rest of the percept history. [ ] A. Model Based B. Goal Based C. Utility Based D. Simple-Reflex A problem can be defined formally by______________ component. A.Initial State B. Goal Test C. Path Cost D. All of the above In ____________ search root node is expanded first. A. BFS B. DFS C. None [ ]

T N

W U

R O

D. iii & iv

D L

C. h (n) = 0

[ ] D. h (n) =1 [ ] D. DFS

8.

9.

[ D. Both A & B

10.

Greedy best first search evaluates nodes by using heuristic function___________ [ A. f (n)-h (n) B. h (n) =0 C. f (n) =h (n) D. f (n) + h (n)

Cont.2

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 II Fill in the Blanks

:2:

Set No. 3

11. 12.

___________________search imposes a fixed depth limit on a DFS. The complexity of inference as a function of the number of ground facts in the data base is called__________________. Natural languages suffer from ______________, which would cause difficulties for thinking. CSP stands for ________________________. ________________is a stochastic hill-climbing search in which a large population of states is maintained. A _______________agent is one that does the right thing for every entry.

13. 14. 15.

16. 17.

The Turing Test, proposed by_______________, was designed to prove a satisfactory operational definition of Intelligence. PEAS stand for_____________, _____________, _______________, ________________ ________________________is the process of deciding what actions and states to consider, given a goal. Strategies that known whether one non-goal state is more promising than another are called__________________

18. 19.

20.

T N

W U
-oOo-

R O

D L

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 Set No. 4 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV B.Tech. I Sem., I Mid-Term Examinations, September 2011 ARTIFICIAL INTELLIGENCE Objective Exam
Name: ______________________________ Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20. I 1. Choose the correct alternative: The mimmax algorithm computes the minmax decision from ____________ [ ] A. Previous state B. Initial state C. Next state D. Current state Greedy best first search expands nodes with __________ A. minimal h (n) B. maximal h (n)

2.

C. h (n) = 0

3.

_____________ agent operates by interleaving computation and action. A. Off-line search B. Online search C. BFS

4.

If the environment is deterministic except for the actions of other agent, we say that the environment is ________________ [ A. Fully Observed B. Strategic C. Episodic D. Sequential

5.

______________agents select actions on the basis of current percept, ignoring rest of the percept history. [ ] A. Model Based B. Goal Based C. Utility Based D. Simple-Reflex A problem can be defined formally by______________ component. A.Initial State B. Goal Test C. Path Cost D. All of the above In ____________ search root node is expanded first. A. BFS B. DFS C. None

6.

7.

8.

Greedy best first search evaluates nodes by using heuristic function___________ [ A. f (n)-h (n) B. h (n) =0 C. f (n) =h (n) D. f (n) + h (n) The most widely known form of Best First Search is called ________________ [ A. A* search B. A+ search C. B* search D. B+ search A game can be defined by ______________. i. Initial state ii. Legal actions in each state iii. Terminal Test iv. Utility Function. A. i & ii B. i & ii & iii & iv C. i & iii [

T N

W U

R O

D L

[ ] D. h (n) =1 [ ] D. DFS

[ D. Both A & B

9.

10.

D. iii & iv Cont.2

www.jntuworld.com

www.jntuworld.com

Code No: A107411904 II Fill in the Blanks

:2:

Set No. 4

11. 12. 13.

Natural languages suffer from ______________, which would cause difficulties for thinking. CSP stands for ________________________. ________________is a stochastic hill-climbing search in which a large population of states is maintained. A _______________agent is one that does the right thing for every entry. The Turing Test, proposed by_______________, was designed to prove a satisfactory operational definition of Intelligence. PEAS stand for_____________, _____________, _______________, ________________ ________________________is the process of deciding what actions and states to consider, given a goal. Strategies that known whether one non-goal state is more promising than another are called__________________ ___________________search imposes a fixed depth limit on a DFS. The complexity of inference as a function of the number of ground facts in the data base is called__________________.

14. 15.

16. 17.

18.

19. 20.

T N

W U
-oOo-

R O

D L

www.jntuworld.com