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!
Define the basic operations of the relational algebra?
Ans: Basic operators of relational algebra are:
1. Union (∪) - Selects tuples which are in either P or Q or in both of them. The duplicate tuples are removed.
R = P ∪ Q
2. Difference or Minus (-) - eliminates common tuples from the first relation.
R = P - Q
3. Cartesian Product or Cross Product (×) - The cartesian product of two relations is the concatenation of tuples that are belonging to the two relations and containing all possible combination of the tuples.
R = P× Q
4. Projection (π) - The projection of a relation is illustrated as a projection of all its tuples over some set of attributes that is it yields a vertical subset of the relation. The relation's projection T on the attribute A is presented by T [A] or πA(T),.
5. Selection (σ) - Selects just some of the tuples, those satisfy specified criteria, from the relation. It yields a horizontal subset of a following relation.
R = σB(P)
The technique of converting the state diagram to code a) Identify all major control paths. Start from initial state; choose a path across the diagram that corresponds to normal
Inheritance Adjustment As in object oriented analysis and design terms inheritance defines a relationship between classes, where as one class shares structure or behaviour def
Eliminate Columns Not Dependent On Key The Employee Relation satisfies - First normal form - As it has no repeating groups. Second normal form - As it do not have multi-a
What is the disadvantage of a call by reference? During a call by reference damage or loss of data is not restricted to the subroutine, but will instantly lead to alters to th
State the Component Diagram A component diagram represents a set of component and relationships among them. In a dynamic model, component diagram is used to model physical com
Domain Constraints Domain constraints are primarily formed for defining the logically correct values for an attribute of a relation. The relation allows attributes of a relatio
a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.
Define Shared locks? Ans: Shared lock: Throughout concurrent execution of transactions, earlier than a transaction can access a data item, it has to obtain a lock on it. Now he
Explain query execution plan? - Optimizer available in SQL Server optimizes code to be effectively executed. - A query execution plan demonstrates how this optimizer would r
What is 2NF? A relation schema R is in 2NF if it is in 1NF and every non-prime attribute A in R is fully functionally dependent on primary key.
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