Font size
S
M
L
XL
WorksheetsOS - Practice Test
Total questions: 108
Worksheet time: 54mins
Name
Class
Date
1.
In what way is an operating system like a government?
a)
It seldom functions correctly
b)
It creates an environment within which other programs can do useful work.
c)
It performs most useful functions by itself
d)
It is always concerned primarily with the individual's needs
2.
Which of the following is an example of a systems program?
a)
command interpreter
b)
Web browser
c)
text formatter
d)
database system
3.
A special program, the________, manages the execution of each program in the batch
a)
Monitor
b)
Time-sharing
c)
Distributed system
d)
None
4.
Advantages of distributed systems
a)
Resources Sharing
b)
Reliability
c)
Communications
d)
All the above
5.
A __________ operating system allows the many users to share the computer simultaneously.
a)
Distributed system
b)
Time – shared
c)
Process – shared
d)
Batch
6.
In __________ several jobs are kept in memory at a time.
a)
Multiprogramming
b)
Spooling
c)
Job queue
d)
Multi tasking
7.
All the jobs that enter the system are kept in the _________
a)
queue
b)
job pool
c)
job queue
d)
ready queue
8.
________ need network infrastructure
a)
Time – sharing system
b)
Soft real – time system
c)
Hard real – time system
d)
Distributed system
9.
The computer operator places a ______ of several jobs on an input device
a)
Batch
b)
Pool
c)
Queue
d)
Job queue
10.
load sharing is available in _________
a)
Time – sharing system
b)
Soft real – time system
c)
Hard real – time system
d)
Distributed system
11.
Useful in applications requiring tight response times___________
a)
Time – sharing system
b)
Soft real – time system
c)
Hard real – time system
d)
Real – time system
12.
_________ is a nonvolatile storage device
a)
ROM
b)
RAM
c)
Main memory
d)
Backing storage
13.
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
14.
__________determines which process is to be executed next
a)
standby queue
b)
device queue
c)
ready queue
d)
interrupt queue
15.
__________ is a program in execution, the unit of work in a modern time-sharing system.
a)
Process
b)
Job
c)
Task
d)
State
16.
Process may be in ______ state.
a)
New
b)
Running
c)
Waiting
d)
Any one of the above.
17.
Each process is represented in OS by _________
a)
Program Control Block
b)
Process Central Block
c)
Process Control Block
d)
Program Central Block
18.
Interprocess-communication is best provided by a ________
a)
Message- system
b)
Direct communication
c)
Indirect communication
d)
Shard memory
19.
An IPC facility provides at leas 2 operations_______ and _______
a)
send, receive
b)
send, call
c)
call, receive
d)
none of the above
20.
A Thread is some times called a ___________.
a)
Heavyweight process.
b)
Lightweight process.
c)
Fork system
d)
Multiple process
21.
A __________process produces information that is consumed by a consumer process.
a)
Independent
b)
Cooperating
c)
Producer
d)
Consumer
22.
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.
23.
__________ containing the address of the next instruction that is to be executed
a)
Instruction register
b)
Address register
c)
program counter
d)
stack pointer
24.
The process execution begins with a _________ that is followed by an_________.
a)
I/O burst ,CPU burst.
b)
CPU burst ,I/O burst.
c)
CPU burst, I/O bound.
d)
I/O bound ,CPU burst.
25.
The selection process from ready queue is carried out by the ___________.
a)
long-term scheduler
b)
Short-term scheduler.
c)
Low priority scheduler.
d)
High priority scheduler.
26.
In ___________ once the CPU has been allocated to a process, process keeps the CPU until it releases the CPU.
a)
non preemptive scheduling.
b)
Preemptive scheduling.
c)
Dispatcher .
d)
Priority scheduling.
27.
__________ 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.
28.
One measure of work is the number of processes that are completed per time unit is called ___________
a)
Turnaround time.
b)
Waiting time.
c)
Response time.
d)
Throughput.
29.
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.
30.
____________ is the sum of the periods spent waiting in the ready queue.
a)
Turnaround time.
b)
Waiting time.
c)
Response time.
d)
Throughput.
31.
FCFS stands for ________ algorithm.
a)
First- come First – serving scheduling.
b)
First-come First-served scheduling.
c)
First-come First- serve scheduling.
d)
First-come First – service scheduling.
32.
Gantt chart is used in ___________ scheduling.
a)
FCFS.
b)
SJF
c)
RR.
d)
All the above
33.
A small unit of time is called ______ is generally from 10 to 100 milliseconds in Round – Robin scheduling algorithm
a)
Time quantum.
b)
Transmission time.
c)
Average waiting time.
d)
Burst time.
34.
Process has a segment of code called _______________.
a)
Critical section
b)
Semaphore
c)
Critical region
d)
Monitor
35.
The critical section code is divided into ________ section.
a)
Entry , wait and signal.
b)
Entry , exit and remainder.
c)
Entry, wait and exit.
d)
Entry, wait and remainder.
36.
_____________ is a synchronization tool.
a)
Monitor.
b)
Constant.
c)
Critical region.
d)
Semaphore.
37.
When process executes the wait process can _________ itself.
a)
Resume.
b)
Block.
c)
Suspend.
d)
wakeup
38.
The process is restarted by a ___________ operation.
a)
Exit
b)
Wakeup
c)
Wait
d)
Condition
39.
Indefinite blocking of process is known as __________
a)
Deadlock
b)
Starvation
c)
Wait
d)
None of the above
40.
__________ is describe one fundamental high-level synchronization construct.
a)
Critical section
b)
Condition
c)
Critical region
d)
none of the above
41.
A process must execute _____ before entering the monitor, and must execute _____________ after leaving the monitor.
a)
Wait,Signal
b)
Putdown,Putup
c)
Wait,Putup
d)
Putdown,Signal
42.
A race condition ____.
a)
results when several threads try to access the same data concurrently
b)
results when several threads try to access and modify the same data concurrently
c)
will result only if the outcome of execution does not depend on the order in which instructions are executed
d)
None of the above
43.
A spinlock ____.
a)
is never advantageous
b)
will ultimately result in a context switch when a process must wait on a lock
c)
does not require a context switch when a process must wait on a lock
d)
is useful when locks are expected to be held for long amounts of time
44.
A(n) ___ type presents a set of programmer-defined operations that are provided mutual exclusion within it
a)
Transaction
b)
Signal
c)
Binary
d)
Monitor
45.
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
46.
We can use a ___________ to ensure that the system will never enter a deadlock state.
a)
Protocol
b)
Method
c)
Resource allocation graph
d)
None of the above
47.
_____________ is a set of methods for ensuring that at least one of the necessary conditions cannot hold.
a)
Deadlock detection
b)
Deadlock recovery
c)
Deadlock avoidance
d)
Deadlock prevention
48.
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
49.
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
50.
The resource-allocation _________ is defined by the number of available and allocated resources and the maximum demands of the processes
a)
State
b)
Unsafe state
c)
Safe sequence
d)
None of the above
51.
A ________ Pi - - -> Pj indicates that process Pi may request resource Rj at some time in the future.
a)
Request edge
b)
Assignment edge
c)
Claim edge
d)
None of the above
52.
_____________ is used to a resource allocation system with multiple instances of each resource type.
a)
Resource – allocation graph
b)
Bakery algorithm
c)
Peterson’s algorithm
d)
Banker’s algorithm
53.
The data structures in deadlock detection algorithms that is applicable to a resource- allocation system with multiple instances of each resource type.
a)
Available, Allocation, Max
b)
Available, Allocation, Request
c)
Available, request, max
d)
Available, Allocation, Need.
54.
Resource preemption is required to deal with __________ issue need to be addressed
a)
Rollback
b)
Starvation
c)
Selecting a victim
d)
All the above
55.
An address generated by the CPU is commonly referred to as a ________
a)
Logical address
b)
Physical address
c)
Virtual address
d)
Memory address
56.
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
57.
The value in __________ is added to every address generated by a user process at the time it is sent to memory.
a)
Base - register
b)
Instruction register
c)
Address register
d)
Relocation Register
58.
Swapping requires a __________ is commonly a fast disk.
a)
Register
b)
Backing store
c)
Main memory
d)
Hard disk
59.
A method of swap out a process to backing store, and again swap in to main memory is known as ___________
a)
Swapping
b)
Roll out, roll in
c)
Priority- based scheduling
d)
Round- robin cpu scheduling
60.
The memory is divided in to multiple partition of different size is known as ___________
a)
Single –partition allocation
b)
Multiple – partition allocation
c)
Fixed –sized partition
d)
Variable – sized partition
61.
__________ Allocate the first hole that is big enough, can start at the beginning.
a)
First- fit
b)
Best – Fit
c)
Worst – fit
d)
Dynamic storage allocation
62.
___________ exists when storage is fragmented into a large number of small holes.
a)
External fragmentation
b)
Internal fragmentation.
c)
Compaction
d)
Paging
63.
Process is divided in to some number of ________
a)
Page offset
b)
Pages
c)
Page tables
d)
Frames
64.
If we implement paging we may have some __________
a)
Internal fragmentation
b)
External fragmentation
c)
Page tables
d)
Starvation
65.
The TLB must be __________ to ensure that the next executing process does not use the wrong translation information.
a)
Hit
b)
Flushed
c)
Miss
d)
Replaced
66.
One more bit _________is generally attached to each entry in the page table to trap illegal addresses.
a)
Invalid bit
b)
Valid bit
c)
Valid – Invalid bit
d)
Invalid – valid bit
67.
Only one _________________ is used by all the processes in the system.
a)
Inverted page table
b)
Hierarchy table
c)
Linked list table
d)
Page table
68.
Relocatable code is generated in which type of address binding
a)
Compile time
b)
Runtime
c)
Load time
d)
None of these
69.
Internal fragmentation takes place in _________
a)
paging
b)
Variable partition allocation
c)
Fixed partition allocation
d)
None of these
70.
The effects of thrashing can be limited by using which one of the following
a)
Paging
b)
Global replacement algorithm
c)
Local replacement algorithm
d)
None of these
71.
_______ page replacement algorithm suffers from Belady’s anomaly
a)
LRU
b)
FIFO
c)
Optimal
d)
LRU Approximation
72.
Access to a page marked invalid causes a _________
a)
Page replacement
b)
Page fault
c)
Locality of reference
d)
None of these
73.
_______ is used for performing demand paging
a)
Pager
b)
Swapper
c)
Memory
d)
None of these
74.
In Belady’s anomaly,
a)
Page fault rate increases
b)
Page fault rate decreases
c)
Page fault rate remains constant
d)
None of these
75.
Which of the following page replacement algorithm uses a circular queue
a)
LRU
b)
Second Chance
c)
FIFO
d)
Optimal
76.
Which of the following cannot be used for implementing an LRU page replacement algorithm
a)
Counter
b)
Stack
c)
Program counter
d)
None of these
77.
Demand paging
a)
Fetches a page only when needed
b)
Fetches pages that are likely to be demanded
c)
Pages out when that page frame is needed
d)
Pages out pages in large groups
78.
Dirty bit is used to show the
a)
Page with corrupted data
b)
The page that is modified after loading into cache memory
c)
The wrong page in the memory
d)
Page that is less frequently accessed
79.
High paging activity is known as
a)
Thrashing
b)
Segmentation
c)
Paging
d)
None of these
80.
_________ is a named collection of related information that is recorded on secondary storage
a)
File
b)
Data
c)
Disk
d)
Memory
81.
_______ access method is based on a disk model of a file
a)
Sequential access
b)
Indexed access
c)
Direct access
d)
None of these
82.
which of the following file type is not executable
a)
.com
b)
.exe
c)
.com
d)
.txt
83.
_____ is an abstract data type
a)
File
b)
Directory
c)
Memory
d)
None of these
84.
Associated with each file and directory there is a _______ specifying the users and type of usage
a)
Owner
b)
Group
c)
Access list
d)
None of these
85.
Files attributes are
a)
Name
b)
Type
c)
Location
d)
All of the above
86.
Which directory structure prohibits the sharing of files and directories
a)
Tree structure
b)
Single level
c)
Two level
d)
None of these
87.
A shared file
a)
Is two or more copies of the same file
b)
Only two copies of a file
c)
Allows users to use the original at the same time
d)
None of these
88.
Which of the following is not a directory structure
a)
Two-level
b)
Single-level
c)
Multi-level
d)
Tree-Structured
89.
Transfers between memory and disk are performed a ____.
a)
byte at a time
b)
file at a time
c)
block at a time
d)
sector at a time
90.
Which of the following is the simplest method for implementing a directory?
a)
tree data structure
b)
linear list
c)
hash table
d)
nonlinear list
91.
Which of the following allocation methods ensures that only one access is needed to get a disk block using direct access?
a)
linked allocation
b)
indexed allocation
c)
hashed allocation
d)
contiguous allocation
92.
Which one of the following is not a disk scheduling technique
a)
FCFS
b)
SJF
c)
SCAN
d)
C-SCAN
93.
The SCAN scheduling algorithm is also known as
a)
Scanner algorithm
b)
Reverse algorithm
c)
Elevator algorithm
d)
None of these
94.
The process of dividing a hard disk into tracks and sectors is known as
a)
Physical Formatting
b)
High level formatting
c)
Partitioning
d)
None of these
95.
______ program is used to locate and load the operating system into memory
a)
Bootstrap
b)
Starter
c)
Intializer
d)
None of theses
96.
______ is the time for the disk arm to move the heads to the cylinder containing the desired sector
a)
Access time
b)
Latency time
c)
Seek time
d)
None of these
97.
______ disk scheduling may cause starvation
a)
SSTF
b)
SCAN
c)
LOOK
d)
FCFS
98.
In which disk scheduling does the head move from one end of the disk to other but does not service the requests on the return trip
a)
C-SCAN
b)
SCAN
c)
LOOK
d)
C-LOOK
99.
In a hard disk data is stored on magnetic disks known as
a)
Plates
b)
Cylinders
c)
Platters
d)
Tracks
100.
Hard disks are _______ formatted during manufacturing
a)
High level
b)
Low level
c)
Medium level
d)
None of these
101.
Disk scheduling involves deciding
a)
Which disk should be accessed next
b)
The order in which disk access requests must be serviced
c)
The physical location where files should be accessed in the disk
d)
None of these
102.
The re-recordable CD-RW and DVD-RW are examples of ____ disks.
a)
phase-change
b)
WORM
c)
holographic
d)
magneto-optic
103.
__ is system whose correctness includes its response time as well as its functional correctness.
a)
RTOS
b)
SROS
c)
OS
d)
HROS
104.
__ systems are composed of special purpose software running on hardware dedicated to their critical process.
a)
soft RTOS
b)
Rough RTOS
c)
hard RTOS
d)
None
105.
General computing non real time operating systems are often quite ___
a)
deterministic
b)
static
c)
non-deterministic
d)
none
106.
Industrial control is an example for ___
a)
soft RTOS
b)
hard RTOS
c)
RTOS
d)
None
107.
Hard real time systems are composed of ___
a)
special purpose software
b)
general purpose
c)
special purpose hardware
d)
None
108.
__ is a mertic of system response to an external event.
a)
latency
b)
bandwidth
c)
throughput
d)
interrupt latency
Reset
