Q. There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called?

View solution

Q. The initial value of alpha is?

View solution

Q. The initial value of beta is ?

View solution

Q. The main condition which required for alpha-beta pruning is?

View solution

Q. How many types of Move Ordering in Alpha-Beta pruning?

View solution

Q. The time complexity for such an Worst order is?

View solution

Q. Complexity in ideal ordering is ?

View solution

Q. While backtracking the tree, the node values will be passed to upper nodes instead of values of alpha and beta.

View solution

Q. The MIN player will only update the value of alpha.

View solution

Q. Which search is equal to minimax search but eliminates the branches that cant influence the final decision?

View solution

Q. Which values are independant in minimax search algorithm?

View solution

Q. We will only pass the alpha, beta values to the child nodes.

View solution

Q. Which ordering consumes more time because of alpha-beta factors?

View solution

Q. In which year Donald Knuth and Ronald W. Moore refined the algorithm?

View solution

Q. ___________ is the process of transforming unstructured text into a structured format to identify meaningful patterns and new insights.

View solution

Q. In which database, data is a blend between structured and unstructured data formats?

View solution

Q. The process of breaking out long-form text into sentences and words called?

View solution

Q. Text mining is being used by large media companies, to clarify information and to provide readers with greater search experiences.

View solution

Q. Typical text mining tasks include?

View solution

Q. Which of the following technique is not a part of flexible text matching?

View solution