CSE101Finals-VersionASolution.pdf - a Algorithm 1.,li...

Info icon This preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
a) Algorithm: 1. Sort the given set of technologies by low frequency, l i . 2. While [L, H] is not covered, repeat: Proceed along the list of intervals, and find the technology T i with interval [l i , h i ] such that l i ≤ L and h i is the maximum of all the intervals with l i ≤ L. Select technology T i , and discard all other technologies T j with l j ≤ l i . So in words, the technology is selected based on two conditions: that it is able to cover a frequency sub­interval, which starts at or before the end of the frequency interval of the previous chosen technology, and whose frequency sub­interval end is the farthest along the spectrum. b) Proof: Consider the set S of all the intervals of the technologies chosen by the greedy solution, and let OPT be an optimal solution, with all intervals also ordered in increasing order of l i . Consider the first interval in both solutions. Replacing the first interval in OPT, (l OPT , h OPT ) with the first interval from S, (l S , h S ) , which has the farthest right endpoint, h
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 6
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern