Back to the 2022 paper
Similar questions
OPERATING SYSTEMWaiting Time is calculated as (i) Turnaround Time - Burst Time (ii) Turnaround Time - Arrival Time (iii) Completion Time - Arrival Time (iv) Completion Time - Burst Time20242mCOMPUTER ORGANIZATION & ARCHITECTUREThe minimum time delay between the initiations of two independent memory operations is called * (i) access time * (ii) cycle time * (iii) transfer rate * (iv) latency time20192mOperating System______ is the time required to move the disk-arm to the desired track. (i) Seek time (ii) Rotational Latency (iii) Access time (iv) Waiting time20222mOPERATING SYSTEMAssume the following workload in a system: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P0 | 1 | 3 | | P1 | 0 | 6 | | P2 | 3 | 2 | | P3 | 4 | 7 | | P4 | 2 | 8 | | P5 | 6 | 5 | Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum=3 : (i) Average Turn Around Time (ii) Average Waiting Time20247m
Previous______ is a technique of improving the priority of process waiting in queue for CPU allocation: (i) Starvation (ii) Ageing (iii) Revocation (iv) RelocationNextA process is: (i) program in high level language kept on disk (ii) content of main memory (iii) program in execution (iv) job in secondary memory
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.