Operating System (IT-501) - Important Questions
-
Unit 17 Marks High Priority
Define an operating system and explain its objectives, functions and major services, including user-oriented and system-oriented services.
Predicted for DEC-2026
-
Unit 17 Marks High Priority
Define what an operating system is and explain the different types of operating systems with examples.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Explain CPU scheduling criteria and describe different preemptive and non-preemptive scheduling algorithms.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Explain the process concept and operations on processes.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Consider 3 processes P1, P2 and P3 which require 5, 7 and 6 time units and arrive at time 0, 1 and 4. Draw Gantt chart and find completion sequence and average waiting time for Round Robin with quantum 2 and FCFS.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
What is meant by indefinite blocking or starvation? Show that if the wait() and signal() semaphore operations are not executed atomically, then mutual exclusion may be violated.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Explain the critical section problem, its requirements/conditions and illustrate with an example.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
Consider the page reference string 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. Calculate number of page faults using LRU, FIFO and Optimal replacement algorithms.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain deadlock and its necessary conditions.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Using Banker's algorithm, compute the Need matrix, check if the system is in a safe state and give the safe sequence, and decide if a resource request can be granted.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain memory management techniques including fixed and dynamic partitioning.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB in order, how would each of the first-fit, best-fit and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB in order? Which algorithm is most efficient?
Predicted for DEC-2026
-
Unit 57 Marks High Priority
Suppose a disk drive has 5000 cylinders numbered 0 to 4999. The drive is currently serving a request at cylinder 143 and the previous request was at cylinder 125. The queue of pending requests in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130. Compute total head movement for FCFS, SSTF, SCAN and LOOK.
Predicted for DEC-2026
-
Unit 57 Marks High Priority
Explain file management in an operating system, including file organization and access methods.
Predicted for DEC-2026
-
Unit 57 Marks High Priority
Describe various directory structures.
Predicted for DEC-2026
-
Unit 57 Marks High Priority
Explain introduction to distributed systems, its types, advantages and design issues with suitable examples.
Predicted for DEC-2026
Quick Add to Notes
Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.
Create free accountHave an account? Log in
Notes Panel