Consider a job scheduling problem with 4 jobs J1, J2, J3, J4 and with – InterviewSolution

InterviewSolution

1.	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?(A) J2, J4, J1, J3(B) J4, J1, J2, J3(C) J4, J2, J1, J3(D) J4, J2, J3, J1
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Which of these is not a feature of WAP 2.0(A) Push and Pull Model(B) Interface to a storage device(C) Multimedia messaging(D) Hashing
Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are(A) all zeros(B) all ones(C) both zeros and ones(D) different
Which of the following RAID level provides the highest Data Transfer Rate (Read/Write)(A) RAID 1(B) RAID 3(C) RAID 4(D) RAID 5
Which of the following is correct with respect to Two phase commit protocol?(A) Ensures serializability(B) Prevents Deadlock(C) Detects Deadlock(D) Recover from Deadlock
The Fibonacci sequence is the sequence of integers(A) 1, 3, 5, 7, 9, 11, 13(B) 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55(C) 0, 1, 3, 4, 7, 11, 18, 29, 47(D) 0, 1, 3, 7, 15
Selection sort algorithm design technique is an example of(A) Greedy method(B) Divide-and-conquer(C) Dynamic Programming(D) Backtracking
By using an eight bit optical encoder the degree of resolution that can be obtained is (approximately)(A) 1.8o(B) 3.4o(C) 2.8o(D) 1.4o
The principal of the locality of reference justifies the use of(A) virtual memory(B) interrupts(C) main memory(D) cache memory
Consider the following pseudo-codex:=1;i:=1;while (x <= 1000)begin x:=2^x; i:=i+1;end;What is the value of i at the end of the pseudo-code?(A) 4(B) 5(C) 6(D) 7
Round Robin schedule is essentially the pre-emptive version of(A) FIFO(B) Shortest job first(C) Shortest remaining time(D) Longest remaining time