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
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
...............
Another Paper:
q list down 2 major benefits of virtual memory
q what are the possible system for the input redirection in the UNIX/LINX system
q what is the purpose of stud in dynamic linking ,give answer with respect to memory
q what is use of mounting in file system
q the scan algorithm is sometime called eveloater . why ?
q how operating attacks the" no preemption "condition necessary for feedback in order to solve the pro of deadlock
q what is pager ? give answer with respect to virtual memory
q what does the following command do in the LINX/UNIX operating system
$mkdir/courses/cs604/program
q how u can differentiate between external and internal fragmentation
q how page fault freqancy can b used as a method of thrashing
q 3 major frame allocation scheme
q consider the round robin technique .do u think that the deadlock or starvation can happen in the round robin tech scheduling
q explain the work of copy on write with respect to virtual memory
q what are the possible system for the input redirection in the UNIX/LINX system
q what is the purpose of stud in dynamic linking ,give answer with respect to memory
q what is use of mounting in file system
q the scan algorithm is sometime called eveloater . why ?
q how operating attacks the" no preemption "condition necessary for feedback in order to solve the pro of deadlock
q what is pager ? give answer with respect to virtual memory
q what does the following command do in the LINX/UNIX operating system
$mkdir/courses/cs604/program
q how u can differentiate between external and internal fragmentation
q how page fault freqancy can b used as a method of thrashing
q 3 major frame allocation scheme
q consider the round robin technique .do u think that the deadlock or starvation can happen in the round robin tech scheduling
q explain the work of copy on write with respect to virtual memory
No comments:
Post a Comment