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

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
by

1 Answer

Answer :

a) Depends on the nodes
by

Related questions

Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned

Description : Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned

Last Answer : a) Evaluation function

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

Which value is assigned to alpha and beta in the alpha-beta pruning? a) Alpha = max b) Beta = min c) Beta = max d) Both Alpha = max & Beta = min

Description : Which value is assigned to alpha and beta in the alpha-beta pruning? a) Alpha = max b) Beta = min c) Beta = max d) Both Alpha = max & Beta = min

Last Answer : d) Both Alpha = max & Beta = min

To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth

Description : To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth

Last Answer : d) Any depth

Discuss Game playing. Explain Alpha-beta pruning.

Description : Discuss Game playing. Explain Alpha-beta pruning.

Last Answer : Ans. Game playing  Games are well-defined problems that are generally interpreted as requiring intelligence to play well.  Introduces uncertainty since opponents moves can not be ... such as utility values distributed randomly across leaves and therefore experimental results are necessary.

Define Alpha beta pruning.

Description : Define Alpha beta pruning.

Last Answer : Alpha beta pruning eliminates away branches that cannot possibly influence the final decision

In alpha-beta pruning, ............... is used to cut off the search at maximizing level only and ................. is used to cut off the search at minimizing level only. (A) alpha, beta (B) beta, alpha (C) alpha, alpha (D) beta, beta

Description : In alpha-beta pruning, ............... is used to cut off the search at maximizing level only and ................. is used to cut off the search at minimizing level only. (A) alpha, beta (B) beta, alpha (C) alpha, alpha (D) beta, beta

Last Answer : (B) beta, alpha

................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Last Answer : (C) Alpha-beta pruning procedure

Which of the following statements is true about a software verification and validation program? I. It strives to ensure that quality is built into software. II. It provides management with insights into the state of a software project. III. It ensures that alpha, beta, and system tests are performed. IV. It is executed in parallel with software development activities. A. I, II&III B.II, III&IV C.I, II&IV D.I, III&IV

Description : Which of the following statements is true about a software verification and validation program? I. It strives to ensure that quality is built into software. II. It provides management with insights into the state ... software development activities. A. I, II&III B.II, III&IV C.I, II&IV D.I, III&IV

Last Answer : C.I, II&IV

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

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

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

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

Last Answer : b) When all step costs are equal

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

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 rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned

Description : What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned

Last Answer : d) All of the mentioned

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

Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning? (A) I (B) HI (C) CHI (D) GHI

Description : Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning?  (A) I (B) HI (C) CHI (D) GHI

Last Answer : (B) HI

The order of acidic strength of the hydrogen atom `(H_(alpha), H_(beta), H_(gamma))` in the given molecule is : `CH_(3)-underset(H_(beta))underset(|)(

Description : The order of acidic strength of the hydrogen atom `(H_(alpha), H_(beta), H_(gamma))` in the given molecule is : `CH_(3)-underset(H_(beta))underset(|)(

Last Answer : The order of acidic strength of the hydrogen atom `(H_(alpha), H_(beta), H_(gamma))` in the given molecule ... D. `H_(beta)gt H_(alpha) gt H_(gamma)`

The correct order of ionising capcity of `alpha, beta` and `gamma`-rays is

Description : The correct order of ionising capcity of `alpha, beta` and `gamma`-rays is

Last Answer : The correct order of ionising capcity of `alpha, beta` and `gamma`-rays is A. `alpha gt beta gt gamma` ... alpha gt beta` D. `beta gt gamma gt alpha`

Density order of `alpha, beta, gamma` forms in Sulphur

Description : Density order of `alpha, beta, gamma` forms in Sulphur

Last Answer : Density order of `alpha, beta, gamma` forms in Sulphur A. `alpha gt beta gt gamma` B. `alpha lt beta ... gt beta` D. `S_(gamma)gtS_(alpha)gtS_(beta)`

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

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

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

Google Alpha Go is example of ____. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Description : Google Alpha Go is example of ____. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : A. Reactive machine 

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

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

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

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

For a first order isothermal chemical reaction in a porous catalyst, the effectiveness factor is 0.3. The effectiveness factor will increase if the (A) Catalyst size is reduced or the catalyst diffusivity is reduced (B) Catalyst size is reduced or the catalyst diffusivity is increased (C) Catalyst size is increased or the catalyst diffusivity is reduced(D) Catalyst size is increased or the catalyst diffusivity is increased

Description : For a first order isothermal chemical reaction in a porous catalyst, the effectiveness factor is 0.3. The effectiveness factor will increase if the (A) Catalyst size is reduced or the ... the catalyst diffusivity is reduced (D) Catalyst size is increased or the catalyst diffusivity is increased

Last Answer : (B) Catalyst size is reduced or the catalyst diffusivity is increased

Uranium `._(92)U^(238)` decayed to `._(82)Pb^(206)`. They decay process is `._(92)U^(238) underset((x alpha, y beta))(rarr ._(82)Pb^(206))` `t_(1//2)`

Description : Uranium `._(92)U^(238)` decayed to `._(82)Pb^(206)`. They decay process is `._(92)U^(238) underset((x alpha, y beta))(rarr ._(82)Pb^(206))` `t_(1//2)`

Last Answer : Uranium `._(92)U^(238)` decayed to `._(82)Pb^(206)`. They decay process is `._(92)U^(238) underset((x alpha ... 2.303)/(4.5 xx 10^(9)) xx 0.693 log 4`

Uranium `._(92)U^(238)` decayed to `._(82)Pb^(206)`. They decay process is `._(92)U^(238) underset((x alpha, y beta))(rarr ._(82)Pb^(206))` `t_(1//2)`

Description : Uranium `._(92)U^(238)` decayed to `._(82)Pb^(206)`. They decay process is `._(92)U^(238) underset((x alpha, y beta))(rarr ._(82)Pb^(206))` `t_(1//2)`

Last Answer : Uranium `._(92)U^(238)` decayed to `._(82)Pb^(206)`. They decay process is `._(92)U^(238) underset((x alpha, ... be A. 5.25 B. 0.125 C. 12.5 D. 1.25

Which testing methods are used by end-users who actually test software before they use it? A. Alpha & Beta Testing B. White Box Testing C. Black Box Testing D. Trial & Error Testing

Description : Which testing methods are used by end-users who actually test software before they use it? A. Alpha & Beta Testing B. White Box Testing C. Black Box Testing D. Trial & Error Testing

Last Answer : A. Alpha & Beta Testing

Alpha rays are different from beta rays in one of the following ways. Are they different since: w) alpha rays are deflected in a magnetic field and beta rays are not x) alpha rays are identical to the electron in mass, and beta rays are not y) alpha rays have a positive charge and beta rays have a negative charge z) alpha rays are produced within the nucleus and beta rays are produced outside the nucleus

Description : Alpha rays are different from beta rays in one of the following ways. Are they different since: w) alpha rays are deflected in a magnetic field and beta rays are not x) alpha rays are ... negative charge z) alpha rays are produced within the nucleus and beta rays are produced outside the nucleus 

Last Answer : ANSWER: Y -- ALPHA RAYS HAVE A POSITIVE CHARGE AND BETA RAYS HAVE A NEGATIVE CHARGE