CS604 Current FinalTerm Paper 24 August 2016

Q#1 how can you illustrate problem where reader needs not to wait for another reader?also write why one reader should not wait for another reader?

Q#2 Dining philosopher problem dead looks occur while eating can be removed by applying criterian strategies…suggest any two 

Q#3 List scanerio in which existence of entire program in memory is not necessary.

Q#4 why scan algorithm is some times called elevtor algo?

Q#5 why main memory is kept volatile?what do you think

Q#6 Scanerio when fifo suffer from Belady’s algo?

Q#7 In segmentation how do you evaluate whether logical adres is legal or not?

Q#8 Write a function that can swap two variables?

Q#9 Two file management stretagies?

Q#10 Algo that share hardware and software…………………..process in critical section problem?
Please remember me in ur prayers