iGET

Computer Knowledge - MCQ Practice Questions

Practice free Computer Knowledge multiple-choice questions with detailed answers and explanations. Perfect for competitive exam preparation.

309 questions | 100% Free

Q.61Hard

In a B-tree of order m, what is the maximum number of keys that a non-root node can contain?

Q.62Medium

Which of the following is a correct SQL syntax for creating an index on multiple columns?

Q.63Easy

What is the main disadvantage of using a linked list compared to arrays?

Q.64Easy

In AWS, what does the term 'Auto Scaling' primarily ensure?

Q.65Medium

Which sorting algorithm has the best average-case time complexity for randomly distributed data?

Q.66Medium

What does ACID compliance in databases ensure?

Q.67Easy

What is the primary function of a hash table data structure?

Q.68Medium

Which cloud service model provides pre-configured application environments?

Q.69Easy

What is the time complexity of the binary search algorithm on a sorted array?

Q.70Hard

In database normalization, what does the Boyce-Codd Normal Form (BCNF) address that 3NF might miss?

Q.71Easy

What is the purpose of the COMMIT statement in SQL transactions?

Q.72Medium

Which of the following best describes a graph data structure with no cycles?

Q.73Medium

In machine learning, what does overfitting mean?

Q.74Medium

What is the primary advantage of using MongoDB (NoSQL) over traditional relational databases?

Q.75Medium

In operating systems, what is a deadlock?

Q.76Medium

What is the correct order of operations for the Big O notation from least to most complex?

Q.77Easy

Which cryptographic algorithm is currently recommended by NIST for symmetric encryption?

Q.78Easy

Which SQL JOIN returns only matching records from both tables?

Q.79Easy

In database indexing, which structure provides O(log n) search complexity?

Q.80Easy

Which data structure is best for implementing a priority queue in heapsort algorithm?