Computer Science · Algorithms
फास्ट फूरियर ट्रांसफॉर्म (FFT) का उपयोग करके, गुणांक रूप (coefficient form) में इनपुट और आउटपुट प्रतिनिधित्व वाले, डिग्री बाउंड n के दो बहुपदों A(x) और B(x) को गुणा करने की समय जटिलता (time complexity) क्या होगी, जहाँ n, 2 की घात है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(log2n)
- 2O(2n)
- 3O(n log2n)✓
- 4O(n2)
सही उत्तर देखें
O(n log2n)
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