Question 1

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

Accepted Answer

A) write & delete message 
B) delete & receive message 
C) send & delete message 
D) receive & send message 
A) write & delete message 
B) delete & receive message 
C) send & delete message 
D) receive & send message D

Question 2

TestAndSet instruction is executed

Accepted Answer

A) after a particular process 
B) periodically 
C) atomically 
D) none of the mentioned 
A) after a particular process 
B) periodically 
C) atomically 
D) none of the mentioned C

Question 3

The Zero Capacity queue___________

Accepted Answer

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 
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 B

Question 4

A parent process calling___________system call will be suspended until children processes terminate.

Accepted Answer

A) wait 
B) fork 
C) exit 
D) exec 
A) wait 
B) fork 
C) exit 
D) exec

Question 5

Messages sent by a process___________

Accepted Answer

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 
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

Question 6

A minimum of___________variable(s) is/are required to be shared between processes to solve the critical section problem.

Accepted Answer

A) one 
B) two 
C) three 
D) four 
A) one 
B) two 
C) three 
D) four

Question 7

In UNIX, each process is identified by its

Accepted Answer

A) process control block 
B) device queue 
C) process identifier 
D) none of the mentioned 
A) process control block 
B) device queue 
C) process identifier 
D) none of the mentioned

Question 8

What is Inter process communication?

Accepted Answer

A) allows processes to communicate and synchronize their actions when using the same address space 
B) allows processes to communicate and synchronize their actions without using the same address space 
C) allows the processes to only synchronize their actions without communication 
D) none of the mentioned 
A) allows processes to communicate and synchronize their actions when using the same address space 
B) allows processes to communicate and synchronize their actions without using the same address space 
C) allows the processes to only synchronize their actions without communication 
D) none of the mentioned

Question 9

Which of the following conditions must be satisfied to solve the critical section problem?

Accepted Answer

A) mutual exclusion 
B) progress 
C) bounded waiting 
D) all of the mentioned 
A) mutual exclusion 
B) progress 
C) bounded waiting 
D) all of the mentioned

Question 10

Which of the following are TRUE for direct communication?

Accepted Answer

A) a communication link can be associated with n number of process(n = max. number of processes supported by system) 
B) a communication link can be 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 
A) a communication link can be associated with n number of process(n = max. number of processes supported by system) 
B) a communication link can be 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

Question 11

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section

Accepted Answer

A) after a process has made a request to enter its critical section and before the request is granted 
B) when another process is in its critical section 
C) before a process has made a request to enter its critical section 
D) none of the mentioned 
A) after a process has made a request to enter its critical section and before the request is granted 
B) when another process is in its critical section 
C) before a process has made a request to enter its critical section 
D) none of the mentioned

Question 12

In the bakery algorithm to solve the critical section problem___________

Accepted Answer

A) each process is put into a queue and picked up in an ordered manner 
B) each process receives a number (may or may not be unique) and the one with the lowest number is served next 
C) each process gets a unique number and the one with the highest number is served next 
D) each process gets a unique number and the one with the lowest number is served next 
A) each process is put into a queue and picked up in an ordered manner 
B) each process receives a number (may or may not be unique) and the one with the lowest number is served next 
C) each process gets a unique number and the one with the highest number is served next 
D) each process gets a unique number and the one with the lowest number is served next

Question 13

The segment of code in which the process may change common variables, update tables, write into files is known as___________

Accepted Answer

A) program 
B) critical section 
C) non - critical section 
D) synchronizing 
A) program 
B) critical section 
C) non - critical section 
D) synchronizing

Question 14

The child process completes execution, but the parent keeps executing, then the child process is known as___________

Accepted Answer

A) orphan 
B) zombie 
C) body 
D) dead 
A) orphan 
B) zombie 
C) body 
D) dead

Question 15

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called___________

Accepted Answer

A) data consistency 
B) race condition 
C) aging 
D) starvation 
A) data consistency 
B) race condition 
C) aging 
D) starvation

Question 16

In indirect communication between

Accepted Answer

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 
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

Question 17

Cascading termination refers to termination of all child processes before the parent terminates___________

Accepted Answer

A) normally 
B) abnormally 
C) normally or abnormally 
D) none of the mentioned 
A) normally 
B) abnormally 
C) normally or abnormally 
D) none of the mentioned

Question 18

Concurrent access to shared data may result in___________

Accepted Answer

A) data consistency 
B) data insecurity 
C) data inconsistency 
D) none of the mentioned 
A) data consistency 
B) data insecurity 
C) data inconsistency 
D) none of the mentioned

Question 19

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

Accepted Answer

A) communication link 
B) message-passing link 
C) synchronization link 
D) all of the mentioned 
A) communication link 
B) message-passing link 
C) synchronization link 
D) all of the mentioned

Question 20

In the non blocking send___________

Accepted Answer

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 
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

Exam 11: Process Management and Interprocess Communication in Unix

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

TestAndSet instruction is executed

The Zero Capacity queue___________

A parent process calling___________system call will be suspended until children processes terminate.

Messages sent by a process___________

A minimum of___________variable(s) is/are required to be shared between processes to solve the critical section problem.

In UNIX, each process is identified by its

What is Inter process communication?

Which of the following conditions must be satisfied to solve the critical section problem?

Which of the following are TRUE for direct communication?

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section

In the bakery algorithm to solve the critical section problem___________

The segment of code in which the process may change common variables, update tables, write into files is known as___________

The child process completes execution, but the parent keeps executing, then the child process is known as___________

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called___________

In indirect communication between

Cascading termination refers to termination of all child processes before the parent terminates___________

Concurrent access to shared data may result in___________

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

In the non blocking send___________

Operating System

Operating System and Software

Operating System and Computer Basics: Formatting, Clipboard, Radio Buttons, Bankers Algorithm, and More

Computer Software and Operating System

Processor and Memory Fundamentals

Computer Architecture and Memory

Computer Science and Information Technology on Raid, Middleware, and CPU Scheduling

Understanding Process Scheduling in Operating Systems

Operating System and Process Management

Process Scheduling and Synchronization in Multi-Programming Environment

Semaphores, Spinlocks, and Monitors: Understanding Synchronization in Operating Systems

Concurrency Control and Deadlock Prevention in Operating Systems

Deadlock and Resource Allocation in Computer Systems

Memory Management and Swapping Techniques

Memory Management in Operating Systems

Understanding Paging and Memory Management in Operating Systems

Understanding Virtual Memory and Page Replacement Algorithms

Virtual Memory, Segmentation, and Disk Management

Disk Management and I/O Subsystem

Linux Kernel and System Structures

Thread Management and Synchronization in Operating Systems

Operating System Concepts: System Calls, Threads, and Signals

Operating System and Thread Pool

Operating System and Memory Management

Process Control and Memory Management

Linux Kernel, File Systems, Bootloaders and Distributions

Filters