MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 301. |
The functions of execution and sequencing are performed by using |
| A. | input signals |
| B. | output signals |
| C. | control signals |
| D. | cpu |
| Answer» D. cpu | |
| 302. |
A FIFO replacement algorithm associates with each page the |
| A. | time it was brought into memory |
| B. | size of the page in memory |
| C. | page after and before it |
| D. | all of the mentioned |
| Answer» B. size of the page in memory | |
| 303. |
A binary semaphore is a semaphore with integer values |
| A. | 1 |
| B. | -1 c) 0.8 d) 0.5 |
| Answer» B. -1 c) 0.8 d) 0.5 | |
| 304. |
If exec is called immediately after forking |
| A. | the program specified in the parameter to exec will replace the entire process |
| B. | all the threads will be duplicated |
| C. | all the threads may be duplicated |
| D. | none of the mentioned |
| Answer» B. all the threads will be duplicated | |
| 305. |
In mapping, the data can be mapped anywhere in the Cache Memory. |
| A. | associative |
| B. | direct |
| C. | set associative |
| D. | indirect |
| Answer» B. direct | |
| 306. |
Cascading termination refers to termination of all child processes before the parent terminates |
| A. | normally |
| B. | abnormally |
| C. | normally or abnormally |
| D. | none of the mentioned |
| Answer» B. abnormally | |
| 307. |
A single thread of control allows the process to perform |
| A. | only one task at a time |
| B. | multiple tasks at a time |
| C. | only two tasks at a time |
| D. | all of the mentioned |
| Answer» B. multiple tasks at a time | |
| 308. |
The set of tracks that are at one arm position make up a |
| A. | magnetic disks |
| B. | electrical disks |
| C. | assemblies |
| D. | cylinders |
| Answer» E. | |
| 309. |
The usefulness of signals as a general inter process communication mechanism is limited because |
| A. | they do not work between processes |
| B. | they are user generated |
| C. | they cannot carry information directly |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 310. |
An asynchronous call |
| A. | returns immediately, without waiting for the i/o to complete |
| B. | does not return immediately and waits for the i/o to complete |
| C. | consumes a lot of time |
| D. | is too slow |
| Answer» B. does not return immediately and waits for the i/o to complete | |
| 311. |
If the wait for graph contains a cycle |
| A. | then a deadlock does not exist |
| B. | then a deadlock exists |
| C. | then the system is in a safe state |
| D. | either deadlock exists or system is in a safe state |
| Answer» C. then the system is in a safe state | |
| 312. |
Which of the following system calls transforms executable binary file into a process? |
| A. | fork |
| B. | exec |
| C. | ioctl |
| D. | longjmp |
| Answer» C. ioctl | |
| 313. |
The is used by device controllers to request service. |
| A. | nonmaskable interrupt |
| B. | blocked interrupt |
| C. | maskable interrupt |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 314. |
When the head damages the magnetic surface, it is known as |
| A. | disk crash |
| B. | head crash |
| C. | magnetic damage |
| D. | all of the mentioned |
| Answer» C. magnetic damage | |
| 315. |
What are the two kinds of semaphores? |
| A. | mutex & counting |
| B. | binary & counting |
| C. | counting & decimal |
| D. | decimal & binary |
| Answer» C. counting & decimal | |
| 316. |
Swapping requires a |
| A. | motherboard |
| B. | keyboard |
| C. | monitor |
| D. | backing store |
| Answer» E. | |
| 317. |
What is the idea behind thread pools? |
| A. | a number of threads are created at process startup and placed in a pool where they sit and wait for work |
| B. | when a process begins, a pool of threads is chosen from the many existing and each thread is allotted equal amount of work |
| C. | all threads in a pool distribute the task equally among themselves |
| D. | none of the mentioned |
| Answer» B. when a process begins, a pool of threads is chosen from the many existing and each thread is allotted equal amount of work | |
| 318. |
In internal fragmentation, memory is internal to a partition and |
| A. | is being used |
| B. | is not being used |
| C. | is always used |
| D. | none of the mentioned |
| Answer» C. is always used | |
| 319. |
_____ is the concept in which a process is copied into main memory from the secondarymemory according to the requirement. |
| A. | Paging |
| B. | Demand paging |
| C. | Segmentation |
| D. | Swapping |
| Answer» C. Segmentation | |
| 320. |
The present a uniform device- access interface to the I/O subsystem, much as system calls provide a standard interface between the application and the operating system. |
| A. | devices |
| B. | buses |
| C. | device drivers |
| D. | i/o systems |
| Answer» D. i/o systems | |
| 321. |
Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section |
| A. | after a process has made a request to enter its critical section and before the request is granted |
| B. | when another process is in its critical section |
| C. | before a process has made a request to enter its critical section |
| D. | none of the mentioned |
| Answer» B. when another process is in its critical section | |
| 322. |
The swaps processes in and out of the memory. |
| A. | Memory Manager |
| B. | CPU |
| C. | CPU Manager |
| D. | User |
| Answer» B. CPU | |
| 323. |
Which of the following condition is required for a deadlock to be possible? |
| A. | mutual exclusion |
| B. | a process may hold allocated resources while awaiting assignment of other resources |
| C. | no resource can be forcibly removed from a process holding it |
| D. | all of the mentioned |
| Answer» E. | |
| 324. |
Physical memory is broken into fixed-sized blocks called |
| A. | frames |
| B. | pages |
| C. | backing store |
| D. | none of the mentioned |
| Answer» B. pages | |
| 325. |
HLDA stands for |
| A. | high level data |
| B. | high level data acknowledgment |
| C. | hold acknowledgement |
| D. | hold data |
| Answer» D. hold data | |
| 326. |
A monitor is a type of |
| A. | semaphore |
| B. | low level synchronization construct |
| C. | high level synchronization construct |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 327. |
Signals of a given type |
| A. | are queued |
| B. | are all sent as one |
| C. | cannot be queued |
| D. | none of the mentioned |
| Answer» C. cannot be queued | |
| 328. |
Logical memory is broken into blocks of the same size called |
| A. | frames |
| B. | pages |
| C. | backing store |
| D. | none of the mentioned |
| Answer» C. backing store | |
| 329. |
The number of resources requested by a process |
| A. | must always be less than the total number of resources available in the system |
| B. | must always be equal to the total number of resources available in the system |
| C. | must not exceed the total number of resources available in the system |
| D. | must exceed the total number of resources available in the system |
| Answer» D. must exceed the total number of resources available in the system | |
| 330. |
The maintains pending and blocked bit vectors in the context of each process. |
| A. | cpu |
| B. | memory |
| C. | process |
| D. | kernel |
| Answer» E. | |
| 331. |
In paged memory systems, if the page size is increased, then the internal fragmentation generally |
| A. | becomes less |
| B. | becomes more |
| C. | remains constant |
| D. | none of the mentioned |
| Answer» C. remains constant | |
| 332. |
The two ways of aborting processes and eliminating deadlocks are |
| A. | abort all deadlocked processes |
| B. | abort all processes |
| C. | abort one process at a time until the deadlock cycle is eliminated |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 333. |
In most cases, if a process is sent a signal while it is executing a system call |
| A. | the system call will continue execution and the signal will be ignored completely |
| B. | the system call is interrupted by the signal, and the signal handler comes in |
| C. | the signal has no effect until the system call completes |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 334. |
In UNIX, each process is identified by its |
| A. | process control block |
| B. | device queue |
| C. | process identifier |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 335. |
The are reserved for events such as unrecoverable memory errors. |
| A. | non maskable interrupts |
| B. | blocked interrupts |
| C. | maskable interrupts |
| D. | none of the mentioned |
| Answer» B. blocked interrupts | |
| 336. |
A page fault occurs when? |
| A. | a page gives inconsistent data |
| B. | a page cannot be accessed due to its absence from memory |
| C. | a page is invisible |
| D. | all of the mentioned |
| Answer» C. a page is invisible | |
| 337. |
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 |
| A. | data consistency |
| B. | race condition |
| C. | aging |
| D. | starvation |
| Answer» C. aging | |
| 338. |
The bounded buffer problem is also known as |
| A. | readers – writers problem |
| B. | dining – philosophers problem |
| C. | producer – consumer problem |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 339. |
The content of the matrix Need is |
| A. | allocation – available |
| B. | max – available |
| C. | max – allocation |
| D. | allocation – max |
| Answer» D. allocation – max | |
| 340. |
The kernel is of user threads. |
| A. | a part of |
| B. | the creator of |
| C. | unaware of |
| D. | aware of |
| Answer» D. aware of | |
| 341. |
What will happen if a non-recursive mutex is locked more than once? |
| A. | starvation |
| B. | deadlock |
| C. | aging |
| D. | signaling |
| Answer» C. aging | |
| 342. |
What is Thread cancellation? |
| A. | the task of destroying the thread once its work is done |
| B. | the task of removing a thread once its work is done |
| C. | the task of terminating a thread before it has completed |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 343. |
When the memory allocated to a process is slightly larger than the process, then |
| A. | internal fragmentation occurs |
| B. | external fragmentation occurs |
| C. | both internal and external fragmentation occurs |
| D. | neither internal nor external fragmentation occurs |
| Answer» B. external fragmentation occurs | |
| 344. |
A Process Control Block(PCB) does not contain which of the following? |
| A. | Code |
| B. | Stack |
| C. | Bootstrap Program |
| D. | Data |
| Answer» D. Data | |
| 345. |
Because the kernel thread management is done by the Operating System itself |
| A. | kernel threads are faster to create than user threads |
| B. | kernel threads are slower to create than user threads |
| C. | kernel threads are easier to manage as well as create then user threads |
| D. | none of the mentioned |
| Answer» C. kernel threads are easier to manage as well as create then user threads | |
| 346. |
Swapping be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers. |
| A. | must |
| B. | can |
| C. | must never |
| D. | maybe |
| Answer» D. maybe | |
| 347. |
Using transient code, the size of the operating system during program execution. |
| A. | increases |
| B. | decreases |
| C. | changes |
| D. | maintains |
| Answer» D. maintains | |
| 348. |
The valid – invalid bit, in this case, when valid indicates? |
| A. | the page is not legal |
| B. | the page is illegal |
| C. | the page is in memory |
| D. | the page is not in memory |
| Answer» D. the page is not in memory | |
| 349. |
A set of hard disk drives with a controller mounted in a single box, forming a single large storage unit is |
| A. | disk array |
| B. | drives |
| C. | compact drives |
| D. | multi-cores |
| Answer» B. drives | |
| 350. |
A thread is also called |
| A. | light weight process(lwp) |
| B. | heavy weight process(hwp) |
| C. | process |
| D. | none of the mentioned |
| Answer» B. heavy weight process(hwp) | |