Thông tin

Hạn chót Không có hạn chót
Giới hạn nộp bài Không có giới hạn

Đăng nhập

[Module7 Theory] Cumulative Constraint


Câu hỏi 1: Cumulative

Consider the following activities and a resource capacity of 5:

insertion

Select all the true statements:

Câu hỏi 2: Pruning

Consider the following activities and a resource capacity of 5:

insertion

The earliest start time of activity B is pruned to:

Câu hỏi 3: Rectangle Packing

Select all the possible sets of constraints that can be used to implement correctly the rectangle-packing problem where \(x_i, y_i, w_i, h_i\) are respectively the positions in the x & y dimensions and the width & height of rectangle \(i\):

Câu hỏi 4: Sweep Line

The time complexity for checking the feasibility of a Cumulative constraint with \(n\) tasks using the sweep-line algorithm is: