adplus-dvertising
frame-decoration

Question

_____________ can help us detect poor E-R design.

a.

Database Design Process

b.

E-R Design Process

c.

Relational scheme

d.

Functional dependencies

Posted under DBMS

Answer: (d).Functional dependencies

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. _____________ can help us detect poor E-R design.

Similar Questions

Discover Related MCQs

Q. Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set.

Q. Suppose the user finds the usage of room number and phone number in a relational schema there is confusion.This is reduced by

Q. What is the best way to represent the attributes in a large database?

Q. Designers use which of the following to tune performance of systems to support time-critical operations?

Q. In the schema (dept name, size) we have relations total inst 2007, total inst 2008 . Which dependency have lead to this relation ?

Q. Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009) .Here the only functional dependencies are from dept name to the other attributes .This relation is in

Q. Thus a _______ of course data gives the values of all attributes, such as title and department, of all courses at a particular point in time.

Q. Representations such as the in the dept year relation, with one column for each value of an attribute, are called _______ they are widely used in spreadsheets and reports and in data analysis tools.

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

Q. Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is

Q. Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is

Q. A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:

F1->F3
F2->F4
(F1,F2)->F5

in terms of normalization, this table is in

Q. Consider the following functional dependencies in a database.

Date_of_Birth->Age Age->Eligibility

Name->Roll_number Roll_number->Name

Course_number->Course_name Course_number->Instructor

(Roll_number, Course_number)->Grade

The relation (Roll_number, Name, Date_of_birth, Age) is

Q. The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following FDs:

name,courseNo->grade
rollNo,courseNo->grade
name->rollNo
rollNo->name

The highest normal form of this relation scheme is

Q. The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode,there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in

Q. Which one of the following statements if FALSE?

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

Q. What are the desirable properties of a decomposition ?

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

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