1. Knowledge and reasoning also play a crucial role in dealing with __________________ environment.
a) Completely Observable
b) Partially Observable
c) Neither a nor b
d) Only a and b
2. Treatment chosen by doctor for a patient for a disease is based on
a) Only current symptoms
b) Current symptoms plus some knowledge from the textbooks
c) Current symptoms plus some knowledge from the textbooks plus experience
d) Only a and b
3. A knowledge-based agent can combine general knowledge with current percepts to infer hidden aspects of the current state prior to selecting actions. State whether True or False.
a) True
b) False
4. A) Knowledge base (KB) is consists of set of statements.
B) Inference is deriving a new sentence from the KB.
Choose the correct option.
a) A is true, B is true
b) A is false, B is false
c) A is true, B is false
d) A is false, B is true
5. Wumpus World is a classic problem, best example of,
a) Single player Game
b) Two player Game
c) Reasoning with Knowledge
d) Knowledge based Game
6. ‘α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in which α is _____, β is also _____.
a) True, true
b) True, false
c) False, true
d) False, false
7. Which is created by using single propositional symbol?
a) Complex sentences
b) Atomic sentences
c) Composition sentences
d) None of the mentioned
8. Which is used to construct the complex sentences?
a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned
9. How many proposition symbols are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
10. How many logical connectives are there in artificial intelligence?
a) 2
b) 3
c) 4
d) 5
11. Following is an extension of the semantic network.
a) Expert Systems
b) Rule Based Expert Systems
c) Decision Tree Based networks
d) Partitioned networks
12. Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node.
a) True
b) False
13. Semantic Network represents
a) Syntactic relation between concepts
b) Semantic relations between concepts
c) Both a & b
d) Neither a nor b
14. A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another.
a) True
b) False
15. What are the limitations of the semantic networks?
a) Intractability
b) Lack in expressing some of the properties
c) Incomplete
d) Has memory constraints
16. What among the following is/are the best example of semantic networks?
a) Wordnet
b) Human Food Chain
c) MYSIN
d) Autonomous car driver
17. Semantic Network is also known as Frame networks.
a) True
b) False
18. Synonymy relation means,
a) A is part of B
b) A denotes same as B
c) A is a kind of B
d) A is superordinate of B
19. Antonymy relation means,
a) A is part of B
b) B has A as a part of itself
c) A denotes opposite of B
d) A is superordinate of B
20. Most semantic networks are not cognitive based.
a) True
b) False
21. Which search is equal to minimax search but eliminates the branches that
can’t influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
22. Which values are independant in minimax search algorithm?
a) Pruned leaves x and y
b) Every states are dependant
c) Root is independant
d) None of the mentioned
23. To which depth does the alpha-beta pruning can be applied?
a) 10 states
b) 8 States
c) 6 States
d) Any depth
24. Which search is similar to minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned
25. Which value is assigned to alpha and beta in the alpha-beta pruning?
a) Alpha = max
b) Beta = min
c) Beta = max
d) Both a & b
26. Where does the values of alpha-beta search get updated?
a) Along the path of search
b) Initial state itself
c) At the end
d) None of the mentioned
27. How the effectiveness of the alpha-beta pruning gets increased?
a) Depends on the nodes
b) Depends on the order in which they are executed
c) Both a & b
d) None of the mentioned
28. What is called as transposition table?
a) Hash table of next seen positions
b) Hash table of previously seen positions
c) Next value in the search
d) None of the mentioned
29. Which is identical to the closed list in Graph search?
a) Hill climbing search algorithm
b) Depth-first search
c) Transposition table
d) None of the mentioned
30. Which function is used to calculate the feasibility of whole game tree?
a) Evaluation function
b) Transposition
c) Alpha-beta pruning
d) All of the mentioned
Answers
| 1-b | 2-c | 3-a | 4-a | 5-c |
| 6-a | 7-b | 8-c | 9-b | 10-d |
| 11-d | 12-a | 13-b | 14-a | 15-a,b |
| 16-a,b | 17-a | 18-b | 19-c | 20-b |
| 21-c | 22-a | 23-d | 24-b | 25-d |
| 26-a | 27-a | 28-b | 29-c | 30-a |