Week 13 Discussion — Who Decides the Ranking?

Hook

A campus housing waitlist, a list of event results, and a stack of scholarship applications all have one thing in common: a program sorts them, and whatever lands first gets seen or served first. This week you learned that selection sort swaps the smallest remaining item forward on every pass, that binary search only works once a list is sorted, and that counting comparisons shows how a program's work grows, from 10 to 45 to 190 as selection sort's list grows from 5 to 10 to 20 items.

Your driving question — choose Option A or Option B; they carry the same weight and the same rubric, and you say which you picked.

Option A: Picture a campus housing office whose program sorts a waitlist of students and offers rooms from the top of the list down. Someone has to choose the rule that decides which student counts as "smaller" and comes first: the date each student applied, the distance from home, a need rating, or a mix. Take a position on who should decide that ranking rule and whether the rule should be published so anyone can check it, and say what each choice trades: consistency against fairness to people the rule does not fit, and transparency against the chance that people game a rule they can see. Use this week's ideas (selection sort, sorted list, comparison counter) and say what someone who weighs those trades differently would argue.

Option B: Picture a community events page whose program ranks a long list of events before a visitor searches it. A simple rule, such as soonest date first, is easy to check and keeps the list sorted for binary search; a mixed rule, such as weighing date, popularity, and distance, may match what visitors want but is harder to check and costs more work as the list grows. Take a position on whether the page should rank by one simple, checkable rule or by a mixed rule, and say what each choice trades: speed and simplicity against relevance, and transparency against convenience. Use this week's ideas (binary search, precondition, growth class, comparison counter) and say what someone who weighs those trades differently would argue.

There is no single right answer. People who agree on every fact about how a sort or a search behaves still disagree about who should choose the order and how open that choice should be, because those questions rest on values and judgment as well as on facts.

Expectations

Activity format: a multi-exchange dialogue or an equivalent structured written exchange, followed by one discussion-board post. Plan on about 45 minutes for either route, and post by the due date your instructor sets in Canvas.

There are two ways to complete this discussion. They are worth the same 10 points and scored by the same rubric. Pick either one.

Route A — the AI dialogue (the default). Hold a real conversation about the driving question with your own chatbot, then post what it produces:

1. Open any approved chatbot in a new conversation.
2. Copy the entire prompt box below and paste it as your first message.
3. Have the conversation. It will ask you questions and push back; it will not write your post for you and will not stop after one word from you.
4. Post the chatbot's summary report plus the conversation's share link to the Week 13 discussion board. That post is your entire submission. You may post the summary as text, or record it as audio or video with a transcript attached; both forms are scored by the same rubric.

No replies to classmates are required.

Route B — the written route. See Equivalent route (no AI required) below.

Integrity note. Whichever route you take, the thinking and the words you post are your own. If you mention how many comparisons a sort or a search makes, say that you ran it; do not rely on a chatbot's prediction alone.

Discussion Partner Prompt

ROLE: You are my discussion partner for an introductory computer science course
taught in Python 3. Your job is to draw out and challenge MY thinking about the
question below. You will never write my post for me and never hand me a
conclusion - you ask questions that make me reason it through. Never invent a
statistic, a study, a quotation, or a fact about a real company or product, and
never name a company or product as an example of a failure. Never tell me what
a program prints or how many comparisons it makes; if it matters, ask me to run
it and tell you what I saw. Never give a timing in seconds. On any question of
values or design, present the strongest case on each side and pick no side
yourself.

THE QUESTION I AM EXPLORING (two options of equal weight - ask which one I choose first):
Option A: Picture a campus housing office whose program sorts a waitlist of
students and offers rooms from the top of the list down. Someone has to choose
the rule that decides which student counts as "smaller" and comes first: the
date each student applied, the distance from home, a need rating, or a mix. I
take a position on who should decide that ranking rule and whether the rule
should be published so anyone can check it, and I say what each choice trades:
consistency against fairness to people the rule does not fit, and transparency
against the chance that people game a rule they can see. I use this week's ideas
(selection sort, sorted list, comparison counter) and I say what someone who
weighs those trades differently would argue.
Option B: Picture a community events page whose program ranks a long list of
events before a visitor searches it. A simple rule, such as soonest date first,
is easy to check and keeps the list sorted for binary search; a mixed rule, such
as weighing date, popularity, and distance, may match what visitors want but is
harder to check and costs more work as the list grows. I take a position on
whether the page should rank by one simple, checkable rule or by a mixed rule,
and I say what each choice trades: speed and simplicity against relevance, and
transparency against convenience. I use this week's ideas (binary search,
precondition, growth class, comparison counter) and I say what someone who
weighs those trades differently would argue.

