Mechanical Engineering > GATE 2017 SET-1 > Scheduling
Following data refers to the jobs (P, Q, R, S) which have arrived at a machine for scheduling. The shortest possible average flow time is ________ days.
JobProcessing Time (days)
P15
Q9
R22
S12

Explanation

Correct : 31

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science