McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Computer Applications (BCA) , Bachelor of Science in Computer Science (BSc CS) .
| 151. |
What does RAID stand for? |
| A. | redundant array of independent disks |
| B. | redundant array of inexpensive disks |
| C. | redundant array of intermediate disks |
| D. | redundant array of improper disks |
| Answer» A. redundant array of independent disks | |
| 152. |
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» A. disk array | |
| 153. |
The process in which a file is partitioned into smaller parts and different parts are stored in different disks is |
| A. | raid |
| B. | mirroring |
| C. | stripping |
| D. | raid classification |
| Answer» C. stripping | |
| 154. |
Which of the following uses multiple hard disk platters mounted on a single central shift? |
| A. | disk drives |
| B. | hard disks |
| C. | disk packs |
| D. | compact disks |
| Answer» C. disk packs | |
| 155. |
Which of the following is not a magnetic disk? |
| A. | floppy |
| B. | winchester |
| C. | zip |
| D. | flash |
| Answer» D. flash | |
| 156. |
The software substituted for hardware and stored in ROM. |
| A. | synchronous software |
| B. | package software |
| C. | firmware |
| D. | middleware |
| Answer» C. firmware | |
| 157. |
Middleware has enabled the production of various types of smart machines having microprocessor chips with embedded software. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 158. |
A “glue” between client and server parts of application. |
| A. | middleware |
| B. | firmware |
| C. | package |
| D. | system software |
| Answer» A. middleware | |
| 159. |
MOM stands for? |
| A. | message oriented middleware |
| B. | mails oriented middleware |
| C. | middleware of messages |
| D. | main object middleware |
| Answer» A. message oriented middleware | |
| 160. |
Storage of firmware is |
| A. | cache memory |
| B. | ram |
| C. | external |
| D. | rom |
| Answer» D. rom | |
| 161. |
DNS stands for? |
| A. | domain name system |
| B. | direct name system |
| C. | direct network system |
| D. | domain network system |
| Answer» A. domain name system | |
| 162. |
A software that lies between the OS and the applications running on it. |
| A. | firmware |
| B. | middleware |
| C. | utility software |
| D. | application software |
| Answer» B. middleware | |
| 163. |
A type of middleware that allows for between the built-in applications and the real- time OS? |
| A. | firmware |
| B. | database middleware |
| C. | portals |
| D. | embedded middleware |
| Answer» D. embedded middleware | |
| 164. |
What is the other name for object middleware? |
| A. | object request interface |
| B. | object enabled interface |
| C. | object request broker |
| D. | object enabled broker |
| Answer» C. object request broker | |
| 165. |
The calls certain procedures on remote systems and is used to perform synchronous or asynchronous interactions between systems. |
| A. | procedure |
| B. | rpc |
| C. | message oriented |
| D. | db |
| Answer» B. rpc | |
| 166. |
Which module gives control of the CPU to the process selected by the short-term scheduler? |
| A. | dispatcher |
| B. | interrupt |
| C. | scheduler |
| D. | none of the mentioned |
| Answer» A. dispatcher | |
| 167. |
In priority scheduling algorithm |
| A. | cpu is allocated to the process with highest priority |
| B. | cpu is allocated to the process with lowest priority |
| C. | equal priority processes can not be scheduled |
| D. | none of the mentioned |
| Answer» A. cpu is allocated to the process with highest priority | |
| 168. |
The interval from the time of submission of a process to the time of completion is termed as |
| A. | waiting time |
| B. | turnaround time |
| C. | response time |
| D. | throughput |
| Answer» B. turnaround time | |
| 169. |
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first? |
| A. | first-come, first-served scheduling |
| B. | shortest job scheduling |
| C. | priority scheduling |
| D. | none of the mentioned |
| Answer» A. first-come, first-served scheduling | |
| 170. |
Which algorithm is defined in Time quantum? |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» B. round robin scheduling algorithm | |
| 171. |
Process are classified into different groups in |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» D. multilevel queue scheduling algorithm | |
| 172. |
Which one of the following can not be scheduled by the kernel? |
| A. | kernel level thread |
| B. | user level thread |
| C. | process |
| D. | none of the mentioned |
| Answer» B. user level thread | |
| 173. |
CPU scheduling is the basis of |
| A. | multiprocessor systems |
| B. | multiprogramming operating systems |
| C. | larger memory sized systems |
| D. | none of the mentioned |
| Answer» B. multiprogramming operating systems | |
| 174. |
With multiprogramming is used productively. |
| A. | time |
| B. | space |
| C. | money |
| D. | all of the mentioned |
| Answer» A. time | |
| 175. |
What are the two steps of a process execution? |
| A. | i/o & os burst |
| B. | cpu & i/o burst |
| C. | memory & i/o burst |
| D. | os & memory burst |
| Answer» B. cpu & i/o burst | |
| 176. |
An I/O bound program will typically have |
| A. | a few very short cpu bursts |
| B. | many very short i/o bursts |
| C. | many very short cpu bursts |
| D. | a few very short i/o bursts |
| Answer» C. many very short cpu bursts | |
| 177. |
A process is selected from the queue by the scheduler, to be executed. |
| A. | blocked, short term |
| B. | wait, long term |
| C. | ready, short term |
| D. | ready, long term |
| Answer» C. ready, short term | |
| 178. |
In the following cases non – preemptive scheduling occurs? |
| A. | when a process switches from the running state to the ready state |
| B. | when a process goes from the running state to the waiting state |
| C. | when a process switches from the waiting state to the ready state |
| D. | all of the mentioned |
| Answer» B. when a process goes from the running state to the waiting state | |
| 179. |
The switching of the CPU from one process or thread to another is called |
| A. | process switch |
| B. | task switch |
| C. | context switch |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 180. |
What is Dispatch latency? |
| A. | the speed of dispatching a process from running to the ready state |
| B. | the time of dispatching a process from running to ready state and keeping the cpu idle |
| C. | the time to stop one process and start running another one |
| D. | none of the mentioned |
| Answer» C. the time to stop one process and start running another one | |
| 181. |
Scheduling is done so as to |
| A. | increase cpu utilization |
| B. | decrease cpu utilization |
| C. | keep the cpu more idle |
| D. | none of the mentioned |
| Answer» A. increase cpu utilization | |
| 182. |
Scheduling is done so as to |
| A. | increase the throughput |
| B. | decrease the throughput |
| C. | increase the duration of a specific amount of work |
| D. | none of the mentioned |
| Answer» A. increase the throughput | |
| 183. |
What is Turnaround time? |
| A. | the total waiting time for a process to finish execution |
| B. | the total time spent in the ready queue |
| C. | the total time spent in the running queue |
| D. | the total time from the completion till the submission of a process |
| Answer» D. the total time from the completion till the submission of a process | |
| 184. |
Scheduling is done so as to |
| A. | increase the turnaround time |
| B. | decrease the turnaround time |
| C. | keep the turnaround time same |
| D. | there is no relation between scheduling and turnaround time |
| Answer» B. decrease the turnaround time | |
| 185. |
What is Waiting time? |
| A. | the total time in the blocked and waiting queues |
| B. | the total time spent in the ready queue |
| C. | the total time spent in the running queue |
| D. | the total time from the completion till the submission of a process |
| Answer» B. the total time spent in the ready queue | |
| 186. |
Scheduling is done so as to |
| A. | increase the waiting time |
| B. | keep the waiting time the same |
| C. | decrease the waiting time |
| D. | none of the mentioned |
| Answer» C. decrease the waiting time | |
| 187. |
What is Response time? |
| A. | the total time taken from the submission time till the completion time |
| B. | the total time taken from the submission time till the first response is produced |
| C. | the total time taken from submission time till the response is output |
| D. | none of the mentioned |
| Answer» B. the total time taken from the submission time till the first response is produced | |
| 188. |
Round robin scheduling falls under the category of |
| A. | non-preemptive scheduling |
| B. | preemptive scheduling |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» B. preemptive scheduling | |
| 189. |
With round robin scheduling algorithm in a time shared system |
| A. | using very large time slices converts it into first come first served scheduling algorithm |
| B. | using very small time slices converts it into first come first served scheduling algorithm |
| C. | using extremely small time slices increases performance |
| D. | using very small time slices converts it into shortest job first algorithm |
| Answer» A. using very large time slices converts it into first come first served scheduling algorithm | |
| 190. |
The portion of the process scheduler in an operating system that dispatches processes is concerned with |
| A. | assigning ready processes to cpu |
| B. | assigning ready processes to waiting queue |
| C. | assigning running processes to blocked queue |
| D. | all of the mentioned |
| Answer» A. assigning ready processes to cpu | |
| 191. |
Complex scheduling algorithms |
| A. | are very appropriate for very large computers |
| B. | use minimal resources |
| C. | use many resources |
| D. | all of the mentioned |
| Answer» A. are very appropriate for very large computers | |
| 192. |
What is FIFO algorithm? |
| A. | first executes the job that came in last in the queue |
| B. | first executes the job that came in first in the queue |
| C. | first executes the job that needs minimal processor |
| D. | first executes the job that has maximum processor needs |
| Answer» B. first executes the job that came in first in the queue | |
| 193. |
The strategy of making processes that are logically runnable to be temporarily suspended is called |
| A. | non preemptive scheduling |
| B. | preemptive scheduling |
| C. | shortest job first |
| D. | first come first served |
| Answer» B. preemptive scheduling | |
| 194. |
What is Scheduling? |
| A. | allowing a job to use the processor |
| B. | making proper use of processor |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» A. allowing a job to use the processor | |
| 195. |
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms? |
| A. | tq = 15ms |
| B. | tq = 40ms |
| C. | tq = 45ms |
| D. | tq = 50ms |
| Answer» A. tq = 15ms | |
| 196. |
Orders are processed in the sequence they arrive if rule sequences the jobs. |
| A. | earliest due date |
| B. | slack time remaining |
| C. | first come, first served |
| D. | critical ratio |
| Answer» C. first come, first served | |
| 197. |
Which of the following algorithms tends to minimize the process flow time? |
| A. | first come first served |
| B. | shortest job first |
| C. | earliest deadline first |
| D. | longest job first |
| Answer» B. shortest job first | |
| 198. |
Under multiprogramming, turnaround time for short jobs is usually and that for long jobs is slightly |
| A. | lengthened; shortened |
| B. | shortened; lengthened |
| C. | shortened; shortened |
| D. | shortened; unchanged |
| Answer» B. shortened; lengthened | |
| 199. |
Which is the most optimal scheduling algorithm? |
| A. | fcfs – first come first served |
| B. | sjf – shortest job first |
| C. | rr – round robin |
| D. | none of the mentioned |
| Answer» B. sjf – shortest job first | |
| 200. |
The real difficulty with SJF in short term scheduling is |
| A. | it is too good an algorithm |
| B. | knowing the length of the next cpu request |
| C. | it is too complex to understand |
| D. | none of the mentioned |
| Answer» B. knowing the length of the next cpu request | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.