Computer Science · Data Structures and Algorithms
निम्नलिखित में से किस समस्या की रन-टाइम जटिलता (run-time complexity) घातीय यानी एक्सपोनेंशियल O(2n) होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1त्रिकोणीय सीरीज गणना
- 2अभाज्य संख्या जनरेशन (Sieve of Eratosthenes)
- 3फाइबोनैचि सीरीज (Iterative)
- 4टावर ऑफ हनोई (Tower of Hanoi)✓
सही उत्तर देखें
टावर ऑफ हनोई (Tower of Hanoi)
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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms