Q. Manager's salary details are to be hidden from Employee Table. This Technique is called as

View solution

Q. A Network Schema

View solution

Q. Which normal form is considered as adequate for usual database design?

View solution

Q. If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of

View solution

Q. Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is

View solution

Q. The “PROJECT” operator of a relational algebra creates a new table that has always

View solution

Q. The employee information of an Organization is stored in the relation:

Employee (name, sex, salary, deptname)

Consider the following SQL query

Select deptname from Employee Where sex = ‘M’ group by deptname having avg (salary) > {select avg (salary) from Employee}

Output of the given query corresponds to

View solution

Q. For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation

View solution

Q. Match the following:

a. Foreign keys                                  i. Domain constraint
b. Private key                                     ii. Referential integrity
c. Event control action model         iii. Encryption
d. Data security                                 iv. Trigger

Codes:
      a   b   c   d

View solution

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