Questão 1
Questão
Which of the following page replacement algorithm use the technique of replace that page which is not used in the near future?
Responda
-
Least Recently Used
-
Least Frequently Used
-
Optimal Page Replacement
-
First In First Out
Questão 2
Questão
A common programming construct for implementing mutual exclusion which uses condition variables is called
Responda
-
Semaphore
-
Deadlock
-
Monitor
-
Locking interrupts
-
Threads
Questão 3
Responda
-
Direct Management access
-
Direct memory access
-
Dual memory access
-
Data memory access
-
Dual memory array
Questão 4
Questão
Which of the following is in correct order of size, smallest first?
Responda
-
Cylinder, track, sector
-
Cylinder, sector, track
-
Sector, track, cylinder
-
Sector, cylinder, track
-
Track, cylinder, sector
Questão 5
Questão
Which of the following is NOT a necessary condition for deadlock to occur?
Responda
-
Mutual exclusion
-
Hold and wait
-
Wait and signal
-
Circular wait
-
Hold
Questão 6
Questão
The time required to move the disk head to the desired track is known as
Responda
-
Access Time
-
Track Time
-
Latency Time
-
Seek Time
-
Block Time
Questão 7
Questão
A distributed system is a collection of processors that do not share_______.
Responda
-
CPU
-
Memory
-
I/O devices
-
Network
-
File
Questão 8
Questão
The process of converting logical address into physical address is known as
Responda
-
Conversion
-
Displacement
-
Relocation
-
Transfer
-
None of the above
Questão 9
Questão
In a segmentation scheme the logical memory will be divided into
Responda
-
Pages
-
Frames
-
Blocks
-
Cells
-
Segments
Questão 10
Questão
Which of the technique is used to recover the process from starvation situation?
Responda
-
Paging
-
Aging
-
Compaction
-
Starvation
-
Reduction
Questão 11
Questão
In Unix, dev/null
Questão 12
Questão
Redirection in pipes can be achieved by using
Questão 13
Questão
The PID of the kernel process is
Questão 14
Questão
Which of the following statements best explains a process?
Responda
-
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.
Questão 15
Questão
An incremental backup
Questão 16
Questão
In real-time operating systems, which of the following is the most suitable scheduling scheme?
Responda
-
round-robin
-
first-come-first-served
-
preemptive
-
random scheduling
Questão 17
Questão
If there are 32 segments, each of size 1 K byte, then the logical address should have
Responda
-
13 bits
-
14 bits
-
15 bits
-
16 bits
Questão 18
Questão
Which of the following refers to the associative memory?
Responda
-
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
Questão 19
Questão
Mutual exclusion problem occurs between
Responda
-
two disjoint processes that do not interact
-
processes that share resources
-
processes that do not use the same resource
-
None of these
Questão 20
Responda
-
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.
Questão 21
Questão
Which of the following page replacement algorithms suffers from Belady`s anomaly?
Questão 22
Questão
Locality of reference implies that the page reference being made by a process
Responda
-
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
Questão 23
Questão
The time of admission of job to ready queue to completion is_______
Responda
-
Turnaround time
-
Burst time
-
Response time
-
None of the above
Questão 24
Questão
which of the following is the command for the searching a pattern in a file
Questão 25
Questão
When fork() is given
Responda
-
It creats a child process
-
Allocate slot in process table
-
returns 0 to parent & ID to child
-
All of the above