wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Operating Systems

Total questions: 185

Worksheet time: 3hrs 49mins

Name
Class
Date
1.
Allocating time on the processor to individual processes is known as...
a)
CPU Scheduling
b)
CPU Timing
c)
CPU Clocking
d)
CPU Sorting
2.
A process is a...
a)
program in execution
b)
program on the hard drive
c)
high level program
d)
low level program 
3.
What are the two ways an OS can close a file?
a)
Normally or Abnormally
b)
Mouse Click or Automatic
c)
Simple or Complex
d)
Complete or Partial
4.
Which of the following is not a resource managed by the OS?
a)
Bandwidth
b)
Secondary Storage
c)
RAM
d)
Programs
5.
The OS provides a platform that enables what to be run?
a)
Applications
b)
Hardware
c)
Cache
d)
Processes
6.
A message sent by the OS to change the CPU schedule is known as...
a)
Interupt
b)
Poll
c)
Cache
d)
Defrag
7.

Which of these is not a function of an OS:

a)

Provide a user interface

b)

Communicate with hardware

c)

Allow the computer to multi-task

d)

Improves CPU performance

8.

What do device drivers do?

a)

Allows the OS to communicate with hardware

b)

Drives around the motherboard

c)

Increases the amount of storage

9.

Which of these is an advantage to using a command-line interface over a GUI?

a)

More interactive

b)

Easier to use

c)

Less resource heavy

10.

What type of operating system is Windows 10?

a)

Single-user OS

b)

Multi-user OS

11.
A(n) ______________________ is the most important software that runs on a computer.
a)
Operating System
b)
Windows
c)
Anti Virus
d)
iOS
12.
Which of the following is the most recent version of Windows?
a)
Windows 8
b)
Windows 7
c)
Windows 10
13.
What is the purpose of an operating system?
a)
Manage software on computer
b)
Manage hardware on computer
c)
Manage all hardware & software on computer
14.
Which of the following operating systems can you freely modify if you choose?
a)
OS X
b)
iOS
c)
BlackBerry
d)
Linux
15.
Keeping track of the location of processes in memory and allocating space to new processes is known as...
a)
Memory Management
b)
Process Management
c)
Memory Scheduling
d)
Process Scheduling
16.
A process is a...
a)
program in execution
b)
program on the hard drive
c)
high level program
d)
low level program 
17.
Which of the following is not a resource managed by the OS?
a)
Bandwidth
b)
Secondary Storage
c)
RAM
d)
Programs
18.

What do device drivers do?

a)

Allows the OS to communicate with hardware

b)

Drives around the motherboard

c)

Increases the amount of storage

19.

What type of operating system is Windows 10?

a)

Single-user OS

b)

Multi-user OS

20.
A(n) ______________________ is the most important software that runs on a computer.
a)
Operating System
b)
Windows
c)
Anti Virus
d)
iOS
21.
Which of the following is the most recent version of Windows?
a)
Windows 8
b)
Windows 7
c)
Windows 10
22.
What is the purpose of an operating system?
a)
Manage software on computer
b)
Manage hardware on computer
c)
Manage all hardware & software on computer
23.

The program in our operating system always deals with what address?

a)

logical address

b)

virtual address

c)

both

d)

neither

24.

Click on all the examples of Operating Systems

a)

Windows

b)

iOS

c)

Google Docs

25.

To access the services of operating system, the interface is provided by the ___________

a)

System calls

b)

API

c)

Library

d)

Assembly instructions

26.

The primary purpose of an operating system is:

a)

To make the most efficient use of the computer hardware

b)

To allow people to use the computer,

c)

To keep systems programmers employed

d)

To make computers easier to use

27.

The strategy of allowing processes that are logically runnable to be temporarily suspended is called

a)

preemptive scheduling

b)

non preemptive scheduling

c)

shortest job first

d)

first come first served

28.

Semaphores are used to solve

a)

Deadlock

b)

Mutual exclusion

c)

Inter-process Communication

d)

Messaging

29.

Only the process executing the critical section is allowed access to the shared variable,all other processes should prevented from doing so until the completion of the critical section. This is often referred to as-

a)

Mutual exclusion

b)

semaphores

c)

Deadlock

d)

Interprocess communication

30.

Banker’s algorithm is used as-

a)

Deadlock occurrence method

b)

Deadlock avoidance method

c)

Deadlock detection method

d)

