MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 116 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.If a new process D requested 30 shares, the admission controller would __________ |
| A. | a) allocate 30 shares to it |
| B. | b) deny entry to D in the system |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 102. |
In a safety critical system, incorrect operation ____________ |
| A. | a) does not affect much |
| B. | b) causes minor problems |
| C. | causes major and serious problems |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 103. |
What is the priority of a real time task? |
| A. | a) must degrade over time |
| B. | b) must not degrade over time |
| C. | may degrade over time |
| D. | none of the mentioned |
| Answer» C. may degrade over time | |
| 104. |
In rate monotonic scheduling algorithm Select one: |
| A. | shorter duration job has higher priority, |
| B. | longer duration job has higher priority |
| C. | priority does not depend on the duration of the job |
| D. | none of the mentioned |
| Answer» C. priority does not depend on the duration of the job | |
| 105. |
Tasks whose execution would begin randomly and within the interval of arrival times of consecutive tasks is known as |
| A. | Periodic Task |
| B. | Aperiodic Task |
| C. | Sporadic Task |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 106. |
What is True for a task vis-Ã -vis a process? |
| A. | Tasks are complex compared to processes |
| B. | Tasks represent only a single sequence of instructions |
| C. | Processes can spawn threads but tasks cannot spawn tasks Tasks and processes are one and the same thing |
| D. | Tasks and processes are one and the same thing |
| Answer» C. Processes can spawn threads but tasks cannot spawn tasks Tasks and processes are one and the same thing | |
| 107. |
What does the utilization rate tells us? Select one: |
| A. | If it is larger or equal to 1, the system is not feasible |
| B. | If it is smaller than 1, the system is feasible |
| C. | If it is exactly 1, the system is feasible |
| D. | if there is no context switch overhead If it is 0, the system is absolutely feasible |
| Answer» B. If it is smaller than 1, the system is feasible | |
| 108. |
if jobs have unpredictable release times, a task is termed : |
| A. | aperiodic |
| B. | sporadic periodic. |
| C. | both |
| D. | None of these |
| Answer» B. sporadic periodic. | |
| 109. |
What is TRUE for an aperiodic task and a sporadic task: |
| A. | A sporadic task and an aperiodic task are one and the same thing |
| B. | An aperiodic task occurs randomly and has hard real time requirements |
| C. | A sporadic task occurs randomly and has hard real time requirements |
| D. | A sporadic task becomes aperiodic when it is executed with a periodic task |
| Answer» D. A sporadic task becomes aperiodic when it is executed with a periodic task | |
| 110. |
Effective release time of a job with predecessors is equal to the maximum value among, its…………and………….. |
| A. | deadline time and effective release time of all of the predecessors. |
| B. | release time and effective release time of all of the predecessors. |
| C. | both |
| D. | None of these |
| Answer» C. both | |
| 111. |
Effective release time of a job without the predecessors is equal to its given ……………. |
| A. | release time |
| B. | Deadline |
| C. | both |
| D. | None of these |
| Answer» B. Deadline | |
| 112. |
LRT schedules all the job backward from …………………... of all the job in priority driven manner to the current time. |
| A. | Earliest deadline |
| B. | latest deadline |
| C. | latest releasetime |
| D. | None of these |
| Answer» C. latest releasetime | |
| 113. |
In on-line scheduling, scheduler make the schedule ……………………... that will be released in future. |
| A. | with the knowledge of the jobs |
| B. | without the knowledge of the jobs |
| C. | both |
| D. | None of these |
| Answer» C. both | |
| 114. |
5. In which scheduling certain amount of CPU time is allocated to each process? |
| A. | a) earliest deadline first scheduling |
| B. | b) proportional share scheduling |
| C. | equal share scheduling |
| D. | none of the mentioned |
| Answer» C. equal share scheduling | |
| 115. |
Scheduling of tasks is a very important consideration in RTOS. Which of the following best described the scheduling policy design: |
| A. | a. The scheduler must follow a pre-emptive policy |
| B. | b. The scheduler must not use pre-emptive policy option |
| C. | c. The scheduler must not only use pre-emptive policy options with the priority considerations. |
| D. | d. The scheduler must not use pre-emptive policy option, but must employ priority consideration. |
| Answer» E. | |
| 116. |
Preemptive, priority based scheduling guarantees ____________ |
| A. | a) hard real time functionality |
| B. | b) soft real time functionality |
| C. | protection of memory |
| D. | none of the mentioned |
| Answer» C. protection of memory | |