Greater Noida Institute ofTechnology

7, (Approved by AICTE Affilated to AKTU, Lucknow)

Knowledge Park-II, Greater Noida-201306, Distt. G B Nagar
Tele.: Tele:(0120)2320210,11,12 Fax: (0120)232 6653
Website:https://www.gniotgroup.edu.in/

QUESTION BANK

UNIT 1

1. Define essential properties of the following types of Operating system:

i) Batch operating system
ii) Interactive operating system
iii) Time sharing operating system
iv) Real time operating system
2. Define a virtual machine (VM). With a neat diagram, explain the working of a VM. What are the
benefits of a VM?
3. Distinguish among the following terminologies associated with the operating system and explain
eachof them in detail. Multiprogramming systems, Multitasking systems, Multiprocessor systems.
4. What are system calls? Explain the different categories of the system calls.
5. Justify the statement “Operating System can be viewed as a government, resource allocator and a
control program”.
6. Explain different sub components of an operating system.
7. Write a brief note on different operating system structures
8. What is the purpose of command interpreter? Why is it usually separate from the Kernel?
9. What is distributed operating system? What are the advantages of distributed operating system?
10. Define cache memory
11. What is an interrupt.
12. Explain operating system functions and services in detail.
13. Explain User Operating-System Interface in detail
14. Explain essential features of following structure of O.S
a. Monolithic System
b. Layered Systems
c. Micro Kernels

15. Define user mode and kernel mode. Why two modes are required?
16. Distinguish between the client-server and peer-to-peer models of distributed system
17. List any four process management system call.
18. What are the requirements of hard real time and soft real time system?
19. Explain the termParallel System
20. Describe the difference between symmetric and asymmetric multiprocessing?
 Greater Noida Institute ofTechnology
7, (Approved by AICTE Affilated to AKTU, Lucknow)
Knowledge Park-II, Greater Noida-201306, Distt. G B Nagar
Tele.: Tele:(0120)2320210,11,12 Fax: (0120)232 6653
Website:https://www.gniotgroup.edu.in/

UNIT 2

1. Explain and differentiate between user level and kernel level thread.
2. Explain the following term related to IPC - Race condition
3. Explain Peterson’s solution for achieving mutual exclusion
4. What is semaphore?
5. Discuss product-consumer problem with semaphore.
6. Write short note on Dining philosopher problem
7. Write short on message passing
8. Write short notes on Starvation
9. Why mutual exclusion required? Explain any 2 methods of achieving mutual exclusion in detail.
10. Explain in detail the following solutions for achieving mutual exclusion TSL instruction
11. What are critical sections?
12. What are Monitors?
13. What is Principle of Concurrency?
14. Explain Sleeping Barbers Problem.
15. Explain Process Generation.
16. Explain the ways in which inter process communication can be achieved.
17. Define the actions taken by a kernel to context switch: a. Among threads b. Among processes
18. What are co-operating processes?
19. Write short on shell
20. Illustrate the use of fork and exec system calls
 Greater Noida Institute ofTechnology
7, (Approved by AICTE Affilated to AKTU, Lucknow)
Knowledge Park-II, Greater Noida-201306, Distt. G B Nagar
Tele.: Tele:(0120)2320210,11,12 Fax: (0120)232 6653
Website:https://www.gniotgroup.edu.in/

UNIT 3

1. What are various criteria for a good process scheduling algorithm? Explain any two preemptive
scheduling algorithms in brief.
2. Explain the following process scheduling algorithm
a)Priority scheduling b) Shortest job first scheduling
3. Consider following processes with length of CPU burst time in milliseconds Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero
a) Draw Gantt charts illustrating execution of these processes for SJF and round robin (quantum=1)
b) Calculate waiting time for each process for each scheduling algorithm
c) Calculate average waiting time for each scheduling algorithm
4.

Consider following processes with length of CPU brust time in millisecond

Process Brust time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All processes arrived in order p1, p2, p3, p4, p5 all at time zero.

1) Draw Gant charts illustrating execution of these processes for SJF,

non preemptive priority (smaller priority number implies a higher priority)
& round robin(quantum=1)
2) Calculate turnaround time for each process for scheduling algorithm in part (1)
3) Calculate waiting time for each scheduling algorithm in part (1)

5. What are the conditions for deadlock? Explain deadlock detection and recovery in detail.
6. Explain deadlock prevention in detail.
7. Explain deadlock avoidance using banker’s algorithm in details
8. Consider the following snapshot
Allocated Max Available
A B C D A B C D A B C 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
P40 0 1 4 0 6 5 6
Answer the following questions using banker’s algorithm: a) What are contents of matrix end?
b) Is the system in safe state? c) If request for process p1 arrives for (0,4,2,0) .Can the request be
granted immediately?
 Greater Noida Institute ofTechnology
7, (Approved by AICTE Affilated to AKTU, Lucknow)
Knowledge Park-II, Greater Noida-201306, Distt. G B Nagar
Tele.: Tele:(0120)2320210,11,12 Fax: (0120)232 6653
Website:https://www.gniotgroup.edu.in/
9. A system has three types of resources R1 R2 R3 and their number of units are 3, 2, 2 respectively. Four
processes P1 P2 P3 p4 are currently competing for these resources in following number.
a) P1 is holding one unit of R1 and is requesting for one unit of R2.

