Question:
Let h1 and h2 be two admissible heuristics used in A* search.
Which ONE of the following expressions is always an admissible heuristic ?
Let h1 and h2 be two admissible heuristics used in A* search.
Which ONE of the following expressions is always an admissible heuristic ?
Which ONE of the following expressions is always an admissible heuristic ?
Updated On: Jan 30, 2026
- h1 + h2
- h1 × h2
- h1/h2, (h2 ≠ 0)
- |h1 - h2|
Hide Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
The correct option is (D) : |h1 - h2|.
Was this answer helpful?
0
0
Top Questions on Representation of Binary Tree
- How many binary trees can be formed with 4 distinct nodes?
- NIMCET - 2025
- Programming and Data Structure
- Representation of Binary Tree
- Which traversal of a binary tree gives the nodes in non-decreasing order if the tree is a Binary Search Tree?
- NIMCET - 2025
- Programming and Data Structure
- Representation of Binary Tree
- Consider the following tree traversals on a full binary tree :
(i) Preorder
(ii) Inorder
(iii) Postorder
Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree ?- GATE DA - 2024
- Data Science and Artificial Intelligence
- Representation of Binary Tree
- Consider the following statement :
In adversarial search, α - β pruning can be applied to game trees of any depth where a is the (m) value choice we have formed so far at any choice point along the path for the MAX player and ẞ is the (n) value choice we have formed so far at any choice point along the path for the MIN player.
Which ONE of the following choices of (m) and (n) makes the above statement valid ?- GATE DA - 2024
- Data Science and Artificial Intelligence
- Representation of Binary Tree
- Given a dataset with K binary-valued attributes (where K > 2) for a two-class classification task, the number of parameters to be estimated for learning a naïve Bayes classifier is
- GATE DA - 2024
- Data Science and Artificial Intelligence
- Representation of Binary Tree
Questions Asked in GATE DA exam
- Which of the following statements is/are correct?
- GATE DA - 2025
- Linear Algebra
- Choose the most appropriate word to complete the analogy:
Courage : Bravery :: Yearning :- GATE DA - 2025
- Analogies
- When does the worst case of binary search occur?
- GATE DA - 2025
- Algorithm
- Suppose that insertion sort is applied to the array \([1,2,3,5,7,9,11,x,15,13]\) and it takes exactly 2 swaps to sort the array. Select all possible values of \( x \).
- GATE DA - 2025
- Algorithm
- Given the lists: \[ A = [1,2,3], \quad B = [4,5,6] \] Which of the following statements will result in \[ A = [1,2,3,4,5,6]? \]
- GATE DA - 2025
- Programming in Python
View More Questions