Answered: The total number of raisins is T and…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

A computer science professor has bought his two children a box of raisin cookies for thanksgiving. The number of raisins in the cookies is not evenly distributed and each cookie can have as many raisins in it. The children love raisins very much and when they open the box they fight over having as many raisins possible. They do not care about the number of cookies they have but rather the total number of raisins they collected. They are not happy with what they have collected, because each of them thinks the other one has more raisins. So they come back to their father for help. The professor comes up with a dynamic programming algorithm to find whether it is possible to, without breaking any cookie, assign all of them to his children where each gets an equal number of raisins. As mentioned it is not important if one of them gets more cookies. The total number of raisins is T and the total number of cookies is n. Write down a dynamic programming algorithm with O(nT) time complexity that you think the professor has come up with. Explain why it works

Expert Solution