Os Very Short
Os Very Short
1.define process?
A process in an operating system is an instance of a program that is being executed, which includes the
program code and its current activity.
2. why worst fit is better than best fit ?
Best-fit tends to produce more external fragmentation, while worst-fit tends to produce more internal
fragmentation. Additionally, best-fit can be faster if the requests are small and the free blocks are large,
while worst-fit can be faster if the requests are large and the free blocks are small.
3. what might be the contents of PCB?
The Process Control Block (PCB) contains process-related information including the process ID, state,
CPU registers, memory management information, scheduling information, and I/O status.
4. define the process scheduling mechanism of an OS?
The process scheduling mechanism manages the execution order of processes by assigning CPU time
based on scheduling algorithms to optimize performance and resource utilization.
5. What is Semaphore?
A semaphore is a synchronization tool used to manage access to shared resources by multiple
processes, preventing race conditions.
6. What is paging?
Paging is a memory management scheme that eliminates the need for contiguous allocation of
physical memory by dividing memory into fixed-sized pages and mapping them to physical frames.
7. What is bit vector?
A bit vector is a compact array of bits where each bit represents the status (e.g., free or allocated) of a
resource, such as memory blocks or disk sectors.
9. What do you mean by I/O optimization?
I/O optimization refers to enhancing the efficiency of input/output operations to minimize delays and
maximize throughput of data between the computer and external devices.
10. What are the advantage of IPC?
Interprocess communication (IPC) facilitates data sharing and communication between processes,
enabling collaboration and resource sharing in operating systems.
(2018 make up)
1. What are the use of FORK and JOIN system call?
The FORK system call creates a new process by duplicating the existing process, while the JOIN system
call waits for a child process to terminate and collects its exit status.
2. List any two criteria for CPU scheduling?
CPU Utilization: Maximizing CPU usage to ensure efficient processing of tasks.
Throughput: Maximizing the number of processes completed per unit of time.
(2023)
1. What might be the behavior of Round Robin algorithm, if its quantum is too large?
If the quantum is too large, the Round Robin algorithm behaves like a First-Come, First-Served (FCFS)
algorithm, leading to poor response time for shorter tasks.