S01E10: Closest Pearls on the Floor
Questions:
We have some pearls / peas scattered on the floor, how can we find the closest pair of pearls / peas while looking only once?
Additional Questions:
What can be the different approaches to solve this problem?
Can you see a polynomial equation here?
If half of the seats are empty how much penalty should the conductor apply on all the remaining seats to make as much revenue as he would with all seats filled?
If the penalty is not fixed but varying with the number of seats empty such that the revenue is fixed (always as much as completely booked bus), then how would penalty change with number of empty seats? is the linear or non-linear?
Coding Assignments:
Create simulations of these questions and observe the outputs carefully.
Create visualizations and charts to understand this problem and its data distribution throughly.
Create programs for solving questions like these quickly, i.e. finding maxima of a function, through different approaches.
Understand the concepts associated with this problem deeply and try to create programs implementing those concepts.
Research about this problem and its applications.
← Back to Season 01