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

What is an Index?

A single-level ordered index where the index points to  individual records  rather than  blocks of data    is known as:  *1 pointA. Dense indexB. Sparse indexC. Primary indexD. Secondary index

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

Which of the following code snippet performs linear search recursively? for(i=0;i<n;i++) { if(a[i]==key) printf("element found"); } LinearSearch(int[] a, n,key) { if(n<1) return False if(a[n]==key) return True else LinearSearch(a,n-1,key) } LinearSearch(int[] a, n,key) { if(n<1) return True if(a[n]==key) return False else LinearSearch(a,n-1,key) } LinearSearch(int[] a, n,key) { if(n<1) return False if(a[n]==key) return True else LinearSearch(a,n+1,key) }