ID Question Choice1 Choice2 Choice3 Choice4 Correct

____ is a specialized form of

multi-programming for
mediating between a program None of the
1 and a slow peripheral IO buffering Surrogating Spooling given 3
A___interrupt handling is one
where the interrupting device
dont send an interrupt vector.
CPU jumps to fixed address in
2 memory by loading it into the PC. ISR Non-vectored Trap Vectored 1
User procesess prevented from
handling I/O directly by keeping
I/O instructions privileged. But in Mode shifted
a CPU with memory mapped I/O, IO protection ensured I/O protection is from memory
there is no explicit I/O ins. Which by partioning address ensured by a I/O protection is mapped to
3 one is true for such CPU? space hardware trap not possible port mapped 1
A phenomenon in which
increasing page frames inversely
impacts page faults is termed as
4 ___ Parkinson's condition Belady's anamoly Thrashing Page fault 2
A process executes the code
fork(); fork(); fork();. The total
number of child processes
5 created is 3 1 6 7 4
The time taken to switch
between user and kernel modes
of execution be t1 while the time
taken to switch between two No relation
processes be t2. Which of the between t1 &
6 following is TRUE? t1 > t2 t1 = t2 t1 < t2 ts 3
A thread is usually defined as a
"light weight process" because
an OS maintains smaller data OS don't
structures for a thread than for a OS does not maintain OS don't maintain a OS don't maintain switch
process. Then which of the thread states separate stack for vir memory state between
7 following is TRUE? seperately each thread per thread threads 3
 Which of the following ISR invoked on ISR invoked on
statements about synchronous completion of I/O in completion of I/O in ISR not
8 and asynchronous I/O is true? synch ISR invoked for both asynch invoked at all 2
A process executes the following
code:- for (i = 0; i < n; i++) fork();.
How to compute the total
9 number of child processess? n 2^n-1 2^n n+1 2
Which of the following need not
necessarily be saved on a context Translation look-aside General purpose
10 switch between processes? buffer registers Program counter Program stack 1
Where does the swap space
11 reside ? RAM DISK REGISTERS CACHE 2
When priority ceiling is
employed, if the priorities of
processess and resources is as
follows, what will be the priotity
of A when it holds resource R2.
Priorities: A-3,B-2,C-3,D-5. R1-
12 8,R2-6,R3-7 7 8 6 5 1
Not yet loaded
A dirty bit being set for page Not referenced Modified during into main
13 indicates that the page was____ Referenced recently recently execution memory 3
FIFO policy used for page
replacement with 4 frames.
System first accesses 100 distinct
pages and then accesses the
same 100 pages but now in the
reverse order. How many page
14 faults will occur? 192 194 195 196 4
The method of replacing unused
existing code or data to bring a
new block or code or data into
15 memory is termed as__ Buddy systems Page replacement Overlays Union 3
The memory allocation scheme
that is prone to generating more
16 amount of fragments is___ Best fit Next fit First fit Worst fit 1
 A dynamic storage allocation
scheme in which is memory is
maintained and allocated in
17 powers of two is_______ Segmentation Even management Overlays Buddy 4
When a parent process
terminates after it had forked a
child process, it is adopted by the
init process. That child process is
18 called___ process Alien Zombie Orphan Daemon 4
__ is a variant of fork in which
the child process simply shares
the memory pages of parent
without making a copy of them
19 like the normal fork Xfork Vfork Pfork Sfork 2
piece of software
acts as interface to that operates or code that
Which of the following properly devices in a file controls a particular communicates with None of the
20 describes 'device files' in Unix? system device a device above 1
The syntax of msgrcv is:- int
msgrcv(int msqid, void *msgp,
size_t msgsz, long msgtyp, int Get the next message Retrieve first msg on Retrieve the next
msgflg);. Passing 0 as the with an mtype equal queue whose mtype message on the
argument for msgtyp will to the specified field is < or = to the queue, regardless of No message
21 cause__ msgtyp. abs(msgtyp) its mtype. retrieved 3
there is no need for
the address of the the address of the an address i.e. the the data are
Which of the following refers to data is generated by data is supplied by data is used as an accessed
22 the associative memory? the CPU the users address sequentially 3
Which one of the following
describes the kernal model that
allows kernels to be extended
dynamically to add new Loadable kernel Kernel Kernel mode
23 functionlaties when required moduls(LKM) extension(kext) driver(KMD) All the above 4
When a user program that is
currently running encounters an
exception due to a illegal
24 operation, it results in a___ Interrupt Trap Exception System call 2
 When a user program requests
