Unit 1 :- Overview of Operating system(08 Marks)
2 MARKS :-
1. State any two features of Linux.
2. Difference between Time sharing system and Real time
system (any 2 points)
3.Define real time operating system, along with any two
applications of it.
4.State and describe any two advantages of multiprocessor
system.
4 MARKS:-
1. Enlist types of operating system. Explain multi-programming OS
in detail.
2. Describe working of time sharing system with neat diagram.
3. Enlist the operating system tools. Explain any two in detail
4. Differentiate between command line based operating system
and GUI based operating system (Any four points) or Compare between
CLI based OS and GUI based OS (any four
points).
5. Describe multiprocessor OS with it's advantages. (any two)
6. Explain real time OS. Explain it's types
Unit 2 :- Services and Components of Operating System.(10 Marks)
2 Marks:-
1. Explain any four services provided by OS.
2. State any four types of system calls.
4 MARKS:-
1.List components of OS. Explain process management in detail. or
Explain different components of operating system. or Write down the
responsibilities of the following components of
OS.
i) Memory management
ii) File management
2. What is purpose of system call? State any two system calls or Explain
different types of system calls or What are the different types of system
calls? Give examples
of each.
with their functions.
3. Enlist the operating system tools. Explain any two in detail
4. List and describe any four services of operating system.
5. Describe various activities performed by following operating
system components.
i) Main memory management
ii) File management
6. Describe with example, use of following tools:
i) Security policy
ii) User Management
iii) Task scheduler
or
Write two uses of following operating system tools.
i) Device Management
ii) Performance monitor
iii) Task scheduler
or
Write two uses of the following operating system tools –
i) Security policy
ii) User management
iii) Performance Monitor
Unit 3 :- Process Management (14 Marks)
2 Marks:-
1. Draw process state diagram.or Draw a neat labeled diagram for
process state.or Draw neat labeled process state diagram along with the
correct directions of arrows.
2. Write syntax of following commands: (i) Sleep (ii) Kill
3. Give commands to perform following tasks: i) To add delay in script ii)
To terminate a process
4. What is the use of PS command? Write long forms of UID, PID in the
output of this command
4 MARKS:-
1. With neat diagram explain inter process communication model.or
Explain shared memory method of IPC using neat labeled diagram.
2. Explain ‘PS’ command with any four options
3. 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
4. State and describe types of scheduler
5. Explain PCB with diagram.
6. Differentiate between shared memory system and message passing
system of inter-process communication.
7. Describe use of PS and wait commands with suitable example.
8. With suitable diagram, describe use of scheduling queues in process
scheduling.
9. Explain different types of schedulers
10. ) Explain following commands with their syntax – i) Kill ii) Sleep iii)
Wait iv) Exit
11. Explain working of CPU switch from process to process with neat
labeled diagram
6 MARKS:-
1. Describe one-to-one multi-threading model with suitable diagram. Also
write any two advantages of one-to-one model over many-to-one model.
Or Explain multi-threading model in detail.
2. Differentiate between process and thread (any two points). Also
discuss the benefits of multi-threaded programming.
Unit 4 :- CPU Scheduling and Algorithm
2 MARKS:-
1. Explain any four scheduling criteria
2. Write the difference between pre-emptive and non-preemptive
scheduling or State difference between preemptive scheduling and non-
preemptive scheduling.
3. Define Deadlock.
4. What is the use of PS command? Write long forms of UID, PID in the
output of this command.
5. Write syntax of following commands: (i) Sleep (ii) Kill
4 MARKS:-
1. Describe I/o burst and CPU burst cycle with neat diagram.
2. Explain deadlock? What are necessary conditions for deadlock?
3. Explain Round Robin algorithm with suitable example.
4. State and describe any two scheduling criteria or
5. Describe prevention of deadlock occurrence with respect to hold and
wait necessary condition.
6. Write steps required for Banker’s algorithm to avoid deadlock
7. Explain different types of schedulers
8. Describe any four condition for deadlock.
9. Explain following terms with respect to scheduling i) CPU utilization
ii) Throughput iii) Turnaround time iv) Waiting time
10. What is deadlock? Discuss any one method of deadlock prevention.
11. 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
6 MARKS:-
1. 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
2. Calculate average waiting time for following data using First Come
First Served (FCFS) and Shortest Job First (SJF) algorithms.
Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 5
P4 3 3
3. With neat diagram explain multilevel queue scheduling.
4. 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
UNIT 5 :- Memory Management
2 MARKS:-
1. Define virtual memory.
2. Define paging and segmentation
3. Define following terms : i) Virtual Memory ii) Paging
4. Define the term fragmentation in terms of memory
5. Define virtual memory.
4 MARKS;-
1. Explain partitioning and its types
2. 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.
3. With suitable diagram, describe the concept of variable partitioning of
memory
4. Define fragmentation. Explain Internal and External Fragmentation
5. Differentiate between paging and segmentation (any 4 points)
6. Explain fixed and variable memory management.
7. 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
8. Explain fixed and variable memory management
6 MARKS:-
1. Describe the concept of virtual memory with respect to paging. Also
draw paging hardware diagram and describe its working with example.
2. 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.
3. 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.
4. 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
0120304230321201701
5. List free space management technique with the help of neat diagram,
explain any one technique in detail. Or List free space management
techniques? Describe any one in detail.
Unit 6 :- File Management
2 MARKS:-
1. Describe any four file attributes.
2. List any four file operations.
3. List any four file attributes and it's meaning.
4. List any four file attributes and it's meaning.
4 MARKS:-
1. Describe sequential and direct access method.
2. Draw the diagram of linked file allocation method and explain it.
3. Explain two level directory structure with suitable diagram.
4.
6 MARKS:-
1. Enlist different file allocation methods? Explain contiguous allocation
method in detail.
2. Draw and explain directory structure of a file system in terms of single
level, two level and tree structure.
3. Describe following directory structures in short with neat sketches: i)
Single level ii) Two level iii) Tree structured
4. List file allocation method and explain any one in details.
