Answer:
1. DBMS
C. <em>A storage system that provides efficient access to randomly chosen items</em>
G. <em>Performs database operations requested by application software</em>
2. data mining
B. <em>The process of extracting hidden information</em>
3. hash file
A. <em>A. means of locating a particular record within a file</em>
4. index key field
F. <em>An item used to identify records uniquely</em>
5. locking protocol
E. <em>A system to guard against database errors due to performing transactions concurrently</em>
6. relation
D. <em>A structural unit (with rows and columns) in a popular database model</em>
7. roll back schema
I. <em>A "road map" of a particular database's design</em>
J. <em>To "unwind" a transaction</em>
8. SQL
H. <em>A popular language that implements relational database operations.</em>
Answer:
c) it will always return with an answer of 7 or fewer comparisons of data.
Explanation:
As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.
The answer & explanation for this question is given in the attachment below.
