Computer Science · Time Complexity
किसी एल्गोरिदम की समय जटिलता (time complexity) की गणना करते समय निम्नलिखित में से कौन सी स्थिति (case) अस्तित्व में नहीं होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1सबसे अच्छी स्थिति (Best Case)
- 2परीक्षण स्थिति (Test Case)✓
- 3सबसे खराब स्थिति (Worst case)
- 4औसत स्थिति (Average case)
सही उत्तर देखें
परीक्षण स्थिति (Test Case)
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 Time Complexity MCQs →Want more practice questions on Time Complexity?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Time Complexity