{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw3(4) - CS 373U Combinatorial Algorithms Spring 2004...

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

View Full Document Right Arrow Icon
CS 373U: Combinatorial Algorithms, Spring 2004 Homework 3 Due Friday, March 12, 2004 at noon Name: Net ID: Alias: Name: Net ID: Alias: Name: Net ID: Alias: For each numbered problem, if you use more than one page, staple all those pages together. Please do not staple your entire homework together. This will allow us to more easily distribute the problems to the graders. Remember to print the name and NetID of every member of your group, as well as the assignment and problem numbers, on every page you submit. You do not need to turn in this cover page. This homework is challenging. You might want to start early. # 1 2 3 4 5 6 * Total Score Grader
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
CS 373U Homework 3 (due March 12, 2004) Spring 2004 1. Let S be a set of n points in the plane. A point p in S is called Pareto-optimal if no other point in S is both above and to the right of p . (a) Describe and analyze a deterministic algorithm that computes the Pareto-optimal points in S in O ( n log n ) time. (b) Suppose each point in S is chosen independently and uniformly at random from the unit square [0 , 1] × [0 , 1]. What is the exact expected number of Pareto-optimal points in S ? 2. Suppose we have an oracle Random ( k ) that returns an integer chosen independently and uniformly at random from the set { 1 , . . . , k } , where k is the input parameter; Random is our only source of random bits. We wish to write an efficient function RandomPermutation ( n ) that returns a permutation of the integers ( 1 , . . . , n ) chosen uniformly at random.
Image of page 2
Image of page 3
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