B.Sc.
(Information Technology) PART-III
Paper – II Operating Systems
Time: 3 Hrs. Max. 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. The maximum
marks of the paper is 100.
2. The student can use only Non-programmable & Non-storage type Calculator.
Introduction:
Definition, evolution, need, early system, function, buffering spooling,
single user, multiuser, multiprogramming, multiprocessing, multitasking,
multithreading, batch processing, real time, time systems, time sharing
systems, security, protection.
Processor
Management / CPU Scheduling:
CPU - I/O Basic Cycle, process state, process control lock, Scheduling,
Queue, Schedulers, Scheduling Algorithms, Performance criteria, FCFS,
SJF, Priority, SRTF, Round Robin, Multi - Levels users Algorithm.
Memory
Management:
Preliminaries, Machine Resident monitor, relocation, Swapping, backing
storage, swap time, registers, box and limit registers, MFT, MFT job scheduling,
region size selection, memory fragmentation, MVT, MVT job scheduling compaction,
paging, Hardware, Job Scheduling.
Virtual
Memory:
Overlays, demand paging, page fault, performance of demand paging, page
replacement, page replacement algorithm, FIFO, optional replacement fault
frequency, page size.
Device
Management:
I/O and device management physical characteristics, FCFX, SSTF, SCAN,
CSCAN.
File
Management:
Disk and File Management.
Deadlocks:
Definition, Necessary condition, to occur RAG, Deadlock Prevention Mutual
exclusion, Hold and wait, No pre-emption, circular wait Bankder’s
algorithms, Recovery from deadlock, remaphores. |
