(a)Instructions (b) Data
(c) Instructions and data (d) Address
Ans: (c)
**Q. Operating system used to complete the task in specified time constraint?
(a) Distributed OS
(b) Multi programming OS
(c) Real-time OS
(d) Time-Sharing OS.
Ans-(c)
(a) Memory reading (b) data reading
(c) Relative reading (d) instructions fetching.
Ans: (d)
Q. The scheduling queue which keeps all those process those are ready to execute?
(a) Suspended Queue
(b) Device Queue
(c) Ready Queue
(d) Job Queue
Ans: - (c)
***Q. The scheduling queue which keeps all the suspended process
(a) Suspended Queue
(b) Device Queue
(c) Ready Queue
(d) Job Queue
Ans: - (a)
(a) MAR (b) MDR
(c) SP (d) PC
Ans- (a) Memory Address register (MAR)
**Q. Memory Location or address where retrieved data is stored specified by the register-
(a) MAR (b) MDR
(c) SP (d) PC
Ans: - (b) Memory Data Register (MDR).
Q. Memory Address which gives the address of next instruction to be executed.
(a) MAR (b) MDR
(c) SP (d) PC
Q. Which register can be implicitly used as an operand---?
(a) MBR (b) MDR
(c) Accumulator (d) any general purpose registers
Ans- (c) Accumulator
Q. Turnaround time is defined as:
(a) Waiting time.
(b) Suspended time.
(c) total time spent by process inside a system.
(d) Waiting time + suspended time
Ans: - (c).
Q. which one can improve the performance of scheduling algorithm
(a) Time in waiting suspended Queue
(b) Time in waiting ready Queue.
(c) Time spent by a process in execution.
(d) Response time
Ans: - (b)
***Solution:- Turnaround time(TAT) = Time in waiting suspended Queue + Time in waiting ready Queue + Time spent by a process in execution.
Here Time spent by a process in execution depends on speed of processor so it does not affect the scheduling algorithm and time in waiting suspended Queue also does not affect TAT. So waiting in ready queue can only improve the performance of scheduling algorithm.
No comments:
Post a Comment