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

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
by

1 Answer

Answer :

a) Evaluation function
by

Related questions

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

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.

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

Define Alpha beta pruning.

Description : Define Alpha beta pruning.

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

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

What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Description : What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Last Answer : b) Hash table of previously seen positions

What is needed to make probabilistic systems feasible in the world? a) Reliability b) Crucial robustness c) Feasibility d) None of the mentioned

Description : What is needed to make probabilistic systems feasible in the world? a) Reliability b) Crucial robustness c) Feasibility d) None of the mentioned

Last Answer : b) Crucial robustness

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

Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

What is Transposition rule? a) From P → Q, infer ~Q → P b) From P → Q, infer Q → ~P c) From P → Q, infer Q → P d) From P → Q, infer ~Q → ~P

Description : What is Transposition rule? a) From P → Q, infer ~Q → P b) From P → Q, infer Q → ~P c) From P → Q, infer Q → P d) From P → Q, infer ~Q → ~P

Last Answer : d) From P → Q, infer ~Q → ~P

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : c) Path cost from start node to current node + Heuristic cost

What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : a) Heuristic function

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

Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Last Answer : a) Evaluation function returning lowest evaluation

Define Evaluation function, f(n).

Description : Define Evaluation function, f(n).

Last Answer : A node with the lowest evaluation is selected for expansion, because evaluation measures distance to the goal.

A review undertaken to decide whether a project should proceed into its next phase is known as a: a. gate review. b. feasibility study. c. milestone review. d. evaluation review.

Description : A review undertaken to decide whether a project should proceed into its next phase is known as a: a. gate review. b. feasibility study. c. milestone review. d. evaluation review.

Last Answer : a. gate review.

A review undertaken to decide whether a project should proceed into its next phase is known as a: a. gate review. b. feasibility study. c. milestone review. d. evaluation review.

Description : A review undertaken to decide whether a project should proceed into its next phase is known  as a:  a. gate review.  b. feasibility study.  c. milestone review.  d. evaluation review.

Last Answer : a. gate review.

_____________ is primarily concerned with the identification, qualification and evaluation of the project resources. A. Techno-economic analysis. B. Feasibility analysis. C. Input analysis. D. Financial analysis.

Description : _____________ is primarily concerned with the identification, qualification and evaluation of the project resources. A. Techno-economic analysis. B. Feasibility analysis. C. Input analysis. D. Financial analysis.

Last Answer : B.Feasibility analysis.

__________________ is the systematic development of a project idea for the eventual purpose of arriving at an investment decision. A. Project identification. B. Project formulation. C. Project feasibility. D. Project evaluation.

Description : __________________ is the systematic development of a project idea for the eventual purpose of arriving at an investment decision. A. Project identification. B. Project formulation. C. Project feasibility. D. Project evaluation.

Last Answer : B. Project formulation.

Typically proteins do not work in their simple amino acid chain structure but instead fold and form shapes that help in their function. Which of the structures is described as being in alpha helices and beta sheets?

Description : Typically proteins do not work in their simple amino acid chain structure but instead fold and form shapes that help in their function. Which of the structures is described as being in alpha helices and beta sheets?

Last Answer : Secondary Protein Structure

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

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

In which of the following situations might a blind search be acceptable? a) real-life situation b) complex game c) small search space d) all of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) real-life situation b) complex game c) small search space d) all of the mentioned

Last Answer : c) small search space

The process by which you become aware of messages through your sense is called ____________ a) Organization b) Sensation c) Interpretation-Evaluation d) Perception

Description : The process by which you become aware of messages through your sense is called ____________ a) Organization b) Sensation c) Interpretation-Evaluation d) Perception

Last Answer : d) Perception

What are the types of evaluation of IR systems?

Description : What are the types of evaluation of IR systems?

Last Answer : i. Recall ii. Precision

Mention the criteria for the evaluation of search strategy.

Description : Mention the criteria for the evaluation of search strategy.

Last Answer :  There are 4 criteria: Completeness, time complexity, space complexity, optimality

Feasibility study determines ----------------- A.Whether the project is possible with resources B.Comparing the project with world class manufacturinC.Calculate the cost crashing each unit D.Add duration to each unitg norms

Description : Feasibility study determines -----------------  A.Whether the project is possible with resources  B.Comparing the project with world class manufacturing norms C.Calculate the cost crashing each unit  D.Add duration to each unit

Last Answer : A.Whether the project is possible with resources

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

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

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 algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

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

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 

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

When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Description : When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Last Answer : b) It prints the result returned by the function

In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Description : In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Last Answer : a) (setq a 10)

What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Description : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn

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

What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Description : What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Last Answer : b) Unrealizable

Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Description : Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Last Answer : b) Knowledge base

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

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

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

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

When a top-level function is entered, the LISP processor do(es)? a) It reads the function entered b) It evaluates the function and the function’s operands c) It prints the results returned by the function d) All of the mentioned

Description : When a top-level function is entered, the LISP processor do(es)? a) It reads the function entered b) It evaluates the function and the function’s operands c) It prints the results returned by the function d) All of the mentioned

Last Answer : d) All of the mentioned

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