Q. In multiuser database if two users wish to update the same record at the same time, they are prevented from doing so by

View solution

Q. What deletes the entire file except the file structure ?

View solution

Q. Which command is the fastest among the following ?

View solution

Q. B+ tree are preferred to binary tree in Database because

View solution

Q. A Transaction Manager is which of the following ?

View solution

Q. A B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ tree ?

View solution

Q. What is Granularity ?

View solution

Q. Which level of Abstraction describes what data are stored in the Database ?

View solution

Q. The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is …………….

View solution

Q. Consider a schema R(A, B, C, D) and functional dependencies A->B and C->D. Then the decomposition R1(A, B) and R2(C, D) is

View solution

Q. A hash table has space for 75 records, then the probability of collision before the table is 6% full.

View solution

Q. Which command classes text file, which has been created using “SET ALTERNATIVE” < FILE NAME > “Command” ?

View solution

Q. Which of the following statements is true, when structure of database file with 20 records is modified?

View solution

Q. The SQL Expression

Select distinct T. branch name from branch T, branch S where T. assets > S. assets and S. branch-city = DELHI,

finds the name of

View solution

Q. Which of the following is the recovery management technique in DDBMS ?

View solution

Q. Which of the following is the process by which a user’s privileges ascertained ?

View solution

Q. The basic variants of time-stampbased method of concurrency control are

View solution

Q. A transaction can include following basic database access operations :

View solution

Q. Consider a hash table of size m = 10000 and the hash function h(k) = ∟m(kA mod 1)'┘ for A = (√5–1)/2. The location to the key k = 123456 is

View solution

Q. The dependency preservation decomposition is a property to decompose database schema D, in which each functional dependency X->Y specified in F,

View solution