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

From 301 to 315 of 1187

Q. In a                    the system makes repeated requests for tuples from the operation at the top of the pipeline.

a. demand-driven pipeline

b. producer-driven pipeline

c. demand pipeline

d. all of the mentioned

  • a. demand-driven pipeline

Q. In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.

a. demand-driven pipeline

b. producer-driven pipeline

c. demand pipeline

d. all of the mentioned

  • b. producer-driven pipeline

Q. Which of the following is/are false for RAW mode of FOR XML?

a. xmlschema option does not returns an in-line xsd schema

b. binary base32 returns the binary data in base32-encoded format

c. each row in the query result is transformed into an xml element

d. none of the mentioned

  • b. binary base32 returns the binary data in base32-encoded format

Q. Problems occurs if we don’t implement a proper locking strategy

a. dirty reads

b. phantom reads

c. lost updates

d. unrepeatable reads

  • b. phantom reads

Q. Which of the following pair of regular

a. 1(01)* and (10)*1

b. x(xx)* and (xx)*x

c. (ab)* and a*b*

d. x+ and x*x+

  • c. (ab)* and a*b*

Q. Which feature converts row data to a column for better analytical view?

a. views

b. join

c. pivot

d. trigger

  • c. pivot

Q. Stored procedures are safe from SQL injection attacks

a. true

b. false

c. depends on the result

d. always safe

  • a. true

Q. Which of the following connection type supports application role permissions and password encryption?

a. ole db

b. dblib

c. odbc

d. ole db and odbc

  • d. ole db and odbc

Q. 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

a. dependency preserving and lossless join

b. lossless join but not dependency preserving

c. dependency preserving but not lossless join

d. not dependency preserving and not lossless join

  • d. not dependency preserving and not lossless join

Q. Which one of the following statements about normal forms is FALSE?

a. bcnf is stricter than 3nf

b. lossless, dependency-preserving decomposition into 3nf is always possible

c. lossless, dependency-preserving decomposition into bcnf is always possible

d. any relation with two attributes is in bcnf

  • c. lossless, dependency-preserving decomposition into bcnf is always possible
Subscribe Now

Get All Updates & News