When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

When will Hill-Climbing algorithm terminate?
A : Stopping criterion met
B : Global Min/Max is achieved
C : No neighbour has higher value
D : no criteria to terminate
by

1 Answer

Answer :

C : No neighbour has higher value
by

Related questions

When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Description : When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Last Answer : c) No neighbor has higher value

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Description : A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Last Answer : A : Best-First-Search

A* algorithm is based on (A) Breadth-First-Search (B) Depth-First –Search (C) Best-First-Search (D) Hill climbing

Description : A* algorithm is based on (A) Breadth-First-Search (B) Depth-First –Search (C) Best-First-Search (D) Hill climbing

Last Answer : (C) Best-First-Search

______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

Description : ______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Hill-Climbing

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

__________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Description : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Last Answer : b) Local Beam search

A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-Search

Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Description : Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Last Answer : d) Both RBFS & SMA*

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Description : What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Last Answer : a) Terminates at local optimum & Does not find optimum solution

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Last Answer : a) It terminates with a solution when one exists

Which value is assigned to alpha and beta in the alpha-beta pruning? a) Alpha = max b) Beta = min c) Beta = max d) Both Alpha = max & Beta = min

Description : Which value is assigned to alpha and beta in the alpha-beta pruning? a) Alpha = max b) Beta = min c) Beta = max d) Both Alpha = max & Beta = min

Last Answer : d) Both Alpha = max & Beta = min

To predict failure in design components which failure criteria is not assumed, when mean stress and stress amplitude are nonzero? a. Goodman criterion b. Soderberg criteria c. Gerber criteria d. None of the above

Description : To predict failure in design components which failure criteria is not assumed, when mean stress and stress amplitude are nonzero? a. Goodman criterion b. Soderberg criteria c. Gerber criteria d. None of the above

Last Answer : d. None of the above

In the case of an audit of financial statements, which of the following would not be a valid criterion in ascertaining the degree of correspondence between assertions and established criteria? a. International Accounting Standards b. Philippine Accounting Standards c. Philippine Standards on Auditing d. Philippine Financial Reporting Standards

Description : In the case of an audit of financial statements, which of the following would not be a valid criterion in ascertaining the degree of correspondence between assertions and established ... . Philippine Accounting Standards c. Philippine Standards on Auditing d. Philippine Financial Reporting Standards

Last Answer : Philippine Standards on Auditing

What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system performance is gained B. Shorter response time for queries is achieved C. Large sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance

Description : What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system ... sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance

Last Answer : A. Higher system performance is gained

Which of the following is an optional section of IGES format? a.Start section b.Global section c.Terminate section d.Flag section

Description : Which of the following is an optional section of IGES format? a.Start section b.Global section c.Terminate section d.Flag section

Last Answer : d.Flag section

Mark the correct option a) A RD account can be opened with min deposit of Rs 10/- and multiple of Rs 5/- b) No max deposit will be prescribed in RD account c) Rebate will be paid on 6 advance deposit or more as per prescribed and default will be recovered if a depositor fails to deposit his/her monthly deposit up to last working day of a calendar month, d) All the above

Description : Mark the correct option a) A RD account can be opened with min deposit of Rs 10/- and multiple of Rs 5/- b) No max deposit will be prescribed in RD account c) Rebate will be paid on 6 advance ... fails to deposit his/her monthly deposit up to last working day of a calendar month, d) All the above

Last Answer : d) All the above

A Goal is an open ended statement of what one wants to accomplish with no quantification of what is to be achieved and no time criteria for completion

Description : A Goal is an open ended statement of what one wants to accomplish with no quantification of what is to be achieved and no time criteria for completion

Last Answer : False

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

What energy does a train have climbing up a hill at a steady speed?

Description : What energy does a train have climbing up a hill at a steady speed?

Last Answer : The train is expending mechanical energy to be lifted higher in the earth's gravity well. As it is lifted higher, it is collecting and storing potential energy because of the fact that it is in that gravity well.

