Describe the following allocation algorithms:

a. First fit

b. Best fit

c. Worst fit

 

a. First-fit: search the list of available memory and allocate the first block that is big enough.

b. Best-fit: search the whole list of available memory and allocate the smallest block that is big enough.

c. Worst-fit: search the whole list of available memory and allocate the largest block.

 

Posted Date: 6/6/2013 6:24:13 AM | Location : United States

Ask an Expert

Related Discussions:- Explain first fit allocation algorithm, Assignment Help, Ask Question on Explain first fit allocation algorithm, Get Answer, Expert's Help, Explain first fit allocation algorithm Discussions

Write discussion on Explain first fit allocation algorithm
Your posts are moderated

Write your message here..

Related Questions

Explain advantages and inconveniences of ult, ADVANTAGES AND INCONVENIENCES... ADVANTAGES AND INCONVENIENCES OF ULT Advantages: Thread switching doesn't involve the kernel - no mode switching Scheduling is able to be application specific -

What advantages are there to this two-level directory, What advantages are ... What advantages are there to this two-level directory? Users are isolated from each other. Users have more freedom in choosing file names.

Describe swapping technique in unix systems, Describe swapping technique in... Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe

Name two differences between logical and physical addresses, Q. Name two di... Q. Name two differences between logical and physical addresses? Answer: A logical address doesn't refer to an actual existing address rather it refers to an abstract address in

Briefly discuss on bankers algorithm, Briefly discuss on Bankers algorithm?... Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples  for each resource type.

Explain working of the logical file system, Explain working of the logical ... Explain working of the logical file system The logical file system manages metadata information. Metadata contains all of the file-system structure, excluding actual data. It h

What are the two types of fragmentations, Questiion 1 Use Priority Sche... Questiion 1 Use Priority Scheduling Algorithm to schedule the following processes        Process                 Burst Time             Priority/Time            P1

Is disk scheduling except fcfs scheduling, Q. Is disk scheduling except FC... Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.

Operating systems, Ask using a laballed diagram explaining the architecture... Ask using a laballed diagram explaining the architecture of windows operating ststem

Threads, bootstrap bootstrap