Deadlock recovery method

31.

The ability for a computer to execute more than one task simultaneously

a)

multitasking

b)

multiprogramming

c)

multiprocessing

d)

timesharing

32.

The operating system is a type of

a)

system software

b)

general purpose software

c)

utility software

d)

application software

33.

Which is not a process state?

a)

waiting

b)

terminated

c)

blocked

d)

redirected

34.

A signal sent by a hardware or software to CPU indicating that something needs attention

a)

disturbance

b)

interrupt

c)

waiting

d)

exclusion

35.

FCFS is operates similar to a

a)

stack

b)

sorting algorithm

c)

circle

d)

queue

36.
A process is a...
a)
program in execution
b)
program on the hard drive
c)
high level program
d)
low level program 
37.
Which of the following is not a resource managed by the OS?
a)
Bandwidth
b)
Secondary Storage
c)
RAM
d)
Programs
38.

What do device drivers do?

a)

Allows the OS to communicate with hardware

b)

Drives around the motherboard

c)

Increases the amount of storage

39.

What type of operating system is Windows 10?

a)

Single-user OS

b)

Multi-user OS

40.
A(n) ______________________ is the most important software that runs on a computer.
a)
Operating System
b)
Windows
c)
Anti Virus
d)
iOS
41.
Which of the following is the most recent version of Windows?
a)
Windows 8
b)
Windows 7
c)
Windows 10
42.
What is the purpose of an operating system?
a)
Manage software on computer
b)
Manage hardware on computer
c)
Manage all hardware & software on computer
43.

The program in our operating system always deals with what address?

a)

logical address

b)

virtual address

c)

both

d)

neither

44.

Click on all the examples of Operating Systems

a)

Windows

b)

iOS

c)

Google Docs

45.

To access the services of operating system, the interface is provided by the ___________

a)

System calls

b)

API

c)

Library

d)

Assembly instructions

46.

The primary purpose of an operating system is:

a)

To make the most efficient use of the computer hardware

b)

To allow people to use the computer,

c)

To keep systems programmers employed

d)

To make computers easier to use

47.

The strategy of allowing processes that are logically runnable to be temporarily suspended is called

a)

preemptive scheduling

b)

non preemptive scheduling

c)

shortest job first

d)

first come first served

48.

Semaphores are used to solve

a)

Deadlock

b)

Mutual exclusion

c)

Inter-process Communication

d)

Messaging

49.

Only the process executing the critical section is allowed access to the shared variable,all other processes should prevented from doing so until the completion of the critical section. This is often referred to as-

a)

Mutual exclusion

b)

semaphores

c)

Deadlock

d)

Interprocess communication

50.

Banker’s algorithm is used as-

a)

Deadlock occurrence method

b)

Deadlock avoidance method

c)

Deadlock detection method

d)

Deadlock recovery method

51.

The ability for a computer to execute more than one task simultaneously

a)

multitasking

b)

multiprogramming

c)

multiprocessing

d)

timesharing

52.

The operating system is a type of

a)

system software

b)

general purpose software

c)

utility software

d)

application software

53.

Which is not a process state?

a)

waiting

b)

terminated

c)

blocked

d)

redirected

54.

A signal sent by a hardware or software to CPU indicating that something needs attention

a)

disturbance

b)

interrupt

c)

waiting

d)

exclusion

55.

FCFS is operates similar to a

a)

stack

b)

sorting algorithm

c)

circle

d)

queue

56.

Which module gives control of the CPU to the process selected by the short-term scheduler?

a)

dispatcher

b)

interrupt

c)

scheduler

d)

NONE

57.

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

a)

job queue

b)

READY queue

c)

EXECUTE queue

d)

DEVICE queue

58.

The interval from the time of submission of a process to the time of completion is termed as

a)

waiting time

b)

turnaround time

c)

response time

d)

throughput

59.

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a)

first-come, first-served scheduling

b)

shortest job scheduling

c)

priority scheduling

d)

none of the mentioned

60.

In priority scheduling algorithm ____________

a)

CPU is allocated to the process with highest priority

b)

CPU is allocated to the process with lowest priority

c)

Equal priority processes can not be scheduled

d)

None of the mentioned

61.

Which algorithm is defined in Time quantum?

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

62.

Process are classified into different groups in ____________

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

63.

In multilevel feedback scheduling algorithm ____________

a)

a process can move to a different classified ready queue

