Question
When comparing two algorithms, Algorithm A has O(N log
- N complexity and Algorithm B has O(N² ) complexity. For very large input sizes N:
More IT Operating System Questions
- In a Max-Heap, what is the relationship between a parent node and its children?
- Which of the following statements about a primary key is correct?
- Which of the following statements accurately describes the purpose of unit testing in software development?
- Cocomo (Constructive Cost Model) is a regression model based on LOC where LOC is :
- Fill in the blanks R _________are the same as the arrays in C language which are used to hold ____________data values of the same type
- Trace the execution of the following Java code: public class Flow { public static void main(String[] args) { int count = 0; ...
- Which of the following is the best example of Platform as a Service (PaaS)?
- In public key cryptography ___ key is used for encryption and ____ key is used for decryption.
- What is the output of the following C program? #include int main() { int a=2, b=3, c=4; printf("%d", a<<1 | b&c); return 0; }
- In a perfectly balanced Binary Search Tree with N nodes, what is the worst-case time complexity for searching for an element?
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)