Home Subjects Computer Knowledge Database/SQL

Computer Knowledge
Database/SQL

Programming, networking, database and OS questions

32 Q 2 Topics Take Mock Test
Advertisement
Difficulty: All Easy Medium Hard 31–32 of 32
Topics in Computer Knowledge
All C Programming 200 Database/SQL 100
Q.31 Easy Database/SQL
What is the time complexity of a binary search algorithm on a sorted array?
A O(n)
B O(log n)
C O(n²)
D O(n log n)
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).

Test
Q.32 Easy Database/SQL
Which normal form eliminates transitive dependencies in a database table?
A Third Normal Form (3NF)
B Second Normal Form (2NF)
C Boyce-Codd Normal Form (BCNF)
D First Normal Form (1NF)
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.

Test
IGET
IGET AI
Online · Exam prep assistant
Hi! 👋 I'm your iget AI assistant.

Ask me anything about exam prep, MCQ solutions, study tips, or strategies! 🎯
UPSC strategy SSC CGL syllabus Improve aptitude NEET Biology tips