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.
| 1101. |
If a process does not call exec after forking, |
| A. | the program specified in the parameter to exec will replace the entire process |
| B. | all the threads should be duplicated |
| C. | all the threads should not be duplicated |
| D. | none of the mentioned |
| Answer» C. all the threads should not be duplicated | |
| 1102. |
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 | |
| 1103. |
If a thread invokes the exec system call, |
| A. | only the exec executes as a separate process. |
| B. | the program specified in the parameter to exec will replace the entire process |
| C. | the exec is ignored as it is invoked by a thread. |
| D. | none of the mentioned |
| Answer» C. the exec is ignored as it is invoked by a thread. | |
| 1104. |
A fork system call will fail if : |
| A. | the previously executed statement is also a fork call |
| B. | the limit on the maximum number of processes in the system would be executed |
| C. | the limit on the minimum number of processes that can be under execution by a single user would be executed |
| D. | all of the mentioned |
| Answer» C. the limit on the minimum number of processes that can be under execution by a single user would be executed | |
| 1105. |
Which of the following calls never returns an error ? |
| A. | getpid |
| B. | fork |
| C. | ioctl |
| D. | open |
| Answer» B. fork | |
| 1106. |
Which of the following system calls transforms executable binary file into a process ? |
| A. | fork |
| B. | exec |
| C. | ioctl |
| D. | longjmp |
| Answer» C. ioctl | |
| 1107. |
Which of the following system calls does not return control to the calling point, on termination ? |
| A. | fork |
| B. | exec |
| C. | ioctl |
| D. | longjmp |
| Answer» C. ioctl | |
| 1108. |
In the Many to Many model when a thread performs a blocking system call : |
| A. | other threads are strictly prohibited from running |
| B. | other threads are allowed to run |
| C. | other threads only from other processes are allowed to run |
| D. | none of the mentioned |
| Answer» C. other threads only from other processes are allowed to run | |
| 1109. |
In the Many to Many model true concurrency cannot be gained because : |
| A. | the kernel can schedule only one thread at a time |
| B. | there are too many threads to handle |
| C. | it is hard to map threads with each other |
| D. | None of the mentioned |
| Answer» B. there are too many threads to handle | |
| 1110. |
In the One to One model when a thread makes a blocking system call : |
| A. | other threads are strictly prohibited from running |
| B. | other threads are allowed to run |
| C. | other threads only from other processes are allowed to run |
| D. | none of the mentioned |
| Answer» C. other threads only from other processes are allowed to run | |
| 1111. |
The One to One model allows : |
| A. | increased concurrency |
| B. | decreased concurrency |
| C. | increased or decreased concurrency |
| D. | concurrency equivalent to other models |
| Answer» B. decreased concurrency | |
| 1112. |
In the Many to One model, multiple threads are unable to run in parallel on multiprocessors because : |
| A. | only one thread can access the kernel at a time |
| B. | many user threads have access to just one kernel thread |
| C. | there is only one kernel thread |
| D. | none of the mentioned |
| Answer» B. many user threads have access to just one kernel thread | |
| 1113. |
In the Many to One model, if a thread makes a blocking system call : |
| A. | the entire process will be blocked |
| B. | a part of the process will stay blocked, with the rest running |
| C. | the entire process will run |
| D. | none of the mentioned |
| Answer» B. a part of the process will stay blocked, with the rest running | |
| 1114. |
The model in which one user-level thread is mapped to many kernel level threads is called : |
| A. | Many to One model |
| B. | One to Many model |
| C. | Many to Many model |
| D. | One to One model |
| Answer» C. Many to Many model | |
| 1115. |
Which of the following is FALSE ? |
| A. | Context switch time is longer for kernel level threads than for user level threads |
| B. | User level threads do not need any hardware support |
| C. | Related kernel level threads can be scheduled on different processors in a multiprocessor system |
| D. | Blocking one kernel level thread blocks all other related threads |
| Answer» E. | |
| 1116. |
If a kernel thread performs a blocking system call, ____________ |
| A. | the kernel can schedule another thread in the application for execution |
| B. | the kernel cannot schedule another thread in the same application for execution |
| C. | the kernel must schedule another thread of a different application for execution |
| D. | the kernel must schedule another thread of the same application on a different processor |
| Answer» B. the kernel cannot schedule another thread in the same application for execution | |
| 1117. |
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 | |
| 1118. |
If the kernel is single threaded, then any user level thread performing a blocking system call will : |
| A. | cause the entire process to run along with the other threads |
| B. | cause the thread to block with the other threads running |
| C. | cause the entire process to block even if the other threads are available to run |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1119. |
The kernel is _______ of user threads. |
| A. | a part of |
| B. | the creator of |
| C. | unaware of |
| D. | aware of |
| Answer» D. aware of | |
| 1120. |
Multithreading on a multi – CPU machine : |
| A. | decreases concurrency |
| B. | increases concurrency |
| C. | doesn’t affect the concurrency |
| D. | can increase or decrease the concurrency |
| Answer» C. doesn’t affect the concurrency | |
| 1121. |
Resource sharing helps : |
| A. | share the memory and resources of the process to which the threads belong |
| B. | an application have several different threads of activity all within the same address space |
| C. | reduce the address space that a process could potentially use |
| D. | all of the mentioned |
| Answer» E. | |
| 1122. |
Multithreading an interactive program will increase responsiveness to the user by : |
| A. | continuing to run even if a part of it is blocked |
| B. | waiting for one part to finish before the other begins |
| C. | asking the user to decide the order of multithreading |
| D. | none of the mentioned |
| Answer» B. waiting for one part to finish before the other begins | |
| 1123. |
A process having multiple threads of control implies : |
| A. | it can do more than one task at a time |
| B. | it can do only one task at a time, but much faster |
| C. | it has to use only one thread per process |
| D. | none of the mentioned |
| Answer» B. it can do only one task at a time, but much faster | |
| 1124. |
A heavy weight process : |
| A. | has multiple threads of execution |
| B. | has a single thread of execution |
| C. | can have multiple or a single thread for execution |
| D. | none of the mentioned |
| Answer» C. can have multiple or a single thread for execution | |
| 1125. |
A thread shares its resources(like data section, code section, open files, signals) with : |
| A. | other process similar to the one that the thread belongs to |
| B. | other threads that belong to similar processes |
| C. | other threads that belong to the same process |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 1126. |
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) | |
| 1127. |
Thread synchronization is required because |
| A. | all threads of a process share the same address space |
| B. | all threads of a process share the same global variables |
| C. | all threads of a process can share the same files |
| D. | all of the mentioned |
| Answer» E. | |
| 1128. |
The register context and stacks of a thread are deallocated when the thread |
| A. | terminates |
| B. | blocks |
| C. | unblocks |
| D. | spawns |
| Answer» B. blocks | |
| 1129. |
Which one of the following is not a valid state of a thread? |
| A. | running |
| B. | parsing |
| C. | ready |
| D. | blocked |
| Answer» C. ready | |
| 1130. |
Termination of the process terminates |
| A. | first thread of the process |
| B. | first two threads of the process |
| C. | all threads within the process |
| D. | no thread within the process |
| Answer» D. no thread within the process | |
| 1131. |
The jacketing technique is used to |
| A. | convert a blocking system call into non blocking system call |
| B. | create a new thread |
| C. | communicate between threads |
| D. | terminate a thread |
| Answer» B. create a new thread | |
| 1132. |
When the event for which a thread is blocked occurs, |
| A. | thread moves to the ready queue |
| B. | thread remains blocked |
| C. | thread completes |
| D. | a new thread is provided |
| Answer» B. thread remains blocked | |
| 1133. |
The time required to create a new thread in an existing process is |
| A. | greater than the time required to create a new process |
| B. | less than the time required to create a new process |
| C. | equal to the time required to create a new process |
| D. | none of the mentioned |
| Answer» C. equal to the time required to create a new process | |
| 1134. |
If one thread opens a file with read privileges then |
| A. | other threads in the another process can also read from that file |
| B. | other threads in the same process can also read from that file |
| C. | any other thread can not read from that file |
| D. | all of the mentioned |
| Answer» C. any other thread can not read from that file | |
| 1135. |
A process can be |
| A. | single threaded |
| B. | multithreaded |
| C. | both single threaded and multithreaded |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1136. |
Which one of the following is not shared by threads? |
| A. | program counter |
| B. | stack |
| C. | both program counter and stack |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1137. |
Standard set of functions through which interacts with kernel is defined by |
| A. | system libraries |
| B. | kernel code |
| C. | compilers |
| D. | utility programs |
| Answer» B. kernel code | |
| 1138. |
The replacement of a bad block generally is not totally automatic because |
| A. | data in bad block can not be replaced |
| B. | data in bad block is usually lost |
| C. | bad block does not contain any data |
| D. | none of the mentioned |
| Answer» C. bad block does not contain any data | |
| 1139. |
During recovery from a failure |
| A. | each pair of physical block is examined |
| B. | specified pair of physical block is examined |
| C. | first pair of physical block is examined |
| D. | none of the mentioned |
| Answer» B. specified pair of physical block is examined | |
| 1140. |
When we write something on the disk, which one of the following can not happen? |
| A. | successful completion |
| B. | partial failure |
| C. | total failure |
| D. | none of the mentioned |
| Answer» E. | |
| 1141. |
RAID level 1 refers to |
| A. | disk arrays with striping |
| B. | disk mirroring |
| C. | both disk arrays with striping and disk mirroring |
| D. | none of the mentioned |
| Answer» C. both disk arrays with striping and disk mirroring | |
| 1142. |
A swap space can reside in |
| A. | Separate disk partition |
| B. | RAM |
| C. | Cache |
| D. | None of the mentioned |
| Answer» B. RAM | |
| 1143. |
Operating system is responsible for |
| A. | disk initialization |
| B. | booting from disk |
| C. | bad-block recovery |
| D. | all of the mentioned |
| Answer» E. | |
| 1144. |
Which algorithm of disk scheduling selects the request with the least seek time from the current head positions? |
| A. | SSTF scheduling |
| B. | FCFS scheduling |
| C. | SCAN scheduling |
| D. | LOOK scheduling |
| Answer» B. FCFS scheduling | |
| 1145. |
The time for the disk arm to move the heads to the cylinder containing the desired sector is called |
| A. | disk time |
| B. | seek time |
| C. | arm time |
| D. | sector time |
| Answer» C. arm time | |
| 1146. |
Which private network uses storage protocol rather than networking protocol? |
| A. | storage area network |
| B. | local area network |
| C. | wide area network |
| D. | none of the mentioned |
| Answer» B. local area network | |
| 1147. |
Which one of the following is not a secondary storage? |
| A. | Magnetic disks |
| B. | Magnetic tapes |
| C. | RAM |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 1148. |
What is role of Key Distribution Center ? |
| A. | It is used to distribute keys to everyone in world |
| B. | It intended to reduce the risks inherent in exchanging keys |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 1149. |
Which two of the following are authentication algorithms ? |
| A. | MAC |
| B. | AES |
| C. | DAS |
| D. | Digital-signature |
| Answer» B. AES | |
| 1150. |
SHA-1 produces __ bit of hash. |
| A. | 128 |
| B. | 150 |
| C. | 160 |
| D. | 112 |
| Answer» D. 112 | |