wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Operating Systems Quiz

Total questions: 200

Worksheet time: 2hrs 39mins

Name
Class
Date
1.

Choose a characteristic of the meaning of open source.

a)

Processor

b)

Free Use

c)

Privatization

d)

Capitalism

2.

which company created the first operating system?

a)

General Motors

b)

Cadillac

c)

IBM

d)

Intel

3.
Allocating time on the processor to individual processes is known as...
a)
CPU Scheduling
b)
CPU Timing
c)
CPU Clocking
d)
CPU Sorting
4.
A process is a...
a)
program in execution
b)
program on the hard drive
c)
high level program
d)
low level program 
5.
Allocating time on the processor to individual processes is known as...
a)
CPU Scheduling
b)
CPU Timing
c)
CPU Clocking
d)
CPU Sorting
6.
A process is a...
a)
program in execution
b)
program on the hard drive
c)
high level program
d)
low level program 
7.
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
8.
Which of the following is not a resource managed by the OS?
a)
Bandwidth
b)
Secondary Storage
c)
RAM
d)
Programs
9.
The OS provides a platform that enables what to be run?
a)
Applications
b)
Hardware
c)
Cache
d)
Processes
10.
A message sent by the OS to change the CPU schedule is known as...
a)
Interupt
b)
Poll
c)
Cache
d)
Defrag
11.

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

12.

What do device drivers do?

a)

Allows the OS to communicate with hardware

b)

Drives around the motherboard

c)

Increases the amount of storage

13.

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

14.

What type of operating system is Windows 10?

a)

Single-user OS

b)

Multi-user OS

15.
A(n) ______________________ is the most important software that runs on a computer.
a)
Operating System
b)
Windows
c)
Anti Virus
d)
iOS
16.
Which of the following is the most recent version of Windows?
a)
Windows 8
b)
Windows 7
c)
Windows 10
17.
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
18.
Which of the following operating systems can you freely modify if you choose?
a)
OS X
b)
iOS
c)
BlackBerry
d)
Linux
19.
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
20.
A process is a...
a)
program in execution
b)
program on the hard drive
c)
high level program
d)
low level program 
21.
Which of the following is not a resource managed by the OS?
a)
Bandwidth
b)
Secondary Storage
c)
RAM
d)
Programs
22.

What do device drivers do?

a)

Allows the OS to communicate with hardware

b)

Drives around the motherboard

c)

Increases the amount of storage

23.

What type of operating system is Windows 10?

a)

Single-user OS

b)

Multi-user OS

24.
A(n) ______________________ is the most important software that runs on a computer.
a)
Operating System
b)
Windows
c)
Anti Virus
d)
iOS
25.
Which of the following is the most recent version of Windows?
a)
Windows 8
b)
Windows 7
c)
Windows 10
26.
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
27.

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

a)

logical address

b)

virtual address

c)

both

d)

neither

28.

Click on all the examples of Operating Systems

a)

Windows

b)

iOS

c)

Google Docs

29.

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

a)

System calls

b)

API

c)

Library

d)

Assembly instructions

30.

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

31.

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

32.

Semaphores are used to solve

a)

Deadlock

b)

Mutual exclusion

c)

Inter-process Communication

d)

Messaging

33.

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

34.

Banker’s algorithm is used as-

a)

Deadlock occurrence method

b)

Deadlock avoidance method

c)

Deadlock detection method

d)

Deadlock recovery method

35.

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

a)

multitasking

b)

multiprogramming

c)

multiprocessing

d)

timesharing

36.

The operating system is a type of

a)

system software

b)

general purpose software

c)

utility software

d)

application software

37.

Which is not a process state?

a)

waiting

b)

terminated

c)

blocked

d)

redirected

38.

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

a)

disturbance

b)

interrupt

c)

waiting

d)

exclusion

39.

FCFS is operates similar to a

a)

stack

b)

sorting algorithm

