QUESTION
BANK
B.Sc
- IT– III
Operating
System
1. Introduction:
Definition, evolution, need, early system, function, buffering
spooling, single user, multiuser, multiprogramming, multiprocessing,
multitasking, multithreading, batch processing, real time,
time systems, time sharing systems, security, protection.
Q-1) Discuss the role of operating
System as a resource manager and also discuss the evolution of operating
systems. (20)
Q-2) Discuss the features
of Time Sharing, Multi Programmed, Batch processing and distributed operating
systems. (20)
Q-3) What are the three main
purpose of an Operating system? What are the main advantages of multiprogramming?
(20)
Q-4) Differentiate between:
(i) Soft and Hard real time systems. (10)
(ii) Parallel and distributed systems. (10)
Q-5) An operating system controls
and co-ordinates the use of computer resources among different users.
Explain. (10)
Q-6) Differentiate between
the following
(i) Single user and multi user operating system.(10)
(ii) Real time and Time Sharing Operating System. (10)
Q-7) List various types of
operating systems. Discuss in detail the concept of real time systems.
Name a few real time systems. (20)
Q-8) What is an Operating
System? Mention at least six heads under which, the various functions
of an operating system can be classified and explain their role. (15)
Q-9) Give various types of
Operating Systems. (5)
Q-10) Trace the brief history
and development of various operating systems. (10)
Q-11) List different types
of operating system available, based on how they handle data processing
jobs and users. (10)
Q-12) What are the three major
areas in which the operating system divides its services? Give examples.
(10)
Q-13) What do you mean by
Operating System and the importance of an Operating System? (10)
Q-14) Explain Time Sharing
and Real Time System. (10)
Q-15) What do you mean by
an Operating System? Explain the different types of operating system available,
based on how they handle data processing jobs and users. (20)
Q-16) Describe action of the
Kernel when processes make system calls for the following purposes:
(a) A receive request for a message.
(b) A Memory Request.
(c) Request to create a process.
(d) Request to terminate a child process. (20)
2. Processor
Management / CPU Scheduling: CPU - I/O Basic Cycle, process
state, process control lock, Scheduling, Queue, Schedulers,
Scheduling Algorithms, Performance criteria, FCFS, SJF, Priority,
SRTF, Round Robin, Multi -
Levels users Algorithm.
Q-1) What are the major process
scheduling techniques? Discuss their merits and also compare their waiting
time and turn around time by taking an example. (20)
Q-2) What is meant by ready,
running and blocked state of process? Discuss the role of Process Control
Block. (20)
Q-3) What are the different
states of a process? Discuss the transition of a process from running
to blocked and blocked to ready state. (20)
Q-4) Give queuing diagram
representation of process scheduling. Also discuss the role of short term,
medium term and long term schedulers. (20)
Q-5) Explain in detail the
concept of process scheduling and different scheduling queues. (20)
Q-6) Distinguish among a process,
program and thread. (10)
Q-7) Distinguish between a
program and process, explaining why the use of the process concept is
necessary in studying operating systems. (10)
Q-8) What is process scheduling?
(10)
Q-9) In some situations,
a change in the state of one process may cause a change in
the state of another process. Explain all such situations.
(20)
Q-10) What do you
mean by process scheduling? Explain Priority based scheduling.
(10)
Q-11) Give queuing
diagram representation of process scheduling. Also discuss
the role of short term, medium term and long term schedulers.
(20)
Q-12) What is
the difference between preemptive and non-preemptive scheduling?
(10)
Q-13) Explain
FCFS, SJF and multilevel queue scheduling algorithms. (10)
Q-14) What is
CPU- I/O burst cycle? What are different CPU scheduling criteria?
Explain the role of CPU scheduler and dispatcher in CPU scheduling
(15)
Q-15) Differentiate
between FCFS and Round Robin scheduling. (5)
Q-16) Following
is the information relating to some processes:
Process Burst Priority
Arrival Time
P1 21 1 0
P2 13 5 6
P3 10 3 8
P4 8 1 10
P5 6 6 13
Using the above
information, compute the average waiting time and average
turn around time for each process for the following algorithms
(a) Preemptive SJF
(b) Priority Scheduling
(c) Preemptive Priority Scheduling
(d) Round Robin (with time quantum of 3 units)
Note: Ignore the arrival time for non-preemptive algorithms.
(20)
Q-17) What do
mean by CPU scheduling? What is scheduling criteria? Discuss
in detail. (20)
Q-18) List and
explain the major types of CPU scheduling. (10)
Q-19) Distinguish
between preemptive and non- preemptive scheduling policies.
(10)
Q-20) Explain
scheduling and various techniques of Scheduling. (10)
3. Memory
Management: Preliminaries, Machine Resident monitor, relocation,
Swapping, backing storage, swap time,
registers, box and limit registers, MFT, MFT job scheduling,
region size selection, memory fragmentation, MVT, MVT job
scheduling compaction, paging, Hardware, Job Scheduling.
Q-1) What is meant by fragmentation
problem? How can it be controlled using Paging and Segmentation
technique? Explain. (20)
Q-2) Describe
the First Fit, Best Fit and Worst fit techniques of memory
allocation and compare them with paging technique. (20)
Q-3) Write short
note on the following:
(i) Fragmentation
(ii) Segmentation technique of memory management. (20)
Q-4) Differentiate
between:
(i) Page and Segment (10)
(ii) Swapping and Compaction (10)
Q-5) Explain the following algorithms
(1) First-Fit (2) Best-Fit (3) Worst-Fit (20)
Q-6) When do page
fault occurs? Describe the action taken by operating system
when a page fault occurs. Also explain the causes of thrashing.
(20)
Q-7) What is paging?
How is it implemented? What is the difference between paging
and segmentation? (20)
Q-8) Discuss in
detail the segmentation scheme of memory management? Compare
it with paging scheme. (15)
Q-9) Is it necessary
for all of the pages of a process to be in main memory while
the process is executing? (5)
Q-10) In a paging
system, which of the following actions are likely to improve
CPU utilization and which would reduce it? Account for your
answer.
(i) Increase CPU speed.
(ii) Increase paging disk speed
(iii) Increase the number of active processes.
(iv) Reduce the number of active processes. (20)
Q-11) Distinguish
between paging and segmentation. Why is paging faster than
segmentation?
Q-12) Is it necessary
for all the pages of a process to be in main memory while
the process is executing? (10)
Q-13) On a simple
paged system can the logical address space be larger than
the physical address space? Can it be smaller? Explain. (10)
Q-14) Name and
explain different memory management schemes. (10)Q-15)
Discuss impact of page size on the overall system performance.
(5-10)
Q-16) Describe
the general objectives of the memory management system within
an operating system. (15)
Q-17) Why is relocation
of program in memory necessary? (5)
Q-18) Explain
the address translation mechanism in paging. Why is the page
size normally some power of two? (10)
Q-19) Explain
Static and Dynamic memory allocation. (10)
4. Virtual
Memory: Overlays, demand paging, page fault, performance of
demand paging, page replacement, page
replacement algorithm, FIFO, optional replacement fault frequency,
page size.
Q-1
Discuss the demands paging technique of memory management
and also discuss the FIFO and optimal page replacement algorithms.
(20)Q-2 What
is meant by page replacement? Discuss the different algorithms
used for page replacement. (20)
Q-3) Explain the
following page replacement algorithms:
(a) LRU (b) Optimal replacement (c) FIFO (15)
Q-4) Write a note
on thrashing. (10)
Q-5) Why do systems
that use demand paging generally deliver higher performance
than those that use virtual memory? (10)
Q-6) Compare various
page replacement algorithms/strategies. (10)
Q-7) How does
virtual memory system prevent programs from accessing each
other’s data? (10)
Q-8) What is Thrashing?
When does it occur? How can one avoid it? (10)
5. Device
Management: I/O and device management physical characteristics,
FCFX, SSTF, SCAN, CSCAN Disk and File managment.
Q-1 How an operating
system carries out the disk scheduling? Compare the SSTF and
SCAN scheduling algorithm. (20)
Q-2 Discuss the disk structure
and describe the different disk scheduling algorithms. (20)
Q-3) Write a note on Disk
Reliability? How can it be maintained? (20)
Q-4) How SCAN, C-SCAN and
LOOK disk scheduling algorithms differ in their approach? (15)
Q-5) What is Disk
structure? (5)
Q-6) Discuss in
detail the structure of floppy disk. (20)
Q-7) What do you
understand by disk scheduling and disk reliability? Explain.
(10)
Q-8) Explain the
Disk scheduling. (10)
6. Deadlocks:
Definition, Necessary condition, to occur RAG, Deadlock Prevention
Mutual exclusion, Hold and wait, No pre-emption, circular
wait Bankder’s algorithms, Recovery from deadlock, semaphores.
Q-1 Define the
deadlock situation. How can a deadlock situation be prevented
and avoided? Explain (20)
Q-2 Define the
deadlock. How can it be prevented? (10)
Q-3) What is safe
state? Explain Banker’s algorithm of Deadlock Avoidance.
(20)
Q-4) What do you
mean by a deadlock? Discuss various deadlock detection and
recovery techniques in brief. (20)
Q-5) What is Deadlock?
Give an Example. (10)
Q-6) Explain how
deadlock can be represented graphically for two processes
and two resources. (10)
Q-7) Name different strategies
that operating system designers can adopt Vis-à-vis
problem of a deadlock. (10)Q-8)
What is Deadlock? Explain how a deadlock can be detected and
what are the different approaches to recover from deadlocks?
(20)
Q-9) Explain Deadlock
and deadlock avoidance (10)
Other Questions:
Q-1) Write short note on: (20)
a) Virtual Memory
b) Threads
c) Distributed System
d) Demand Paging
Q-2) Explain following:
(20)
a) Deadlock
b) Deadlock Prevention
c) Memory Fragmentation.
d) Multiprogramming.
Q-1) Write short
note on
(i) Semaphores (ii) Thrashing (20)
Q-2) What is meant
by critical section problem? How can semaphores be used for
process synchronization? Explain. (20)
Q-3) What is Semaphore?
Define P & V Operations on semaphores. Also explain Bounded-Buffer
problem. (20)
Q-4) What are
the three requirements that a solution to the critical section
problem must satisfy? Also explain Bounded-Buffer problem.
(20)
Q-5) Define Semaphores.
In which cases are used? Explain how these can be implemented?
(20)
Q-6) What are
the three requirements that a solution to the critical section
problem must satisfy? (5)
Q-7) What are
semaphores? How do they implement mutual exclusion? What are
the different types of semaphores? How can they be implemented?
(20)
Q-8) What is critical
section problem? (10)
Q-9) Describe
how semaphores can be used for block/wakeup synchronization
between processes. (10)
Q-10) What is
classical problem of synchronization? (10)
Q-11) What do
you mean by Semaphores and Semaphores used in concurrent system?
|
