22516
21222
3 Hours / 70 Marks Seat No.
15 minutes extra for each hour
Instructions – (1) All Questions are Compulsory.
(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever
necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following: 10
a) State and describe any two advantages of multiprocessor
system.
b) State any four types of system calls.
c) Draw a neat labelled diagram for process state.
d) State difference between preemptive scheduling and
non-preemptive scheduling.
e) Define the term fragmentation in terms of memory.
f) Give commands to perform following tasks:
i) To add delay in script
ii) To terminate a process
g) List any four operations performed on a file.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Describe working of time sharing system with neat diagram.
b) List and describe any four services of operating system.
c) Differentiate between shared memory system and message
passing system of interprocess communication.
d) State and describe any two scheduling criteria.
3. Attempt any THREE of the following: 12
a) Describe use of ps and wait commands with suitable example.
b) Describe prevention of deadlock occurrence with respect to
hold and wait necessary condition.
c) With suitable diagram, describe the concept of variable
partitioning of memory.
d) Describe linked file allocation method with suitable example.
Also list its one advantage.
4. Attempt any THREE of the following: 12
a) Differentiate between command line based operating system
and GUI based operating system (Any four points)
b) Describe various activities performed by following operating
system components.
i) Main memory management
ii) File management
c) With suitable diagram, describe use of scheduling queues in
process scheduling.
d) Write steps required for Banker’s algorithm to avoid deadlock.
e) With suitable example, describe any one free space management
technique.
22516 [3]
Marks
5. Attempt any TWO of the following: 12
a) Calculate average waiting time for following data using First
Come First Served (FCFS) and Shortest Job First (SJF)
algorithms.
Process Burst time Arrival time
P0 08 0
P1 04 1
P2 05 2
P3 03 3
b) Describe with example, use of following tools:
i) Device Management
ii) Performance monitor
iii) Task scheduler
c) Describe the concept of virtual memory with respect to
paging. Also draw paging hardware diagram and describe
its working with example.
6. Attempt any TWO of the following: 12
a) Describe one-to-one multithreading model with suitable
diagram. Also write any two advantages of one-to-one model
over many-to-one model.
b) 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.
c) Describe following directory structures in short with neat
sketches:
i) Single level
ii) Two level
iii) Tree structured
22516
22223
3 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Illustrate your answers with neat sketches wherever
necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
(6) Preferably, write the answer in sequential order.
Marks
1. Attempt any FIVE of the following: 10
a) State any two features of Linux.
b) Difference between Time sharing system and Real time
system (any 2 points)
c) State any four services of operating system.
d) Write the difference between pre-emptive and non-preemptive
scheduling.
e) Define following terms :
i) Virtual Memory
ii) Paging
f) List any four file attributes and it's meaning.
g) Define Deadlock.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Explain different types of system calls.
b) Draw and explain process control block in detail.
c) State and explain four scheduling criteria.
d) Define fragmentation. Explain Internal and External Fragmentation
3. Attempt any THREE of the following: 12
a) Describe multiprocessor OS with it's advantages. (any two)
b) Explain different components of operating system.
c) Explain different types of schedulers.
d) Explain two level directory structure with suitable diagram.
4. Attempt any THREE of the following: 12
a) Explain real time OS. Explain it's types.
b) Draw process state diagram and describe each state.
c) Describe any four condition for deadlock.
d) Differentiate between paging and segmentation (any 4 points)
e) Explain fixed and variable memory management.
5. Attempt any TWO of the following: 12
a) Explain the working of interprocess communication considering
i) Shared memory
ii) Message passing
b) With neat diagram explain multilevel queue scheduling.
c) Write two uses of following operating system tools.
i) Security policy
ii) User Management
iii) Task scheduler
22516 [3]
Marks
6. Attempt any TWO of the following: 12
a) List file allocation method and explain any one in details.
b) 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.
c) 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
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
22516
23242
3 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever
necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Use of Non-programmable Electronic Pocket
Calculator is permissible.
(7) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following: 10
a) List different types of operating system.
b) State any four services provided by an operating system.
c) Draw process state diagram.
d) State two features of non-preemptive scheduling.
e) Define following terms:
i) Memory compaction
ii) Fragmentation
f) Write syntax of PWD command and explain its use with the help
of suitable example.
g) List any four file operations.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Explain Resource management of an operating system.
b) Explain different components of operating system.
c) Describe message passing system of interprocess communication
(IPC).
d) What is CPU Scheduler? Explain the preemptive and
nonpreemptive type of scheduling.
3. Attempt any THREE of the following: 12
a) Define Process. Draw a Process Control Block and explain the
information in PCB.
b) Define deadlock. State the conditions necessary for deadlock.
c) Explain the following terms with respect to memory management:
i) Dynamic relocation
ii) Swapping
d) With suitable diagram, explain how contiguous file allocation is
performed?
4. Attempt any THREE of the following: 12
a) Compare between Time sharing operating system and
multiprogramming operative system.
b) Explain any four types of system call.
c) Describe how context switch is executed by operating system.
d) Compare Short Job First (SJF) and Shortest Remaining Time
(SRTN) scheduling algorithm (any four points).
e) Describe variable partitioning with the help of suitable example.
22516 [3]
Marks
5. Attempt any TWO of the following: 12
a) Explain the use of following OS tools:
i) Device Manager
ii) Task Scheduler
b) Explain user level thread and Kernel level thread with its
advantages and disadvantages.
c) 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.
6. Attempt any TWO of the following: 12
a) What is the average turnaround time for the following process
using :
i) FCFS scheduling algorithm
ii) SJF non-preemptive scheduling algorithm
iii) Round Robin Scheduling algorithm.
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 1
b) Explain bit map vector and linked list free space management
techniques with its advantages and disadvantages.
c) Explain with diagram single level directory structure and two level
directory structure with its advantages and disadvantages.
22516
12425
03 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Illustrate your answers with neat sketches wherever
necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following: 10
a) State any two command line based operating systems and two
GUI based operating system.
b) Define system call and enlist its types.
c) Define PCB with suitable diagram.
d) Describe CPU and I/O burst cycle with suitable diagram.
e) State any four criteria in CPU scheduling.
f) Define the term paging.
g) Draw the structure of unix operating system.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Differentiate between multitasking and multiprogramming.
b) List activities performed in process management and file
management.
c) Define the term inter process communication. Explain any one
technique of IPC.
d) Describe necessary conditions leading to deadlock.
3. Attempt any THREE of the following: 12
a) Difference between user level and kernel level thread.
(Any four points)
b) Describe First Come First Served (FCFS) scheduling algorithm
with example.
c) Describe the concept of segmentation in Operating System with
suitable example.
d) Describe Single level and two level directory structure.
4. Attempt any THREE of the following: 12
a) Describe multiprocessor system with advantage and
disadvantage.
b) List and describe any four services of operating system.
c) Describe the concept of scheduling queues with diagram.
d) Write steps of Banker's algorithm to avoid deadlock.
e) Explain swapping in operating system with diagram and
example.
22516 [3]
Marks
5. Attempt any TWO of the following: 12
a) Describe use of following commands with syntax:
i) ps
ii) wait
iii) sleep
iv) kill
b) Write two uses of following operating system tools:
i) User management
ii) Security Policy
iii) Performance Monitor
c) Given a page reference string with (03) pages 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.
6. Attempt any TWO of the following: 12
a) Calculate average waiting time for SJF (Shortest Job First) and
Round Robin (RR) algorithm table: (Time slice 4 ms)
Process Burst Time
p1 10
p2 4
p3 9
p4 6
b) Explain linked and indexed file allocation method with neat
diagram.
c) Describe variable partitioning technique of memory management
with suitable example.
22516
11920
3 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever
necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following: 10
a) Define real time operating system. List any four applications
of it.
b) Explain any four services provided by OS.
c) Draw process state diagram.
d) Explain any four scheduling criteria.
e) Define virtual memory.
f) Write syntax of following commands:
(i) Sleep
(ii) Kill
g) Describe any four file attributes.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Enlist types of operating system. Explain multiprogramming OS
in detail.
b) List components of OS. Explain process management in detail.
c) With neat diagram explain inter process communication model.
d) Describe I/o burst and CPU burst cycle with neat diagram.
3. Attempt any THREE of the following: 12
a) Explain ‘PS’ command with any four options.
b) Explain deadlock? What are necessary conditions for deadlock?
c) Explain partitioning and its types.
d) Describe sequential and direct access method.
4. Attempt any THREE of the following: 12
a) 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
b) What is purpose of system call? State any two system calls
with their functions.
c) State and describe types of scheduler.
d) Explain Round Robin algorithm with suitable example.
e) Explain PCB with diagram.
22516 [3]
Marks
5. Attempt any TWO of the following: 12
a) Enlist the operating system tools. Explain any two in detail.
b) Explain multithreading model in detail.
c) Explain LRU page replacement algorithm for following 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 fault.
6. Attempt any TWO of the following: 12
a) The jobs are scheduled for execution as follows
Process Arrival Time Burst Time
P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8
Solve the problem using:
(i) SJF
(ii) FCFS
Also find average waiting time using Gantt chart.
b) List free space management techniques? Describe any one in
detail.
c) Enlist different file allocation methods? Explain contiguous
allocation method in detail.
22516
12223
3 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Illustrate your answers with neat sketches wherever
necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following : 10
a) Differentiate between Multi programmed and Multi tasking
operating system (Any two points).
b) List any four services provided by O.S.
c) Define : Process, PCB.
d) Define CPU and I/O burst cycle.
e) Differentiate between paging and segmentation.
f) Write syntax of following commands -
(i) Kill
(ii) Sleep
g) List any four file operations.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following : 12
a) Explain Time sharing O.S.
b) Describe any two components of O.S.
c) Explain shared memory model of Interprocess communication
(IPC).
d) Describe different scheduling criteria.
3. Attempt any THREE of the following : 12
a) Draw and explain process state diagram.
b) Describe conditions for deadlock prevention.
c) Explain fixed size memory partitioning.
d) Explain linked file allocation method.
4. Attempt any THREE of the following : 12
a) Compare between command line and Graphical user interface.
(Any four points)
b) Write any four system call related to file management.
c) Compare between Long term and short term scheduler.
(Any four points)
d) Solve given problem by using SJF and FCFS scheduling
algorithm using Gantt chart. Calculate the average waiting
time for each algorithm.
Process Burst time (in ms)
P1 9
P2 7
P3 3
P4 7
e) Describe free space management technique. (Any two).
22516 [3]
Marks
5. Attempt any TWO of the following : 12
a) Write two uses of following O.S. tools –
(i) Device Management
(ii) Performance monitor
(iii) Task Scheduler
b) Writer the outputs of following commands
(i) Wait 2385018
(ii) Sleep 09
(iii) PS –u Asha
c) 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
6. Attempt any TWO of the following : 12
a) Solve given problem by using
(i) Pre-emptive SJF
(ii) Round Robin (Time Slice = 3 ms)
Calculate average waiting time using Gantt Chart.
Process A.T. B.T. (in ms)
P11 0 8
P12 1 4
P13 2 9
P14 3 5
P.T.O.
22516 [4]
Marks
b) 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 <FREE> 12 KB
P2
<FREE> 19 KB
P3
<FREE> 7KB
Memory
c) Construct and explain directory structure of a file system in
terms of two level and tree structure.
22516
23124
3 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever
necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following: 10
a) Define real time operating system, along with any two
applications of it.
b) List any four services provided by operating system.
c) Draw neat labelled process state diagram along with the correct
directions of arrows.
d) Define CPU bound program and I/O bound program.
e) Define paging and segmentation.
f) What is the use of PS command? Write long forms of UID,
PID in the output of this command.
g) List any four file operations.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Describe multiprocessor OS with it’s advantages (any two).
b) Write down the responsibilities of the following components of
OS.
i) Memory management
ii) File management
c) Explain shared memory method of IPC using neat labelled
diagram.
d) Explain following terms with respect to scheduling
i) CPU utilization
ii) Throughput
iii) Turnaround time
iv) Waiting time
3. Attempt any THREE of the following: 12
a) Explain following commands with their syntax –
i) Kill
ii) Sleep
iii) Wait
iv) Exit
b) What is deadlock? Discuss any one method of deadlock
prevention.
c) Describe concept of free space management technique using bit
map method.
d) Draw the diagram of linked file allocation method and explain
it.
22516 [3]
Marks
4. Attempt any THREE of the following: 12
a) Compare between CLI based OS and GUI based OS (any four
points).
b) What are the different types of system calls? Give examples
of each.
c) Explain working of CPU switch from process to process with
neat labelled diagram.
d) Solve given problem by using FCFS scheduling algorithm.
Draw correct Gantt chart and calculate average waiting time
and average turnaround time –
Process Arrival time Burst time
P0 0 10
P1 1 29
P2 2 3
P3 3 7
P4 4 12
e) Which hole is taken for next segment request for 8 KB in a
swapping system for First fit, Best fit and Worst fit.
OS
4 KB
9 KB
20 KB
16 KB
8 KB
2 KB
6 KB
P.T.O.
22516 [4]
Marks
5. Attempt any TWO of the following: 12
a) Write two uses of the following operating system tools –
i) Security policy
ii) User management
iii) Performance Monitor
b) Differentiate between process and thread (any two points). Also
discuss the benefits of multithreaded programming.
c) 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
6. Attempt any TWO of the following: 12
a) 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).
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
b) List free space management technique with the help of neat
diagram, explain any one technique in detail.
c) Draw and explain directory structure of a file system in terms
of single level, two level and tree structure.
22516
12425
03 Hours / 70 Marks Seat No.
Instructions – (1) All Questions are Compulsory.
(2) Illustrate your answers with neat sketches wherever
necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic
Communication devices are not permissible in
Examination Hall.
Marks
1. Attempt any FIVE of the following: 10
a) State any two command line based operating systems and two
GUI based operating system.
b) Define system call and enlist its types.
c) Define PCB with suitable diagram.
d) Describe CPU and I/O burst cycle with suitable diagram.
e) State any four criteria in CPU scheduling.
f) Define the term paging.
g) Draw the structure of unix operating system.
P.T.O.
22516 [2]
Marks
2. Attempt any THREE of the following: 12
a) Differentiate between multitasking and multiprogramming.
b) List activities performed in process management and file
management.
c) Define the term inter process communication. Explain any one
technique of IPC.
d) Describe necessary conditions leading to deadlock.
3. Attempt any THREE of the following: 12
a) Difference between user level and kernel level thread.
(Any four points)
b) Describe First Come First Served (FCFS) scheduling algorithm
with example.
c) Describe the concept of segmentation in Operating System with
suitable example.
d) Describe Single level and two level directory structure.
4. Attempt any THREE of the following: 12
a) Describe multiprocessor system with advantage and
disadvantage.
b) List and describe any four services of operating system.
c) Describe the concept of scheduling queues with diagram.
d) Write steps of Banker's algorithm to avoid deadlock.
e) Explain swapping in operating system with diagram and
example.
22516 [3]
Marks
5. Attempt any TWO of the following: 12
a) Describe use of following commands with syntax:
i) ps
ii) wait
iii) sleep
iv) kill
b) Write two uses of following operating system tools:
i) User management
ii) Security Policy
iii) Performance Monitor
c) Given a page reference string with (03) pages 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.
6. Attempt any TWO of the following: 12
a) Calculate average waiting time for SJF (Shortest Job First) and
Round Robin (RR) algorithm table: (Time slice 4 ms)
Process Burst Time
p1 10
p2 4
p3 9
p4 6
b) Explain linked and indexed file allocation method with neat
diagram.
c) Describe variable partitioning technique of memory management
with suitable example.