UGRD-CS6206 Principles of Operating

Systems and Its Applications |

1 The operating system and the other processes are protected from being modified by an
already running process because ____________

a.
every address generated by the CPU is being checked against the relocation and limit

2 What is Waiting time?

b.
the total time in the blocked and waiting queues
3 In the following cases non – preemptive scheduling occurs?

d.
When a process goes from the running state to the waiting state
4 Using transient code, _______ the size of the operating system during program execution.

d.
changes

5 The page table registers should be built with _______

a.
very high-speed logic
6 What are the two steps of a process execution?

a.
CPU & I/O Burst
7 Physical memory is broken into fixed-sized blocks called ________

b.
Frames
8 What is Response time?

b.
the total time taken from submission time till the response is output
9 The FCFS algorithm is particularly troublesome for ____________

c.
time sharing systems
10 The main memory accommodates ____________

b.
operating system
11 What is the operating system?

a.
either low or high memory (depending on the location of interrupt vector)
12 Operating System maintains the page table for ____________

b.
each process
13 The _____ table contains the base address of each page in physical memory.

d.
page
14 If the size of logical address space is 2 to the power of m, and a page size is 2 to the
power of n addressing units, then the high order _____ bits of a logical address designate the
page number, and the ____ low order bits designate the page offset.

d.
m – n, n
15 Preemptive Shortest Job First scheduling is sometimes called ____________
c.
SRTN scheduling – Shortest Remaining Time Next
16 What is Turnaround time?

a.
the total time from the completion till the submission of a process
17 With paging there is no ________ fragmentation

d.
external
18 With relocation and limit registers, each logical address must be _______ the limit register.

d.
less than
19 Which of the following scheduling algorithms gives minimum average waiting time?

b.
SJF
20 An I/O bound program will typically have ____________

a.
many very short CPU bursts
21 In contiguous memory allocation ____________

a.
each process is contained in a single contiguous section of memory
22 Smaller page tables are implemented as a set of _______

a.
registers
23 Paging increases the ______ time.

a.
context – switch
24 A solution to the problem of indefinite blockage of low – priority processes is ____________

d.
Aging
25 The __________ is used as an index into the page table.

a.
page number
26 Scheduling is done so as to ____________

c.
decrease the waiting time
27 Which one of the following can not be scheduled by the kernel?

b.
user level thread
28 An SJF algorithm is simply a priority algorithm where the priority is ____________

a.
the predicted next CPU burst
29 Transient operating system code is code that ____________

a.
comes and goes as needed
30 Scheduling is done so as to ____________

c.
increase the throughput
31 What is Dispatch latency?

d.
the time to stop one process and start running another one
32 Consider the following set of processes, the length of the CPU burst time given in
milliseconds.
Process Burst time
P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm.

b.
The waiting time for process P1 is 3ms
33 The relocation register helps in ____________

c.
to protect the address spaces of processes

34 An SJF algorithm is simply a priority algorithm where the priority is ____________

c.
it can lead to some low priority process waiting indefinitely for the CPU
35 With multiprogramming ______ is used productively.

c.
time
36 The switching of the CPU from one process or thread to another is called ____________

d.
all of the mentioned
37 When memory is divided into several fixed sized partitions, each partition may contain
________

d.
exactly one process
38 CPU fetches the instruction from memory according to the value of ____________

d.
program counter
39 A process is selected from the ______ queue by the ________ scheduler, to be executed.
b.
ready, short term
40 Which module gives control of the CPU to the process selected by the short-term
scheduler?

d.
dispatcher
41 The size of a page is typically ____________

c.
power of 2
42 Scheduling is done so as to ____________

a.
decrease the turnaround time
43 Logical memory is broken into blocks of the same size called _________

c.
Pages

44 Which is the most optimal scheduling algorithm?

b.
SJF – Shortest Job First
45 Scheduling is done so as to ____________

c.
increase CPU utilization
46 Every address generated by the CPU is divided into two parts. They are ____________

d.
page number & page offset
47 The real difficulty with SJF in short term scheduling is ____________

c.
knowing the length of the next CPU request
48 The operating system maintains a ______ table that keeps track of how many frames have
been allocated, how many are there, and how many are available.

c.
frame
49 An SJF algorithm is simply a priority algorithm where the priority is ____________

d.
the predicted next CPU burst
50 What is ‘Aging’?

b.
increasing the priority of jobs to ensure termination in a finite time