Home - Ugc Net Computer Science - Practice Questions - Artificial Intelligence - Approaches to Artificial Intelligence

Artificial Intelligence - Approaches to Artificial Intelligence Online Exam Quiz

Important questions about Artificial Intelligence - Approaches to Artificial Intelligence. Artificial Intelligence - Approaches to Artificial Intelligence MCQ questions with answers. Artificial Intelligence - Approaches to Artificial Intelligence exam questions and answers for students and interviews.

1. Chess is a two person game, later we will study search methods for two person games. For now, we will look at the state-space of the game of chess. The chess board with its pieces, their positions and who to move next (Black or White) constitute a state. A chess move (that takes us from one board position to another) defines a state transition. Which of the following properties are true about the state-space of the game of chess? 1. Exponentially growing search space 2. Decimal representation of the number PI(ratio of circumference to radius of a circle) has more digits than the number of states in the game of chess 3. The state-space is not reversible 4. There are subspaces (subsets of the state-space) which are reversible 5. A pawn move, and independently, a piece capture are irreversible state transitions 6. Every state has at least one incoming edge 7. There are several states that have no outgoing edges

Options

A : 1, 3, 5 and 7

B : 2, 4, and 6

C : 1, 2, 4, 5 and 7

D : All the properties are true.

2. Starting from (8,0,0), what is the least number of transfers required to reach (4,4,0)

Options

A : 7

B : 9

C : 8

D : 5

3. What is the size of the state-space of water jug puzzle?

Options

A : 16

B : 15

C : 14

D : 12

4. Starting from (8,0,0), what is the least number of transfers required to measure 6 liter?

Options

A : 5

B : 4

C : 3

D : 2

5. Starting from (8,0,0), what is the least number of transfers required to measure 1 liter?

Options

A : 4

B : 3

C : 5

D : 6

46. What is the last leaf node inspected by the AlphaBeta algorithm searching from right to left?

Options

A : 20

B : 25

C : 30

D : 40

47. For the game tree in Figure above list the leaf nodes that form the initial clusters in the order inspected by the algorithm SSS*. At all times if there is a choice between more than one candidate node, always select the node on the left.

Options

A : 50, 40, 55, 60, 45, 20

B : 50, 40, 50, 60, 45, 20

C : 50, 40, 55, 50, 45, 20

D : 50, 40, 55, 60, 45, 25

48. For the game tree in above Figure, list the leaf nodes till termination that are inspected after the initial clusters are formed in the order inspected by the algorithm SSS*. At all times if there is a choice between more than one candidate node, always select the node on the left. 1. 57,17,60,70,75,77,80 2. 57, 17, 60, 70, 75, 80 3. 57, 17, 60, 70, 75, 77, 80 4. 57, 17, 60, 70, 75, 80 5. 57, 17, 60, 70, 75, 77, 80, 88 6. 57, 17, 60, 70, 75, 80

Options

A : 1, 2, 3 and 4

B : 1, 3, 5 and 6

C : 2, 3, 4 and 5

D : 1, 2, 3, 4, 5 and 6

49. On the basis of answers to the previous questions, which of the following statements are true? 1. AlphaBeta algorithm searching from left to right explored less number of leaf nodes as compared to AlphaBeta algorithm searching from right to left 2. AlphaBeta algorithm searching from left to right explored more number of leaf nodes as compared to AlphaBeta algorithm searching from right to left 3. AlphaBeta algorithm searching from left to right explored equal number of leaf nodes as compared to AlphaBeta algorithm searching from right to left 4. SSS* would explore more number of nodes as compared to the number of nodes it explored in the given game tree in the figure above, it the heuristic value 19th node from the left to changed from 60 to 15

Options

A : 1, 2 and 3

B : 2 and 4

C : 2 and 3

D : 1 and 4

50. Does the Hill Climbing algorithm find a path to the goal node in the previous question?

Options

A : No

B : Yes

C : Cannot say

D :

51. Does the Best First Search algorithm find a path to the goal node in the previous question?

Options

A : No

B : Yes

C : Cannot say

D :

6. Starting from (8,0,0), what is the least number of transfers required to measure 7 liter?

Options

A : 5

B : 4

C : 6

D : 7

7. Starting from (8,0,0), what is the least number of transfers required to measure 4 liter?

Options

A : 5

B : 6

C : 7

D : 8

8. Which of the following is true about the state-space of water jug puzzle? 1. State-space is reversible 2. Every state is reachable from every other state 3. All eight volumes from 1L to 8L are measurable 4. There is at least one state that has no outgoing edge 5. There is at least one state that has no incoming edge

Options

A : 1, 2, 3 and 4

B : 2,3 and 5

C : 2 and 3

D : All are true

9. In a finite state-space, if a path to goal exists then which of the following search algorithms always find the path? 1. DFS 2. BFS 3. DFID

Options

A : 1 and 2

B : 2 and 3

C : 1, 2 and 3

D : None of the above

10. In a infinite state-space, if a path to goal exists then which of the following search algorithms always find the path? 1. DFS 2. BFS 3. DFID

Options

A : 2 and 3

B : 1 and 3

C : 1 and 2

D : None of the above

11. What is the path found, if any, by Depth First Search?

Options

A : (Type: String) S,A,C,E,G Sting containing all of these (AND): S, A, C, E, G

B : (Type: String) S,B,C,E,G Sting containing all of these (AND): S, B, C, E, G

C : (Type: String) S,A,C,D,G Sting containing all of these (AND): S, A, C, D, G

D : (Type: String) S,A,B,E,G Sting containing all of these (AND): S, A, B, E, G

12. For state-space 11, What is the path found, if any, by Breadth First Search?

Options

A : (Type: String) S,B,D,G Sting containing all of these (AND): S, B, D, G

B : (Type: String) S,A,D,G Sting containing all of these (AND): S, A, D, G

C : (Type: String) S,B,C,G Sting containing all of these (AND): S, B, C, G

D : (Type: String) S,B,E,G Sting containing all of these (AND): S, B, E, G

13. DFS algorithm runs on state-space 11 and adds only new nodes to OPEN list. Identify the search tree (showing both open and closed nodes) produced by DFS algorithm when it picks up the goal node. Here, dashed circles denote open nodes and solid circles denote closed nodes.

Options

A : Tree-1 is the DFS search tree

B : Tree-2 is the DFS search tree

C : Tree-3 is the DFS search tree

D : Tree-4 is the DFS search tree

14. Consider the case where, during node expansion, the neighbors returned by MoveGen that are present in OPEN or CLOSED are not opened again. Now list the first eight nodes visited by DFID on state-space 11, where DFID starts from depth zero. A node is deemed visited if it passes goal test or is closed.

Options

A : (Type: String) S,S,A,B,S,A,C,B String containing all of these (AND): S, S, A, B, S, A, C, B

B : (Type: String) S,S,A,B,S,A,S,B String containing all of these (AND): S, S, A, B, S, A, S, B

C : (Type: String) S,S,A,B,A,C,B String containing all of these (AND): S, S, A, B, A, C, B

D : (Type: String) S,S,A,B,S,A,B,C String containing all of these (AND): S, S, A, B, S, A, B, C

Ugc Net Computer Science - Practice Questions more Online Exam Quiz

Copyright © 2021
Exam-GK-MCQ-Questions.Com | Contact Us | Privacy Policy | Terms of Use | Sitemap | 0.018369913101196