MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 37 Mcqs, each offering curated multiple-choice questions to sharpen your Data Mining knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which one is a memory-management scheme that permits the physical address space of a process to be noncontiguous |
| A. | scheduling |
| B. | swapping |
| C. | paging |
| D. | segmentation |
| Answer» D. segmentation | |
| 2. |
The total transfer time is __ to the amount of memory swapped |
| A. | directly proportional |
| B. | indirectly proportional |
| C. | equal |
| D. | None of the above |
| Answer» B. indirectly proportional | |
| 3. |
Whenever the CPU scheduler decides to execute a process, it calls the |
| A. | Dispatcher |
| B. | Scheduler |
| C. | Performer |
| D. | None of the above |
| Answer» B. Scheduler | |
| 4. |
The run-time mapping from virtual to physical addresses is done by a hardware device called |
| A. | Process Management Unit |
| B. | CPU Management Unit |
| C. | Memory Management Unit |
| D. | Event Management Unit |
| Answer» D. Event Management Unit | |
| 5. |
__ is solved by Dijkstra’s banking algorithm |
| A. | Deadlock recurrence |
| B. | Deadlock avoidance |
| C. | Deadlock exclusion |
| D. | Deadlock recovery |
| Answer» C. Deadlock exclusion | |
| 6. |
In deadlock,only one process at a time can use the resource,this condition is called |
| A. | Single exclusion |
| B. | Exclusive exclusion |
| C. | Smart exclusion |
| D. | Mutual exclusion |
| Answer» E. | |
| 7. |
Which one is an example of race condition |
| A. | Simple Switch |
| B. | Light Switch |
| C. | Smart Switch |
| D. | Enterprise Switch |
| Answer» C. Smart Switch | |
| 8. |
Which one operation signifies that the transaction has terminated its execution |
| A. | Commit |
| B. | Abort |
| C. | Hang |
| D. | Modify |
| Answer» B. Abort | |
| 9. |
A collection of instructions (or operations) that performs a single logical function is called a |
| A. | Job |
| B. | Events |
| C. | Transaction |
| D. | Schedule |
| Answer» D. Schedule | |
| 10. |
Binary semaphores are also known as |
| A. | Simple locks |
| B. | Boolean locks |
| C. | Mutex locks |
| D. | Simplex lock |
| Answer» D. Simplex lock | |
| 11. |
The value of a binary semaphore can range between |
| A. | 0 and 1 |
| B. | -1 and 1 |
| C. | 1 and 2 |
| D. | 0 and 2 |
| Answer» B. -1 and 1 | |
| 12. |
A __ is a technique for passing information from one program process to another |
| A. | job |
| B. | pipe |
| C. | user |
| D. | network |
| Answer» C. user | |
| 13. |
Two general approaches are used to handle critical sections in operating systems which are preemptive and nonpreemptive __ |
| A. | user |
| B. | kernels |
| C. | pipes |
| D. | memory |
| Answer» C. pipes | |
| 14. |
Push migration and pull migration are two types of __ approach |
| A. | Load balancing |
| B. | Processor Affinity |
| C. | Symmetric Multithreading |
| D. | Synchronous Multithreading |
| Answer» B. Processor Affinity | |
| 15. |
Which one scheduling algorithm is designed especially for time sharing systems |
| A. | First-come, first-served scheduling |
| B. | Shortest Remaining time |
| C. | Preemptive priority Scheduling |
| D. | Round-robin scheduling |
| Answer» E. | |
| 16. |
A solution to the problem of starvation of low-priority processes is |
| A. | Aging |
| B. | Deadlock |
| C. | Scheduling |
| D. | Priority |
| Answer» B. Deadlock | |
| 17. |
Which one is a major problem with priority scheduling algorithm |
| A. | Restriction |
| B. | Timing |
| C. | Starvation |
| D. | Differentiation |
| Answer» D. Differentiation | |
| 18. |
The target thread periodically checks whether it should terminate, allowing it an opportunity to terminate itself in an orderly fashion is __ cancellation |
| A. | Deferred |
| B. | Random |
| C. | Synchronous |
| D. | Multithread |
| Answer» B. Random | |
| 19. |
The approach in which one thread immediately terminates the target thread is known as __ cancellation |
| A. | Deferred |
| B. | Asynchronous |
| C. | Synchronous |
| D. | Multithread |
| Answer» C. Synchronous | |
| 20. |
The many-to-one model maps many user-level threads to one |
| A. | Kernel thread |
| B. | User thread |
| C. | Memory thread |
| D. | Batch thread |
| Answer» B. User thread | |
| 21. |
When a process terminates then all its children must also be terminated. This phenomenon is called |
| A. | Progressive termination |
| B. | Recursive termination |
| C. | Cascading termination |
| D. | Followup termination |
| Answer» D. Followup termination | |
| 22. |
Long term scheduler are also known as |
| A. | CPU scheduler |
| B. | Job scheduler |
| C. | Device scheduler |
| D. | Event scheduler |
| Answer» C. Device scheduler | |
| 23. |
The list of processes waiting for a particular I/0 device is called a |
| A. | Device list |
| B. | Device pool |
| C. | Device queue |
| D. | Device state |
| Answer» D. Device state | |
| 24. |
When the instructions are being executed, this state is known as |
| A. | New |
| B. | Ready |
| C. | Waiting |
| D. | Running |
| Answer» E. | |
| 25. |
There are two types of interproccess communication, __ and __ |
| A. | message receiving, dedicated memory |
| B. | message passing,shared memory |
| C. | information sharing, primary memory |
| D. | message passing, dedicated memory |
| Answer» C. information sharing, primary memory | |
| 26. |
A control card is a __ system concept |
| A. | time-sharing |
| B. | network |
| C. | batch |
| D. | distributed |
| Answer» D. distributed | |
| 27. |
The number of bytes read during the last read is known as __ bytesRead |
| A. | HANDLE |
| B. | DWORD |
| C. | LPDWORD |
| D. | LPOVERLAPPED |
| Answer» D. LPOVERLAPPED | |
| 28. |
A buffer where the data will be read into and written from is |
| A. | LPVOID Buffer |
| B. | LPOut Buffer |
| C. | LPIN Buffer |
| D. | LBLOCK Buffer |
| Answer» B. LPOut Buffer | |
| 29. |
Which mode bit is used to indicate user mode |
| A. | -1 |
| B. | 1 |
| C. | 3 |
| D. | 5 |
| Answer» C. 3 | |
| 30. |
Which mode bit is used to indicate kernel mode |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» B. 1 | |
| 31. |
There are two types of separate mode of operation in OS, __ mode and __ mode |
| A. | process, kernel |
| B. | system, process |
| C. | user, kernel |
| D. | user, system |
| Answer» D. user, system | |
| 32. |
Jobs are kept initially on the disk in the |
| A. | Schedule pool |
| B. | Process pool |
| C. | System pool |
| D. | Job pool |
| Answer» E. | |
| 33. |
Main memory commonly is implemented in a semiconductor technology called |
| A. | MRAM |
| B. | SDRAM |
| C. | DRAM |
| D. | PRAM |
| Answer» D. PRAM | |
| 34. |
General-purpose computers run most of their programs from rewritable memory, called |
| A. | Main memory |
| B. | Secondary memory |
| C. | Peripheral memory |
| D. | Primary memory |
| Answer» B. Secondary memory | |
| 35. |
System call is also known as |
| A. | Monitor call |
| B. | CPU call |
| C. | Execution call |
| D. | Process call |
| Answer» B. CPU call | |
| 36. |
Software may trigger an interrupt by executing a special operation called a |
| A. | Recovery call |
| B. | System call |
| C. | Process call |
| D. | Package call |
| Answer» C. Process call | |
| 37. |
__ acts as an intermediary between the computer user and the computer hardware |
| A. | Software |
| B. | Mainframe |
| C. | ROM |
| D. | Operating System |
| Answer» E. | |