Computer/Operating System MCQ Set 5 Sample Test,Sample questions

Question:
 A collection of instructions that performs a single logical function is called ________

1. transaction

2.operation

3.function

4.All of the Mentioned


Question:
 In the write ahead logging a _______ is maintained.

1.a memory

2.a system

3. a disk

4. a log record


Question:
 To avoid deadlock ________

1.there must be a fixed number of resources to allocate

2.resource allocation must be done only once

3.all deadlocked processes must be aborted

4.inversion technique can be used


Question:
 What is a reusable resource?

1.that can be used by one process at a time and is not depleted by that use

2.that can be used by more than one process at a time

3. that can be shared between various threads

4.None of the mentioned


Question:
 Which one of the following is the deadlock avoidance algorithm?

1. banker’s algorithm

2. round-robin algorithm

3.elevator algorithm

4.karn’s algorithm


Question:
A deadlock free solution to the dining philosophers problem _____

1.necessarily eliminates the possibility of starvation

2.does not necessarily eliminate the possibility of starvation

3. eliminates any possibility of any kind of problem further

4. none of the mentioned


Question:
A locking protocol is one that ______

1.governs how locks are acquired

2. governs how locks are released

3.governs how locks are acquired and released

4.None of the mentioned


Question:
A monitor is a type of _________

1.semaphore

2. low level synchronization construct

3.high level synchronization construct

4. none of the mentioned


Question:
A monitor is characterized by ______

1.a set of programmer defined operators

2.an identifier

3.the number of variables in it

4. All of the mentioned


Question:
A problem encountered in multitasking when a process is perpetually denied necessary resources is called _______

1.deadlock

2.starvation

3. inversion

4.aging


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


Question:
A system is in the safe state if _____

1. the system can allocate resources to each process in some order and still avoid a deadlock

2.there exist a safe sequence

3.all of the mentioned

4.None of the mentioned


Question:
A terminated transaction that has completed its execution successfully is _____ otherwise it is ______

1.committed, destroyed

2.aborted, destroyed

3.committed, aborted

4.None of the mentioned


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

1.a deadlock will occur

2.processes will starve to enter critical section

3.several processes maybe executing in their critical section

4.All of the Mentioned


Question:
An actual update is not allowed to a data item ______

1.before the corresponding log record is written out to stable storage

2.after the corresponding log record is written out to stable storage

3.until the whole log record has been checked for inconsistencies

4.All of the Mentioned


Question:
An un-interruptible unit is known as ________

1. single

2.atomic

3.static

4.None of the mentioned


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

1.There is a need to perform an undo operation on T1

2.There is a need to perform a redo operation on T1

3.There is no need to perform an undo and redo operation on T1

4.All of the Mentioned


Question:
Deadlock prevention is a set of methods ______

1.to ensure that at least one of the necessary conditions cannot hold

2.to ensure that all of the necessary conditions do not hold

3.to decide if the requested resources for a process have to be given or not

4.to recover from a deadlock


Question:
For a deadlock to arise, which of the following conditions must hold simultaneously?

1.Mutual exclusion

2.No preemption

3.Hold and wait

4.All of the Mentioned


Question:
For a Hold and wait condition to prevail _____

1.A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it

2.A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes

3.A process must hold at least one resource and not be waiting to acquire additional resources

4.None of the mentioned


Question:
For Mutual exclusion to prevail in the system ______

1.at least one resource must be held in a non sharable mode

2.the processor must be a uniprocessor rather than a multiprocessor

3.there must be at least one resource in a sharable mode

4.All of the Mentioned


Question:
For non sharable resources like a printer, mutual exclusion _____

1.must exist

2.must not exist

3.may exist

4.None of the mentioned


Question:
For sharable resources, mutual exclusion _______

1. is required

2. is not required

3.may be or may not be required

4.None of the mentioned


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


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


Question:
In the bounded buffer problem, there are the empty and full semaphores that _____

1.count the number of empty and full buffers

2.count the number of empty and full memory spaces

3.count the number of empty and full queues

4. none of the mentioned


Question:
Serializable schedules are ones where _____

1.concurrent execution of transactions is equivalent to the transactions executed serially

2.the transactions can be carried out one after the other

3.a valid result occurs after execution transactions

4.None of the mentioned


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


Question:
The circular wait condition can be prevented by ______

1.defining a linear ordering of resource types

2.using thread

3.using pipes

4. All of the mentioned


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


Question:
The disadvantage of a process being allocated all its resources before beginning its execution is ______

1.Low CPU utilization

2.Low resource utilization

3.Very high resource utilization

4.None of the mentioned


Question:
The growing phase is a phase in which?

1.A transaction may obtain locks, but does not release any

2.A transaction may obtain locks, and releases a few or all of them

3.A transaction may release locks, but does not obtain any new locks

4.A transaction may release locks, and does obtain new locks


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


Question:
The number of resources requested by a process _____

1.must always be less than the total number of resources available in the system

2.must always be equal to the total number of resources available in the system

3.must not exceed the total number of resources available in the system

4.must exceed the total number of resources available in the system


Question:
The request and release of resources are _______

1.command line statements

2. interrupts

3. system calls

4.special programs


Question:
The shrinking phase is a phase in which?

1.A transaction may obtain locks, but does not release any

2.A transaction may obtain locks, and releases a few or all of them

3. A transaction may release locks, but does not obtain any new locks

4.A transaction may release locks, and does obtain new locks


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

1.safety

2.protection

3.roll – back

4.revert – back


Question:
The system periodically performs checkpoints that consists of the following operation(s) ____

1. Putting all the log records currently in main memory onto stable storage

2.putting all modified data residing in main memory onto stable storage

3.putting a log record onto stable storage

4.All of the Mentioned


Question:
The two phase locking protocol consists of ______

1.growing & shrinking phase

2.shrinking & creation phase

3.creation & growing phase

4.destruction & creation phase


Question:
The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.

1.idempotent

2.easy

3.protected

4.All of the Mentioned


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

1. readers

2. writers

3.readers and writers

4. none of the mentioned


Question:
To ensure that the hold and wait condition never occurs in the system, it must be ensured that ________

1.whenever a resource is requested by a process, it is not holding any other resources

2.each process must request and be allocated all its resources before it begins its execution

3.a process can request resources only when it has none

4.All of the Mentioned


Question:
What are Multithreaded programs?

1. lesser prone to deadlocks

2.more prone to deadlocks

3.not at all prone to deadlocks

4.None of the mentioned


Question:
What are the operations that can be invoked on a condition variable?

1. wait & signal

2.hold & wait

3. signal & hold

4.continue & signal


Question:
What is the drawback of banker’s algorithm?

1. in advance processes rarely know how much resource they will need

2.the number of processes changes as time progresses

3.resource once available can disappear

4.All of the Mentioned


Question:
Which is the process of invoking the wait operation?

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


Question:
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
I) 2-phase locking
II) Timestamp ordering

1.I only

2.II only

3.Both I and II

4.Neither I nor II


Question:
Which of the following condition is required for a deadlock to be possible?

1.mutual exclusion

2.a process may hold allocated resources while awaiting assignment of other resources

3.no resource can be forcibly removed from a process holding it

4.All of the Mentioned


Question:
Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

1.resource allocation graph

2.starvation graph

3.inversion graph

4.None of the mentioned


Question:
Write ahead logging is a way ________

1. to ensure atomicity

2. to keep data consistent

3.that records data on stable storage

4.All of the Mentioned


More MCQS

  1. Computer fundamentals
  2. Computer Basic MCQS
  3. CCC MCQ Sample Paper 1
  4. CCC Exams MCQS Sample Paper Test 2
  5. Computer Basics MCQS Paper 1
  6. Computer Basics MCQS Paper 2
  7. FUNDAMENTALS OF COMPUTERS MCQs PART 2
  8. FUNDAMENTALS OF COMPUTERS MCQs PART 1
  9. FUNDAMENTALS OF COMPUTERS MCQs PART 3
  10. Computer mcqs smaple paper 1
  11. Computer mcqs smaple paper 2
  12. Computer mcqs smaple paper 3
  13. Fundamentals of Computers
  14. Fundamentals of Computers (New) Part 1
  15. Fundamentals of Computers (New) Part 2
  16. Computer Networks MCQ Questions
  17. Computer Networks Transition from IPV4 to IPV6
  18. Computer Fundamentals (New) Part 1
  19. Computer Fundamentals (New) Part 2
  20. Computer Fundamentals (New) Part 3
  21. Computer Fundamentals (New) Part 4
  22. Computer Fundamentals (New) Part 5
  23. Computer Fundamentals (New) Part 6
  24. Computer Fundamentals (New) Part 7
  25. Computer Fundamentals (New) Part 8
  26. Operating Systems MCQs Part 1
  27. Operating Systems MCQs Part 2
  28. OS(Computer Operating Systems) Part 1
  29. OS(Computer Operating Systems) Part 2
  30. OS(Computer Operating Systems) Part 3
  31. OS(Computer Operating Systems) Part 4
  32. OS - Computer Operating Systems Part 5
  33. OS - Computer Operating Systems Part 6
  34. OS - Computer Operating Systems Part 7
  35. MS Word MCQ Questions Part 1
  36. MS Word MCQ Questions Part 2
  37. MS Word MCQ Questions Part 3
  38. MS Word MCQ Questions Part 4
  39. MS Word MCQ Questions Part 5
  40. MS Word MCQ Questions Part 7
  41. MS Word MCQ Questions Part 6
  42. Microsoft Excel MCQ Questions Part 1
  43. Microsoft Excel MCQ Questions Part 2
  44. Microsoft Excel MCQ Questions Part 3
  45. Microsoft Excel MCQ Questions Part 4
  46. Microsoft Excel MCQ Questions Part 5
  47. Microsoft Excel MCQ Questions Part 6
  48. Microsoft Excel MCQ Questions Part 7
  49. MS PowerPoint MCQ Questions PART 1
  50. MS PowerPoint MCQ Questions PART 2
  51. MS PowerPoint MCQ Questions PART 3
  52. MS PowerPoint MCQ Questions PART 4
  53. MS PowerPoint MCQ Questions PART 5
  54. MS PowerPoint MCQ Questions PART 6
  55. MS PowerPoint MCQ Questions PART 7
  56. MS Access MCQ Questions Part 1
  57. MS Access MCQ Questions Part 2
  58. MS Access MCQ Questions Part 3
  59. MS Access MCQ Questions Part 4
  60. MS Access MCQ Questions Part 5
  61. MS Access MCQ Questions Part 6
  62. MS Access MCQ Questions Part 7
  63. MS Access MCQ Questions Part 8
  64. Query of MS Access MCQS Part 1
  65. Query of MS Access MCQS Part 2
  66. Computer Communication and Networking Quiz
  67. Computer Graphics MCQ Quiz Questions and Answers
  68. Computer Basics Quiz Questions
  69. Computer Quiz Questions with Answers
  70. Computer Hardware MCQS Quiz
  71. MCQ Computer Organization & Architecture
  72. MCQ Computer Organisation - Input & output Organisation SET1
  73. MCQ Computer Organisation - Input & output Organisation SET2
  74. MCQ Computer Organisation - Input & output Organisation SET3
  75. MCQS on addressing modes SET 1
  76. MCQS on addressing modes SET 2
  77. Software Engineering MCQs SET 1
  78. Software Engineering MCQs SET 2
  79. Software Engineering MCQs Set 3
  80. Software Engineering MCQs Set 4
  81. Software Engineering MCQs Set 5
  82. Software Engineering MCQs Set 6
  83. Software Engineering MCQs Set 7
  84. mcqs data structures
  85. CCC Exam Sample MCQ Paper
  86. Computer MCQ Questions set-1
  87. Computer MCQ Questions set-2
  88. Computer MCQ Questions set-3
  89. Current affairs mcq Database management
  90. Programming arcitecture
  91. Computer Graphics MCQ Questions part 1
  92. Computer Graphics MCQ Questions part 2
  93. Computer Awareness MCQs and Quiz for Banking, IBPS, RRB, RBI, SBI Exams pART 1
  94. Computer Awareness MCQs and Quiz for Banking, IBPS, RRB, RBI, SBI Exams pART 2
  95. Computer Science MCQs
  96. Computer Mcq Question
  97. MCQs based on Fundamentals of Computer 1 set
  98. Computer Mcq Question set 2
  99. MCQ Encoding Schemes
  100. Data Entry and Keyboarding Skills MCQ
  101. Computer Science Number System
  102. Computer Network MCQ
  103. MCQ Questions on Tally
  104. MCQ Questions on Tally Set 2
  105. MCQ Questions on Tally Set 3
  106. MCQ Questions on Tally Set 4
  107. Internet Technology MCQ Questions for Competitive Exams
  108. Computer Software MCQ GK Questions
  109. Computer Organization and Architecture MCQs
  110. Basic Computer GK Questions
  111. Computer Graphics MCQ Set 1
  112. Operating System MCQ Set 1
  113. Operating System MCQ Set 2
  114. Operating System MCQ Set 3
  115. Operating System MCQ Set 4
  116. Operating System MCQ Set 5
  117. Operating System MCQ Set 6
  118. Operating System MCQ Set 7
  119. Operating System MCQ Set 8
  120. Operating System MCQ Set 9
  121. Operating System MCQ Set 10
  122. Operating System MCQ Set 11
  123. Operating System MCQ Set 12
  124. Operating System MCQ Set 13
  125. Operating System MCQ Set 14
  126. Operating System MCQ Set 15
  127. Operating System MCQ Set 16
  128. Operating System MCQ Set 17
  129. Operating System MCQ Set 18
  130. Operating System MCQ Set 19
  131. Operating System MCQ Set 20
  132. Operating System MCQ Set 21
  133. Computer Graphics MCQ Question Set 1
  134. Computer Networks MCQs
  135. Computer Networks MCQs Set-2
  136. Computer Networks MCQs Set-3
  137. Computer Networks MCQs Set-4
  138. Bachelor of Computer Applications MCQs set-1
  139. Bachelor of Computer Applications MCQs set-2
  140. NET Programming MCQ
  141. Artificial Intelligence and Robotics (AIR) Set 1
  142. Artificial Intelligence and Robotics (AIR) Set 2
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!