1. What is a Participation
constraint?
Ans: The participation constraint specifies whether the existence of an entity depends on its being related to another entity via the relationship type. This is of two types:
1. Total participation.
2. Partial participation.
Ans: The participation constraint specifies whether the existence of an entity depends on its being related to another entity via the relationship type. This is of two types:
1. Total participation.
2. Partial participation.
2. What is a weak entity types?
Ans: The entity types that do not have key attributes of their own are called weak entity types.Rests are called strong entity types .The entity that gives identity to a weak entity is called owner entity. And the relationship is called identifying relationship. A weak entity type always has a total participation constraint with respect to its identifying relationship.
Ans: The entity types that do not have key attributes of their own are called weak entity types.Rests are called strong entity types .The entity that gives identity to a weak entity is called owner entity. And the relationship is called identifying relationship. A weak entity type always has a total participation constraint with respect to its identifying relationship.
3. What is an ER Diagram?
Ans: This data model is based on real world that consists of basic objects called entities and of relationship among these objects. Entities are described in a database by a set of attributes.
Ans: This data model is based on real world that consists of basic objects called entities and of relationship among these objects. Entities are described in a database by a set of attributes.
4. What is specialization?
Ans: It is the process of defining a set of subclasses of an entity type where each subclass contain all the attributes and relationships of the parent entity and may have additional attributes and relationships which are specific to itself.
Ans: It is the process of defining a set of subclasses of an entity type where each subclass contain all the attributes and relationships of the parent entity and may have additional attributes and relationships which are specific to itself.
5. What is generalization?
Ans: It is the process of finding common attributes and relations of a number of entities and defining a common super class for them.
Ans: It is the process of finding common attributes and relations of a number of entities and defining a common super class for them.
6. What are constraints on
generalization and specialization?
Ans:
1. Disjointness constraints.
2. Completeness constraints.
Disjointness constraint specifies that the subclasses of the specialization must be disjoint .i.e. an entity can be a member of at most one of the subclasses of the specialization. The reverse of it is overlapping.
Completeness constraint is a participation constraint which may be
1. Total
2. Partial
Total specialization constraint tells that each entity in the super class must be a member of some subclass in the specialization. And partial specialization constraint allows an entity not to belong to any of the subclasses .Thus we do have the following 4 types of constraints on specialization:
1. Disjoint, total
2. Disjoint, partial
3. Overlapping, total
4. Overlapping, partial
Ans:
1. Disjointness constraints.
2. Completeness constraints.
Disjointness constraint specifies that the subclasses of the specialization must be disjoint .i.e. an entity can be a member of at most one of the subclasses of the specialization. The reverse of it is overlapping.
Completeness constraint is a participation constraint which may be
1. Total
2. Partial
Total specialization constraint tells that each entity in the super class must be a member of some subclass in the specialization. And partial specialization constraint allows an entity not to belong to any of the subclasses .Thus we do have the following 4 types of constraints on specialization:
1. Disjoint, total
2. Disjoint, partial
3. Overlapping, total
4. Overlapping, partial
7. What is a ternary relationship?
Ans: A relationship with a degree 3 is called a ternary relationship.
Ans: A relationship with a degree 3 is called a ternary relationship.
8. What is aggregation and
association?
Ans: Aggregation is an abstraction concept for building composite objects from their component objects. The abstraction of association is used to associate objects from several independent classes.
Ans: Aggregation is an abstraction concept for building composite objects from their component objects. The abstraction of association is used to associate objects from several independent classes.
Ans: Redundant array of inexpensive (or independent) disks. The main goal of raid technology is to even out the widely different rates of performance improvement of disks against those in memory and microprocessor. Raid technology employs the technique of data striping to achieve higher transfer rates.
10. What is Hashing technique?
Ans: This is a primary file organization technique that provides very fast access to records on certain search conditions. The search condition must be an equality condition on a single field, called hash field of the file.
1. Internal hashing
2. External hashing
3. Extendible hashing
4. Linear hashing
5. Partitioned hashing
Ans: This is a primary file organization technique that provides very fast access to records on certain search conditions. The search condition must be an equality condition on a single field, called hash field of the file.
1. Internal hashing
2. External hashing
3. Extendible hashing
4. Linear hashing
5. Partitioned hashing
No comments:
Post a Comment