NAME OF PROGRAMME: B.

TECH (CSE)
SEMESTER / YEAR:IV/II YEAR
SUBJECT NAME (SUBJECT CODE): OS (BCS401)

Course Outcome: for example, only

CO1: Understand the structure and functions of OS
CO2: Learn about Processes, Threads and Scheduling algorithms
CO3: Understand the principles of concurrency and Deadlocks
CO4: Learn various memory management scheme
CO5: Study I/O management and File systems.

SECTION-A
Note: 10 questions from each unit as per 10 marks or 5 marks.

Q.1.
UNIT-I
a) Write down the different types of operating system. CO1

b) What is Real time operating system? What is the difference between hard real time and soft real CO1
time operating system?

c) Write down the difference between Multiprocessing and Multiprogramming. CO2

d) Explain Layered structure of an operating system. Also explain advantages and disadvantages of CO1
layered approach to system design.
e) Explain the services provided by operating system. CO3

f) What is kernel? Describe various operations performed by kernel. CO2

g) Differentiate between the following: CO1

i) Shell and kernel
ii) Monolithic kernel and micro-kernel

h) What do you understand by System call? Enumerate five system calls used in process management. CO2

i) Describe the difference between symmetric and asymmetric multi-processing. CO2

j) What is an operating system? Define the components of an operating system CO3

UNIT-II
a) State and describe the producer consumer problem with its suitable solution. CO1

b) Explain Semaphores with suitable example. CO2

c) Write a short note on interprocess communication. CO2

d) What do you understand by critical section? What are the requirements of a solution to the critical CO2
section problem?

e) Describe Peterson solution. CO1

f) Explain the following terms briefly: CO3

 i) Dekker’s solution
ii) Busy waiting
g) What do you mean by process model or process? CO2

h) Explain in detail about the Dining Philosopher Problem CO2

i) State the readers/writers problem with readers having priority. Give solution of the problem using CO2
semaphore.

j) Differentiate between concurrent execution and parallel execution. CO1

UNIT-III
a) What is CPU Scheduling? Give the criteria for scheduling. CO2

b) Draw the process state diagram and describe the various process states. CO2

c) Differentiate between user level and kernel level threads. CO2

d) Consider the following snapshot CO2

Allocated Max Available

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?
e) List various performance criteria for scheduling algorithms. Five processes A,B,C,D,E requires CPU CO2
burst of 3,5,2,5 and 5 units respectively. Their arrival times in the system are 0,1,3,9 and 12
respectively. Draw Gantt Chart and compute the average turnaround time and average waiting time of
these processes for the Shortest Job First (SJF) and Round robin(time quantum=3).

f) a). Consider the following process: CO3

Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
What is the average waiting and turnaround time for these processes with?
(i) FCFS Scheduling
(ii) Pre-emptive SJF Scheduling
g) A system has three types of resources R1 R2 R3 and their number of units are 3, 2, 2 respectively. CO1
Four processes P1 P2 P3 p4 are currently competing for these resources in following number.
1. P1 is holding one unit of R1 and is requesting for one unit of R2.
2. P2 is holding two units of R2 and is requesting for one unit each of R1 and R3.
3. P3 is holding one unit of R1 and is requesting for one unit of R2.
4. 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
h) Explain the following process scheduling algorithm a) Priority scheduling b) Shortest job first CO2
scheduling

i) What are various criteria for a good process scheduling algorithm? Explain any two preemptive CO1
scheduling algorithms in brief.

j) What are the conditions for deadlock? Explain deadlock detection and recovery in detail. CO2

UNIT-IV
a) Consider a logical address space of eight pages of 1024 words, each mapped onto a physical CO1
memory of 32 frames then:
i) How many bits are in logical address?
ii) How many bits are in physical address?
b) What are the different techniques to remove fragmentation in case of multiprogramming with fixed CO2
partition and variables partitions?

c) Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order). How would each of the CO3
first fit, best fit and worst fit algorithms place processes of 212K, 417K, 112K and 426K (in order)
? Which algorithms make the most efficient use of memory?

d) What is paging? Describe how logical address is translated to physical address in a paged system. CO4
Further give reasons as to why page sizes are always kept in powers of 2.

