Republic of the Philippines

PHILIPPINE STATE COLLEGE OF AERONAUTICS

Institute of Computer Studies
Piccio Garden, Villamor, Pasay City

STUDENT NAME: PASCUA, AVELINO III R. SECTION: BSAIT 3-1

WRITTEN WORK MD-6.1.1

WRITTEN WORK TITLE: MEMORY MANAGEMENT

WRITTEN TASK OBJECTIVE: The learners shall demonstrate the proper computation of
algorithms using different allocation processes.
MATERIALS: •
Pen and Paper

TOOLS & EQUIPMENT:

• None

ESTIMATED COST: None

Question: Given a job stream and a user memory partitioned as follows:

JOB AT
1 0
2 2
3 3
4 4
BT Priority
4 1
8 2
8 2
2 1

• Solve the following Process using First Fit

• Solve the following Process using Best Fit
• Solve the following Process using Worst Fit
• Solve the following Process using Next Fit
• Identify the sequence of process
• Define the proper use each allocation
• Solve the given problem using FCFS
• Find the final average of TAT and WT

PRECAUTIONS:
• None
ASSESSMENT METHOD: WRITTEN WORK CRITERIA CHECKLIST

SUBJECT TEACHER: APPROVED FOR IMPLEMENTATION:

Module
MIDTERM WEEK 7
6 MR. ALVIN JOHN M. PAZ Subject DR. ALAN LINO SELVERIO AGUSTIN
Teacher Dean, Institute of Computer Studies
 Republic of the Philippines
PHILIPPINE STATE COLLEGE OF AERONAUTICS
Institute of Computer Studies
Piccio Garden, Villamor, Pasay City

ANSWERSHEET
WRITTEN OUTPUT CRITERIA CHECK LIST MD-6.1.1
PROCESS AT BT Priority CT TAT CT
1 0 4 1 4 4 0
2 2 8 2 12 10 2
3 3 8 2 20 17 9
4 4 2 1 22 18 16
TOTAL: 49/4 27/4

ATAT: 12.25 ms
AWT: 6.75 ms

P1 P2 P3 P4

0 4 12 20 24

“FIRST FIT” 22BT “BEST FIT” 22BT

4 P1
IF = 0
EF = 0 8 P2
8 P3
2 P4
4 P1
IF = 0
EF = 0 8 P2
8 P3
2 P4

“WORST FIT” 22BT “NEXT FIT” 22BT

4 P4 4 P1
WAITING = P3 IF = 0
8 P1 EF = 0 8 P2
IF = 6
EF = 2 8 P2 8 P3
2 2 P4

SUBJECT TEACHER: APPROVED FOR IMPLEMENTATION:

Module
MIDTERM WEEK 7
6 MR. ALVIN JOHN M. PAZ Subject DR. ALAN LINO SELVERIO AGUSTIN
Teacher Dean, Institute of Computer Studies