b)

classification of ready queue is permanent

c)

processes are not classified into groups

d)

NONE

64.

the process is swapped out of memory and later swapped into memory is done by

a)

short term

b)

medium term

c)

long term

d)

none

65.

switching a process stores state into PCB and restore a state of different process is called as

a)

Dispatching

b)

context switching

c)

demand paging

d)

page fault

66.

In this, the process that comes first will be executed first and next process starts only after the previous gets fully executed.

a)

First-come, first-serve

b)

Shortest-job-first scheduling

c)

Round-robin scheduling

d)

Priority scheduling

e)

Multilevel Queue scheduling

67.

This is scheduling policy that selects for execution the waiting process with the smallest execution time.

a)

First-come, first-serve

b)

Shortest-job first scheduling

c)

Round-robin scheduling

d)

Priority scheduling

e)

Multilevel queue scheduling

68.

It is a CPU Scheduling algorithm where each process is assigned a fixed time slot in a cyclic way.

a)

First-come, first-serve

b)

Shortest-job-first scheduling

c)

Round-robin scheduling

d)

Priority scheduling

e)

Multilevel queue scheduling

69.
Allocating time on the processor to individual processes is known as...
a)
CPU Scheduling
b)
CPU Timing
c)
CPU Clocking
d)
CPU Sorting
70.

The problem with round robin, SJF and STR is what?

a)

They don't take into account priority

b)

They all take too long

c)

Short jobs will not be completed

71.

Which of these is NOT an aim of the CPU scheduler

a)

To maximise CPU time

b)

Process as many jobs as possible

c)

To complete jobs in at least 30 seconds

72.

Which of these is a benefit of FCFS

a)

Simple to implement

b)

It considers priority

c)

Long jobs will get completed eventually

73.

Which algorithm is being described.."Long jobs might never get completed as short processes will always ‘jump the queue"

a)

Round robin

b)

FCFS

c)

STR

74.

Which algorithm is complicated to implement and might not look at small jobs

a)

Multi-level feedback

b)

Round robin

c)

FCFS

75.

If a CPU has the following:

Process A = 3 cycles

Process B = 2 cycles

Process C = 5 cycles


Which would implement 'B' the quickest?

a)

Round robin (1 cycle time slice)

b)

FCFS

c)

STR

76.

If a CPU has the following:

Process A = 3 cycles

Process B = 2 cycles

Process C = 5 cycles


Which would implement 'A' the quickest?

a)

Round robin (2 cycles per timeslice)

b)

FCFS

c)

STR

d)

SJF

77.

Where does process management occur in a computer system?

a)

Utilities

b)

Operating system

78.

The processes that are residing in main memory and are ready and waiting a execute are kept on a list called

a)

job queue

b)

ready queue

c)

execution queue

d)

process queue

79.

The strategy of making processes that are logically runnable to be temporarily suspended is called :

a)

Non preemptive scheduling

b)

Preemptive scheduling

c)

Shortest job first

d)

First Come First Served

80.

Process are classified into different groups in

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

81.

The interval from the time of submission of a process to the time of completion is termed as

a)

waiting time

b)

turnaround time

c)

response time

d)

throughput

82.

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a)

first-in, first-out scheduling

b)

shortest job scheduling

c)

priority scheduling

d)

round robin scheduling

83.

Time quantum is defined in

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

84.

Assuming the above process being scheduled with the SJF scheduling algorithm:

a)

The waiting time for process D is 3 ms.

b)

The waiting time for process D is 0 ms.

c)

The waiting time for process D is 16 ms.

d)

The waiting time for process D is 9 ms.

85.

Assuming the above process being scheduled with the SJF scheduling algorithm:

a)

The waiting time for process C is 3 ms.

b)

The waiting time for process C is 0 ms.

c)

The waiting time for process C is 16 ms.

d)

The waiting time for process C is 9 ms.

86.

What is the average waiting time for all of these processes with the SJF scheduling algorithm?

a)

10.25 ms

b)

7 ms

c)

7.75 ms

d)

10 ms

87.

Which of the following scheduling algorithms gives minimum average waiting time?

a)

FCFS

b)

SJF

c)

Round Robin

d)

Priority

88.

What scheduling algorithm assigns the CPU

to the process with the highest priority?

a)

FIFO

b)

SJF non preemptive

c)

SJF preemptive

d)

priority

89.

