Correct Answer - Option 3 : n/t
Concept:
Throughput:
Throughput is the amount of work completed in a unit of time. In other words, throughput is the processes executed to the number of jobs completed in a unit of time. The scheduling algorithm must look to maximize the number of jobs processed per time unit.
Throughput = μ = \({{number \space of \space process} \over shedule \space length }= {N \over L}\)
Explanation:
Given that,
the number of processes= n process
Completion time of all process (or) schedule length= t seconds
Throughput= n/t processes per second.
Hence the correct answer is n/t.