DKTE Society‟s

Yashwantrao Chavan Polytechnic, Ichalkaranji

Department of Computer Science and Engineering
Chapter-wise Frequently Asked Questions.
Operating System (22516)

Chapter 1. Overview of Operating System

Sr. No. Question Asked in Exam For Marks
1 List and draw a neat labeled diagram of four W17, S18, W19 2,4,4
components of a computer system. Explain any one
in detail.
2 Explain Time sharing operating system, state its W17,S18,S22 4,4,4
advantages and dis-advantages
3 W17,W18,W19,W2 4,4,4,4
Explain multiprogramming operating system.
1
4. W17,W18,W19,S17, 4,4,4,4,4
Describe real time system state its examples
S19,W21
5. Explain multiprocessor system and its two types. S17,S19 4,4
State and describe any two advantages of multi- S22 2
processor system.
Chapter 2. Services and Components of Operating System
1. W17,S18,W18, 4,4,2,4,4,4,6
List any four services provided by OS and explain
W19,S22,S17,S19, ,2
any two of them.
W21
2. W17,S18,W18,W19, 4,4,2&4,
What is system call? Enlist any four system calls
S22,S17,S19, 4&4, 4,
related with process management.
W21 4&4&4, 4,4
3. List operating system tools and explain any 2 in S22,W21 4,4
detail
Chapter 3. Process Management
1 W17,S18,W18,W19, 4,4,4,4,2,2
State and explain different process state.
S22, W21
2. Draw and explain process control block in detail. W17,W18,S17,S19 6,4,4,4
3. With suitable diagram describe scheduling queues. W19,S22 4,4
4. Explain Short Scheduler and Long Term Scheduler? W17,S17,W19,W21 4,2,4,4
Differentiate between short term and long term
scheduler?
5. W17,S17,W18,S18, 4,2,4,4,4,4
Explain the concept of context switching?
W19,S19
6. Draw and explain Inter-process communication W17,W18,S18,W19, 4,4,6,4,6,4,4
model. S19,W21,S22
 7. List and explain various types of multi-threading W17,S17,W18,W19, 8,6,4&2,
models with diagram. S19,W21,S22 4,4&4&8,4,
Benefits of multithreading and user level and kernel 6
level threads.
8. Describe use of ps and wait commands with suitable S22 4
example.
Explain „PS‟ command with any four options. W21 4
Give commands to perform following tasks:
S22 2
i) To add delay in script
ii) To terminate a process
Write syntax of following commands: W21 2

(i) Sleep
(ii) Kill
Write Unix command for following: W21 4
(i) Create a folder OSY
(ii) Create a file FIRST in OSY folder
(iii) List / display all files and directories.
(iv) Write command to clear the screen
Chapter 4. CPU Scheduling and Algorithms
1 Describe CPU and I/O burst cycle with suitable W18,S18,W21 4,6,4
diagram.
2. W17,W18,S18 4,4,4
Describe the terms: (i) Preemptive scheduling (ii)
Non preemptive scheduling.
S19,S22 4,4
Differentiate between pre-emptive and non-pre-
emptive scheduling
3. W17,S17,W21,S22 4,4,4,4
State and explain criteria used for CPU scheduling.
W18 2
State any four criteria in CPU scheduling?
List four process scheduling criteria and explain the
S18 4
term Turnaround in detail.
4. W17, 4
The job are scheduled for execution as follows solve
the problem using:
(ii) FCFS
Also find average waiting time using Gantt chart.

Consider the following four jobs. W18 4

 Find average waiting time by using FCFS scheduling
W19 4
Describe FCFS (First come first served) algorithm
with example.

Explain first come first served (FCFS) algorithm. S19 8

Give one example. State any one advantage and one
disadvantage.

The jobs are scheduled for execution as follows, W21 3

Solve the problem using: FCFS and find average
waiting time using Gantt chart.

Calculate average waiting time for following data

using First Come First Served (FCFS) S22 6

5. W18 4
Consider the following four jobs.

Find average waiting time using SJF Scheduling

The Jobs are scheduled for execution as follows – S18 4

solve the problem by using preemptive SJF (Shortest
Job First).Find average waiting time using Gantt
chart.
 Calculate average waiting time for SJF scheduling W19 3
Algorithm.

Calculate average locating time for SJF (Shortest Job

First) for following table.
S19 4

Calculate average waiting time for following data

using Shortest Job First(SJF)
S22 6

The jobs are scheduled for execution as follows,

Solve the problem using: SJF and find average
waiting time using Gantt chart.
W21 3

Explain Shortest Remaining Time Next (SRTN) S19 4

scheduling algorithm with example.
6. S17 4
Consider the following set of processes, with the
length of the CPU burst given in milliseconds.

Find out average waiting time by using

(i) non-preemptive priority
7. W17,W18,W21 4,4,4
Explain Round Robin algorithm with suitable
example.

Consider the following set of processes, with the S17 4

length of the CPU burst given in milliseconds.

Find out average waiting time by using

(ii) Round Robin(RR) (Quantum=1)

Calculate average waiting time for following W19 3

scheduling Algorithm.
1) Round Robin scheduling algorithm
(Time slice : 2 m sec)

Calculate average locating time for Round Robin S19 4

(RR) for following table. (Time slice 4 m sec).

8. S17,W18 4,4
With neat diagram, explain multilevel queue
scheduling.
9. W17,S17,W18,W21 4,4,4,4
Enlist and describe in details conditions leading to
Deadlocks.
S17 8
Write steps for Banker‟s Algorithm to avoid dead
lock. Also give one example showing working of
Banker‟s Algorithm.

Write steps for Banker‟s algorithm to avoid

W18,S19,S22 4,4,4
deadlock.
W18 2
Define Deadlock.
 List four Deadlock prevention condition and explain
the following terms.
1) Removal of “No preemption” condition. S18 6
2) Elimination of “Circular wait” related to deadlock
prevention condition.

Explain Deadlock Avoidance with example.

Enlist the deadlock prevention methods and describe S18 4

any two in detail.
W19 8
Describe prevention of deadlock occurrence with
respect to hold and wait necessary condition.
S22 4
Describe the algorithm for finding out whether or not
a system is in a safe. State (Safety Algorithm)
W19 4
Chapter 5. Memory Management
1 W18 4
Explain static and dynamic memory partitioning
method.
Describe fixed and variable memory partitioning W19 8
techniques with suitable diagram. Also state
advantage and disadvantage of each.
With suitable diagram, describe the concept of S22 4
variable partitioning of memory.
Explain partitioning and its types. W21 4
Give difference between External fragmentation and
Internal fragmentation S18 4
Define the term fragmentation in terms of memory. S22 2
2. S17,S18 4,4
Explain Bit map free-space management technique.
With suitable example, describe any one free space S22,W21 4,4
management technique.
3. W18 4
Describe virtual memory management.
Explain concept of virtual memory with diagram. S19,W17 4,4
Describe the concept of virtual memory with respect
to paging. Also draw paging hardware diagram and S22 6
describe its working with example.
W21 2
Define virtual memory.
 4. W17,S17,S19 4,6,6
Compare paging and segmentation memory
management techniques.
5. W18 2
What is the concept of paging?
Describe the concept of paging with neat labeled W19 4
diagram.
6. W17 4
Explain FIFO (First in First out) page replacement
algorithm for reference string 7012030423103.

Consider the following page reference string arrival S22 6

with three page frames:-5, 6, 7, 8, 9, 7, 8, 5, 9, 7, 8,
7, 9, 6, 5, 6Calculate number of page faults with
optimal and FIFO (First In First Out) page
replacement algorithms.

W21 6
Explain LRU page replacement algorithm for
following reference string.
70120304230321201701 Calculate page fault
1 7 0 1

Chapter 6. File Management

1 W17 4
List and explain any four attributes of file.
Describe concept of file, its types and operations on S18 8
file attributes in detail.
Explain different file attributes. S19 4
Describe any four file attributes. W21 2
2. W17 6
Explain any six file operations performed by OS.
State and describe any four operations on file. W19 4
List any four operations performed on a file. S22 2
3. W17 4
Explain following file allocation methods:
1) Contiguous 2) Linked
List different file allocation method. W18 2

Describe indexed allocation method with advantage W18 4

and disadvantage.
Give difference between contiguous file allocation W19 4
and linked file allocation with respect to access,
 fragmentation, size and speed.
List different file allocation methods. Explain any
S19 4
one in detail.
Describe linked file allocation method with suitable
example. Also list its one advantage. S22 4
Enlist different file allocation methods? Explain
contiguous allocation method in detail. W21 6
4. S17 4
With neat diagram, explain file access methods.
State type of file access method? W18 2
Describe working of sequential and direct access
method. W18 4

Explain different file access methods. S19 6

Describe sequential and direct access method. W21 4
5. S17 4
Explain two level Directory Structure with suitable
diagram.
Explain single level directory structure. W18 4
Explain the working of Two-level directory structure
with neat labeled diagram. S18 4

Describe with suitable diagram two level directory W19 4

structure. Also state its two advantages.
List different directory structure and explain any one S19 4
in detail.
Describe following directory structures in short with S22 6
neat sketches:
i) Single level
ii) Two level
iii) Tree structured