Home ► My courses ► Introduction to Operating Systems - 1100-IO0ENG (Wykład L-19/20) ►

Examination Test and Statement ► Examination Test

Started on Wednesday, 24 June 2020, 12:07 PM

State Finished
Completed on Wednesday, 24 June 2020, 12:50 PM
Time taken 43 mins 9 secs
Grade 30.00 out of 33.00 (91%)

Question 1 Priority inversion consists in

Complete
Select one:
Mark 1.00 out of 1.00
a higher priority process waiting for a resource held by a lower priority process.

a change of numerical process priority to its opposite.

a change of numerical process priority to its inverse.

round-robin reshuf ing of priorities of all processes.

exchange of priorities of two ready processes.

Question 2 Which of the following units is neccessary to the polling interaction scheme?
Complete
Select one:
Mark 1.00 out of 1.00
MMU

none mentioned

DMA

IC

clock

Question 3 In the CP/M lesystem all le's block numbers are stored in directory
Complete
Select one:
Mark 1.00 out of 1.00
True

False
Question 4 A thread is
Complete
Select one or more:
Mark 1.00 out of 1.00
section of memory allocated to a process

a group of related process

two processes: child process and parent process

section of a program executed concurrently with other threads

Question 5 Which of the following best describes multilevel paging?

Complete
Select one:
Mark 0.00 out of
a. Page table is divided into frames
1.00
b. Page table is divided into pages

c. Paging dependant on the level of protection ring

d. Paging dependent on the process priority

e. Paging on multiple levels of memory hierarchy

Question 6 There are three free memory regions:  3KB, 2KB i 6KB. What is the size of the
Complete largest free memory region after 1KB is allocated with the best t strategy?

Mark 1.00 out of 1.00

Select one:
2 KB

4 KB

6 KB

8 KB

7 KB

1 KB

5 KB

3 KB
Question 7 A proces is in the ready state when
Complete
Select one or more:
Mark 1.00 out of 1.00
it is ready to be executed

it has nished

it is ready to read a line from the termial

Question 8 Which function is used in POSIX systems to create a process?

Complete
Select one:
Mark 1.00 out of 1.00
eat()

pizza()

knife()

fork()

spoon()

spawn()

start_process()

CreateProcess()

exec()

Question 9 What classes of I/O devices a hard disk belongs to?

Complete
Select one or more:
Mark 1.00 out of 1.00
block device

character device

shared

sequential access

exclusive

random access
Question 10 Removing a removable disk without the prior use of "Safely remove hardware"
Complete
icon in Windows can result in

Mark 1.00 out of 1.00

Select one or more:
disk cache not being written to disk

computer being burned

USB controller being burned alone

disk being burned

electric shock injuring the user

lesystem inconsistency

disk cache being overwritten

Question 11 IIn von Neumann architecture data and program code are stored in operating
Complete
memory; only the order of instructions to execute is implied by the hardware
control circuit.
Mark 1.00 out of 1.00

Select one:
True

False

Question 12 When the interupt driven interaction of the central unit with an I/O device is
Complete more ef cient than polling?

Mark 1.00 out of 1.00

Select one:
when CPU load is moderate

always

when concurrent task processing is available

when the I/O device is very fast

Question 13 In the dynamic partitioning
Complete
Select one:
Mark 1.00 out of 1.00
a. partition size is decided when the system is designed.

b. the partition size is the amount of memory requested by a process.

c. the partition size is decided when the system is con gured.

d. partition size is dependant on the amount of physical memory.

e. partition size may change after allocation, depending on the number of processes in
the system.

Question 14 How many directory entries are used for one le in CP/M lesystem?
Complete
Select one:
Mark 1.00 out of 1.00
0 or 1

1 or more depending on le size

1 or more depending on le size and number of le attributes

0 or more depending on le size

0 or more depending on le size and number of le attributes

exactly 1

Question 15 There are three free memory regions:  3KB, 2KB i 6KB. What is the size of the
Complete
largest free memory region after 1KB is allocated with the worst t strategy?

Mark 1.00 out of 1.00

Select one:
a. 7 KB

b. 3 KB

c. 6 KB

d. 1 KB

e. 8 KB

f. 5 KB

g. 2 KB

h. 4 KB
Question 16 In a le system with contiguous allocation, in a 20 block partition, there are 2
Complete
les. One starts with block 5 and occupies 4 blocks. The other one starts at block
13 and is 6 blocks long. What is the maximal size of a le which can be stored in
Mark 1.00 out of 1.00 the lesystem without doing any reallocation?

