Core Computer Science & MCA Entrance (SQL, OS, Networks & NIMCET)

Database Management Systems & SQL Queries Theory & Problems question bank (Database Management Systems & SQL Queries)

Practice 42 free Core Computer Science & MCA Entrance (SQL, OS, Networks & NIMCET) Database Management Systems & SQL Queries - Database Management Systems & SQL Queries Theory & Problems questions with answers and step-by-step solutions.

Start free Book a demo

All Easy Medium

Q1.

[Core Computer Science & NIMCET - (Question #1)]
In Relational Database Management Systems, which normal form eliminates transitive functional dependencies?

(A)

{'key': 'A', 'text': 'Third Normal Form (3NF)'}

(B)

{'key': 'B', 'text': 'Second Normal Form (2NF)'}

(C)

{'key': 'C', 'text': 'First Normal Form (1NF)'}

(D)

{'key': 'D', 'text': 'Boyce-Codd Normal Form (BCNF)'}

Show answer & solution

Verified Answer & Solution Locked

Q2.

[Core Computer Science & NIMCET - (Question #4)]
What is the maximum number of nodes in a binary tree of height h (where height of root is 0)?

(A)

{'key': 'A', 'text': '$2^{h+1} - 1$'}

(B)

{'key': 'B', 'text': '$2^h - 1$'}

(C)

{'key': 'C', 'text': '$2^{h-1}$'}

(D)

{'key': 'D', 'text': '$h^2 + 1$'}

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 42 Questions in Database Management Systems & SQL Queries Theory & Problems

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 42 questions

Unlock every Database Management Systems & SQL Queries Theory & Problems question, generate papers, and practice at your own pace.

Start free