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

The FCFS algorithm is particularly troublesome for ____________

A. Time sharing systems
B. Multiprogramming systems
C. Multiprocessor systems
D. Operating systems

Explanation: In a time sharing system, each user needs to get a share of the CPU at regular intervals.

The real difficulty with SJF in short term scheduling is ____________

A. It is too good an algorithm
B. Knowing the length of the next cpu request
C. It is too complex to understand
D. None of the mentioned

Consider the following set of processes, the length of the CPU burst time given in milliseconds. Process Burst time P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the SJF scheduling algorithm.

A. The waiting time for process p1 is 3ms
B. The waiting time for process p1 is 0ms
C. The waiting time for process p1 is 16ms
D. The waiting time for process p1 is 9ms

Preemptive Shortest Job First scheduling is sometimes called ____________

A. Fast sjf scheduling
B. Edf scheduling €? earliest deadline first
C. Hrrn scheduling €? highest response ratio next
D. Srtn scheduling €? shortest remaining time next

An SJF algorithm is simply a priority algorithm where the priority is ____________

A. The predicted next cpu burst
B. The inverse of the predicted next cpu burst
C. The current cpu burst
D. Anything the user wants

Explanation: The larger the CPU burst, the lower the priority.

Choose one of the disadvantages of the priority scheduling algorithm?

A. It schedules in a very complex manner
B. Its scheduling takes up a lot of time
C. It can lead to some low priority process waiting indefinitely for the cpu
D. None of the mentioned

What is ‘Aging’?

A. Keeping track of cache contents
B. Keeping track of what pages are currently residing in memory
C. Keeping track of how many times a given page is referenced
D. Increasing the priority of jobs to ensure termination in a finite time

A solution to the problem of indefinite blockage of low – priority processes is ____________

A. Starvation
B. Wait queue
C. Ready queue
D. Aging

Which of the following statements are true? (GATE 2010) i) Shortest remaining time first scheduling may cause starvation ii) Preemptive scheduling may cause starvation iii) Round robin is better than FCFS in terms of response time

A. I only
B. I and iii only
C. Ii and iii only
D. I, ii and iii

Which of the following scheduling algorithms gives minimum average waiting time?

A. Fcfs
B. Sjf
C. Round €? robin
D. Priority