c)

circle

d)

queue

40.

What is the most used operating system in the world?

a)

Linux

b)

MacOS

c)

Windows

d)

Ubuntu

41.

1. What is an operating system?

a)

a) interface between the hardware and application programs

b)

b) collection of programs that manages hardware resources

c)

c) system service provider to the application programs

d)

d) all of the mentioned

42.

1. What is an operating system?

a)

a) interface between the hardware and application programs

b)

b) collection of programs that manages hardware resources

c)

c) system service provider to the application programs

d)

d) all of the mentioned

43.

2. What is the main function of the command interpreter?

a)

a) to provide the interface between the API and application program

b)

b) to handle the files in the operating system

c)

c) to get and execute the next user-specified command

d)

d) none of the mentioned

44.

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

a)

a) Library

b)

b) System calls

c)

c) Assembly instructions

d)

d) API

45.

4.  Where is the interrupt in operating system?

a)

a) either low or high memory (depending on the location of interrupt vector)

b)

b) in the low memory

c)

c) in the high memory

d)

d) none of the mentioned

46.

5. Which one of the following is not a real time operating system?

a)

a) RTLinux

b)

b) Palm OS

c)

c) QNX

d)

d) VxWorks

47.

6. In a timeshare operating system, when the time slot assigned to a process is completed, the process switches from the current state to?

a)

a) Suspended state

b)

b) Terminated state

c)

c) Ready state

d)

d) Blocked state

48.

7. For an effective operating system, when to check for deadlock?

a)

a) every time a resource request is made at fixed time intervals

b)

b) at fixed time intervals

c)

c) every time a resource request is made

d)

d) none of the mentioned

49.

8. To recover from failures in the network operations _____________ information may be maintained.

a)

a) operating system

b)

b) ip address

c)

c) stateless

d)

d) state

50.

9 The two steps the operating system takes to use a disk to hold its files are _______ and ________

a)

a) caching & logical formatting

b)

b) logical formatting & swap space creation

c)

c) swap space creation & caching

d)

d) partitioning & logical formatting

51.

10 In Unix, which system call creates the new process?

a)

a) create

b)

b) fork

c)

c) new

d)

d) none of the mentioned

52.

1) 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)

All of the these

53.

What is a program?

a)

a line of instruction

b)

a list of instructions

c)

a computer

54.

Where does the taskbar appear by default?

a)

on top of Windows Desktop

b)

at the bottom of Windows Desktop

c)

at the sides of Windows Desktop

55.

What manages the hardware and runs the software?

a)

Computer Systems

b)

Dedicated Systems

c)

Embedding Systems

d)

Operating Systems

56.

What is a good definition of software?

a)

parts of a computer that are soft

b)

Parts of a computer that you can't see

c)

A set of rules that tell a computer what to do

d)

games

57.
Which of the following is the process of starting or restarting a computer or mobile device?
a)
Booting
b)
Lauching 
c)
Loading
d)
Keying
58.

Earlier computer systems utilized Command Line Interface to tell a computer what to do, which interface does the computer utilize now?

a)

Command Line Interface

b)

Touch User Interface

c)

Natural Language Interface

d)

Graphical User Interface

59.

What is accessibility?

a)

Changing how a system looks

b)

Changing the brightness of the computer

c)

Allowing as many people to access computers and technology

d)

Changing the graphics and monitor to handle your screen

60.

Sometimes, the process in our system has pending I/O. When this thing happens, swapping _____ be done.

a)

can

b)

must never

c)

both

d)

neither

61.

Which can the main memory take in it?

a)

operating system

b)

user processes

c)

both

d)

neither

62.

Which is faster than first-fit?

a)

Best fit

b)

Worst fit

c)

both

d)

neither

63.

The program counter contains the location of the instruction being executed. The address is loaded into the memory address register of the memory. How do we refer that address?

a)

Physical address

b)

Logical address

c)

both

