Unit 1 Questions

1. Explain the following terms:

a. multi programming and multi tasking

b. spooling and buffering

c. racing

d. context switching

e. system call

f. fork system call

2. What are the functions of operating system? Explain various steps involving in routine what are the
different services provided by operating system ?

3. Compare the monolithic and layered architecture.

4. What is operating system? Define the essential properties of the following types of operating sytem:

a. Batch
b. Time sharing
c. Real time operating system
d. Explain the following terms:
e. Spooling
f. Multiprogramming
g. CPU bound & I/O bound
h. System Call

5.Compare process & thread.

6. What is Bootstrap program? Explain.

7. What is the difference between user level thread & kernel level thread?
8. What is the layered architecture? Explain the need of operating.

Unit 2 Questions
1. Explain primitive and non primitive scheduling.
2. Discuss multiprogram vs single user system on the basis of throughput and cpu utilization.
3. What is starvation in Operating System?
 4. What is aging in Operating System?
5. What is process state and transaction diagram?

6. Explain short term medium term and long term scheduling?

7. What is the basic environment for execution of concurrent processes?
8. What is a process and process table?
9.

Unit 3 Questions
1. What is critical section problem? explain 2 process solution ?
2. Write a semaphore solution for reader writer problem and dinning philosopher's problem.
3. What are the various ways to avoid deadlock.
4. What are the conditions to hold for deadlock occur.
5. Explain the following terms

Race condition

two process solution

6. Write short note on deadlock prevention techniques.

7. Define deadlock. Describe four conditions for occurrence of deadlock.
8.

Consider the following snapshot of a system.

Process Allocation 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

p4 0 0 1 4 0 6 5 6

Answer the following questions using the banker’s algorithm:

a. What is the content of the matrix Need?

b. Is the system in a safe state?

c. If a request from process P1 arrives for (0,4,2,0), can the request be

granted immediately?

12. What operations can be performed on a semaphore? what is the difference b/w binary and counting
semaphore?

13. Discuss the banker’s algorithm.

14. Explain deadlock prevention techniques.

15. Consider a system consisiting of 4 resources of the same type.that are shared by 3 processes,each of
which needs atmost 2 resources. Show that the system is deadlock free.

Unit 4
1. What is the difference between logical address space and physical address
space?
2. Consider the main memory with capacity of 3 frames. Assume that the page of
a process ar referenced in te order as given below:

7,0,1,2,0,3,0,4,2,3,0,3

Which one is better FIFO or LRU and why?

3. Define Compaction.
4. What is Dirty bit?
5. What is page fault & when does it occur?
6. What are the main types of memory?
7. What is contiguous allocation?
8. What us paging and segmentation?
9. What is fragmentation?
10. How many types of fragmentation occur in Operating System?
11. What is Belady's Anomaly?
12. What is Virtual Memory? How is it implemented?
13. What is demand paging?
14. What is Thrashing?

Unit 5
1. Explain various methods of accessing file with examples.
2. The head of moving head disk with 200 tracks is currently serving a
request for truck 143 and has just finished a request at track 125. The queue
of requests is kept in the FIFO order: 86, 147, 91, 177, 94, 150, 102, 175, 130.
Explain which of the following disk-scheduling algorithms will have the
minimum amount of head movement to satisfy the above requests: (1) FCFS
(2) SSTF (3) SCAN (4) C-SCAN.