Class Test Memo

Date: 28th August 2017 Session: 19:00

Subject: Operating Systems IV Code: BSL42AB

Stationery:
1 A calculator may be used

1st Examiner: Mr. G. M. Muriithi

Moderator Dr G Mwansa

INSTRUCTIONAL PROGRAMME: CODE:

BTECH.: INFORMATION TECHNOLOGY BCNDIA

INSTRUCTIONS:

 ANSWER ALL QUESTIONS

Duration of paper: 60 Minutes Maximum marks: 50

Page 1 of 5
SECTION A: TRUE / FALSE QUESTIONS

1. The operating system manages each and every piece of hardware and software. T
2. The Device Manager is responsible for connecting with every device that’s available on the system and for
choosing the most efficient way to allocate them. T
3. The Memory Manager is in charge of main memory, widely known as ROM. F
4. The Memory Manager, the Interface Manager, the User Manager, and the File Manager are the four
essential managers of every major operating system. F
5. The content of a random access memory (RAM) chip is nonvolatile, meaning that it is not erased when the
power is turned off. F
6. There are two primary types of user interfaces: the graphical user interface and the command line interface
T
7. A single-user system supports multiprogramming. F
8. Single-user contiguous allocation schemes have the problem of partition intrusion. F
9. The fixed partition scheme does not require that the entire program be stored contiguously and in memory
from the beginning to the end of its execution.F
10. In the relocatable dynamic partitions scheme, the Memory Manager relocates programs to gather together
all of the empty blocks and compact them to make one block of memory large enough to accommodate
some or all of the jobs waiting to get in.T

SECTION B: MULTIPLE CHOICE QUESTIONS (10)

1. Fixed partitions are also called ____ partitions.

a. static
b. direct
c. sized
d. complete
2. The release of memory space by the Memory Manager is called ____.
a. free memory
b. fragmentation
c. deallocation
d. relocation
3. ____ of memory is performed by the operating system to reclaim fragmented sections of the memory
space.
a. Deallocation
b. Redirection
c. Compaction
d. Reallocation

Page 2 of 5
4. In a relocatable dynamic partition scheme, the ____ ensures that, during execution, a program won’t try to
access memory locations that don’t belong to it.
a. relocation register
b. compaction register
c. bounds register
d. load register

5. ____ consists of fragments of free memory between blocks of allocated memory.

a. Indirect partitioning
b. External fragmentation
c. Internal fragmentation
d. An inefficient fit
6. In a paged memory allocation scheme, a simple ____ has one entry for each page frame that shows its
location and its free/busy status.
a. Job Table
b. Memory Management Table
c. Page Access Table
d. Memory Map Table
7. In a paged memory allocation scheme, a page size that is too small will generate ____.
a. excessive internal fragmentation
b. excessive external fragmentation
c. excessive page faults
d. very long Page Map Tables
8. ____ can be thought of as being an intermediary between main memory and the special-purpose
registers, which are the domain of the CPU.
a. Virtual memory
b. Paging
c. Cache memory
d. Segmenting
9. Early memory management techniques such as fixed partition and dynamic partition schemes share the
requirement that the entire program being executed must be ____.
a. stored on disk
b. relocatable
c. loaded into memory
d. written in a single language

10. The primary advantage of storing programs in noncontiguous locations is that ____.
a. every program will be able to run
b. multiple programs can run at the same time
c. main memory is used more efficiently
d. secondary storage is accessed more quickly

Page 3 of 5
SECTION C: Short Answer Questions (30)

1. Given the following configuration with jobs arriving the order A, B, C and D and with blocks shown in order
from low-order memory to high-order memory:

Job List Memory Block List

Job Number Memory Requested Memory Block Memory Block Size
Job A 256K Block1 910K
Job B 900K Block2 900K
Job C 50K Block3 200K
Job D 350K Block4 300K

(a) Use the best-fit algorithm to indicate which memory blocks are allocated to each of the arriving jobs (4)
Job Allocated to Block Internal Fragmentation COMMENTS
JOB A BLOCK 4 300 – 256 = 44
JOB B BLOCK 2 900 – 900 = 0
JOB C BLOCK 3 200 – 50 = 150
JOB D BLOCK 1 910 – 350 = 560
TOTAL = 754

(b) Use the first-fit algorithm to indicate which memory blocks are allocated to each of the arriving jobs (4)
Job Allocated to Block Internal Fragmentation COMMENTS
JOB A BLOCK 1 910 – 256 = 654
JOB B BLOCK 2 900 – 900 = 0
JOB C BLOCK 3 200 – 50 = 150
JOB D No block big enough 0 Job D waits
TOTAL = 804

(c) Calculate the total amount of internal fragmentation in all four blocks using the best-fit algorithm. (4)
See (a) above
(d) Calculate the total amount of internal fragmentation in all four block using the first-fit algorithm (4)
See (b) above

2. Consider a job of 715 bytes that arrives for processing using a page size of 126 bytes. How many bytes
would be loaded onto the last page of this job and what would the number of that page be? (2)
Page 4 of 5
 No of Pages = Job Size / Page Size = 715/126 = 5 remainder 85
Therefore Job needs 6 pages (5 full pages, last page holds 85 bytes).
Pages named from 0, last page = 5

3. Given that main memory is composed of only THREE page frames for public use (F1, F2 and F3), and that a
SEVEN page program (with pages a, b, c, d, e, f, g) requests pages in the following order: a,b,c,b,d,a,e,f,b,e
answer the following questions
(a) Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the
available page frames (called a page trace analysis), indicating each page fault with an asterisk (*). (10)

Page Request Sequence

a b c b d a e f b e
F1 a a a a d d d f f f
F2 b b b b a a a b b
F3 c c c c e e e e
Page * * * * * * * *
Fault?

(b) Compute the failure ratio and success ratio. (2)

Failure Ratio = No.of Page Faults / Total Page Requests = 8/10 = 80%
Success Ratio = No.of Successful Page Requests / Total Page Requests = 2/10 = 20%

End of Test

Page 5 of 5