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

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
by

1 Answer

Answer :

c) A goal state is reachable from every state
by

Related questions

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 values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

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

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

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

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

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 the other is 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 the other is d) All of the mentioned

Last Answer : d) All of the mentioned

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

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

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

Prior to the invention of time-sharing, the prevalent method of computer access was ____________ a) batch processing b) telecommunication c) remote access d) all of the mentioned

Description : Prior to the invention of time-sharing, the prevalent method of computer access was ____________ a) batch processing b) telecommunication c) remote access d) all of the mentioned

Last Answer : a) batch processing

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

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

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

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 implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search

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

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

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

I keep getting "access denied to: /PIE.htc" from gmail

Description : I keep getting "access denied to: /PIE.htc" from gmail

Last Answer : Need Answer

.............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes. A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Description : .............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes. A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Last Answer : D) Starvation

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

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

Last Answer : c) Data-driven, goal-driven

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

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

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

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

Which action sequences are used to achieve the agent’s goal? a) Search b) Plan c) Retrieve d) Both Search & Plan

Description : Which action sequences are used to achieve the agent’s goal? a) Search b) Plan c) Retrieve d) Both Search & Plan

Last Answer : d) Both Search & Plan

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

In ____ the goal is for the software to use what it has learned in one area to solve problems in other areas. A. Machine Learning B. Deep Learning C. Neural Networks D. None of these

Description : In ____ the goal is for the software to use what it has learned in one area to solve problems in other areas. A. Machine Learning B. Deep Learning C. Neural Networks D. None of these

Last Answer : B. Deep Learning 

Fun things to do in Seattle (reachable via public transit from Capitol Hill)?

Description : Fun things to do in Seattle (reachable via public transit from Capitol Hill)?

Last Answer : answer:Go for a walk in Ravenna Park. It’s beautiful and sort of stuck in a ravine. Or take the ferry to Bainbridge. I’m not from Seattle but I used to visit three or four times a year, and these are two things I’d do for fun on afternoons without appointments.

Where are the prettiest places in Switzerland that are reachable by train?

Description : Where are the prettiest places in Switzerland that are reachable by train?

Last Answer : Check out the ‘Top Destinations’ and ‘Mountain Resorts’ here: http://www.magicswitzerland.com/train_travel.htm and you should definitely try the Panorama express http://www.raileurope.com/europe-travel-guide/switzerland/index.html?WT.mc_id=CJ.swiss_travel.affiliates&collectCGIParams=1

To ensure the effectiveness of segmentation, the segments should be measurable, substantial, accessible, and : 1. precise 2. stable 3. economic 4. reachable 5. none of these

Description : To ensure the effectiveness of segmentation, the segments should be measurable, substantial, accessible, and : 1. precise 2. stable 3. economic 4. reachable 5. none of these

Last Answer : stable

To ensure the effectiveness of segmentation, the segments should be measurable, substantial, accessible, and: A)precise B)stable C)economic D)reachable

Description : To ensure the effectiveness of segmentation, the segments should be measurable, substantial, accessible, and: A)precise B)stable C)economic D)reachable

Last Answer : B)stable

Why God/Nature puts Unreachable Women in our paths, even though there's no way to have a relationship with them?

Description : Why God/Nature puts Unreachable Women in our paths, even though there's no way to have a relationship with them?

Last Answer : answer:Hot girls? Be very careful what you ask for. However… if that’s what you want, and you’re not hot yourself, then pursue riches. The sultry dame you want is more attracted to sugar daddy than home boy.

I am the unreachable boundary, yet the place you wish to go, I run away as you approach. But I am always there. What am I? -Riddles

Description : I am the unreachable boundary, yet the place you wish to go, I run away as you approach. But I am always there. What am I? -Riddles

Last Answer : The Horizon.

What exists but no-body can enter and is unreachable in life? -Riddles

Description : What exists but no-body can enter and is unreachable in life? -Riddles

Last Answer : Heaven.

I come in darkness, but fill the mind with light. I bring enlightenment to some, while gripping others in the hand of fear. With me it can be a journey of inexplicable joy and sorrow. What I will show you will often be unreachable. Journey with me and what you see may haunt you. Journey with me and you may never want to return home. Journey with me and you will never know when it will end. What am I? -Riddles

Description : I come in darkness, but fill the mind with light. I bring enlightenment to some, while gripping others in the hand of fear. With me it can be a journey of inexplicable joy and sorrow. What I will show ... to return home. Journey with me and you will never know when it will end. What am I? -Riddles

Last Answer : Your dreams.

Which protocol carries messages such as destination Unreachable, Time Exceeded, Parameter Problem, Source Quench, Redirect, Echo, Echo Reply, Timestamp, Information Request, Information Reply, Address Request, and Address Reply? * ICMP * UDP * TCP * TFTP

Description : Which protocol carries messages such as destination Unreachable, Time Exceeded, Parameter Problem, Source Quench, Redirect, Echo, Echo Reply, Timestamp, Information Request, Information Reply, Address Request, and Address Reply? * ICMP * UDP * TCP * TFTP

Last Answer : Correct answer: A ICMP (Internet Control Message Protocol) is a network layer internet protocol described in RFC # 792. ICMP reports IP packet information such as destination Unreachable, Time ... Echo Reply, Timestamp, Information Request, Information Reply, Address Request, and Address Reply.

7.How does traceroute work? A. It uses an ICMP destination-unreachable message to elicit the name of a router. B. It sends a specially crafted IP packet to a router to locate the number of hops from the sender to the destination network. C. It uses a protocol that will be rejected by the gateway to determine the location. D. It uses the TTL value in an ICMP message to determine the number of hops from the sender to the router.

Description : 7.How does traceroute work? A. It uses an ICMP destination-unreachable message to elicit the name of a router. B. It sends a specially crafted IP packet to a router to locate the number of hops from ... the TTL value in an ICMP message to determine the number of hops from the sender to the router.

Last Answer : D. It uses the TTL value in an ICMP message to determine the number of hops from the sender to the router.

Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Description : Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Last Answer : b) Word Sense Disambiguation

____________ is measured by the number of mental structures we use, how abstract they are, and how elaborate they interact to shape our perceptions. a) intrapersonal structure b) perceptual set c) self-justification d) none of the mentioned

Description : ____________ is measured by the number of mental structures we use, how abstract they are, and how elaborate they interact to shape our perceptions. a) intrapersonal structure b) perceptual set c) self-justification d) none of the mentioned

Last Answer : d) none of the mentioned

Which is used to capture the internal structure of the phones? a) One-state phone model b) Two-state phone model c) Three-state phone mone d) All of the mentioned

Description : Which is used to capture the internal structure of the phones? a) One-state phone model b) Two-state phone model c) Three-state phone mone d) All of the mentioned

Last Answer : c) Three-state phone mone

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

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

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

Last Answer : c) Single discrete random variable

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