d)

neither

64.

The run-time mapping from virtual to physical addresses is done by a hardware device properly called:

a)

Virtual to physical mapper

b)

CPU mapping unit

c)

both

d)

neither

65.

The base register is also known as the:

a)

basic register

b)

relocation register

c)

both

d)

neither

66.

In allocating address space to each process, what specifies the size of the range where that process can be allocated?

a)

Base register

b)

Limit register

c)

both

d)

neither

67.

The _____ consists of all processes whose memory images are in the backing store or in memory and are ready to run.

a)

CPU

b)

Secondary Storage

c)

both

d)

neither

68.

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

a)

logical address

b)

virtual address

c)

both

d)

neither

69.

External fragmentation will not occur when:

a)

First fit, best fit, or worst fit are used

b)

no matter which algorithm is used, it will always occur

c)

both

d)

neither

70.

1. What is an operating system?

a)

a) interface between the hardware and application programs

b)

b) collection of programs that manages hardware resources

c)

c) system service provider to the application programs

d)

d) all of the mentioned

71.

2. What is the main function of the command interpreter?

a)

a) to provide the interface between the API and application program

b)

b) to handle the files in the operating system

c)

c) to get and execute the next user-specified command

d)

d) none of the mentioned

72.

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

a)

a) Library

b)

b) System calls

c)

c) Assembly instructions

d)

d) API

73.

4.  Where is the interrupt in operating system?

a)

a) either low or high memory (depending on the location of interrupt vector)

b)

b) in the low memory

c)

c) in the high memory

d)

d) none of the mentioned

74.

5. Which one of the following is not a real time operating system?

a)

a) RTLinux

b)

b) Palm OS

c)

c) QNX

d)

d) VxWorks

75.

6. In a timeshare operating system, when the time slot assigned to a process is completed, the process switches from the current state to?

a)

a) Suspended state

b)

b) Terminated state

c)

c) Ready state

d)

d) Blocked state

76.

7. For an effective operating system, when to check for deadlock?

a)

a) every time a resource request is made at fixed time intervals

b)

b) at fixed time intervals

c)

c) every time a resource request is made

d)

d) none of the mentioned

77.

8. To recover from failures in the network operations _____________ information may be maintained.

a)

a) operating system

b)

b) ip address

c)

c) stateless

d)

d) state

78.

9 The two steps the operating system takes to use a disk to hold its files are _______ and ________

a)

a) caching & logical formatting

b)

b) logical formatting & swap space creation

c)

c) swap space creation & caching

d)

d) partitioning & logical formatting

79.

10 In Unix, which system call creates the new process?

a)

a) create

b)

b) fork

c)

c) new

d)

d) none of the mentioned

80.

An operating system is the software that controls all the hardware. It acts as an _____________ between the user and the hardware and also between applications and the hardware.

a)

application

b)

operator

c)

hardware

d)

interface

81.

What does an OS need to work well?

a)

RAM memory

b)

storage

c)

CPU

d)

all answers

82.

What is the most used operating system in the world?

a)

Linux

b)

MacOS

c)

Windows

d)

Ubuntu

83.

What does an OS need to work well?

a)

RAM memory

b)

storage

c)

CPU

d)

all answers

84.

What is the most used operating system in the world?

a)

Linux

b)

MacOS

c)

Windows

d)

Ubuntu

85.

Choose a characteristic of the meaning of open source.

a)

Processor

b)

Free Use

c)

Privatization

d)

Capitalism

86.

The operating system helps to manage files

a)

True

b)

False

87.

The operating system is in your mind

a)

True

b)

False

88.

Operating systems allow you to interact with various devices

a)

True

b)

False

89.

(a)   is founded by Steve Jobs

90.

What year was unix created?

a)

2000

b)

1780

c)

1969

d)

1945

91.

which company created the first operating system?

a)

General Motors

b)

Cadillac

c)

IBM

d)

