Which file allocation table structure uses an index block to store pointers to all distinct file data sectors, allowing efficient random access without fragmentation bottlenecks?
Explanation:
Indexed allocation consolidates all block pointers into a single dedicated index block, enabling direct access to any block without linear scanning.
Explanation:
Shortest Job First scheduling can starve longer processes if a continuous stream of shorter tasks keeps getting prioritized by the scheduler.
No comments yet. Be the first to start the discussion!