ISRO | CS 2007 | Algorithm Greedy Technique | Question 12

Last Updated :
Discuss
Comments

Consider a job scheduling problem with 4 jobs J1, J2, J3, J4 and with corresponding deadlines: ( d1, d2, d3, d4) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?

J2, J4, J1, J3

J4, J1, J2, J3

J4, J2, J1, J3

J4, J2, J3, J1

This question is part of this quiz :

Greedy Algorithms Quiz,ISRO CS 2007,Top 50 Algorithms MCQs with Answers
Tags:
DSA Quiz
ISRO
Share your thoughts in the comments