In a B-tree of order m, what is the maximum number of keys that a non-root node can contain?
Answer: C
A B-tree of order m can have at most 2m-1 keys in any node and minimum m-1 keys in non-root nodes.
Q.62Medium
Which of the following is a correct SQL syntax for creating an index on multiple columns?
Answer: D
Both syntaxes are valid in SQL. The first creates a composite index, while the second creates a unique composite index.
Q.63Easy
What is the main disadvantage of using a linked list compared to arrays?
Answer: A
Linked lists require extra memory for storing pointers/references in each node, making them memory-inefficient compared to arrays.
Q.64Easy
In AWS, what does the term 'Auto Scaling' primarily ensure?
Answer: B
AWS Auto Scaling automatically adjusts the number of EC2 instances based on demand metrics like CPU utilization or network traffic.
Q.65Medium
Which sorting algorithm has the best average-case time complexity for randomly distributed data?
Answer: B
Quick Sort has O(n log n) average-case complexity, making it most efficient for random data. Though worst-case is O(n²), randomized pivot selection minimizes this risk.
Advertisement
Q.66Medium
What does ACID compliance in databases ensure?
Answer: B
ACID is a fundamental database property: Atomicity (all-or-nothing), Consistency (valid state), Isolation (concurrent independence), Durability (permanent after commit).
Q.67Easy
What is the primary function of a hash table data structure?
Answer: B
Hash tables use hash functions to map keys to indices, providing O(1) average-case lookup, insertion, and deletion operations.
Q.68Medium
Which cloud service model provides pre-configured application environments?
Answer: B
PaaS provides a complete development and deployment environment in the cloud, including pre-configured tools and frameworks.
Q.69Easy
What is the time complexity of the binary search algorithm on a sorted array?
Answer: B
Binary search divides the search space in half with each iteration, resulting in O(log n) time complexity on sorted data.
Q.70Hard
In database normalization, what does the Boyce-Codd Normal Form (BCNF) address that 3NF might miss?
Answer: B
BCNF handles edge cases in 3NF where anomalies can occur with composite candidate keys where determinants are not candidate keys themselves.
Q.71Easy
What is the purpose of the COMMIT statement in SQL transactions?
Answer: B
COMMIT saves all changes made during the current transaction to the database permanently. Until COMMIT, changes can be rolled back using ROLLBACK.
Q.72Medium
Which of the following best describes a graph data structure with no cycles?
Answer: B
A tree is a special case of a graph with no cycles. It has n nodes and n-1 edges, forming a hierarchical structure.
Q.73Medium
In machine learning, what does overfitting mean?
Answer: B
Overfitting occurs when a model learns the training data including its noise and irregularities, performing poorly on unseen test data.
Q.74Medium
What is the primary advantage of using MongoDB (NoSQL) over traditional relational databases?
Answer: B
MongoDB's document-based model allows flexible schemas for unstructured data and supports horizontal scaling, unlike rigid relational schemas.
Q.75Medium
In operating systems, what is a deadlock?
Answer: B
Deadlock is a situation where multiple processes cannot proceed because each holds resources needed by others, creating a circular wait condition.
Q.76Medium
What is the correct order of operations for the Big O notation from least to most complex?
Answer: A
Constant O(1) is fastest, followed by logarithmic O(log n), linear O(n), quadratic O(n²), exponential O(2ⁿ), and factorial O(n!) which is slowest.
Q.77Easy
Which cryptographic algorithm is currently recommended by NIST for symmetric encryption?
Answer: B
AES is the current NIST standard for symmetric encryption with key sizes of 128, 192, or 256 bits. DES is deprecated due to weak key size.
Q.78Easy
Which SQL JOIN returns only matching records from both tables?
Answer: A
INNER JOIN returns only the records that have matching values in both tables, filtering out non-matching rows.
Q.79Easy
In database indexing, which structure provides O(log n) search complexity?
Answer: B
B-Tree maintains balanced structure ensuring O(log n) search, insert, and delete operations, commonly used in databases.
Q.80Easy
Which data structure is best for implementing a priority queue in heapsort algorithm?
Answer: C
A heap (min-heap or max-heap) efficiently supports priority queue operations with O(log n) insertion and deletion.