A person climbing a hill bends forward in order to (a) avoid slipping (b) increase speed (c) reduce fatigue (d) increase stability

Description : A person climbing a hill bends forward in order to (a) avoid slipping (b) increase speed (c) reduce fatigue (d) increase stability

Last Answer : Ans:(d)

Why do we lean forward while climbing a hill?

Description : Why do we lean forward while climbing a hill?

Last Answer : Answer: In order to keeps the vertical line passing through our centre of gravity always between our feet, which is essential to attain equilibrium or stability.

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Last Answer : c) Greedy local search

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

Description : Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

Last Answer : a) True

What are the variants of hill climbing?

Description : What are the variants of hill climbing?

Last Answer : i. Stochastic hill climbing  ii. First choice hill climbing  iii. Simulated annealing search  iv. Local beam search  v. Stochastic beam search

List some drawbacks of hill climbing process.

Description : List some drawbacks of hill climbing process. 

Last Answer : Local maxima: A local maxima as opposed to a goal maximum is a peak that is lower that the highest peak in the state space. Once a local maxima is reached the algorithm will halt even though ... of the state space where the evaluation fn is essentially flat. The search will conduct a random walk.

Define Hill Climbing search.

Description : Define Hill Climbing search.

Last Answer : It is a loop that continually moves in a increasing value direction (i.e.) up hill and terminates when it reaches a “peak” where no neighbor has a higher value. 

Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Description : Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Last Answer : (D) Depth first search

How does randomized hill-climbing choose the next move each time? (A) It generates a random move from the moveset, and accepts this move. (B) It generates a random move from the whole state space, and accepts this move. (C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function. (D) It generates a random move from the whole state space, and accepts this move only if this move improves the evaluation function.

Description : How does randomized hill-climbing choose the next move each time? (A) It generates a random move from the moveset, and accepts this move. (B) It generates a random move from the whole state ... move from the whole state space, and accepts this move only if this move improves the evaluation function.

Last Answer : (C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function. 

Maximum fluctuation of energy = 1. Max KE – Min KE 2. Max KE + Min KE 3. Max KE > Min KE 4. Max KE < Min KE

Description : Maximum fluctuation of energy = 1. Max KE – Min KE 2. Max KE + Min KE 3. Max KE > Min KE 4. Max KE < Min KE

Last Answer : 1. Max KE – Min KE

Maximum fluctuation of energy = (A) Max. KE – Min. KE (B) Max. KE + Min. KE (C) (Max. KE – Min. KE)/2 (D) (Max. KE + Min. KE)/2

Description : Maximum fluctuation of energy = (A) Max. KE – Min. KE (B) Max. KE + Min. KE (C) (Max. KE – Min. KE)/2 (D) (Max. KE + Min. KE)/2

Last Answer : (A) Max. KE – Min. KE

Which of the following conditions is true for repeated stress? 1. σ m = 0 2. σ m = σ max / 2 3. σ m = σ a 4. σ min = 0 5. σ min = – σ max 6. σ a = σ max / 2 where σ m = mean stress and σ a = stress amplitude a. condition 2 and 3 b. condition 1, 3 and 5 c. condition 2, 4, and 6 d. condition 3,4, 5 and 6

Description : Which of the following conditions is true for repeated stress? 1. σ m = 0 2. σ m = σ max / 2 3. σ m = σ a 4. σ min = 0 5. σ min = - σ max 6. σ a = σ max / 2 where σ m = mean ... amplitude a. condition 2 and 3 b. condition 1, 3 and 5 c. condition 2, 4, and 6 d. condition 3,4, 5 and 6

Last Answer : c. condition 2, 4, and 6

The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Description : The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Last Answer : A. Equals the min. of LFT − t for al immediate successors

Min and Max cash balance for each SO will be fixed by a) Head post master b) Inspector/ ASP of the Sub division c) PMG d) Divisional Supdt.

Description : Min and Max cash balance for each SO will be fixed by a) Head post master b) Inspector/ ASP of the Sub division c) PMG d) Divisional Supdt.

Last Answer : d) Divisional Supdt.