Question
Binary Search on a sorted array satisfies the recurrence relation T(n) = T(n/2) + O(1). What is the resulting worst-case time complexity of Binary Search?
More Data Structure Questions
- Which of the following is the most critical success factor for the implementation of a Decision Support System (DSS) within an organization?
- A hash table has 10 total slots and currently stores 7 elements. What is the current load factor of this hash table?
- 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?
- Which of the following types of software testing ensures that previously working functionality is still operational after changes?
- In the context of artificial intelligence (AI), which type of learning requires labeled data to train models?
- What is the difference between 'BFS' (Breadth-First Search) and 'DFS' (Depth-First Search) in graph traversal?
- Which sorting algorithm is considered the most efficient for large datasets with no additional memory constraints?
- In web development and data exchange, what is the fundamental structure used to represent a collection of key-value pairs in a JSON object?
- What is the worst-case time complexity of searching for an element in a balanced Binary Search Tree containing n nodes?
- Binary search on a sorted array of n distinct elements has what worst-case asymptotic comparison complexity?
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)