Scribd
Upload
5 views1 page

OS 8 Questions Answers

The document outlines eight important questions and answers related to operating systems. Key topics include the definition of a computer and its components, types of processing systems, CPU scheduling algorithms, process synchronization, deadlock detection, and shell programming. Each section provides concise explanations and examples relevant to the concepts discussed.

Uploaded by

madhevrmadhev55
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

OS 8 Questions Answers

The document outlines eight important questions and answers related to operating systems. Key topics include the definition of a computer and its components, types of processing systems, CPU scheduling algorithms, process synchronization, deadlock detection, and shell programming. Each section provides concise explanations and examples relevant to the concepts discussed.

Uploaded by

madhevrmadhev55
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Operating System - 8 Important Questions with Answers

1. Define Computer? Explain Computer System Components


A computer is an electronic device that accepts data as input, processes it according to instructions,
stores it, and gives output as information.
Components: Input Unit, CPU (ALU and CU), Memory Unit (RAM, ROM, Hard Disk), Output Unit.

2. Batch Processing System, Multiprogramming System, Time Sharing System


Batch Processing: Jobs are collected and executed one after another without user interaction.
Multiprogramming: More than one program stays in memory and CPU switches between them.
Time Sharing: Many users use the computer at the same time by sharing CPU time.

3. CPU Scheduling Algorithm using FCFS Method


FCFS means First Come First Serve. Process that arrives first gets CPU first.
Formula: TAT = CT - AT, WT = TAT - BT

4. Process Synchronization using Critical Section Problem


Synchronization controls access to shared resources so that no two processes execute critical
section together.
Bakery Algorithm gives each process a number; smallest number enters first.

5. Bounded Buffer Problem


Also called Producer-Consumer Problem. Producer adds data, consumer removes data from
limited buffer.
Solved using Semaphore and Mutex.

6. Deadlock Detection and Recovery


Deadlock occurs when processes wait forever for resources held by each other.
Recovery: Process termination, resource preemption, rollback.

7. Segmentation with Paging


Segmentation divides memory logically; paging divides memory into fixed-size pages.
Segmentation with paging improves memory utilization and reduces fragmentation.

8. Shell Programming using Conditional Control Statements


Conditional statements like if, if-else, nested if, and case are used for decision making in shell
scripts.

You might also like