Top 50+ Solved Pattern Recognition MCQ Questions Answer
Q. 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
Q. 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
Q. What are the possible values of the variable?
a. variables
b. literals
c. discrete variable
d. possible states of the world
Q. Where does the additional variables are added in HMM?
a. temporal model
b. reality moddel
c. probability model
d. all of the mentioned
Q. 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
Q. Which algorithm works by first running the standard forward pass to compute?
a. smoothing
b. modified smoothing
c. hmm
d. depth-first search algorithm
Q. Which reveals an improvement in online smoothing?
a. matrix formulation
b. revelation
c. hmm
d. none of the mentioned
Q. Where does the additional variable is added in HMM?
a. temporal model
b. reality model
c. probability model
d. all of the mentioned
Q. 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
Q. 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
Q. Which suggests the existence of efficient recursive algorithm for online smoothing?
a. matrix
b. constant space
c. constant time
d. none of the mentioned
Q. 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
Q. 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
Q. Which cannot be taken as advantage for totally ordered plan search?
a. composition
b. state search
c. problem decomposition
d. none of the mentioned
Q. 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