OS REPEATED QUESTIONS!!!!

Chapter 1: 8mark!!
2019 winter:
a) Define real time operating system. List any four applications of it.
b) Enlist types of operating system. Explain multiprogramming OS in detail. 4m
c) 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
2022 summer
a) State and describe any two advantages of multiprocessor system.
b) Describe working of time sharing system with neat diagram.
c) Differentiate between command line based operating system and GUI based operating system
(Any four points)
2023 summer
a) State any two features of Linux.
b) Difference between Time sharing system and Real time system (any 2 points)
c) Describe multiprocessor OS with it's advantages. (any two). (REPEATED)
d) Explain real time OS. Explain it's types.
2023 winter
a) Define real time operating system, along with any two applications of it.
b) Describe multiprocessor OS with it’s advantages (any two). (REPEATED)
c) Compare between CLI based OS and GUI based OS (any four points). (REPEATED)
2024 summer
a) List different types of operating system
b) Explain Resource management of an operating system
c) Compare between Time sharing operating system and multiprogramming operative system.
 OS REPEATED QUESTIONS!!!!
chapter 2: 16 marks!!!
2019 winter:
a) Explain any four services provided by OS.
b) List components of OS. Explain process management in detail. (4m)
c) What is purpose of system call? State any two system calls with their functions.
d) Enlist the operating system tools. Explain any two in detail. *6m*
2022 summer :-
a) State any four types of system calls. (REPEATED)
b) List and describe any four services of operating system. (REPEATED)
c) Describe various activities performed by following operating system components.
(REPEATED)
i) Main memory management ii) File management
d) Describe with example, use of following tools: *6m* (REPEATED)
i) Device Management ii) Performance monitor iii) Task scheduler
2023 summer:
a) State any four services of operating system. (REPEATED)
b) Explain different types of system calls.
c) Explain different components of operating system. (REPEATED)
d) Write two uses of following operating system tools. *6m* (REPEATED)
i) Security policy ii) User Management iii) Task scheduler
2023 Winter
a) List any four services provided by operating system. (REPEATED)
b) Write down the responsibilities of the following components of OS. (REPEATED)
i) Memory management ii) File management
c) What are the different types of system calls? Give examples of each.
d) Write two uses of the following operating system tools – *6m* (REPEATED)
i) Security policy ii) User management iii) Performance Monitor
2024 summer
a) State any four services provided by an operating system (REPEATED)
b) Explain different components of operating system. (REPEATED)
c) Explain any four types of system call. (REPEATED)
d) Explain the use of following OS tools: *6m* (REPEATED)
e) i) Device Manager ii) Task Scheduler
 OS REPEATED QUESTIONS!!!!
chapter 3: 26 marks!!!
2019 winter:
a) Write syntax of following commands:
(i)Sleep (ii) Kill
b) Draw process state diagram.
c) With neat diagram explain inter process communication model.
d) Explain ‘PS’ command with any four options.
e) State and describe types of scheduler.
f) Explain PCB with diagram.
g) Explain multithreading model in detail. *6m*
2022 summer :-
a) Draw a neat labelled diagram for process state. (REPEATED)
b) Give commands to perform following tasks:
i) To add delay in script ii) To terminate a process
c) Differentiate between shared memory system and message passing system of interprocess
communication.
d) Describe use of ps and wait commands with suitable example.
e) With suitable diagram, describe use of scheduling queues in process scheduling.
f) Describe one-to-one multithreading model with suitable diagram. Also write any two
advantages of one-to-one model over many-to-one model. *6m*
2023 summer:
a) Draw and explain process control block in detail. (REPEATED)
b) Explain different types of schedulers. (REPEATED)
c) Draw process state diagram and describe each state. (REPEATED)
d) Explain the working of inter process communication considering *6m* (REPEATED)
i) Shared memory ii) Message passing
2023 Winter
a) Draw neat labelled process state diagram along with the correct directions of arrows.
(REPEATED)
b) What is the use of PS command? Write long forms of UID, PID in the output of this
command.
c) Explain shared memory method of IPC using neat labelled diagram. (REPEATED)
d) Explain following commands with their syntax –
i) Kill ii) Sleep iii) Wait iv) Exit
e) Differentiate between process and thread (any two points). Also discuss the benefits of
multithreaded programming. *6m*
 OS REPEATED QUESTIONS!!!!
2024 summer
a) Draw process state diagram (REPEATED)
b) Write syntax of PWD command and explain its use with the help of suitableexample.
c) Describe message passing system of inter process communication (IPC) (REPEATED)
d) Define Process. Draw a Process Control Block and explain the information in PCB
(REPEATED)
e) Describe how context switch is executed by operating system
f) Explain user level thread and Kernel level thread with its advantages and disadvantages*6m*
 OS REPEATED QUESTIONS!!!!
