Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Consider the game tree given below

F1 R.S 18.5.20 Pallavi D3

Here O and □ represent MIN and MAX nodes respectively, The value of the root node of the game tree is:

This question was previously asked in
UGC NET Computer Science (Paper 2) Dec 2019 Paper
Attempt Online
View all UGC NET Papers >
  1. 14
  2. 17
  3. 111
  4. 112

Answer (Detailed Solution Below)

Option 2 : 17
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
10.8 K Users
50 Questions 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

Step 1:

F2 R.S 1.6.20 Pallavi D1

Step 2:

F2 R.S 1.6.20 Pallavi D2

Step 3:

F2 R.S 1.6.20 Pallavi D3

Step 4:

F2 R.S 1.6.20 Pallavi D4

The value of root node become 17.

Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 6, 2025

-> The UGC NET Exam Schedule 2025 for June has been released on its official website.

-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.

-> The UGC NET 2025 online application form submission closed on 12th May 2025.

-> The June 2025 Exam will be conducted from 21st June to 30th June 2025

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Approaches to AI Questions

Q1.In the content of Alpha Beta pruning in game trees which of the following statements are correct regarding cut off procedures ? (A) Alpha Beta pruning can eliminate subtrees with certainly when the value of a node exceeds both the alpha and beta bonds. (B) The primarily purpose of Alpha-Beta proning is to save computation time by searching fewer nodes in the same tree. (C) Alpha Beta pruning guarantees the optimal solution in all cases by exploring the entire game tree. (D) Alpha and Beta bonds are initialized to negative and positive infinity respectively at the root note. Choose the correct answer from the options given below:
Q2.The process of removing details from a given state representation is called ______
Q3.Consider the game tree given below Here O and □ represent MIN and MAX nodes respectively, The value of the root node of the game tree is:
Q4.Consider following sentences regarding A*, an informed search strategy in Artificial Intelligence (AI). (a) A* expands all nodes with f(n) < C*. (b) A* expands no nodes with f(n) /C*. (c) Pruning is integral to A*. Here, C* is the cost of the optimal solution path. Which of the following is correct with respect to the above statements ?
Q5.In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h1.......hm is available for a problem and none of them dominates any of the others, which should we choose ?
Q6.Consider the following minimax game tree search What will be the value propagated at the root?
Q7.Match List 1 with List 2 and choose the correct answer from the code given below List 1 List 2 a) Greedy best-first search i) Selects a code for expansion if optimal path to that node has been found b) A* Search ii) Avoids substantial overhead associated with keeping the sorted queue of nodes c) Recursive best-first search iii) Suffers from excessive node generation d) Iterative-deepening A* Search iv) Time complexity depends upon the quality of heuristic
Q8.Consider the following statements S1: A heuristic is admissible if it never overestimates the cost to reach the goal S2: A heuristic is monotonous if it follows triangle inequality property. Which one of the following is true referencing the above statements?
Q9.Consider the following statements related to AND-OR Search algorithm. S1: A solution is a subtree that has a goal node at every leaf. S2: OR nodes are analogous to the branching in a deterministic environment S3: AND nodes are analogous to the branching in a non-deterministic environment. Which one of the following is true referencing the above statements? Choose the correct answer from the code given below:

More Artificial Intelligence Questions

Q1.Which of the following are correct for the neural network? A. The training time depends upon the size of network. B. Neural network can be simulated on the conventional computer. C. Neural network mimic the same way as that of the humans brain. D. A neural network include feedback. Choose the correct answer from the options given below:
Q2.The kind of symbols for basic syntactic elements of first-order logic are A. Constant B. Domain C. Predicate D. Temporal E. Function Choose the correct answer from the options given below:
Q3.Which of the following is not a component of the classic Planning Definition?
Q4.Definition's of ________ organized into following four categories namely, Thinking Humanly, Thinking Rationally, Acting Humanly, Acting Rationally
Q5.Match the LIST-I with LIST-II LIST - I LIST - II A. Decision Tree I. Delta Learning Rule B. Supervised Learning II. Self Organizing Map C. Artificial Neural Network III. C4.5 Algorithm D. Instance base Learning IV. Non-linear Regression Algorithm Choose the correct answer from the options given below:
Q6.In the content of Alpha Beta pruning in game trees which of the following statements are correct regarding cut off procedures ? (A) Alpha Beta pruning can eliminate subtrees with certainly when the value of a node exceeds both the alpha and beta bonds. (B) The primarily purpose of Alpha-Beta proning is to save computation time by searching fewer nodes in the same tree. (C) Alpha Beta pruning guarantees the optimal solution in all cases by exploring the entire game tree. (D) Alpha and Beta bonds are initialized to negative and positive infinity respectively at the root note. Choose the correct answer from the options given below:
Q7.In a genetic algorithm optimization problem the fitness function is defined as f(x) = x2 - 4x + 4. Given a population of four individuals with values of x: {1.5, 2.0, 3.0, 4.5} What is the fitness value of the individual that will be selected as the parent for reproduction in one generation?
Q8.Match List-I with List-II List I List II A. Hill climbing I. O(b^d) B. Best first search II. O(bd) C. A* Search III. O(1) D. Depth first search IV. O(b^m) Choose the correct answer from the options given below :
Q9.Match List-I with List-II List I List II A. Greedy Best first search I. The space complexity as O(d) where d = depth of the deepest optimal solution B. A* II. Incomplete even if the search space is finite C. Recursive best first search III. Optimal if optimal solution is reachable otherwise return the best reachable optimal solution D. SMA* IV. Computation and space complexity is two light Choose the correct answer from the options given below :
Super Coaching
UGC NET Test Series
UGC NET Previous Year Papers
UGC NET Syllabus
UGC NET Books
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti yes teen patti master 2023 lotus teen patti all teen patti master teen patti jodi