Our website provides solved previous year question paper for Operating Systems from 2012 to 2012. Doing preparation from the previous year question paper helps you to get good marks in exams. From our OS question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.
1. Introduction (4 Hours)
Operating System (OS): Objectives, Functions, Evolution, Classification, Booting
(Cold and Warm)
2. e Op rating System Structures (6 Hours)
OS Services, User Interface (Command‐Line Interface, Graphical User Interface),
System Calls, Kernel, OS structure (monolithic, layered and microkernel)
3. Process Management (10 Hours)
Process, Process States, Process Control Block (PCB), Operations on Processes,
Inter‐process Communication, Process Synchronization – Critical Section Problem,
Solutions to Critical Section Problem – Peterson’s Solution, Hardware Solution,
Semaphores and Monitors, Deadlocks – Essential Conditions, Prevention and
Avoidance – Bankers Algorithm, Threads – User‐level and Kernel‐level threads,
Multithreading Models – Many to One, One to One, Many to Many
4. CPU Scheduling (10 Hours)
Scheduling – Objectives, performance criteria, CPU and I/O burst cycle,
Preemptive Vs. Non preemptive scheduling, CPU Scheduler(Long‐term,
Short‐term), Scheduling Algorithms: First‐come‐first‐served (FCFS), Shortest job
first (SJF), Shortest Remaining Time First (SRTF), Round Robin (RR), Priority
Scheduling, Multilevel Queue Scheduling, Multilevel Feedback Queue
5. Memory Management (10 Hours)
Contiguous Memory Allocation – MFT, MVT, Buddy System, Fragmentation
(Internal, External), Compaction, Memory Hole Allocation Strategies (First‐fit,
Best‐fit, Worst‐fit), Non‐contiguous Memory Allocation – Paging – Logical and
Physical Address Spaces, Page, Frame, Shared Pages, Page Table Structure –
Hierarchical, Hashed and Inverted, Segmentation – User View of main memory,
Segments.
18
6. Virtual Memory (4 Hours)
Swapping, Demand Paging, Page Replacement Policies – FIFO, Optimal, LRU, LFU
and MFU, Thrashing
7. Storage Management (8 Hours)
File – Concept, Attributes, Operations, Types, Structure, Access Methods –
Sequential and Direct, Allocation Methods – Contiguous, Linked, Indexed,
Directory Structure – Single level, Two level and Tree Structure, Free Space
management techniques –Bitmap and Linked List, Disk Scheduling
8. I/O Subsystem (6 Hours)
I/O instructions based and Memory‐mapped I/O systems, Polling, Interrupts,
DMA, Buffering, Caching, Spooling
9. Case Studies (6 Hours)
Features comparison of Windows Family, UNIX, Linux and Android Operating
Systems