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

Which module gives control of the CPU to the process selected by the short-term scheduler?

A. Dispatcher
B. Interrupt
C. Scheduler
D. None of the mentioned

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

A. First-come, first-served scheduling
B. Shortest job scheduling
C. Priority scheduling
D. None of the mentioned

Which algorithm is defined in Time quantum?

A. Shortest job scheduling algorithm
B. Round robin scheduling algorithm
C. Priority scheduling algorithm
D. Multilevel queue scheduling algorithm

Which one of the following can not be scheduled by the kernel?

A. Kernel level thread
B. User level thread
C. Process
D. None of the mentioned

Explanation: User level threads are managed by thread library and the kernel is unaware of them.

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________

A. Job queue
B. Ready queue
C. Execution queue
D. Process queue

The interval from the time of submission of a process to the time of completion is termed as ____________

A. Waiting time
B. Turnaround time
C. Response time
D. Throughput

In priority scheduling algorithm ____________

A. Cpu is allocated to the process with highest priority
B. Cpu is allocated to the process with lowest priority
C. Equal priority processes can not be scheduled
D. None of the mentioned

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________

A. All process
B. Currently running process
C. Parent process
D. Init process

Process are classified into different groups in ____________

A. Shortest job scheduling algorithm
B. Round robin scheduling algorithm
C. Priority scheduling algorithm
D. Multilevel queue scheduling algorithm

In multilevel feedback scheduling algorithm ____________

A. A process can move to a different classified ready queue
B. Classification of ready queue is permanent
C. Processes are not classified into groups
D. None of the mentioned