Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain weak and strong entity type ?
Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a weak entity set depends on the existence of a strong entity set; it must associate to the strong set via a on-to-many relationship set. A discriminator of a weak entity set is the set of attributes that distinguishes between all the entities of a weak entity set. The primary key of a weak entity set is formed by the primary key of the strong entity set on that the weak entity set is existence depends, plus the weak entity set's discriminator.
Express the following queries in SQL: (a) Write the SQL code that will create ALL the four tables given in the appendix. Your answer should not contain the primary key and
Differentiate between Key and superkey? Key and superkey - A key a single attribute or a combination of two or more attributes of an entity set in which is used to identify o
The cross-section of twisted pair The cross-section of each and every strand of the twisted pair is π/4 square mm. A 10-km length of this type of material, with two strands per
Define physical and logical data independence. How does this architecture help in achieving these? Data independence entails that change in one view must not need a change in t
These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R
Primary index A primary index is a file that has a sorted series of records having two columns: a block address for that key field in the data file; and the ordering key field.
online eductional management system ke diagram
Explain the two types of participation constraint. Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i
What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.
Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd