Scribd
Upload
46 views2 pages

OS Unitwise List of Questions

The document outlines a comprehensive list of questions for the CS 222 Operating Systems course, organized by units. Each unit covers various topics including process scheduling, deadlock handling, memory organization, and file management. The questions aim to test students' understanding of key concepts and encourage practice on relevant problems.

Uploaded by

Prem Pandu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views2 pages

OS Unitwise List of Questions

The document outlines a comprehensive list of questions for the CS 222 Operating Systems course, organized by units. Each unit covers various topics including process scheduling, deadlock handling, memory organization, and file management. The questions aim to test students' understanding of key concepts and encourage practice on relevant problems.

Uploaded by

Prem Pandu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 222 – Operating System Unit wise list of questions

Unit – I
1. Differentiate Multiprogramming and Time sharing.
2. List and explain the various Kernel data structures.
3. Discuss Operating system services.
4. Briefly explain different Operating systems interfaces.
5. Explain various Operating system structures with neat sketch.
6. What is a system call? Explain various types of system calls. Or
A question for individual type of system call.
7. Explain Inter process communication.
8. Explain the process scheduling with a neat queueing diagram.
Unit – II
1. Compare preemptive scheduling and non-preemptive scheduling.
2. Differentiate Process and Thread.
3. Explain various CPU scheduling algorithm. Or
A question includes any of the scheduling.
Example: Explain priority scheduling.
Note: Practice CPU scheduling problems.
4. Differentiate single threaded process and multithreaded process.
5. Discuss various approaches to solve critical section problem. Or
A question on solutions to critical section problem individually.
Example: Explain Peterson’s solution.
Explain Synchronization hardware.
Explain briefly Mutex locks.
6. Illustrate how semaphore acts as a synchronization tool?
7. Briefly explain Multicore programming.
8. Explain in detail Multithreading models with neat sketch.
9. Briefly explain Implicit threading.
10.Briefly explainvarious Threading issues.
11. What are the scheduling criteria? Explain in detail.
12.List and explain Real-time CPU scheduling algorithms.
13. Discuss the Classic problems of Synchronization.

Unit – III

1. What is the Deadlock characterization?


2. List and explain methods for handling deadlocks.
3. Explain briefly how to Recover form deadlock?
Note: Deadlock Avoidance:
Practice Banker’s algorithm, Resource request algorithm problems.
Deadlock detection:
For single instance of each resource type: Wait-for-graph in Deadlock
detection.
Practice Deadlock Detection algorithm problem.
4. Compare the memory organization schemes of Contiguous allocation,
Segmentation and Paging with respect to internal and external
fragmentations. Or
5. Explain what is structure of the page table?
6. What is Demand paging? How to implement it?
7. What is page fault? How to handle page fault?
8. Briefly explain allocation of frames.
9. Define Thrashing? How to solve the problem of Thrashing?
Note: Practice Page Replacement algorithm problems.
Unit – IV
1. Define a file. Explain file attributes and operations of files.
2. Briefly explain File system mounting and File sharing.
3. Describe the most common schemes for defining the logical structure of
a directory.
4. Explain various ways of implementing free space management.
5. Illustrate the disk scheduling algorithms FCFS, SSTF, SCAN and LOOK.
6. Compare Sequential and Direct file access methods. Or
Explain various access methods.
7. Explain Linked and Indexed allocation methods of disk space allocation.
Or
Explain different allocation methods of disk space allocation.
8. Explain how to provide protection to files.

Note: Practice Disk scheduling problems.

You might also like