Computer Science, asked by vikashprivacy, 6 months ago

Write the algorithm for greedy strategies for knapsack problem. Consider a sequencing problem where the four jobs have a profit of (10, 30, 60, 40) and corresponding their deadlines (2, 3, 1, 3) and n=4.

Answers

Answered by Anonymous

1

Answer:

vfsdvjdsbfubvnz jvd kjxbvjkd kj cxjb jkdfbk c

Explanation:

Previous Question

Next Question

Similar questions

English, 3 months ago

What is motion? Mods Don't hurt me anymore please...

Art, 3 months ago

How does your art work help you in life?

Math, 3 months ago

if the simple interest for 100 rupees for one month is one rupee what is the interest for 100 rupees for one year and what is the rate of interest...

English, 6 months ago

ya ha per 8th class me koun koun h...

Science, 6 months ago

0.3 Put a W markagainst the correct and (xlagainst the wrong statements (3 x 4 =2] (a) Plants which synthesize their food themselves are called saprotroph. (b) Anacrobic bacteria digest animal waste produce biogas. (c) Tooth decay is caused by the presence of bases. (d)Dark colours are good radiators of heat,...

Biology, 11 months ago

explain the endomembrane...

Math, 11 months ago

Two tonnes of iron ore containing 94% of Fe2O3 produces iron in pure state.calculate the...

Math, 11 months ago

what is a formula of compound interest..??