Operating Systems 1 : TYBCS : SPPU : PYQs

 Chapter 1 Introduction to Operating Systems 

1 mark

a) Define bootstrapping

a) What is system call? Explain system call related to device manipulation.

j) What is booting?

 

4 mark

(a) Explain layered operating system in brief with diagram

a) Write advantages of distributed operating systems.

a) Differentiate between client server and peer to peer computing environments

Chapter 2 Processes and Threads 

1 mark

b) Explain posix pthread

Q. Give examples of operating systems using pthread.

g) What is ready queue?

g) What is context switching?

(i) Define multiprocessor system. 

(a) Write advantages of multiprocessor system. 

(b) What are the types of processes ?

(g) What do you understand by a thread ? 

(j) List any two advantages of multithreaded programming. 

(j) List any two advantages of multithreaded programming. 

(d) State two benefits of multi-threaded programming. 

(c) Explain any two benefits of multithreaded programming. [2] 

4 mark

(b) Explain multilevel feedback queue scheduling with diagram.

(b) Explain multilevel feedback queue scheduling with diagram.

(a) What is process ? State and explain in brief different types of process states.

(a) Write a short note on process states. 

a) Explain multi threading model in detail. 

e) Define independent and dependent processes.

d) List the types of schedulars and also explain short term schedulars in detail.

a) What is thread? Explain any 2 multithreading models in brief with diagram.

b) Write short note on multilevel queue scheduling.

(ii) Write a note on multilevel queue scheduling.

(e) Write any two disadvantages of priority scheduling. 

d) What is a thread library?

(iii) Differentiate between user level thread and kernel level thread. 

b) Compare preemptive and non preemptive scheduling?

(ii) Is the system in a safe state ? If yes, find safe sequence.

 (ii) Is the system in a safe state ?

Chapter 3 Process Scheduling 

1 mark

c) What is role of dispatcher?

(b) What is dispatch latency ? 

h) What do you mean by I/O bound process?

(j) Define I/O bound process. 

b) Define the I/O Bound process.

i) Define the term dispatcher?

4 mark

(a) What is co-operating processes ? Explain two fundamental models of inter-process communication. 

e) Write difference between preemptive and non preemptive scheduling?

a) Define process. Explain process state diagram in brief.

b) Explain first fit, best fit, worst fit, next fit algorithm.

Q. Give any four criteria for computing various scheduling algorithms.

(i) Explain the process of CPU-I/O burst cycle with neat diagram.

Chapter 4 Synchronization

1 mark

d) List the solutions to critical section problem

i) What are the two types of semaphores?

c) Define the term semaphore

(h) What are the types of semaphores ? 

(f) “Counting semaphore can be implemented by using binary semaphore.” True/False Justify.

e) What is synchronisation?

4 mark

(c) What is critical section problem ? Explain two general approaches to handle critical section in operating system.

Q. (c) What is critical section problem ?  how it is solved.

(i) What is critical section problem ? Give Peterson’s solution to solve critical section problem.

(c) What is Semaphore ? Explain Bounded-Buffer problem

(B) (i) Discuss the bounded buffer problem with its solution. [4] 

(c) Explain critical selection problem. 

b) Which three requirements must be satisfied while designing a solutions to the critical section problem? Explain in detail.

c) Explain producer, consumer problem

b) Explain reader-writer problem in brief

b) Explain bounded buffer problem in detail.

Chapter 5 Memory Management

1 mark

e) What do you mean by page hit?

j) What is virtual memory?

f) What is physical address space?

h) What is page?

(e) Define cache memory.

4 mark

(b) What is role of valid and invalid bit in demand paging ? 

(iii) Write benefits of virtual machine. [2]

(i) List two benefits of virtual machine. 

(i) List various dynamic allocation memory management methods. 

c) List out functions of memory management.

d) Explain paging in brief.

Q. What is advantage of paging with segmentation model.

(e) What is Aging ? 

b) Write short note on logical address and physical address binding with diagram

c) Consider a reference string 3,2,1,0,3,2,4,3,2,1,0,4 No. of frames = 3. Find out the number of page faults using i) LRU ii) OPT.

c) Consider the following reference string and find out the total number of page faults using OPT and FIFO. Assume no of frames are 3 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3

b) Describe segmentation in detail.

(iii) What is page table ? What are its contents ? [2]

(b) Write a note on segmentation hardware. 

(c) Explain the indexed allocation and linked allocation method of disk space management.

 (a) What is Fragmentation ? Explain types of fragmentation with suitable example.

Q. Explain internal and external fragmentation in detail.

(b) What is external fragmentation ? What are various ways to avoid external fragmentation ?

a) Describe PCB with all its fields.

f) What is kernel?

(a) What is kernel ?

(j) What is the main function of microkernels ?

(j) What is the main function of microkernels ?

a) What is a shell?

Q. Explain different file access methods.

(h) Define Starvation. 

(ii) Write a short note on deadlock prevention stratergies

(ii) Write a short note on deadlock prevention stratergies

(c) Define Request edge and Claim edge.

(f) What is bit vector ?

(c) Define turn around time.

(d) State the necessary conditions for a deadlock to occur.

(a) Explain the different ways for deadlock recovery. 

(g) List any four file attributes. 

(b) Explain tree-structured directories along with its advantages and disadvantages. 

 (a) Explain tree structured directories along with advantages and disadvantages.

(i) What are the contents of need matrix ? 

(i) What is content of Need Matrix ? 

-(c) Define Reentrant code. 

(g) What is race condition ? 

(c) What is a wait-for-graph ? [2]