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.
| 1051. |
A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is : |
| A. | 8 |
| B. | 10 |
| C. | 9 |
| D. | 7 |
| Answer» D. 7 | |
| 1052. |
Which of the following page replacement algorithms suffers from Belady’s Anomaly ? |
| A. | Optimal replacement |
| B. | LRU |
| C. | FIFO |
| D. | Both optimal replacement and FIFO |
| Answer» D. Both optimal replacement and FIFO | |
| 1053. |
Locality of reference implies that the page reference being made by a process : |
| A. | will always be to the page used in the previous page reference |
| B. | is likely to be one of the pages used in the last few page references |
| C. | will always be one of the pages existing in memory |
| D. | will always lead to page faults |
| Answer» C. will always be one of the pages existing in memory | |
| 1054. |
When the page fault rate is low : |
| A. | the turnaround time increases |
| B. | the effective access time increases |
| C. | the effective access time decreases |
| D. | turnaround time & effective access time increases |
| Answer» D. turnaround time & effective access time increases | |
| 1055. |
If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 |
| A. | p x ma + (1-p) x page fault time |
| B. | ma + page fault time |
| C. | (1-p) x ma + p x page fault time |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1056. |
When a process begins execution with no pages in memory : |
| A. | process execution becomes impossible |
| B. | a page fault occurs for every page brought into memory |
| C. | process causes system crash |
| D. | none of the mentioned |
| Answer» C. process causes system crash | |
| 1057. |
When a page fault occurs, the state of the interrupted process is : |
| A. | disrupted |
| B. | invalid |
| C. | saved |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1058. |
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 | |
| 1059. |
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 | |
| 1060. |
Using a pager : |
| A. | increases the swap time |
| B. | decreases the swap time |
| C. | decreases the swap time & amount of physical memory needed |
| D. | increases the amount of physical memory needed |
| Answer» D. increases the amount of physical memory needed | |
| 1061. |
A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process. |
| A. | the entire process, parts |
| B. | all the pages of a process, segments |
| C. | the entire process, pages |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1062. |
Segment replacement algorithms are more complex than page replacement algorithms because : |
| A. | Segments are better than pages |
| B. | Pages are better than segments |
| C. | Segments have variable sizes |
| D. | Segments have fixed sizes |
| Answer» D. Segments have fixed sizes | |
| 1063. |
Virtual memory is normally implemented by ________ |
| A. | demand paging |
| B. | buses |
| C. | virtualization |
| D. | all of the mentioned |
| Answer» B. buses | |
| 1064. |
In virtual memory. the programmer __________ of overlays. |
| A. | has to take care |
| B. | does not have to take care |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 1065. |
The ability to execute a program that is only partially in memory has benefits like : |
| A. | The amount of physical memory cannot put a constraint on the program |
| B. | Programs for an extremely large virtual space can be created |
| C. | Throughput increases |
| D. | All of the mentioned |
| Answer» E. | |
| 1066. |
Error handler codes, to handle unusual errors are : |
| A. | almost never executed |
| B. | executed very often |
| C. | executed periodically |
| D. | none of the mentioned |
| Answer» B. executed very often | |
| 1067. |
The instruction being executed, must be in : |
| A. | physical memory |
| B. | logical memory |
| C. | physical & logical memory |
| D. | none of the mentioned |
| Answer» B. logical memory | |
| 1068. |
Virtual memory allows : |
| A. | execution of a process that may not be completely in memory |
| B. | a program to be smaller than the physical memory |
| C. | a program to be larger than the secondary storage |
| D. | execution of a process without being in physical memory |
| Answer» B. a program to be smaller than the physical memory | |
| 1069. |
A process is thrashing if |
| A. | it is spending more time paging than executing |
| B. | it is spending less time paging than executing |
| C. | page fault occurs |
| D. | swapping can not take place |
| Answer» B. it is spending less time paging than executing | |
| 1070. |
Effective access time is directly proportional to |
| A. | page-fault rate |
| B. | hit ratio |
| C. | memory access time |
| D. | none of the mentioned |
| Answer» B. hit ratio | |
| 1071. |
Swap space exists in |
| A. | primary memory |
| B. | secondary memory |
| C. | cpu |
| D. | none of the mentioned |
| Answer» C. cpu | |
| 1072. |
The number of the threads in the pool can be decided on factors such as : |
| A. | number of CPUs in the system |
| B. | amount of physical memory |
| C. | expected number of concurrent client requests |
| D. | all of the mentioned |
| Answer» E. | |
| 1073. |
Thread pools limit the number of threads that exist at any one point, hence : |
| A. | not letting the system resources like CPU time and memory exhaust |
| B. | helping a limited number of processes at a time |
| C. | not serving all requests and ignoring many |
| D. | none of the mentioned |
| Answer» B. helping a limited number of processes at a time | |
| 1074. |
Thread pools help in : |
| A. | servicing multiple requests using one thread |
| B. | servicing a single request using multiple threads from the pool |
| C. | faster servicing of requests with an existing thread rather than waiting to create a new thread |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1075. |
If the thread pool contains no available thread : |
| A. | the server runs a new process |
| B. | the server goes to another thread pool |
| C. | the server demands for a new pool creation |
| D. | the server waits until one becomes free |
| Answer» E. | |
| 1076. |
The idea behind thread pools is : |
| 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 | |
| 1077. |
Each connection arriving at multi threaded servers via network is generally : |
| A. | is directly put into the blocking queue |
| B. | is wrapped as a task and passed on to a thread pool |
| C. | is kept in a normal queue and then sent to the blocking queue from where it is dequeued |
| D. | none of the mentioned |
| Answer» C. is kept in a normal queue and then sent to the blocking queue from where it is dequeued | |
| 1078. |
Instead of starting a new thread for every task to execute concurrently, the task can be passed to a ___________ |
| A. | process |
| B. | thread pool |
| C. | thread queue |
| D. | none of the mentioned |
| Answer» C. thread queue | |
| 1079. |
Thread pools are useful when : |
| A. | when we need to limit the number of threads running in the application at the same time |
| B. | when we need to limit the number of threads running in the application as a whole |
| C. | when we need to arrange the ordering of threads |
| D. | none of the mentioned |
| Answer» B. when we need to limit the number of threads running in the application as a whole | |
| 1080. |
In UNIX, the _____ system call is used to send a signal. |
| A. | sig |
| B. | send |
| C. | kill |
| D. | sigsend |
| Answer» D. sigsend | |
| 1081. |
A process can never be sure that a signal it has sent _____________ |
| A. | has which identifier |
| B. | has not been lost |
| C. | has been sent |
| D. | all of the mentioned |
| Answer» C. has been sent | |
| 1082. |
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 | |
| 1083. |
In UNIX, the abort() function sends the ________ signal to the calling process, causing abnormal termination. |
| A. | SIGTERM |
| B. | SIGSTOP |
| C. | SIGABORT |
| D. | SIGABRT |
| Answer» E. | |
| 1084. |
The usual effect of abnormal termination of a program is : |
| A. | core dump file generation |
| B. | system crash |
| C. | program switch |
| D. | signal destruction |
| Answer» B. system crash | |
| 1085. |
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 | |
| 1086. |
In UNIX, the set of masked signals can be set or cleared using the ________ function. |
| A. | sigmask |
| B. | sigmaskproc |
| C. | sigprocmask |
| D. | sigproc |
| Answer» D. sigproc | |
| 1087. |
The _______ maintains pending and blocked bit vectors in context of each process. |
| A. | CPU |
| B. | Memory |
| C. | Process |
| D. | Kernel |
| Answer» E. | |
| 1088. |
When a process blocks the receipt of certain signals : |
| A. | The signals are delivered |
| B. | The signals are not delivered |
| C. | The signals are received until they are unblocked |
| D. | The signals are received by the process once they are delivered |
| Answer» B. The signals are not delivered | |
| 1089. |
Signals are identified by : |
| A. | signal identifiers |
| B. | signal handlers |
| C. | signal actions |
| D. | none of the mentioned |
| Answer» B. signal handlers | |
| 1090. |
The three ways in which a process responds to a signal are : |
| A. | ignoring the signal |
| B. | handling the signal |
| C. | performing some default action |
| D. | all of the mentioned |
| Answer» E. | |
| 1091. |
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 | |
| 1092. |
Which of the following is not TRUE : |
| A. | Processes may send each other signals |
| B. | Kernel may send signals internally |
| C. | a field is updated in the signal table when the signal is sent |
| D. | each signal is maintained by a single bit |
| Answer» D. each signal is maintained by a single bit | |
| 1093. |
Signals that occur at the same time, are presented to the process : |
| A. | one at a time, in a particular order |
| B. | one at a time, in no particular order |
| C. | all at a time |
| D. | none of the mentioned |
| Answer» C. all at a time | |
| 1094. |
If multiple threads are concurrently searching through a database and one thread returns the result then the remaining threads must be : |
| A. | continued |
| B. | cancelled |
| C. | protected |
| D. | none of the mentioned |
| Answer» C. protected | |
| 1095. |
Cancellation point is the point where : |
| A. | the thread can be cancelled – safely or otherwise doesn’t matter |
| B. | the thread can be cancelled safely |
| C. | the whole process can be cancelled safely |
| D. | none of the mentioned |
| Answer» C. the whole process can be cancelled safely | |
| 1096. |
Cancelling a thread asynchronously : |
| A. | frees all the resources properly |
| B. | may not free each resource |
| C. | spoils the process execution |
| D. | none of the mentioned |
| Answer» C. spoils the process execution | |
| 1097. |
When the target thread periodically checks if it should terminate and terminates itself in an orderly manner, it is called : |
| A. | Asynchronous cancellation |
| B. | Systematic cancellation |
| C. | Sudden Termination |
| D. | Deferred cancellation |
| Answer» E. | |
| 1098. |
When one thread immediately terminates the target thread, it is called : |
| A. | Asynchronous cancellation |
| B. | Systematic cancellation |
| C. | Sudden Termination |
| D. | Deferred cancellation |
| Answer» B. Systematic cancellation | |
| 1099. |
When a web page is loading, and the user presses a button on the browser to stop loading the page : |
| A. | the thread loading the page continues with the loading |
| B. | the thread loading the page does not stop, but continues with another task |
| C. | the thread loading the page is paused |
| D. | the thread loading the page is cancelled |
| Answer» E. | |
| 1100. |
Thread cancellation is : |
| 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 | |