External Sorting Algorithms Multiple Choice Questions (MCQ) PDF Download

MCQ 1: In external sorting, the number of runs that can be merged in every pass are called

1. degree of merging
2. degree of passing
3. degree of sorting
4. degree of runs

MCQ 2: The files that can fit in available buffer space in phase of external sorting must be read into

1. multilevel indexes
2. search nodes
3. main memory
4. processing unit

MCQ 3: The procedure of sorting the algorithms for larger records that does not fit in the main memory and are stored on disk is classified as

1. parser sorting
2. external sorting
3. internal sorting
4. secondary sorting

MCQ 4: The files from which algorithms are selected for records are called

1. scan files
2. spanned files
3. non dense files
4. indexed files

MCQ 5: In sort merge strategy, the small sub files sorted are called

1. runs
2. folders
3. blocks
4. indexes