Quiz — Lecture 20

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. Why count the candidate space before coding?

A2. What does an empty enumeration sweep prove?

A3. How many subsets does a 30-element set have?

A4. What must you decide about the empty subset before enumerating?

Section B

B1. Write the count-line for the 4-digit lock (sum 12) and the exact answer.

B2. Enumerate subsets of [3, 5, 2] for target 8: which mask wins with first-found exit?

Exit ticket

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

1. How big is the subset space of 25 items, roughly?

1. What makes pruning sound?

1. When is brute force the right deliverable?

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.