Computer Science · Design and Analysis of Algorithms
फास्ट फूरियर ट्रांसफॉर्म (FFT) किस एल्गोरिदमिक रणनीति पर आधारित है?
- 1ग्रीडी दृष्टिकोण (Greedy Approach)
- 2डायनेमिक प्रोग्रामिंग (Dynamic Programming)
- 3ब्रांच एंड बाउंड (Branch and Bound)
- 4डिवाइड-एंड-कॉनकर (Divide-and-Conquer)✓
सही उत्तर देखें
डिवाइड-एंड-कॉनकर (Divide-and-Conquer)
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!
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
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