PPSC FPSC KPPSC BPSC SPSC Lecturer Computer Science Test 48

Which forms are based on the concept of functional dependency:

Suppose relation R(A,B) currently has tuples {(1,2), (1,3), (3,4)} and relation S(B,C) currently has {(2,5), (4,6), (7,8)}.

Then the number of tuples in the result of the SQL query:

Select *

From R Natural Outer Join S; is:

We can use the following three rules to find logically implied functional dependencies. This collection of rules is called

A table on the many side of a one to many or many to many relationship must:

A dependency exist between two columns when:

Which of the following is not a Armstrong‘s Axiom ?

R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition.

Which normal form is considered adequate for normal relational database design?

A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.

In the ....................normal form, a composite attribute is converted to individual attributes.

Which is a bottom-up approach to database design that design by examining the relationship between attributes:

The functional dependency can be tested easily on the materialized view, using the constraints.............

What are the desirable properties of a decomposition:

Consider a relation R(A,B,C,D,E) with the following functional dependencies:

ABC -> DE and

D -> AB

The number of superkeys of R is:

Tables in second normal form (2NF):

A data type that creates unique numbers for key columns in Microsoft Access is:

Functional Dependencies are the types of constraints that are based on:

Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:

Which forms has a relation that possesses data about an individual entity:

The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is:

The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into employee1 (ID, name) employee2 (name, street, city, salary) This type of decomposition is called

There are two functional dependencies with the same set of attributes on the left side of the arrow:

A->BC

A->B

This can be combined as

Which of the following is not a Armstrong‘s Axiom ?

Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under:

We can use the following three rules to find logically implied functional dependencies. This collection of rules is called