Important questions

1. Write the design goals of operating system.

2. What is meant by Computing Environment?

3. What does it mean for a process to be suspended?

4. Discuss the various measures used to select optimal process scheduling algorithm.

5. What is the best solution to external fragmentation problem?

6. Write the difference between internal and external fragmentation.

7. Illustrate the resource allocation graph role in deadlocks.

8. What are types of deadlock?

9. Define the Safe, unsafe, and deadlock state spaces.

10. What are the goals of system protection.

1) Describe the role of operating systems in view of user and system. How it handle
multiprogramming, multitasking and real time system operations? Explain.
2) Explain the system calls like (i) process control, (ii) file manipulation, (iii) device manipulation, (iv
information maintenance, (v) communication and (vi) protection in detail.

(OR)

3)How operating system manages storage of computer system in terms of file system, mass-storage and I/O
systems? Explain in detail.
4)“System calls provide an interface to the services provided by OS”. Justify this statement with examples o
how system calls are used?

1)Write about the following with respectto inter process communication:

Synchronous and asynchronous communication
Automatic and explicit buffering
Send by copy and send by reference
Fixed-sized and variable-sized messages
2)What is multi tread programming? Discuss the efficacy of it and various threading issues in detai

(OR)
 Important questions

3)a) Describe the actions taken by a Kernel to context switch between processes. [7M]
4)b) Consider the set of 6 processes whose arrival time and burst time are given below: [7M]
Process Arrival Time Burst Time
P1 0 4
P2 1 5
P3 2 2
P4 3 1
P5 4 6
P6 5 3
If the CPU scheduling policy is Round Robin with time quantum = 2. Draw a Gantt chart
illustrating the execution of these jobs and calculate the average waiting time and average
turnaround time.

1)Write about swapping and contiguous memory allocation. How variable sized partitions and fixe
size partitions works? Explain with example.
2)Consider Hit Ratio  = 80%,  = 20 ns for TLB search, 100 ns for memory access. Calculat
Effective Access Time (EAT) and the paging hardware with TLB involved in it.

(OR)

3)Explain how paging organizes the physical address space of a process to be non-contiguous with a
example and kind of hardware support extended?
4)For the given reference string, explain the LRU page replacement algorithm and specify the importanc
of counters and stack.
7 0 1 2 0 3 0 4 2 3 03 2 1 2 0 1 7 0 1.

1)Explain the three allocation methods in file system implementation. Illustrate with a proper diagram.
2)Explain and Compare the following disk scheduling algorithms:
FCFS ii) SCAN iii) C-LOOK.

(OR)
3)Explain how the file system is implemented in an operating system.
4)Why is it important to balance file-system I/O among the disks and controllers on a system in a
multitasking environment? Explain.

1)Explain the importance of types of access and access control in providing protection to the system files
 Important questions

(OR)
2)Explain in detail about various threats to system security.