Top 1000+ Solved DataBase Management System (DBMS) MCQ Questions Answer

From 286 to 300 of 1187

Q. Which of the following case does not exist in complexity theory

a. best case

b. worst case

c. average case

d. null case

  • d. null case

Q. Which of the following is an attribute that can uniquely identify a row in a table?

a. secondary key

b. candidate key

c. foreign key

d. alternate key

  • b. candidate key

Q. The relationship between DEPARTMENT and EMPLOYEE is a

a. one-to-one relationship

b. one-to-many relationship

c. many-to-many relationship

d. many-to-one relationship

  • b. one-to-many relationship

Q. The Average case occur in linear search algorithm

a. when item is somewhere in the middle of the array

b. when item is not in the array at all

c. when item is the last element in the array

d. when item is the last element in the array or is not there at all

  • a. when item is somewhere in the middle of the array

Q. The complexity of the average case of an algorithm is

a. much more complicated to analyze than that of worst case

b. much more simpler to analyze than that of worst case

c. sometimes more complicated and some other times simpler than that of worst case

d. none of the mentioned

  • a. much more complicated to analyze than that of worst case

Q. The complexity of a linear search algorithm is

a. o(n)

b. o(log n)

c. o(n2)

d. o(n log n)

  • a. o(n)

Q. The complexity of Bubble sort algorithm is

a. o(n)

b. o(log n)

c. o(n2)

d. o(n log n)

  • c. o(n2)

Q. A           is a query that retrieves rows from more than one table or view:

a. start

b. end

c. join

d. all of the mentioned

  • c. join

Q. A condition is referred to as                      

a. join in sql

b. join condition

c. join in sql & condition

d. none of the mentioned

  • b. join condition

Q. Which is a join condition contains an equality operator:

a. equijoins

b. cartesian

c. both equijoins and cartesian

d. none of the mentioned

  • a. equijoins

Q. Which join refers to join records from the write table that have no matching key in the left table are include in the result set:

a. left outer join

b. right outer join

c. full outer join

d. half outer join

  • b. right outer join

Q. Which operation are allowed in a join view:

a. update

b. insert

c. delete

d. all of the mentioned

  • d. all of the mentioned

Q. Which view that contains more than one table in the top-level FROM clause of the SELECT statement:

a. join view

b. datable join view

c. updatable join view

d. all of the mentioned

  • c. updatable join view

Q. The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called

a. materialized evaluation

b. expression evaluation

c. tree evaluation

d. tree materialization

  • a. materialized evaluation

Q. Pipelines can be executed in

a. 4

b. 3

c. 2

d. 5

Subscribe Now

Get All Updates & News