Question
An algorithm with a time complexity of O(log
An algorithm with a time complexity of O(log
n) means that its execution time:
More Data Structure Questions
- Consider a code flow where a large dataset is stored in an array. If frequent insertions and deletions are required at arbitrary positions within the array...
- In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?
- In the dynamic programming approach for LCS, the base cases are crucial for correctly initializing the dp table. Consider the following Python code snip...
- A queue follows which principle for data access?
- Which algorithm is used for minimum spanning tree?
- Which of the following represents the Preorder Traversal of the binary tree given below? A / \ B C / \ D E
- Which design pattern is best suited for ensuring that a class has only one instance and provides a global point of access to it?
- Which statement correctly explains why Dijkstra's algorithm produces incorrect shortest-path results on graphs containing negative edge weights, even when ...
- Which of the following is an effective countermeasure against Cross-Site Scripting (XSS) attacks in a web application?
- If a stack is implemented using a fixed-size array, what is a significant disadvantage when the stack grows beyond its initial capacity?
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)