Sie sind auf Seite 1von 1

1) Using a larger block size in a fixed block size file system leads to better d

isk throughput but poorer disk


space utilization.
2) For user-level threads, a system call can block the entire process. Kernel su
pported threads can be
scheduled Independently.
3) The min no. of page frames that must be allocated to a running process in a v
irtual memory environment is
determined by the Instruction set architecture.
4) In a computer system which supports same size virtual & physical addresses, h
ardware support for memory
management is no longer needed.
5) Gang scheduling= Thread scheduling, Rate monotonic scheduling= Real-time sche
duling, Fair share
scheduling= Guaranteed scheduling.
6) Blocking one kernel level thread does not blocks all related threads.
7) In a FIFO page replacement policy, Inc. the no. of page frames allocated to a
process sometimes Inc. the page
fault rate, but some program do not exhibit locality of reference.
8) Connect system calls results in the sending of SYN packets.
9) The data block of a very large file in the Unix file system are allocated usi
ng an extension of Indexed allocation.
10) In both synchronous & asynchronous I/O an ISR (Interrupt Service Routine) is
not Invoked after completion
of the I/O.
11) Deadlock avoidance is more restrictive than deadlock prevention.
12) Belady's anomaly occur in FIFO page replacement policy. The essential conten
t in each entry of a page
table is page frame no.
13) A multilevel page table is preferred in comparison to a single level page ta
ble for translating virtual address to
physical address because it helps to reduce the size of page table needed
to Implement the virtual address
space of a process.
14) SRTF & Preemptive scheduling may cause starvation. Round Robin is better tha
n FCFS in terms of response time. Interrupt from CPU temp. sensor has high
est priority in comparison to Interrupt from Hard Disk,
Mouse & Keyboard.
15) A thread is usually defined as a "light weight process" because an OS mainta
ines smaller data structures for a
thread than for a process. On per-thread basis, the OS does not maintain v
irtual memory state.

Das könnte Ihnen auch gefallen