5TH SEMESTER (CSE)

OPERATING SYSTEM
SUBJECT CODE :ETCST304

MODULE 1: INTRODUCTION TO OPERATING SYSTEM

2 MARK QUESTIONS

1. What is Operating System? Give the view of OS as Resource Manager.

2. What is system call? Explain the types of system call.
3. Write different operating system services.
4. What is spooling?
5. Explain the structure of operating system.
6. What is kernel? Explain types of kernel.
7. What is Process? Give the difference between a process and a program.
8. Define thread and its type ?
9. What is the OS features required for multiprogramming ?
10. What are the advantage and disadvantage of multiprocessor system?
11. Describe the difference between symmetric and asymmetric multiprocessing?
12. Define starvation and aging?

6 MARK QUESTIONS
1. Explain different types of OS.
2. Explain the Process State transition diagram.
3. Explain OS as resources manager
4. Define operating system and list the basic services provided by operating system.
5. Explain process states and process control block in details
6. Describe the fields in a process control block (PCB).What is switching overhead?
LONG QUESTIONS

1. Five batch jobs A to E arrive at same time. They have estimated running times 10,2,6,8,4
minutes. Their priorities are 3,2,5,4,1 respectively with 5 being highest priority. For each of
the following algorithm determine mean process turnaround time. Ignore process swapping
overhead. Round Robin (q=3), Priority Scheduling, FCFS, SJF.
2. Assume arrival order is: P1, P2, P3, P4, P5 at time 0,1,2,3,4 respectively and a smaller priority
number implies a higher priority. Draw the Gantt charts for preemptive and non-preemptive
priority scheduling. Calculate Average Turnaround Time and Average Waiting Time.
3. What are various criteria for a good process scheduling algorithm? Explain any two
preemptive scheduling algorithms in brief.
4. Explain the following process scheduling algorithm :
a) Priority scheduling
b) Shortest job first scheduling
5. 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 . Draw Gantt charts illustrating
execution of these processes for SJF and round robin (quantum=1)
 a) Calculate waiting time for each process for each scheduling algorithm
B) Calculate average waiting time for each scheduling algorithm
6. 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. Draw Gant charts illustrating
execution of these processes for SJF, non preemptive priority (smaller priority number
implies a higher priority) & round robin(quantum=1) Calculate turnaround time for each
process . Calculate waiting time for each scheduling .

MODULE 2: CONCURRENT PROCESS & MEMORY MANAGEMENT

2 MARK QUESTIONS
1. Define context switching?
2. Describe how the scheduler is responsible for good process mix ?
3. Define Mutual Exclusion?
4. Define current process and its type?
5. Define critical section?
6. Define Race Condition?
7. What are the necessary conditions for deadlock?
8. Differentiate between page and frame ?
9. What is thrashing ?
10. Differentiae between page and frame?
11. What is Virtual Memory? Explain.

6 MARK QUESTIONS
1. Explain process synchronization with Queing diagram?
2. What are the memory allocation methods used?
3. What are the conditions for deadlock? Explain deadlock detection and recovery in detail.
4. What is monitor? Give the implementation of Bounded Buffer Producer Consumer Problem
using monitor.
5. What is Semaphore? Give the implementation of Readers-Writers Problem using
6. Semaphore.
7. What do you mean by Deadlock Avoidance? Explain the use of Banker’s Algorithm for Deadlock
Avoidance with illustration.
8. Explain deadlock prevention in detail.
9. What is deadlock? Explain its model with example. Explain any three methods of dealing with
deadlock.
10. 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.
Write down the safe sequence ?
11. Compare Multiprogramming with Fixed Partition and multiprogramming with Variable Partitions
with diagram.
12. Explain swapping in memory management.
13. Explain the various page replacement strategies ?
LONG QUESTIONS
1. What is Deadlock? List the conditions that lead to deadlock. How Deadlock can
be prevented?
2. What is Deadlock? List the conditions that lead to deadlock. How Deadlock can
3. What is paging? What is Page Table? Explain the conversion of Virtual Address
to Physical Address in Paging with example.
4. Given memory partition of 100K, 500K, 200K, 300K, and 600K in order, how would each of
the First-fit, Best-fit and Worst-fit algorithms place the processes of 212K, 417K, 112K and
426K in order? Which algorithm makes the most efficient use of memory? Show the diagram
of memory status in each case.
5. For the Page Reference String:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0. 1. 7, 0, 1
Calculate the Page Faults applying (i)Optimal(ii)LRU and(iii)FIFO Page replacement algorithm

MODULE 3: IO MANAGEMENT & DISK SCHEDULING

2 MARK QUESTIONS

1. Define seek time?

2. Define rotational latency?
3. What is bad sector?
4. Define formatting ?
5. What is buffering ?
6. What is an interrupt ?
7. Define SPOOLING ?

6 MARK QUESTIONS

1. Direct Memory Access (DMA).

2. What are the use of device driver & controller in OS? Explain.
3. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently
serving a request at cylinder 143, and the previous request was at cylinder 125. The queue
of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.
Starting from the current head position, what is the total distance (in cylinders) that the disk
arm moves to satisfy all the pending requests, for each of the following disk scheduling –
FCFS , SCAN .
4. Define Interrupt ? Explain types of interrupts with example ?
5. Discuss briefly the following issues related to device independent i/o software.
a. Uniform interfacing for device drivers.
b. Buffering.

LONG QUESTIONS

1. Disk requests come in to the disk for cylinders 10, 22, 20, 2, 40, 6 and 38. A seek takes 6
msec per cylinder move. How much seek time is for Closest cylinder next algorithm?
Initially arm is at cylinder 20.Starting track at 100.The queue of pending request is,
55,58,39,18,90,160,150,38,184 – FCFS, SCAN ( elevator), SSTF,C SCAN .
 2. Suppose that a disk drive has 1000 cylinders, numbered 0 to 999. Assume last request
received was at track 345 and the head is moving towards track 0. The queue of pending
requests, in FIFO order, is 123,874,692,475,105,367. Perform following scheduling
algorithm. FIFO , SSTF,SCAN,LOOK,C-SCAN,C-LOOK
3. Explain briefly how operating system is responsible for disk management ?

MODULE 4: FILE SYSTEM & OPERATING SYSTEM PROTECTION AND SECURITY

2 MARK QUESTIONS

1. Differentiate between field and record?

2. What is the difference between file and database?
3. What is file management system?
4. What is relation between pathname & a working directory?
5. Give the functions of following UNIX commands: cat, cp, pwd ?
6. Advantages of LINUX/UNIX operating system over Windows.

6 MARK QUESTIONS

1. Which are the typical information elements of a file directory?

2. Which are the typical operations performed on directory?
3. What are the typical access rights that may be granted or denied to a particular user for a
particular file?
4. Explain linked list allocation using index in details.
5. What is directory? Explain directory operation in details.
6. Differentiate between windows and unix file system

LONG QUESTIONS
11.Give the role of “Kernel” and “Shell” in UNIX.
1. Explain briefly file system architecture & file management function.
2. Explain architectural features of WINDOWS-7.
3. A) Explain process and thread management WINDOWS- 7 in detail.
B) Explain in brief concurrency control supported by WINDOWS -7.