e) How many page faults would occur for the following reference string for four page frames using CO5
LRU and FIFO alogorithms?

1,2,3,4,5,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2

f) Consider a demand paged system. Page tables are held in registers. It takes 8 milliseconds to CO2
service a page fault if an empty page is available or the replaced page is not modified and 20
milliseconds if the replaced page is modified. Memory access time is 100 nanoseconds. Assume
that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable
page fault rate for an effective access time of not more than 200 nanoseconds?

g) Write a short note on CO1

i) Dynamic loading and dynamic linking
ii) Overlaps and swapping
iii) Bare machine and resident monitor
h) Differentiate between internal fragmentation and external fragmentation. CO3

i) Discuss various structures of page table. CO4

j) What is segmentation? Explain the basic segmentation method. CO5

UNIT-V
a) Write short note on I/O buffering. CO2

b) Explain the need of system protection with the help of examples. CO3

c) Write short notes on: CO4

i) Sequential file
ii) Indexed file
d) How blocks are allocated in secondary storage management? CO5

e) Discuss the services provided in kernel I/O subsystem. CO1

f) Discuss disk scheduling algorithms with example. CO2

g) Explain the SSTF and SCAN disk scheduling policies. Obtain the total number of head movements CO3
needed to satisfy the following sequence of track requests for each of the two policies: 27, 129,110,
186, 147,41,10,64,120 Assume that the disk head is initially positioned over track 100 and is
moving in the direction of decreasing track number.

h) Explain the following methods: CO4

i) Bit vector
ii) Linked list
iii) Grouping
iv) Counting
i) Write short note on RAID. CO2

j) What do you mean by directory? What are the operations that can be performed on a directory? CO1

SECTION-B
Note: 10 questions from each unit as per 2 marks. Change CO as per questions

Q.2.
UNIT-I
a) CO1
Define operating system. Explain in short.

b) What is spooling? CO1

c) How a system call is handled by system? CO2

d) Define multithreading. CO1

e) What do you mean by kernel? CO1

f) Define multiprogramming system. CO1

g) What are the advantages of monolithic kernel? CO1

h) Discuss the term time sharing. CO2

i) Define micro-kernel. CO1

j) What is thread? CO3

UNIT-II
a) Difference between process and program. CO2

b) Write condition for mutual exclusion. CO1

c) What are the requirements of a solution to the critical section problem? CO2
d) Define the term Race condition. CO2

e) What are the two fundamentals models of interprocess communication models? CO3

f) Define process. CO2

g) Difference between process and threads. CO1

h) What is message passing? CO3

i) Difference between kernel and shell. CO2

j) What is Dinning philosopher’s problem? CO3

UNIT-III
a) What is the need for process control block (PCB)? CO3

b) Give the necessary conditions for deadlock. CO3

c) Define the multilevel feedback queue scheduling CO2

d) Define throughput. CO5

e) List out various CPU scheduling algorithms. CO2

f) Write a short note on multiprocessor scheduling. CO3

g) What is Turnaround time? CO3

h) Explain pre-emptive SJF scheduling algorithm. CO2
i) Difference between pre-emptive and non-preemptive. CO5
j) How deadlock Prevention can be done? CO2

UNIT-IV
a) Explain concept of virtual memory. CO2

b) What are the advantages and disadvantages of paging? CO2

c) What is demand paging? CO2

d) Explain page replacement policy. CO4

e) Explain external fragmentation. CO2

f) How page table is implemented? CO3

g) What are requirements of memory management? CO3

h) Explain compaction. CO2

i) Explain dynamic portioning. CO5

j) What is internal fragmentation? CO2

UNIT-V
a) Write a short note on seek time. CO4

b) Discuss rotational latency. CO4

c) In how many ways a directory is implemented. CO2

d) Difference between file and directory. CO2

e) Write demerits of single level directory. CO3

f) Give characteristics of linked allocation. CO4

g) Define circular buffer. CO5

h) Give the graph for thrashing. CO2

i) Explain memory management and I/O management. CO2

j) Briefly explain security features of WINDOWS7. CO3