Jobs By Abekus

Advanced-rdbms-concepts Questions Set 1:

Quiz Mode

How many rules are there in Codd's RDBMS concepts?

Solution:

Which type of key is used for the Referential Integrity Constraint?

Candidate Key

Super key

Foreign Key

Primary key

Solution:

Which one of the following is NOT a part of the ACID properties of database transactions?

Atomicity

Consistency

Isolation

Deadlock-freedom

Solution:

The _______ statement makes the updates performed by the transaction permanent.

Finalize work

Finish work

Commit work

None of the mentioned

Solution:

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

Dense

Sparse

Clustered

Unclustered

Solution:

Suppose the following functional dependencies hold on a relation U with attributes P, Q, R, S and T:
P → QR
RS → T
Which of the following functional dependencies can be inferred from the above functional dependencies?

1, 2, 3, 4

1, 2, 4

None

Solution:

A relation r(A,B) in a relational database has 1200 tuples. The attribute A has integer values ranging from 6 to 20, and the attribute B has integer values ranging from 1 to 20. Assume that the attributes A and B are independently distributed. The estimated number of tuples in the output of σ_{(A>10)∨(B=18)}(r)

820

1200

960

1000

Solution:

Choose the correct statement regarding superkeys.

Every superkey is a candidate key

A superkey is an attribute or a set of attributes that distinguish the relation from other relations

A superkey is an attribute or a group of multiple attributes that can uniquely identify a tuple

A superkey is a tuple or a set of multiple tuples that can uniquely identify an attribute

Solution:

Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory foo. Which of the following operations will necessarily require a full scan of foo for successful completion?

Creation of a new file in foo
Deletion of an existing file from foo
Renaming of an existing file in foo
Opening of an existing file in foo

1, 4

1, 3

2, 4

3, 4

Solution:

Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O1,...,Ok}. This is done in the following manner: Step 1. T acquires exclusive locks to O1, . . . , Ok in increasing order of their addresses. Step 2. The required operations are performed. Step 3. All locks are released. This protocol will

guarantee serializability and deadlock-freedom

guarantee neither serializability nor deadlock-freedom

guarantee serializability but not deadlock-freedom

guarantee deadlock-freedom but not serializability

Advanced-rdbms-concepts Questions Set 1:

How many rules are there in Codd's RDBMS concepts?

Solution:

Which type of key is used for the Referential Integrity Constraint?

Solution:

Which one of the following is NOT a part of the ACID properties of database transactions?

Solution:

The _______ statement makes the updates performed by the transaction permanent.

Solution:

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

Solution:

Suppose the following functional dependencies hold on a relation U with attributes P, Q, R, S and T:
P → QR
RS → T
Which of the following functional dependencies can be inferred from the above functional dependencies?

Solution:

Solution:

Choose the correct statement regarding superkeys.

Solution:

Solution:

Solution:

Related Question Sets:

Related Topics:

Advanced-rdbms-concepts Questions Set 1:

How many rules are there in Codd's RDBMS concepts?

Solution:

Which type of key is used for the Referential Integrity Constraint?

Solution:

Which one of the following is NOT a part of the ACID properties of database transactions?

Solution:

The _______ statement makes the updates performed by the transaction permanent.

Solution:

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

Solution:

Suppose the following functional dependencies hold on a relation U with attributes P, Q, R, S and T:P → QRRS → TWhich of the following functional dependencies can be inferred from the above functional dependencies?

Solution:

Solution:

Choose the correct statement regarding superkeys.

Solution:

Solution:

Solution:

Related Question Sets:

Related Topics:

Suppose the following functional dependencies hold on a relation U with attributes P, Q, R, S and T:
P → QR
RS → T
Which of the following functional dependencies can be inferred from the above functional dependencies?