In the bounded buffer problem _________

  1. Home

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

Posted Date:-2022-03-25 08:39:31

More MCQS Questions and answers

  1. A collection of instructions that performs a single logical function is called ________
  2. In the write ahead logging a _______ is maintained.
  3. To avoid deadlock ________
  4. What is a reusable resource?
  5. Which one of the following is the deadlock avoidance algorithm?
  6. A deadlock free solution to the dining philosophers problem _____
  7. A locking protocol is one that ______
  8. A monitor is a type of _________
  9. A monitor is characterized by ______
  10. A problem encountered in multitasking when a process is perpetually denied necessary resources is called _______
  11. A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters.
  12. A system is in the safe state if _____
  13. A terminated transaction that has completed its execution successfully is _____ otherwise it is ______
  14. 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);
  15. An actual update is not allowed to a data item ______
  16. An un-interruptible unit is known as ________
  17. Consider a transaction T1 that committed prior to checkpoint. The <T1 commits> record appears in the log before the <checkpoint> record. Any modifications made by T1 must have been written to the stable storage either with the checkpoint or prior to it. Thus at recovery time ______
  18. Deadlock prevention is a set of methods ______
  19. For a deadlock to arise, which of the following conditions must hold simultaneously?
  20. For a Hold and wait condition to prevail _____
  21. For Mutual exclusion to prevail in the system ______
  22. For non sharable resources like a printer, mutual exclusion _____
  23. For sharable resources, mutual exclusion _______
  24. If no process is suspended, the signal operation _______
  25. In the bounded buffer problem _________
  26. In the bounded buffer problem, there are the empty and full semaphores that _____
  27. Serializable schedules are ones where _____
  28. The bounded buffer problem is also known as _____
  29. The circular wait condition can be prevented by ______
  30. The dining – philosophers problem will occur in case of ________
  31. The disadvantage of a process being allocated all its resources before beginning its execution is ______
  32. The growing phase is a phase in which?
  33. The monitor construct ensures that ____
  34. The number of resources requested by a process _____
  35. The request and release of resources are _______
  36. The shrinking phase is a phase in which?
  37. The state of the data accessed by an aborted transaction must be restored to what it was just before the transaction started executing. This restoration is known as ________ of transaction.
  38. The system periodically performs checkpoints that consists of the following operation(s) ____
  39. The two phase locking protocol consists of ______
  40. The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.
  41. To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.
  42. To ensure that the hold and wait condition never occurs in the system, it must be ensured that ________
  43. What are Multithreaded programs?
  44. What are the operations that can be invoked on a condition variable?
  45. What is the drawback of banker’s algorithm?
  46. Which is the process of invoking the wait operation?
  47. Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? I) 2-phase locking II) Timestamp ordering
  48. Which of the following condition is required for a deadlock to be possible?
  49. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
  50. Write ahead logging is a way ________
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!