Operating Systems (AL-501) - Important Questions
-
Unit 17 Marks High Priority
What is an operating system? Explain its different types/classification with suitable examples.
Predicted for DEC-2026
-
Unit 17 Marks High Priority
Explain the services and functions provided by an operating system, including how they are provided through system calls and commands with examples.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Discuss disk space allocation methods: contiguous, linked and indexed allocation with diagrams, advantages and disadvantages.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Explain directory structures in file systems and discuss file protection mechanisms and access control methods.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Consider a given set of processes with arrival time and burst time. Draw Gantt chart and calculate turnaround time and waiting time for FCFS, SJF, SRTF and Round Robin (quantum 10) scheduling algorithms.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
What are threads and multithreading? Compare user-level threads and kernel-level threads in terms of creation, scheduling, performance and overhead.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain the producer-consumer problem and its solution using semaphores, showing how synchronization and mutual exclusion are achieved.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
What do you understand by system call? List and explain four system calls used for process management.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Define deadlock and explain the four necessary conditions / characterization for deadlock to occur.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain the Banker's algorithm for deadlock avoidance, including deadlock conditions.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Using Banker's algorithm on a given snapshot, compute the Need matrix, determine if the system is in a safe state with safe sequence, and check if a request can be granted.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
Explain the concept of paging and how it helps in memory management.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
Given memory partitions 100K, 500K, 200K, 300K, 600K in order, show how First-fit, Best-fit and Worst-fit place processes 212K, 417K, 112K and 426K in order and determine which algorithm makes the most effective use of memory.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
Explain demand paging and determine the number of page faults for a given reference string using FIFO, LRU and Optimal page replacement algorithms with three page frames.
Predicted for DEC-2026
-
Unit 57 Marks High Priority
Explain the role of the Kernel I/O Subsystem in an operating system. Discuss how I/O requests are transformed into hardware operations.
Predicted for DEC-2026
-
Unit 57 Marks High Priority
Differentiate between synchronous and asynchronous I/O operations.
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