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.

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.
by

1 Answer

Answer :

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

Related questions

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

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

__________ 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

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

Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed in each table of revised simplex method than usual simplex method. Which of these statements are correct? (A) (a) and (b) only (B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)

Description : Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed ... c) only (C) (b) and (c) only (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c)

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 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 is an indication of lack of objectivity of an auditor? a. The auditor believes that accounts receivable may not be collectible, but accepts management's opinion without an independent evaluation. b. In preparing client's tax return, the CPA encourages client to take a deduction which the CPA believes is valid, but for which there is some but not complete support. c. Both a and b above would be a violation d. Neither would be a violation

Description : Which of the following is an indication of lack of objectivity of an auditor? a. The auditor believes that accounts receivable may not be collectible, but accepts management's opinion without an independent evaluation. ... . c. Both a and b above would be a violation d. Neither would be a violation

Last Answer : The auditor believes that accounts receivable may not be collectible, but accepts management's opinion without an independent evaluation.

A constructor that accepts no parameters is called the ………………. A) Paramless constructor B) No parameter constructor C) Default constructor D) Argumentless constructor

Description : A constructor that accepts no parameters is called the ………………. A) Paramless constructor B) No parameter constructor C) Default constructor D) Argumentless constructor

Last Answer : C) Default constructor

Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Last Answer : a) Evaluation function returning lowest evaluation

Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : Evaluation function returning highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Last Answer : A : Evaluation function returning lowest evaluation

Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : Evaluation function returning highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Last Answer : A : Evaluation function returning lowest evaluation

Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : Evaluation function returning highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Last Answer : A : Evaluation function returning lowest evaluation

Conflict is constructive when: (a) it improves the quality of decisions. ; (b) it stimulates creativity and innovation. (c) it fosters an environment of self-evaluation and change. ; (d) all of the above

Description : Conflict is constructive when: (a) it improves the quality of decisions. ; (b) it stimulates creativity and innovation. (c) it fosters an environment of self-evaluation and change. ; (d) all of the above 

Last Answer :  (d) all of the above

Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?

Description : Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state  which of the following state cannot be reached? 

Last Answer : Answer: C

Which is/are the application(s) of stack A) Function calls B) Large number Arithmetic C) Evaluation of arithmetic expressions D) All of the above

Description : Which is/are the application(s) of stack A) Function calls B) Large number Arithmetic C) Evaluation of arithmetic expressions D) All of the above

Last Answer : D) All of the above

Adaptive maintenance is a maintenance which ............. (A) Correct errors that were not discovered till testing phase. (B) is carried out to port the existing software to a new environment. (C) improves the system performance. (D) both (B) and (C)

Description : Adaptive maintenance is a maintenance which ............. (A) Correct errors that were not discovered till testing phase. (B) is carried out to port the existing software to a new environment. (C) improves the system performance. (D) both (B) and (C)

Last Answer : (B) is carried out to port the existing software to a new environment.

Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. (C) that exchanges inner loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Description : Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. ... loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Last Answer : (A) that avoids tests at every iteration of the loop

Data which improves the performance and accessibility of the database are called: (A) Indexes (B) User Data (C) Application Metadata (D) Data Dictionary

Description : Data which improves the performance and accessibility of the database are called: (A) Indexes (B) User Data (C) Application Metadata (D) Data Dictionary

Last Answer : (A) Indexes

Pipelining improves performance by: (A) decreasing instruction latency (B) eliminating data hazards (C) exploiting instruction level parallelism (D) decreasing the cache miss rate

Description : Pipelining improves performance by: (A) decreasing instruction latency (B) eliminating data hazards (C) exploiting instruction level parallelism (D) decreasing the cache miss rate

Last Answer : (C) exploiting instruction level parallelism

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

Synchronization is achieved by a timing device called a ................. which generates a periodic train of .................. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse

Description : Synchronization is achieved by a timing device called a ................. which generates a periodic train of .................. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse

Last Answer : Answer: A and D

Which phase of compiler generates stream of atoms ? (A) Syntax analysis (B) Lexical Analysis (C) Code generation (D) Code optimization

Description : Which phase of compiler generates stream of atoms ? (A) Syntax analysis (B) Lexical Analysis (C) Code generation (D) Code optimization 

Last Answer : (A) Syntax analysis

What is a good moveset for Growlithe/Arcanine?

Description : What is a good moveset for Growlithe/Arcanine?

Last Answer : answer:You've got three fire type moves there which seems a little redundant. Plus, Overheat will reduce your special attack after you use it, causing both it and Flamethrower to become a lot weaker. And ... your special attack stat after use and you don't want to weaken a whole bunch of your moves.

What is the best moveset for sylveon?

Description : What is the best moveset for sylveon?

Last Answer : Need answer

To shuffle the list(say list1) what function do we use ? a) list1.shuffle () b) shuffle(list1) c) random.shuffle(list1) d) random.shuffleList(list1)

Description : To shuffle the list(say list1) what function do we use ? a) list1.shuffle () b) shuffle(list1) c) random.shuffle(list1) d) random.shuffleList(list1)

Last Answer : c) random.shuffle(list1)

Why is the halogenation of alkanes considered a chain reaction? (a) it occurs quickly. (b) it occurs without the generation of intermediates. (c) each step generates the reactive intermediate that causes the next step to occur. (d) the reaction allows long chains of halogenated alkanes to be formed

Description : Why is the halogenation of alkanes considered a chain reaction? (a) it occurs quickly. (b) it occurs without the generation of intermediates. (c) each step generates the reactive intermediate that causes the next step to occur. (d) the reaction allows long chains of halogenated alkanes to be formed

Last Answer : each step generates the reactive intermediate that causes the next step to occur

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 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 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

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

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

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

______________ 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

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*

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 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

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

Description : 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

Last Answer : C : No neighbour 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

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

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 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 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