Computer Science · Algorithms
Which of the following best describes the technique for solving optimization problems where making the locally optimal choice at each step leads to a globally optimal solution?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Branch and Bound
- 2Backtracking
- 3Greedy method✓
- 4Dynamic programming
Correct answer
Greedy method
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms