Computer Science · Algorithms
C कोड के निम्नलिखित खंड पर विचार कीजिए: int j, n; j = 1; while (j 0 के लिए लूप के निष्पादन के दौरान की गई तुलनाओं (असफल होने वाली स्थिति सहित) की सटीक संख्या क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1⌊log2 n⌋ + 1
- 2⌈log2 n⌉
- 3n
- 4⌈log2(n + 1)⌉ + 1✓
सही उत्तर देखें
⌈log2(n + 1)⌉ + 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 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