BIT Operating System

What is an operating system? Differentiate between time sharing and real time operating system.

What are the different types of operating system? Differentiate between Real time and Batch OS.

What is kernel? Differentiate between monolithic and microkernel structure.

What is kernel? Explain the process of system call with suitable diagram.

What is system call? Explain the system call process in detail.

What is critical section? What are the operations that can be performed on the semaphore? Explain the solution to producer consumer problem using semaphore.

Draw and describe the 5-state process model.

What is deadlock? What ate necessary conditions for deadlock? Explain.

What is thread? Explain user level thread and kernel level thread.

Consider the following set of processes, with the length of CPU brust time given in milli seconds.

The processed are assumed to have arrived in the order A, B, C and D all at time 0. What is the turnaround time and waiting time for the scheduling algorithms, RR (quantum = 3) and Priority Algorithm.

What is Resource Allocation Graph (RAG)? What are the necessary conditions for deadlock? Explain. Determine if the system is safe from deadlock or not using Banker's Algorithm for given condition.

[Note: Consider process sequence as: P1, P2, P3, P4, P5]

What is an OS? Explain 3-state model of process with neat and clean diagram.

What is race condition? Explain critical problem solution using lock variable.

How threads differ from processes? Explain user level thread and kernel level thread.

Find Average waiting time and turn-around time for following example using FIFO, SRTF and Round Robin scheduling algorithm. Assume quantum as 4 ms.

What is process? Explain 3 state process models with suitable diagram.

Differentiate between deadlock and starvation? Discuss the process of detecting deadlocks when there are multiple resources of each type.

Differentiate between process and a program. What is PCB?

Write down the Solving technique of the producer consumer problem with Message passing?

Why virtual memory technique is used in the computer system? What is logical address? Explain the process of conversion of logical address to physical address in single level paging scheme.

What are different types of file? Describe the sequential and random access of files.

A 2 GB hard disk has 2 KB block size, calculate the size of bitmap for bitmap based free space management.

What is memory compaction? Explain best fit memory allocation with suitable example.

Consider the following page reference string: 3,2,1,3,4,2,8,9,7,4,2,9,8,3. Calculate the total number of page faults for Optimal and LRU page replacement algorithms using 4 page frame

What is TLB? Explain the importance of TLB in conversion of logical address to physical address.

Consider 500 GB hard drive with 5 KB block size. Calculate the size of file allocation table if entry for each block needs 4 bytes.

Why Optimal Page Replacement is best but not practically feasible page replacement algorithm? Calculate the number of page faults for Optimal, LRU and FIFO replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2 using 3 page frames.

Why virtual memory technique is used in the computer system? What is logical address? Explain the process of conversion of logical address to physical address using TLB.

A 2 GB disk has 4-KB block size, calculate the size of the file allocation table if each entry of the table is 4 bytes.

Write down the basic difference between coalescing and compaction with diagram.

Suppose that a disk has 100 cylinders, numbered 0 to 99. The drive is currently serving a request at cylinder 45. The queue of pending request, in FIFO order is: 88, 72, 13, 74, 48, 9, 22, 50, 35 and 30. What is the total distance (in cylinders) that the disk arm moves to satisfy all pending request for each of the following disk scheduling algorithms?

a) FCFS

b) SCAN

c) SSTF

What is DMA? Explain how it works in brief with suitable diagram.

What is RAID? Explain Level-2 and Level-3 RAID.

Explain the working mechanism of DMA.

Suppose that a disk drive has the cylinder numbered, 0 to 199 is currently serving a request at cylinder 143. The request queue is kept in the FIFO order 25, 17, 119, 197, 194, 15, 182, 115, and 183. What is the total head movement needed to satisfy these request for the following disk scheduling algorithm.

a) FCFS

b) SSTF

What is memory mapped I/O? Explain about device independent I/O software.