In the bounded buffer problem ____________

• A. There is only one buffer
• B. There are n buffers ( n being greater than one but finite)
• C. There are infinite buffers
• D. The buffer size is bounded

To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.

• A. Readers
• B. Writers
• C. Readers and writers
• D. None of the mentioned

The dining – philosophers problem will occur in case of ____________

• A. 5 philosophers and 5 chopsticks
• B. 4 philosophers and 5 chopsticks
• C. 3 philosophers and 5 chopsticks
• D. 6 philosophers and 5 chopsticks

A deadlock free solution to the dining philosophers problem ____________

• A. Necessarily eliminates the possibility of starvation
• B. Does not necessarily eliminate the possibility of starvation
• C. Eliminates any possibility of any kind of problem further
• D. None of the mentioned

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. advertisement signal(mutex); ..... critical section ..... wait(mutex); In this situation :

• A. A deadlock will occur
• B. Processes will starve to enter critical section
• C. Several processes maybe executing in their critical section
• D. All of the mentioned

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. wait(mutex); ..... critical section ..... wait(mutex);

• A. A deadlock will occur
• B. Processes will starve to enter critical section
• C. Several processes maybe executing in their critical section
• D. All of the mentioned

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. (GATE 2010) Method used by P1 : while(S1==S2); Critical section S1 = S2; Method used by P2 : while(S1!=S2); Critical section S2 = not(S1); Which of the following statements describes properties achieved?

• A. Mutual exclusion but not progress
• B. Progress but not mutual exclusion
• C. Neither mutual exclusion nor progress
• D. Both mutual exclusion and progress

Which of the following is not applicable for IP?

• A. Error reporting
• B. Handle addressing conventions
• C. Datagram format
• D. Packet handling

Which of the following field in IPv4 datagram is not related to fragmentation?

• A. Flags
• B. Offset
• C. Tos
• D. Identifier

The TTL field has value 10. How many routers (max) can process this datagram?

• A. 11
• B. 5
• C. 10
• D. 1