Computer Science · Memory Management Strategies
Match the memory allocation strategies in LIST-I with their defining behavioral characteristics in LIST-II: LIST-I (Strategy) A. First Fit B. Best Fit C. Worst Fit D. Next Fit LIST-II (Behavior) I. Commences the search for a suitable hole from the point of the last allocation. II. Fastest allocation method that selects the first available hole large enough for the process. III. Selects the smallest hole that meets the size requirement, leaving the smallest leftover fragment. IV. Allocates the largest available hole, which results in the largest leftover fragment. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-I, B-II, C-III, D-IV
- 2A-II, B-IV, C-III, D-I
- 3A-III, B-I, C-IV, D-II
- 4A-II, B-III, C-IV, D-I✓
Correct answer
A-II, B-III, C-IV, D-I
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Memory Management Strategies MCQs →Want more practice questions on Memory Management Strategies?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Memory Management Strategies