NIELIT Scientific Assistant Day-20 Operating System Quiz-1

Attempt now to get your rank among 631 students!

Question 1

If time quantum of Round Robin algorithm is given very large, then it becomes equivalent to which of the following algorithm?

• AShortest remaining time first
• BLongest remaining time first
• CFirst come First serve
• DLottery scheduling

Question 2

For the processes listed in the following table, whichofthefollowingschedulingschemeswillgivethelowestaverageturnaroundtime?

• AFirst Come First Serve
• BNon- pre emptive Shortest Job First
• CShortest Remaining Time
• DRound Robin with Quantum value two

Question 3

Choose correct option:

• A1-Q, 2-R, 3-P.
• B1-P, 2-S, 3-R
• C1-S, 2-P, 3-Q
• D1-Q, 2-S, 3-P.

Question 4

Consider the following 3 processes with the length of cpu burst time(in milliseconds). All processes arriving at the same time in order P1, P2, P3

If Round Robin Scheduling is used with time quantum of 1 Unit then average waiting time will be,

• A6.5ms
• B5.66ms
• C7ms
• D8ms

Question 5

Which of the following operations need not to be privileged?

• ARead the clock
• BAccess I/O device
• CClear the memory
• DNone of these

• 631 attempts
• 2 upvotes
• 6 comments