Operating System Subcategories

Memory Management Swapping 1	Process Scheduling Queue
Virtual Memory Page Replacement Algorithms 1	Linux
Cpu Scheduling	Memory Management
Computer Fundamentals	Cpu Scheduling Benefits
Threads Signal Handling	Threads Ult Klt
Distributed Operating System	Basics
Operating System	Processes
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Deadlock	Deadlock Avoidance
Memory Management Swapping 2	Memory Allocation 1
Secondary Storage	Memory Management Paging 1
Memory Management Paging 2	Rtos
Multimedia System Cpu Disk Scheduling	Security Intrusion Detection
Virtual Memory Thrashing	File System Interface Access Methods 1
File System Interface Directory Structure 1	File System Interface Directory Structure 2
File System Interface Mounting Sharing	File System Allocation Methods 1
Disk Scheduling 2	Disk Management
Classic Sync Problems	Semaphores 1
Process Creation	Multimedia System Network Management
Semaphores 2	Cpu Scheduling 2
Application Io Interface 1	Inter Process Communication
Process Synchronization	Multimedia System Compression 1
Network File System 1	Disk Scheduling 1
Mass Storage Raid 1	File System 1
Communication Systems Bandwidth Transmission Medium	Security Cryptography
Two Port Network	Process Rpc
Virtual Memory Page Replacement Algorithms 2	Virtual Memory Frame Allocation
Network File System 2	File System Allocation Methods 2
File System Allocation Methods 3	Process Control Block
Process Structures	Critical Section Problem
Process Sync Monitors	Atomic Transactions
Deadlock Recovery	Memory Allocation 2
Memory Management Segmentation	Application Io Interface 2
Kernel Io Subsystems	Multimedia System Compression 2
Multimedia System Compression 3	Security User Authentication
Security Program System Threats	Security System Facility
Threads Fork Exec	Threads Cancellation
Threads Pools	Multi Threading Models
Virtual Memory Demand Paging	Virtual Memory
File System Concepts	File System Implementation
File System Interface Access Methods 2	File System Recovery
Io Subsystem	Swap Space Management
Mass Storage Raid 2	Mass Storage Tertiary Storage
Protection Concepts	Protection Access Matrix
Security	Protection Memory Protection
Protection Revocation Access Rights	Network Structure Topology
Robustness	Distributed File System
Distributed Synchronization	Deadlock Prevention
Deadlock Detection	Threads
File System Interface Protection	File System Free Space Performance

What is dispatch latency?

A. The speed of dispatching a process from running to the ready state
B. The time of dispatching a process from running to ready state and keeping the cpu idle
C. The time to stop one process and start running another one
D. None of the mentioned

With multiprogramming ______ is used productively.

A. Time
B. Space
C. Money
D. All of the mentioned

What are the two steps of a process execution?

A. I/o & os burst
B. Cpu & i/o burst
C. Memory & i/o burst
D. Os & memory burst

An I/O bound program will typically have ____________

A. A few very short cpu bursts
B. Many very short i/o bursts
C. Many very short cpu bursts
D. A few very short i/o bursts

Explanation: An I/O bound program frequently performs short computations (short CPU bursts) followed by waiting for I/O operations to complete.

A process is selected from the ______ queue by the ________ scheduler, to be executed.

A. Blocked, short term
B. Wait, long term
C. Ready, short term
D. Ready, long term

In the following cases non – preemptive scheduling occurs?

A. When a process switches from the running state to the ready state
B. When a process goes from the running state to the waiting state
C. When a process switches from the waiting state to the ready state
D. All of the mentioned

Explanation: There is no other choice.

The switching of the CPU from one process or thread to another is called ____________

A. Process switch
B. Task switch
C. Context switch
D. All of the mentioned

Scheduling is done so as to ____________

A. Increase the waiting time
B. Keep the waiting time the same
C. Decrease the waiting time
D. None of the mentioned

What is Turnaround time?

A. The total waiting time for a process to finish execution
B. The total time spent in the ready queue
C. The total time spent in the running queue
D. The total time from the completion till the submission of a process

What is Waiting time?

A. The total time in the blocked and waiting queues
B. The total time spent in the ready queue
C. The total time spent in the running queue
D. The total time from the completion till the submission of a process