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!
What is banker's algorithm?
Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource type. The two algorithms used for its execution are:
a. Safety algorithm: The algorithm for finding out whether or not a system is in a safe state.
b. Resource-request algorithm: If the resulting resource allocation is safe, the transaction is completed and process Pi is allocated its resources. If the new state is unsafe Pi must wait and the old resource-allocation state is restored.
Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a
What is completeness constraint on generalization? Define the variation between total and partial design constraint. Give an example each. Ans: Completeness Constraints
various techniques of hashing?
Explain Data Dictionary in short?
Explain several types of constraints that can be specified using CREATE TABLE command. Explain CASCADE and RESTRICT clauses of DROP SCHEMA command? Constraint Description PRIM
Consider the following relations: S (S#, SNAME, STATUS, CITY) SP (S#, P#, QTY) P (P#, PNAME, COLOR, WEIGHT, CITY) Give an expression within SQL for each of queries b
What is data integrity? Ans: It is the data consisted of in database that is accurate and consistent. (Data integrity means that the data should be valid as per to the give
What are the various forms of data transparency? a) fragmentation transparency b) replication transparency c) location transparency
Question: AirwaysCentre, an international airline booking company currently uses a relational database system for their operations, which includes the following relations: P
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
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