Quiz
Chapter 3
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (13)
11.)A table is in NF3 if:
- Aa.) is in NF2 and each non-key attribute non transitively depends of the table key.
- Bb.) is in NF1 and each key attribute transitively depends on non-key attributes.
- Cc.)is in NF2 and has complete dependency
- Dd.)is in NF1 and has incomplete functional dependecies
- Ee.)is in NF2 and has at least one complete functional dependency between the non-key attributes and the table key
23.)By applying the relational operator:
- Aa.)selection
- Bb.)join
- Cc.)existential quantifier
- Dd.)projection
- Ee.)intersection
32.)Relational calculus:
- Aa.)has as basis construction the tuple calculus expression or the domain calculus expression
- Bb.)it is implemented in ISBL language
- Cc.)contains the join operator
- Dd.)it is the based for the universal procedural languages
- Ee.)uses the notion of well-defined formula
44.)The design of RDB using the normalization technique:
- Aa.)removes update anomalies only if it comes to NF3
- Bb.)removes update anomalies only if it comes to NF4
- Cc.)removes update anomalies only if it comes to NF5
- Dd.)removes the delete anomaly
- Ee.)removes only the modify anomaly
55.)A table is in NF2 if:
- Aa.)is in NF3 and has no complete dependencies
- Bb.) is in NF1 and has only incomplete dependencies
- Cc.)does not have complete functional dependencies
- Dd.)is in NF1 and each non-key attribute is fully functionally dependent on the table key
- Ee.)is in NF1 and has no incomplete functional dependencies
66.)Relational calculus:
- Aa.)is based on predicate calculus
- Bb.)it is the base for non-procedural relational languages
- Cc.)can be tuple oriented having as basic construction the tuple calculus expression
- Dd.)is implemented in Quelle language
- Ee.)contains the projection operator
77.)A database is in NF1 if:
- Aa.)has at least one table in NF1
- Bb.)is in NF2
- Cc.)has all tables in NF1
- Dd.)has a normalized table
- Ee.)has a non-normalized table
88.)A table is in FN1 if:
- Aa.) the are group level attributes
- Bb.)there are repetitive attributes
- Cc.)there are no group level attributes
- Dd.)the are deomposable attributes
- Ee.)the are no repetitive attributes
99.)Similar concepts for RDB and files are:
- Aa.)table - field
- Bb.)table - file
- Cc.) attribute - domain
- Dd.) attribute - file
- Ee.) tuple - file
1010.)In RDB:
- Aa.)the data structure is only at the physical level
- Bb.) the data structure is at the conceptual level
- Cc.)the data structure is at the logical level
- Dd.)the structure of data is stored in application programs
- Ee.)data structure is stored in DB dictionary
1111.) DML of RDBMS:
- Aa.)may be based on diagrams of dependence
- Bb.) may be based on normalization
- Cc.) may be based on relational transformation
- Dd.) may be based on arithmetic calculation
- Ee.) may be based on Boolean algebra
1212.)Relational Algebra:
- Aa.) uses retrieval requests
- Bb.) has only table operands
- Cc.) has the union operator
- Dd.) does not have the intersection operator
- Ee.) does not have the projection operator
13BONUS !!! SA MOARA ... CU COPIII EI IN PUSCARIE !
- Aa.) Bianca
- Bb.) Miruna
- Cc.) Claudia
- Dd.) Ana
- Ee.) Maria
Information
- Description
- Quiz on Chapter 3, created by Costin Andrei on 07/02/2017.
- Author
- Costin Andrei
- Language
- English
- Views
- 33
- Rating
- No ratings yet Rate this quiz