On This Page

This set of DataBase Management System (DBMS) Multiple Choice Questions & Answers (MCQs) focuses on Database Management System Set 23

Q1 | The Average case occur in linear search algorithm
  • when item is somewhere in the middle of the array
  • when item is not in the array at all
  • when item is the last element in the array
  • when item is the last element in the array or is not there at all
Q2 | The complexity of the average case of an algorithm is
  • much more complicated to analyze than that of worst case
  • much more simpler to analyze than that of worst case
  • sometimes more complicated and some other times simpler than that of worst case
  • none of the mentioned
Q3 | The complexity of a linear search algorithm is
  • o(n)
  • o(log n)
  • o(n2)
  • o(n log n)
Q4 | The complexity of Bubble sort algorithm is
  • o(n)
  • o(log n)
  • o(n2)
  • o(n log n)
Q5 | A           is a query that retrieves rows from more than one table or view:
  • start
  • end
  • join
  • all of the mentioned
Q6 | A condition is referred to as                      
  • join in sql
  • join condition
  • join in sql & condition
  • none of the mentioned
Q7 | Which oracle is the join condition is specified using the WHERE clause:
  • oracle 9i
  • oracle 8i
  • pre-oracle 9i
  • pre-oracle 8i
Q8 | Which is a join condition contains an equality operator:
  • equijoins
  • cartesian
  • both equijoins and cartesian
  • none of the mentioned
Q9 | 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:
  • left outer join
  • right outer join
  • full outer join
  • half outer join
Q10 | Which operation are allowed in a join view:
  • update
  • insert
  • delete
  • all of the mentioned
Q11 | Which view that contains more than one table in the top-level FROM clause of the SELECT statement:
  • join view
  • datable join view
  • updatable join view
  • all of the mentioned
Q12 | The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called
  • materialized evaluation
  • expression evaluation
  • tree evaluation
  • tree materialization
Q13 |                              allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.
  • buffering
  • double buffering
  • multiple buffering
  • double reading
Q14 | Pipelines can be executed in
  • 4
  • 3
  • 2
  • 5
Q15 | In a                    the system makes repeated requests for tuples from the operation at the top of the pipeline.
  • demand-driven pipeline
  • producer-driven pipeline
  • demand pipeline
  • all of the mentioned
Q16 | In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
  • demand-driven pipeline
  • producer-driven pipeline
  • demand pipeline
  • all of the mentioned
Q17 | Each operation in a demand-driven pipeline can be implemented as an          that provides the following functions: open(), next(), and close().
  • demand
  • pipeline
  • iterator
  • all of the mentioned
Q18 | The iterator maintains the                      of its execution in between calls so that successive next() requests receive successive result tuples.
  • state
  • transition
  • rate
  • block
Q19 | Tuples are generated                        in producer-driven pipelining, they are generated                  on demand, in demand- driven pipelining.
  • lazily, eagerly
  • eagerly, lazily
  • slowly, eagerly
  • eagerly, slowly
Q20 | When two inputs that we desire to pipeline into the join are not already sorted it is the                            technique.
  • hash join
  • buffer join
  • double-pipelined hash join
  • double-pipelined join
Q21 | Which of the following is/are false for RAW mode of FOR XML?
  • xmlschema option does not returns an in-line xsd schema
  • binary base32 returns the binary data in base32-encoded format
  • each row in the query result is transformed into an xml element
  • none of the mentioned
Q22 |                        refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails.
  • isolation
  • atomicity
  • consistency
  • durability
Q23 | You have a column that will only contain values from 0 to 256. What is the most economical data type to use for the column?
  • tinyint
  • smallint
  • int
  • decimal(1)
Q24 | Problems occurs if we don’t implement a proper locking strategy
  • dirty reads
  • phantom reads
  • lost updates
  • unrepeatable reads
Q25 | Which of the following fixed database roles can add or remove user IDs?
  • db_accessadmin
  • db_securityadmin
  • db_setupadmin
  • db_sysadmin