Artificial Intelligence Set 4 (30 mcqs)

1. A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.
a) Decision tree
b) Graphs
c) Trees
d) Neural Networks

2. Decision Tree is a display of an algorithm.
a) True
b) False

3. Decision Tree is
a) Flow-Chart
b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label
c) Both a) & b)
d) None of the mentioned
.
4. Decision Trees can be used for Classification Tasks.
a) True
b) False

5. How many types of learning are available in machine learning?
a) 1
b) 2
c) 3
d) 4

6. Choose from the following that are Decision Tree nodes
a) Decision Nodes
b) Weighted Nodes
c) Chance Nodes
d) End Nodes

7. Decision Nodes are represented by,
a) Disks
b) Squares
c) Circles
d) Triangles

8. Chance Nodes are represented by,
a) Disks
b) Squares
c) Circles
d) Triangles

9. End Nodes are represented by,
a) Disks
b) Squares
c) Circles
d) Triangles

10. How the decision tree reaches its decision?
a) Single test
b) Two test
c) Sequence of test
d) No test

11. What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned

12. How many types of informed search method are in artificial intelligence?
a) 1
b) 2
c) 3
d) 4

13. Which search uses the problem specific knowledge beyond the definition of
the problem?
a) Informed search
b) Depth-first search
c) Breadth-first search
d) Uninformed search

14. Which function will select the lowest expansion node atfirst for evaluation?
a) Greedy best-first search
b) Best-first search
c) Both a & b
d) None of the mentioned

15. What is the heuristic function of greedy best-first search?
a) f(n) != h(n)
b) f(n) < h(n)
c) f(n) = h(n)
d) f(n) > h(n)

16. Which search uses only the linear space for searching?
a) Best-first search
b) Recursive best-first search
c) Depth-first search
d) None of the mentioned

17. Which method is used to search better by learning?
a) Best-first search
b) Depth-first search
c) Metalevel state space
d) None of the mentioned

18. Which search is complete and optimal when h(n) is consistent?
a) Best-first search
b) Depth-first search
c) Both a & b
d) A* search

19. Which is used to improve the performance of heuristic search?
a) Quality of nodes
b) Quality of heuristic function
c) Simple form of nodes
d) None of the mentioned

20. Which search method will expand the node that is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned

21. Which data structure is used to give better heuristic estimates?
a) Forwards state-space
b) Backward state-space
c) Planning graph algorithm
d) None of the mentioned

22. Which is used to extract solution directly from the planning graph?
a) Planning algorithm
b) Graph plan
c) Hill-climbing search
d) All of the mentioned

23. What are present in the planning graph?
a) Sequence of levels
b) Literals
c) Variables
d) Heuristic estimates

24. What is the starting level of planning graph?
a) Level 3
b) Level 2
c) Level 1
d) Level 0

25. What are present in each level of planning graph?
a) Literals
b) Actions
c) Variables
d) Both a & b

26. Which kind of problem is suitable for planning graph?
a) Propositional planning problem
b) Planning problem
c) Action problem
d) None of the mentioned

27. What is meant by persistence actions?
a) Allow a literal to remain false
b) Allow a literal to remain true
c) Both a & b
d) None of the mentioned

28. When will further expansion is unnecessary for planning graph?
a) Identical
b) Replicate
c) Not identical
d) None of the mentioned

29. How many conditions are available between two actions in mutex relation?
a) 1
b) 2
c) 3
d) 4

30. What is called inconsistent support?
a) If two literals are not negation of other
b) If two literals are negation of other
c) Mutually exclusive
d) None of the mentioned

 

Answers

1-a 2-a 3-c 4-a 5-c
6-a,c,d 7-b 8-c 9-d 10-c
11-b 12-d 13-a 14-b 15-c
16-b 17-c 18-d 19-b 20-b
21-c 22-b 23-a 24-d 25-d
26-a 27-b 28-a 29-c 30-b

Sharing is caring!

Leave a Comment

Your email address will not be published. Required fields are marked *

shares