DEPARTMENT OF CSE IOT
Operating System (BCS 401)
QUESTION BANK
Unit 1
1. What is a Operating system?
2. What are operating system services?
3. Describe the operating system operations?
4. Explain time sharing operating system?
5. Explain about system calls?
6. What is OS user interface?
7. Discuss the Simple Operating System Structure. Describe the layered approach.
8. Explain operating system functions and services in detail.
9. Explain Boot strap loader.
10. Explain various services of operating system.
11. Explain the major activities of an operating systems with regard to process management?
DEPARTMENT OF CSE IOT
Operating System (BCS 401)
QUESTION BANK
Unit 2
1. Define critical section problem.
2. List out the classic problems of synchronization.
3. Define Process control block.
4. What is semaphore? Explain its usage and implementation and solution to the Bounded-Buffer
problem using semaphore.
5. Define monitor state in dining philosophers’ problem and give its solution using monitors.
6. Explain synchronization hardware.
7. List the essential requirement of critical section implementation.
8. Explain Dekker’s solution and busy waiting.
9. Write and explain the Peterson solution to the critical section problem.
10. Differentiate between parallel execution and concurrent execution.
11. Explain semaphore with suitable example.
12. What are the advantages and disadvantages of semaphore.
DEPARTMENT OF CSE IOT
Operating System (BCS 401)
QUESTION BANK
Unit 3
1. Define turn around time and response time.
2. List out various CPU scheduling algorithm.
3. What are different types of schedulers?
4. What is a process? Explain different process states.
5. Explain the scheduling criteria.
6. Define Thread and explain advantages of threads?
7. Explain the scheduling criteria.
8. Explain about process scheduling? Explain different types of schedulers?
9. Explain Priority scheduling algorithm with example.
10. Explain about different multithreading models.
11. What is starvation? Explain with example.
12. What do you understand by dependency preservation?
13. Consider the following five processes, with the length of the CPU burst time given in
milliseconds. Process Burst time P1 10 P2 29 P3 3 P4 7 P5 12 Consider the First come First serve
(FCFS), Non Preemptive Shortest Job First(SJF), Round Robin(RR) (quantum=10ms) scheduling
algorithms. Illustrate the scheduling using Gantt chart.
14. What is deadlock and its necessary conditions? Explain deadlock prevention in detail.
1 5 . Explain about recovery from deadlock?
16. Explain in details RAG.
17. Define deadlock detection. Write the algorithm for deadlock detection
18. What are the two ways in which deadlock can be detected.?
20. Describe the Banker’s algorithm and how it can be used to avoid deadlock.
21. Consider the following table of the system:
Allocation Max Available
A B C D A B C D A B C D
P1 0 0 1 2 0 0 1 2 1 5 2 0
P2 1 0 0 0 1 7 5 0
P3 1 3 5 4 2 3 5 6
P4 0 6 3 2 0 6 5 2
P5 0 0 1 4 0 6 5 6
Answer the following questions using the banker’s algorithm:
• What is the content of the matrix need?
• Is the system in a safe state? If yes then find the safe sequence.
• If a request from P1 arrives for (0, 4, 2, 0) can the request be granted immediately?
22. Differentiate between deadlock and starvation.
DEPARTMENT OF CSE IOT
Operating System (BCS 401)
QUESTION BANK
Unit 4
1. What is External Fragmentation?
2. What is Demand Paging?
3. What is the basic approach of Page Replacement?
4. Discuss LRU-Approximation page Replacement.
5. Explain the basic concepts of segmentation in detail
6. What is thrashing and explain the methods to avoid thrashing?
7. Write about the techniques for structuring the page table
8. Explain with the help of examples FIFO and LRU, optical page replacement algorithms with
example reference string.
9. Differentiate local and global page replacement algorithm. Differentiate local and global
pagereplacement algorithm.
10. Given page reference string:
● 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
● Compare the number of page faults for LRU, FIFO and Optimal page replacement
algorithm with 3 frames.
DEPARTMENT OF CSE IOT
Operating System (BCS 401)
QUESTION BANK
Unit 5
1. What are the various File Operations?
2.. What is meant by Locality of Reference?
3. Define Seek Time and Latency Time.
4. What are the Allocation Methods of a Disk Space?
5. What are the drawbacks of Contiguous Allocation of Disk Space?
6. Discuss the objectives for file management systems.
7. Explain about file attributes, file operations, and file types?
8. Suppose the head of a moving- head disk with 200 tracks, numbered 0 to 199, is Currently serving a
request at track 143 and has just finished a request at track 125. If the queue of requests is kept in FIFO
order: 86, 147, 91, 177, 94, 150, 102, 175, 130. What is the total head movement to satisfy these
requests for the following Disk scheduling algorithms. (a)FCFS (b) SCAN (c) SSTF (d) C- SCAN, (e)
LOOK and (f) C-LOOK.
9. What is meant by Locality of Reference?
10. What are the Allocation Methods of a Disk Space?
11. What are the drawbacks of Contiguous Allocation of Disk Space?
