OS - Home
OS - Overview
OS - History
OS - Evolution
OS - Functions
OS - Components
OS - Structure
OS - Architecture
OS - Services
OS - Properties
Process Management
Processes in Operating System
States of a Process
Process Schedulers
Process Control Block
Operations on Processes
Process Suspension and Process Switching
Process States and the Machine Cycle
Inter Process Communication (IPC)
Remote Procedure Call (RPC)
Context Switching
Threads
Types of Threading
Multi-threading
System Calls
Scheduling Algorithms
Process Scheduling
Types of Scheduling
Scheduling Algorithms Overview
FCFS Scheduling Algorithm
SJF Scheduling Algorithm
Round Robin Scheduling Algorithm
HRRN Scheduling Algorithm
Priority Scheduling Algorithm
Multilevel Queue Scheduling
Lottery Scheduling Algorithm
Starvation and Aging
Turn Around Time & Waiting Time
Burst Time in SJF Scheduling
Process Synchronization
Process Synchronization
Solutions For Process Synchronization
Hardware-Based Solution
Software-Based Solution
Critical Section Problem
Critical Section Synchronization
Mutual Exclusion Synchronization
Mutual Exclusion Using Interrupt Disabling
Peterson's Algorithm
Dekker's Algorithm
Bakery Algorithm
Semaphores
Binary Semaphores
Counting Semaphores
Mutex
Turn Variable
Bounded Buffer Problem
Reader Writer Locks
Test and Set Lock
Monitors
Sleep and Wake
Race Condition
Classical Synchronization Problems
Dining Philosophers Problem
Producer Consumer Problem
Sleeping Barber Problem
Reader Writer Problem
OS Deadlock
Introduction to Deadlock
Conditions for Deadlock
Deadlock Handling
Deadlock Prevention
Deadlock Avoidance (Banker's Algorithm)
Deadlock Detection and Recovery
Deadlock Ignorance
Resource Allocation Graph
Livelock
Memory Management
Memory Management
Logical and Physical Address
Contiguous Memory Allocation
Non-Contiguous Memory Allocation
First Fit Algorithm
Next Fit Algorithm
Best Fit Algorithm
Worst Fit Algorithm
Buffering
Fragmentation
Compaction
Virtual Memory
Segmentation
Paged Segmentation & Segmented Paging
Buddy System
Slab Allocation
Overlays
Free Space Management
Locality of Reference
Paging and Page Replacement
Paging
Demand Paging
Page Table
Page Replacement Algorithms
Second Chance Page Replacement
Optimal Page Replacement Algorithm
Belady's Anomaly
Thrashing
Storage and File Management
File Systems
File Attributes
Structures of Directory
Linked Index Allocation
Indexed Allocation
Disk Scheduling Algorithms
FCFS Disk Scheduling
SSTF Disk Scheduling
SCAN Disk Scheduling
LOOK Disk Scheduling
I/O Systems
I/O Hardware
I/O Software
I/O Programmed
I/O Interrupt-Initiated
Direct Memory Access
OS Types
OS - Types
OS - Batch Processing
OS - Multiprogramming
OS - Multitasking
OS - Multiprocessing
OS - Distributed
OS - Real-Time
OS - Single User
OS - Monolithic
OS - Embedded
Popular Operating Systems
OS - Hybrid
OS - Zephyr
OS - Nix
OS - Linux
OS - Blackberry
OS - Garuda
OS - Tails
OS - Clustered
OS - Haiku
OS - AIX
OS - Solus
OS - Tizen
OS - Bharat
OS - Fire
OS - Bliss
OS - VxWorks
Miscellaneous Topics
OS - Security

OS Process Q & A #2

Quiz

Question: What are the advantages of multiprogramming?

Answer: Advantages of multiprogramming are −

Increased CPU Utilization − Multiprogramming improves CPU utilization as it organizes a number of jobs where CPU always has one to execute.
Increased Throughput − Throughput means total number of programs executed over a fixed period of time. In multiprogramming, CPU does not wait for I/O for the program it is executing, thus resulting in an increased throughput.
Shorter Turn around Time − Turnaround time for short jobs is improved greatly in multiprogramming.
Improved Memory Utilization − In multiprogramming, more than one program resides in main memory. Thus memory is optimally utilized.
Increased Resources Utilization − In multiprogramming, multiple programs are actively competing for resources resulting in higher degree of resource utilization.
Multiple Users − Multiprogramming supports multiple users.

os_exams_questions_answers.htm

Print Page