OSY QUESTION BANK 22516

Note: This question bank contains previous 6 question papers divided

into chapters.
Chapter 1: Overview of Operating System (08 Marks)
2 Marks question
1. List different types of operating system. (S-24)
2. State any two features of Linux. (S-23)
3. State and describe any two advantages of multiprocessor system. (S-22)
4. Differentiate between Multi programmed and Multi tasking operating
system. (W-22)
5. Difference between Time sharing system and Real time system. (S-23)
6. Define real time operating system, along with any two applications of it.
(W-23)
7. Define real time operating system. List any four applications of it. (W-19)
4 Marks question
1. Enlist types of operating system. Explain multiprogramming OS in detail.
(W-19).
2. Describe working of time sharing system with neat diagram. (S-22)
OR
Explain Time sharing O.S. (W-22)
3. Differentiate between command line based operating system and GUI
based operating system (Any four points) (S-22) (W-23)
4. Compare between command line and Graphical user interface. (Any four
points) (W-22)
5. Explain real time OS. Explain it's types. (S-23)
6. Describe multiprocessor OS with it's advantages. (any two) (S-23) (W-
23)
 7. Compare between Time sharing operating system and multiprogramming
operative system. (S-24)
8. Explain Resources management of an operating system. (S-24)

Chapter 2: Services and Component of OS (10 Marks)

2 Marks question
1. Explain/State any four services provided by OS. (W-19) (W-22) (S-23)
(W-23) (S-24)
2. State any four types of system calls. (S-22)
4 Marks question
1. List components of OS. Explain process management in detail. (W-19)
2. What is purpose of system call? State any two system calls with their
functions. (W-19)
3. List and describe any four services of operating system. (S-22)
4. Describe various activities performed by following operating system
components. i) Main memory management ii) File management (S-22)
5. Describe any two components of O.S. (W-22)
6. Write any four system call related to file management. (W-22)
7. Explain different types of system calls. (S-23) (S-24)
8. Explain different components of operating system. (S-23) (S-24)
9. Write down the responsibilities of the following components of OS. i)
Memory management ii) File management (W-23)
10.What are the different types of system calls? Give examples of each. (W-
23)
6 Marks question
1. Enlist the operating system tools. Explain any two in detail. (W-19)
2. Describe with example, use of following tools: i) Device Management ii)
Performance monitor iii) Task scheduler (S-22)
3. Write two uses of following O.S. tools – (i) Device Management (ii)
Performance monitor (iii) Task Scheduler (W-22)
4. Write two uses of following operating system tools. i) Security policy ii)
User Management iii) Task scheduler (S-23)
 5. Write two uses of the following operating system tools – i) Security
policy ii) User management iii) Performance Monitor (W-23)
6. Explain the use of following OS tools: i) Device Manager ii) Task
Scheduler (S-24)

Chapter 3: Process Management (14 Marks)

2 Marks question
1. Draw neat labelled process state diagram along with the correct directions
of arrows (W-23) (W-19) (S-22) (S-24)
2. Write syntax of following commands: (i) Sleep (ii) Kill (W-19) (W-22)
3. Define: Process, PCB. (W-22)
4 Marks question
1. With neat diagram explain inter process communication model. (W-19).
2. Explain ‘PS’ command with any four options. (W-19)
3. Explain PCB with diagram. (W-19)
4. Give commands to perform following tasks: i) To add delay in script ii)
To terminate a process. (S-22)
5. Differentiate between shared memory system and message passing
system of interprocess communication. (S-22)
6. Describe use of ps and wait commands with suitable example. (S-22)
7. Explain shared memory model of Interprocess communication (IPC). (W-
22)
8. Compare between Long term and short term scheduler. (Any four points)
(W-22)
9. Draw and explain process state diagram. (W-22)
10.Draw and explain process control block in detail. (S-23)
11.Draw process state diagram and describe each state (S-23)
12.What is the use of PS command? Write long forms of UID, PID in the
output of this command. (W-23)
13.Explain shared memory method of IPC using neat labelled diagram. (W-
23)
 14.Explain following commands with their syntax – i) Kill ii) Sleep iii) Wait
