Question
For T(n)=2T(n/2)+n, which bound follows from the Master Theorem?
More Data Structure Questions
- For Dijkstra’s algorithm on a graph with non-negative weights, which data structure yields the best time complexity for dense graphs?
- Using the Master Theorem, what is the time complexity of the recurrence T(n) = 3T(n/2) + n²?
- Which data structure uses FIFO (First In, First Out)?
- Which SOLID principle emphasizes that a class should have only one reason to change?
- What is the time complexity of searching an element in a balanced binary search tree (BST) with nnn nodes?
- Which of the following is the main objective of the 3rd Normal Form (3NF) in database normalization?
- What is "unit testing" and how does it relate to debugging?
- In the classic Tower of Hanoi puzzle, what is the minimum number of moves required to transfer a stack of 5 disks from one peg to another, following all th...
- A directed graph has V vertices and E edges. Using adjacency lists, what is the time complexity of BFS when each vertex is enqueued at most once?
- Which of the following data structures is best suited for implementing a LIFO (Last In, First Out) mechanism?
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)