Which Scheduling algorithm allocates the

CPU first to the process that requests CPU first?

a)

First Come First serve scheduling

b)

shortest job scheduling

c)

priority scheduling

d)

none of the mentioned

90.

The interval from the line of submission of a process to the time of completion is termed as ____

a)

waiting time

b)

throughput

c)

turnaround time

d)

response time

91.

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:

a)

job queue

b)

ready queue

c)

execution queue

d)

process queue

92.

In priority scheduling algorithm:

a)

CPU is allocated to the process with highest priority

b)

CPU is allocated to the process with lowest priority

c)

equal priority processes can not be scheduled

d)

none of the mentioned

93.

CPU scheduling is the basis of ___________

a)

multiprocessor systems

b)

multiprogramming operating systems

c)

larger memory sized systems

d)

none of the mentioned

94.

Scheduling is done so as to ____________

a)

increase CPU utilization

b)

decrease CPU utilization

c)

keep the CPU more idle

d)

none of the mentioned

95.

What is Turnaround time?

a)

the total waiting time for a process to finish execution

b)

the total time spent in the ready queue

c)

the total time spent in the running queue

d)

the total time from the completion till the submission of a process

96.

What is Waiting time?

a)

the total time in the blocked and waiting queues

b)

the total time spent in the ready queue

c)

the total time spent in the running queue

d)

the total time from the completion till the submission of a process

97.

Round robin scheduling falls under the category of ____________

a)

Non-preemptive scheduling

b)

Preemptive scheduling

c)

All of the mentioned

d)

None of the mentioned

98.

What is Scheduling?

a)

allowing a job to use the processor

b)

making proper use of processor

c)

all of the mentioned

d)

none of the mentioned

99.

In multilevel feedback scheduling algorithm ____________

a)

a process can move to a different classified ready queue

b)

classification of ready queue is permanent

c)

processes are not classified into groups

d)

none of the mentioned

100.

Which one of the following can not be scheduled by the kernel?

a)

kernel level thread

b)

user level thread

c)

process

d)

none of the mentioned

101.

Process are classified into different groups in ____________

a)

shortest job scheduling algorithm

b)

shortest job scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

102.

Which algorithm is defined in Time quantum?

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

103.

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________

a)

all process

b)

currently running process

c)

parent process

d)

init process

104.

The amount of time to execute a particular process is known as

a)

Throughput

b)

Turnaround Time

c)

Waiting Time

d)

Response Time

105.

What is the full form of GUI ?

(a)  

106.

Give an example of single-user operating system

(a)  

107.

Give an example of multi-user operating system

(a)  

108.

Can a taskbar location be changed on the desktop ? Yes or No ?

(a)  

109.

The moving picture that you see on the desktop screen when it is not in use is called (a)  

110.

The process of loading the operating system is called (a)  

111.

The first screen that you see after you have logged in is called the (a)  

112.

The small pictures on the desktop are called (a)  

113.

The start button is present on the extreme (a)   of the taskbar

114.

When you click the start button a list of programes appears. This is called start (a)  

115.

The start menu has (a)   power options

116.

What is the graph used for deadlock identification

a)

resource allocation graph

b)

process allocation graph

c)

thread allocation graph

d)

instance allocation graph

117.

Which of the following condition is required for deadlock to be possible?

a)

mutual exclusion

b)

a process may hold allocated resources while awaiting assignment of other resources

c)

no resource can be forcibly removed from a process holding it

d)

all of the mentioned

118.

Which of the following is not a necessary condition for deadlock?

a)

Mutual Exclusion

b)

Reentrancy

c)

Hold and wait

d)

No pre-emption

119.

If any of the process is waiting for a long time then it is called as

a)

Deadlock

b)

semaphore

c)

starvation

d)

None

120.

Only one thread at a time can use a resource

a)

mutual exclusion

b)

hold and wait

c)

no preemption

d)

CIRCULAR WAIT

121.

If there is an edge from resource to process then we called that edge as

a)

assignment edge

b)

request edge

c)

forward edge

d)

back edge

122.

If there is an edge from process to resource then we called that edge as

a)

assignment edge

b)

request edge

c)

back edge

d)

front edge

123.

A set of process or thread waits for a resource which is held by another waiting process is called

a)

Deadlock

b)

starvation

c)

synchronization

d)

concurrency

124.

Resources are released only voluntarily by the thread holding the resource, after thread is finished with it

a)

mutual exclusion

b)

hold and wait

c)

no preemption

d)

circular wait

125.

Thread holding at least one resource is waiting to acquire additional resources held by other threads are called as

a)

hold and wait

b)

no preemption

c)

circular wait

d)

mutual exclusion

126.

Paging is

a)

contiguous memory allocation scheme

b)

non contiguous memory allocation scheme

127.

Segmentation is

a)

contiguous memory allocation scheme

b)

non contiguous memory allocation scheme

128.

In paging physical memory is divided into partitions called--------

a)

pages

b)

frames

c)

page table

129.

Pages have

a)

fixed and equal size

b)

fixed and unequal size

c)

variable and equal size

d)

variable and unqual size

130.

Page table stores the mapping between

a)

pages and frames

b)

process and PCB

c)

frame and PCB

d)

page and PCB

131.

Paging suffers from

a)

external fragmentation

b)

internal fragmentation

132.

In logical address to physical address translation if the page number is found in the TLB, then it is a

a)

TLB hit

b)

TLB miss

133.

Segmentation uses

a)

fixed size partitions

b)

variable size partitions

134.

Segmentation suffers from internal fragmentation.

a)

True

b)

False

135.

Physical address calculation is done in segmentation with........

a)

Page table

b)

Segment table

136.

__________ has the lowest fault rate of all the page replacement algorithms.

a)

LRU

b)

FIFO

c)

Optimal

d)

Counting based

137.

In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?

a)

oldest

b)

newest

c)

Frequently occurred page in the future

d)

Not Frequently occurred page in the future

138.

Which algorithm suffers from Belady's anomaly?

a)

FIFO

b)

Optimal

c)

LRU

d)

All of these

139.

Replace the page that is not used for the longest period of time. This principle is adopted by ____________.

a)

LRU

b)

FIFO

c)

MFU

d)

LFU

140.

A page fault occurs

a)

when the process enters the ready state

b)

when the process enters the blocked state

c)

when the page is in the memory

d)

when the page is not in the memory

141.

Operating system supports different page replacement algorithms. From the given below option which is not a valid one?

a)

Optimal

b)

Currently used

c)

LRU

d)

FIFO

142.

The least frequently used page replacement algorithm will select the page that

a)

has been used for the longest time in the past.

b)

has been used most number of times.

c)

will not be used for the longest time in future.

d)

has been used least number of times.

143.

with demand paging a page of a process is brought into the main memory ...

a)

when the execution of a process starts

b)

when the process comes to the ready queue

c)

when the page is required during execution

d)

never bring a page to main memory

144.

The valid/ invalid bit in the page table is set if

a)

the page is present in the main memory

b)

the page is not present in the main memory

c)

page is not required

d)

page is required

145.

Virtual Memory can be implemented via

a)

Paging

b)

Segmentation

c)

Segmentation with paging

d)

demand paging

146.

Page size 1024 bytes and process size is 72766 bytes , internal fragmentation is

a)

962

b)

62

c)

72704

d)

71

147.

Page table is stored in

a)

HDD

b)

SSD

c)

RAM

d)

Processor

148.

Access problem of Page table is solved by

a)

Processor

b)

RAM

c)

TLB

d)

Segmentation

149.

Associative memory working under

a)

Serial Search

b)

Seqential search

c)

Parellel Search

d)

Sorted search

150.

valid bit in page table indicates

a)

associated page is in the process’ logical address space

b)

the page is not in the process

151.

One copy of read-only code used among processes called

a)

private code

b)

Shared code

152.

Physical memory is broken into fixed-sized blocks called

a)

backing store

b)

Virtual memory

c)

frames

d)

pages

153.

Every address generated by the CPU is divided into two parts. They are

a)

frame bit & page number

b)

page number & page offset

c)

page offset & frame bit

d)

frame offset & page offset

154.

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

a)

frame offset

b)

frame bit

c)

page number

d)

page offset

155.

Paging increases the ______ time.

a)

waiting

b)

execution

c)

context – switch

d)

all of the mentioned

156.

Smaller page tables are implemented as a set of _______

a)

registers

b)

counters

c)

stacks

d)

queues

157.

----- is an interface between the user of a computer system and a computer hardware

a)

Time management

b)

Operating system

c)

Process management

158.

The term primary memory refers to

a)

RAM and MMU

b)

ROM

