Welcome to DataBase Quiz, Advanced Level !!

Question 1. What type of lock will deny users any access to a table?





Question 2. The highest level in the hierarchy of data organization is called

data bank

data base

data file

data record

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

dependency preserving and loss less join

loss less join but not dependency preserving

dependency preserving but not loss less join

not dependency preserving and not loss less join

Question 4. What will be the output of the following statement? SELECT STR(6365, 3)





Question 5. In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated as false. Which of the following pairs is not equivalent?

x = 5, not (not (x = 5))

x = 5, x > 4 and x < 6, where x is an integer

x < 5, not(x = 5)

none of the above

Question 6. Given the relations
employee (name, salary, deptno) and department (deptno, deptname, address)
Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x, , p)?

Department address of every employee

Employees whose name is the same as their department name

The sum of all employees? salaries

All employees of a given department

Question 7. Given the following relation instance.
x  y  z
1  4  2
1  5  3
1  6  3
3  2  2 
Which of the following functional dependencies are satisfied by the instance?

XY -> Z and Z -> Y

YZ -> X and Y -> Z

YZ -> X and X -> Z

XZ -> Y and Y -> X

Question 8. What is the best data type to store the birthdays of the US Presidents, starting with George Washington's birthday of February 22, 1732?





Question 9. What is the maximum date value that can be stored in a SMALLDATETIME data type?

June 6, 2079

July 6, 2079

December 31, 2079

December 31, 9999

Question 10. Which of the following is true of a network structure?

It is a physical representation of the data

It allows a many-to-many relationship

It is conceptually simple

It will be dominant data base of the future