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 interprocess communication?

A. Allows processes to communicate and synchronize their actions when using the same address space
B. Allows processes to communicate and synchronize their actions
C. Mechanism is used by cooperating processes to exchange data and information. there are two models of ipc: †? shared memory †? message passing
D. None of the mentioned

Explanation: Interprocess Communication allows processes to communicate and synchronize their actions. Interprocess Communication (IPC) mechanism is used by cooperating processes to exchange data and information. There are two models of IPC: → Shared Memory → Message Passing

Message passing system allows processes to __________

A. Communicate with each other without sharing the same address space
B. Communicate with one another by resorting to shared data
C. Share data
D. Name the recipient or sender of the message

Explanation: Message Passing system allows processes to communicate with each other without sharing the same address space.

Which of the following two operations are provided by the IPC facility?

A. Write & delete message
B. Delete & receive message
C. Send & delete message
D. Receive & send message

Explanation: Two operations provided by the IPC facility are receive and send messages. Exchange of data takes place in cooperating processes.

Messages sent by a process __________

A. Have to be of a fixed size
B. Have to be a variable size
C. Can be fixed or variable sized
D. None of the mentioned

Explanation: Messages sent by a process can be fixed or variable size. If the message size of the process is fixed then system level implementation is straightforward but it makes the task of programming more difficult. If the message size of the process is variable then system level implementation is more complex but it makes the task of programming simpler.

The link between two processes P and Q to send and receive messages is called __________

A. Communication link
B. Message-passing link
C. Synchronization link
D. All of the mentioned

Explanation: The link between two processes P and Q to send and receive messages is called communication link. Two processes P and Q want to communicate with each other; there should be a communication link that must exist between these two processes so that both processes can able to send and receive messages using that link.

Which of the following are TRUE for direct communication?

A. A communication link can be associated with n number of process(n = max. number of processes supported by system)
B. A communication link is associated with exactly two processes
C. Exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system)
D. Exactly two link exists between each pair of processes

Explanation: For direct communication, a communication link is associated with exactly two processes. One communication link must exist between a pair of processes.

In indirect communication between processes P and Q __________

A. There is another process r to handle and pass on the messages between p and q
B. There is another machine between the two processes to help communication
C. There is a mailbox to help communication between p and q
D. None of the mentioned

Explanation: In indirect communication between processes P and Q there is a mailbox to help communication between P and Q. A mailbox can be viewed abstractly as an object into which messages can be placed by processes and from which messages can be removed.

In the non blocking send __________

A. The sending process keeps sending until the message is received
B. The sending process sends the message and resumes operation
C. The sending process keeps sending until it receives a message
D. None of the mentioned

Explanation: In the non blocking send, the sending process sends the message and resumes operation. Sending process doesn’t care about reception. It is also known as asynchronous send.

In the Zero capacity queue __________

A. The queue can store at least one message
B. The sender blocks until the receiver receives the message
C. The sender keeps sending and the messages don’t wait in the queue
D. None of the mentioned

Explanation: In the Zero capacity queue the sender blocks until the receiver receives the message. Zero capacity queue has maximum capacity of Zero; thus message queue does not have any waiting message in it.

The Zero Capacity queue __________

A. Is referred to as a message system with buffering
B. Is referred to as a message system with no buffering
C. Is referred to as a link
D. None of the mentioned

Explanation: The Zero capacity queue is referred to as a message system with no buffering. Zero capacity queue has maximum capacity of Zero; thus message queue does not have any waiting message in it.