Database Management System Set 23

Computer Science Engineering (CSE),

Bachelor of Science in Computer Science FY (BSc CS),

Bachelor of Science in Computer Science SY (BSc CS),

Bachelor of Science in Information Technology SY (BSc IT),

Bachelor of Computer Applications (BCA),

Bachelor of Business Administration in Computer Applications (BBA [CA]),

Bachelor of Science in Information Technology (BSc IT),

Bachelor of Science in Computer Science (BSc CS),

Master of Business Administration (MBA)

Learning Mode Previous Next
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
Q2 | The complexity of the average case of an algorithm is
Q3 | The complexity of a linear search algorithm is
Q4 | The complexity of Bubble sort algorithm is
Q5 | A           is a query that retrieves rows from more than one table or view:
Q6 | A condition is referred to as                      
Q7 | Which oracle is the join condition is specified using the WHERE clause:
Q8 | Which is a join condition contains an equality operator:
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:
Q10 | Which operation are allowed in a join view:
Q11 | Which view that contains more than one table in the top-level FROM clause of the SELECT statement:
Q12 | The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called
Q13 |                              allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.
Q14 | Pipelines can be executed in
Q15 | In a                    the system makes repeated requests for tuples from the operation at the top of the pipeline.
Q16 | In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
Q17 | Each operation in a demand-driven pipeline can be implemented as an          that provides the following functions: open(), next(), and close().
Q18 | The iterator maintains the                      of its execution in between calls so that successive next() requests receive successive result tuples.
Q19 | Tuples are generated                        in producer-driven pipelining, they are generated                  on demand, in demand- driven pipelining.
Q20 | When two inputs that we desire to pipeline into the join are not already sorted it is the                            technique.
Q21 | Which of the following is/are false for RAW mode of FOR XML?
Q22 |                        refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails.
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?
Q24 | Problems occurs if we don’t implement a proper locking strategy
Q25 | Which of the following fixed database roles can add or remove user IDs?
Previous Next