Govt. Exams
Entrance Exams
Advertisement
Topics in Computer Knowledge
What is the time complexity of a binary search algorithm on a sorted array?
Correct Answer:
B. O(log n)
EXPLANATION
Binary search divides the search space in half with each iteration, resulting in logarithmic time complexity O(log n).
Which normal form eliminates transitive dependencies in a database table?
Correct Answer:
A. Third Normal Form (3NF)
EXPLANATION
3NF removes transitive dependencies where a non-key attribute depends on another non-key attribute. BCNF is stricter but 3NF is the standard answer for eliminating transitive dependencies.