Intel

92.

Do operating systems today have a graphical user interface (GUI)?

a)

True

b)

False

93.

The first version of this operating system started out in 1985, offered as an extension of an already-existing MS-DOS disk operating system.

a)

macOS

b)

Windows

c)

UNIX

d)

Linux

94.

Being one of the earliest in the category of modern computer operating systems, UNIX was developed by Bell Laboratories researchers in the early ___

a)

1970s

b)

1960s

c)

1980s

d)

1990s

95.

Windows is an example of an open source operating system.

a)

True

b)

False

96.

Through this method, a hard drive can be divided into multiple logical storage areas which can then be used to install a different operating system

a)

Cutting

b)

Segregation

c)

Partitioning

d)

Defragmentation

97.

A group of software applications that manage the interactions between computer or mobile hardware

a)

Multitasking

b)

Cold Booting

c)

Operating System

d)

User Interface

98.

An area in a hard drive that is allotted for virtual memory

a)

Swap File

b)

Thrashing

c)

Paging

d)

Page

99.

A segment of memory or storage in which items are placed while waiting to be transferred from an input device to an output device.

a)

Spooling

b)

Foreground

c)

Multitasking

d)

Buffer

100.

Tells the OS how to communicate with a specific device. All the devices that are connected into a computer needs it to communicate with the computer

a)

Plug & Play

b)

Driver

c)

Thrashing

d)

Warm Booting

101.

Capable of handling a high volume of transactions in a multiuser environment and working with multiple processors

a)

Linux

b)

macOS Server

c)

UNIX

d)

Windows Server

102.

An open source, Linux-based mobile operating system designed by Google for smartphones and tablets

a)

Android

b)

iOS

c)

Cherry Mobile

d)

Windows

103.

The practice of sharing or pooling computing resources, such as servers or storage devices

a)

Virtualizing

b)

Virtual

c)

Virtualization

d)

Virtualize

104.

Share contacts and other information by touching two devices together

a)

Hands

b)

Bluetooth

c)

SHAREit

d)

NFC Technology

105.

Causes a display's screen to show a moving image or blank screen if no keyboard or mouse activity occurs for a specified time.

a)

Battery Optimizer

b)

Eco-Mode

c)

Power Management

d)

Screen Saver

106.

Operating systems can include the following security tools, except:

a)

VPN Software

b)

Automatic Updating

c)

Antivirus Software

d)

Firewall

107.

A program that assesses and reports information about various computer resources and devices.

a)

Device Information

b)

Activity Tracker

c)

Performance Monitor

d)

System Administrator

108.

Which algorithm will minimum flow of time?

a)

First come first serve

b)

Shortest job first

c)

Priority scheduling

d)

Round robin

109.

Round robin scheduling falls under :

a)

Non-preemptive scheduling

b)

Preemptive scheduling

c)

Both a and b

d)

None of above

110.

From the time of submission of a process to the time of completion? The interval is termed as :

a)

Turnaround time

b)

Response time

c)

Through put

d)

Waiting time

111.

Which requested resources are granted with deadlock detection?

a)

Resources

b)

Processes

c)

Programs

d)

User's

112.

If a process is executing in critical section,then no other processes can be executing in their c.s :

a)

Critical exclusion

b)

Mutual Exclusion

c)

Both a and b

d)

None

113.

In below mentioned options, which one is classical problems of synchronisation

a)

Bounded buffer problem

b)

Producer Consumer problem

c)

Dining Philosophers problem

d)

Both a and c

114.

Which one of the following is a Synchronisation tool ?

a)

Thread

b)

Semaphore

c)

Socket

d)

Both and c

115.

Mutual exclusive can be provided by the?

a)

Muted locks

b)

Binary Semaphores

c)

Both a and b

d)

None of above

116.

Process Synchronisation can be done on ..?

a)

Hardware level

b)

Software Level

c)

Both a and b

d)