c)

kernal

159.

--- is used as backup medium for programs and data since the main memory is volatile

a)

Secondary storage

b)

primary memory

c)

cache

160.

---- is the core of the operating system and responsible for managing the system resources.

a)

Kernel

b)

core

c)

OS

161.

API stands for

a)

Application programming Interface

b)

Device driver interface

c)

Operating system

162.

The file management service of kernel is responsible for

a)

Creation,deletion and alteration of files

b)

saving of files in the secondary storage memory

c)

both

163.

--- deals with managing the process/tasks.

a)

Time management

b)

process management

c)

I/O system management

164.

---- is a collection of related information

a)

file

b)

project

c)

system

165.

---- interface is used to connect kernel service and underlying hardware

a)

API

b)

Device driver

c)

system resource

166.

What is the use of directory structure in the operating system?

a)

The directory structure is used to solve the problem of the network connection in OS.

b)

It is used to store folders and files hierarchically.

c)

It is used to store the program in file format.

d)

None

167.

What type of memory stores data in a swap file on a hard drive?

a)

Secondary memory

b)

Virtual memory

c)

Low memory

d)

RAM

168.

Which method is the best among file allocation methods?

a)

Linked

b)

Contiguous

c)

Indexed

d)

None

169.

Which of the following is not a type of directory structure?

a)

Acyclic-graph directory structure

b)

Single-level directory structure

c)

Tree directory structure

d)

Stack directory structure

170.

An un-interrupted unit is known as

a)

Atomic

b)

Single

c)

Static

d)

None

171.

In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on

a)

the size of the blocks, and the size of the address of the blocks

b)

the number of blocks used for the index, and the size of the blocks

c)

the size of the blocks, the number of blocks used for the index, and the size of the address of the blocks

d)

None

172.

Which of the following page replacement algorithms suffers from Belady’s anomaly?

a)

FIFO

b)

SSTF

c)

LRU

d)

Optimal page replacement

173.

Increasing the RAM of a computer typically improves performance because

a)

Virtual memory increases

b)

Larger RAMs are faster

c)

Fewer page faults occur

d)

Fewer segmentation faults occur

174.

Page fault occurs when

a)

When a requested page is in memory

b)

When a requested page is not in memory

c)

When a page is currupted

d)

When an exception is thrown

175.

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then

a)

OPTIMAL < LRU < FIFO

b)

OPTIMAL < FIFO < LRU

c)

OPTIMAL = LRU

d)

OPTIMAL = FIFO

176.

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy is

a)

5

b)

6

c)

7

d)

8

177.

Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is

a)

120

b)

122

c)

124

d)

118

178.

In a system with 32 bit virtual addresses and 1 KB page size, use of one-level page tables for virtual to physical address translation is not practical because of

a)

the large amount of internal fragmentation

b)

the large amount of external fragmentation

c)

the large memory overhead in maintaining page tables

d)

the large computation overhead in the translation process

179.

Which of the following is not a form of memory?

a)

instruction cache

b)

instruction register

c)

instruction opcode

d)

translation lookaside buffer

180.

Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is

a)

2

b)

4

c)

8

d)

16

181.

Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?

a)

200 KB and 300 KB

b)

200 KB and 250 KB

c)

250 KB and 300 KB

d)

300 KB and 400 KB

182.

Consider a fully associative cache with 8 cache blocks (numbered 0-7) and the following sequence of memory block requests: 4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7 If LRU replacement policy is used, which cache block will have memory block 7?

a)

4

b)

5

c)

6

d)

7

183.

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?

a)

LRU

b)

OPR

c)

MRU

d)

FIFO

184.

Which of the following is major part of time taken when accessing data on the disk?

a)

Settle time

b)

Rotational latency

c)

Seek time

d)

Waiting time

185.

Consider the 3 processes, P1, P2 and P3 shown in the table.

Process Arrival time Time Units Required

P1 0 5

P2 1 7

P3 3 4

The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are

a)

FCFS: P1, P2, P3 RR2: P1, P2, P3

b)

FCFS: P1, P3, P2 RR2: P1, P3, P2

c)

FCFS: P1, P2, P3 RR2: P1, P3, P2

d)

FCFS: P1, P3, P2 RR2: P1, P2, P3

Similar Resources on Wayground

Ôn tập ATBMTT6

187 questions

Ôn tập ATBMTT6

quiz

Worksheet

•

University