SRI CHAITANYA TECHNICAL CAMPUS
I MCA I SEMESTER (R25)
Operating System Important Questions
UNIT - I
1) Define operating system. Explain the working mechanism of an operating
system.
2) Explain briefly about Multiprogrammed operating system
3) Explain the differences between multiprogramming and multiprocessing
systems.
4) Explain the differences Between time sharing and real time systems.
5) Present various states a process goes through during its life time with a neat
state diagram.
6) Elaborate on evolution of operating system.
7) List and explain the services provided by an operating system.
8) Distinguish between parallel and distributed systems.
9) State the role of a process scheduler.
10) What is thread? Explain about various type of threads.
UNIT - II
1) What is CPU scheduling? Explain the criteria for CPU scheduling?
2) Draw the queuing –diagram representation of process scheduling and
explain the need for scheduling along with various scheduling criteria.
3) Explain briefly about System call interface for process management.
4) Explain briefly about FCFS CPU scheduling algorithm.
5) Explain in detail about the multiple processor scheduling.
6) Following is the snapshot of a cpu:
Process CPU Arrival priority
Burst Time
P1 08 4 2
P2 12 1 5
P3 16 2 4
P4 05 3 3
P5 20 0 1
Draw the Gantt chart and calculate the turnaround time and waiting
time of the jobs for FCS (first come first served), SJF (Shortest Job First),
SRTF (Shortest Remaining Time First) And RR (Round Robbin with Time
Quantum5)
And priority scheduling algorithms.
7) What is Deadlock? Explain Deadlock Prevention Techniques
8) Demonstrate Banker’s Algorithm to Avoid Deadlock with and Example.
9) Discuss Various Deadlock Avoidance AND recovery from deadlock
Techniques
UNIT – III
1) Illustrate the Peterson’s solution to the critical-section problem with
example code segments
2) Explain the wait() and signal() operations of a semaphore with an illustrate
example.
3) List and explain various shared memory APIs used to implement IPC
between the processes with code snippets.
4) Explain how process synchronization is achieved through monitors.
5) What is various Methods of IPC Explain in detail.
6) Explain about the FIFO Concept in IFC?
7) Explain interprocess communication between processes through shared
memory.
UNIT – IV
1) Explain briefly about Swapping?
2) Elaborate the hardware support with TLB for paging scheme with a neat
diagram
3) Explain The Hierarchical paging technique for structuring the page table
4) How many page faults occur when applied FIFO, LRU, and optimal page
replacement algorithms considering the following reference string with three
and four page frames
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
5) Explain the inverted page table hashed page table techniques
6) How many page faults occur when applied FIFO, LRU, and optimal page
replacement algorithms considering the following reference string with three
and four page frames
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1,7,2
7) What is Paging? How is paging different from segmentation? Explain
memory management technique through paging.
8) Explain FIFO and LRU approximation algorithms with examples.
UNIT – V
1) Summarize the information associated with an open file
2) Explain the internal file structure and directory structure with neat diagrams
for each
3) Describe the common schemes for defining the logical structure of a
directory.
4) Explain various free space management techniques
5) Explain about lseek() and open()system calls
6) What is file protection? How it is achieved?
7) Explain about stat() and create()system calls.
8) Summarize the basic attributes associated with a file.
9) Explain various file access methods with brief illustrations
10) Describe the motivation behind file sharing and explore some of the
difficulties in allowing users to share file.
Mr.M. Venu MCA
HOD, Department of Master of Computer
Applications