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.6k
- Engineering Mathematics 7.5k
- Digital Logic 3k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2.1k
- Databases 4.2k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 584
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,109 questions

53,222 answers

184,630 comments

70,463 users