for a IO operation which one of
25 following occurs? Mode switch System call Process blocked All the above 4
When a child process terminates
while the parent is alive, it
reaches a state called___ state in
which its process Id and return
value are preserved for the
26 parent to collect Hibernate Sleep Zombie Ghost 3
A pipe is created as int p[2];
pipe(p); Now which one of the
following refers to the output
27 end of the pipe p[0] p[1] p p[2] 1
A program remains Iterative constructs
confined to anarrow consist of a small
Identify the statement that Program is generally window of number of ins
properly justifies the principle of execution is procedure-invocation repeated All of the
28 locality of reference sequential depth many times above 4
Execution to involve A program to access
A processor to access a number of memory data locations
Spatial locality refers to the instructions locations sequentially such as All of the
29 tendency of ____ sequentially. that are clustered an array of data above 4
Whenever a procedure call is
made, the parameters to the
called procedure are typically
30 passed through___ Pointers Heap Stack Stub 3
Low P* process with
A high P* process is a resouce needed by A higher P* task is
Priority inversion occurs delayed due to a low the high P* process is preempted by a All of the
31 when____ . P* -Priority P* process preempted lower P* one above 4
The degree of multiprogramming
is computed by the formula 1- No of
P^N where P denotes the time processes
spennt by a process and N No of processes in No of processes No of process in completed per
32 denotes____ ready state present in memory blocked state unit time 2
 __is a multiproces scheduling
strategy in which it is made sure
that a thread which was run on a
particular CPU must run again on Smart
33 the same CPU Affinity scheduling Gang scheduling Static scheduling scheduling 1
Given that a semaphore variable
was initialized to 3 and it is
presently -3 then how many
processes would have been None of the
34 blocked on this semaphore 3 6 0 above 1
Process A requires resources Ra
and Rb, Process B requires Rb
and Ra. A acquires resource Ra
and blocked. Then B acquires Rb Deadlock is None of the
35 and blocked. In this scenario__ Deadlock has occurred Deadlock may occur impossible above 2
Semaphores may
Which one of the following is allow many processes, Semaphores may be Semaphores involve
wrong as a difference between but monitors limited nested but monitors critical sections but None of the
36 semaphore and monitor to onlone process cant be nested monitors above 2
Among the nonpreemptive
algorithms, which algo provides
the minimum average waiting
time for a batch of jobs that RR with short
37 arrive at the same time. FCFS Feedback SPN time slice 3
Choose the CPU scheduling
algorithm that favours CPU
38 bound processess the most FCFS RR SRT HRRN 1
___is a body of machine code
that, being placed somewhere in
the primary memory, executes
properly regardless of its
absolute address. It is used for Position
39 shared libraries. DLL Relocatable code independent code Middlewares 3
Given the arrival times and
service times of processes,
identify whether there is any
CPU idle time present in the None of the
40 given sample under FCFS.A: AT: 0 2 1 above 3
 1, ST: 4, B: AT:2, ST:2, C: AT: 5,
ST:1, D: AT:8, ST:2