None of the above

117.

A running process is not interrupted by :-

a)

A device

b)

Timer

c)

Scheduler process

d)

Power failure

118.

The release of resource and request are?

a)

System calls

b)

Command line statements

c)

Special Programs

d)

None of above

119.

For share able resources like printer, which condition should be used?

a)

Hold and wait

b)

Circular set

c)

Both a and c

d)

Mutual exclusion

120.

A process in OS uses resources in the foll way ?

a)

Requests a resource

b)

Use a resource

c)

Release the resource

d)

All the above

121.

A process that contain multiple threads?

a)

Multi Threading

b)

Threads

c)

Process

d)

Both a and b

122.

When more than one processes access the same code segment is known as?

a)

Synchronisation

b)

Critical section

c)

Mutual exclusion

d)

None

123.

Which is used to implement the solution of critical section problems with multiple processes

a)

Counting semaphore

b)

Binary semaphore

c)

Synchronisation

d)

Both b and c

124.

Which is used to control access to a resource that has multiple instances

a)

Binary semaphore

b)

Semaphore

c)

Counting semaphore

d)

None

125.

Methods of handling deadlocks?

a)

Deadlock prevention

b)

Deadlock detection

c)

Deadlock avoidance

d)

All the above

126.

Process initiation denial and resource allocation denial techniques comes under?

a)

Deadlock prevention

b)

Deadlock detection

c)

Deadlock avoidance

d)

All the above

127.

Deadlock is resolved by?

a)

Aborting

b)

Can't be resolved

c)

Restarting the process

d)

Both a and c

128.

Race Condition, Critical section problem, Semaphores, Peterson's solution which all these comes under ?

a)

Process Synchronisation

b)

Threading

c)

Deadlock

d)

All the above

129.

Which problem is generalized in terms of producer - consumer problem:

a)

Sleeping barbar problem

b)

Bounded buffer

c)

Dining philosoper

d)

Reader-Writer problem

130.

The concept of multithreading needs proper understanding of these two terms?

a)

Kernal and Thread

b)

User and Kernal

c)

A process and A thread

d)

All the above

131.

Types of threads?

a)

Kernal level Thread

b)

User level thread

c)

Non-User level thread

d)

Both a and b

132.

A resource can't be taken from a process unless the process release the resource:

a)

Circular wait

b)

Hold and wait

c)

No preemptive

d)

Both b and c

133.

Process execution consists of a cycle of _________ and ________.

a)

CPU execution

b)

I/O wait

c)

RAM storage

134.

CPU burst is followed by I/O burst.

a)

True

b)

False

135.

In CPU Scheduling, CPU burst distribution is not the main concern.

a)

True

b)

False

136.

Selects from among the processes in ready queue, and allocates the CPU to one of them.

a)

Short-term scheduler

b)

Long-term scheduler

c)

CPU scheduler

137.

CPU scheduling decisions may take place when a process:

a)

Switches from running to waiting state

b)

Switches from running to ready state

c)

Switches from running to terminated

d)

Switches from waiting to ready

e)

Terminated

138.

Does not cut execution.

a)

Preemptive

b)

Nonpreemptive

139.

Cuts execution.

a)

Preemptive

b)

Nonpreemptive

140.

Gives control of the CPU to the process selected by the short-term scheduler.

a)

Dispatcher

b)

CPU controller

c)

Short-term CPU

141.

Dispatcher includes:

a)

switching context: saving and loading state

b)

switching to user mode

c)

Jumping to the proper location in the user program

d)

Jumping to the improper location in the user program

142.

What are the 5 scheduling criteria?

a)

CPU Utilization

b)

Throughput

c)

Turnaround time

d)

Waiting Time

e)

Response Time

143.

Keep the CPU as busy as possible.

a)

CPU Utilization

b)

Throughput

c)

Turnaround time

d)

Waiting Time

e)

Response Time

144.

