Question
Using the Master Theorem, what is the time complexity of the recurrence T(n) = 2T(n/2) + n·log n?
More Data Structure Questions
- Which of the following data structures is best suited for implementing a LIFO (Last In, First Out) mechanism?
- In network architecture, what is the primary advantage of a mesh topology over a star topology?
- Given only a pointer to a node (not the head) in a singly linked list, and no access to the node's predecessor, what is the standard technique used to 'del...
- Which design pattern is most suitable for controlling access to a resource by limiting the number of clients that can use it concurrently?
- What is the result of evaluating the following postfix expression using a stack-based evaluation: 2 3 4 * + 5 -
- Which data structure is used internally by a programming language's runtime to implement function calls and recursion?
- A min-heap contains n distinct elements. An arbitrary element at a known index is decreased in value. What is the worst-case time to restore the heap prope...
- Which of the following is NOT one of the defining properties that a valid Red-Black Tree must satisfy?
- What is the height of a balanced binary tree containing n nodes, expressed in Big-O notation?
- 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?
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)