Evaluation/Assessments/Student’s Activities/Worksheets

Project Preliminaries Module Week 2-A

WORKSHEET ACTIVITY/IES:

Student’s Name: Jayvee Bugay Score:

Year and Section: BSIT-2A Date:

Answer the following questions on the spaces provided.

1. Given the following information:

a. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the
three arriving jobs.

 Job B is allocated to Block 2, Job A is allocated to Block 1, Job C is waiting because

it’s too large.

b. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the
three arriving jobs.

 Job A is allocated to Block 1, Job C is allocated to Block 2, Job B is allocated to

Block 3
2. Given the following information:

a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of
the three arriving jobs.

 Job C is allocated to Block 4, Job A is allocated to Block 3, Job D is allocated to

Block 1, Job B is allocated to waiting because its too large.

b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of
the three arriving jobs.

 Job A is allocated to Block 1, Job C is allocated to Block 2, Job D is allocated to

waiting. Job B to move into memory because no partition is large enough for it.
Enumeration:

1. Provide the four (4) memory allocation scheme of RAM

a. Single User
b. Fixed Partition
c. Dynamic Partition
d. Relocatable Dynamic Partition

2. Provide the three (3) deallocation alternative situations

e. Joining Two Free Blocks
f. Joining Three Free Blocks
g. Deallocating an Isolated Block

Project Preliminaries Module Week 2-B

WORKSHEET ACTIVITY/IES:

Student’s Name: Jayvee Bugay Score:

Year and Section: BSIT-2A Date:

Answer the following question on the spaces provided.

Given the memory configuration information below, answer the following question.
At this point, Job 4 arrives requesting a block of 100K.
Can Job 4 be accommodated? Why or why not?
No, Job 4 has to wait because the requested memory is too large.

Identification:

Single-User Contiguous Scheme 1. It can only support one job at a time. There is no way to
share the primary memory.
Fixed Partitions 2. Within the main memory, often known as static partitions—each partition
may even be assigned to one job.
Dynamic Partitions 3. When an operation is loaded for processing, memory is assigned to it
in one contiguous block, and each job is given only as much memory as it requests.
Best-Fit Allocation 4. The free/busy lists are organized by size, from smallest to largest,
using this procedure.

First-Fit Allocation 5. The free/busy lists are grouped by memory locations, from low-order
to high-order memory, using this technique. It is known as the release of memory space.
Memory Manager 6. Controlling the amount of memory is the duty of the operating system's
memory management system. It verifies the legality of each request for memory space and,
if it's valid, allocates the amount required to complete the task.

Main Memory 7. return the memory that was assigned to the accessible RAM store.

Samuel Johnson 8. He said that “Memory is the primary and fundamental power, without
which there could be no other intellectual operation.”
Allocation and Deallocation 9. What is OS module 2-3 topic?
Processor Manager 10. the memory unit that makes contact with the CPU and where data
and instructions must be stored in order to be processed Internal memory is sometimes
known as primary storage, RAM, or internal memory.