Deck 1: Algorithms and Logic in Probabilistic Reasoning and Planning

Question 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 1

hidden markov model

Question 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 2

single discrete random variable

Question 3

What are the possible values of the variable?

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

Answer 3

possible states of the world

Question 4

Where does the additional variables are added in HMM?

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

Question 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

Question 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

Question 7

Which reveals an improvement in online smoothing?

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

Question 8

Where does the additional variable is added in HMM?

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

Question 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

Question 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

Question 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

Question 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

Question 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

Question 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

Question 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

Question 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

Question 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

Question 18

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

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

Question 19

What is the other name of each and every total-order plans?

A)polarization
B)linearization
C)solarization
D)none of the mentioned

Question 20

What is the study of light?

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

Question 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

Question 22

Which is not Familiar Connectives in First Order Logic?

A)and
B)iff
C)or
D)not

Question 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