Computer Science · Design and Analysis of Algorithms
In a maximization problem, if the approximation ratio is defined as r = AOPT where A is the value of the algorithm's solution and OPT is the optimal solution value, then r always satisfies:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1r > 1
- 2r ≤ 1✓
- 3r ≥ 1
- 4r = 1
Correct answer
r ≤ 1
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 Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms