Required : 6 of the following 8 problems for graduate students
Required : 5 of the following 8 problems for undergraduate students
Points: 10 pts per problem
General Instructions
- Please review the
homework and grading policy
outlined in the course information page.
-
Turn in problems separately, based on the signs on the mailboxes in 122A. DO NOT staple separate problems to one another
-
Submit the solutions on a standard A4/letter paper
-
Either type the homework (e.g. using the formatting software called latex), OR, where applicable, if written on paper, circle your answers. (running times, true/false, etc.)
-
For each problem:
-
Staple pages belonging to a single problem.
-
Write UNI and name.
-
Indicate your professor's name (Stein or Monteleoni)
-
Write EC/RC as applicable on each problem.
- On each problem, You must also write down with whom you worked on the assignment.
- Start early, be concise but rigorous, and enjoy!
Specific Instructions
- Be sure to review any parts of Chapters of the textbook with which you are
not familiar.
- All logs are base 2 unless otherwise specified.
- For a dynamic programming problem, be sure to show optimal substructure, give the algorithm and analyze the running time.
- Unless otherwise specified, all problems and exercises are from
CLRS, Introduction to
Algorithms, 3rd edition.
Problems
- Problem 9.4. Randomized Selection Analysis
- Exercise 5.4-2, 5.4-6. Probabilistic Analysis
- Problem 7.6. Fuzzy Sorting.
- Problem 7-5. Median of 3 partition
- Exercise 9.2-4. Worst-case performance of Randomized Select. Also answer what is the worst case perforamce
of Randomized Select in terms of n?
- Exercise 15.1-3. Rod Cutting modification
- Problem 15-5. Edit Distance.
- Exercise 15.3-3. Matrix Chain Multiplication.