CPU scheduling algorithms are used to efficiently manage the execution of processes. A core can handle one process at a time, but CPUs often have multiple cores. Given n processes, where ith process starts at start i and finishes at end i, both inclusive, determining the minimum number of cores needed to handle all the processes.
Asked in: IDFC