iv) Exit (W-23)
15.Explain working of CPU switch from process to process with neat
labelled diagram (W-23)

16.Which hole is taken for next segment request for 8 KB in a

swapping system for First fit, Best fit and Worst fit.
17.Describe message passing system of interprocess
communication (IPC). (S-24)
18.Define process. Draw a Process Control Block and explain the
information in PCB. (S-24)
19.Describe how context switch is executed by operating system.
(S-24)

6 Marks question
1. Explain multithreading model in detail. (W-19)
2. Describe one-to-one multithreading model with suitable diagram. Also
write any two advantages of one-to-one model over many-to-one model.
(S-22)
3. Writer the outputs of following commands (i) Wait 2385018 (ii) Sleep 09
(iii) PS –u Asha
4. Consider the following memory map and assume a new process P4 comes
with memory requirements of 6 KB. Locate (Draw) this process in
memory using. i) First fit O.S. ii) Best Fit P1 iii) Worst fit

(W-22)
5. Explain the working of interprocess communication considering i) Shared
memory ii) Message passing (S-23)
6. Differentiate between process and thread (any two points). Also discuss
the benefits of multithreaded programming (W-23)
7. Explain user level thread and Kernel level thread with its advantages and
disadvantages (S-24)
Chapter 4: CPU Scheduling and Algorithms (14 Marks)
2 Marks question
1. Explain any four scheduling criteria. (W-19)
2. State difference between preemptive scheduling and non-preemptive
scheduling. (S-22)
3. Define CPU and I/O burst cycle. (W-22)
4. Write the difference between pre-emptive and non-preemptive scheduling
(S-22)
5. Define Deadlock (S-23)
6. Define CPU bound program and I/O bound program. (W-23)
7. State two features of non-preemptive scheduling. (S-24)
4 Marks question
1. Describe I/o burst and CPU burst cycle with neat diagram. (W-19)
2. Explain deadlock? What are necessary conditions for deadlock? (W-19)
(S-24)
3. State and describe types of scheduler. (W-19)
4. Explain Round Robin algorithm with suitable example (W-19)
5. State and describe any two scheduling criteria. (S-22)
6. With suitable diagram, describe use of scheduling queues in process
scheduling. (S-22)
7. Write steps required for Banker’s algorithm to avoid deadlock. (S-22)
8. Describe different scheduling criteria. (W-22)
9. Describe conditions for deadlock prevention (W-22)
10.Solve given problem by using SJF and FCFS scheduling algorithm using
Gantt chart. Calculate the average waiting time for each algorithm.

(W-22)
11. State and explain four scheduling criteria (S-23)
12.Explain different types of schedulers. (S-23)
13.Describe any four condition for deadlock. (S-23)
14.Explain following terms with respect to scheduling i) CPU utilization ii)
Throughput iii) Turnaround time iv) Waiting time (W-23)
15.What is deadlock? Discuss any one method of deadlock prevention. (W-
23)
 16.Solve given problem by using FCFS scheduling algorithm. Draw correct
Gantt chart and calculate average waiting time and average turnaround
time –

(W-23)
17.What is CPU Scheduler? Explain the preemptive and nonpreemptive type
of scheduling. (S-24)
18.Compare Short Job First(SJF) and Shortest Remaining Time (SRTN)
scheduling algorithm (any four points). (S-24)

6 Marks question
1. The jobs are scheduled for execution as follows

Solve the following problem (i) SJF (ii) FCFS Also find average waiting
time using Gantt chart. (W-19)
2. Calculate average waiting time for following data using First Come First
Served (FCFS) and Shortest Job First (SJF) algorithms

(S-22)
3. Solve given problem by using (i) Pre-emptive SJF (ii) Round Robin
(Time Slice = 3 ms) Calculate average waiting time using Gantt Chart.
 (W-22)
4. With neat diagram explain multilevel queue scheduling. (S-23)
5. Consider the four processes P1, P2, P3 and P4 with length of CPO Burst
time. Find out Avg waiting time and Avg turn around time for the
following Algorithms. i) FCFS ii) RR (Slice-4ms) iii) SJF

