Discussion
Which of the following is a characteristic of a greedy algorithm ?
Answer: C
A greedy algorithm makes decisions based on local information.
At each step a greedy algorithm takes the choice that looks best at that moment (the locally optimal choice) and never revisits it, hoping this leads to a good overall solution.
It does not use global information, it does not always give the optimal solution (it does for some problems, such as minimum spanning trees, but not for the 0/1 knapsack), and it does not backtrack.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development