# of processes that complete their execution per time unit.

a)

CPU Utilization

b)

Throughput

c)

Turnaround time

d)

Waiting Time

e)

Response Time

145.

Amount of time to execute a particular process.

a)

CPU Utilization

b)

Throughput

c)

Turnaround time

d)

Waiting Time

e)

Response Time

146.

Amount of time a process has been waiting in the ready queue.

a)

CPU Utilization

b)

Throughput

c)

Turnaround time

d)

Waiting Time

e)

Response Time

147.

Amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment)

a)

CPU Utilization

b)

Throughput

c)

Turnaround time

d)

Waiting Time

e)

Response Time

148.

Scheduling Algorithm Optimization Criteria

a)

Max CPU utilization

b)

Max throughput

c)

Min turnaround time

d)

Min waiting time

e)

Min response time

149.

Short process behind long process (applies to SJF, short process first)

a)

Convoy effect

b)

Convey effect

c)

Conveyor effect

150.

Associate with each process the length of its next CPU burst.

a)

First-Come, First-Served Scheduling

b)

Shortest-Job-First Scheduling

c)

Shortest-Remaining-Time-First Scheduling

d)

Priority Scheduling

e)

Round Robin

151.

A priority number (integer) is associated with each process.

a)

First-Come, First-Served Scheduling

b)

Shortest-Job-First Scheduling

c)

Shortest-Remaining-Time-First Scheduling

d)

Priority Scheduling

e)

Round Robin

152.

The CPU is allocated to the process with the highest priority.

(smallest integer = highest priority)

a)

True

b)

False

153.

SJF is priority scheduling where priority is the inverse of predicted next CPU burst time.

a)

True

b)

False

154.

Low priority processes may never execute.

a)

Starvation

b)

Aging

155.

As time progresses increase the priority of the process.

a)

Starvation

b)

Aging

156.

Each process gets a small unit of CPU time, usually 10-100 milliseconds.

After this time has elapsed, the process is preempted and added to the end of the ready queue.

a)

First-Come, First-Served Scheduling

b)

Shortest-Job-First Scheduling

c)

Shortest-Remaining-Time-First Scheduling

d)

Priority Scheduling

e)

Round Robin

157.

A small unit of CPU time (q).

a)

Quantum time

b)

Time slice

c)

Millisecond

158.

System consists of resources and series of processes.

a)

True

b)

False

159.

Resource types include:

a)

CPU cycles

b)

Memory space

c)

I/O devices

d)

Storage space

160.

Each process utilizes a resource as follows:

a)

request

b)

use

c)

release

d)

terminate

161.

Is a situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process.

a)

Deadlock

b)

Lockdead

c)

Deadblock

162.

What are the four conditions where deadlock can arise?

a)

Mutual exclusion

b)

Hold and wait

c)

No preemption

d)

Circular wait

e)

Singular wait

163.

Only one process at a time can use a resource.

a)

Mutual exclusion

b)

Hold and wait

c)

No preemption

d)

Circular wait

164.

A process holding at least one resource is waiting to acquire additional resources held by other processes.

a)

Mutual exclusion

b)

Hold and wait

c)

No preemption

d)

Circular wait

165.

A resource can be released only voluntarily by the process holding it, after that process has completed its task.

a)

Mutual exclusion

b)

Hold and wait

c)

No preemption

d)

Circular wait

166.

There exists a set {P0, P1, …, Pn} of waiting processes such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, …, Pn–1 is waiting for a resource that is held by Pn, and Pn is waiting for a resource that is held by P0.

a)

Mutual exclusion

b)

Hold and wait

c)

No preemption

d)

Circular wait

167.

A set of vertices V and a set of edges E.

a)

Resource-allocation graph

b)

Wait-for graph

c)

Process-allocation graph

168.

Two types of edge in resource-allocation graph:

a)

request edge

b)

assignment edge

c)

allocation edge

d)

receive edge

