Computer Science · Graph Algorithms
जब ग्राफ को एडजसेंसी मैट्रिक्स (Adjacency Matrix) का उपयोग करके निरूपित किया जाता है, तो न्यूनतम स्पैनिंग ट्री (MST) खोजने के लिए प्रिम्स एल्गोरिदम (Prim's algorithm) की सबसे खराब स्थिति की समय जटिलता (Worst-case time complexity) क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(V log V)
- 2O(E log V)
- 3O(V2)✓
- 4O(V + E)
सही उत्तर देखें
O(V2)
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 Graph Algorithms MCQs →Want more practice questions on Graph Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Algorithms