Scribd
Upload
17 views

OS Assignment Question Bank

The document contains questions from 4 units that cover operating system concepts like command interpreters, interrupts, caching, scheduling algorithms, synchronization techniques, virtual memory, paging, fragmentation, demand paging, I/O hardware, file systems, and disk scheduling algorithms.

Uploaded by

lenkaprameela9
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

OS Assignment Question Bank

The document contains questions from 4 units that cover operating system concepts like command interpreters, interrupts, caching, scheduling algorithms, synchronization techniques, virtual memory, paging, fragmentation, demand paging, I/O hardware, file systems, and disk scheduling algorithms.

Uploaded by

lenkaprameela9
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Operating Systems 21IT403

Assignment Question Bank


Unit-1
1. What is the purpose of the command interpreter? Why is it usually separate from the kernel?
Would it be possible for the user to develop a new command interpreter using the system-call
interface provided by the OS?
2. What is the purpose of interrupts? What are the differences between a trap and an interrupt?
Can traps be generated intentionally by a user program? If so for what purpose?
3. Discuss, with examples, how the problem of maintaining coherence of cached data manifests
itself in the following processing environments.
Single-processor systems, Multiprocessor systems, Distributed systems
4. Can a multithreaded solution using multiple user-level threads achieve better performance on a
multiprocessor system than on a single processor system? Justify.
5. Problems on following Scheduling Algorithms(GATE level problems)
First-come-First Served, SJF, SRTF, Priority, Round Robin

Unit – 2
1. Describe a scenario in which a semaphore-based solution might lead to starvation. How can you
prevent or address this?
2. For the classical synchronization problem dining philosophers describe a potential deadlock
scenario within that problem. How can you modify the solution to avoid the deadlock?
3. Explain the Readers-Writers Problem/sleeping barber/Printer Spooler problem in the context
of process synchronization.
4. In a system with a complex set of resource dependencies, explain how you might use a resource
allocation graph to prevent or detect deadlocks. What challenges might you face in a system with
a high number of resources and processes?
5. Illustrate Deadlock avoidance algorithm with an example problem.

Unit – 3
1. Describe the process of address translation in paging. Discuss how virtual addresses are mapped
to physical addresses using page tables and explain the role of page tables in memory
management.
2. Discuss the concept of page replacement algorithms in paging. Compare and contrast different
page replacement algorithms such as FIFO, LRU, and Optimal, and explain how they impact
system performance.
3. Define virtual memory and explain its role in computer systems. Discuss how virtual memory
allows for efficient memory management and enables larger programs to run on systems with
limited physical memory.
4. Discuss the challenges associated with fragmentation in paging and segmentation. Explain how
internal and external fragmentation can occur and suggest strategies to mitigate fragmentation
issues.
5. Describe the concept of demand paging and how it is implemented in operating systems. Discuss
the advantages of demand paging in terms of memory utilization and system performance.

Unit – 4
1. Explain about I/O hardware and Application of I/O interface in detail.
2. What is disk scheduling? Compare various scheduling algorithms and suggest best algorithm for
your own snapshot.
3. Write in detail about file attributes, operations, file types and directory structures.
4. Explain the Disk Structure in detail. Explain different types of Disks.
5. Problems on following Disk Scheduling Algorithms(GATE level problems)
First-come-First Served, SRTF, SCAN, C-SCAN, LOOK, C-LOOK

You might also like