Advanced Neural Network And Fuzzy System Set 3
On This Page
This set of Advanced Neural Network and Fuzzy System Multiple Choice Questions & Answers (MCQs) focuses on Advanced Neural Network And Fuzzy System Set 3
Q1 | 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.
- decision tree
- graphs
- trees
- neural networks
Q2 | Decision Tree is
- flow-chart
- structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label
- both a) & b)
- none of the mentioned
Q3 | How many types of learning are available in machine learning?
- 1
- 2
- 3
- 4
Q4 | Choose from the following that are Decision Tree nodes
- decision nodes
- weighted nodes
- chance nodes
- end nodes
Q5 | Decision Nodes are represented by,
- disks
- squares
- circles
- triangles
Q6 | Chance Nodes are represented by,
- disks
- squares
- circles
- triangles
Q7 | End Nodes are represented by,
- disks
- squares
- circles
- triangles
Q8 | How the decision tree reaches its decision?
- single test
- two test
- sequence of test
- no test
Q9 | What is the other name of informed search strategy?
- simple search
- heuristic search
- online search
- none of the mentioned
Q10 | How many types of informed search method are in artificial intelligence?
- 1
- 2
- 3
- 4
Q11 | Which function will select the lowest expansion node atfirst for evaluation?
- greedy best-first search
- best-first search
- both a & b
- none of the mentioned
Q12 | What is the heuristic function of greedy best-first search?
- f(n) != h(n)
- f(n) < h(n)
- f(n) = h(n)
- f(n) > h(n)
Q13 | Which search uses only the linear space for searching?
- best-first search
- recursive best-first search
- depth-first search
- none of the mentioned
Q14 | Which method is used to search better by learning?
- best-first search
- depth-first search
- metalevel state space
- none of the mentioned
Q15 | Which search is complete and optimal when h(n) is consistent?
- best-first search
- depth-first search
- both a & b
- a* search
Q16 | Which is used to improve the performance of heuristic search?
- quality of nodes
- quality of heuristic function
- simple form of nodes
- none of the mentioned
Q17 | Which search method will expand the node that is closest to the goal?
- best-first search
- greedy best-first search
- a* search
- none of the mentioned
Q18 | Which data structure is used to give better heuristic estimates?
- forwards state-space
- backward state-space
- planning graph algorithm
- none of the mentioned
Q19 | Which is used to extract solution directly from the planning graph?
- planning algorithm
- graph plan
- hill-climbing search
- all of the mentioned
Q20 | What are present in the planning graph?
- sequence of levels
- literals
- variables
- heuristic estimates
Q21 | What is the starting level of planning graph?
- level 3
- level 2
- level 1
- level 0
Q22 | What are present in each level of planning graph?
- literals
- actions
- variables
- both a & b
Q23 | Which kind of problem is suitable for planning graph?
- propositional planning problem
- planning problem
- action problem
- none of the mentioned
Q24 | What is meant by persistence actions?
- allow a literal to remain false
- allow a literal to remain true
- both a & b
- none of the mentioned
Q25 | When will further expansion is unnecessary for planning graph?
- identical
- replicate
- not identical
- none of the mentioned