1. What is Inode ? Junior A. a technique combining multiple disks for higher performance, redundancy, or both B. servicing disk requests strictly in the order they arrive at the queue C. storing a file in a single run of consecutive disk blocks for fast sequential access D. a structure storing a file's metadata and pointers to its data blocks, but not its name
2. Which term means: "a structure storing a file's metadata and pointers to its data blocks, but not its name"? Junior A. File Allocation Table B. Inode C. Linked allocation D. Contiguous allocation
3. Which statement is correct? Junior A. Inode — servicing the request with the shortest seek distance from the current head position next B. Inode — the time taken to move the disk's read-write head to the target track C. Inode — a structure storing a file's metadata and pointers to its data blocks, but not its name D. Inode — moving the head in one direction servicing requests, then reversing like an elevator
4. What is File Allocation Table ? Junior A. a table-based filesystem structure linking the blocks of each file as a chain of entries B. a structure storing a file's metadata and pointers to its data blocks, but not its name C. logging intended filesystem changes before applying them so recovery after a crash is fast D. servicing the request with the shortest seek distance from the current head position next
5. Which term means: "a table-based filesystem structure linking the blocks of each file as a chain of entries"? Junior A. File Allocation Table B. SCAN disk scheduling C. SSTF disk scheduling D. Contiguous allocation
6. Which statement is correct? Junior A. File Allocation Table — moving the head in one direction servicing requests, then reversing like an elevator B. File Allocation Table — logging intended filesystem changes before applying them so recovery after a crash is fast C. File Allocation Table — a table-based filesystem structure linking the blocks of each file as a chain of entries D. File Allocation Table — a technique combining multiple disks for higher performance, redundancy, or both
7. What is Contiguous allocation ? Mid A. storing a file in a single run of consecutive disk blocks for fast sequential access B. the time taken to move the disk's read-write head to the target track C. storing a file as scattered blocks each pointing to the next, avoiding external fragmentation D. storing a file's block pointers in a dedicated index block for direct random access
8. Which term means: "storing a file in a single run of consecutive disk blocks for fast sequential access"? Mid A. Journaling B. File Allocation Table C. Contiguous allocation D. RAID
9. Which statement is correct? Mid A. Contiguous allocation — servicing disk requests strictly in the order they arrive at the queue B. Contiguous allocation — a table-based filesystem structure linking the blocks of each file as a chain of entries C. Contiguous allocation — storing a file in a single run of consecutive disk blocks for fast sequential access D. Contiguous allocation — the time taken to move the disk's read-write head to the target track
10. What is Linked allocation ? Mid A. moving the head in one direction servicing requests, then reversing like an elevator B. servicing disk requests strictly in the order they arrive at the queue C. servicing the request with the shortest seek distance from the current head position next D. storing a file as scattered blocks each pointing to the next, avoiding external fragmentation
11. Which term means: "storing a file as scattered blocks each pointing to the next, avoiding external fragmentation"? Mid A. FCFS disk scheduling B. Linked allocation C. C-SCAN disk scheduling D. LOOK disk scheduling
12. Which statement is correct? Mid A. Linked allocation — storing a file in a single run of consecutive disk blocks for fast sequential access B. Linked allocation — moving the head one way servicing requests, then jumping back to the start without servicing on return C. Linked allocation — storing a file as scattered blocks each pointing to the next, avoiding external fragmentation D. Linked allocation — storing a file's block pointers in a dedicated index block for direct random access
13. What is Indexed allocation ? Mid A. storing a file in a single run of consecutive disk blocks for fast sequential access B. servicing disk requests strictly in the order they arrive at the queue C. storing a file as scattered blocks each pointing to the next, avoiding external fragmentation D. storing a file's block pointers in a dedicated index block for direct random access
14. Which term means: "storing a file's block pointers in a dedicated index block for direct random access"? Mid A. SCAN disk scheduling B. File Allocation Table C. Indexed allocation D. LOOK disk scheduling
15. Which statement is correct? Mid A. Indexed allocation — a table-based filesystem structure linking the blocks of each file as a chain of entries B. Indexed allocation — a SCAN variant that reverses at the last request rather than going to the disk's physical end C. Indexed allocation — servicing the request with the shortest seek distance from the current head position next D. Indexed allocation — storing a file's block pointers in a dedicated index block for direct random access
16. What is FCFS disk scheduling ? Junior A. a structure storing a file's metadata and pointers to its data blocks, but not its name B. storing a file as scattered blocks each pointing to the next, avoiding external fragmentation C. storing a file in a single run of consecutive disk blocks for fast sequential access D. servicing disk requests strictly in the order they arrive at the queue
17. Which term means: "servicing disk requests strictly in the order they arrive at the queue"? Junior A. Inode B. File Allocation Table C. C-SCAN disk scheduling D. FCFS disk scheduling
18. Which statement is correct? Junior A. FCFS disk scheduling — a structure storing a file's metadata and pointers to its data blocks, but not its name B. FCFS disk scheduling — servicing disk requests strictly in the order they arrive at the queue C. FCFS disk scheduling — a table-based filesystem structure linking the blocks of each file as a chain of entries D. FCFS disk scheduling — logging intended filesystem changes before applying them so recovery after a crash is fast
19. What is SSTF disk scheduling ? Mid A. servicing the request with the shortest seek distance from the current head position next B. storing a file as scattered blocks each pointing to the next, avoiding external fragmentation C. the time taken to move the disk's read-write head to the target track D. storing a file in a single run of consecutive disk blocks for fast sequential access
20. Which term means: "servicing the request with the shortest seek distance from the current head position next"? Mid A. RAID B. SSTF disk scheduling C. C-SCAN disk scheduling D. File Allocation Table
21. Which statement is correct? Mid A. SSTF disk scheduling — servicing the request with the shortest seek distance from the current head position next B. SSTF disk scheduling — the time taken to move the disk's read-write head to the target track C. SSTF disk scheduling — storing a file in a single run of consecutive disk blocks for fast sequential access D. SSTF disk scheduling — storing a file as scattered blocks each pointing to the next, avoiding external fragmentation
22. What is SCAN disk scheduling ? Mid A. a structure storing a file's metadata and pointers to its data blocks, but not its name B. moving the head in one direction servicing requests, then reversing like an elevator C. storing a file's block pointers in a dedicated index block for direct random access D. a technique combining multiple disks for higher performance, redundancy, or both
23. Which term means: "moving the head in one direction servicing requests, then reversing like an elevator"? Mid A. Contiguous allocation B. SCAN disk scheduling C. Seek time D. Journaling
24. Which statement is correct? Mid A. SCAN disk scheduling — a SCAN variant that reverses at the last request rather than going to the disk's physical end B. SCAN disk scheduling — moving the head in one direction servicing requests, then reversing like an elevator C. SCAN disk scheduling — storing a file in a single run of consecutive disk blocks for fast sequential access D. SCAN disk scheduling — a technique combining multiple disks for higher performance, redundancy, or both
25. What is C-SCAN disk scheduling ? Mid A. moving the head one way servicing requests, then jumping back to the start without servicing on return B. logging intended filesystem changes before applying them so recovery after a crash is fast C. storing a file's block pointers in a dedicated index block for direct random access D. storing a file as scattered blocks each pointing to the next, avoiding external fragmentation
26. Which term means: "moving the head one way servicing requests, then jumping back to the start without servicing on return"? Mid A. Seek time B. C-SCAN disk scheduling C. Indexed allocation D. Linked allocation
27. Which statement is correct? Mid A. C-SCAN disk scheduling — moving the head one way servicing requests, then jumping back to the start without servicing on return B. C-SCAN disk scheduling — the time taken to move the disk's read-write head to the target track C. C-SCAN disk scheduling — a structure storing a file's metadata and pointers to its data blocks, but not its name D. C-SCAN disk scheduling — storing a file in a single run of consecutive disk blocks for fast sequential access
28. What is LOOK disk scheduling ? Mid A. moving the head in one direction servicing requests, then reversing like an elevator B. storing a file's block pointers in a dedicated index block for direct random access C. a SCAN variant that reverses at the last request rather than going to the disk's physical end D. moving the head one way servicing requests, then jumping back to the start without servicing on return
29. Which term means: "a SCAN variant that reverses at the last request rather than going to the disk's physical end"? Mid A. Indexed allocation B. LOOK disk scheduling C. Inode D. SSTF disk scheduling
30. Which statement is correct? Mid A. LOOK disk scheduling — a technique combining multiple disks for higher performance, redundancy, or both B. LOOK disk scheduling — servicing disk requests strictly in the order they arrive at the queue C. LOOK disk scheduling — storing a file as scattered blocks each pointing to the next, avoiding external fragmentation D. LOOK disk scheduling — a SCAN variant that reverses at the last request rather than going to the disk's physical end Showing 30 of 39 OS · File Systems & Disk questions — the full set, with answers, explanations and an AI tutor on every question, is inside.