Question
For T(n)=2T(n/2)+n, which bound follows from the Master Theorem?
More Data Structure Questions
- Union-Find with Path Compression achieves nearly:
- In networking, what is the primary purpose of subnetting?
- A hash table uses h(k)=k mod 11 and linear probing. Keys 22,33,44 are inserted into an empty table. Which positions result?
- Using the Master Theorem, what is the time complexity of the recurrence T(n) = 3T(n/2) + n²?
- What is the postorder traversal of the BST built by inserting 50, 30, 70, 20, 40, 60, 80, 10 in this order?
- Which of the following is the most effective method to ensure data confidentiality when transmitting sensitive information over a public network?
- 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?
- Which data structure is used in BFS traversal of graphs?
- What is a 'Binary Search Tree' (BST) and what is its key property?
- Which CPU scheduling algorithm always selects the process with the smallest burst time first, potentially leading to starvation?
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)