Question
Binary search on a sorted array of n distinct elements has what worst-case asymptotic comparison complexity?
More Data Structure Questions
- What are the time and space complexities of the standard dynamic programming approach for finding the length of the Longest Common Subsequence (LCS) of two...
- Which of the following is the primary characteristic of Infrastructure as a Service (IaaS) in cloud computing?
- Which of the following is the main objective of the 3rd Normal Form (3NF) in database normalization?
- What is the time complexity of the following pseudocode? for i = 1 to n: for j = 1 to i: for k = 1 to j: print(i, j, k)
- RISC stands for:
- If a stack is implemented using a fixed-size array, what is a significant disadvantage when the stack grows beyond its initial capacity?
- Which of the following data structures is best suited for implementing a LIFO (Last In, First Out) mechanism?
- 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?
- In system design, what is the primary purpose of a feasibility study?
- What is the primary purpose of an Entity-Relationship (ER) Diagram in database design?
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)