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!
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. The algorithm should be able to cope with multiple types of resources, each type having a limited number of units available.
c. When should the algorithm be invoked? The answer to this question may depend on system characteristics such as the rate of resource requests, the granularity of resources, and the expected rate of deadlock. List three possible choices and discuss the criteria you would use to choose among them.
Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment
Describe the algorithm to draw the dependency graph? Ans: Algorithm to draw Precedence Graph is like this: a. For every transaction T i participating in schedule S, make
Complete replication: It implies maintaining of a whole copy of the database at every site. Thus, the reliability & availability and performance for query response are maximized.
vertical fragmentation
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 ty
What is a SELECT operation? The select operation selects tuples that please a given predicate. We use the lowercase letter σ to denote selection.
In case of entity integrity, the primary key may be declared? In a case of entity integrity primary key may be not Null.
losers with new information systems
Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.
Consider the following relational schema: Doctor(DName,Reg_no) Patient(Pname, Disease) Assigned_To (Pname,Dname) Give expression in both Tuple calculus and Domain calculus for
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