Question
For Dijkstra’s algorithm on a graph with non-negative weights, which data structure yields the best time complexity for dense graphs?
More Data Structure Questions
- In an unweighted graph with edges A-B, A-C, B-D, B-E, C-F, and D-G, how many nodes are at a shortest-path distance of exactly 2 from node A (as found via B...
- A sorted array contains 1000 elements. Using Binary Search, what is the maximum number of comparisons needed, in the worst case, to determine whether a tar...
- What is the purpose of the keys() method in a dictionary?
- A hash table of size 10 uses h(k) = k mod 10 with linear probing. The keys 25, 35, 45, 15 and 55 are inserted in this order into an initially empty table. ...
- A hash table using separate chaining has 10 slots and stores 15 elements, uniformly distributed across the slots. What is the average number of comparisons...
- Which data structure is used in BFS traversal of graphs?
- Which of the following types of software testing ensures that previously working functionality is still operational after changes?
- What is the maximum possible number of nodes in a binary tree of height 4 (where the root is considered to be at height 0)?
- Which of the following is a common application of stacks in code flow for expression evaluation?
- Which of the following collision resolution techniques involves storing all elements that hash to the same value in a linked list?
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)