Computer Science · Graph Algorithms
सूची I में दिए गए मानक ग्राफ़ एल्गोरिदम को सूची II में उनकी सही समय जटिलताओं (Time Complexities) से मिलाएँ, जहाँ n और m क्रमशः शीर्षों (vertices) और किनारों (edges) की संख्या को दर्शाते हैं। सूची I: A. बेलमैन-फोर्ड एल्गोरिदम (Bellman-Ford algorithm) B. क्रुस्कल एल्गोरिदम (Kruskal's algorithm) C. फ़्लॉइड-वॉर्शाल एल्गोरिदम (Floyd-Warshall algorithm) D. टोपोलॉजिकल सॉर्टिंग (Topological sorting) सूची II: I. O(m log n) II. O(n3) III. O(n·m) IV. O(n + m)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-II, B-I, C-III, D-IV
- 2A-III, B-IV, C-I, D-II
- 3A-II, B-IV, C-III, D-I
- 4A-III, B-I, C-II, D-IV✓
सही उत्तर देखें
A-III, B-I, C-II, D-IV
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