This is a timed quiz.
You have 45 minutes to complete the 25 questions in this quiz.
Which of the following page replacement algorithm use the technique of replace that page which is not used in the near future?
Least Recently Used
Least Frequently Used
Optimal Page Replacement
First In First Out
A common programming construct for implementing mutual exclusion which uses condition variables is called
Semaphore
Deadlock
Monitor
Locking interrupts
Threads
DMA stands for
Direct Management access
Direct memory access
Dual memory access
Data memory access
Dual memory array
Which of the following is in correct order of size, smallest first?
Cylinder, track, sector
Cylinder, sector, track
Sector, track, cylinder
Sector, cylinder, track
Track, cylinder, sector
Which of the following is NOT a necessary condition for deadlock to occur?
Mutual exclusion
Hold and wait
Wait and signal
Circular wait
Hold
The time required to move the disk head to the desired track is known as
Access Time
Track Time
Latency Time
Seek Time
Block Time
A distributed system is a collection of processors that do not share_______.
CPU
Memory
I/O devices
Network
File
The process of converting logical address into physical address is known as
Conversion
Displacement
Relocation
Transfer
None of the above
In a segmentation scheme the logical memory will be divided into
Pages
Frames
Blocks
Cells
Segments
Which of the technique is used to recover the process from starvation situation?
Paging
Aging
Compaction
Starvation
Reduction
In Unix, dev/null
Is a file
Has write permission for all
Is the UNIX built-in dustbin
All of these
Redirection in pipes can be achieved by using
>
>>
tee
lpr
The PID of the kernel process is
0
1
2
undefined
Which of the following statements best explains a process?
It is a program.
It is a program in execution.
It is an instance of a program in execution.
It is a program that uses system calls.
An incremental backup
uses more tapes
should be done each month
saves only files that have recently changed
saves all files
In real-time operating systems, which of the following is the most suitable scheduling scheme?
round-robin
first-come-first-served
preemptive
random scheduling
If there are 32 segments, each of size 1 K byte, then the logical address should have
13 bits
14 bits
15 bits
16 bits
Which of the following refers to the associative memory?
Address of the data is generated by the CPU
Address of the data is supplied by the users.
There is no need for an address ie the data is used as an address
Data are accessed sequentially
Mutual exclusion problem occurs between
two disjoint processes that do not interact
processes that share resources
processes that do not use the same resource
None of these
Kernel is
considered as critical part of operating system.
software which monitors operating system.
set of primitive functions upon which rest of operating system functions are built up.
none of the above.
Which of the following page replacement algorithms suffers from Belady`s anomaly?
Optimal replacement
LRU
FIFO
Both optimal replacement and FIFO
Locality of reference implies that the page reference being made by a process
will always be to the page used in previous page refernce
is likely to be one of the pages used in the last few page references
will always be one of the pages existing in memory
will always lead to a page fault
The time of admission of job to ready queue to completion is_______
Turnaround time
Burst time
Response time
which of the following is the command for the searching a pattern in a file
find
grep
lookup
none
When fork() is given
It creats a child process
Allocate slot in process table
returns 0 to parent & ID to child
All of the above
