2 Marks Questions

. List any four scheduling criteria:

1. CPU Utilization: Maximize the CPU usage.

2. Throughput: Number of processes completed per unit time.

3. Turnaround Time: Total time taken for a process from submission to completion.

4. Waiting Time: Total time a process spends in the ready queue.

2. Describe any four file attributes:

1. Name: Human-readable identifier of the file.

2. Type: Indicates the file type (e.g., text, binary, executable).

3. Location: Pointer to the file's location on the storage device.

4. Size: Current size of the file in bytes.

3. Define deadlock:

A deadlock occurs when a group of processes is permanently blocked because each process is
waiting for a resource that another process in the group holds.

4. Define real-time OS. List any four applications:

A real-time operating system (RTOS) is an OS designed to process data and execute tasks within a
strict time constraint.

Applications:

1. Embedded systems.

2. Industrial automation.

3. Military and defense systems.

4. Medical devices.

5. List any four file operations:

1. Create: Create a new file.

2. Read: Read data from a file.

3. Write: Write data to a file.

4. Delete: Remove a file.

6. Draw process state diagram:

A process state diagram includes the following states:

1. New → Process is created.

2. Ready → Process is waiting to be assigned CPU.

3. Running → Process is being executed.

4. Waiting → Process is waiting for an I/O or event.

5. Terminated → Process is completed.

7. Define virtual memory paging:

Virtual memory paging divides the process's virtual address space into fixed-size pages that map to
physical memory frames, enabling efficient memory usage and the ability to run processes larger
than physical memory.

4 Marks Questions

1. Explain PCB with diagram.

2. Describe I/O burst and CPU burst cycle with a neat diagram.
3. Differentiate between paging and segmentation (any 4 points).
4. Explain shared memory of IPC with a neat diagram.

Shared memory is one of the most efficient methods for inter-process communication
(IPC). It allows multiple processes to communicate by sharing a portion of the
memory. Once a shared memory region is created, all processes attached to it can
access and modify the data.

Diagram:-

+----------------------+ +---------------------+

| Process A | | Process B |

| (Producer/Consumer) | | (Consumer/Producer) |

+----------------------+ +---------------------+

| |

| |

v v

+---------------------------------------+

| Shared Memory Segment |

| (Data accessible by both processes) |

+---------------------------------------+

5. State the different types of schedulers.

6. State and explain any four scheduling criteria.
7. Explain deadlock. What are the necessary conditions for deadlock?

A deadlock is a situation in an operating system where a set of processes is permanently

blocked because each process is waiting for a resource that another process in the set holds.
In this state, no process can proceed, and the system halts.

1. Mutual Exclusion:

o At least one resource must be held in a non-shareable mode (only one process can
use it at a time).

o Example: A printer that can be used by only one process at a time.

2. Hold and Wait:

o A process holding at least one resource is waiting to acquire additional resources

held by other processes.

o Example: Process A holds a printer and waits for a scanner held by Process B.

3. No Preemption:

o Resources cannot be forcibly taken from a process; they must be released voluntarily
by the process holding them.

o Example: A process holding a file lock must release it before another process can use
the file.

4. Circular Wait:

o A set of processes forms a circular chain, where each process waits for a resource
held by the next process in the chain.

o Example: Process A waits for Process B, Process B waits for Process C, and Process C
waits for Process A.

8. Describe various activities performed by the following OS components:

a. Main memory management

The operating system performs the following activities in managing main memory:

1. Memory Allocation and Deallocation: Allocates memory to processes when they start and
deallocates it when they finish.

2. Memory Protection: Prevents processes from accessing the memory of other processes.

3. Swapping: Moves inactive processes to secondary storage to free up main memory.

4. Virtual Memory Management: Uses techniques like paging and segmentation to manage
processes larger than physical memory.

b. File management
 The operating system performs the following activities in managing files:

1. File Creation and Deletion: Allows users and processes to create and delete files.

2. Directory Management: Organizes files into directories for easy access.

3. Access Control: Manages permissions to secure files from unauthorized access.

4. File Storage Allocation: Allocates space on storage devices and retrieves files efficiently

6 Marks Questions

1. List free space management techniques in detail.

2. With a neat diagram, explain multilevel queue scheduling.