Bachelor of Computer Applications (Part-III)

Paper – III Operating System
Time: 3 Hours M. Marks: 100

Note 1: In theory eight questions are to be set in all. The candidates are required to attempt five of them. All questions are to be of equal marks.
2. The students can use only Non-Programmable & Non-Storage Type Calculators.

1. Introduction: Definition, Early Systems, Simple Batch system, Multi programmed Batch. Time Sharing Systems, Personal Computer System, Parallel Systems, Distributed Systems, Real-time Systems.

2. Processes: Process concepts, Process Scheduling, threads.

3. CPU-Scheduling: Basic concepts, scheduling criteria, scheduling algorithms, algorithm evaluation.

4. Process Synchronization: Background critical – section, problem, seraphores, classical problem of synchronization.

5. Memory Management: Background, Logical v/s Physical address space, wapping, continuous allocation, paging, segmentation.

6. Virtual Memory: Background, demand paging, performance of demand paging, page replacement, page replacement algorithms, allocation of frames, threshing.

7. Secondary Storage Structures: Disk structures, Disk scheduling, Disk Reliability.

8. Deadlocks: System Model, Deadlock characterization, methods for handing deadlocks, Deadlocks Prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock, combined approach to deadlock handling.