Module 1 – OS Basics & Structure
• Distinguish between Multiprogramming and Multitasking.
Repeated: 4 times
• Explain dual mode operation of operating system with neat diagram.
Repeated: 4 times
• Explain system calls and types of system calls.
Repeated: 3 times
• Explain the concept of virtual machine with neat diagram.
Repeated: 3 times
Module 2 – Process & CPU Scheduling
• Explain process states with transition diagram and Process Control Block.
Repeated: 5 times
• Explain Inter Process Communication using message passing and shared memory.
Repeated: 4 times
• Calculate average waiting time and turnaround time using FCFS scheduling (with table).
Repeated: 4 times
• Calculate average waiting time and turnaround time using Round Robin scheduling (with table).
Repeated: 4 times
• Explain multithreading models with advantages and disadvantages.
Repeated: 3 times
Module 3 – Deadlock & Synchronization
• What is deadlock? What are the necessary conditions for deadlock to occur?
Repeated: 5 times
• Apply Banker’s algorithm to find safe sequence (Allocation, Max, Available tables).
Repeated: 6 times
• Explain Peterson’s solution to critical section problem.
Repeated: 4 times
• Explain semaphore and solve Dining Philosopher problem using semaphore.
Repeated: 3 times
Module 4 – Memory Management
• Explain paging hardware with TLB using neat diagram.
Repeated: 4 times
• Solve page replacement using FIFO algorithm with page reference string.
Repeated: 4 times
• Solve page replacement using LRU algorithm with page reference string.
Repeated: 4 times
• Solve page replacement using Optimal algorithm with page reference string.
Repeated: 4 times
• Explain demand paging and handling of page fault.
Repeated: 3 times
Module 5 – File & Disk Management
• Explain file attributes and file operations.
Repeated: 4 times
• Explain directory structures with neat diagrams.
Repeated: 3 times
• Solve disk scheduling using FCFS algorithm with given sequence.
Repeated: 4 times
• Solve disk scheduling using SSTF algorithm with given sequence.
Repeated: 4 times
• Solve disk scheduling using LOOK and CLOOK algorithms.
Repeated: 4 times
• Explain access matrix model of protection in operating systems.
Repeated: 3 times