Question

Explain the Greedy Structure algorithm. Give an example in which the Greedy technique fails to deliver an optimal solution.

03 Nov 2017
Answer :
Word Count : 443

A greedy structure algorithm is any algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage[1] with the hope of finding the global optimum.

For example, applying the greedy strategy to the traveling salesman problem yields the following algorithm: "At each stage visit the unvisited city nearest to the current city". In general, greedy algorithms are used for optimization problems.

In general, greedy algorithms have five pillars:

A candidate set, from which a solution is created

A selection function, which chooses the best

_________ _____ _______ __________ _____.
______ _________ _________ ___ _____ __________ _________ __________ __________.
____ ______ ___ _________ _______ _____ _______ ___ _____ _____.
____ _________ ____ ____ ____ _____ _________ ______.
_____ ___ ________ __________ __________ __________ _____ ________.
_____ ___ ____ ____ _________ ______ _____ _____ _____ _______.
______ _________ ____ _______ _______ ___ ______ ____ ___ ___ ______ ______.
___ ____ __________ _____ ____ _______ ________ _________.
________ _____ ______ _______ _________ ________ _____ __________ _______ __________.
_________ ___ _____ ___ ______ _____ __________ __________.
__________ ________ _________ ____ ________ __________ _______ _____ ____.
__________ ______ ______ _____ ______ _______ ______ _____ ___ _____.
_____ ___ _______ ______ ____ ____ ____ ___ __________ _________ _____ _______.
____ _________ ________ ________ ____ ________ _______.
_____ ___ _____ ____ __________ ________ ________ ___ ______ ____ ____.
__________ _______ ____ _______ _______ __________.
_____ ___ ________ _____ ____ ________ _________.
________ ________ ______ ____ __________.
________ _______ ____ _____ ____ ____.
__________ ____ _________ _______ ________ ___ ___.
______ _________ _____ __________ _______ ________ _________ _______.
____ ____ _____ ______ ___.
_______ _____ ______ ________ _______.
___ ___ ____ ____ ________ _______ _____ __________ _________ ______.
_________ ________ _________ _________ _________ __________.
___ _________ _______ ______ ______ _______ _________ ________ __________ ________.
______ _______ ____ ______ __________ _______ _________.
_______ _______ _____ ______ _______ ________ _________.
________ _____ ___ ____ ________.
______ __________ _______ __________ _____ _____ ________ ________ _________.
______ ______ _______ __________ ___ ______.
_______ _________ ________ ____ ______ _______ ________ _________ _____ ______.
___ __________ _______ ______ _____ __________ ______ __________ _____.
___ ___ ________ _____ _________ __________ ________ ______.
_______ __________ ________ __________ ____ __________ _______.
______ __________ _____ _________ ________ ______ _________ ____.
_______ ____ __________ ______ ____ _________ _________ ____ ___ __________ ___ ______.
_________ _______ ________ _______ ________ _____ _____ ______ ______.
____ _________ _________ ______ ________ ___ __________ ___ _________ ________ _____ __________.
_________ ______ ______ ________ __________ ______ ___.
____ ____ _____ _________ _________ ___ ________ ______.
_______ ____ ______ ____ _______ _________ _______ _________ _________.
__________ ____ ___ _____ _____ ____ _____ _________.
________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MCS 31 2011 - Explain the Greedy Structure algorithm. Give an example in which the G | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→