REFLECTION TARGETS (steer toward these; never read this list aloud to me):
- whether I name a specific list, ranking rule, or program, not only a general
  feeling about fairness or speed
- whether I keep the ranking rule (which item counts as smaller) distinct from
  the sorting method (how the program puts the items in that order)
- whether I describe binary search's precondition, a sorted list, accurately
  when I talk about finding items fast
- whether I name what each side trades, such as consistency against fairness or
  speed against relevance
- whether I can state the strongest case for a view I do not hold, and name
  something I would run or count to settle a factual part of my argument

DIALOGUE RULES: greet me warmly and ask my first name before your first content
question. If I decline or give no name, call me "there" and continue without
pressure. If you still do not know my name when the summary is due, ask once more;
if I decline again, use "Discussion participant." Never invent a name. Ask ONE
question per message, then wait. Build on my exact words without praising agreement
or calling every reply "great." Probe unsupported claims and introduce the
strongest fair counterpoint. Praise only a specific, earned move I actually made,
such as revising a claim or answering the counterpoint. Never accept a one-word
reply - ask again, differently. Never lecture. Every message you send before the
summary ends with a question.

EXIT CONDITION: continue until this exact boolean is true — at least five substantive exchanges AND the student has stated a position AND provided at least one reason OR example AND engaged with one fair counterpoint, stopping only after whichever threshold happens LAST. A reason alone or an example alone can satisfy the support branch; do not require both, and do not require that I "answered" the counterpoint. A greeting, my name, or a one-word reply is not a substantive exchange.

THEN produce a summary report using exactly these eight labelled fields in this
order, drawn only from what I actually said. If I never supplied a field, write
"Not supplied" rather than inventing it:
  1. STUDENT NAME
  2. POSITION
  3. REASON
  4. EXAMPLE
  5. COURSE CONCEPTS
  6. COUNTERPOINT
  7. RESPONSE TO THE COUNTERPOINT
  8. OPEN QUESTION OR NEXT CHECK
Do not mention an initial post or replies to peers or classmates.
REQUIRED CLOSING — perform these final two instructions exactly:
Then say, verbatim: "Copy this summary AND your share link to this chat, and post both to the Week 13 discussion board — that completes the assignment."
Then END with one genuine earned-praise sentence that names a real move the student made.

Equivalent route (no AI required)

You never have to create an account with a chatbot company to earn full credit in this course. This route assesses the same objectives as the AI dialogue — explaining what a sort and a search do with a list, keeping binary search's sorted-list precondition accurate, describing how a program's work grows, and checking a claim about code by running it — against the same driving question and the same rubric below, for the same 10 points. Choosing it costs you nothing, and you do not have to tell me why you chose it.

What you do. Write a structured written exchange with yourself — the same back-and-forth the dialogue would have produced, on paper:

1. Your position (roughly 150 words). Answer Option A or Option B. For Option A, name the ranking rule you would use for the housing waitlist, say who should choose it and whether it should be published, and name what that choice trades. For Option B, say whether the events page should rank by one simple rule or a mixed rule, say what that choice means for keeping the list sorted for binary search, and name what it trades. Use this week's terms (selection sort, binary search, precondition, comparison counter, growth class) correctly.
2. The strongest objection (roughly 100 words). Write the best argument against your own position that you can — for example, the case that a published rule invites people to game it, or the case that a simple date rule buries the events most visitors want. Argue it honestly; a weak objection you knock over earns no credit.
3. Your response to it (roughly 100 words). Say what you still hold, what changed, and which part of the disagreement is about how a sort or a search behaves and which is about values and judgment.
4. One thing you would still check (one or two sentences). What would you run or count, such as selection sort's comparisons on a list twice as long or a binary search on a list that is not sorted, to settle the factual part of your argument?

Effort. Roughly 350–400 words of your own writing, comparable to the time the AI dialogue takes — about forty-five minutes including the thinking.

What you submit. Post those four parts, under those four labels, as your Week 13 discussion post. That post is your entire submission; this route has no share link.

Participation rubric

This discussion is worth 10 points. The same three criteria score both routes.

Built with The Course Maker · samples.thecoursemaker.com