Question 1

Where does the Hidden Markov Model is used?

Accepted Answer

A)  speech recognition
B)  understanding of real world
C)  both a & b
D)  none of the mentioned A

Question 2

Which of the following search belongs to totally ordered plan search?

Accepted Answer

A)  forward state-space search
B)  hill-climbing search
C)  depth-first search
D)  breadth-first search A

Question 3

What is the advantage of totally ordered plan in constructing the plan?

Accepted Answer

A)  reliability
B)  flexibility
C)  easy to use
D)  all of the mentioned B

Question 4

What are the possible values of the variable?

Accepted Answer

A)  variables
B)  literals
C)  discrete variable
D)  possible states of the world

Question 5

Which variable can give the concrete form to the representation of the transition model?

Accepted Answer

A)  single variable
B)  discrete state variable
C)  random variable
D)  both a & b

Question 6

First Order Logic is also known as,

Accepted Answer

A)  first order predicate calculus
B)  quantification theory
C)  lower order calculus
D)  all of the mentioned above

Question 7

Inference algorithm is complete only if,

Accepted Answer

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

Question 8

Which suggests the existence of efficient recursive algorithm for online smoothing?

Accepted Answer

A)  matrix
B)  constant space
C)  constant time
D)  none of the mentioned

Question 9

Which algorithm place two actions into a plan without specifying which should come first?

Accepted Answer

A)  full-order planner
B)  total-order planner
C)  semi-order planner
D)  partial-order planner

Question 10

Where does the additional variable is added in HMM?

Accepted Answer

A)  temporal model
B)  reality model
C)  probability model
D)  all of the mentioned

Question 11

Which algorithm is used for solving temporal probabilistic reasoning?

Accepted Answer

A)  hill-climbing search
B)  hidden markov model
C)  depth-first search
D)  breadth-first search

Question 12

Which algorithm works by first running the standard forward pass to compute?

Accepted Answer

A)  smoothing
B)  modified smoothing
C)  hmm
D)  depth-first search algorithm

Question 13

Which cannot be taken as advantage for totally ordered plan search?

Accepted Answer

A)  composition
B)  state search
C)  problem decomposition
D)  none of the mentioned

Question 14

Where does the additional variables are added in HMM?

Accepted Answer

A)  temporal model
B)  reality moddel
C)  probability model
D)  all of the mentioned

Question 15

Which reveals an improvement in online smoothing?

Accepted Answer

A)  matrix formulation
B)  revelation
C)  hmm
D)  none of the mentioned

Question 16

Which strategy is used for delaying a choice during search?

Accepted Answer

A)  first commitment
B)  least commitment
C)  both a & b
D)  none of the mentioned

Question 17

How does the state of the process is described in HMM?

Accepted Answer

A)  literal
B)  single random variable
C)  single discrete random variable
D)  none of the mentioned

Question 18

Which algorithm is in more similar to backward chaining algorithm?

Accepted Answer

A)  depth-first search algorithm
B)  breadth-first search algorithm
C)  hill-climbing search algorithm
D)  all of the mentioned

Question 19

What is the study of light?

Accepted Answer

A)  biology
B)  light logy
C)  photometry
D)  all of the mentioned

Question 20

How many possible plans are available in partial-order solution?

Accepted Answer

A)  3
B)  4
C)  5
D)  6

Exam 1: Algorithms and Logic in Probabilistic Reasoning and Planning