Are you looking for GNDU BCA old question papers ? You will here find BCA Part II 2007 old question paper for the subject Operating system. Read the details below and get your exam paper contents.
GNDU Question Paper
BCA Part-III Sept 2007
Operating system
Time allowed: Three Hours
Maximum Marks:100
Note: Attempt any Five questions. All questions carry equal marks. [20 marks each]
1. (a) What do you mean by an Operating System and the importance of Operating system?
(b) Explain Time Sharing and Real Time Systems.
2. In some situations, a change in the state of one process may cause a change in state of another process. Explain all such situations.
3. What do you mean by process scheduling? Explain priority based scheduling.
4. (a) What do you mean by paging? Distinguish between paging and segmentation.
(b) Discuss memory fragmentation.
5. (a) Explain page replacement policies.
(b) Explain Thrashing.
(c) Explain Swapping.
6. What are semaphores? What are the different types of semaphores and how are they implemented? How semaphore implement Mutual Exclusion?
7. Explain the following:
(a) Deadlock and Deadlock Avoidance.
(b) Disk Scheduling.
8. Write short note on:
(a) Virtual Memory
(b) Threads
(c) Distributed System
(d) Demand Paging.
GNDU Question Paper
BCA Part-III Sept 2007
Operating system
Time allowed: Three Hours
Maximum Marks:100
1. (a) What do you mean by an Operating System and the importance of Operating system?
(b) Explain Time Sharing and Real Time Systems.
2. In some situations, a change in the state of one process may cause a change in state of another process. Explain all such situations.
3. What do you mean by process scheduling? Explain priority based scheduling.
4. (a) What do you mean by paging? Distinguish between paging and segmentation.
(b) Discuss memory fragmentation.
5. (a) Explain page replacement policies.
(b) Explain Thrashing.
(c) Explain Swapping.
6. What are semaphores? What are the different types of semaphores and how are they implemented? How semaphore implement Mutual Exclusion?
7. Explain the following:
(a) Deadlock and Deadlock Avoidance.
(b) Disk Scheduling.
8. Write short note on:
(a) Virtual Memory
(b) Threads
(c) Distributed System
(d) Demand Paging.
0 comments:
Pen down your valuable important comments below