Book allocation problem

#1

for book allocation problem in the video,we consider the search space for solution given 2 students and books array as [10,20,30,40] from 40 to 100 .
After some iterations the possible search space becomes >=60 and <=100,that is minimum 60 is acceptable as student 1 gets 10,20,30 and student 2 gets 40.but how is 100 possible(because if we consider max as 100 then only 1 student will get all the pages and it violates the condition that there should be 2 students)?

#2

“The task is to assign books in such a way that the maximum number of pages assigned to a student is minimum.”

solution expected: max no of pages assigned to a student
task: to minimize the expected solution

eg. we have 4 books with 10,20,50,60 pages and have m=3.
possible solutions:

{10+20, 50,60}, ans = 60
2,{10+50,20,60} , ans = 60
{10,20,50+60}, ans = 110(max no of pages a student get = 110)
…so on
final ans = in best case(min of all possible solutions), how many max pages a student will get = 60

eg2. 10,20,30,90 and m=2
possible solutions:

{10+20,30+90}, ans = 120
2.{10+20+30,90}, ans = 90
{10+30,90+20}, ans = 110…so on
final ans = min of all possible solutions = 90

you can see that the final answer can never be less than the largest book. since atleast some student will get that book and then the solution can never be less than that.

thanks
rate and resolve if satisfied…

#3

please read my question properly,i can understand the problem but i have that specific doubt.

#4

{10+20, 50,60}, ans = 60 2,{10+50,20,60} , ans = 60 {10,20,50+60}, ans = 110 in the example that you have used,how is this case possible 2,{10+50,20,60} here 10,50 are not consecutive right …but according to question it should be consecutive right.