Answer to Question #160290 in Assembler for Saidur Rahman

Programming & Computer Science>

Question #160290

Explain when we can use the Greedy algorithms.

Expert's answer

When at each step of solving a problem, an optimal choice can be made, while these choices do not affect each other, but only the final result.

Learn more about our help with Assignments: Assembler

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. How can you solve “all-pairs shortest path” problems using:i. Dijkstra’s algorithm andii. Bell
2. What are the major differences between a microprocessor and a microcontroller?
3. (a) Write about Oscillator and watchdog timer in ATmega32 microcontroller? (b) What are the major di
4. Considering Dot matrix display write an assembly language code such that, first when user presses nu
5. a) Suppose a computer having 5 GHz processor with cycle time of 2ns and main memory access time100ns
6. Write about Oscillator and watchdog timer in ATmega32 microcontroller..
7. Suppose, the ADC in Atmega32 is configured to use 4 Volt as its voltage reference. Then Find:i. Step