Database Management System Set 27

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 27

Q1 | Which server can join the indexes when only multiple indexes combined can cover the query:
Q2 | In concurrency control policy the lock is obtained on
Q3 | A concurrency-control policy such as this one leads to              performance since it forces transactions to wait for preceding transactions to finish before they can start.
Q4 |                      are used to ensure that transactions access each data item in order of the transactions’          if their accesses conflict.
Q5 | In which scenario would you use the ROLLUP operator for expression or columns within a GROUP BY clause?
Q6 | Which statement is true regarding external tables?
Q7 | SNAPSHOT is used for (DBA)
Q8 | Isolation of the transactions is ensured by
Q9 | Which of the following statements is/are not true for SQL profiler?
Q10 | Which of the following is the original purpose of SQL?
Q11 | SQL can be used to:
Q12 | A lock that allows concurrent transactions to access different rows of the same table is known as a
Q13 | Which of the following are introduced to reduce the overheads caused by the log- based recovery?
Q14 | Which of the following protocols ensures conflict serializability and safety from deadlocks?
Q15 | Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other
Q16 | The          lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
Q17 | Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?
Q18 | A system is in a              state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.
Q19 | The deadlock state can be changed back to stable state by using                             statement.
Q20 | What are the ways of dealing with deadlock?
Q21 | When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is
Q22 | When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti). This is
Q23 | The situation where the lock waits only for a specified amount of time for another lock to be released is
Q24 | The deadlock in a set of a transaction can be determined by
Q25 | A deadlock exists in the system if and only if the wait-for graph contains a                        
Previous Next