Question
Using Dijkstra's algorithm on a graph with edges A-B(4), A-C(1), C-B(2), B-D(1), C-D(5), what is the shortest distance from A to D?
More Data Structure Questions
- Which memory type is the fastest but most expensive, typically located directly on the CPU?
- In CI/CD pipelines, which of the following is NOT a key benefit of Continuous Integration (CI)?
- A singly linked list is maintained with both head and tail pointers. Which of the following operations cannot be performed in O(1) time?
- What is the maximum number of edges possible in a simple undirected graph (no self-loops, no parallel edges) containing 7 vertices?
- A binary tree has the preorder traversal A B D E C F and the inorder traversal D B E A F C. What is its postorder traversal?
- Which of the following best describes the key benefit of blockchain technology in supply chain management?
- How many edges does a complete undirected graph (K_n) containing 8 vertices contain, where every pair of distinct vertices is connected by exactly one edge...
- Which of the following best describes the function of the Control Unit (CU) in the CPU?
- What type of relationship is represented by Aggregation in Object-Oriented Programming?
- Which of the following best describes Abstraction in Object-Oriented Programming (OOP)?
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)