DBA QUIZ 2

1.In statistical databases aggregate queries are not allowed.

Select one:
True
False {correct}

aggregate queries (SUM, COUNT, AVG, STDEV, etc.) are allowed.

2.Generating DDL statements from Conceptual model is known as Forward Engineering.

Select one:
True  {correct}
False

3.Every XML document must be associated with a DTD or XML Schema

Select one:
True
False {correct}

4.Checkpointing resolves deadlock situation effectively.

Select one:
True
False {correct}

5.We can have utmost one clustering Index on a table.

Select one:
True  { correct }
False

6.Which of the UML diagrams can be used for modeling database, in place of ER diagrams?

Select one:
a. Class {correct}
b. Activity
c. Use-case
d. Component

7.If in an indexing scheme, index records are created for only few key values that are seen in the data records,  it is known as__

Select one:
a. Sparse Index {correct}
b. Light Index
c. Shallow Index
d. Dense Index

8.If a transaction reaches partial commit state it can not be rolled back.

Select one:
True
False {correct}

9.The first record of each block in Primary indexing is called as-

Select one:
a. Block Record
b. Prime Record
c. Index Record
d. Anchor Record {correct}

10.XQuery uses FOR, LET, FROM, RESULT clauses in its statements.

Select one:
True
False {correct}

as FROM is not part of clause

11.In a B- tree record pointers are found at
Select one:
a. Only at root
b. Any level {correct}
c. Only at Intermediate level
d. Only at leaf level

B-tree, pointers to data records exist at all levels of the tree

12.Discretionary Access Control scheme classifies users and data objects in to categories.

Select one:
True
False { correct }

it happens in Mandatory Access Control.

13.Shadow paging is the technique used for ____

Select one:
a. Page transferring from Disk to RAM
b. Database Recovery {correct}
c. Data Integrity
d. Deadlock resolution

14.In Timestamp-based concurrency control,  when a transaction issues a Write request on data item A, the we must only look at  Write Timestamp of A; and we can ignore the Read Timestamp of A.
Select one:
True
False {correct}

15.Deadlock situation can be predicted by ___

Select one:
a. wait-for graph {correct}
b. Mutual graph
c. Lock graph
d. Sharing graph

16.In a m-way search tree, if each node contains maximum of m children, the minimum number of  keys is  in any internal node is  m-1.
Select one:
True
False {correct}


17.XQuery statements use XPath syntax. 

Select one:
True  {correct}
False

18.As per the heuristics used in query optimization, a cartesian product operation with a subsequent selection operation can be replaced by a grouping operation.

Select one:
True
False {correct}

Replace CARTESIAN PRODUCT and SELECT with JOIN operations .

19.The property of Conflict Serializability of a concurrent schedule can be tested using __ 

Select one:
a. Schedule graph
b. Serial graph
c. Query graph
d. Precedence graph {correct}

20.The old value of the data item is necessary in case of immediate modification scheme in Database Recovery

Select one:
True {correct}
False

21.Clustering Index is built on __ field.

Select one:
a. non-ordering key
b. Ordering non-key {correct}
c. Ordering key
d. non-ordering non-key

22.The timestamp-based concurrency control protocols use two-phase locking scheme.

Select one:
True
False {correct}

23.Serializability can be implemented using-
Select one:
a. Paging
b. Serializing
c. Checkpointing
d. Locks {correct}

24.The indexing scheme whose search key does not specify the sequential order of the file is-

Select one:
a. Secondary index  {correct}    
b. Unordered Index
c. Dense Index
d. Primary index        

25.The Concurrent execution of transactions can increase__
Select one:
a. Throughput {correct}
b. Integrity
c. Mutual exclusion
d. Consistency