b) P2 is holding two units of R2 and is requesting for one unit each of R1 and R3.
c) P3 is holding one unit of R1 and is requesting for one unit of R2.
d) P4 is holding two units of R3 and requesting for one unit of R1.
Determine which if any of the processes are deadlock in this state.

10. Differentiate Pre-emptive and Non-preemptive scheduling giving the application of each of them.

11. What is the criterion used to select the time quantum in case of round-robin scheduling algorithm?
Explain it with a suitable example.

12. Explain FCFS scheduling algorithm. Find the average turnaround time and average waiting time for the
processes given in the table below.

Process CPU burst time(in ms)

P1 24
P2 3
P3 3

13. Explain the resource allocation graph

14. Explain about process scheduling? Explain different types of schedulers?
15. Define process and Explain process states in details with diagram
16. Explain process states and process control block in details
17. Describe the fields in a process control block (PCB)
18. Explain threads in detail
19. List the main difference and similarities between threads and process.
20. What is a dispatcher?
 Greater Noida Institute ofTechnology
7, (Approved by AICTE Affilated to AKTU, Lucknow)
Knowledge Park-II, Greater Noida-201306, Distt. G B Nagar
Tele.: Tele:(0120)2320210,11,12 Fax: (0120)232 6653
Website:https://www.gniotgroup.edu.in/

UNIT 4

1. Explain multiprogramming with fixed partition

2. Explain multiprogramming with dynamic partition.
3. Explain static partitioned allocation with partition sizes 300,150, 100, 200, 20. Assuming first fit
method indicate the memory status after memory request for sizes 80, 180, 280, 380, 30.
4. Explain following allocation algorithm. a. First fit b. Best fit c. Worst fit
5. Explain the difference between logical and physical addresses?
6. What is paging? Discuss basic paging technique in details.
7. Explain Segmentation in detail.
8. What is demand paging? Explain it with address translation mechanism used
9. How a page table is implemented?
10. What is virtual memory? How it is implemented.
11. Write short note on: a. Compaction b. TLBc. fragmentation
12. Explain following page replacement algorithm in detail. i. LRU ii. FIFO
13. Explain the following page replacement algorithm. a) Optimal page replacement
14. Explain difference between internal external fragmentations in detail.
15. Consider the following page reference string. 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2How many page
faults would occur for the following replacement algorithm, assuming four and six frames respectively?
a. page replacement. b. FIFO page replacement.
16. Describe the term page fault frequency. What is thrashing? How is it controlled by OS?
17. Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are available. The processes of size 12K,
2K, 25K, 20K is to be allocated. How processes are placed in first fit, best fit, worst fit. Calculate
internal as well as external fragmentation.
18. On a simple paging system with 2^24 bytes of physical memory, 256 pages of logical address Space,
and a, page size of 2^10 bytes, how many bits are in logical address?
19. Calculate page faults for (LRU, FIFO, OPT) for following sequences where page frame is three.
0,1,2,1,4,2,3,7,2,1,3,5,1,2,5.
20. Explain Paged Segmentation.
 Greater Noida Institute ofTechnology
7, (Approved by AICTE Affilated to AKTU, Lucknow)
Knowledge Park-II, Greater Noida-201306, Distt. G B Nagar
Tele.: Tele:(0120)2320210,11,12 Fax: (0120)232 6653
Website:https://www.gniotgroup.edu.in/

UNIT 5

1. Discuss briefly the following issues related to device independent i/o software. a. Uniform interfacing
for device drivers. b. Buffering.
2. Discuss in details devices drivers.
3. Write short notes on: a. Devices independent I/O software b. Goals of I/O software c. Interrupt handler
d. I/O Devices. e. Device drivers f. Device controllers g. Disk space management h. Disk arm
scheduling algorithm
4. Discuss the following: a) Magnetic disk b) CDs c) RAID d) DVDs e) Formatting Disk
5. Discuss the following related to disk space management a) Block size b) Keeping track of free blocks
6. Suppose a disk drive has 400 cylinders , numbered 0 to 399.The driver is currently serving a request at
cylinder 143 and previous request was at cylinder 125 .The queue of pending request in FIFO order is:
86,147,312,91,177,48,309,222,175,130. Starting from the current head position what is the total
distance in cylinders that the disk to satisfy all the pending request for each of the following disk
scheduling algorithms? SSTS
7. Do Question 6 with SCAN
8. Do Question 6 with C-SCAN
9. What criteria are important in choosing a file organization?
10. Explain briefly file system architecture & file management function
11. Which are the typical information elements of a file directory?
12. Which are the typical operations performed on directory?
13. What are the typical access rights that may be granted or denied to a particular user for a particular file?
14. Explain the following file allocation methods a) Contiguous allocation b) i-node
15. 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) Random (d) SCAN (e) SSTF (f) C-
SCAN
16. Explain Disk scheduling algorithm C-LOOK
17. Explain about single-level, two-level directory structure?
18. Explain about file system mounting, file sharing?
19. What is Access Control List.
20. Explain file system reliability & performance in detail.