chapter 4: 22 marks!!!
2019 winter:
a) Explain any four scheduling criteria.
b) Describe I/o burst and CPU burst cycle with neat diagram.
c) b) Explain deadlock? What are necessary conditions for deadlock?
d) Explain Round Robin algorithm with suitable example.
e) The jobs are scheduled for execution as follows Process Arrival Time Burst Time *6m*
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.
2022 summer :-
a) State difference between preemptive scheduling and non-preemptive scheduling.
b) State and describe any two scheduling criteria. (REPEATED)
c) Describe prevention of deadlock occurrence with respect to hold and wait necessary
condition.
d) Write steps required for Banker’s algorithm to avoid deadlock.
e) Calculate average waiting time for following data using First Come First Served (FCFS) and
Shortest Job First (SJF) algorithms. Process Burst time Arrival time *6m* (REPEATED)
P0 08 0 P1 04 1 P2 05 2 P3 03 3
2023 summer:
a) Write the difference between pre-emptive and non-preemptive scheduling. (REPEATED)
b) Define Deadlock.
c) State and explain four scheduling criteria. (REPEATED)
d) Describe any four condition for deadlock.
e) With neat diagram explain multilevel queue scheduling. *6m*
f) 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. *6m* (REPEATED)
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
2023 Winter
a) Define CPU bound program and I/O bound program.
b) Explain following terms with respect to scheduling
i) CPU utilization ii) Throughput iii) Turnaround time iv) Waiting time
c) What is deadlock? Discuss any one method of deadlock prevention.
d) Explain working of CPU switch from process to process with neat labelled diagram.
e) 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 124
 OS REPEATED QUESTIONS!!!!
f) 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 *6m* (REPEATED)
P1 0 8 P2 1 4 P3 2 9 P4 3 5
2024 summer
a) State two features of non-preemptive scheduling
b) What is CPU Scheduler? Explain the preemptive and nonpreemptive type of scheduling
c) Define deadlock. State the conditions necessary for deadlock.
d) Compare Short Job First (SJF) and Shortest Remaining Time (SRTN) scheduling algorithm
(any four points)
e) What is the average turnaround time for the following process using : *6m*
1. FCFS scheduling algorithm
2. SJF non preemptive scheduling algorithm
3. Round Robin Scheduling algorithm
 OS REPEATED QUESTIONS!!!!
Chapter 5: 16 marks!!
2019 winter:
a) Explain partitioning and its types.
b) Define virtual memory.
c) Explain LRU page replacement algorithm for following reference string. *6m*
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.
d) List free space management techniques? Describe any one in detail. *6m*
2022 summer :-
a) With suitable diagram, describe the concept of variable partitioning of memory.
b) Define the term fragmentation in terms of memory.
c) With suitable example, describe any one free space management technique. (REPEATED)
d) Describe the concept of virtual memory with respect to paging. Also draw paging hardware
diagram and describe its working with example. *6m*
e) Consider the following page reference string arrival with three page frames:- *6m*
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.
2023 summer:
a) Define fragmentation. Explain Internal and External Fragmentation
b) Differentiate between paging and segmentation (any 4 points)
c) Define following terms : i) Virtual Memory ii) Paging
d) Explain fixed and variable memory management.
e) For the page reference string*6m*
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.
2023 Winter
a) Define paging and segmentation.
b) Describe concept of free space management technique using bit map method.
c) Find out the total number of page faults using –*6m*
i) Least recently used page replacement ii) Optimal page replacement
d) Page replacement algorithms of memory management, if the page are coming in the order
70120304230321201701
e) List free space management technique with the help of neat diagram, explain any one
technique in detail. *6m*
 OS REPEATED QUESTIONS!!!!
2024 summer
a) Define following terms: i. Memory compaction ii. Fragmentation
b) Describe variable partitioning with the help of suitable example
c) Consider the string: *6m*
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
d) Explain bit map vector and linked list free space management techniques with its advantages
and disadvantages*6m*
 OS REPEATED QUESTIONS!!!!
Chapter 6: 14 marks!!!
2019 winter:
a) Describe sequential and direct access method.
b) Describe any four file attributes.
c) Enlist different file allocation methods? Explain contiguous allocation method in detail. *6m*
2022 summer :-
a) List any four operations performed on a file.
b) Describe linked file allocation method with suitable example. Also list its one advantage.
c) Describe following directory structures in short with neat sketches: *6m*
i) Single level ii) Two level iii) Tree structured
2023 summer:
a) List any four file attributes and it's meaning. (REPEATED)
b) Explain two level directory structure with suitable diagram.
c) List file allocation method and explain any one in details. *6m*
2023 Winter
a) List any four file operations. (REPEATED)
b) Draw the diagram of linked file allocation method and explain it. (REPEATED)
c) 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
d) Draw and explain directory structure of a file system in terms of single level, two level and
tree structure. *6m* (REPEATED)
2024 summer
a) List any four file operations. (REPEATED)
b) With suitable diagram, explain how contiguous file allocation is performed?
c) Explain with diagram single level directory structure and two level directory structure with its
advantages and disadvantages. *6m*(REPEATED)
d) Explain the following terms with respect to memory management:
i) Dynamic relocation ii) Swapping