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
- In a dynamic array (such as Python's list or Java's ArrayList) that doubles its capacity whenever it becomes full, what is the amortized time complexity of...
- Which search algorithm is complete but not always optimal?
- What is the output of the following recursive function call func(3) ? int func ( int n) { if (n == 0 ) return 1 ; return n * func(n -...
- Which sorting algorithm is considered the most efficient for large datasets with no additional memory constraints?
- Which traversal of a binary tree visits the nodes in the order: Left subtree, Root, Right subtree?
- Which of the following is a key objective of the Requirement Analysis phase in the Software Development Lifecycle (SDLC)?
- A code flow involves processing a stream of data where elements are added to the front and removed from the front. Which type of linked list would provide ...
- What is the primary purpose of a data structure?
- Which of the following is the primary goal of a Cross-Site Scripting (XSS) attack?
- In a hash table, what is a 'collision'?
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)