11.4 Problem 28
Header Image
Creative Commons image courtesy of Flickr user StormPetrel1-
Recent Posts
Recent Comments
- In the Spotlight: MAT2540 – Discrete Structures and Algorithms II – The Open Road on Links
- OpenLab Workshop for Opening Gateways Fellows | 2018-2019 Opening Gateways Faculty Seminar on Final Exam Review
- Eric on Eric’s Final Review
- Kate Poirier on Hints/reminders from today’s class
- Kate Poirier on Final Exam Review
Archives
Categories
Meta
What did you use to make this?
What? What do you mean what did I use? Remember how Professor Thiel taught this? That’s what I used!
Hi Javier. I think Eric might be asking about what software you used to create your tree. My guess is Microsoft Word…?
Since you’re asked to use backtracking, you technically should produce the whole tree, even though it’s huge. Depending on which of (a), (b), and (c) you’re answering, you can eliminate large subtrees, though. For (a), where you’re looking for a sum of 20, you can eliminate the whole right-subtree since every subset would include the element 27 and the sum would already be too big. For (b) and (c) you can eliminate large subtrees too.
So rather than producing one incomplete tree for all three parts of the question, and then separately arguing about the sum 20 of separately, you should produce three separate trees which are complete, but with the appropriate subtrees eliminated. It should amount to the same work that you’ve done, just a different presentation of the results.
Yes, it is MS word.
Thank you for the suggestion and I didn’t see it that way…eliminating branches to save time.