PDF.
The submission deadline is at 2359, Sunday Nov 15.
Please note that this is an early draft of the problem
(so that students can start working early) and may have typos
or mistakes. If you find any possible mistakes in the exercise
problem, please report to the instructor by email.
Exercise 6 (Nov 18)
PDF. (submission deadline: at 1210).
ex6in2 in the course directory is another sample input file
which can be used for testing your program before sumission.
The following students need to see the instructor during
the class today:
183, 184, 186 (the last 3-digits of their IDs).
Otherwise, you maybe considered to have withdrawn
from the course.
Homework
Homework 1
Homework 1 was an extra credit problem, in which students extend
their ex8.c (linked-list based memory allocation program) to
implement Best-Fit algorhtim, and the program runs with
options of -b (Best-Fit) and -f (First-Fit)
collect statistical information: the number of link traversals,
the size difference between the request and the hole used, and
the number of allocation requstes.
At the end of the program execution, the above statistical
information will be displayed in the total number and per allocation
request, so that we can compare how Best-Fit and First-Fit algorithms
behave for the same sequence of memory allocation/deallocation
requests.
Make few input files which shows that their program works
as they intended.
This homework gives students extra 3pts (on top of total 100% grade).
This homework was given on a volunteer base and it is already closed.
Submission Status and Grades
Please check the submission status and grade
of your exercises at
this page
(internal access only).
