OS Concepts Overview

01) List out the various operating system components

02) Write the differences of batch systems and time sharing systems
03) What is the purpose of system programs?
04) List out the layers in operating systems
05) Distinguish between CPU bounded, I/O bounded processes
06) Name and draw five different process states with proper definition
07) Point out the functions of Dispatcher Module
08) List out the methods used to recover from the deadlock.
09) Name any two differences between logical and physical addresses.
10) What is meant by address binding? Mention the different types

Gimme answers in just 2 points

1. Operating System Components:

Kernel: Core part of the OS responsible for managing hardware and resources.
User Interface: Interface through which users interact with the system (e.g., command-line
or graphical user interface).
2. Batch Systems vs Time Sharing Systems:
Batch Systems: Processes are executed in batches with no user interaction.
Time Sharing Systems: Multiple users share the system resources simultaneously with
interactive sessions.
3. Purpose of System Programs:
Provide Utility: System programs offer basic functions like file management, program
execution, and system monitoring.
Interface between User and OS: They facilitate user interaction with the operating system.
4. Layers in Operating Systems:
Hardware Layer: The physical components of the system.
Kernel Layer: Manages resources and communication between hardware and software.
5. CPU Bound vs I/O Bound Processes:
CPU Bound: Processes that primarily require CPU time for computations.
I/O Bound: Processes that are mainly waiting for I/O operations (like disk reads).
6. Five Process States:
New: Process is being created.
Ready: Process is waiting for CPU time.
Running: Process is currently executing on the CPU.
Waiting: Process is waiting for an event (e.g., I/O).
Terminated: Process has finished execution.
7. Functions of Dispatcher Module:
Context Switching: Saves and restores the state of processes.
Process Scheduling: Assigns the CPU to a process based on scheduling algorithms.
8. Methods to Recover from Deadlock:
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 1/3
 Process Termination: Killing one or more processes involved in the deadlock.
Resource Preemption: Taking resources from one process and giving them to another.
9. Logical vs Physical Addresses:
Logical Address: Address generated by the CPU during a program's execution.
Physical Address: Actual address in the memory hardware.
10. Address Binding:

Definition: The process of mapping logical addresses to physical addresses.

Types: Compile-time binding, Load-time binding, and Run-time binding.

01) Give the objectives of an operating system

02) What is system boot in operating system?
03) Give the types of system calls in operating system.
04) What are the services of an operating system?
05) Define the term process.
06) Give the use of resource-allocation graph.
07) Define deadlock.
08) List the CPU scheduling algorithms
09) How does the swapping process occur?
10) Write about contiguous memory allocation

1. Objectives of an Operating System:

Resource Management: Efficiently manage hardware resources like CPU, memory, and I/O
devices.
User Interaction: Provide a user interface and ensure smooth interaction with the system.
2. System Boot in Operating System:
Booting is the process of starting a computer and loading the operating system into memory.
It involves hardware initialization and loading system files from storage to RAM.
3. Types of System Calls in Operating System:
Process Control: Managing processes (e.g., create, terminate).
File Management: Operations on files (e.g., open, read, write).
Device Management: Interacting with hardware devices (e.g., I/O operations).
Communication: Managing inter-process communication (e.g., message passing).
4. Services of an Operating System:
Process Management: Handles the creation, scheduling, and termination of processes.
Memory Management: Allocates and deallocates memory to processes efficiently.
5. Definition of Process:
A process is a program in execution, including its code, data, and the current state of
execution.
6. Use of Resource-Allocation Graph:
A resource-allocation graph (RAG) is used to visually represent the allocation of resources to
processes and can help detect potential deadlocks.
7. Deadlock Definition:
A deadlock occurs when two or more processes are unable to proceed because each is
waiting for resources held by the other(s).
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 2/3
 8. CPU Scheduling Algorithms:
First-Come-First-Served (FCFS): Processes are executed in the order they arrive.
Shortest Job Next (SJN): Process with the shortest burst time is selected first.
Round Robin (RR): Each process gets a fixed time slice, rotating in circular order.
Priority Scheduling: Processes are scheduled based on priority.
Multilevel Queue Scheduling: Processes are divided into multiple queues based on priority.
9. Swapping Process:
Swapping occurs when a process is moved from RAM to disk (swapping out) and back to RAM
(swapping in) to free up memory for other processes.
10. Contiguous Memory Allocation:

Contiguous Memory Allocation assigns a single contiguous block of memory to a process,

ensuring the process's memory is located in a single unbroken section of physical memory.

Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 3/3