Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Forward chaining systems are _____________ where as backward chaining systems are ___________

a) Goal-driven, goal-driven

b) Goal-driven, data-driven

c) Data-driven, goal-driven

d) Data-driven, data-driven
by

1 Answer

Answer :

c) Data-driven, goal-driven
by

Related questions

Forward chaining systems are ............. where as backward chaining systems are ................ (A) Data driven, Data driven (B) Goal driven, Data driven (C) Data driven, Goal driven (D) Goal driven, Goal driven

Description : Forward chaining systems are ............. where as backward chaining systems are ................ (A) Data driven, Data driven (B) Goal driven, Data driven (C) Data driven, Goal driven (D) Goal driven, Goal driven

Last Answer : (C) Data driven, Goal driven 

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

There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False

Description : There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False

Last Answer : a) True

Which is mainly used for automated reasoning? a) Backward chaining b) Forward chaining c) Logic programming d) Parallel programming

Description : Which is mainly used for automated reasoning? a) Backward chaining b) Forward chaining c) Logic programming d) Parallel programming

Last Answer : c) Logic programming

Reasoning strategies used in expert systems include ............... (A) Forward chaining, backward chaining and problem reduction (B) Forward chaining, backward chaining and boundary mutation (C) Forward chaining, backward chaining and back propagation (D) Backward chaining, problem reduction and boundary mutation

Description : Reasoning strategies used in expert systems include ............... (A) Forward chaining, backward chaining and problem reduction (B) Forward chaining, backward chaining and boundary ... chaining, backward chaining and back propagation (D) Backward chaining, problem reduction and boundary mutation

Last Answer : (A) Forward chaining, backward chaining and problem reduction

In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those facts. a) True b) False

Description : In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those facts. a) True b) False

Last Answer : b) False

Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

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

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

Last Answer : a) Depth-first search algorithm

What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned

Description : What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned

Last Answer : b) Substitutes matching the query

Define backward chaining.

Description : Define backward chaining.

Last Answer : This algorithm works backward from the goal, chaining through rules to find known facts that support the proof.

How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Description : How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

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 condition is used to cease the growth of forward chaining? a) Atomic sentences b) Complex sentences c) No further inference d) All of the mentioned

Description : Which condition is used to cease the growth of forward chaining? a) Atomic sentences b) Complex sentences c) No further inference d) All of the mentioned

Last Answer : c) No further inference

A perceptron is a ______________ a) Feed-forward neural network b) Backpropagation algorithm c) Backtracking algorithm d) Feed Forward-backward algorithm

Description : A perceptron is a ______________ a) Feed-forward neural network b) Backpropagation algorithm c) Backtracking algorithm d) Feed Forward-backward algorithm

Last Answer : a) Feed-forward neural network

A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Last Answer : a) Feed-forward neural network

Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent

Description : Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent

Last Answer : d) Goal Based & Online agent

Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Last Answer : c) The one closest to the goal node

A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Last Answer : d) All of the mentioned

Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

Description : Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

Last Answer : d) Informed & Heuristic Search

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

___________ is the process of recreating a design by analyzing a final product. a. Forward Engineering b. Reverse Engineering c Backward Engineering d. None of the above.

Description : ___________ is the process of recreating a design by analyzing a final product. a. Forward Engineering b. Reverse Engineering c Backward Engineering d. None of the above.

Last Answer : a. Forward Engineering

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

Shaping teaching techniques to fit the learning patterns of individual students is the goal of __________ a) decision support b) automatic programming c) intelligent computer-assisted instruction d) expert systems

Description : Shaping teaching techniques to fit the learning patterns of individual students is the goal of __________ a) decision support b) automatic programming c) intelligent computer-assisted instruction d) expert systems

Last Answer : c) intelligent computer-assisted instruction

When channel members assume responsibility for one or more of the marketing flows over at least two separate levels of distribution manufacturing and wholesaling, in fact, such systems are synonymous with both forward and backward vertical integration is known as………… A. Corporate vertical marketing systems B. Contractual vertical marketing systems C. Administered vertical marketing systems D. None of the above

Description : When channel members assume responsibility for one or more of the marketing flows over at least two separate levels of distribution manufacturing and wholesaling, in fact, such systems are synonymous ... vertical marketing systems C. Administered vertical marketing systems D. None of the above

Last Answer : A. Corporate vertical marketing systems

Natural language understanding is used in _____________ a) natural language interfaces b) natural language front ends c) text understanding systems d) all of the mentioned

Description : Natural language understanding is used in _____________ a) natural language interfaces b) natural language front ends c) text understanding systems d) all of the mentioned

Last Answer : d) all of the mentioned

The network that involves backward links from output to the input and hidden layers is called _________ a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Description : The network that involves backward links from output to the input and hidden layers is called _________ a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Last Answer : c) Recurrent neural network

What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

The network that involves backward links from output to the input and hidden layers is called as ____. a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Description : The network that involves backward links from output to the input and hidden layers is called as ____. a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Last Answer : c) Recurrent neural network

Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Last Answer : d) All of the mentioned

The technique in which a congested node stops receiving data from the immediate upstream node or nodes is called as _______ A. Admission policy B. Backpressure C. Forward signaling D. Backward signaling

Description : The technique in which a congested node stops receiving data from the immediate upstream node or nodes is called as _______ A. Admission policy B. Backpressure C. Forward signaling D. Backward signaling

Last Answer : B. Backpressure

As the resources are reserved between two communicating end systems in circuit switching, ___________ is achieved. a) authentication b) guaranteed constant rate c) reliability d) store and forward

Description : As the resources are reserved between two communicating end systems in circuit switching, ___________ is achieved. a) authentication b) guaranteed constant rate c) reliability d) store and forward

Last Answer : b) guaranteed constant rate

What are the two data structures that make IR systems efficient?

Description : What are the two data structures that make IR systems efficient?

Last Answer : i. Lexicon  ii.Inverted Index

Testing of software used to convert data from existing systems for use in replacement systems A. Data driven testing B. Migration testing C. Configuration testing D. Back to back testing

Description : Testing of software used to convert data from existing systems for use in replacement systems A. Data driven testing B. Migration testing C. Configuration testing D. Back to back testing

Last Answer : B. Migration testing

What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Last Answer : a) An initial state and one or more goal states

Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Description : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Last Answer : d) All of the mentioned

Which approach is to pretend that a pure divide and conquer algorithm will work? a) Goal independence b) Subgoal independence c) Both Goal & Subgoal independence d) None of the mentioned

Description : Which approach is to pretend that a pure divide and conquer algorithm will work? a) Goal independence b) Subgoal independence c) Both Goal & Subgoal independence d) None of the mentioned

Last Answer : b) Subgoal independence

Flexible CSPs relax on _______ a) Constraints b) Current State c) Initial State d) Goal State

Description : Flexible CSPs relax on _______ a) Constraints b) Current State c) Initial State d) Goal State

Last Answer : a) Constraints

What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Last Answer : d) All of the mentioned

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

Last Answer : a) True

Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Last Answer : c) Estimated cost of cheapest path from root to goal node

The name “best-first search” is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function. a) True b) False

Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False

Last Answer : a) True

Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned

Description : Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned

Last Answer : b) Greedy best-first search

The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Last Answer : a) True

Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent

Description : Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent

Last Answer : a) Intelligent goal-based agent

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

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

When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

Description : When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

Last Answer : c) A goal state is reachable from every state