Font size
S
M
L
XL
WorksheetsOS Practice Questions
Total questions: 130
Worksheet time: 1hrs 5mins
Name
Class
Date
1.
An ____________ acts as intermediary between a user and the computer.
a)
Operating System
b)
Multiple users
c)
machine language
d)
computer hardware
2.
A type of operating system that will only have a single user at any given time is ______________.
a)
multiuser systems
b)
Single user systems
c)
three user systems
d)
null user systems
3.
An operating system that allows multiple users on different computers or terminals to access a single system is known as ______________.
a)
application systems
b)
Single user systems
c)
multiuser systems
d)
null user systems
4.
A _________________ is the operating system which analyzes your i/p and groups them into batches
a)
Batch operating system
b)
Single user systems
c)
multiuser systems
d)
null user systems
5.
systems that allows multiple users to interact with a computer,an equal time slice to interact with the CPU, at the same time are known as__________.
a)
Batch operating system
b)
Single user systems
c)
application systems
d)
Time sharing systems
6.
In __________, more than one user shares the CPU and the CPU rapidly switches from one user to another, providing a complete transparency from each other.
a)
Batch operating system
b)
Multiprogramming
c)
Multitasking
d)
Multiswitching
7.
In __________, more than one program shares the CPU and the CPU rapidly switches from one program to another.
a)
Batch operating system
b)
Multiprogramming
c)
Multitasking
d)
Multiswitching
8.
The ____________ systems distribute the computation among several physical processors.
a)
Batch operating system
b)
Multiprogramming
c)
Multitasking
d)
Distributed System
9.
SPOOLING stands for ________.
a)
Simultaneous Peripheral Operations Online
b)
Similar Peripheral Operations Online
c)
Simultaneous Periodical Operations Online
d)
Simultaneous Peripheral Operations Offline
10.
A process in which data is temporarily held to be used and executed by a device, program, or system is known as ____________.
a)
SPOOLING
b)
CALLING
c)
FETCHING
d)
READING
11.
Which amongst the following is a function of OS?
a)
Providing app suggestions
b)
Process Management
c)
Providing graphics support
d)
Provides storage space
12.
Which amongst the following is NOT a function of OS?
a)
Process Management
b)
Memory Management
c)
Storage Management
d)
Category Management
13.
Process is a ________ in execution
a)
Program
b)
application
c)
computer
d)
machine
14.
A program is a ___________ entity.
a)
fast
b)
odd
c)
active
d)
passive
15.
A process is a _______ entity.
a)
fast
b)
active
c)
odd
d)
passive
16.
The state in which the process is being created is known as ________.
a)
New
b)
Ready
c)
Running
d)
Waiting
17.
The state in which the instructions are being executed is known as ________.
a)
New
b)
Ready
c)
Running
d)
Waiting
18.
Short-term scheduler is also known as ____________________.
a)
long term scheduler
b)
CPU scheduler
c)
job scheduler
d)
medium term scheduler
19.
Long-term scheduler is also known as ____________________.
a)
short term scheduler
b)
CPU scheduler
c)
job scheduler
d)
medium term scheduler
20.
Switching the CPU from one process to another is known as ___________.
a)
short term scheduler
b)
CPU scheduler
c)
job scheduler
d)
context switching
21.
A process which cannot affect or be affected by the execution of another process is known as ____________.
a)
Cooperating Process
b)
Indirect Process
c)
Constant Process
d)
Independent Process
22.
A process which can affect or be affected by the execution of another process is known as ____________.
a)
Cooperating Process
b)
Indirect Process
c)
Constant Process
d)
Independent Process
23.
IPC stands for ______________.
a)
Inter Process Communication
b)
Intra Process Communication
c)
Inter Program Computation
d)
Inter Process Computation
24.
A mechanism for processes to communicate and to synchronize their actions.
a)
Inter Process Communication
b)
Direct Messaging
c)
Intra System Communication
d)
Independent Process Communication
25.
A process splits into number of smaller tasks, each small task is said to be light weight process or__________.
a)
Program
b)
Thread
c)
Printer
d)
IPC
26.
Threads whose management is done by the user-level thread library are known as __________.
a)
Kernel Threads
b)
Program threads
c)
User Threads
d)
Function Threads
27.
The _______ are scheduled by the kernel’s scheduler and execute on the CPU.
a)
Kernel Threads
b)
Program threads
c)
User Threads
d)
Function Threads
28.
Many user-level threads mapped to single kernel thread in ___________ Model.
a)
Many-to-One
b)
One-to-one
c)
Many-to-Many
d)
All-to-one
29.
Many user-level threads mapped to many kernel thread in ___________ Model.
a)
Many-to-One
b)
One-to-one
c)
Many-to-Many
d)
All-to-one
30.
One user-level thread maps only to one kernel thread in ___________ Model.
a)
Many-to-One
b)
One-to-one
c)
Many-to-Many
d)
All-to-one
31.
Number of processes that complete their execution per time unit is known as ___________.
a)
Throughput
b)
Waiting Time
c)
Response Time
d)
Turnaround Time
32.
Amount of time a process has been waiting in the ready queue is known as _______________.
a)
Throughput
b)
Turnaround Time
c)
Waiting time
d)
Response Time
33.
The difference between time of submission of a process and the time the first response occurs.
a)
Throughput
b)
Turnaround Time
c)
Waiting time
d)
Response Time
34.
The _____________ are used by the scheduler to decide which of the processes in the ready queue (i.e. memory) is to be allocated to the CPU.
a)
Process Manager
b)
Scheduling Algorithms
c)
Swapping Algorithm
d)
Message Transmitter
35.
Which amongst the following is NOT a CPU Scheduling algorithm?
a)
First-Come, First-Served (FCFS) scheduling
b)
Shortest-Job-First (SJF) scheduling
c)
Priority scheduling
d)
Disk Scheduling
36.
The disadvantage of FCFS scheduling algorithm is _____________.
a)
indefinite blocking
b)
Convoy effect
c)
Aging
d)
starvation
37.
FCFS Stands for ____________.
a)
First Come First-Served
b)
First Call From Sender
c)
First Class First Served
d)
First on First Server
38.
In the_______ scheduling algorithm, the process that requests the CPU first is allocated the CPU first.
a)
First-Come, First-Served (FCFS) scheduling
b)
Shortest-Job-First (SJF) scheduling
c)
Priority scheduling
d)
Disk Scheduling
39.
SJF Stands for __________.
a)
Second Job First
b)
Second Job in Front
c)
Shortest Job First
d)
Shortest Job Filled
40.
In ________ scheduling the CPU is assigned to the process that has the smallest next CPU burst.
a)
First-Come, First-Served (FCFS) scheduling
b)
Shortest-Job-First (SJF) scheduling
c)
Priority scheduling
d)
Round Robin Scheduling
41.
In ________ scheduling the CPU is allocated to the process with the highest priority
a)
First-Come, First-Served (FCFS) scheduling
b)
Shortest-Job-First (SJF) scheduling
c)
Priority scheduling
d)
Round Robin Scheduling
42.
In Priority scheduling, smallest priority number represents the _______ priority
a)
highest
b)
lowest
c)
equal
d)
random
43.
The disadvantage of Priority scheduling algorithm is _____________.
a)
Short process
b)
Convoy effect
c)
Aging
d)
starvation
44.
A technique of gradually increasing the priority of processes that are waiting for the CPU for a very long time.
a)
Short process
b)
Convoy effect
c)
Aging
d)
starvation
45.
In ________ scheduling each process gets a small unit of CPU time called time quantum(or time slice).
a)
First-Come, First-Served (FCFS) scheduling
b)
Shortest-Job-First (SJF) scheduling
c)
Priority scheduling
d)
Round Robin Scheduling
46.
In ________ scheduling a processor is appointed as the scheduler for the other processors.
a)
Multiple-Processor Scheduling
b)
Shortest-Job-First (SJF) scheduling
c)
Priority scheduling
d)
Round Robin Scheduling
47.
A ___________ is a part of program that accesses a shared resources that must not be concurrently accessed by more than one process of execution.
a)
entry Section
b)
critical section
c)
exit section
d)
remainder section
48.
The section of code implementing the request to critical section is the___________ section.
a)
entry section
b)
semaphore
c)
Shared data
d)
semaphore
49.
A ____________ is a protected integer variable that can facilitate and restrict access to shared resources
a)
entry section
b)
semaphore
c)
Shared data
d)
semaphore
50.
The two most common kinds of semaphores are __________ and __________.
a)
counting semaphores and reading semaphores
b)
static semaphores and binary semaphores
c)
counting semaphores and binary semaphores
d)
static semaphores and reading semaphores
51.
A binary semaphore is a semaphore with an integer value between __ and ___.
a)
0 and 1
b)
0 and 5
c)
1 and 2
d)
0 and 9
52.
Which amongst the following is NOT a Classical examples of Synchronization?
a)
Bounded-Buffer Problem
b)
Readers and Writers Problem
c)
Dining-Philosophers Problem
d)
Bridge Crossing Problem
53.
Bounded Buffer Problem is also known as ___________.
a)
producer-consumer problem
b)
Readers and Writers Problem
c)
Dining-Philosophers Problem
d)
Bridge Crossing Problem
54.
What are the two types of processes in Bounded Buffer Problem?
a)
Reader and Writer
b)
Producer and Consumer
c)
Philosopher and Thinker
d)
Bound and Buffer
55.
What are the two types of processes in Readers-Writers Problem?
a)
Bound and Buffer
b)
Producer and Consumer
c)
Reader and Writer
d)
Philosopher and Thinker
56.
In dining philosophers algorithm, the bowl of rice represents the ___________.
a)
entry section
b)
semaphore
c)
Shared data
d)
semaphore
57.
In dining philosophers algorithm, the chopsticks represents the ___________.
a)
entry section
b)
semaphore
c)
Shared data
d)
semaphore
58.
In dining philosophers algorithm, the philosophers represents the ___________.
a)
processes
b)
semaphore
c)
Shared data
d)
semaphore
59.
A synchronization construct that were created to overcome the problems caused by semaphores such as timing errors.
a)
processes
b)
constructors
c)
threads
d)
monitors
60.
Only one process at a time can use a resource.
a)
Mutual exclusion
b)
Hold and wait
c)
No pre-emption
d)
Circular wait
61.
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 pre-emption
d)
Circular wait
62.
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 pre-emption
d)
Circular wait
63.
Deadlocks can be described in term of directed graph called _________.
a)
WAITING GRAPH
b)
RUNNING GRAPH
c)
SCHEDULER GRAPH
d)
SYSTEM RESOURCE-ALLOCATION GRAPH
64.
Which amongst the following is NOT a deadlock handling method?
a)
Deadlock Prevention
b)
Recovery from deadlock
c)
Deadlock avoidance
d)
Deadlock Erasing
65.
Dead Lock prevention
a)
Preventing at least one condition that causes deadlock
b)
Preventing all the four conditions together, that causes deadlock
c)
Deleting the resourses that causes deadlock
d)
Deleting the processes that causes deadlock
66.
Circular wait can be prevented by
a)
Each process should request the resource in the ascending order of it's number.
b)
Every process that causes circle are deleted
c)
Every resources in the circle are deleted
d)
Every process that causes circle are restarted
67.
The _______ dynamically examines the resource-allocation state to ensure that there can never be a circular-wait condition.
a)
resource-sharing algorithm
b)
deadlock-avoidance algorithm
c)
process-scheduling algorithm
d)
data-analysis algorithm
68.
A state in which the system can allocate resources to each process (up to its maximum) in some order and still avoid a deadlock.
a)
Perfect State
b)
Unsafe State
c)
Safe State
d)
Lock State
69.
There is a possibility for deadlock in ______ state
a)
Perfect State
b)
Unsafe State
c)
Safe State
d)
Lock State
70.
An algorithm examines the state of the system to determine whether a deadlock has occurred.
a)
Deadlock Prevention
b)
Deadlock Avoidance
c)
Deadlock Detection
d)
Deadlock Erasing
71.
Terminate one or more processes involved in the deadlock.
a)
Process Termination
b)
Deadlock Avoidance
c)
Deadlock Prevention
d)
Resource Pre-emption
72.
Pre-empt resources that causes deadlock
a)
Process Termination
b)
Deadlock Avoidance
c)
Deadlock Prevention
d)
Resource Pre-emption
73.
An address generated by the CPU is referred to as _____________.
a)
logical address
b)
Physical address
c)
logical area
d)
physical area
74.
An address generated by the memory unit is referred to as a ________________.
a)
logical address
b)
logical area
c)
physical address
d)
physical area
75.
The ___________ is a process of shifting the programs from main memory to secondary memory & secondary memory to main memory
a)
Swapping
b)
changing
c)
framing
d)
shifting
76.
The ___________is a fast disk large enough to accommodate copies of all memory images for all users
a)
Scheduler
b)
Backing Store
c)
Dispatcher
d)
Deadlock
77.
A classical memory allocation model where, a system assigns consecutive memory blocks to a process.
a)
Scattered Memory Allocation
b)
Equal Memory Allocation
c)
Proportional Memory Allocation
d)
Contiguous Memory Allocation
78.
Fragmentation in which there is enough total memory space to satisfy a request, but the available spaces are not contiguous.
a)
Internal Fragmentation
b)
External Fragmentation
c)
Total Fragmentation
d)
Linear Fragmentation
79.
Fragmentation in which the allocated memory may be slightly larger than requested memory.
a)
Internal Fragmentation
b)
External Fragmentation
c)
Total Fragmentation
d)
Linear Fragmentation
80.
Solution for External Fragmentation.
a)
Process Termination
b)
Resource Pre-emption
c)
Compaction
d)
Indefinite Blocking
81.
In Paging, logical memory is broken into blocks of the same size called ______.
a)
frames
b)
schedulers
c)
sheets
d)
pages
82.
In Paging, physical memory is broken into blocks of the same size called ______.
a)
frames
b)
schedulers
c)
sheets
d)
pages
83.
A _______ is used as an index into a page table which contains base address of each page in physical memory.
a)
frames
b)
page number
c)
page offset
d)
frame address
84.
In segmentation a program is a collection of _______.
a)
frames
b)
page number
c)
segments
d)
pages
85.
A_______ contains base address of each segment in physical memory and a limit address of segment.
a)
Segment table
b)
Page Table
c)
Fault Table
d)
page number
86.
In 'Segmentation with Paging', each process has
a)
one segment table and several page tables
b)
one segment table and one page table
c)
several segment tables and one page table
d)
five segment table and one page table
87.
A __________ system is similar to a paging system with swapping.
a)
segmentation
b)
swapping
c)
deadlock
d)
demand-paging
88.
A _________ never swaps a page into memory unless that page will be needed.
a)
active swapper
b)
lazy swapper
c)
full swapper
d)
cpu scheduler
89.
A ________bit indicates that the associated pages is both legal and in memory.
a)
invalid
b)
full
c)
valid
d)
null
90.
A ________bit indicates that the page either is not valid or is valid but is currently on the disk.
a)
invalid
b)
full
c)
valid
d)
null
91.
When the page (data) requested by a program is not available in the main memory, it is called a ___________.
a)
program fault
b)
page fault
c)
process reset
d)
process fault
92.
When total memory requirements exceed the physical memory, then it may be necessary to replace pages from memory to free frames for new pages. This is known as ______.
a)
program reset
b)
page fault
c)
page replacement
d)
process termination
93.
The techniques using which the OS decides which memory pages to swap out, for page replacement, are known as ______.
a)
Page resetting algorithms
b)
Page creation algorithms
c)
Demanding algorithms
d)
Page replacement algorithms
94.
In an ideal replacement algorithm, as the number of available frames increases, the number of page faults should _______.
a)
decrease
b)
increase
c)
remain the same
d)
double
95.
In page replacement, FIFO stands for?
a)
Free Input Frame Output
b)
First In First Out
c)
First Input Frame Output
d)
Frame In Frame Out
96.
In FIFO replacement, _________ page is chosen for replacement.
a)
Newest Page
b)
Partially Executed Page
c)
Oldest Page
d)
Random Page
97.
Disadvantage of FIFO page replacement?
a)
Convoy effect
b)
Starvation
c)
Indefinite blocking
d)
Belady's anomaly
98.
The __________ algorithm has the lowest page-fault rate of all algorithms.
a)
optimal page-replacement
b)
FIFO page replacement
c)
LRU page replacement
d)
FCFS algorithm
99.
The high paging activity in which the processor will spend the most of the time in swapping the pages in and out than executing.
a)
Thrashing
b)
Termination
c)
Resource Pre-emption
d)
Deadlock
100.
As a result of thrashing the page fault rate will________.
a)
decrease
b)
increase
c)
remain the same
d)
become zero
101.
Solution for thrashing?
a)
using local replacement algorithm
b)
using global replacement algorithm
c)
restarting the process
d)
process termination
102.
A _____ is a named collection of related information that is recorded on secondary storage such as magnetic disks, magnetic tapes and optical disks.
a)
page
b)
frame
c)
file
d)
memory
103.
Which amongst the following is NOT an attribute of a file?
a)
Name
b)
Identifier
c)
Type
d)
State
104.
Which amongst the following is NOT a file access method?
a)
Sequential Access
b)
Straight Access
c)
Direct Access
d)
Indexed (Other) Access
105.
In _______ access, information in the file is accessed in order, one record after the other.
a)
Sequential Access
b)
Straight Access
c)
Direct Access
d)
Indexed (Other) Access
106.
In a ________ directory system, all the files are placed in one directory.
a)
tree-structured
b)
single-level
c)
two-level
d)
acyclic
107.
In the ______ directory structure, each user has its own user file directory (UFD).
a)
tree-structured
b)
single-level
c)
two-level
d)
acyclic
108.
The ______ directory structure allows users to create their own subdirectories and to organize their files accordingly
a)
tree-structured
b)
single-level
c)
two-level
d)
Multi-level
109.
The ______ directory structure is an extension of the tree-structured directory structure, which allows directories to share subdirectories and files.
a)
tree-structured
b)
single-level
c)
two-level
d)
acyclic
110.
Which amongst the following NOT a file allocation method?
a)
Contiguous allocation
b)
Linked allocation
c)
Indexed allocation
d)
Dynamic allocation
111.
In _________ allocation, each file occupies a set of contiguous blocks on the disk.
a)
Contiguous allocation
b)
Linked allocation
c)
Indexed allocation
d)
Dynamic allocation
112.
In _________ allocation, each file is a linked list of disk blocks.
a)
Contiguous allocation
b)
Linked allocation
c)
Indexed allocation
d)
Dynamic allocation
113.
In _________ allocation, each file has its own index block, which is an array of disk sector of addresses.
a)
Contiguous allocation
b)
Linked allocation
c)
Indexed allocation
d)
Dynamic allocation
114.
In Bit vector approach of free space management, each free block is represented using ___.
a)
0
b)
1
c)
2
d)
3
115.
The free space management approach in which all the free disk blocks are linked together.
a)
Bit Vector
b)
Grouping
c)
Counting
d)
Linked List
116.
The rate at which data flow between drive and computer.
a)
Transfer Rate
b)
Seek Rate
c)
Positioning Rate
d)
Punching Rate
117.
The disk attachment method in which the storage made available over a network rather than over a local connection
a)
Host-Attached
b)
Network-Attached
c)
Via I/O Ports
d)
Direct Attached
118.
The __________ is the time for the disk arm to move the heads to the cylinder containing the desired sector.
a)
rotational latency
b)
disk bandwidth
c)
seek time
d)
disk sector
119.
Which amongst the following NOT a disk scheduling algorithm?
a)
FCFS
b)
SSTF
c)
SCAN
d)
STSF
120.
In disk scheduling, FCFS stands for ______________.
a)
First Come First Served
b)
Shortest Seek Time First
c)
First Created First Called
d)
First on First Server
121.
In disk scheduling, SSTF stands for ______________.
a)
First Come First Served
b)
Shortest Seek Time First
c)
Shortest Segment Table First
d)
Segment Served Time Frame
122.
SCAN disk scheduling is also known as ____________.
a)
Flight Algorithms
b)
Sequential Algorithms
c)
Elevator Algorithms
d)
Indirect Algorithm
123.
Version of C-SCAN in which arm only goes as far as the last request in each direction, then reverses direction immediately, without going all the way to the end of the disk.
a)
FCFS
b)
SSTF
c)
SCAN
d)
C-LOOK
124.
The bootstrap is stored in _______.
a)
ROM
b)
Memory Card
c)
RAM
d)
CD/DVD
125.
MBR Stands for ________.
a)
Main Boot Record
b)
Master Boot Record
c)
Master Boot Reserve
d)
Main Boot Reserve
126.
RAID stands for ___________.
a)
Reserved array of independent disks
b)
Redundant access of independent disks
c)
Redundant array of independent disks
d)
Reserved access of independent disks
127.
A ___________ is a computer system that requires not only that thecomputing results be "correct" but also that the results be produced withina specified deadline period.
a)
distributed system
b)
batch operating system
c)
paging system
d)
real-time system
128.
RTOS stands for _______________________.
a)
Real time operating system
b)
Rotational time operating system
c)
Real time offset system
d)
Right time operating system
129.
Which amongst the following is NOT a characteristic of RTOS?
a)
Reliability
b)
Huge Size
c)
Scalability
d)
Predictability
130.
Which amongst the following is a type of RTOS?
a)
Mixed Real Time Systems
b)
Flexible Real Time Systems
c)
Hard Real Time Systems
d)
Main Real Time Systems
Reset
