A significant benefit to using an index to hold and sort keys to a file is:Question 10Select one:a.Smaller keys require less I/Ob.The entire sort can always be completed in memoryc.The head of the disk drive does not need to moved.There is no seek time added to the latency of I/O operations

In the context of databases, which type of index uses a separate data structure to store index key values along with pointers to the actual data rows?OptionsDense IndexHash IndexB-Tree IndexBitmap Index

A linear index is an index file organized as a sequence of key/pointer pairs where the keys are in a sorter order.Question 8Select one:TrueFalse

Identify advantage and disadvantage of Sparse Index.Slower than dense index for locating the recordsLow overhead during insertion and deletionOccupies less space than dense index

Question 5: Index or Key Sorting [1 CA Mark]Consider that we have got a big matrix/2d list of data like this that should be sorted: The number of rows could easily be a few thousand.  Typical sort algorithms have got 2 problems to handle such a case:1 -  Many sorting keys, for instance, back to the table above, if the ‘company’ is the same for a few records, the algorithm should refer to ‘body_style’ and then the next columns to decide.2 -  Displacement of big records of data to sort the table is time-consuming. You are going to develop a sort algorithm to address both concerns:·    We use selection or merge sort as the base of our algorithm. (other sort algorithms can be used too)·    To compare 2 records, your code should compare the  1st column firstly, if they are equal the 2nd column should be considered, again in the case of equality it should refer to the next column. Although in many cases just the 1st column is enough to decide.·    To make the algorithm faster, we add an index or key array. The length of that is equal to the number of rows/records of the main table (n), and would be initiated with the record number or 0 to n-1:  Results:Your function just should return a sorted index list and this would be tested to see if it works properly or not.

Identify the advantage and disadvantage of sequential file organization.Simple designFetching particular data must follow only sequential order.Time consuming.Cheaper storage mechanism.Retrieval of data is easy.