What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

What does the bayesian network provides?

a) Complete description of the domain

b) Partial description of the domain

c) Complete description of the problem

d) None of the mentioned
by

1 Answer

Answer :

a) Complete description of the domain
by

Related questions

What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Description : What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned

Description : How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned

Last Answer : a) Locally structured

What is the consequence between a node and its predecessors while creating bayesian network? a) Functionally dependent b) Dependant c) Conditionally independent d) Both Conditionally dependant & Dependant

Description : What is the consequence between a node and its predecessors while creating bayesian network? a) Functionally dependent b) Dependant c) Conditionally independent d) Both Conditionally dependant & Dependant

Last Answer : c) Conditionally independent

A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Last Answer : a) Both discrete and continuous variables

What is the consequence between a node and its predecessors while creating Bayesian network? a) Conditionally dependent b) Dependent c) Conditionally independent d) Both a & b

Description : What is the consequence between a node and its predecessors while creating Bayesian network? a) Conditionally dependent b) Dependent c) Conditionally independent d) Both a & b

Last Answer : c) Conditionally independent

The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : d) Both Planning problem & Partial order planning

The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : b) Partial order planning

____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned

Description : ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned

Last Answer : b) Hierarchical task network (HTN)

The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Last Answer : a) Planning problem

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Description : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Last Answer : b) NP complete

Define Bayesian Learning.

Description : Define Bayesian Learning.

Last Answer : It calculates the probability of each hypotheses, given the data and makes predictions on that basis, (i.e.) predictions are made by using all the hypotheses, weighted by their probabilities rather than by using just single “best” hypotheses.

What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

Consider a good system for the representation of knowledge in a particular domain. What property should it possess? a) Representational Adequacy b) Inferential Adequacy c) Inferential Efficiency d) All of the mentioned

Description : Consider a good system for the representation of knowledge in a particular domain. What property should it possess? a) Representational Adequacy b) Inferential Adequacy c) Inferential Efficiency d) All of the mentioned

Last Answer : d) All of the mentioned

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Last Answer : d) Planning Graphs

What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination

Description : What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination

Last Answer : d) Termination

Which inverts a complete resolution strategy? a) Inverse resolution b) Resolution c) Trilogy d) None of the mentioned

Description : Which inverts a complete resolution strategy? a) Inverse resolution b) Resolution c) Trilogy d) None of the mentioned

Last Answer : a) Inverse resolution

Which is the complete specification of the state of the world? a) Atomic event b) Complex event c) Simple event d) None of the mentioned

Description : Which is the complete specification of the state of the world? a) Atomic event b) Complex event c) Simple event d) None of the mentioned

Last Answer : a) Atomic event

What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Description : What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Last Answer : c) Both Logical term & Complete logical sentence

When the resolution is called as refutation-complete? a) Sentence is satisfiable b) Sentence is unsatisfiable c) Sentence remains the same d) None of the mentioned

Description : When the resolution is called as refutation-complete? a) Sentence is satisfiable b) Sentence is unsatisfiable c) Sentence remains the same d) None of the mentioned

Last Answer : b) Sentence is unsatisfiable

What is meant by agent’s percept sequence? a) Used to perceive the environment b) Complete history of actuator c) Complete history of perceived things d) None of the mentioned

Description : What is meant by agent’s percept sequence? a) Used to perceive the environment b) Complete history of actuator c) Complete history of perceived things d) None of the mentioned

Last Answer : c) Complete history of perceived things

A Hybrid Bayesian network contains  Both discrete and continuous variables  Only Discontinuous variable  Both Discrete and Discontinuous variable  Continous variable only.

Description : A Hybrid Bayesian network contains  Both discrete and continuous variables  Only Discontinuous variable  Both Discrete and Discontinuous variable  Continous variable only.

Last Answer :  Both Discrete and Discontinuous variable

Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Last Answer : b) Directed graph

A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Last Answer : c) Transition Network

Which of the following is an application of NN (Neural Network)? a) Sales forecasting b) Data validation c) Risk management d) All of the mentioned

Description : Which of the following is an application of NN (Neural Network)? a) Sales forecasting b) Data validation c) Risk management d) All of the mentioned

Last Answer : d) All of the mentioned

What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Description : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn

Which of the following is an application of NN (Neural Network)? a) Sales forecasting b) Data validation c) Risk management d) All of the mentioned

Description : Which of the following is an application of NN (Neural Network)? a) Sales forecasting b) Data validation c) Risk management d) All of the mentioned

Last Answer : d) All of the mentioned

What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn. d) None of the mentioned

Description : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... network to allow weights to be adjusted so that the network can learn. d) None of the mentioned

Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn.

Which of the following is true for neural networks? (i) The training time depends on the size of the network. (ii) Neural networks can be simulated on a conventional computer. (iii) Artificial neurons are identical in operation to biological ones. a) All of the mentioned b) (ii) is true c) (i) and (ii) are true d) None of the mentioned

Description : Which of the following is true for neural networks? (i) The training time depends on the size of the network. (ii) Neural networks can be simulated on a conventional computer. (iii) Artificial neurons are identical in ... b) (ii) is true c) (i) and (ii) are true d) None of the mentioned

Last Answer : c) (i) and (ii) are true

The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Description : The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Last Answer : c) Tutoring module

What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Description : What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Last Answer : b) Feedback

__________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Last Answer : b) SatPlan

Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Last Answer : c) Problem decomposition

Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Description : Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Last Answer : b) Backward chaining

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned

Description : ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned

Last Answer : b) Dynamic CSPs

Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned

Description : Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned

Last Answer : d) All of the mentioned

Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Last Answer : d) All of the mentioned

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned

Description : A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned

Last Answer : a) Initial state

What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned

Description : What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned

Last Answer : c) All of the mentioned

Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

Description : Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

Last Answer : c) Design problem

What is called an exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) None of the mentioned

Description : What is called an exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) None of the mentioned

Last Answer : a) State and actions are unknown to the agent

In which agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

Description : In which agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

Last Answer : a) Learning agent

What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Description : What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Last Answer : b) Feedback

Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Last Answer : a) True

Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Description : Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Last Answer : c) Partial & local Information

How many possible plans are available in partial-order solution? a) 3 b) 4 c) 5 d) 6

Description : How many possible plans are available in partial-order solution? a) 3 b) 4 c) 5 d) 6

Last Answer : d) 6

Which algorithm places 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

Description : Which algorithm places 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

Last Answer : d) Partial-order planner