Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Optimality of BFS is ___________

a) When there is less number of nodes

b) When all step costs are equal

c) When all step costs are unequal

d) None of the mentioned
by

1 Answer

Answer :

b) When all step costs are equal
by

Related questions

When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Description : When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Last Answer : b) When all step costs are equal

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

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 data structure conveniently used to implement BFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned

Description : Which data structure conveniently used to implement BFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned

Last Answer : b) Queues

Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Last Answer : d) All of the mentioned

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Last Answer : b) False

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

_____________ 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

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

DFS is ______ efficient and BFS is __________ efficient. a) Space, Time b) Time, Space c) Time, Time d) Space, Space

Description : DFS is ______ efficient and BFS is __________ efficient. a) Space, Time b) Time, Space c) Time, Time d) Space, Space

Last Answer : a) Space, Time

The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

Differentiate BFS & DFS.

Description : Differentiate BFS & DFS.

Last Answer : BFS means breath wise search. Space complexity is more. Do not give optimal solution Queuing fn is same as that of queue operator DFS means depth wise search. Space complexity is less Gives optimal solution Queuing fn is somewhat different from queue operator.

Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned

Description : Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes 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

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

Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

Last Answer : b) Quality of heuristic function

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

Two literals are complementary if _____________ a) They are equal b) They are identical and of equal sign c) They are identical but of opposite sign d) They are unequal but of equal sign

Description : Two literals are complementary if _____________ a) They are equal b) They are identical and of equal sign c) They are identical but of opposite sign d) They are unequal but of equal sign

Last Answer : c) They are identical but of opposite sign

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

In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned

Description : In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned

Last Answer : d) all of the mentioned

A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Description : A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Last Answer : d) all of the mentioned

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

MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Description : MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Last Answer : b) human factors

What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned

Description : What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned

Last Answer : d) All of the mentioned

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

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms 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

. ___________ was built primarily as the fundamental storage service for Google’s search engine. a) BFS b) HDFS c) GFS d) GAE

Description : . ___________ was built primarily as the fundamental storage service for Google’s search engine. a) BFS b) HDFS c) GFS d) GAE

Last Answer : 200 TB

___________ was built primarily as the fundamental storage service for Google’s search engine. a) BFS b) HDFS c) GFS d) GAE

Description : ___________ was built primarily as the fundamental storage service for Google’s search engine. a) BFS b) HDFS c) GFS d) GAE

Last Answer : GFS

End Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles

Description : End Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles

Last Answer : d) Triangles

Chance Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles

Description : Chance Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles

Last Answer : c) Circles

Decision Nodes are represented by ____________ a) Disks b) Squares c) Circles d) Triangles

Description : Decision Nodes are represented by ____________ a) Disks b) Squares c) Circles d) Triangles

Last Answer : b) Squares

Which of the following is not the promise of artificial neural network? a) It can explain result b) It can survive the failure of some nodes c) It has inherent parallelism d) It can handle noise

Description : Which of the following is not the promise of artificial neural network? a) It can explain result b) It can survive the failure of some nodes c) It has inherent parallelism d) It can handle noise

Last Answer : a) It can explain result

The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False

Description : Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False

Last Answer : a) True

The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Last Answer : a) Depth-limited search

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

In artificial Neural Network interconnected processing elements are called A. nodes or neurons B. weights C. axons D. Soma

Description : In artificial Neural Network interconnected processing elements are called A. nodes or neurons B. weights C. axons D. Soma

Last Answer : A. nodes or neurons

Which of the following is not the promise of artificial neural network? a) It can explain result b) It can survive the failure of some nodes c) It has inherent parallelism d) It can handle noise

Description : Which of the following is not the promise of artificial neural network? a) It can explain result b) It can survive the failure of some nodes c) It has inherent parallelism d) It can handle noise

Last Answer : a) It can explain result

Which of the following is not a potential for a ranking problem between two mutua lly exclusive projects? A. The projects have unequal lives that differ by several years. B. The costs of the two projects differ by nearly 30%. C. The two projects have cash flow patterns that differ dramatically. D. One of the mutually exclusive projects involves replacement while the other involves expansion.

Description : Which of the following is not a potential for a ranking problem between two mutua lly exclusive projects? A. The projects have unequal lives that differ by several years. B. The ... dramatically. D. One of the mutually exclusive projects involves replacement while the other involves expansion.

Last Answer : A. The projects have unequal lives that differ by several years.

Which of the following is not a potential for a ranking problem between two mutua lly exclusive projects? A. The projects have unequal lives that differ by several years. B. The costs of the two projects differ by nearly 30%. C. The two projects have cash flow patterns that differ dramatically. D. One of the mutually exclusive projects involves replacement while the other involves expansion

Description : Which of the following is not a potential for a ranking problem between two mutua lly exclusive projects? A. The projects have unequal lives that differ by several years. B. The ... dramatically. D. One of the mutually exclusive projects involves replacement while the other involves expansion

Last Answer : A. The projects have unequal lives that differ by several years

Which of the following is not a potential for a ranking problem between two mutua lly exclusive projects? A. The projects have unequal lives that differ by several years B. The costs of the two projects differ by nearly 30%. C. The two projects have cash flow patterns that differ dramatically D. One of the mutually exclusive projects involves replacement while the other involves expansion

Description : Which of the following is not a potential for a ranking problem between two mutua lly exclusive projects? A. The projects have unequal lives that differ by several years B. The ... dramatically D. One of the mutually exclusive projects involves replacement while the other involves expansion

Last Answer : A. The projects have unequal lives that differ by several years

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

In LISP, what is the function (list-length <list>)? a) returns a new list that is equal to &lt:list> by copying the top-level element of <list> b) returns the length of <list> c) returns t if <list> is empty d) all of the mentioned

Description : In LISP, what is the function (list-length )? a) returns a new list that is equal to <:list> by copying the top-level element of b) returns the length of c) returns t if is empty d) all of the mentioned

Last Answer : b) returns the length of

In LISP, the function (copy-list <list>) a) returns a new list that is equal to <list> by copying the top-level element of <list> b) returns the length of <list> c) returns t if <list> is empty d) all of the mentioned

Description : In LISP, the function (copy-list ) a) returns a new list that is equal to by copying the top-level element of b) returns the length of c) returns t if is empty d) all of the mentioned

Last Answer : a) returns a new list that is equal to by copying the top-level element of

A solid shaft of same cross sectional area and of same material as that of a hollow shaft can resist a. Less torque. b. More torque. c. Equal torque. d. Unequal torque.

Description : A solid shaft of same cross sectional area and of same material as that of a hollow shaft can resist a. Less torque. b. More torque. c. Equal torque. d. Unequal torque.

Last Answer : a. Less torque.

56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Description : 56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Last Answer : a. Represent optimal solutions

MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Last Answer : b. u. v. Method