The method of access which uses key transformation is known as
| A. | Direct. |
| B. | Hash. |
| C. | Random. |
| D. | Sequential |
|
Option: B Explanation : Click on Discuss to view users comments. |
The file organization that provides very fast access to any arbitrary record of a file is
| A. | Ordered file |
| B. | Unordered file |
| C. | Hashed file |
| D. | B-tree |
|
Option: C Explanation : Click on Discuss to view users comments. |
The physical location of a record is determined by a mathematical formula that transforms a file key into a record location is :
| A. | B-Tree File |
| B. | Hashed File |
| C. | Indexed File |
| D. | Sequential file. |
|
Option: B Explanation : Click on Discuss to view users comments. |
A B-tree of order m has maximum of _____________ children
| A. | m |
| B. | m+1 |
| C. | m-1 |
| D. | m/2 |
|
Option: A Explanation : Click on Discuss to view users comments. vijay said: (1:10pm on Tuesday 18th June 2013)
B tree m order have m pointers, m-1 keys
nitish said: (3:49pm on Sunday 29th December 2013)
vijay is saying right...if it is wrong tell me the reason.
|
Syllabus covered in this section is-
This Section covers Data Warehousing Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various Search Terms used for this section are
