Question
What is the time complexity of the Floyd-Warshall algorithm for finding shortest paths between all pairs of vertices in a graph with V vertices?
More Data Structure Questions
- A hash table uses h(k)=k mod 11 and linear probing. Keys 22,33,44 are inserted into an empty table. Which positions result?
- Using Kruskal's algorithm on a graph with edges A-B(1), B-C(3), A-C(4), C-D(2), B-D(5), what is the total weight of the Minimum Spanning Tree?
- A hash table of size 7 uses h(k) = k mod 7 with linear probing. The keys 15, 22, 29, 8 and 36 are inserted in this order. In which slot does key 36 get sto...
- Which comparison-based sorting algorithm achieves its best-case time complexity of O(n) specifically when the input array is already sorted (or nearly sort...
- In a hash table, what is a 'collision'?
- Which data structure follows the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed?
- Which data structure is used in recursion?
- Which of the following is the primary characteristic of Infrastructure as a Service (IaaS) in cloud computing?
- In web development and data exchange, what is the fundamental structure used to represent a collection of key-value pairs in a JSON object?
- For T(n)=2T(n/2)+n, which bound follows from the Master Theorem?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)