 |
|
#1
11-30-2011, 01:39 PM
|
||||
|
||||
cs604 final papers 2011 ***
2 marks questions:
Problem occur while trying to avoid the condition of hold and wait for deadlock? Write Disadvantages of dynamic loading? Write name of common file structure? Is it possible to install virtual machine on windows platform to run LINUX and how? What Difference between outer page and inner page table? 3 marks questions: What are the three stages/times when the address is bound to instructions and data? Write difference between binary and counting semaphore? If we create a pipe and a pipe return a numeric value -1 what does it means? Will CPU utilization is decrease due to high page fault rate? If average page fault time is 20 milliseconds and memory access time is 100 nanoseconds Then calculate effective access time? 5 marks questions: Explain page fault and how to handle? Write advantages of dynamic loading? Explain page fault frequency model how to control page thrashing? PAPER#1 FINAL TERM EXAMINATION SPRING 2011 (15 JULY 2011) CS604 – OPERATING SYSTEMS Time: 120 min Marks: 80 Total 53 Questions 40 x MCQs 5 x 2 Marks Questions 5 x 3 Marks Questions 3 x 5 Marks Questions Subjective Portion is as under:- Question No: 41 ( Marks: 2 ) Give one solution of Dinning Philosophers problem. Question No: 42 ( Marks: 2 ) In swapping what does mean by Roll In and Roll Out? Question No: 43 ( Marks: 2 ) How taking backup in Linux / Unix is easier than windows? Question No: 44 ( Marks: 2 ) Number of free frames = 64, Number of processes = 3 and Process sizes: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages. Calculate free frames using fixed allocation method. Question No: 45 ( Marks: 2 ) Virtual memory is a separation of user logical memory from Physical Memory. Is it makes programming easy or difficult? Question No: 46 ( Marks: 3 ) What do you understand by protection bit in Primary Protection Scheme under paging? Question No: 47 ( Marks: 3 ) Is in necessary to have reference count with in a file descriptor in order to implement a soft link? Question No: 48 ( Marks: 3 ) If a process is starved then a system is in state of Deadlock. Statement is correct or incorrect? Question No: 49 ( Marks: 3 ) What I the difference in Deadlock Prevention and Deadlock Avoidance Question No: 50 ( Marks: 3 ) Differentiate between a library call and a system call Question No: 51 ( Marks: 5 ) Following hole sizes are available in a variable memory system 20k 15k 40k 60k 10k 25k A new process of 25k is loaded into system, which hole sizes will be used by Best Fit, First Fit and Worst Fit? Question No: 52 ( Marks: 5 ) How a page fault occurs and who is responsible to handle page faults? Question No: 53 ( Marks: 5 ) Differentiate between Least Frequent Used Algorithm and Most Frequent Used Algorithm in context of Page Replacement Algorithms. PAPER#2 ONE MORE PAPER Total 53 Questions 40 x MCQs 5 x 2 Marks Questions 5 x 3 Marks Questions 3 x 5 Marks Questions Subjective Portion is as under:- Question No: 41 ( Marks: 2 ) Give one solution of Dinning Philosophers problem. Question No: 42 ( Marks: 2 ) In swapping what does mean by Roll In and Roll Out? Question No: 43 ( Marks: 2 ) How taking backup in Linux / Unix is easier than windows? Question No: 44 ( Marks: 2 ) Number of free frames = 64, Number of processes = 3 and Process sizes: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages. Calculate free frames using fixed allocation method. Question No: 45 ( Marks: 2 ) Virtual memory is a separation of user logical memory from Physical Memory. Is it makes programming easy or difficult? Question No: 46 ( Marks: 3 ) What do you understand by protection bit in Primary Protection Scheme under paging? Question No: 47 ( Marks: 3 ) Is in necessary to have reference count with in a file descriptor in order to implement a soft link? Question No: 48 ( Marks: 3 ) If a process is starved then a system is in state of Deadlock. Statement is correct or incorrect? Question No: 49 ( Marks: 3 ) What I the difference in Deadlock Prevention and Deadlock Avoidance Question No: 50 ( Marks: 3 ) Differentiate between a library call and a system call Question No: 51 ( Marks: 5 ) Following hole sizes are available in a variable memory system 20k 15k 40k 60k 10k 25k A new process of 25k is loaded into system, which hole sizes will be used by Best Fit, First Fit and Worst Fit? Question No: 52 ( Marks: 5 ) How a page fault occurs and who is responsible to handle page faults? Question No: 53 ( Marks: 5 ) Differentiate between Least Frequent Used Algorithm and Most Frequent Used Algorithm in context of Page Replacement Algorithms. in free space list which two techniques are used to track the free blocks.write one advantag of each one 5 marks indexed allocation.......as space allocation method 5 marks wt types of problems in hard links.....3 marks in beladay,s algorithm ,FIFO PAGE REPLACEMENT .....5 marks how can page fault occur and who is responsible for handle it...5 marks is virtual memory programming ,wt ur opinion is it expansive or not Cs604 today’s paper 5 marks What issues can arise when using Round Robin Scheduling with swapping techniques How pre-paging prevents high level of initial paging Demand Paging 3 marks why Process bahaves in such a way as loading all program in memory is not necessary (in many cases) If a process starved it leads to system dead lock Is this statement true or false? Reason Memory maping system calls Page Fault Frequency 1 Advantage and 1 disadvantage of using large block size to store data 2 Marks Requirements of critical section problem Dynamic Loading disadvantage What issues can arise when hold and wait is violated What is solution of thrashing FINAL TERM EXAMINATION SPRING 2011 (15 JULY 2011) CS604 – OPERATING SYSTEMS Time: 120 min Marks: 80 Total 53 Questions 40 x MCQs 5 x 2 Marks Questions 5 x 3 Marks Questions 3 x 5 Marks Questions Subjective Portion is as under:- Question No: 41 ( Marks: 2 ) Give one solution of Dinning Philosophers problem. Question No: 42 ( Marks: 2 ) In swapping what does mean by Roll In and Roll Out? Question No: 43 ( Marks: 2 ) How taking backup in Linux / Unix is easier than windows? Question No: 44 ( Marks: 2 ) Number of free frames = 64, Number of processes = 3 and Process sizes: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages. Calculate free frames using fixed allocation method. Question No: 45 ( Marks: 2 ) Virtual memory is a separation of user logical memory from Physical Memory. Is it makes programming easy or difficult? Question No: 46 ( Marks: 3 ) What do you understand by protection bit in Primary Protection Scheme under paging? Question No: 47 ( Marks: 3 ) Is in necessary to have reference count with in a file descriptor in order to implement a soft link? Question No: 48 ( Marks: 3 ) If a process is starved then a system is in state of Deadlock. Statement is correct or incorrect? Question No: 49 ( Marks: 3 ) What I the difference in Deadlock Prevention and Deadlock Avoidance Question No: 50 ( Marks: 3 ) Differentiate between a library call and a system call Question No: 51 ( Marks: 5 ) Following hole sizes are available in a variable memory system 20k 15k 40k 60k 10k 25k A new process of 25k is loaded into system, which hole sizes will be used by Best Fit, First Fit and Worst Fit? Question No: 52 ( Marks: 5 ) How a page fault occurs and who is responsible to handle page faults? Question No: 53 ( Marks: 5 ) Differentiate between Least Frequent Used Algorithm and Most Frequent Used Algorithm in context of Page Replacement Algorithm CS604 FINAL TERM 18 July 2011 All MCQS from handoutts…. THEORY QUESTIONS 1. Suggest some way to reduce external fragmentation. 2. Write down the code/ pseudo-code for the wait operation on counting semaphore. 3. The problem with using an acyclic-graph structure is ensuring that there are no cycles. What is the solution? 4. If processes P and Q want to communicate, a communication link must exist between them and they send messages and receive messages. How many possible methods to communicate with each other 5. Differentiate between outer page table and inner page table. A page table needed for keeping track of pages of the page table is called the outer page table. The other part of the page table index is called the inner page table. 6. Describe Safe state with reference to Deadlock Avoidance. 7. What is the main idea behind Overlays memory management technique? 8. How vfork system call differes from fork system call? . 9. What is the problem hard links creates in terms of referential naming? How does one solve it? 10. An operating system is intermediary between the user and the hardware system? . 11. Consider a logical address space of eight pages of 1024 words each, mamapped ont a physical memory of 32 frames. a. How many bits are there in the logical address? b. How many bits are there in the physical address? 12. Describe the concept of Directory Entry. 13. Consider the following segmented paging memory system. There are 4 segments for the given process and a total of 5 page tables in the entire system. Each page table has a total of 8 entries. The physical memory requires 12 bits to address it; there are a total of 128 frames. (a) How many bytes are contained within the physical memory? 80% mcqz from past papers 3 question 5 marks per deadlock detect and recover how? decreasing page fault. Thrashing. 5 questions 3 marks per scan algorithm swap space reader,writer first problem demand page fifo page replacement 5 questions 2 marks per deadlock banker's algorithm segmentation external fragmention pipe structure What is mounting and mount count 2marks Some way to reduce external fragmentation 2marks Four characteristic of deadlock preventation 2 marks Is starvation and deadlock are same. Accept or reject with solid reason 3 marks Why we need medium term scheduling? 3marks If hard realtime system cannot manage output with in given slot then what happen? 3marks Difference between deadlock avoidance and deadlock prevention? 3marks Working of copy on write in virtual memory 5marks 2 numerical thy 5 marks k ek 3 marks ka bhi numerical tha FINAL TERM EXAMINATION SPRING 2011 (15 JULY 2011) CS604 – OPERATING SYSTEMS Time: 120 min Marks: 80 Total 53 Questions 40 x MCQs 5 x 2 Marks Questions 5 x 3 Marks Questions 3 x 5 Marks Questions Subjective Portion is as under:- Question No: 41 ( Marks: 2 ) Give one solution of Dinning Philosophers problem. Question No: 42 ( Marks: 2 ) In swapping what does mean by Roll In and Roll Out? Question No: 43 ( Marks: 2 ) How taking backup in Linux / Unix is easier than windows? Question No: 44 ( Marks: 2 ) Number of free frames = 64, Number of processes = 3 and Process sizes: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages. Calculate free frames using fixed allocation method. Question No: 45 ( Marks: 2 ) Virtual memory is a separation of user logical memory from Physical Memory. Is it makes programming easy or difficult? Question No: 46 ( Marks: 3 ) What do you understand by protection bit in Primary Protection Scheme under paging? Question No: 47 ( Marks: 3 ) Is in necessary to have reference count with in a file descriptor in order to implement a soft link? Question No: 48 ( Marks: 3 ) If a process is starved then a system is in state of Deadlock. Statement is correct or incorrect? Question No: 49 ( Marks: 3 ) What I the difference in Deadlock Prevention and Deadlock Avoidance Question No: 50 ( Marks: 3 ) Differentiate between a library call and a system call Question No: 51 ( Marks: 5 ) Following hole sizes are available in a variable memory system 20k 15k 40k 60k 10k 25k A new process of 25k is loaded into system, which hole sizes will be used by Best Fit, First Fit and Worst Fit? Question No: 52 ( Marks: 5 ) How a page fault occurs and who is responsible to handle page faults? Question No: 53 ( Marks: 5 ) Differentiate between Least Frequent Used Algorithm and Most Frequent Used Algorithm in context of Page Replacement Algorithms Total 53 Questions 40 x MCQs 5 x 2 Marks Questions 5 x 3 Marks Questions 3 x 5 Marks Questions Subjective Portion is as under:- Question No: 41 ( Marks: 2 ) Give one solution of Dinning Philosophers problem. Question No: 42 ( Marks: 2 ) In swapping what does mean by Roll In and Roll Out? Question No: 43 ( Marks: 2 ) How taking backup in Linux / Unix is easier than windows? Question No: 44 ( Marks: 2 ) Number of free frames = 64, Number of processes = 3 and Process sizes: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages. Calculate free frames using fixed allocation method. Question No: 45 ( Marks: 2 ) Virtual memory is a separation of user logical memory from Physical Memory. Is it makes programming easy or difficult? Question No: 46 ( Marks: 3 ) What do you understand by protection bit in Primary Protection Scheme under paging? Question No: 47 ( Marks: 3 ) Is in necessary to have reference count with in a file descriptor in order to implement a soft link? Question No: 48 ( Marks: 3 ) If a process is starved then a system is in state of Deadlock. Statement is correct or incorrect? Question No: 49 ( Marks: 3 ) What I the difference in Deadlock Prevention and Deadlock Avoidance Question No: 50 ( Marks: 3 ) Differentiate between a library call and a system call Question No: 51 ( Marks: 5 ) Following hole sizes are available in a variable memory system 20k 15k 40k 60k 10k 25k A new process of 25k is loaded into system, which hole sizes will be used by Best Fit, First Fit and Worst Fit? Question No: 52 ( Marks: 5 ) How a page fault occurs and who is responsible to handle page faults? Question No: 53 ( Marks: 5 ) Differentiate between Least Frequent Used Algorithm and Most Frequent Used Algorithm in context of Page Replacement Algorithms What is mounting and mount count 2marks Some way to reduce external fragmentation 2marks Four characteristic of deadlock preventation 2 marks Is starvation and deadlock are same. Accept or reject with solid reason 3 marks Why we need medium term scheduling? 3marks If hard realtime system cannot manage output with in given slot then what happen? 3marks Difference between deadlock avoidance and deadlock prevention? 3marks Working of copy on write in virtual memory 5marks 2 numerical thy 5 marks k ek 3 marks ka bhi numerical tha 80% mcqz from past papers 3 question 5 marks per deadlock detect and recover how? decreasing page fault. Thrashing. 5 questions 3 marks per scan algorithm swap space reader,writer first problem demand page fifo page replacement 5 questions 2 marks per deadlock banker's algorithm segmentation external fragmention pipe structure 
|
|
Linear Mode
