MOOC SWAYAM Data Structures
WEEK 10&11 Assessments
1) In the indexed file system, what happens when an index table overflows?
a) The file is deleted
b) A multi-level index is created
c) Data is reallocated
d) A new directory is created
2) What is the main disadvantage of sequential file organization?
a) Requires large memory space
b) Slower access for a single record search
c) Cannot store large files
d) Requires hashing
3 Which sorting method is used when data is too large to fit in main memory?
a) Merge Sort
b) Bubble Sort
c) External Sorting
d) Insertion Sort
4) In polyphase merge sort, what determines the distribution of runs?
a) Heap size
b) Number of disks
c) Fibonacci sequence
d) Number of I/O operations
5) In external sorting, which factor is most critical?
a) Number of comparisons
b) Number of disk accesses
c) Sorting algorithm used
d) Use of recursion
6) Which data structure is best suited for implementing an indexed file system?
a) Stack
b) Queue
c) Hash Table
d) B-Tree
7) In polyphase merge sort, how many tape units are typically used?
a) k+1
b) 2k
c) k-1
d) 3k
8) What is the function of the index block in indexed allocation?
a) Stores actual data
b) Points to disk blocks containing file data
c) Helps in garbage collection
d) Increases file size
9) What is the biggest advantage of multi-way merge sort over two-way merge sort?
a) Reduces the number of merging passes
b) Uses more memory
c) Increases disk fragmentation
d) Decreases file size
10) What is the key feature of cascade merge sort?
a) Uses Fibonacci series
b) Uses fewer tape units
c) Requires two tapes for merging
d) Sorts data in memory only
11) In a sort-merge join algorithm, what is the first step?
a) Splitting the records
b) Sorting the records
c) Merging the records
d) Searching for duplicate recordsd) Linked List
12) Why is polyphase merge sort more efficient than cascade merge sort?
a) Requires fewer sorting passes
b) Requires fewer disk accesses
c) Uses parallel processing
d) Requires fewer comparisons
13) What is the primary purpose of external sorting?
a) Sorting data stored in main memory
b) Sorting data stored on secondary storage
c) Sorting data using bubble sort
d) Sorting data using recursion
14) Which of the following is a disadvantage of hashing in file storage?
a) Collisions
b) Slow retrieval
c) Uses linear search
d) Requires external sorting
15) How does a balance-line algorithm maintain synchronization between master
and transaction files?
a) Using a FIFO queue
b) Using an active key
c) Using a heap structure
d) Using an AVL treed) Merge Sort
16) What is a major advantage of linked allocation over contiguous allocation?
a) Eliminates fragmentation
b) Provides direct access
c) Uses more disk space
d) Slower file access
17) How does an operating system manage file storage in non-contiguous
allocation?
a) Using sequential access
b) Using linked lists or indexed allocation
c) Using direct memory allocation
d) Using hashing only
18) What is the purpose of a directory in a file system?
a) To store data records
b) To store metadata about files
c) To increase memory
d) To delete files automatically
19) Which external sorting technique is based on the Fibonacci sequence?
a) Quick Sort
b) Two-way Merge Sort
c) Polyphase Merge Sort
d) Radix Sort
20) In a two-way merge sort, how many sorted sublists are merged at a time?
a) 1
b) 2
c) 3
d) 4
