 |
|
#1
11-30-2011, 12:05 AM
|
||||
|
||||
cs604 current paper final term
Scan Algorithm is sometimes called the elevator algorithm, why?
What is basic logic in FIFO page replacement algorithm? What is Mounting? Name two types of mounting. Give your answer with respect to File System? Write three main characteristics memory management System? Provide names of common file structures. What do you think that why Main Memory is kept as a volatile memory and why not a permanent storage device? Summarize the tradeoffs among simple arrays, trees, and hash tables as implementations of a page table. Name inter-process communication tools available in UNIX/Linux? How to implement hold and wait which can ensure that a deadlock will not occur? One question of Memory allocation in best fit worst case and first fit memory allocation Mostly MCQ's were before mid term. marks 2: i.busy waiting ii.context switching iii.Basic logic in FIFO page replacement algorithm, iv.formula to find size of page table, v.file control block, vi.one of the responsibility of O.S is to use computer hardware efficiently, so look algorithm for disk scheduling, marks 3: i.structure of 2-level page table, ii.if a process exits but its threads are still running, will they continue? iii.one advantage and one disadvantage of using a large block size to store file data, iv.three major frames of allocation scheme, v.in round robin scheduler deadlock and starvation can happen, vi.three types of access modes and classes of users in UNIX protection, marks 5: i. A file system must keep track of free blocks on disk. Name two schemes for doing this, and one advantage for each, ii. find max. bits for page and frame where pages=16, frame=32 iii. possible criteria to decide that which process should be terminated while dead lock detection and recovery, 
|
|
Linear Mode