6. ) How pre-emptive scheduling is better than non pre-emptive scheduling

by solving following problem using SJF (Solve it by using pre-emptive
SJF and non-pre-emptive SJF also).
Chapter 5: Memory Management (14 Marks)
2 Marks question
1. Define virtual memory. (W-19)
2. Define the term fragmentation in terms of memory. (S-22)
3. Differentiate between paging and segmentation. (W-22)
4. Define following terms : i) Virtual Memory ii) Paging (S-23)
5. Define paging and segmentation. (W-23)
6. Define following terms: i) Memory Compaction ii) Fragmentation (S-24)
7.
4 Marks question
1. Explain partitioning and its types. (W-19)
2. With suitable diagram, describe the concept of variable partitioning of
memory. (S-22) (S-24)
3. With suitable example, describe any one free space management
technique. (S-22)
4. Explain fixed size memory partitioning. (W-22)
5. Describe free space management technique. (Any two). (W-22)
6. Define fragmentation. Explain Internal and External Fragmentation. (S-
23)
7. Differentiate between paging and segmentation (any 4 points) (S-23)
8. Explain fixed and variable memory management. (S-23)
9. Describe concept of free space management technique using bit map
method (W-23)
10.Explain the following terms with respect to memory management:
i) Dynamic relocation
ii) Swapping
6 Marks question
1. Explain LRU page replacement algorithm for following reference string.
70120304230321201701
Calculate the page fault. (W-19)
2. List free space management techniques? Describe any one in detail. (W-
19)
3. Describe the concept of virtual memory with respect to paging. Also draw
paging hardware diagram and describe its working with example. (S-22)
4. Consider the following page reference string arrival with three page
frames:- 5, 6, 7, 8, 9, 7, 8, 5, 9, 7, 8, 7, 9, 6, 5, 6 Calculate number of page
 faults with optimal and FIFO (First In First Out) page replacement
algorithms.
5. Describe following directory structures in short with neat sketches: i)
Single level ii) Two level iii) Tree structured
6. Given a page reference string with three (03) page frames. Calculate the
page faults with ‘Optimal’ and ‘LRU’ page replacement algorithm
respectively. ‘7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 (W-22)
7. For the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7,
0, 1 Calculate the page faults applying. i) Optimal ii) LRU iii) FiFo page
Replacement algorithms for a memory with three frames. (S-23)
8. Find out the total number of page faults using – i) Least recently used
page replacement ii) Optimal page replacement Page replacement
algorithms of memory management, if the page are coming in the order 7
0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 (W-23)
9. List free space management technique with the help of neat diagram,
explain any one technique in detail. (W-23)
10.Consider the string: 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7 with frame
size 3 and 4, calculate page fault in both the cases using FIFO algorithm
(S-24)
Chapter 6: File Management (10 Marks)
2 Marks question
1. Describe any four file attributes. (W-19)
2. List any four operations performed on a file. (S-22)
3. List any four file operations (W-22) (S-24)
4. List any four file attributes and it's meaning (S-23)
5. Write syntax of PWD command and explain its use with the help of
suitable diagram. (S-24)
4 Marks question
1. Describe sequential and direct access method. (W-19)
2. Write unix command for following: (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. (W-19)
3. Describe linked file allocation method with suitable example. Also list its
one advantage. (S-22)
4. Explain linked file allocation method. (W-22)
5. Explain two level directory structure with suitable diagram. (S-23)
6. List any four file operations. (W-23)
7. Draw the diagram of linked file allocation method and explain it. (W-23)
8. With suitable diagram, explain how contiguous file allocation is
performed? (S-24)

6 Marks question
1. Enlist different file allocation methods? Explain contiguous allocation
method in detail. (W-19)
2. Construct and explain directory structure of a file system in terms of two
level and tree structure. (W-22)
3. List file allocation method and explain any one in details. (S-23)
4. Draw and explain directory structure of a file system in terms of single
level, two level and tree structure. (W-23)