Which file allocation method stores blocks of a file in an ordered sequence linked together via pointers, eliminating external fragmentation but making random access slow? MCQ with Answer and Explanation

Which file allocation method stores blocks of a file in an ordered sequence linked together via pointers, eliminating external fragmentation but making random access slow?
A. Direct Directory Mapping
B. Linked Allocation
C. Contiguous Allocation
D. Indexed Allocation
Answer: Option B
Solution (By JKSSB Mock Tests)
Linked allocation chains blocks together using pointers, allowing dynamic size expansions but requiring linear scanning to read a specific internal offset.

Discuss this Question (0)

No comments yet. Be the first to start the discussion!

Practice More Operating Systems Questions

Question #1
Android is primarily based on which operating system kernel?
A. Unix Kernel
B. Hybrid Kernel
C. Linux Kernel
D. Windows NT Kernel

Correct Answer: Option C


Explanation:
Android is an open-source operating system designed for mobile devices, built directly on top of a modified version of the Linux kernel.

This question belongs to: Computer Operating Systems
Question #2
Which of the following is a type of process scheduling algorithm that uses multiple queues with different priorities?
A. First-Come, First-Served
B. Priority Scheduling
C. Round Robin
D. Multilevel Queue Scheduling

Correct Answer: Option D


Explanation:
Multilevel queue partitions processes into separate queues based on priority, with scheduling policies for each queue.

This question belongs to: Computer Operating Systems
Question #3
What is the purpose of the 'Aging' technique in process scheduling algorithms?
A. To periodically clear out system logs.
B. To gradually increase the priority of processes that wait in the system for a long time, preventing starvation.
C. To decrease CPU power consumption over time.
D. To automatically back up older files.

Correct Answer: Option B


Explanation:
Aging is a technique used to avoid resource starvation by gradually increasing the priority of tasks that have spent extended periods waiting in the ready queue.

This question belongs to: Computer Operating Systems