Computer Science · Design and Analysis of Algorithms
निम्नलिखित एल्गोरिदम दिए गए हैं: (i) फ्लॉयड-वॉर्शल (Floyd-Warshall) (ii) ट्रांजिटिव क्लोजर (Transitive closure) दिए गए ग्राफ के किन्हीं भी दो शीर्षों के बीच सभी-युग्मों के सबसे छोटे पथ (All-pairs shortest paths) की गणना करने के लिए किस एल्गोरिदम का उपयोग किया जाता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1न तो (i) और न ही (ii)
- 2(i) और (ii) दोनों
- 3केवल (ii)
- 4केवल (i)✓
सही उत्तर देखें
केवल (i)
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
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Design and Analysis of Algorithms MCQs →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