0% found this document useful (0 votes)
5 views3 pages

Fall 2024_CS604P_2

This document outlines the guidelines for Assignment #02 in the Operating Systems (Practical) course, due on January 3, 2025, with a total of 20 marks. Students must submit their assignment in Doc or Docx format, implement the Banker's Algorithm for Deadlock Avoidance in C, and ensure their submission adheres to strict rules regarding plagiarism and late submissions. Additionally, the assignment includes a programming task to implement the LRU Page Replacement algorithm, requiring students to display their Student ID in the output.

Uploaded by

nadiasarfraz222
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views3 pages

Fall 2024_CS604P_2

This document outlines the guidelines for Assignment #02 in the Operating Systems (Practical) course, due on January 3, 2025, with a total of 20 marks. Students must submit their assignment in Doc or Docx format, implement the Banker's Algorithm for Deadlock Avoidance in C, and ensure their submission adheres to strict rules regarding plagiarism and late submissions. Additionally, the assignment includes a programming task to implement the LRU Page Replacement algorithm, requiring students to display their Student ID in the output.

Uploaded by

nadiasarfraz222
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Operating Systems (Practical) (CS604P) Total marks = 20

Assignment # 02 Deadline Date

Fall 2024 January 03, 2025

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.
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 Labs 9 to Labs 12

OBJECTIVE
The objective of this assignment is to provide hands-on experience in the:
 To implement the Banker's Algorithm for Deadlock Avoidance in C.
 Ensuring the system's safe state before granting resource allocation requests.

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:


[email protected]
Question 1: 20 Marks
Write a c program to implement LRU Page Replacement algorithm. If we consider the recent
past as a predictor of the near future, we will replace the page that has been unused for the
longest time. Pages that are rarely used are likely to remain infrequently accessed in the
future.
Also write and display your Student ID in the program at the end of the program output same
as shown in the figure.

Note: Every student must display his/her own student ID instead of the sample ID given in
the screenshot below.

Sample Input:
Enter Total number of frames: 4
Enter number of Pages: 8
Enter Reference string:
5
6
4
2
5
3

Output Sample:

You might also like