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

What is the other name of each plan resulted in partial order planning?

a) Polarization

b) Linearization

c) Solarization

d) None of the mentioned
by

1 Answer

Answer :

b) Linearization
by

Related questions

What is the other name of each and every total-order plans? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each and every total-order plans? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

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

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

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

Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False

Description : Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False

Last Answer : a) True

Partial-order planning is the opposite of total-order planning. a) True b) False

Description : Partial-order planning is the opposite of total-order planning. a) True b) False

Last Answer : a) True

Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False

Description : Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False

Last Answer : a) True

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

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

In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the correct option. a) A is true b) B is true c) Either A or B can be true depending upon situation d) Neither A nor B is true

Description : In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the ... ) Either A or B can be true depending upon situation d) Neither A nor B is true

Last Answer : a) A is true

Which kind of planning consists of successive representations of different levels of a plan? a) hierarchical planning b) non-hierarchical planning c) project planning d) all of the mentioned

Description : Which kind of planning consists of successive representations of different levels of a plan? a) hierarchical planning b) non-hierarchical planning c) project planning d) all of the mentioned

Last Answer : a) hierarchical planning

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

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

What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

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 technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned

Description : Which technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned

Last Answer : b) specification by example

____________ 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)

__________ 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

When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned

Description : When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned

Last Answer : a) Identical

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 is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned

Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned

Last Answer : c) Planning graph algorithm

Which of the following are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned

Description : Which of the following are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned

Last Answer : d) All of the mentioned

Artificial Intelligence has its expansion in the following application. a) Planning and Scheduling b) Game Playing c) Diagnosis d) All of the mentioned

Description : Artificial Intelligence has its expansion in the following application. a) Planning and Scheduling b) Game Playing c) Diagnosis d) All of the mentioned

Last Answer : d) All of the mentioned

Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Description : Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Last Answer : a) Hierarchical planning

Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Last Answer : c) Execution monitoring

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Last Answer : d) Hierarchical plan

Which kind of planning consists of successive representations of different levels of a plan? a. hierarchical planning b. non-hierarchical planning c. All of the above d. project planning

Description : Which kind of planning consists of successive representations of different levels of a plan? a. hierarchical planning b. non-hierarchical planning c. All of the above d. project planning

Last Answer : a. hierarchical planning

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

For a signal conditioner explain the terms linearization and signal conversion.

Description : For a signal conditioner explain the terms linearization and signal conversion.

Last Answer : Definition :  1. linearization : Many primary elements produce nonlinear outputs and the signal must be linearized to produce a nearly ideal calibration. Specialized analog circuits such as offsetting circuits, ... signal. Even computer algorithms are also used. 2.Signal conversion :

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

What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

Description : What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

Last Answer : a) Deterministic

What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both Partial & Fully

Description : What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both Partial & Fully

Last Answer : d) Both Partial & Fully

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

Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Description : Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Last Answer : a) First-order logic

Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Description : Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Last Answer : a) First-order definite clause are similar to propositional forward chaining

Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Description : Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Last Answer : b) No function symbols

What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Description : What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Last Answer : b) Universally quantified

Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Description : Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Last Answer : c) Every sentence of first-order logic

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned

Description : How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned

Last Answer : a) Depends on the nodes

What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Last Answer : d) Both Literals & Actions

One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False

Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False

Last Answer : a) True

Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Description : Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Last Answer : d) all of the mentioned

What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Description : What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) ... branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Last Answer : c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned