Sr. No.

Unit Question Statement Options

A B C D Correct
Answer
1 1 Multiprogramming of computer system increases memory storage CPU utilization cost of
computation
C
2 1 Multiprocessor system have advantage of Increased Expensive Operating both and b
Throughput Hardware System A
3 1 Process is Program in Contents of A program in A job in
high level Main memory execution secondary
language kept memory
on disk
C
4 1 Which of the following is false statement Running: Ready: Waiting Blocked: New: New
currently to be suspended, not process is
executing on scheduled, ready to run. waiting
CPU ready to run Process is
but not yet run/ waiting for some
the process is event to occur
waiting to be (such as I/O
assigned to the completion)
processor

D
5 1 The number of processes completed per unit time is known as Output Throughput Efficiency capacity
__________ B
6 1 Which of the following is not the state of a process? Running Old waiting new B
7 1 The state of a process is defined by: The current the final activity the activity just the activity to
activity of the of the process executed by the next be executed
process process by the process
A
8 1 A single thread of control allows the process to perform: Only one task Multiple tasks Only two tasks at All the above
at a time at a time a time A
9 1 Process Control Block contains which of the following list of open Process states Process number all the above
files D
10 1 The address of the next instruction to be executed for the CPU register Program Process State Process number
current process is stored in counter B
11 1 Most operating system (including UNIX and windows) identify Program Process state Process number Process identifier
processes according to unique ………………. counter D
12 1 When a process creates a new process, two possibilities for 1 and 2 2 and 3 2 and 4 1 and 3
execution exist 1. The parent continues to execute
concurrently with its children 2. the parent stop to execute
concurrently with its children 3. the parent waits until some or
all of its children have terminates 4.the parent do not wait until
some or all of its children have terminated
D
13 1 The new process consists of copy of the …………. of the address space Process state Process number Process identifier
original process. This mechanism allows the parent process to
communicate easily with its child process A
14 1 Both processes (parent and child) continue execution at the Negative zero, negative nonzero inteer, zero, non zero
instruction after the fork(), with one difference: the return code integer, zero integer zero integer
for the fork() is …………… for the new (child) process,
whereas the ………… process identifier of the child is returned
to the parent
D
15 1 Creating a separate process using the UNIX…… system call fork init exec wait
A
16 1 After a fork() system call, one of the two processes typically exit init exec wait
uses the ……………system call to replace the processes
memory space with a new program C
17 1 The parent can create more children or if it has nothing else to exit init exec wait
do while the child runs, it can issue a ……………..system call
to move itself off the ready queue until the termination of the
child
D
18 1 A process terminates when it finishes executing its final exit init exec wait
statement and asks the operating system to delete it by using
the …………….system call A
19 1 A parent may terminate the execution of one of its children for 1 only 1 and 2 2 and 3 All the above
a variety of reasons, which of the following is true. 1. The child
has exceeded its usage of some of the resources that it has
been allocated 2. The task assigned to child is no longer
required 3. The parent is exiting, and the operating system
does not allow a child to continue if its parent terminates

D
20 1 ……. is a process that has completed execution (via the exit Zombie Orphans Terminated all the above
system call) but still has an entry in the process table A
21 1 When a program is loaded into the memory and it becomes a 1 1, 2 1,2,3 1,2,3,4
process, it can be divided into which of the sections. 1. stack 2.
Heap 3. Code 4. Data D
22 1 ………………………… section is dynamically allocated stack Heap Code Data
memory to a process during its run time B
23 1 A process generally also includes the process……………….., code section Program Stack Data section
which contains temorary data (sucha ss funciton parameters, counter
return addresses, and local variables)
C
24 1 A process generally also includes the process…………………. code section Program Stack Data section
which contains global variables counter D
25 1 POSIX API: a standard set of system calls that an OS must 1 0- A
implement
26 1 Waiting time is : the total time the total time the total time the total time
in the blocked spent in the spent in the from the
and waiting ready queue running queue completion till the
queues submission of a
process
B
27 1 Round robin scheduling falls under the category of : Non Preemptive None of these -
preemptive scheduling
scheduling
28 1 With round robin scheduling algorithm in a time shared using very using very using extremely using very small
system, large time small time small time slices time slices
slices converts slices converts increases converts it into
it into First it into First performance Shortest Job
come First come First First algorithm
served served
scheduling scheduling
algorithm algorithm

A
29 1 The portion of the process scheduler in an operating system assigning assigning assigning All of these
that dispatches processes is concerned with ready ready running
processes to processes to processes to
CPU waiting queue blocked queue
A
30 1 The executable (exe) of the program contains the ________ Instructions software and function calls and registers and
that the CPU can understand, and the __________ of the and the data compiler object code byte code
program. (variables) A
31 1 An OS serves the following goals: Abstraction, Virtualization,C Execution,Mappi All of the Above
Inheritence,En oncurrency,Per ng,Calling
capsulation sistence B
32 1 A process switches to kernel mode when one of the following Interrupts Traps System calls. All of the above
happens. D
33 1 To run an executable program CPU perform following steps Fetch,Load,De Run,Call, Add,Return,Call, None of the
code,Execute, Load,Store,Exe Decode above
Store cute A
34 1 In a multicore system traps and system calls spread across handled by any handled on the handled by
cores to load core core that they coprocessor
balance. occur.
C
35 1 The context of this process is saved, the scheduler finds a new Context Interrupt Process Process
process to run, the context of the new process is loaded, and Switch Handling Scheduling synchronization
execution of the new process begins where it left off this
mechanism is called as
A
36 1 In ----- mode kernel runs on behalf of user Kernel User real All A
37 1 For reading input which of the following system call is used? rd Write Change Read D
38 1 Multiprogramming means........... more than one more than one one process at a one thread in
process in thread ready to time in main main memory
main memory execute. memory which which are ready
which are are ready to to execute.
ready to execute.
execute.

A
39 1 Which of the following are three basic states of Process Ready, Ready, ending, Ready, running, execute, running,
running, block block unblock block
A
40 1 Which of the following is one of a state of process? Block Unblock halt begin A
41 1 Which of the following is one of basic state of a process Ready Unblock Halt Begin A
42 1 Procss control block contains Process identifier 1 0- A
43 1 Process control block contains process state 1 FLASE - A
44 1 API is ................ Application Application Application Advanced
Programing Processor Programing Programing
interface interface interaction interface A
45 1 Program can execute in two modes of operations •User mode 1 0- A
and Kernel mode.
46 1 Terminated processes are not removed instantly from list is Orphan Zombie Blocked Parent
known as B
47 1 IDT is................ Interrupt Interrupt Define Interrupt Inner Descriptor
Descriptor table Descriptor task table
table A
48 1 A function call translates to a jump instruction 1 0- A
49 1 A process can run ..........to load another executable to its exec() fork() wait() kill()
memory image A
50 2 Which module gives control of the CPU to the process dispatcher interrupt scheduler none of the
selected by the short-term scheduler mentioned A
51 2 The processes that are residing in main memory and are ready job queue ready queue execution queue process queue
and waiting to execute are kept on a list called: B
52 2 The interval from the time of submission of a process to the waiting time turnaround response time throughput
time of completion is termed as: time B
53 2 Which scheduling algorithm allocates the CPU first to the first-come, shortest job priority none of the
process that requests the CPU first first-served scheduling scheduling mentioned
scheduling A
54 2 In priority scheduling algorithm CPU is CPU is equal priority none of the
allocated to allocated to the processes can mentioned
the process process with not be scheduled
with highest lowest priority
priority
A
55 2 In priority scheduling algorithm, when a process arrives at the all process currently parent process init process
ready queue, its priority is compared with the priority of running
process B
56 2 Time quantum is defined in: shortest job round robin priority multilevel queue
scheduling scheduling scheduling scheduling
algorithm algorithm algorithm algorithm B
57 2 Process are classified into different groups in shortest job round robin priority multilevel queue
scheduling scheduling scheduling scheduling
algorithm algorithm algorithm algorithm D
58 2 In multilevel feedback scheduling algorithm: a process can classification of processes are none of the
move to a ready queue is not classified into mentioned
different permanent groups
classified
ready queue
A
59 2 CPU scheduling is the basis of ____________. multiprocessor multiprogrammi larger memory None of these
systems ng operating sized systems
systems B
60 2 With multiprogramming, ______ is used productively. time space money All of these A
61 2 The two steps of a process execution are I/O Burst, CPU CPU Burst Memory Burst OS Burst
Burst A
62 2 An I/O bound program will typically have : a few very many very many very short a few very short
short CPU short I/O bursts CPU bursts I/O bursts
bursts C
63 2 The switching of the CPU from one process or thread to process switch task switch context switch all of the above
another is called : D
64 2 Dispatch latency is the speed of the time of the time to stop None of these
dispatching a dispatching a one process and
process from process from start running
running to the running to another one
ready state ready state and
keeping the
CPU idle
C
65 2 Scheduling is done so as to : increase CPU decrease CPU keep the CPU None of these
utilization utilization more idle
A
66 2 Scheduling is done so as to : increase the decrease the increase the None of these
throughput throughput duration of a
specific amount
of work
A
67 2 Turnaround time is : the total the total time the total time the total time
waiting time spent in the spent in the from the
for a process ready queue running queue completion till the
to finish submission of a
execution process

D
68 2 Scheduling is done so as to : increase the decrease the keep the there is no
turnaround turnaround turnaround time relation between
time time same scheduling and
turnaround time
B
69 2 Response time is : the total time the total time the total time None of these
taken from the taken from the taken from
submission submission submission time
time till the time till the first till the response
completion response is is output
time produced

B
70 2 Round robin scheduling falls under the category of : Non Preemptive None of these -
preemptive scheduling
scheduling
71 2 The portion of the process scheduler in an operating system assigning assigning assigning All of these
that dispatches processes is concerned with : ready ready running
processes to processes to processes to
CPU waiting queue blocked queue
A
72 2 The strategy of making processes that are logically runnable to Non Preemptive Shortest job first First come First
be temporarily suspended is called ____________ preemptive scheduling served
scheduling B
73 2 What is Scheduling? allowing a job making proper all of the none of the
to use the use of mentioned mentioned
processor processor A
74 2 Most modern kernels are Non preemptible Both preemptible None of the
preemptible and Non above
preemptible
B
75 2 O(1) Scheduler, the Completely Fair Scheduler (CFS) and BF Apple Mac Linux Windows XP All of the above
Scheduler (BFS) are the examples of processor scheduling Operating Operating Operating
algorithm in Systems Systems Systems B
76 2 The binding and unbinding of a process or a thread to a CPU Cache affinity Processor CPU pinning All of the above
or a range of CPUs, so that the process or thread will execute affinity
only on the designated CPU or CPUs rather than any CPU is
called as
D
77 2 In Multi Level Queue scheduling Batch Interactive Each queue has Both B and C
processes processes priority over
have high have high lower priority
priority over priority over queue.
Interactive batch
processes processes
D
78 2 In MLFQ scheduling Priority of a Priority of a job - A
job varies is decided
based on its based on the
observed type of job
behaviour

79 2 In MLFQ scheduling If Priority of job (A) = Priority of job (B) job A runs job A & job B job B runs before job A and job B
then before job B run in round- job A both are
robin fashion suspended
using the time
slice (quantum
length) of the
given queue.

B
80 2 The Solution for the Starvation of the process is The Priority The Priority The Priority None of the
Inversion Checking Boost above C
81 2 A situation where many processes, who need to use a Processor Convoy Effect Priority Inversion Starvation
resource for short time are blocked by one process holding Affinity
that resource for a long time is called as B
82 2 Assume A arrives at t = 0 and needs to run for 100 seconds 103.33 110 seconds 60 seconds 50 seconds
whereas B and C arrive at t = 10 and each need to run for 10 seconds
seconds, average turnaround time using preemptive SJF or
Shortest Time-to-Completion First (STCF) is
D
83 2 In which scheduling algorithm Starvation will never occur Round Robin Shortest Job First Come First Multi Level Feed
because each process will be scheduled for a fixed time slice First Serve Back Queue
or time quantum. A
84 2 Consider the following Process details Process Arrival Time Average Average Average Average
Burst Time P1 0 53 P2 0 17 P3 0 68 P4 0 24 In MLFQ Three TAT=125.7 TAT=114.25 TAT=120.4 TAT=130
Queues •Priority of Queues are : •Q1 : Highest Priority •Q2: Average Average Average Average
•Q3 :Lowest Priority •Q1 Uses RR (TQ=17) •Q2 Uses RR WT=74.86 WT=73.75 WT=77.45 WT=78.10
(TQ=25) •Q3 uses FCFS Average TAT and WT calculated as
follows
B
85 2 Interactive processes have ....... priority over batch processes High Low Same no
A
86 2 CPU bound processes are those processes which require 1 0- A
most of time on CPU
87 2 I/O bound processes are those processes which require most 1 0- A
of time on I/O devices.
88 2 The next process can run only when a process completes its Non- Preemptive Circular Long
execution is called as..... Preemptive Scheduling Scheduling Scheduling
Scheduling A
89 2 Scheduling Policy is the piece of code which decides which 1 0- A
process to run next.
90 2 CPU burst is the CPU time used by a process in a continuous 1 0- A
stretch
91 2 Waiting Time is the Time spend by a process in ready state 1 0- A
waiting for CPU
92 2 Arrival Time is the time when process enters in ready state. 1 0- A
93 2 Exit time is when process completes its execution and exit 1 0- A
from system
94 2 We can change process arrival time and process burst time 1 0- B
95 2 Turnaround time is equal to Time Time Arrival time - Arrival time - wait
Completion – Completion – Time Completion time
time arrival wait time A
96 2 Three processes arrive at t=0 in the order A,B, C. A = 10 CPU Process A Process B Process C -
burst B = 15 CPU burst C = 5 CPU burst. As per SJF
(Preemtive) which process will scheduled first
97 2 Three processes arrive at t=0 in the order A,B,C A = 10 CPU 10 sec 20sec 30 sec -
burst B = 15 CPU burst C = 5 CPU burst. Find Avg.
Turnaround time
98 2 What is Convoy Effect? Convoy Effect Convoy Effect - A
is a situation is a situation
where many where many
processes, processes, who
who need to need to use a
use a resource resource for
for short time short time are
are blocked by not blocked by
one process one process
holding that holding that
resource for a resource for a
long time. long time
99 3 CPU fetches the instruction from memory according to the program status register instruction program status
value of ____________ counter register word A
100 3 A memory buffer used to accommodate a speed differential is stack pointer cache accumulator disk buffer
called ____________ B
101 3 Which one of the following is the address generated by CPU? physical absolute logical address none of the
address address mentioned C
102 3 Run time mapping from virtual to physical address is done by Memory CPU PCI None of the
____________ management mentioned
unit A
103 3 Memory management technique in which system stores and fragmentation paging mapping none of the
retrieves data from secondary storage for use in main memory mentioned
is called? B
104 3 The address of a page table in memory is pointed by stack pointer page table page register program counter
____________ base register B
105 3 Program always deals with ____________ logical absolute physical address relative address
address address A
106 3 What is Coalescing? a joining a paging a technique for a technique for
technique of technique overcoming overcoming fatal
blocks for external error
overcoming fragmentation
internal
fragmentation
A
107 3 What is compaction? a technique a paging a technique for a technique for
for overcoming technique overcoming overcoming fatal
internal external error
fragmentation fragmentation
C
108 3 The main memory accommodates ____________ Operating CPU processes a) & c)
System D
109 3 In contiguous memory allocation ____________ each process all processes the memory none of the
is contained in are contained space is mentioned
a single in a single contiguous
contiguous contiguous
section of section of
memory memory

A
110 3 With relocation and limit registers, each logical address must less than equal to greater than none of the
be _______ the limit register. mentioned A
111 3 The operating system and the other processes are protected they are in they are in they have a every address
from being modified by an already running process because different different logical protection generated by the
____________ memory addresses algorithm CPU is being
spaces checked against
the relocation
and limit
registers
D
112 3 In internal fragmentation, memory is internal to a partition and is being used is not being is always used none of the
____________ used mentioned B
113 3 A solution to the problem of external fragmentation is compaction larger memory smaller memory none of the
____________ space space mentioned
A
114 3 __________ is generally faster than _________ and first fit, best fit, best fit, first fit, worst fit, best fit, none of the
_________ worst fit worst fit first fit mentioned A
115 3 External fragmentation exists when? enough total the total a request cannot none of the
memory exists memory is be satisfied even mentioned
to satisfy a insufficient to when the total
request but it satisfy a memory is free
is not request
contiguous

A
116 3 The offset ‘d’ of the logical address must be ____________ greater than between 0 and between 0 and greater than the
segment limit segment limit the segment segment number
number B
117 3 The segment limit contains the ____________ starting logical starting segment length none of the
address of the physical mentioned
process address of the
segment in
memory
C
118 3 The segment base contains the ____________ starting logical starting segment length none of the
address of the physical mentioned
process address of the
segment in
memory
B
119 3 Each entry in a segment table has a ____________ segment base segment peak segment value none of the
mentioned A
120 3 If a page number is not found in the TLB, then it is known as a TLB miss Buffer miss TLB hit All of the
____________ mentioned A
121 3 malloc ( ) is Memory API Memory API Free a memory None of the
which which allocate region allocated above
calculates the a memory from heap
memory region on the
requirement heap.
B
122 3 Which of the following is not common error happens while Forgetting To Not Allocating Forgetting To All of the above
allocating or freeing the memory from heap Allocate Enough Free
Memory Memory Memory/Memory
Leak
D
123 3 What is the output of following code snippet (Assume integer 4 400 40 20
requires 4 bytes) main ( ) { int x[10]; printf(“%d\n”,
sizeof(x)); } C
124 3 When we Free the memory before it is finished using , it Dangling Dead Pointer Smart Pointer All of the above
results in Pointer A
125 3 Segment is Fixed sized Contiguous Contigeous None of the
portion of the portion of the blocks in hard above
address space address space disks
of a particular
length which
are logically
separated

B
126 3 Coarse-Grained segmentation means segmentation segmentation - A
in a small which allows
number more flexibility
for address
space in some
early system.

127 3 Best Fit free space management strategy is Finding free Finding the Finding the first Finding the first
chunks that largest free chunk that is big chunk that is big
are big or chunks and enough for the enough for the
bigger than allocation the request request
the request amount of the
request
A
128 3 Most of the Modern Operating Systems uses Segmentation Paging Demand Paging All of the above C
129 3 Consider the following string for pages required 7 0 1 2 0 15 18 11 13
3 0 4 2 3 0 3 2 1 2 0 1 If frame size is 3 then using LRU
(Least Recently Used) page replacement policy total TLB Miss
are (Assume that initially all the frames are empty)
C
130 3 Program is Where instructions and static data live 1 0- A
131 3 Rreturn addresses or values are stored at Stack Code Heap -
132 3 Dynamically allocate memory is Stack Heap Code -
133 3 Which system call allocate a memory region on the heap. malloc() fork() wait() -
134 3 int *x = malloc(10 * sizeof(int)); printf(“%d\n”, sizeof(x)); it will 4 40 32 16
print ?? A
135 3 Starting address of segment stored in...... register Base Bound Limit Extra A
136 3 Segment is just a contiguous portion of the address space of a 1 0- A
particular length
137 3 Any Process has following Logically-different segment: code, stack, code, data, code, stack, code, stack, data
heap extra extra
𝑝ℎ𝑦𝑠𝑖𝑐𝑎𝑙 𝑎𝑑𝑑𝑟𝑒𝑠𝑠 = 𝑜𝑓𝑓𝑠𝑒𝑡 + 𝑏𝑎𝑠𝑒
A
138 3 0 1- B
139 3 If the offset of virtual address is 100 and Code segment base 32868 33868 34868 32867
address is 32K ,Then physical address would be...... A
140 3 If the offset of virtual address is 100 and Code segment base 4196 4296 4396 4496
address is 4K ,Then physical address would be...... A
141 3 If an illegal address which is beyond the end of heap is 1 0- A
referenced, the OS occurs segmentation fault .
142 3 If an address which is within the end of heap is referenced, 1 0- B
the OS occurs segmentation fault .
143 3 Coarse-Grained means segmentation in a small number. 1 0- A
144 3 Less of a problem where memory is divided in fixed-size 1 0- A
chunks (pages) Suffers from internal-fragmentation
145 3 Finding the first chunk that is big enough for the request is First Fit Best Fit Worst FIt Next Fit
a ........... algorithm A
146 3 Finding the first chunk that is big enough for the request Next fit Worst fit Best fit First fit
(allocator travels the free list in RR).is a ......algorithm A
147 3 Best fit algorithm has the problem of hard to find the best 1 0- A
candidate
148 3 Worst fit algorithm has the problem of hard to find the best 1 0- A
candidate
149 4 ………………. when a process leaves a critical section and Busy waiting is Starvation is Deadlock is All of the above
more than one process is waiting, the selection of a waiting employed possible possible
process is arbitrary. B
150 4 In binary semaphores, a ………………….. is used to hold Stack Queue Tree Graph
processes waiting on the semaphore. B
151 4 ………………… are used for signalling among processes and Semaphores Messages Monitors Addressing
can be readily used to enforce a mutual exclusion discipline.
A
152 4 With ………………. the send primitive includes a specific direct indirect one-to-one- one-to-many
identifier of the destination processes. addressing addressing addressing addressing A
153 4 In ……………….. messages are not send directly from sender direct indirect one-to-one- one-to-many
to receiver but rather are sent to a shared data structure addressing addressing addressing addressing
consisting queues that can temporarily hold messages.
B
154 4 ……………………… are useful for the enforcement of mutual Semaphores Messages Monitors Addressing
exclusion and also provide an effective means of inter-process
communication. B
155 4 Which of the following is/are the disadvantages of machine i, ii and iii only ii, iii and iv only i, iii and iv only All i, ii, iii and iv
instruction approach to enforce mutual exclusion. i) Busy
waiting employees ii) hard to verify iii) starvation is possible iv)
Deadlock is possible
C
156 4 Conditions needed to solve the critical section problem are: Mutual Progress Bounded Waiting All of the above
Exclusion D
157 4 Solution to starvation is that: the number of resource the number of All of these
resources preemption be rollbacks must be
must be done instead included in the
included in cost factor
resource pre-
emption
C
158 4 Producer-Consumer problem can be solved by using Semaphores Monitors Event Counters All of these
__________? D
159 4 Which one of the following is not shared by threads? Program Stack Both program none of the
counter counter and mentioned
stack C
160 4 If one thread opens a file with read privileges then Other threads Other threads Any other thread All of the
in the another in the same cannot read from mentioned
process can process can that file
also read from also read from
that file that file

B
161 4 The register context and stacks of a thread are deallocated Terminates Blocks Unblocks Spawns
when the thread? A
162 4 Thread synchronization is required because All threads of All threads of a All threads of a All of the
a process process share process can mentioned
share the the same share the same
same address global variables files
space

D
163 4 Thread shares with other threads belonging to same process Thread ID Program Register set and Code section
its counter a stack and data section D
164 4 The bounded buffer problem is also known as: Producer – Readers – Dining – Dining – Readers
Consumer Writers Philosopher problem
problem problem Problems A
165 4 The Dining Philosophers problem solution is : Starvation free Deadlock free Page fault free All of the above
solution solution solution B
166 4 The term mutex is short form for Mutual Mutual Mutual Mutual excluded
exception exclusion examination B
167 4 Implementing locks needs support from Hardware Operating Both A and B Devices
System C
168 4 Fine-grained locking Allows more Are easy to Both A and B -
parallelism manage
169 4 Down/wait functions on a semaphore variable increments the decrements the Both A and B -
counter counter and
blocks the
calling thread if
the resulting
value is
negative
170 4 In classic synchronization producer/ Consumer problem If the shared If Consumer Both A and B If the shared
producer thread should wait buffer is full thread is buffer is empty
consuming
from shared
buffer
C
171 4 LOCKS and Semaphores are used to avoid Deadlocks Race Condition Process Both A and B
synchronization D
172 4 Advantages of threads over processes are In threads it is Threads put Threads support All of the above
much easier to less pressure multicore
share data over the programming
memory
D
173 4 Multiple threads executing critical section can result in a Deadlocks Race Condition LIve Lock Thread
termination B
174 4 Atomicity bugs and Order-violation bugs are Deadlocks Non-deadlock Both A and B -
Bugs bugs
175 4 Always use locks when accessing shared data 1 0- A
176 4 1) Mutual exclusion, 2) Hold-and-wait,3) No preemption,4) Livelock to Deadlock to - B
Circular wait All four of the above conditions must hold for a occure occur

177 4 We can prevent circular wait by Acquiring all Acquiring Both A and B -
locks at once locks in a
certain fixed
order
178 4 ____________is very popular deadlock avoidance technique, Banker’s Dijkstra's Kruskal's -
but it is impractical in real life algorithm algorithm algorithm
179 4 Is it necessary for threads in a process to have separate Yes No - A
stacks?
180 4 Consider a process that uses a user level threading library to 4 6 2 8
spawn 10 user level threads. The library maps these 10
threads on to 2 kernel threads. The process is executing on a
8-core system. What is the maximum number of threads of a
process that can be executing in parallel?
C
181 4 Creating user level threads in a Linux application via any 0 1- A
threading library always leads to the creation of corresponding
kernel-level threads
182 4 Consider N threads in a process that share a global variable in No Yes - B
the program. If one thread makes a change to the variable, is
this change visible to other threads?
183 4 Consider a process that has switched to kernel mode and has No Yes - A
acquired a spinlock to modify a kernel data structure. In
modern operating systems, will this process be interrupted by
external hardware before it releases the spinlock?

184 4 Consider a Linux application with two threads T1 and T2 that 1 0- B

185 5 The ______ may read data from the disk to the buffer and kernal controller Disk controller Getblk algorithm
manipulate it or write data to the buffer and possibly to the disk
A
186 5 2. The kernal involves algorithm ____________ when a Brelease Bread Cbreada iget
process has no more need for buffer A
187 5 The kernel must write the _____ buffer to disk and allocate Write Delayed write Pre write Delayed read
another buffer. B
188 5 The algorithm for reading and writing disk blocks is Iget Iput Inode Getblk D
189 5 Buffer cache helps to___________ Store data Improved Allocate memory None of the
read/write above
performance B
190 5 A memory buffer used to accommodate a speed differential is Stack pointer Cache Accumulator Disk buffer
called. B
191 5 Information about a process is maintained in a __________ Stack Translation Process Control Meomory
Lookaside Block Management
Buffer Unit C
192 5 In _______ information is recorded magnetically on platters. magnetic disks electrical disks assemblies cylinders
A
193 5 The heads of the magnetic disk are attached to a _____ that spindle disk arm track none of the
moves all the heads as a unit. mentioned B
194 5 The set of tracks that are at one arm position make up a magnetic disks electrical disks assemblies cylinders
___________ D
195 5 The time taken to move the disk arm to the desired cylinder is positioning random access seek time rotational latency
called the ____________ time time C
196 5 The time taken for the desired sector to rotate to the disk head positioning random access seek time rotational latency
is called ____________ time time D
197 5 When the head damages the magnetic surface, it is known as disk crash head crash magnetic all of the
_________ damage mentioned B
198 5 What is the host controller? controller built controller at the all of the none of the
at the end of computer end mentioned mentioned
each disk of the bus
B
199 5 CPU cycles get wasted in following technique Polling Interrupt None of the -
above
200 5 Device makes registers appear like memory locations Memory I/O Mapped I/O Both None of these
mapped I/O A
201 5 __________ type of devices produce/consume stream of Character Block Both None of these
bytes. A
202 5 ________ stores pointers to interrupt handlers. Interrupt Interrupt Both None of these
Service Descriptor
Routine Table (IDT) B
203 5 Device driver: part of OS code that talks to specific device, Scheduler Memory Device Drives None of these
gives commands, handles interrupts. Manager C
204 5 ______ is a unique tag, usually a number identifies the file File identifier File name File type None of the
within the file system. mentioned A
205 5 To create a file ____________ allocate the make an entry allocate the none of the
space in file for new file in space in file mentioned
system directory system & make
an entry for new
file in directory

