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

In distributed systems, a logical clock is associated with ______________

A. Each instruction
B. Each process
C. Each register
D. None of the mentioned

If timestamps of two events are same, then the events are ____________

A. Concurrent
B. Non-concurrent
C. Monotonic
D. Non-monotonic

If a process is executing in its critical section ____________

A. Any other process can also execute in its critical section
B. No other process can execute in its critical section
C. One more process can execute in its critical section
D. None of the mentioned

A process can enter into its critical section ____________

A. Anytime
B. When it receives a reply message from its parent process
C. When it receives a reply message from all other processes in the system
D. None of the mentioned

For proper synchronization in distributed systems ____________

A. Prevention from the deadlock is must
B. Prevention from the starvation is must
C. Prevention from the deadlock & starvation is must
D. None of the mentioned

In the token passing approach of distributed systems, processes are organized in a ring structure ____________

A. Logically
B. Physically
C. Both logically and physically
D. None of the mentioned

In distributed systems, what will the transaction coordinator do?

A. Starts the execution of transaction
B. Breaks the transaction into number of sub transactions
C. Coordinates the termination of the transaction
D. All of the mentioned

In case of failure, a new transaction coordinator can be elected by ____________

A. Bully algorithm
B. Ring algorithm
C. Both bully and ring algorithm
D. None of the mentioned

In distributed systems, election algorithms assumes that ____________

A. A unique priority number is associated with each active process in system
B. There is no priority number associated with any process
C. Priority of the processes is not required
D. None of the mentioned

According to the ring algorithm, links between processes are ____________

A. Bidirectional
B. Unidirectional
C. Both bidirectional and unidirectional
D. None of the mentioned