Question Bank
Two marks questions:
1. Define operating system
2. Define Process
3. What do mean by system calls ?
4. What is a Process control block?
5. What is context switching?
6. Difference between process & program
7. What is preemptive Scheduling?
8. What is Non- preemptive Scheduling?
9. What is process synchronization?
10.What is race condition?
11.What is thread?
12.What is multicore programming?
13.Define Mutual Exclusion
14.What is deadlock
15.Define aging
16.What do you mean by critical section?
17.Difference between logical address & Physical address
18.Difference between fixed partition & dynamic Partition
19.Define Fragmentation
20.Define Page Fault
21.Define semaphore
22.What are the two types of semaphore? Define
23.Define Paging
24.What are page replacements? Steps for page replacement
25.What is demand paging?
26.Define Seek time
27.What do you mean by virtual memory?
28.What is Belady’s Anomaly?
29.What is a hole?
30.What is virtual memory?
31.Explain free space management?
32.Explain swap space management?
33.What is dynamic loading?
34.What is thrashing?
35.List Various file attributes
36.List Various types of files
5 & 10 Mark questions
1. Explain the functions and Goals of OS
2. Explain the services of OS
3. Explain Different types of OS with advantages & disadvantages
4. Explain types of system calls
5. Explain kernel? Types of kernel
6. Explain kernel data structure
7. Explain process state with a neat diagram
8. Explain Multithreading models
9. Explain Critical section problem with respect to Peterson’s solution
10.Explain classical Problems of Synchronization for producer - consumer
problem
11.Explain classical Problems of Synchronization for reader - writer problem
12.Explain dining philosophers problem
13.Explain dining philosophers problem with respect to monitors
14.Explain FCFS scheduling Algorithm
15.Explain SJF scheduling Algorithm
16.Explain Priority scheduling algorithm
17.Explain Round Robin scheduling algorithm
18.Explain the necessary conditions for deadlocks
19.Explain resource allocation graph
20.Explain deadlock prevention methods
21.Explain deadlock avoidance
22.Explain Banker’s algorithm
23.Explain methods for handling deadlocks
24.Explain contiguous memory allocation
25.Explain non-contiguous memory allocation
26.Explain types of fragmentation
27.Write a brief note on segmentation
28.Write a brief note on Paging
29.Explain first fit, best fit , worst fit
30.Explain FIFO Page Replacement
31.Explain Optimal Page Replacement
32.Explain LRU Page Replacement
33.Explain allocation of frames
34.Explain Different types of file access methods
35.Explain directories
36.Explain various file protection
37.Explain file system structure
38.Explain file system Implementation
39.Explain directory Implementation
40.Explain disk scheduling algorithms
41.Explain different types of file allocation methods
42.Explain the structure of harddisk with neat diagram
43.Explain disk structure / magnetic - disk structure