Operating System » Multimedia System Cpu Disk Scheduling
Operating System Subcategories
Application Io Interface 1Application Io Interface 2
Atomic TransactionsBasics
Classic Sync ProblemsCommunication Systems Bandwidth Transmission Medium
Cpu SchedulingCpu Scheduling 2
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
Cpu Scheduling BenefitsCritical Section Problem
DeadlockDeadlock Avoidance
Deadlock DetectionDeadlock Prevention
Deadlock RecoveryDisk Management
Disk Scheduling 1Disk Scheduling 2
Distributed File SystemDistributed Operating System
Distributed SynchronizationFile System 1
File System Allocation Methods 1File System Allocation Methods 2
File System Allocation Methods 3File System Concepts
File System Free Space PerformanceFile System Implementation
File System Interface Access Methods 1File System Interface Access Methods 2
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Interface Protection
File System RecoveryInter Process Communication
Io SubsystemKernel Io Subsystems
LinuxMass Storage Raid 1
Mass Storage Raid 2Mass Storage Tertiary Storage
Memory Allocation 1Memory Allocation 2
Memory ManagementMemory Management Paging 1
Memory Management Paging 2Memory Management Segmentation
Memory Management Swapping 1Memory Management Swapping 2
Multi Threading ModelsMultimedia System Compression 1
Multimedia System Compression 2Multimedia System Compression 3
Multimedia System Cpu Disk SchedulingMultimedia System Network Management
Network File System 1Network File System 2
Network Structure TopologyOperating System
Process Control BlockProcess Creation
Process RpcProcess Scheduling Queue
Process StructuresProcess Sync Monitors
Process SynchronizationProcesses
Protection Access MatrixProtection Concepts
Protection Memory ProtectionProtection Revocation Access Rights
RobustnessRtos
Secondary StorageSecurity
Security CryptographySecurity Intrusion Detection
Security Program System ThreatsSecurity System Facility
Security User AuthenticationSemaphores 1
Semaphores 2Swap Space Management
ThreadsThreads Cancellation
Threads Fork ExecThreads Pools
Threads Signal HandlingThreads Ult Klt
Two Port NetworkVirtual Memory
Virtual Memory Demand PagingVirtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing
The priority of a process will ______________ if the scheduler assigns it a static priority.
A. Change
B. Remain unchanged
C. Depends on the operating system
D. None of the mentioned
Read more about this MCQ
A scheduling algorithm can use either ___________ priority or ________ priority.
A. Static, still
B. Static, dynamic
C. Live, dead
D. None of the mentioned
Read more about this MCQ
As disks have relatively low transfer rates and relatively high latency rates, disk schedulers must reduce latency times to ___________
A. Ensure high bandwidth
B. Ensure low bandwidth
C. Make sure data is transferred
D. Reduce data transfer speeds
Read more about this MCQ
Servicing requests strictly according to deadline using EDF may result in ___________
A. Lower seek times
B. Lower bandwidth
C. Higher seek time
D. Higher bandwidth
Read more about this MCQ
If several requests have different deadlines that are relatively close together, then using the SCAN – EDF algorithm ___________
A. The scan ordering will service the requests in that batch
B. The edf ordering will service the requests in that batch
C. The fcfs ordering will service the requests in that batch
D. None of the mentioned
Read more about this MCQ