Scribd
Upload
15 views6 pages

Mar2024 Quiz Q

This document is a quiz paper for the course 'Principles of Operating Systems' at Universiti Teknologi Mara, scheduled for March 2024. It contains four questions covering topics such as resource allocation graphs, dynamic storage allocation techniques, I/O subsystem management, and file system operations. The quiz is designed to assess students' understanding of key concepts in operating systems and consists of a total of 35 marks.

Uploaded by

2023674672
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views6 pages

Mar2024 Quiz Q

This document is a quiz paper for the course 'Principles of Operating Systems' at Universiti Teknologi Mara, scheduled for March 2024. It contains four questions covering topics such as resource allocation graphs, dynamic storage allocation techniques, I/O subsystem management, and file system operations. The quiz is designed to assess students' understanding of key concepts in operating systems and consists of a total of 35 marks.

Uploaded by

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

UNIVERSITI TEKNOLOGI MARA

QUIZ

COURSE : PRINCIPLES OF OPERATING SYSTEMS


COURSE CODE : CSC520
TIME : 1.5 HOURS
SEMESTER : MARCH 2024

INSTRUCTIONS TO CANDIDATES:

1. This question paper consists of FOUR (4) questions.


2. Answer ALL questions. Write your answers in this paper.

STUDENT DETAILS:

MATRIC NO GROUP
FULL NAME

LECTURER

MARKS
TOTAL / 35

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO


This examination paper consists of 6 printed pages
2

QUESTION 1 (8 MARKS)

a) State the TWO (2) edges to show directions in the resource-allocation graph.

(2 marks)

ANSWER:

b) Consider the following system snapshot using data structures in the Banker’s algorithm,
with resources of A, B, C and D and processes P1 to P3. With the given Available
resources are <1, 1, 2, 1>.
PROCESS/ MAX ALLOCATION
RESOURCES
A B C D A B C D
P1 2 0 1 0 1 0 0 0
P2 2 1 1 2 1 0 0 1
P3 1 0 0 0 0 0 0 0

i) Show the content of Need matrix.


(2 marks)

ANSWER:

ii) Show whether the system above is in a safe or unsafe state. Provide the safe sequence
if any.

(4 marks)

ANSWER:
3

QUESTION 2 (12 MARKS)

a) Define logical address and physical address.


(2 marks)

ANSWER:

b) List THREE (3) techniques in dynamic storage allocation.


(3 marks)
ANSWER :

c) The definition of “shuffle memory contents to place all free memory together in one large
block” is best describe the technique of __________.
(1 mark)
ANSWER:

d) List any TWO (2) of the policies in defining a paging algorithm.


(2 marks)
ANSWER:

e) Consider the following page reference string as stated below:

1 2 3 3 4 5 6 2 3

Using the Least Recently Used (LRU) algorithm, trace the number of page faults if the
allocated memory is 3 frames. Show your work.
(4 marks)
4

ANSWER:

QUESTION 3 (7 MARKS)

a) Each operating system has its own I/O subsystem to manage the device operations. Briefly
explain one of the management tasks which executes in I/O subsystem.
(2 marks)
ANSWER:

b) Explain one example of event that triggering as an interrupt which happens to enable
utilization of resources in operating system.

(2 marks)

ANSWER:

c) The occurrence of Interrupt driven I/O might be categorized either maskable or


nonmaskable. Explain the maskable interrupt.
(3 marks)
ANSWER:
5

QUESTION 4 (8 MARKS)

a) Explain the purpose of a file identifier in a file system.


(1 mark)

ANSWER:

b) List TWO (2) operations that can be performed on a file in a file system.
(1 mark)
ANSWER:

c) Given list of bitmaps named Aurora :

Aurora = 0 0 0 1 1 0 1 0 1 1 1 1 0 0 1 1 0 0 0 1

i) Illustrate all the unallocated spaces based on the above bitmaps.


(2 marks)
ANSWER:
6

ii)
Consider a file named Neuron that was created using an Index allocation method
with the size of 5 blocks. Show the secondary storage with the occupied blocks.
(3 marks)
ANSWER:

iii) Count the available blocks after the Neuron file has been allocated. If a file named
Stardust requires 4 blocks using the contiguous method, can the available spaces
allocate it? Justify your answer.
(1 mark)
ANSWER:

END OF QUESTION PAPER

You might also like