C
206 5 By using the specific system call, we can ____________ open the file read the file write into the file all of the
mentioned D
207 5 File type can be represented by ____________ file name file extension file identifier none of the
mentioned B
208 5 What is the mounting of file system? crating of a deleting a attaching portion removing the
filesystem filesystem of the file system portion of the file
into a directory system into a
structure directory
structure
C
209 5 Buffering is done to ____________ cope with cope with maintain copy all of the
device speed device transfer semantics mentioned
mismatch size mismatch
D
210 5 I/O is a _________ in system performance. major factor minor factor does not matter none of the
mentioned A
211 5 __________ system call is used to read/write at random lseek() random() readrandom() none of the
location above A
212 5 _______ creates another file that points to the same inode Hard linking Linking Rename None of the
number. above A
213 5 What is raw disk? disk without empty disk disk lacking disk having file
file system logical file system
system A
214 5 The data structure used for file directory is called mount table hash table file table process table
____________ B
215 5 When hardware is accessed by reading and writing to the port-mapped controller- bus-mapped I/O -
specific memory locations, then it is called ____________ I/O mapped I/O
216 5 When hardware is accessed by reading and writing to the port-mapped controller- bus-mapped I/O none of the
specific memory locations, then it is called ____________ I/O mapped I/O mentioned D
217 5 Device drivers are implemented to interface ____________ character block devices network devices all of the
devices mentioned D
218 5 __________ holds master plan of all other blocks Superblock Inode Bitmaps Data blocks A
219 5 ________ stores records mapping filename to inode number Directory File Inode None of these
A
220 6 In the Little’s formula the ‘W’ is…... the average the IO burst the average the response
execution time waiting time an time
item spends in a
queuing system
C
221 6 The one of a basic parameter monitored during performance Bandwidth Type of Size of chache Disk size
testing is processor memory A
222 6 Bandwidth - shows the Disk Writes bits per second Disk Reads per All of the above
per unit time used by a unit time
network
interface
B
223 6 The CPU interrupts per second - is _________ the avg. the avg. the avg. number the number of
number of number of of hardware I/O requests a
processes a software interrupts a processor is
processor is interrupts a processor is receiving and
receiving and processor is receiving and processing each
processing receiving and processing each second
each second processing second .
each second
C
224 6 What is Distributed system? System More than 1 None of the All of the above
residing on machine above
only single working
machine together to
solve a
problem
B
225 6 What are characteristic of NFS protocol Search for file Read a set of Manipulate links All of the above
withing directory and directories
directory entries Disk
Cache buffer
D
226 6 To make a pipe, put a ________ on the command line | / \ $
between two commands. A
227 6 In RPC , R stands for Remote Response Rate None of the
above A
228 6 Which of the following are applications of the Client and Email Network WWW All of the above
Server Model ? Printing D
229 6 UDP is ………………. Unique Data User Datagram Universal Data none of the
Protocol Protocol Protocol mentioned
B
230 6 Full form of TCP is………………. Transmission Transmission Transport Control None of the
Connection Control Protocol mentioned
Protocol Protocol C
231 6 TCP Protocol Buffers messages so arrive in order 1 0- A
232 6 Which of the following companies have implemented NFS: Oracle/Sun NetApp, EMC, All of the above A
233 6 NFS can cache data in which places Server Client Disk Client Memory All of the above
Memory D
234 6 NFS APIs are stateless 1 0- A
235 6 RPC packages uses Run time Librarry 0 1- B
236 6 Sockets allow communication between two different processes 1 0- A
on the same or different machines.
237 6 . A Unix Socket is used in a client-server application 0 1- B
framework.
238 6 What is true about pipes in unix? Pipe can To make a Two or more Both A and C
connect two pipe, put a commands
commands hash (#) on the connected in this
together so command line way form a pipe.
that the output between two
from one commands.
program
becomes the
input of the
next program
D
239 6 The distributed file system protocol allows a user on a client 1 0- A
computer to access files over a network in the same way they
would access a local storage file.
240 6 John owns a small coffee shop. He wants to know the average 10 13 12 14
number of customers queuing in his coffee shop to decide
whether he needs to add more space to accommodate more
clients. Currently, his queuing area can accommodate no more
than eight customers. John measured that on average, 65
customers arrive at his coffee shop every hour. He also
determined that on average, a customer spends around 12
minutes in a store . Given the inputs, John had calculated the
average number of the customers queuing in his coffee shop
by applying the Little’s Law. It is

B
241 6 In mathematical expression of Little’s Law W stands for The average Overall Wastage time Weightage given
waiting time Watching time for tasks
an item
spends in a
queuing
system
A
242 6 In the basic parameters monitored during performance testing Number of The rate a The amount of The amount of
Throughput is processes computer or physical memory time disk is busy
executed per network available to executing a read
unit time receives processes on a or write request.
requests per computer.
second.
B
243 6 In the basic parameters monitored during performance testing The bits per The number of The number of The number of
Bandwidth is second used bytes digits used words transferred
by a network transferred
interface.
A
244 6 Network File Systems is Processes on Processes on Processes on All of the above
different same machine servers
machines access shared
access shared files
files in same
way
A
245 6 NFS can cache data in server client disk client memory all of the above
memory D
246 6 Idempotent is Doing things Servers don’t Both A and B -
twice never remember
hurts clients
247 6 Latent-sector errors (LSEs) arises When a When a disk When accessing All of the above
storage sector (or a seemingly-
system tries to group of working disk,
access a sectors) has once in a while it
block, and the been damaged may either return
disk returns an in some way. an error when
error trying to read or
write a given
block

B
248 6 Costly drives with more than one LSE are as likely to develop 1 0- A
additional errors as cheaper drives
249 6 When you treat D as if it is a large binary number and divide it Fletcher Collision Cyclic -
by an agreed upon value (k). The remainder of this division is check-sum redundancy
the value of the check (CRC)
250 6 A checksum is used for Detecting Detecting Disk Detecting LSE All of the above
physical sector
damages to corruption
disks sector
B
251 6 Disks scrubbing is Periodically Technique for Thechnique to All of the above
reading avoiding repair the disks
through every collision blocks
block of the
system, and
checking
whether
checksums
are still valid

A
252 6 The Overheads of Checksumming are It requires It requires It requires more It requires more
more costs more time and devices users
space B
253 6 Lost write is Occurs when When disks When disks -
the device blocks are contents are
informs the physically corrupted
upper layer damaged
that a write
has completed
but in fact it
never is
persisted;
thus, what
remains is the
old contents of
the block
rather than the
updated new
contents.

254 6 When reading a block D, the client (i.e., file system or storage Then the data This implies the - A
controller) also reads its checksum from disk Cs(D), which we has likely not data has
call the stored checksum (hence the subscript Cs). The client been changed since
then computes the checksum over the retrieved block D, which corrupted the time it was
we call the computed checksum Cc(D). At this point, the client stored
compares the stored and computed checksums; If Cs(D) ==
Cc(D)