Inter Process Communication | Operating System MCQs

CoderIndeed
0
  1. 1. IPC stands for

    1. Inter Process Communication
    2. Intra Process Communication
    3. Inter Process Command
    4. Intra Process Command
    Show Answer
    Answer :     Option ( a )
  2. 2. What is Inter process communication?

    1. Communication within the process
    2. Communication between two process
    3. Communication between two threads of same process
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )
  3. 3. Message passing system allows processes to __________

    1. communicate with one another without resorting to shared data
    2. communicate with one another by resorting to shared data
    3. share data
    4. name the recipient or sender of the message
    Show Answer
    Answer :     Option ( a )
  4. 4. Which of the following two operations are provided by the IPC facility?

    1. Write & delete message
    2. Delete & receive message
    3. Send & delete a message
    4. Receive & send message
    Show Answer
    Answer :     Option ( d )
  5. 5. Messages sent by a process __________

    1. have to be of a fixed size
    2. have to be a variable size
    3. can be fixed or variable sized
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )
  6. 6. The link between two processes P and Q to send and receive messages is called __________

    1. communication link
    2. message-passing link
    3. synchronization link
    4. All of the mentioned
    Show Answer
    Answer :     Option ( a )
  7. 7. Which of the following are TRUE for direct communication?

    1. A communication link can be associated with N number of process(N = max. number of processes supported by system)
    2. A communication link can be associated with exactly two processes
    3. Exactly N/2 links exist between each pair of processes(N = max. number of processes supported by system)
    4. Exactly two link exists between each pair of processes
    Show Answer
    Answer :     Option ( b )
  8. 8. Concurrent access to shared data may result in ____________

    1. data consistency
    2. data insecurity
    3. data inconsistency
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )
  9. 9. 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 ____________

    1. data consistency
    2. race condition
    3. starvation
    4. critical section
    Show Answer
    Answer :     Option ( b )
  10. 10. The segment of code in which the process may change common variables, update tables, write into files is known as ____________

    1. program
    2. race condition
    3. synchronizing
    4. critical section
    Show Answer
    Answer :     Option ( d )
  11. 11. Which of the following conditions must be satisfied to solve the critical section problem?

    1. Mutual Exclusion
    2. Progress
    3. Bounded Waiting
    4. All of the mentioned
    Show Answer
    Answer :     Option ( d )
  12. 12. Mutual exclusion implies that ____________

    1. if a process is executing in its critical section, then no other process must be executing in their critical sections
    2. if a process is executing in its critical section, then other processes must be executing in their critical sections
    3. if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )
  13. 13. TestAndSet instruction is executed ____________

    1. periodically
    2. after a particular process
    3. atomically
    4. at the end of a process
    Show Answer
    Answer :     Option ( c )
  14. 14. Semaphore is a/an _______ to solve the critical section problem.

    1. hardware for a system
    2. special program for a system
    3. integer variable
    4. program
    Show Answer
    Answer :     Option ( c )
  15. 15. The signal operation of the semaphore basically works on the basic _______ system call.

    1. continue()
    2. wakeup()
    3. getup()
    4. start()
    Show Answer
    Answer :     Option ( b )
  16. 16. What are the two kinds of semaphores?

    1. Mutex & Counting
    2. Binary & Counting
    3. Counting & Decimal
    4. Decimal & Binary
    Show Answer
    Answer :     Option ( b )
  17. 17. A binary semaphore is a semaphore with integer values ____________

    1. 1
    2. -1
    3. 0.5
    4. 0.8
    Show Answer
    Answer :     Option ( a )
  18. 18. Semaphores are mostly used to implement ____________

    1. System calls
    2. IPC mechanisms
    3. System protection
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )
  19. 19. The bounded buffer problem is also known as ____________

    1. Readers – Writers problem
    2. Dining – Philosophers problem
    3. Producer – Consumer problem
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )
  20. 20. In the bounded buffer problem, there are the empty and full semaphores that ____________

    1. count the number of empty and full buffers (slots)
    2. count the number of empty and full memory spaces
    3. count the number of empty and full queues
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )
  21. 21. In the bounded buffer problem ____________

    1. there is only one buffer
    2. there are n buffers (n being greater than one but finite)
    3. there are infinite buffers
    4. the buffer size is bounded
    Show Answer
    Answer :     Option ( b )
  22. 22. The dining – philosophers problem will occur in case of ____________

    1. 5 philosophers and 5 chopsticks
    2. 4 philosophers and 5 chopsticks
    3. 3 philosophers and 5 chopsticks
    4. 6 philosophers and 5 chopsticks
    Show Answer
    Answer :     Option ( a )
  23. 23. A monitor is a type of ____________

    1. semaphore
    2. low level synchronization construct
    3. high level synchronization construct
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )
  24. 24. A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters.

    1. process, semaphore
    2. process, monitor
    3. semaphore, semaphore
    4. monitor, monitor
    Show Answer
    Answer :     Option ( d )
  25. 25. The monitor construct ensures that ____________

    1. only one process can be active at a time within the monitor
    2. n number of processes can be active at a time within the monitor (n being greater than 1)
    3. the queue has only one process in it at a time
    4. All of the mentioned
    Show Answer
    Answer :     Option ( a )
  26. 26. What are the operations that can be invoked on a condition variable in monitor?

    1. Wait & Signal
    2. Hold & Wait
    3. Signal & Hold
    4. Continue & Signal
    Show Answer
    Answer :     Option ( a )
  27. 27. If no process is suspended, the signal operation ____________

    1. puts the system into a deadlock state
    2. suspends some default process execution
    3. nothing happens
    4. the output is unpredictable
    Show Answer
    Answer :     Option ( c )
  28. 28. Which are two fundamental models of interprocess communication:

    1. Shared memory and message passing
    2. Independent and cooperating
    3. Cooperating and shared memory
    4. Shared memory and independent
    Show Answer
    Answer :     Option ( a )
  29. 29. In producer–consumer problem using shared memory, Select appropriate statement from the below.

    1. We must have available a buffer of items that can be filled by the producer and emptied by the consumer
    2. A producer can consume one item while the consumer is producing another item
    3. No synchronization required between The producer and consumer, so that the consumer does not try to consume an item that has not yet been produced
    4. The buffer will reside in a region of memory that need not be to shared by the producer and consumer processes
    Show Answer
    Answer :     Option ( a )
  30. 30. In Message-Passing Systems, A message-passing facility provides at least two operations:

    1. send(message) and delete(message)
    2. delete(message) and receive (message)
    3. send(message) and receive(message)
    4. write(message) and delete(message)
    Show Answer
    Answer :     Option ( c )
  31. 31. Which of the following condition stands true for Mutual Exclusion?

    1. No process access and manipulate the same data concurrently
    2. If process Pi is executing in its critical section, then no other processes can be executing in their critical sections
    3. Several processes access and manipulate the same data concurrently
    4. None of above
    Show Answer
    Answer :     Option ( b )
  32. 32. Peterson’s solution is restricted to ___ processes that alternate execution between their critical sections and remainder sections

    1. 1
    2. 2
    3. 3
    4. 4
    Show Answer
    Answer :     Option ( b )
  33. 33. Reasons of process cooperation is/are _____

    1. Information sharing
    2. Computation speed-up
    3. Modularity
    4. All of the mentioned
    Show Answer
    Answer :     Option ( d )
  34. 34. The part of program where the shared resource is accessed is called ________________

    1. program
    2. race condition
    3. synchronizing
    4. critical section
    Show Answer
    Answer :     Option ( d )
  35. 35. Way of making sure that if one process is using a shared variable or file; the other process will be excluded (stopped) from doing the same thing is called _______

    1. program
    2. race condition
    3. mutual exclusion
    4. critical section
    Show Answer
    Answer :     Option ( c )
  36. 36. TSL stands for

    1. Test and Set Lock
    2. Turn to Set Lock
    3. Turn and Swap Lock
    4. Test and Swap Lock
    Show Answer
    Answer :     Option ( a )
  37. 37. Execution of a high priority process/thread is blocked by a lower priority process/thread is called ____________

    1. Priority inversion problem
    2. Priority opposite problem
    3. Priority reverse problem
    4. Priority revert problem
    Show Answer
    Answer :     Option ( a )
  38. 38. When Buffer is empty

    1. Producer can produce
    2. Consumer can consume
    3. Producer can consume
    4. Consumer can produce
    Show Answer
    Answer :     Option ( a )
  39. 39. When Buffer is full

    1. Producer can produce
    2. Consumer can consume
    3. Producer can consume
    4. Consumer can produce
    Show Answer
    Answer :     Option ( b )
  40. 40. Buffer is partial filled

    1. Producer can produce
    2. Consumer can consume
    3. Both A and B
    4. None of above
    Show Answer
    Answer :     Option ( c )
  41. 41. Buffer is partial empty

    1. Producer can produce
    2. Consumer can consume
    3. Both A and B
    4. None of above
    Show Answer
    Answer :     Option ( c )
  42. 42. Binary semaphores can take ___ values.

    1. 0
    2. 1
    3. 2
    4. 3
    Show Answer
    Answer :     Option ( c )
  43. 43. Counting semaphore can have _______ values.

    1. 0
    2. 1
    3. n
    4. -1
    Show Answer
    Answer :     Option ( c )
  44. 44. Multiple processes are permitted to concurrently acquire a reader–writer lock in read mode, but only one process may acquire the lock for ___, as exclusive access is required for _________

    1. reading, readers
    2. reading, writers
    3. writing, writers
    4. writing, readers
    Show Answer
    Answer :     Option ( c )
  45. 45. Mutex is the short form of _________

    1. Mutual Exclusion Object
    2. More Exclusion Object
    3. Mutual X Object
    4. Mutual Exclusion Order
    Show Answer
    Answer :     Option ( a )
  46. 46. Pipe performs _________ communication.

    1. one-way
    2. two-way
    3. three-way
    4. N-way
    Show Answer
    Answer :     Option ( a )
  47. 47. The process invoking the wait operation is

    1. suspended until another process invokes the signal operation
    2. waiting for another process to complete before it can itself call the signal operation
    3. stopped until the next process in the queue finishes execution
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )
  48. 48. Which is the device that should get the highest priority in assigning the interrupts?

    1. Floppy disk
    2. Hard disk
    3. CPU temperature sensor
    4. Keyboard
    Show Answer
    Answer :     Option ( c )
  49. 49. __________ is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time.

    1. Mutual Exclusion
    2. Busy Waiting
    3. Deadlock
    4. Starvation
    Show Answer
    Answer :     Option ( a )
  50. 50. ______________techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate.

    1. Mutual Exclusion
    2. Busy Waiting
    3. Deadlock
    4. Starvation
    Show Answer
    Answer :     Option ( a )
Tags

Post a Comment

0Comments

Post a Comment (0)

#buttons=(Accept !) #days=(20)

Our website uses cookies to enhance your experience. Check Now
Accept !