Scribd
Upload
82 views2 pages

OSC - Practice Questions - Units 1, 2 and 3

This document contains practice questions from three units of an Operating System Concepts course: Introduction to OS, Process Scheduling, and Process Synchronization. For each unit, multiple choice and short answer questions are provided to test understanding of key concepts. These include comparing process scheduling techniques, describing OS structures, solving synchronization problems using semaphores and monitors, and analyzing examples to determine the best scheduling algorithm.

Uploaded by

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

OSC - Practice Questions - Units 1, 2 and 3

This document contains practice questions from three units of an Operating System Concepts course: Introduction to OS, Process Scheduling, and Process Synchronization. For each unit, multiple choice and short answer questions are provided to test understanding of key concepts. These include comparing process scheduling techniques, describing OS structures, solving synchronization problems using semaphores and monitors, and analyzing examples to determine the best scheduling algorithm.

Uploaded by

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

Operating System Concepts (8EC76)

Assignment / Practice Questions


Unit I (Introduction to OS)
1. Compare Multiprogramming, Multi-Processing, Multithreading and Multitasking
2. Discuss in detail about the Services provided by the OS (OR) Explain the Typical Functions of OS
3. What is the difference between Interrupt, System Call and Trap? Define and explain System Call with
any example. Also discuss about the types of System Calls
4. Explain in detail about the Structure of OS (Single, Layer, Microkernel and Modular)

Unit II (Process Scheduling)


1. With a neat sketch, explain about Process State transition and also discuss about Process Control Block
2. Discuss about Short-term, medium-term and long-term schedulers and also discuss about the various
scheduling criteria used in the scheduling techniques
3. Differentiate Multi-Level Queue Scheduling and Multi-level Feedback Queue Scheduling

Exercises on Process Scheduling:


4. Shown below is the workload for 5 jobs arriving at time zero:
PID Burst Time
P1 10
P2 29
P3 3
P4 7
P5 12
Find out which technique among FCFS, SJF and RR (TQ=10) would give the optimal result.
5. Shown below is the workload for 4 jobs:
Jobs AT BT
1 0 5
2 2 4
3 3 7
4 5 6
Find out which technique among FCFS, SJF, SRTF, RR (TQ=4) would give the best result.
6. Shown below is the workload for 3 jobs:
Jobs Arrival Time Burst Time (in secs)
1 0 8
2 2 4
3 4 1
Find out which technique among FCFS, SJF, SRTF, RR (TQ=2) would give the best result.
7. Shown below is the workload for 4 jobs assuming all the processes arriving at time 0:
Job BT Priority
J1 25 3
J2 5 2
J3 14 1
J4 12 4
Find out which technique among FCFS, SJF, Priority (NP), and RR (TQ=10) gives better result.
8. Shown below is the workload for 5 jobs:
Job BT AT Priority
J1 10 0 2
J2 7 3 1
J3 6 4 2
J4 1 12 1
J5 5 18 1
Find out which technique among FCFS, SJF, Priority (NP), SRTF, Priority (P), and RR (TQ=4) is best.
Unit III (Process Synchronization)
1. Discuss about Race condition, Critical Section Problem and the necessary conditions required for its
solution. Explain Peterson’s two-process solution with a Pseudo Code
2. What is a Semaphore? Design a solution using a Semaphore based Pseudo Code for the Bounded-
Buffer Producer-Consumer problem
(OR)
Use a Pseudo Code to explain the race condition in Producer-Consumer problem, and also design a
solution for the same using the concept of Semaphore
3. Design a solution for the Readers-Writers problem using a Semaphore based Pseudo Code
4. Design a solution for the Dining-Philosopher’s problem using a Monitor based Pseudo Code

You might also like