169.

Directed edge P -> R

a)

Request edge

b)

Assignment edge

170.

Directed edge R -> P

a)

Request edge

b)

Assignment edge

171.
a)

Process

b)

Resource Type with 4 instances

c)

P requests instances of R

d)

P is holding instance of R

172.
a)

Process

b)

Resource Type with 4 instances

c)

P requests instances of R

d)

P is holding instance of R

173.
a)

Process

b)

Resource Type with 4 instances

c)

P requests instances of R

d)

P is holding instance of R

174.
a)

Process

b)

Resource Type with 4 instances

c)

P requests instances of R

d)

P is holding instance of R

175.
a)

Deadlock

b)

No Deadlock

176.
a)

Deadlock

b)

No Deadlock

177.
a)

Deadlock

b)

No Deadlock

178.

If graph contains no cycle?

a)

Deadlock

b)

No Deadlock

c)

Possibility of Deadlock

179.

If graph contains a cycle and only one instance per resource type

a)

Deadlock

b)

No Deadlock

c)

Possibility of Deadlock

180.

If graph contains a cycle and several instances per resource type

a)

Deadlock

b)

No Deadlock

c)

Possibility of Deadlock

181.

Ensure that the system will never enter a deadlock state through

a)

Deadlock prevention

b)

Deadlock avoidance

c)

Deadlock trigger

182.

(Deadlock prevention)

Must guarantee that whenever a process requests a resource, it does not hold any other resources.

a)

Hold and Wait

b)

No preemption

183.

(Deadlock prevention)

If a process that is holding some resources requests another resource that cannot be immediately allocated to it, then all resources currently being held are released.

a)

Hold and Wait

b)

No preemption

184.

Requires that the system has some additional a priori information available.

a)

Deadlock prevention

b)

Deadlock avoidance

185.

(Deadlock avoidance)

Simplest and most useful model requires that each process declare the __________________ of resources of each type that it may need.

a)

maximum number

b)

minimum number

c)

number

186.

It is defined by the number of available and allocated resources, and the maximum demands of the processes.

a)

resource-allocation state

b)

resource-allocation graph

c)

process-allocation state

187.

if there exists a sequence <P1, P2, …, Pn> of ALL the processes in the systems such that for each Pi, the resources that Pi can still request can be satisfied by currently available resources + resources held by all the Pj, with j < I.

a)

Safe state

b)

Unsafe state

188.

If a system is in safe state

a)

Deadlock

b)

No Deadlock

c)

Possibility of Deadlock

189.

If a system is in unsafe state

a)

Deadlock

b)

No Deadlock

c)

Possibility of Deadlock

190.

Ensure that a system will never enter an unsafe state.

a)

Prevention

b)

Avoidance

191.

Single instance of a resource type.

a)

Use a resource-allocation graph

b)

Use the banker's algorithm

192.

Multiple instances of a resource type.

a)

Use a resource-allocation graph

b)

Use the banker's algorithm

193.

Multiple instances

Each process must a priori claim maximum use

When a process requests a resource it may have to wait

When a process gets all its resources it must return them in a finite amount of time

a)

Resource-allocation graph

b)

Banker's algorithm

194.

What are the data structures needed for Banker's algorithm?

a)

Available

b)

Max

c)

Allocation

d)

Need

e)

Processes

195.

These are the instances of resource type available.

a)

Available

b)

Max

c)

Allocation

d)

Need

196.

These are the most instances of resource type that the process can request.

a)

Available

b)

Max

c)

Allocation

d)

Need

197.

These are the currently allocated resources.

a)

Available

b)

Max

c)

Allocation

d)

Need

198.

Resources that the processes need to complete its task.

a)

Available

b)

Max

c)

Allocation

d)

Need

199.

Need = Max - Allocated

a)

True

b)

False

200.

Total Number of Resources = Total of each Resource Allocation + Available

a)

True

b)

False