The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

Consider $f(N) = g(N) + h(N)$ Where function g is a measure of the cost of getting from the start node to the current node $N$ and $h$ is an estimate of additional cost of getting from the current node $N$ to the goal node. Then $f(N) = h(N)$ is used in which one of the following algorithms ?

- $A^{*}$algorithm
- $AO^{*}$ algorithm
- Greedy best first search algorithm
- Iterative $A^{*}$ algorithm

0 votes

the given eqn

belongs to A* algorithm(variant of Best First) in which g(N) i.e the cost of reaching to current node from start node is also considered in addition of h(N). In original greedy best first algorithm only h(N) i.e cost of going from current node to goal node is considered(thats why it is greedy just find the cost to reach the goal node which may not be optimal)

so f(N)=h(N) belongs to greedy best first algorithm hence ans is C

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 6.3k
- Digital Logic 2.4k
- Programming & DS 4.4k
- Algorithms 3.8k
- Theory of Computation 4.8k
- Compiler Design 1.8k
- Databases 3.5k
- CO & Architecture 3k
- Computer Networks 3.5k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 490
- Tier 1 Placement Questions 23
- Job Queries 64
- Projects 17

42,296 questions

48,419 answers

153,542 comments

62,661 users