Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING

It should be clear that your assignment would not get any credit if:

• The assignment is submitted after the due date.
• The submitted assignment does not open, or the file is corrupted.
• Strict action will be taken if the submitted solution is copied from any other student or the internet.

You should consult the recommended books to clarify your concepts, as handouts are insufficient.

ASSIGNMENT SUBMISSION

You are supposed to submit your assignment in Doc or Docx format only.

Any other formats, such as scanned images, PDF, zip, rar, ppt, and BMP, will not be accepted.

You are required to send the Screenshot and C code of Question No. 1 in the same Word file.

ASSIGNMENT NO. 1 COVERS LECTURE # 23-35

OBJECTIVE

The objective of this assignment is to:

·         Understanding First-Fit, Best-Fit and Worst Fit algorithms

·         Understand and analyze different memory allocation strategies used in operating systems — viz, First-Fit, Best-Fit, and Worst-Fit algorithms.

·         Simulate how each strategy allocates memory to a series of incoming processes and to compare their efficiency in terms of memory utilization and process accommodation.

·         Understand paging system.

NOTE

No assignment will be accepted after the due date via email in any case (whether it is due to load shedding or internet malfunctioning, etc.). Hence, refrain from uploading assignments within the last hour of the deadline. It is recommended that the solution file be uploaded at least two days before its closing date.

Please consult your instructor before the deadline if you find any mistake or confusion in the assignment (Question statement). After the deadline, no queries will be entertained in this regard.

For any query, feel free to email me at:

Cs604@vu.edu.pk