which of the following is not true about greedy algorithms?
A.It makes the locally optimal choice at each stage
B.A greedy strategy produces an optimal solution
C. A greedy algorith exists for constructing the minimum spanning tree
D.A greedy algorithm exists for partition a set of n weights into k buns where each has the same weight
E. Greedy algorithm exists for some NP-hard problems.

Question

06-09-2019
Computers and Technology

contestada

which of the following is not true about greedy algorithms?
A.It makes the locally optimal choice at each stage
B.A greedy strategy produces an optimal solution
C. A greedy algorith exists for constructing the minimum spanning tree
D.A greedy algorithm exists for partition a set of n weights into k buns where each has the same weight
E. Greedy algorithm exists for some NP-hard problems.

Respuesta :

Otras preguntas

Melinda has several children and frequently marvels at how different each child is from one another. Jacob, her oldest son, took his first steps at 17 months wh

An experiment reveals that 125.0 grams of an unknown metal increases in temperature from 22.0 oC to 43.6 oC upon absorbing 640 joules. What is the specific heat

How many grams of chlorine gas can be produced if 15 grams of FeCl3 reacts with 4 moles of O2? What is the limiting reactant? What is the excess reactant? If

Are males and females fundamentally the same except for sexual organs or are they essentially different in many important ways? Are gender roles determined by

A major difference between the work of a "pure" or "straight" photographer, such as alfred Stieglitz, and the work of a documentary photographer, such as Doroth

The ____ is a well-established organization with a primary emphasis on computer science. a. International Standards Organization (ISO) b. Oxford Computer Societ

Jenny Enterprises has just entered a lease agreement for a new manufacturing facility. Under the terms of the agreement, the company agreed to pay rent of $10,0

Which statements are true regarding triangle LMN? Check all that apply. NM = xNM = x StartRoot 2 EndRootLM = x StartRoot 2 EndRoottan(45°) = StartFraction Start

What is the length of the pond ?

What is the theoretical mass of CO2 + H2O lost per gram of NaHCO3?

Cetacea Cetacea · Answer 1 · 2019-09-16T06:53:54+02:00

Answer:D)A greedy algorithm exists for partition a set of n weights into k buns where each has the same weight

Explanation: A greedy algorithm is the algorithm that helps in the optimization during any issue in the operating system field.It helps in making the best utilization of the situation and thus makes the optimal choice.

By functioning at each step/stage in optimal way,the problem/issue gets solved with the minimal spanning tree form.Non-deterministic polynomial-time(NP) hardness issues can be find a optimal solution through this method.Therefore all the statement are correct except option(d).

codiepienagoya codiepienagoya · Answer 2 · 2022-03-01T19:09:27+01:00

The "choice d" that is "A greedy algorithm exists for partition a set of n weights into k buns where each has the same weight" is not true about the greedy algorithms.

greedy algorithms:

The greedy algorithm helps in the optimization of any OS issue. As a result, it helps in making the most use of a circumstance or, as a result, making a good decision.

Greedy is an algorithm model that assembles a solution piece by piece, always selecting the next component that generates the most obvious and immediate advantage.

This problem or issue was addressed using the shortest-spanning tree form by performing optimally at every step/stage.
These techniques can be used to find the optimal solution to non-deterministic polynomial-time (NP) difficulty issues.

Therefore, the final answer is "Option d".

Find out the more information about the algorithm here:

brainly.com/question/26345812