##ONE MARKS. ** What is context switching? ** Where is the information **What is the value of one process to another.

It involves
=>Context switching is the process about the state of a process, its relocation register, if logical saving the current process state
** What is a shell? of saving and restoring the state of program counter, stack pointer address is 346 and physical and loading the next process state.
=>A shell is a command-line a process or thread so that and other information stored? address is 14346?
interpreter that provides the user execution can be resumed later. =>All this information is stored in =>Relocation register = Physical – **“Priority scheduling suffers
interface to access the services of can be resumed later. the Process Control Block (PCB). Logical from starvation”, True/False?
an operating system. 14346 – 346 = 14000 Justify.
** What is page? ** What is the purpose of Boot- =>True :-In priority scheduling, a
** Define the I/O Bound =>A page is a fixed-size block of strap program? ** List any two thread libraries. low-priority process may never get
process. data used in memory =>A bootstrap program loads the =>-POSIX Pthreads the CPU if higher-priority
=>An I/O-bound process is a management; it represents a unit operating system into memory and -Java Threads processes keep [Link]
process that spends more time of logical memory in a paging starts its execution during system -Windows Thread Library condition is called starvation.
performing input/output operations system. startup.
than using the CPU. ** Define I/O bound process. **What is Mutual Exclusion?
** Define the term dispatcher. ** Which scheduler controls the =>An I/O-bound process is a =>Mutual exclusion ensures that
**Define the term semaphore. =>A dispatcher is the OS module degree of multiprogramming? process that spends more time only one process can access a
=>A semaphore is a that gives control of the CPU to a =>The Long-Term Scheduler (Job performing input/output operations critical section (shared resource) at
synchronization mechanism used selected process by performing Scheduler) controls the degree of (like reading from disk, keyboard, a time, preventing conflicts.
to control access to shared context switching and starting multiprogramming. network) than using the CPU. It
resources in a concurrent system. execution. requires less CPU time and more ** What is race condition?
**What is aging? I/O wait time. =>A race condition occurs when
** What is a thread library? ** What is booting? =>Aging is a technique used to the output of a process depends on
=>A thread library is a collection of =>Booting is the process of starting gradually increase the priority of ** What is the purpose of fork() the timing or sequence of multiple
functions that allows a program to a computer and loading the waiting processes to prevent system call? processes accessing shared data
create, manage, and control operating system into memory. starvation. =>The fork() system call is used to [Link] leads to incorrect
threads. create a new process in results.
** What is System Call? ** What is race condition? UNIX/Linux. The new process
** What is synchronisation? =>A system call is a request made =>A race condition occurs when created is called the child process, **Define Limit register.
=>Synchronization is the by a program to the operating multiple processes access shared and the original one is the parent =>A limit register stores the size of
coordination of processes or system to perform a service such data simultaneously, and the final process. Both run independently a process’s address [Link] works
threads to ensure correct and as I/O operation, file handling, or result depends on the execution after the fork. with a base register to ensure a
orderly access to shared process control. order. process cannot access memory
resources. ** What is Bootstrap Loader? outside its allocated area.
** In Peer-to-Peer computing, ** List any two advantages of =>A bootstrap loader is a small
** What is physical address clients and servers are not microkernels. program stored in ROM that loads ** What is Frame?
space? =>-More reliable and stable the operating system into memory =>A frame is a fixed-size block of
distinguished from one
=>Physical address space refers to -Easier to extend and maintain when a computer is powered on. It physical memory in [Link]
another. State True / False and
the range of memory addresses -Better security is responsible for starting the OS. memory is divided into pages, and
Justify. physical memory into frames.
that correspond to actual physical =>True :-In P2P computing, every
RAM in the computer. ** Define context switch.
node acts as both client and
=>A context switch occurs when
server, so they not distinguished.
the CPU switches from executing
** List the advantages of open- **What is segmentation? State small scattered holes, preventing -Address Translation (logical to Dependent Process:-
source operating system. any two advantages of allocation even though total free physical). -A process that shares
=>-Free or low cost segmentation. memory is enough. -Protection to prevent illegal data/resources or communicates
-Source code available for =>Segmentation: access. with other processes.
modification -Segmentation is a memory **Write advantages of -Memory Sharing among -Its execution depends on other
-High security (bugs fixed management technique where the distributed operating systems. processes. processes, making synchronization
quickly) program is divided into variable- =>Advantages: -Fragmentation Management necessary.
-Community support sized segments, such as code, -Resource Sharing: Users can (handling internal/external
-Flexibility and customization data, stack, etc. share hardware, software, and data fragmentation). **What is critical section
-No vendor lock-in -Each segment has its own base across multiple machines. problem?
and limit. -High Reliability: Failure of one **List the types of schedulers =>-The critical section problem
##TWO MARKS Advantages: machine does not bring the system and explain short-term refers to designing a way for
-Supports logical division of down (fault tolerance). scheduler in detail. processes to safely access shared
**What is dynamic linking and programs (easier organization). -Improved Performance: Workload =>Types of Schedulers:- resources.
dynamic loading in operating -Allows protection and sharing of can be distributed across multiple -Long-Term Scheduler (Job -Only one process at a time should
system? individual segments. systems. Scheduler) enter the critical section to prevent
=>Dynamic Loading: -Scalability: Easy to add more -Short-Term Scheduler (CPU race conditions, ensuring data
-Dynamic loading means a **Differentiate between FCFS machines to increase processing Scheduler) consistency.
routine (function/module) is loaded and Priority CPU scheduling power. -Medium-Term Scheduler -It must satisfy: Mutual exclusion,
into memory only when it is actually algorithm. (Swapper) Progress, and Bounded waiting.
called during program execution. =>FCFS:- **Compare preemptive and -Short-Term Scheduler (CPU
-This saves memory because -First process to arrive gets CPU non-preemptive scheduling. Scheduler) – **What is the role of
unused routines are never loaded. first. =>Preemptive Scheduling:- Explanation:- dispatcher?
Dynamic Linking: -Simple and non-preemptive. -CPU can be taken away from a -It selects one process from the =>A dispatcher is a module of the
-Dynamic linking means the -May cause convoy effect. running process. ready queue and allocates the operating system that gives control
linking of program modules is done Priority Scheduling:- -Better response time for important CPU to it. of the CPU to a process selected
at run time rather than at compile -CPU given to process with highest tasks. -It makes frequent decisions by the short-term scheduler.
time. priority. -Used in real-time and multitasking (milliseconds). Its roles include:-
-Shared libraries (e.g., .dll, .so) -Can be preemptive or non- systems. -It is responsible for -Performing context switch
are linked when needed, reducing preemptive Non-Preemptive Scheduling:- implementing CPU scheduling -Switching to user mode
memory usage and allowing -May cause starvation of low- -CPU cannot be taken away; algorithms such as FCFS, Round -Jumping to the program’s starting
updates without recompiling. priority processes. process runs until completion or Robin, Priority, etc. instruction
waiting. -It helps start execution of the
**State a system call used for **What is Internal -Simpler to implement. **Define independent and chosen process.
process creation and process Fragmentation and External -May cause long waiting times. dependent processes.
termination. Fragmentation? =>Independent Process:-
=>Process creation: fork() =>Internal Fragmentation :-Occurs ** List out functions of memory -A process that does not share
(UNIX/Linux) or CreateProcess() when allocated memory block is management. data or resources with any other
(Windows) larger than needed, leaving unused =>Functions:- process.
Process termination: exit() space inside the allocated block. -Memory Allocation & Deallocation -Its execution does not affect and is
(UNIX/Linux) or External Fragmentation :-Occurs to processes. not affected by other processes.
TerminateProcess() (Windows) when free memory is divided into
**Write the benefits of virtual consists of the program code, data, wasted. pick the right fork → deadlock. .Selects one process using a
memory. stack, registers and PCB (Process 2)External Fragmentation. CPU scheduling algorithm, such
=>Benefits:- Control Block). It is an active entity -Occurs when free memory is 3) Starvation:- as:
-Allows execution of larger compared to a passive program. divided into small scattered holes, -Some philosophers may never get .FCFS
programs than physical memory. Explaination:- even though total free memory is a chance to eat. .SJF
-Provides isolation between -New:- The process is being enough. .Round Robin
processes, improving security. created. Resources are being -Process cannot be allocated 4) Solution Using Semaphores:- .Priority
-Increases multiprogramming level. allocated. because memory is not contiguous. -Use a semaphore for each fork .Performs a context switch with
-Reduces need for extra physical -Ready:- The process is loaded 3)Compaction (Solution, not a type (initialized to 1). the help of the dispatcher.
RAM. into memory and waiting for CPU but often asked). .Allocates the CPU to the
allocation. -To reduce external **Which are the different types selected process.
**Explain any two advantages -Running:- The process is fragmentation, OS compacts of schedulers? Explain the .Runs the process until:
of multithreading. executing on the CPU. memory to create a large working of short-term .It finishes, OR
=>-Increased responsiveness: One -Waiting / Blocked:- The process contiguous free block. scheduler. .It gets blocked (I/O), OR
thread can run even if another is cannot continue until some event =>Types of Schedulers:- .Preempted by another
blocked. occurs (I/O completion, resource **What is semaphore? Explain 1)Long-Term Scheduler (Job process.
-Resource sharing: Threads share release). the Dining Philosopher’s Scheduler).
code and data, reducing memory -Terminated / Exit:- The process Problem. -Decides which jobs enter the **Write a short note on MMU
usage. has finished execution and its =>Semaphore:- A semaphore is a ready queue. (Memory Management Unit).
-Faster execution: Tasks can run in resources are released. synchronization mechanism used -Controls the degree of =>A Memory Management Unit
parallel on multiple CPUs. -Ready Suspended / Blocked to control access to shared multiprogramming. (MMU) is a hardware component
-Better system utilization: Improves Suspended:- Process is moved to resources in a concurrent system 2)Short-Term Scheduler (CPU responsible for handling all
throughput and performance. secondary storage due to memory (like processes or threads) .It is an Scheduler). memory accesses made by CPU.
shortage. integer variable that supports only -Selects a process from the Function:-
**Write the system calls under two atomic operations: ready queue and assigns the CPU 1)Address Translation:- Translates
the category of process **What is fragmentation? Dining Philosopher’s Problem:- to it. logical (virtual) addresses
management. Explain the types of This is a classic synchronization -Makes decisions very frequently generated by the CPU into physical
=>Common process management fragmentation. problem introduced by Dijkstra. (milliseconds). addresses in RAM.
system calls include:- =>Fragmentation (Definition):- 3)Medium-Term Scheduler 2)Memory Protection:- Ensures a
-fork() → create a new process Fragmentation is a memory 1) Problem Description:- (Swapping Scheduler). process cannot access memory
-exec() → replace process memory management problem where total -Five philosophers sit around a -Temporarily removes processes outside its allocated area. Uses
with a new program free memory exists but is not circular table. from memory (swapping out) to base and limit registers or page
-exit() → terminate a process usable efficiently due to being -Each philosopher alternates reduce load. tables for protection.
-wait() → wait for a child process broken into small pieces. between thinking and eating. -Brings them back later 3)Support for
-getpid() → get process ID Types of Fragmentation:- -There are five forks, one between 4)Short-Term Scheduler. Paging/Segmentation:- Implements
1)Internal Fragmentation. each pair of philosophers. –Working:-The short-term modern memory management
##FOUR MARKS -Occurs when allocated memory -To eat, a philosopher must pick up scheduler is responsible for techniques like paging,
block is larger than requested. two forks (left and right). selecting the next process to run segmentation, and virtual memory.
**What is process? Explain -Extra unused space inside the from the ready queue. 4)Efficient Memory Utilization:-
different types of process states. allocated block is wasted. 2) Deadlock:- -Working Steps: Helps the OS share memory safely
=>Process (Definition):- A process -Example: Process needs 18 KB, -If all philosophers pick their left .Looks at the ready queue of among processes and avoids
is a program in execution. It but partition size is 20 KB → 2 KB fork at the same time, none can processes waiting for CPU. conflicts.
**Explain Layered Structure of support different models for the critical section at any given identification number assigned to thus bounded.
Operating System. efficiency and flexibility. time. each process. 3)Producers must wait if the buffer
=>The Layered Structure is an OS 1) Many-to-One Model. -This prevents race conditions -Process State:- Current state of is full.
design approach where the system -Multiple user-level threads are and ensures the shared resource is the process — New, Ready, 4)Consumers must wait if the
is divided into layers, each built on mapped to one kernel thread. accessed safely. Running, Waiting, Terminated. buffer is empty.
top of the lower one. -Thread management is done in -Example: If process P1 is in the -Program Counter (PC):- Holds the 5)Synchronization Requirements:-
Features of Layered Structure:- user space, so it is fast. critical section, P2 must be address of the next instruction to Mutual Exclusion: Only one
-Each layer is built using the -Disadvantage: If one thread prevented from entering it. be executed. process (producer or consumer)
functions and services of the lower performs a blocking system call, 2) Progress. -CPU Registers:- Contains register should access the buffer at a time.
layer. whole process blocks. -If no process is in the critical values (ACC, index registers, stack Otherwise, race conditions occur.
-The bottom layer is hardware, -No true parallelism (only one section, and several processes pointers, etc.) saved during context 6)Avoid Buffer Overflow:- Producer
and the top layer is the user kernel thread). want to enter it, the selection of the switching. should not add items when the
interface (UI or system calls). next process cannot be postponed -Memory Management buffer is full.
-Layers communicate only with 2) One-to-One Model. indefinitely. Information:- Includes base and 7)Avoid Buffer Underflow:-
adjacent layers, improving -Each user thread maps to a -Only those processes not in the limit registers, page tables, Consumer should not remove
modularity. separate kernel thread. remainder section should segment tables — used for items when the buffer is empty.
Typical Layers:- -Allows true parallel execution participate in decision making. addressing and protection.
-Layer 0 – Hardware:- Physical on multiprocessor systems. -This ensures a process is -Accounting / Scheduling **Differentiate between Client–
devices like CPU, memory, I/O. -Advantage: If one thread chosen fairly and in finite time. Information:- Contains CPU time Server and Peer-to-Peer (P2P)
-Layer 1 – Device Drivers:- blocks, others can continue. used, process priority, scheduling Computing Environments
Controls and manages hardware -Disadvantage: Creating too 3) Bounded Waiting. queue pointers, time limits, etc. =>Client–Server Computing:-
devices. many threads increases overhead. -Once a process requests entry -I/O Status Information:- List of I/O -A central server provides services
-Layer 2 – Memory Management:- into the critical section, there must devices allocated to the process, to multiple clients.
Handles allocation, paging, 3) Many-to-Many Model. be a limit on the number of other open files, pending I/O requests. -Server is more powerful; clients
segmentation, MMU functions. -Many user threads map to a processes allowed to enter before -Process Privileges & Flags:- depend on it.
-Layer 3 – Process Management:- smaller or equal number of kernel it. Information required for protection -Centralized control and
CPU scheduling, context switching, threads. -Guarantees that every process and access rights. management.
synchronization. -Combines benefits of both gets a turn eventually. -Failure of server affects the whole
-Layer 4 – File System:- Manages previous models. -Prevents starvation (infinite **Explain Bounded Buffer system.
files, directories, and storage. -Allows the OS to create the waiting). Problem in detail. -Examples: Web servers, email
-Layer 5 – System Call Interface:- optimal number of kernel threads. =>The Bounded Buffer Problem servers, database servers.
Provides API for user programs. **Describe PCB with all its (also called Producer–Consumer Peer-to-Peer (P2P) Computing:-
-Layer 6 – User Interface / **Which three requirements fields. Problem) is a classic -No central server; all nodes act as
Applications:- Shell, GUI, user must be satisfied while =>A Process Control Block (PCB) synchronization problem. both clients and servers.
programs. designing a solution to the is a data structure used by the 1)Problem Description:- There is a -All peers have equal capability
critical section problem? operating system to store all fixed-size buffer shared between and share resources directly.
**Explain Multithreading Explain in detail. information about a process. The two processes: -Decentralized system; no single
Models in detail. =>A correct solution to the critical OS uses the PCB to manage -Producer: generates data and point of contro.
=>A multithreading model section problem must satisfy three processes during creation, puts it into the buffer. -Failure of one peer does not affect
describes how user-level threads essential requirements: execution, and termination. -Consumer: removes data entire network.
are mapped to kernel-level 1) Mutual Exclusion. Fields of a PCB:- from the buffer and uses it. -Examples: Torrent networks,
threads. Operating systems -Only one process can be inside -Process ID (PID):- Unique 2)Buffer has limited capacity → blockchain systems.
**Describe Segmentation in CPU. secure because data travels across 3) Semaphore Solution Scheduling should minimize
detail. 3) Running:- The process is multiple systems. (Conceptual Explanation). waiting time.
=>Segmentation is a memory currently being executed on the -Network Dependency:- The entire Use three semaphores:
management technique where a CPU. system depends heavily on mutex 5) Response Time.
program is divided into variable- 4) Waiting / Blocked:- The process network quality. If the network fails, Ensures only one process Time taken to produce first
sized logical segments. cannot continue until some event system performance drops. accesses the buffer at a time. response/output after submitting
Key Points of Segmentation:- occurs, like I/O completion or -Software Compatibility Problems:- Initial value = 1 the process.
1) Logical View of Memory. resource availability. Some applications may not work empty Important for interactive systems.
Programs are divided based on 5) Terminated / Exit:- The process smoothly in a distributed Counts empty slots in the buffer.
logical structure, not fixed size. has finished execution and all environment. Initial value = N (buffer size) 6) Fairness.
Example: allocated resources are released. full Every process should get a fair
Segment 0 → Code **Explain bounded buffer Counts filled slots in the buffer. chance of CPU time.
Segment 1 → Data ** What is distributed operating problem of synchronization in Initial value = 0. Avoids starvation.
Segment 2 → Stack system? States its advantages detail.
and disadvantages. =>The Bounded Buffer Problem is **Explain different CPU ** Which three requirements must
2) Address Translation. =>Distributed Operating System also called the Producer– scheduling criteria that be satisfied while designing a
A logical address consists of: (Definition):- A Distributed Consumer Problem. It deals with scheduling algorithms must solution to the critical section
Segment number Operating System (DOS) is an synchronization between two types have. problem? Explain in brief.
Offset within the segment operating system that runs on a of processes sharing a finite-size =>CPU scheduling algorithms are =>A correct critical section solution
Physical address = base of collection of independent buffer. evaluated using the following must satisfy three requirements:
segment + offset computers connected through a 1) Problem Description. criteria: 1) Mutual Exclusion.
network but appears to the user as A fixed-size buffer is shared by: 1) CPU Utilization. Only one process can enter the
3) Benefits. a single unified system. Producer → produces items and CPU should be kept as busy as critical section at a time.
No internal fragmentation (variable Advantages of Distributed places them into the buffer. possible. Prevents race conditions and data
size). Operating System:- Consumer → removes items from Good scheduling tries to maximize corruption.
Supports sharing of segments -Resource Sharing:- Users can the buffer. CPU usage. 2) Progress.
(e.g., shared libraries). access hardware and software The buffer has N slots. If no one is in the critical section,
Provides memory protection since resources across different Only the producer adds items, and 2) Throughput. the system must allow a process to
each segment has its own limit. machines. only the consumer removes them. Number of processes completed enter without unnecessary delay.
Easier program organization. -High Reliability / Fault Tolerance:- per unit time. Decision of who enters next must
Failure of one machine does not 2) Issues in Synchronization. Higher throughput → better be fair.
**Define process? Explain stop the whole system; tasks can a) Buffer Overflow:- Occurs when performance. 3) Bounded Waiting.
process state diagram be shifted to other machines. the producer tries to add an item A process requesting to enter the
=>A process is a program in -Improved Performance:- Workload when the buffer is full. 3) Turnaround Time. critical section should not wait
execution. It contains the program can be distributed, increasing b) Buffer Underflow:- Occurs when Total time taken from process indefinitely.
code, current activity, register system throughput. the consumer tries to remove an submission to completion. There must be a limit on how many
values, program counter, memory, Disadvantages of Distributed item when the buffer is empty. Includes waiting time + CPU time + other processes can enter before it.
and resources. Operating System:- c) Mutual Exclusion:- Producer and I/O time.
1) New:- The process is being -Complexity:- Designing and consumer must not access the
created by the operating system. managing a distributed OS is more buffer at the same time, otherwise 4) Waiting Time.
2) Ready:- The process is loaded complicated than a single system. data inconsistency (rcondition) Total time a process spends in the
into main memory and is waiting for -Security Issues:- More difficult to occurs. ready queue.
**List types of Semaphore. **Define system booting. another during context switching. It communicate more efficiently than **Consider reference string 1,
=>-Binary Semaphore: Also known =>System booting is the process of loads the context of the next separate processes. 3, 3, 2, 5, 4, 5, 4, 1, 4, 2, 2, 5 and
as a mutex, it can have only two starting a computer and loading the process to be executed and number of frames are three,
values, 0 or 1. It is used for mutual operating system into memory. manages the execution of the **List advantages of pre- Calculate total number of page
exclusion. This process involves the process. emptive and non-preemptive faults using optimal page
-Counting Semaphore: Can have execution of a series of steps, scheduling algorithms. replacement Algorithm.
an unrestricted range of values. It including the POST (Power-On **Define CPU bound process. =>a] Pre-emptive Scheduling: =>Optimal Page Replacement
is used to manage access to a Self-Test), loading the bootstrap =>A CPU bound process is a type -Fairness: Ensures that all Algorithm:
resource pool with multiple loader, and initializing the of process that spends most of its processes get a share of the CPU 1] Initial state: [, , ] (all frames
instances. operating system. time performing computations time, preventing any single process empty)
rather than I/O operations. Such from monopolizing the CPU. 2] Reference string: 1 (page fault,
**Define segmentation. **What do you mean by thread? processes typically have long CPU -Responsiveness: Improves load 1)
=>Segmentation is a memory =>A thread is the smallest unit of bursts and short I/O waits. system responsiveness by allowing 3] Reference string: 3 (page fault,
management technique where the processing that can be scheduled high-priority tasks to interrupt and load 3)
memory is divided into variable- by an operating system. It is a **Define Virtual Memory. execute before lower-priority tasks. 4] Reference string: 3 (hit, no page
sized segments. Each segment lightweight process that shares =>Virtual memory is a memory b] Non-preemptive Scheduling: fault)
can represent a logical unit of the resources such as memory and file management technique that -Simplicity: Easier to implement as 5] Reference string: 2 (page fault,
program, such as a function, handles with other threads within creates an abstraction of a large, it does not require mechanisms for load 2)
object, or data structure. This the same process. contiguous address space for saving and restoring process 6] Reference string: 5 (page fault,
allows for easier management and programs, even if the physical states. replace 1 with 5)
protection of memory. **List the purpose of memory is limited. It uses disk -Predictability: Provides more 7] Reference string: 4 (page fault,
synchronization. storage to extend the available predictable execution as processes replace 3 with 4)
**Which scheduler controls the =>-Mutual Exclusion: Ensures that memory, allowing programs to run run to completion without 8] Reference string: 5 (hit, no page
degree of multiprogramming? only one process or thread as if they have more memory than interruptions. fault)
=>The long-term scheduler, also accesses the critical section at a is physically present. 9] Reference string: 4 (hit, no page
known as the job scheduler, time. **Define operating system. fault)
controls the degree of -Orderly Execution: Enforces a **List the benefits of thread. Write any two tasks of O.S. 10] Reference string: 1 (page fault,
multiprogramming by determining specific order of execution for =>-Improved Performance: =>An operating system (OS) is a replace 2 with 1)
which jobs or processes are processes or threads. Threads enable parallel execution, software that acts as an 11] Reference string: 4 (hit, no
admitted to the system for -Data Consistency: Prevents data which can significantly improve intermediary between computer page fault)
processing. inconsistency and race conditions performance on multi-core hardware and the user. It manages 12] Reference string: 2 (page fault,
by controlling access to shared processors. hardware resources and provides replace 5 with 2)
**What do you mean by system resources. -Resource Sharing: Threads within services for application software. 13] Reference string: 2 (hit, no
call? -Deadlock Prevention: Helps in the same process can share Tasks of OS: page fault)
=>A system call is a programmed avoiding deadlocks by managing resources such as memory and file -Process Management: Manages 14] Reference string: 5 (page fault,
request to the operating system process dependencies. handles, reducing overhead. the creation, scheduling, and replace 4 with 5)
that allows a program to request a -Responsiveness: Multi-threading termination of processes. Total number of page faults = 8
service, such as input/output **Define the term Dispatcher. allows applications to remain -Memory Management: Handles
operations, process creation, or =>The dispatcher is a component responsive by performing allocation and deallocation of
memory allocation. It serves as the of the operating system background tasks. memory space to processes and
interface between user programs responsible for switching the CPU's -Efficient Communication: Threads ensures efficient memory usage.
and the operating system. control from one process to within the same process can
**A counting semaphore S is -The problem is to ensure that - Priority: Processes in higher- low-priority process from the main **Explain different types of
initialized 10. Then 6 P when one process is executing in priority queues are executed memory and transfers it to services provided by an
operations and 4 V operations its critical section, no other process before those in lower priority secondary storage. This process is operating system.
are performed on S. What is the is allowed to execute in its critical queues. known as swapping out. =>Operating systems provide a
final value of S? section. - Fixed Allocation: A fixed portion of - Swap In: When a swapped-out wide range of services to ensure
=>- Initial value of semaphore Peterson's Solution:- CPU time is allocated to each process is ready to execute again, smooth operation and efficient
S=10S = 10 - Peterson's algorithm is a queue. the operating system transfers it resource management for both
- After 6 P (decrement) operations, software-based solution for Example:- back from secondary storage to the users and applications. These
S=10−6=4S = 10 - 6 = 4 achieving mutual exclusion. It uses - Foreground Queue (Interactive): main memory. This process is services can be broadly
- After 4 V (increment) operations, two shared variables: Scheduled using Round Robin. known as swapping in. categorized into several types:
S=4+4=8S = 4 + 4 = 8 - flag[i]: Indicates if process i wants - Background Queue (Batch): 2] Advantages of Swapping: 1] Process Management:
- Final value of S = 8 to enter the critical section. Scheduled using First-Come, First- - Increased Multitasking: Swapping -Process Creation and
- turn: Indicates whose turn it is to Served (FCFS). allows more processes to be in a Termination: The OS handles the
**What is process? Explain the enter the critical section. In multilevel queue scheduling, the ready state, increasing the creation, scheduling, and
different types of process Algorithm: scheduler selects a process from system's ability to handle multiple termination of processes.
states. flag[i] = true; the highest-priority queue, and only tasks concurrently. - Process Scheduling: Manages
=>A process is an instance of a turn = j; if that queue is empty does it - Efficient Memory Utilization: By the order in which processes are
program in execution. It includes while (flag[j] && turn == j) { consider processes from the next dynamically managing memory executed by the CPU.
the program code, current activity // busy wait highest priority queue, and so on. allocation, swapping helps optimize - Inter-Process Communication:
represented by the program } the use of available memory, Facilitates communication and
counter, and process stack // critical section **Define swapping. Write reducing idle times. synchronization between
containing temporary data. flag[i] = false; advantages & disadvantages of - Improved CPU Utilization: processes.
Types of Process States: // remainder section swapping. Swapping ensures that the CPU is 2] Memory Management:
-New: The process is being =>Swapping is a memory not idle by maintaining a pool of -Memory Allocation: Allocates and
created. **Explain multilevel queue management technique used to ready-to-execute processes, thus deallocates memory to processes
-Running: Instructions are being scheduling Algorithm. manage processes in a maximizing CPU usage. as needed.
executed. =>Multilevel queue scheduling is a multitasking operating system. In 3] Disadvantages of Swapping: - Virtual Memory: Provides an
-Waiting: The process is waiting for CPU scheduling algorithm that this technique, processes are - Disk I/O Overhead: Swapping abstraction of physical memory to
some event to occur. separates processes into multiple temporarily transferred involves frequent disk read/write enable processes to use more
-Ready: The process is waiting to queues based on their from the main memory (RAM) to operations, which can introduce memory than physically available.
be assigned to a processor. characteristics, such as process secondary storage (disk) and significant overhead and slow - Paging and Segmentation:
-Terminated: The process has priority, type of process (interactive brought back to main memory down system performance. Implements memory management
finished execution. vs. batch), or memory size. Each when required. This allows the - Latency: The time taken to swap techniques to optimize memory
queue has its own scheduling system to manage more processes processes in and out of memory usage and provide protection.
algorithm, and processes do not than can fit into the main memory can lead to latency, affecting the 3] File System Management:
**What is critical section
move between queues. simultaneously, thus optimizing the system's responsiveness. -File Operations: Provides services
problem? Give Peterson's
Key Features:- use of the CPU and memory. - Complexity: Implementing and for creating, deleting, reading,
solution to solve critical
- Multiple Queues: Each queue 1] Swapping Process: managing swapping requires writing, and modifying files.
section problem.
may have its own scheduling policy -Swap Out: When the main additional complexity in the - Directory Management: Manages
=>Critical Section Problem:-
(e.g., Round Robin for one, FCFS memory is full and a new process operating system, including directories and the hierarchical
-The critical section is a part of the
for another). needs to be loaded, the operating maintaining swap space and organization of files.
program where shared resources
system selects an inactive or handling context switching.
are accessed.
4] Device Management: **Compare MFT and MVT of
-Device Drivers: Provides memory partition.
interfaces to interact with hardware =>MFT:-
devices such as printers, disks, -MFT (Multiprogramming with
and network interfaces. Fixed Tasks).
- I/O Operations: Manages input -Memory is divided into fixed-size
and output operations between partitions at system startup.
processes and devices. -Fixed and predefined.
- Buffering and Caching: -Less flexible — processes must fit
Implements buffering and caching in fixed partitions.
to improve I/O performance. -Poor (high internal fragmentation).
5] Security and Protection: -Internal fragmentation (unused
- User Authentication: Enforces space within a partition).
user authentication mechanisms to -Suitable for systems where
ensure secure access to the process size is known and
system. constant.
-Access Control: Implements -Less overhead; simple to
access control policies to protect implement.
system resources and user data. MVT:-
- Encryption: Provides services for -MVT (Multiprogramming with
data encryption and decryption to Variable Tasks).
ensure data confidentiality. -Memory is divided into variable-
6] Networking Services: size partitions based on process
- Protocol Implementation: needs.
Supports network protocols such -Dynamic; created at runtime.
as TCP/IP to enable -More flexible — partitions sized
communication over networks. exactly for processes.
- Network File Systems: Provides -Better (less internal, but causes
access to remote file systems over external fragmentation).
the network. -External fragmentation (small free
- Network Security: Implements gaps between partitions).
security measures to protect data -Suitable for environments with
transmitted over networks. processes of varying sizes.
-More overhead; OS must manage
dynamic allocation.