Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act of searching. Assume each file is accessed with the same frequencyGroup of answer choicesF3, F4, F1, F5, F6, F2F1, F2, F3, F4, F5, F6Ordering is immaterial as all files are accessed with the same frequencyF2, F6, F5, F1, F4, F3

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

The search technique for searching a sorted file that requires increased amount of space is ................1.Interpolation search2.Sequential search3.Indexed sequential search4.Tree search

The process of storing records in the order that they were added to a file is called:Question 5Select one:a.Entry-sequenced fileb.Binary Sequenced filec.LIFO file formatd.Tombstone approach

Which of the following algorithms does not need sorting of elements before performing a search?Group of answer choicesSequential SearchJump SearchBinary SearchExponential Search

Which of the following algorithms does not need sorting of elements before performing a search?Group of answer choicesSequential SearchExponential SearchJump SearchBinary Search