wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

OS quiz 1

Total questions: 25

Worksheet time: 13mins

Name
Class
Date
1.

What are the advantages of worst fit memory allocation?

a)

Higher fragmentation compared to best fit

b)

Slower allocation times for small processes

c)

Advantages of worst fit memory allocation include reduced fragmentation and better accommodation for larger processes.

d)

Increased memory usage due to larger allocations

2.

How does paging help in memory management?

a)

Paging eliminates the need for virtual memory entirely.

b)

Paging increases memory fragmentation by using variable-size pages.

c)

Paging allows efficient memory management by using fixed-size pages, reducing fragmentation, and enabling easier swapping.

d)

Paging requires all processes to be loaded into physical memory simultaneously.

3.

What are the advantages of worst fit memory allocation?

a)

Higher fragmentation compared to best fit

b)

Slower allocation times for small processes

c)

Advantages of worst fit memory allocation include reduced fragmentation and better accommodation for larger processes.

d)

Increased memory usage due to larger allocations

4.

What is the purpose of segmentation in memory management?

a)

Segmentation allows for the division of memory into variable-sized segments based on logical divisions.

b)

Segmentation is used to allocate fixed-size memory blocks only.

c)

Segmentation is primarily concerned with CPU scheduling.

d)

Segmentation does not impact memory allocation strategies.

5.

What are the characteristics of the best fit memory allocation strategy?

a)

Best fit allocates the largest available block to ensure maximum usage.

b)

Best fit minimizes wasted space by allocating the smallest available block that fits the request.

c)

Best fit requires all memory blocks to be of equal size.

d)

Best fit randomly allocates memory without considering the size of the request.

6.

How does the operating system handle memory fragmentation?

a)

The operating system only addresses fragmentation in virtual memory.

b)

The operating system ignores fragmentation as it does not affect performance.

c)

The operating system increases fragmentation by allocating memory randomly.

d)

The operating system can use techniques like compaction to reduce fragmentation.

7.
A __________ operating system allows the many users to share the computer simultaneously.
a)
  Distributed system
b)
Time – shared
c)
Process – shared
d)
   Batch
8.
In __________ several jobs are kept in memory at a time.
a)
Multiprogramming
b)
  Spooling
c)
Job queue
d)
Multi tasking
9.
All the jobs that enter the system are kept in the _________
a)
queue
b)
  job pool
c)
  job queue
d)
ready queue
10.
The ____ of a process contains temporary data such as function parameters, return addresses, and local variables.
a)
text section
b)
data section
c)
program counter
d)
stack
11.
__________ is a program in execution, the unit of work in a modern time-sharing system.
a)
Process
b)
  Job
c)
Task
d)
State
12.
Process may be in ______ state.
a)
New
b)
Running
c)
Waiting
d)
  Any one of the above.
13.
Each process is represented in OS by _________
a)
  Program Control Block
b)
Process Central Block
c)
Process Control Block
d)
Program Central Block
14.
A Thread is some times called a ___________.
a)
Heavyweight process.
b)
Lightweight process.
c)
Fork system
d)
Multiple process
15.
The __________ producer – consumer problem assumes that there is a fixed buffer size
a)
Bouned-buffer
b)
Unbounded-buffer
c)
Cooperating processes.
d)
all the above.
16.
__________ containing the address of the next instruction that is to be executed
a)
Instruction register
b)
Address register
c)
program counter
d)
stack pointer
17.
__________ is a module that gives control of the CPU to the process selected by the short – term scheduler.
a)
Switching context.
b)
Switching to user mode.
c)
Dispatcher.
d)
Process switch.
18.
The interval from the time of submission of a process to the time of completion is the ________.
a)
Turnaround time.
b)
Waiting time.
c)
Response time.
d)
Throughput.
19.
_____________ is a synchronization tool.
a)
Monitor.
b)
Constant.
c)
Critical region.
d)
Semaphore.
20.
Indefinite blocking of process is known as __________
a)
Deadlock
b)
Starvation
c)
Wait
d)
None of the above
21.
A process is in wait state after requests resources, if the resources are not available at that time which is known as ________.
a)
Deadlock
b)
Deadlock prevention
c)
   Starvation
d)
    Deadlock recovery
22.
     only one process at a time can use the resource is condition is known as __________
a)
    Mutual exclusion
b)
     Hold and wait
c)
  No preemption
d)
Circular wait
23.
  A resource can be released only voluntarily by the process holding it, after that process has completed its task this condition is known as _________
a)
   Mutual exclusion
b)
Hold and wait
c)
     No preemption
d)
  Circular wait
24.
Resource preemption is required to deal with __________ issue need to be addressed
a)
     Rollback
b)
  Starvation
c)
     Selecting a victim
d)
    All the above
25.
The run- time mapping from virtual to physical addresses is done by the __________
a)
    Central Process Unit
b)
     Arithmetic and Logic Unit
c)
    Memory- management unit
d)
Registers