Quiz — Lecture 23

Section A from memory, one line each. Section B shows your reasoning - marks are for method, not final answers. Answers are discussed in class; the exit ticket goes on a card.

Section A

A1. What does a greedy claim need to be accepted?

A2. Which rule wins interval scheduling and why informally?

A3. Name the four DP declarations.

A4. Why descending budget order for 0/1 knapsack?

Section B

B1. Meetings (9,10.5),(9.5,11),(11,12),(10.5,12.5): greedy pick and count.

B2. Coins 1,3,4 amount 6: greedy vs optimal.

Exit ticket

Answer one of these on your card in 60 seconds (choose any one):

1. What one input kills cs-089's greedy?

1. State the exchange argument for earliest-end scheduling.

1. What makes a DP state adequate?

Homework

• Before: skim the four student pages; attempt case 1 on paper.
• After: write a five-line pseudocode solution for any case you did not
• Enrichment (optional): the stretch question on each case page.