The Gateway to Computer Science Excellence

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.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,647 questions

56,492 answers

195,439 comments

100,708 users