# Filled Procedure-Writing Card

This is an original fictional teaching example. The bookmarks, mapping and procedure are invented inputs, not an observed physical task, material test or human usability study. Its written instructions and expected output can be checked for consistency.

## Completed method facts

Task: make a paper index for the three supplied bookmarks.

Starting inputs: three paper bookmarks already titled Mountain, Coast and City; a blank index card; a writing tool; the fixed mapping below. No additional code or title is supplied.

| Code | Bookmark title |
| --- | --- |
| B01 | Mountain |
| B02 | Coast |
| B03 | City |

Required finish: the card contains exactly those three pairs, and each corresponding bookmark carries the same code. Every title and code is unique within this mapping.

Optional branch: a separate grouping mark can identify card entries you choose to group. The mark does not replace or change any code. Omitting it does not change the required finish.

Stopping conditions: a missing or duplicated starting title; an unknown title; a duplicated code; or a code/title pair that differs from the fixed mapping. Stop and resolve the mismatch instead of inventing another pair or declaring the index complete.

## Completed procedure

1. Check the starting titles against the mapping. Each supplied title must identify one bookmark. If a title is missing, duplicated or unknown, stop and resolve the mismatch before making the index.
2. On the index card, write Mountain, Coast and City as three separate entries. Each supplied title should appear once.
3. Beside each card entry, write its mapped code. Use B01 for Mountain, B02 for Coast and B03 for City. Copy the mapping exactly.
4. On each bookmark, write the code assigned to its title. The Mountain bookmark receives B01, the Coast bookmark receives B02 and the City bookmark receives B03.
5. Optional: add a small grouping mark beside the card entries you choose to group. Place it separately from the codes. It must not replace or change a code; leaving it out does not affect completion.
6. Compare each card pair with the mapping and its bookmark. The card must contain exactly the three supplied pairs, and each bookmark must have its corresponding code. Stop to resolve any duplicate code, unknown title or mismatched pair; do not declare the index complete while a mismatch remains.

## Expected filled index

| Code | Bookmark title |
| --- | --- |
| B01 | Mountain |
| B02 | Coast |
| B03 | City |

Comparison record for this written example: each expected pair equals the supplied pair. There are three distinct codes and three distinct titles. The required output does not contain any extra code or title. A grouping mark cannot fix a missing pair or incorrect code.

This is a comparison of authored text and expected output, not a record that someone performed the task with physical bookmarks.

## Reuse for your own procedure

- Reader's task and bounded goal:
- Inputs supplied by the method and where their values come from:
- Missing or unknown inputs to resolve before writing a complete method:
- Required starting state:
- Fixed names, codes or relationships to preserve:
- Actions in the order their dependencies require:
- Optional action and why omitting it does not affect the goal:
- Expected finished output:
- Exact comparison that establishes the required finish:
- Conditions that require stopping and resolving a mismatch:
- Evidence of what was actually checked, including whether the task or a reader test was performed:

## Source and scope

Google's developer-documentation guidance informs the writing approach: prepare readers with necessary information, separate actions, identify context and describe relevant results. Its optional-step label is used in the example. Source: https://developers.google.com/style/procedures

That source is documentation house advice, not evidence about search rankings. The bookmark method and all expected pairs are original teaching content. A check of written logic does not establish observed task completion or reader usability.