Are you Searching GNDU Question papers? Here you can get Operating system April 2011 Question paper. This is B.C.A Computer Application Question paper.
Guru Nanak Dev University
B.C.A Computer Application
Bachelor of Computer Applications(Part-3rd)
Operating system
April 2011
[Time allowed-Three Hours]
[Maximum Marks-100]
Note:Attempt any FIVE questions.All questions carry equal marks.The students can use only non-programmable and non-storage type calculator.
1. (a) list five services provided by an operating system. Explain how each provides convenience to users?
(b) Write notes on the following:-
(I) distributed operating system.
(II) Real-time operating system
2. (a) Explain and differentiate among the following terms:-
(I) process
(II) Procedure
(III) Processor
Also discuss different process states with diagram.
(b) Explain the following terms:
(I) short-term scheduler
(II) medium-term scheduler
(III) Long-term scheduler
(IV) Preemptive scheduling
(v) Non-preemptive scheduling.
3. CPU Scheduling algorithm determines an order for execution of scheduling process. Given n processes to be scheduled on one processor, how many different possible schedules are there? Explain in detail.
4. (a) what are semaphores? Describe how semaphores can be used for block/wake up synchronization between processes?
(b) What is readers-writers problem? Explain the method by which this problem can be solved.
5. (a) explain the following memory allocation algorithms:-
(I) first-fit
(II) best-fit
(III) Worst-fit
(b) Consider a logical address space of 8 pages of 1024 words each mapped on physical of 32 bit frames.
(I) how many bits are there in the logical address?
(II) How many bits are there in the physical address?
(c) What is paging and how paging is used to remove external fragmentation?
6. (a) what is virtual memory? What are different benefits of virtual memory and what are different techniques by which it can be implanted?
(b) Define demand paging? What do you mean by page fault? Discuss the following page replacement algorithm with example:
(I) FIFO
(II) LRU
(III) Optimal
7. (a) why disk scheduling is important in the performance of operating system? Describe the following disk scheduling algorithm with an example:-
(I) FCFS
(II) SSTF
(III) LOOK
(V) C-SCAN
(VI) C-LOOK
(b) Explain the following:-
(I) CPU Utilization
(II) Waiting time
(III) Response time
8. What is a deadlock? What are the necessary conditions for a deadlock? How deadlock can be detected and prevented? Can it be avoided? If so, explain in detail.
Guru Nanak Dev University
B.C.A Computer Application
Bachelor of Computer Applications(Part-3rd)
Operating system
April 2011
[Time allowed-Three Hours]
[Maximum Marks-100]
Note:Attempt any FIVE questions.All questions carry equal marks.The students can use only non-programmable and non-storage type calculator.
1. (a) list five services provided by an operating system. Explain how each provides convenience to users?
(b) Write notes on the following:-
(I) distributed operating system.
(II) Real-time operating system
2. (a) Explain and differentiate among the following terms:-
(I) process
(II) Procedure
(III) Processor
Also discuss different process states with diagram.
(b) Explain the following terms:
(I) short-term scheduler
(II) medium-term scheduler
(III) Long-term scheduler
(IV) Preemptive scheduling
(v) Non-preemptive scheduling.
3. CPU Scheduling algorithm determines an order for execution of scheduling process. Given n processes to be scheduled on one processor, how many different possible schedules are there? Explain in detail.
4. (a) what are semaphores? Describe how semaphores can be used for block/wake up synchronization between processes?
(b) What is readers-writers problem? Explain the method by which this problem can be solved.
5. (a) explain the following memory allocation algorithms:-
(I) first-fit
(II) best-fit
(III) Worst-fit
(b) Consider a logical address space of 8 pages of 1024 words each mapped on physical of 32 bit frames.
(I) how many bits are there in the logical address?
(II) How many bits are there in the physical address?
(c) What is paging and how paging is used to remove external fragmentation?
6. (a) what is virtual memory? What are different benefits of virtual memory and what are different techniques by which it can be implanted?
(b) Define demand paging? What do you mean by page fault? Discuss the following page replacement algorithm with example:
(I) FIFO
(II) LRU
(III) Optimal
7. (a) why disk scheduling is important in the performance of operating system? Describe the following disk scheduling algorithm with an example:-
(I) FCFS
(II) SSTF
(III) LOOK
(V) C-SCAN
(VI) C-LOOK
(b) Explain the following:-
(I) CPU Utilization
(II) Waiting time
(III) Response time
8. What is a deadlock? What are the necessary conditions for a deadlock? How deadlock can be detected and prevented? Can it be avoided? If so, explain in detail.
![Lucknow University B.A./B.Sc. (Part-III) (Back Paper) MATHEMATICS [ Third Paper ] Numerical Analysis and Programming in C - 2018 Question Paper](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjSRFF5B8mgwVKJswFbXFVMbYPkwZ5huZNYCbcvphN2nQ2jOctgxD-2OCGkKWECevFXYTdxUFbTDJhx7JzU880M-lNAV3yJhbPerY9N4OWHvh54NGmgoYOfAy9GWFzvBsiTMVcvjNuGYIs/s72-w640-c-h458/97+1.png "Lucknow University B.A./B.Sc. (Part-III) (Back Paper) MATHEMATICS [ Third Paper ] Numerical Analysis and Programming in C - 2018 Question Paper")
0 comments:
Pen down your valuable important comments below