Department of Computer Science and Engineering
KPR Institute of Engineering and Technology
U19CS401-OPERATING SYSTEM
QUESTION BANK
UNIT I
PART – A
1. Define operating system? List out the functions of operating system
2. What is the kernel?
3. What are batch systems?
4. Mention the advantages in using multiprogramming systems.
5. What is graceful degradation?
6. Differentiate tightly coupled systems and loosely coupled systems?
7. What is real time system?
8. What are privileged instructions?
9. What do you mean by system calls and categories of system calls?
10. What are various objectives and functions of the Operating System?
11. Define schedulers.
12. What is the use of job queues, ready queues and device queues?
13. Define the term context switch.
14. Differentiate between Long-term scheduler and short-term scheduler.
15. How can a user program disturb the normal operation of the system?
16. State the advantage of multiprocessor system.
17. What does the CPU do when there are no user programs to run?
18. Describe the actions taken by a kernel to context-switch between processes.
19. What are CPU interrupt request lines?
20. What is interrupt chaining?
21. What is the use of cache memory?
22. What is multicore processor?
23. What is memory stall?
PART B
1. Explain Operating System Structure and components.
2. (i) Discuss multiprocessor systems in detail.
(ii) Explain the purpose and importance of system calls in detail with examples.
3. Explain in detail the types of system calls provided by a typical operating system.
4. Explain the purpose of system calls and discuss the calls related to device
management and communications in brief.
5. Explain the state diagram and life cycle of the process.
6. Define system call. Explain the categories of system calls in detail.
7. Write notes on handheld system and clustered system.
8. Explain the concepts of virtual machines, their implementation and benefits in details.
9. Write short notes on operating system services and components.
10. Write in detail about the real time system and multiprocessor system.
UNIT II
PART – A
1. What is a process?
2. What is PCB? Specify the information maintained in it.
3. What is process state?
4. What are the benefits of co-operating process?
5. What is the use of inter process communication?
6. Define thread.
7. Identify the approach used to solve starvation in priority scheduling.
8. Differentiate a Thread form a Process.
9. What are the requirements that a solution to the critical section problem must
satisfy?
10. What is preemptive and nonpreemptive scheduling?
11. State the necessary conditions for deadlock to occur.
12. Name some of the classical problems of process synchronization.
13. Define deadlock prevention.
14. Specify the steps involved during recovery from deadlock.
15. Define deadlock avoidance.
16. What is banker’s algorithm?
PART B
1) (i) Explain the various scheduling criteria in evaluating scheduling algorithms.
(ii) Explain the FCFS, preemptive and non-preemptive versions of Shortest-Job
First and Round Robin (time slice = 2) scheduling algorithms with Gantt charts
for the four processes given. Compare their average turnaround and waiting time.
Process Arrival Time Waiting Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
2) Discuss how scheduling algorithms are selected for a system. What are the
criteria considered? Explain the different evaluation Methods.
3) Provide a process synchronization solution for Reader-Writer problem.
4) Discuss the different techniques used for evaluating CPU scheduling
algorithms in detail.
5) Assume the following workload in a system. All process arrives at the system in the
order given.
Proces Arrival Burst Priorit
s Time Time y
P1 1 4 5
P2 2 5 2
P3 3 6 6
P4 0 1 4
P5 4 2 7
P6 5 3 8
i) Draw a Gantt chart illustrating the execution of these jobs using SJF, Preemptive Priority
and Round Robin CPU scheduling algorithms. For round robin, assume the time quantum as
5ms.
ii) Compare and conclude the performance of each algorithm based on the waiting time
and turnaround time.
6) Consider the following set of processes, with the length of the CPU – burst time
given in milliseconds
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are arrived in the order P1, P2,P3,P4,P5, all at time 0.
Draw 4 Gantt charts illustrating the execution of these processes using FCFS, SJF Priority
and RR (Time Slice = 1) scheduling
What is the turnaround time of each process for each of the scheduling?
Calculate the waiting time for each of the process
7) Write in detail about deadlock recovery.
8) Explain the Banker algorithm for deadlock avoidance in detail.
9) Five process are competing for resources where Available (R1, R2, R3, R4) = (6, 4,
4, 2). The maximum claim of these process and the initial resources allocated to
these process are given below.
Max request Allocation
R R R R R R R R
1 2 3 4 1 2 3 4
P
3 2 1 1 2 0 1 1
1
P
1 2 0 2 1 1 0 0
2
P
1 1 2 0 1 1 0 0
3
P
3 2 1 0 1 1 1 0
4
P
2 1 0 1 0 0 0 1
5
i). Does this initial allocation lead to a safe state? Describe with reason.
ii). If P2 requests (2,0,1,1). Check whether the system is still in safe state.
10) Consider the following snapshot of a system:
Allocation Max Available
A B C D A B C D A B C
Process
D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using the principle of banker’s algorithm:
a. What is the content of the matrix ‘Need’?
b. Is the system in a safe state?
If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted
immediately?
11) Explain the RAG representation in deadlock detection.
12) Explain the various algorithms to achieve mutual exclusion.
UNIT III
PART – A
1. What is the main function of the memory-management unit?
2. Define dynamic loading.
3. What is virtual memory? Mention its advantages.
4. Differentiate tightly coupled systems and loosely coupled systems?
5. Define Demand paging and write advantages.
6. What are the various page replacement algorithms used for page replacement?
7. What are the major problems to implement demand paging?
8. Differentiate a page from a segment.
9. “Paging scheme leads to external fragmentation”. Comment the statement with valid
reasons.
10. Compare the paging and segmentation memory management schemes.
11. Consider a logical address space of eight pages of 1024 words each, mapped onto a
physical memory of 32 frames. How many bits are there in the logical address and in
the physical address?
12. List the Benefits of paging and Segmentation.
13. What do mean by page fault?
14. Define Belady’s anomaly.
PART B
1. Consider a logical-address space of eight pages of 1024 words each mapped onto a
physical memory of 32 frames.
a. How many bits are in the logical address?
b. How many bits are in the physical address?
2. Explain the segmentation with paging implemented in OS/2 32-bit IBM system.
Describe the following algorithms:
a. First fit
b. Best Fit
c. Worst Fit
3. Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order), how
would each of the First-fit, Best-fit and Worst-fit algorithms place process of 212K,
417K, 112K and 426K (in order)? Which algorithm makes the most efficient use of
memory?
4. Explain how paging supports virtual memory. With a neat diagram explain how
logical address is translated into physical address.
5. Under what circumstances do page faults occur? Describe the actions taken by the
operating system when page fault occurs.
6. Explain about contiguous memory allocation with an example.
7. Explain the role of compaction to resolve external fragmentation with an example.
8. Explain the principles of segmented and paging implemented in memory with a
diagram.
9. Explain the various page table structures in detail.
10. Write short notes on LRU, FIFO and clock replacement strategies?
11. Explain any four-page replacement algorithms in detail?
12. How many page faults would occur for the following replacement algorithms,
assuming one, two, three and four frames?
Consider the following page-reference string: 1, 2, 4, 3, 5, 1, 6, 2, 3, 1, 4, 5, 1, 3, 1
i. LRU replacement
ii. FIFO replacement
iii. Optimal replacement
13. Explain the concept of demand paging in detail with neat diagram
UNIT IV
PART – A
1) What are the information associated with an open file?
2) What is Directory?
3) What are the most common schemes for defining the logical structure of a
directory?
4) What are the various layers of a file system?
5) List the information’s associated with an open file.
6) Define seek time and latency time.
7) How can the index blocks be implemented in the indexed allocation scheme?
8) Mention the objectives of File Management System.
9) How free-space is managed using bit vector implementation?
10) What are the various disk-scheduling algorithms?
11) Give the importance of Swap space Management.
12) Write three basic functions which are provided by the hardware clocks and timers.
PART – B
1. Explain the different disk scheduling algorithms with examples.
2. Explain and compare FCFS, SSTF, C-SCAN and C-LOOK disk scheduling
algorithms with examples.
3. How do you choose a optimal technique among the various disk scheduling
techniques? Explain.
4. Write short notes on disk management.
5. With your own example, describe the most common schemes for defining the logical
structure of a directory. Conclude which scheme is best suitable for your working
environment.
6. Explain in detail the disk structure and implementation
7. Discuss how free space is managed by operating system?
8. Explain the process scheduling in Linux.
9. Write in detail the memory management in Linux.
10. Discuss in-detail the disk performance with suitable expressions.
11. Write short notes on swap space management.
12. Write short notes on file system in Linux.
13. Explain about the various components and salient features in Linux.
14. Write an elaborate note on RAID and RAID Levels.
15. Explain the file allocation methods
16. (i) Explain the issues in designing a file system.
(ii) Explain the various file directory structure
UNIT V
PART – A
1. What are the main supports for the Linux modules?
2. What is meant by kernel in Linux system?
3. What is meant by Process-ID?
4. What is the disadvantage of static linking?
5. What is the function of module management?
6. What is Mobile OS?
7. List the services available in iOS.
8. List the advantages of iOS
9. How are iOS and Android similar? How are they different?
10. Describe some challenges of designing OS for mobile device compared with designing
OS for traditional PC’s
11. List the disadvantages of Android
12. What is meant by buffer cache?
PART – B
1. Explain the basic concepts of the Linux system
2. Explain about kernel modules
3. Explain in detail about the process management in Linux
4. Explain in detail about the scheduling in Linux
5. Explain the iOS architecture and various layers available in iOS
6. Discuss about various services in the media layer
7. Discuss about various services in the iOS core OS layer
8. Discuss about various services in the iOS service OS layer
