McqMate
| 1. |
Which algorithm is used for solving temporal probabilistic reasoning? |
| A. | hill-climbing search |
| B. | hidden markov model |
| C. | depth-first search |
| D. | breadth-first search |
| Answer» B. hidden markov model | |
| 2. |
How does the state of the process is described in HMM? |
| A. | literal |
| B. | single random variable |
| C. | single discrete random variable |
| D. | none of the mentioned |
| Answer» C. single discrete random variable | |
| 3. |
What are the possible values of the variable? |
| A. | variables |
| B. | literals |
| C. | discrete variable |
| D. | possible states of the world |
| Answer» D. possible states of the world | |
| 4. |
Where does the additional variables are added in HMM? |
| A. | temporal model |
| B. | reality moddel |
| C. | probability model |
| D. | all of the mentioned |
| Answer» A. temporal model | |
| 5. |
Where does the Hidden Markov Model is used? |
| A. | speech recognition |
| B. | understanding of real world |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» A. speech recognition | |
| 6. |
Which algorithm works by first running the standard forward pass to compute? |
| A. | smoothing |
| B. | modified smoothing |
| C. | hmm |
| D. | depth-first search algorithm |
| Answer» B. modified smoothing | |
| 7. |
Which reveals an improvement in online smoothing? |
| A. | matrix formulation |
| B. | revelation |
| C. | hmm |
| D. | none of the mentioned |
| Answer» A. matrix formulation | |
| 8. |
Where does the additional variable is added in HMM? |
| A. | temporal model |
| B. | reality model |
| C. | probability model |
| D. | all of the mentioned |
| Answer» A. temporal model | |
| 9. |
Which allows for a simple and matrix implementation of the entire basic algorithm? |
| A. | hmm |
| B. | restricted structure of hmm |
| C. | temporary model |
| D. | reality model |
| Answer» B. restricted structure of hmm | |
| 10. |
Which variable can give the concrete form to the representation of the transition model? |
| A. | single variable |
| B. | discrete state variable |
| C. | random variable |
| D. | both a & b |
| Answer» D. both a & b | |
| 11. |
Which suggests the existence of efficient recursive algorithm for online smoothing? |
| A. | matrix |
| B. | constant space |
| C. | constant time |
| D. | none of the mentioned |
| Answer» B. constant space | |
| 12. |
Which algorithm is in more similar to backward chaining algorithm? |
| A. | depth-first search algorithm |
| B. | breadth-first search algorithm |
| C. | hill-climbing search algorithm |
| D. | all of the mentioned |
| Answer» A. depth-first search algorithm | |
| 13. |
Which of the following search belongs to totally ordered plan search? |
| A. | forward state-space search |
| B. | hill-climbing search |
| C. | depth-first search |
| D. | breadth-first search |
| Answer» A. forward state-space search | |
| 14. |
Which cannot be taken as advantage for totally ordered plan search? |
| A. | composition |
| B. | state search |
| C. | problem decomposition |
| D. | none of the mentioned |
| Answer» C. problem decomposition | |
| 15. |
What is the advantage of totally ordered plan in constructing the plan? |
| A. | reliability |
| B. | flexibility |
| C. | easy to use |
| D. | all of the mentioned |
| Answer» B. flexibility | |
| 16. |
Which strategy is used for delaying a choice during search? |
| A. | first commitment |
| B. | least commitment |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» B. least commitment | |
| 17. |
Which algorithm place two actions into a plan without specifying which should come first? |
| A. | full-order planner |
| B. | total-order planner |
| C. | semi-order planner |
| D. | partial-order planner |
| Answer» D. partial-order planner | |
| 18. |
How many possible plans are available in partial-order solution? |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 19. |
What is the other name of each and every total-order plans? |
| A. | polarization |
| B. | linearization |
| C. | solarization |
| D. | none of the mentioned |
| Answer» B. linearization | |
| 20. |
What is the study of light? |
| A. | biology |
| B. | light logy |
| C. | photometry |
| D. | all of the mentioned |
| Answer» C. photometry | |
| 21. |
First Order Logic is also known as, |
| A. | first order predicate calculus |
| B. | quantification theory |
| C. | lower order calculus |
| D. | all of the mentioned above |
| Answer» D. all of the mentioned above | |
| 22. |
Which is not Familiar Connectives in First Order Logic? |
| A. | and |
| B. | iff |
| C. | or |
| D. | not |
| Answer» D. not | |
| 23. |
Inference algorithm is complete only if, |
| A. | it can derive any sentence |
| B. | it can derive any sentence that is an entailed version |
| C. | it is truth preserving |
| D. | both b & c |
| Answer» D. both b & c | |
Done Reading?