<process-id,
Under a inverted page table, a <process-id, pg no, frame no,
41 virtual address is represented as offset> <pgno, offset> <frame no, offset> offset> 1
Given the memory partitions of
a.100, b.500,c.200, d. 300 and e.
600 in KBs, choose the correct
order of partition selections
under first fir, bestfit and worst
42 fit for the requirement of 150 KB a, c, b b, c, e d,c,a b, a, d 2
Which of the following bits is
helpful in minimizing the
swapping time under page
43 replacement Valid bit Interrupt bit Dirty bit Reference bit 3
A disk has 201 tracks from 0 to
200. Disk arm is at 100 &
requests for 30, 85, 90, 100, 105,
110, 135 and 145 to be served. If
SSTF is , the request for 90 is
44 serviced after ___ no of requests. 0 1 2 3 4
Scan serves requests Sacn reach the edge Scan is comparble to
Which one of the folliwing is in both direction, bu of the disk but C-scan elevator whereas C-
incorrect as the difference C-Scan serves in one stops with last Scan is comparable All are correct
45 between SCAN and C-SCAN direction request to a circular Q only 2
For each processor core that is
physically present, the OS
addresses two virtual (logical)
cores and shares the workload
between them when possible.
This technique of Intel s called as
46 ___ VirtualCores CoreBoosting HyperThreading VirtualMachine 3
 Sequential ordering of resources
is followed to prevent deadlock
by prevending circular wait. Then
which one of the following
processes are making illegal
requests: P1: Ra Rc. P2: Rb Rc None of them
47 P3:Rc Rb P1 P2 P3 is illegal 3
Consider that there are N pages
in the pool and the application
executing a loop over the array
of N pages. Which pg
replacement algo is likely to
48 produce lesser pg faults? LRU MFU MRU LFU 3
In Unix, the system processess
that are automatically created to
provide services and run as
background processes are
49 termed as __ Daemon Init BIOS Zombie 1
Which type of process is likely to
be benefitted when the time
quantum is chosen to be smaller
for the Round Robin CPU
50 scheduling algorithm? CPU bound IO bound Neither Neutral 2
If minimizing response time is
the objective then which
scheduling algorithm should be
51 selected? FCFS RR SPN SRT 2
Inter-thread
communication A thread
Which one of the following is They are created with Thread switching happens withput making a
wrongly mentioned as a the help of thread does not incur mode the support of system call will
52 characteristic of ULT? libraries switching kernel be blocked 4
Which one of the following
category of computer systems is
53 not implemented anywhere? SISD SIMD MISD MIMD 3
 Consider three processes