Answer: 5

Question 17 Virtual I/O is a concept used to

Complete
Select one:
Mark 1.00 out of 1.00
to make use of virtual memory in interrupt handling for I/O devices

to make use of disk space in implementation of virtual memory

in software emulation of physically unavailable I/O devices

to facilitate use of some speci c I/O devices (eg. disk, network interface)

Question 18 Every second consecutive processes P1, P2, P3 are admitted to the system. Their
Complete
running times are 3, 2, 1 sec. respectively. Which of the processes nishes last if
the SJF scheduling is used?
Mark 1.00 out of 1.00

Select one:
P1

Processes nish at the same time.

P2

P3

Question 19 In a virtual memory system, the following sequence of memory references occurs
Complete 1, 2, 1, 3, 4, 2, 4, 3. How many page faults will be raised, if the WS algorithm is
used with window length 3? Frames are initially empty.
Mark 1.00 out of 1.00

Answer: 6
Question 20 Which are true?
Complete
Select one or more:
Mark 0.00 out of
a. Deadlocks can be avoided by using the orderly allocation of resources
1.00
b. Deadlocks can be avoided by the use of semaphores

c. Deadlocks can be obtained by the use of semaphores

Question 21 Which of the following le attributes stored in the directory (NTFS)?

Complete
Select one or more:
Mark 1.00 out of 1.00
a. le access timestamp

b. name

c. internal le identi er (reference)

d. last modi cation timestamp

e. le owner identi er

f. size

g. le access permissions

Question 22 Replacing on demand means that page is replaced when there are no free frames
Complete
left.

Mark 0.00 out of

Select one:
1.00
True

False

Question 23 An interactive system should

Complete
Select one:
Mark 1.00 out of 1.00
discriminate against I/O bound processes.

discriminate in favour I/O bound processes.

Question 24 How many disk blocks are used to store a 512KB le, when indexed allocation is
Complete
used, block size is 512B, block numbers are 32-bit, and index blocks are organised
in a linked list?
Mark 1.00 out of 1.00

Answer: 1033

Question 25 The ISO9660 lesystem uses

Complete
Select one or more:
Mark 1.00 out of 1.00
a. chained, linked in a spiral.

b. intermittent allocation.

c. contiguous allocation.

d. indexed allocation.

Question 26 In a virtual memory system, the following sequence of memory references occurs:
Complete
3, 2, 7, 4, 5, 1, 3, 6, 1, 2, 4 and no page has been yet swapped out. What page will
be replaced if no free frames are left and the next page addressed is 8 and the
Mark 1.00 out of 1.00 FIFO algorithm is used?

Answer: 3

Question 27 Contiguous allocation is a goog idea in the case of

Complete
Select one or more:
Mark 1.00 out of 1.00
read-only media

read-only, removable media exclusively

write once media

removable media in general

internal persistent memory in general

Question 28 The history of references is 1, 3, 2, 4,
Complete
5. 3. 2. 2, 3, 4, with the last one being the recent, and no page yet has been
swapped out. Which pages are members of the current working set, if the
Mark 1.00 out of 1.00 window size is 5?

Select one or more:

3

Question 29 A single-tasking OS is an OS which

Complete
Select one or more:
Mark 1.00 out of 1.00
does not offer inter-process communication

is such that at each moment at most one task is present

is such that at each moment only one task is allowed per user

is such that at each moment only single task can be executed by the CPU so that the
mechanism of a context switch is necessary

is designed for a single purpose

Question 30 The SJF scheduling algorithm is used. Every consecutive second the processes P1,
Complete
P2, P3, P4 are admitted, with respective running times of 5, 3, 6 and 2 seconds. In
what order they nish processing?
Mark 1.00 out of 1.00

Second P4

Last P3

First P1

Third P2
Question 31 System clock interrupts are
Complete
Select one or more:
Mark 1.00 out of 1.00
software interrupts

time zone dependant interrupts

none of the others

diagnostic interrupts

external interrupts

Question 32 The CPU resource that is allocated to process is

Complete
Select one or more:
Mark 1.00 out of 1.00
communication bus

register

interrupt

cache

time

Question 33 Processes in the ready queue wait for

Complete
Select one:
Mark 1.00 out of 1.00
a. forwarding the results of processing to the user

b. CPU allocation

c. removing from the system

d. saving results of processing to disk