0

Hi ppl I would really appreciate if someone help me out here. I really tried to do this problem and its driving me crazy. All I could get is the algorithum of worst fit, best-fit next fit and first fit. PLease I willing to give away g-mail invite if you can help :) .... I will help ppl with anything I can in the future.


Thanks

The problem it to implement first fit, best fit next fit and worst fit
1. must input mem size and the number and sizes of all the partitions
all the partitions (limit the max num of the partitions to 5)
2. for each partition you should create a descriptor with at least the following info.
partition size;
partition num;
partition status (free/busy)
size of unused space("hole")
job name (ex: j01 or j15)

input the job list that includes
job name;
job size

2
Contributors
1
Reply
2
Views
12 Years
Discussion Span
Last Post by Narue
0

@Iamhere: Please don't start another thread asking the same question a mere day later. Doing so discourages volunteers from addressing your problem.

@Everyone else: Please direct any replies to the following thread: [thread=19839]Please can somebody help[/thread].

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.