requiring 10, 20 and 30 time
units and arrive at times 0, 2 and
6. How many context switches
will occur under SRT?
else { a = a –5; printf(“%d, %d\n”,
54 a, &a); 1 2 3 4 2
Amdahl's law that is used in
parallel computing to predict the
theoretical speedup when using
multiple processors is S
55 latency(S)=___ 1/(1-p)+p/s 1/(1-p)+s/p 1/(1-s)+p/s 1/p+(p-s) 1
Which one of the following can
NOT be said to be a hazard in a
instruction pipeline?. ( A hazard
is one that prevents the next
instruction in the pipeline to be The result of first
executed in the following clock instruction used in An IO
56 cycle) A cache miss A branch instruction second ins operation 4
If LRU with additional ref bits
algorithm is used for page
replacement then which one of
the pages with the given
reference bits will be replaced
57 next? 11000100 10000000 01110111 11111110 2
What is the basis for the working
set strategy by which a process is
allocated sufficient no of frames
58 to prevent it from thrashing? Demand paging Virtual memory Locality of reference Process affinity 3
Keep track of the
page fault frequency
Allocate as many Employ local & dynamically
Which one of the following is a frames as per the alocation instead of allocate addnl All of the
59 strategy to reduce page faults? working set global frames above 4
If minimizing context switching is
the top priority of CPU
scheduling then which one of the
60 given algo is the least suitable? FCFS RR SPN HRRN 2
 In the dinning philosopher's
problem with 5 philosophers, the
minimum no of forks that would
avoid a deadlock without
requiring any concurrency
61 control mechanism is 5 6 10 9 2
s is semaphore variable
initialized to 1. Then what will be
the value of s at the end of the
following calls. P1: Wait(s) P2:
Wait(s) P3: Wait(s) P1: Signal(s)
P2:Signal(s) P4: Wait(s) P1:
62 Wait(s) -2 -1 0 Indeterminable 4
In a round robin based time
shared system, a running process
goes to __ state after its time
63 quantum is over Blocked Ready Suspended Exit 2
Physical memory is 32 bytes,
page size is 4 bytes ( 8 frames).
Pages start from 0.. Then logical
64 address 9 is Page 3 Offset 0 Page 2 Offset 1 Page 3 Offset 1 Page 2 Offset 0 3
Physical memory is 32 bytes,
page size is 4 bytes. A total of 8
frames from 0 to 7 exist. Given
that process size is 6 bytes then None of the
65 logical address 6 is Invalid Valid Page fault above 1
The term associative memory or Unlike RAM, data Designed to search Each memory bit
content addressable memory words are searched its entire memory in must have a All of the
66 implies instead of addresses a single operation comparison circuit above 4
In which of the following
operations, the scheduler is not Process requests for Process finishes Process finishes its All of the
67 called into play? I/O. execution. time allotted. above 4
Both mode and
When a process requests for I/O Only process switch Only mode switch process switch No switch
68 __ occurs occurs occurs occurs 3

If the waiting time for a process

69 is p and there are n processes in p/n p^n 1-p^n n-(p^n) 2
 the memory then the CPU
utilization is given by__

CPU scheduling algorithm

determines an order for the
execution of itsscheduled
processes. Given n processes to
be scheduled on one processor,
how many possible different
70 schedules are there? n(n-1) n^2 n! n/2 3
ID Question Choice1 Choice2 Choice3 Correct
Two of the main structural Processor, Main Control unit, ALU,
0 elements of a computer are memory CPU, Registers Main memory 1
The mechanism by which IO
devices could communicate with
1 processor Messaging Control Signal Interrupts 3
Which is one of the following is
2 an interrupt class ? Program Timer Both are correct 3
______ is the collection of
modules to service various
3 interrupts YSR ISR JPR 2
Before leaving for servicing an
interrupt, processor saves the
4 following register PSW MAR Accumulator 1
The location where the processor
stores current context before
5 leving for interrupt servicing is TLB Cache Control Stack 3
Disabling interrupt involves bits
6 in a ___ register PC PSW SVC 2
During the course of execution of
a program, memory references
7 by the processor tend to cluster Locality of reference Cluster tendency Hit ratio 1
Which memory usage is justified
8 by locality of reference? DRAM Cache Main memory 2
A portion of main memory can
be used as a buffer to hold data
9 that are to be read out to disk is Disk buffer Disk dump Disk cache 3
 Which one of the following cache
level is the largest among the
10 three levels L1 L2 L3 3
In a mulicore processor, which
cacne level is private to the
11 individual cores? L1 L2 L3 1
In a CACHE, the equivalent of a
12 memory block is ___ Page Segment Line 3
Which one of the following is a
13 cache replacement algorithm ? LRU FIFO Both 3
___ determines when a main
memory block to be updated
when the cache content is
14 modified Write policy Update frquency Write back 1
_____ is a single copy of the
program code that can be shared
by multiple users during the
15 same period DLL Reentrant Procedure Shared Page 2
A portion of the OS that is in
16 main memory is termed as Kernel Nucleus Both are correct 3
Where do you come across the Time Shared
17 term 'Monitor' ? Multiprogramming Batch Systems Systems 2
____ contrls the sequence of
18 events in a batch system Monitor Kernel Dispatcher 1
Whenever the CPU have to wait
for an IO, it rather switch to
19 another process. This is called Concurrent Processing Parallel Processing Multiprogramming 3
The primary objective of Time Minimize response Minimize
20 sharing is to Maximize throughput time turnaround time 2
Leaving a current process after
saving its details to execute
21 another process is Context switch Contrast switch Concrete switch 1
Executable
22 program+Data+Context = ? Execution context Process state Both 3
Translation of Virtual address to
23 Real address involves Page no to Frame no Frame no to Page no Page no to Offset 1
 A single large kernel comprising
of all OS functionalities is
24 referred to as Micro Monolithic Macro 2
___ asssigns only a few essential
functions to the kernel, other
services are provided by
25 processes Monolithic Micro Macro 2
___ is a small program that
switch the processor from one
26 process to another OS Kernel Dispatcher 3
The listing of the sequence of
instructions that execute for a
27 process is called Context Trace Image 2
The mechanism by which
uniprocessor system's
28 performance improved is Interleaving Overlapping Time sharing 1
The mechanism by which
multicore system's performance
28 improved is Time sharing Overlapping Interleaving 2
Creating a new process at the
request of another process is
29 called Parenting Spawning Extending 2
In which state the process is
waiting for IO competion and
also moved into secondary
30 memory Ready/Suspend Blocked/Suspend Suspended 2
Evicting a currently process
31 forcecully is called Interrupting Suspending Preempting 3
The collection of program, data,
stack and attributes of a process
32 is termed Process Image Process Context PCB 1
Which one of the characteristics
33 of a process represents a thread? Resource ownership Scheduling/execution Both 2
34 Number of thread states is__ 4 5 3 1
Creation of threads with the help
35 of thread libraty happens in Kernel level thread Appln level threa User level thread 3
 _______ is a technique to
convert a blocking system call
36 into a non blocking system call Dispatching Shielding Jacketing 3
When processes are indirectly
aware of each other, their Cooperation by Cooperation by
37 relationship is Competition sharing communication 2
Which one of the following is a
special machine instruction for
38 mutual exclusion? Test & Set Compare & Swap Both 2
The operation that will
decrement the semaphore
39 variable is Wait Signal Block 1
The operation that willi
ncrement the semaphore
40 variable is Wait Signal Block 2
A ___ semaphore is one whose
41 value is nonbinary Counting General Both 3
A semaphore that specify the
order in which processes are
42 removed from the queue is a Strong General Binary 1
In a monitor, cnotify is an
43 alternate for cwait csignal Neither 2
In which addressing scheme,
mailboxes are used for holding
44 messages temporarily Direct Indirect Relative 2
A message is an example for a
45 ___ type of resource Consumable Reusable Dynamic 1
Memory is a type of _____
46 resource Consumable Sharable Reusable 3
Which one of the following is the
most important condition for
47 deadlock? Mutual exclusion Hold and wait Circular wait 3
Defining a linear ordering of
resource types is used in
48 preventing Mutual exclusion Hold and wait Circular wait 3

___ is one in which there is at

49 least one sequence of resource Unsafe Safe Critical 2
 allocations not leading to
deadlock

Which one of the following is an

50 example for deadlock problem? Reader-writer Producer-consumer Dining philosopher 3
____ is a fixed-length block that
resides in secondary memory
51 such as a disk Segment Page Both 2
____ is a variable-length block
that resides in secondary
52 memory such as a disk Segment Page Both 1
______ is a requirement of
53 memory management Relocation Protection Both 3
54 No internal fragmentation in Fixed partitioning Dynamic partitioning Paging 2
55 No external fragmentation in Paging Fixed partitioning Both 3
Not loading all the pages of a
process into main memory refers
56 to Virtual memory Demand paging Dynamic loading 1
___begings to scan memory from
the location of the past
placement and chooses the next
57 available block Best fit First fit Neither 3
Shifting processes so that they
are contiguous and all the free
memory is together in one block
58 is Context swtich Spawning Compaction 3
In a paging system, a unt of
59 memory division is termed as Page Frame Segment 2
Under _____, a page is brought
into main memory only when a
reference is made to a location
60 on that page Prepaging Demand paging Page fault 2
____ replacement policy selects
for replacement a page for which
the time to the next reference is
61 the longest LRU Clock Optimal 3
 The usage an additional bit called
use bit is needed in ____
62 algorithm LRU Optimal Clock 3
____ is a strategy to improve
page replacement by moving a
replaced page into a free or
63 modified page list Page buffering Page caching Page faulting 1
_____ represents the subset of
the pages of a process that are
loaded into main memory by the
64 OS Page table Working set Resident set 3
The scheduling decision to add to
the number of processes that are
partially or fully in main memory
65 is Long-term Short-term Medium-term 3
The decision as to which
available process is to be
executed by the processor is __
66 scheduling Medium-term Short-term Long-term 2
The interval between the
submission of a process and its
67 completion Turnaround time Response time Deadline 1
The time from the submission of
a request until the response
68 begins to be received Turnaround time Response time Interactive time 2
The number of processes
completed by the processor in a
69 unit of time is called Turnaround time Response time Throughput 3
70 The selection function for FCFS min[s] max[w] min[s-e] 2
71 The selection function for SPN min[s] max[w] min[s-e] 1
72 The selection function for HRRN max[w] min[s-e] max((w+s)/s) 3
Which one of the following CPU
scheduling algo. Gives the best
73 response time? FCFS SPN SRT 3
In which one of the CPU
scheduling algorithm, starvation
74 possible? FCFS SPN HRRN 2
 In which one of the CPU
scheduling algorithm, starvation
75 possible? SPN Feedback Both 3
_____ scheduling algorithm
results in poor performance for
76 IO bound processes FCFS Round-robin HRRN 2
Identify the preemptive
77 algorithm FCFS SPN SRT 3
The thread scheduling, in which a
set of related threads scheduled
78 to run at the same time Gang scheduling Group scheduling Load sharing 1
The mimimum number of
threads that must be scheduled
79 for an apllication Resident set Activity working set Sibling threads 2
Compaction is a technique to Internal External
80 eliminate fragmentation fragmentation Both 2
Which one of the commands
81 creates a child process ? Pipe Fork Both 2
Which the proper syntax for
calling the semaphore function
to signal the semaphore variable
82 in the C program? sem_signal sem_post sem_init 2
Number of argumments to the
83 shmget function 3 2 4 1
The ____ flag as argument to
shmget causes shmget to fail if a
segment key that is specified
84 already exists IPC_EXE IPC_EXCEPT IPC_EXCL 3
Identify the command that is
used to attach and detach shared
85 memory segments shmat,shmdt shmatt,shmdet None 1
The header that is to be included
for shared memory
86 implementation shmem.h shm.h sham.h 2
Which one of the messaging
technique allows sending and
87 receiving pf messages in arbitary Message queues Pipe Both 1
 order

Number arguments for msgsnd

88 function 2 3 4 3
89 Loader is a kind of____ scheduler Long term Short term Medium term 1
A processor in a multiprocessor
containing the details of
previously executed processes in
90 its cache refers to Processor affinity Cache coherence Core caching 1
The scheduler that is based on
91 time slice FCFS Round robin SPN 2
Long processes would suffer
92 more with Round Robin FCFS Feedback 2
which one of the file allocation
strategy generates more external
93 fragmentation? First fit Worst fit Best fit 3
which one of the following is a
non-contiguous file allocation
94 scheme? Linked Indexed Both 3
In a disk, the sum of seek time
95 and rotational delay is Access time Transfer time Response time 1
Position the disk
96 Seek time is the time under the head Position the disk arm Position the mouse 2
97 Transfer time in a disk = b/rN r/bN N/br 1
__ disk scheduling is to select the
disk I/O request that requires the
least movement of disk arm from
98 current position SCAN FIFO SSTF 3
____ disk scheduling restricts
99 scanning in one direction only SCAN C-SCAN S-SCAN 2
100 Number of levels in RAID 6 7 5 2
Unix is an example for______
101 kernel Monolithic Micro Hybrid 1
Windows NT is an example for
102 ________ kernel Monolithic Micro Macro 2
 __ kernel provides very little
abstraction of H/W resources to
user applns giving them more
103 freedom to access them Macro Micro Exo 3
A multiprocessing system in
which each processor having its
own main memory is generally
104 termed as Multiprocessor sys Distributed Sys Networks 2
Which one of the following
represents the type of process in
Unix, whose execution is over
but still not removed from the
105 page table Devil Zombie Ghost 2
The value returned by the fork
command is the process id of the
106 _______ process Parent Kernel Child 3
In unix, an orphaned process is
automatically adopted by the
107 _______ process Init Parent Kernel 1
Which is the first software only,
two processes mutual exclusion
108 algorithm? Banker's Dekker's Kruskal's 2
_____ is used to represent the Resource Allocation
109 deadlocks. Graph Spanning Tree Digraphs 1
Ensuring that one of the four
conditions of deadlock does not
110 hold is the approach of__ Prevention Avoidance Detection 1
Banker's algorithm is used for
111 deadlock___ Prevention Avoidance Suspension 2
The two registeres used for
112 memory protection are: Start and End Index and Bounds Base and Limit 3
The run-time mapping from
virtual to physical addresses is
done by a hardware device called
113 hardware device called the MMU MPU MVU 1
Which one of the schemes could
114 generate internal fragmentation? Paging Segmentation Both 1
 Which one of the schemes could
generate extenrall
115 fragmentation? Paging Segmentation Both 2
Which one of the following
technique is a solution for
116 priority inversion? Priority ceiling Priority inheritance Both 3
A multiprocessor system in
which all processors are equal
and the kernel could run on any
117 processor is ____ SMP ASMP Distributed 0
In unix, the process that spawns
118 all other process is ___ process inetd biod init 3
The tendency of a processor to
access memory locations that
have been used recently is the
119 basis of __ Spatial locality Tempopral locality None of the above 2
Whenever a function call is made
and control is about to transfer
to new procedure, the return
120 address is stored into the __ Stack Queue Program counter 1
Which one of the following
technique improves response
121 time of processes Multiprogramming Time sharing None of the above 0
The entry of all the PCBs of the
122 current processes is in : Process Register Program Counter Process Table 3
Degree of multiprogramming is No of processes No process in No processes in
123 determined by created execution memory 3
When several processes access a
data concurrently and the
outcome depends on the
particular order in which the
124 access takes place, is called Critical condition Mutual exclusion Race condition 3
If a process is executing in its
critical section, then no other
processes can be executing in
their critical section. This
125 condition is called Mutual exclusion Critical condition Deadlock 1
 Which one of the following is a
126 synchronization tool? Shared memory Socket Semaphore 3
The memory problems brought
in by Paging & segmentation are Internal & External External & Internal
127 __ & __ respectively fragmentation fragmentation None 1
Under paging a process may
have internal fragmentation in
128 __ Any page No page Last page 3
129 Collection of ___ is called file. Fields Records Database 2
Generally access rights are
130 enforces at __ level Record File Database 2
Collection of system Another name for
131 A file management system is software Portion of kernel DBMS 1
Which file organisation provices
132 the shortest access time of files ? Sequential Indexed Seq Hashed 3
Which fle organization offers
133 best storage utilization ? Seqential Pile Indexed seq 2
_______ file organization records
are simpley stored in the order
134 they arrive Pile Sequential Indexed 1
When search based on multiple
key fields is requred which file
135 organizaition suitable Sequential Indexed seq Indexed 3
To organize multiple indexes
efficiently ___ data structured is Minimum Spanning
136 used Tree B-Tree AVL Tree 2
In a B-Tree, the root must have
137 atleast __ sub-trees. 0 1 2 3
____ data structure is used to
keep track of memory portions
137 assigned to files. FAT FMT FPT 1
____ file allocation srategy could
138 result in external fragmentation. Contiguous Chanied Indexed 1
____ file allocation technique,
each block contains a pointer to
139 the next block. Contiguous Chanied Indexed 2
140 A trap is a Asynchronous Exceptional condition Both 2
 interrupt
In a paging system, if the size of a
page is 4 KB then the size of
141 offset will be___ 10 bits 11 bits 12 bits 3
Biometric is an example for Something user have
142 which category of authentication Something user know Something user is Something user has 2
While hasinng passwords, the
value added to introduce
143 randomness is called__ Salt Sugar Pepper 1