Big Idea 3 · Topic 3.9 · Exercise 1
Trace and Compare the Algorithms
25 minutes
Back to the Topic 3.9 lessonAll CSP topics
How this page works
The writing boxes below are yours. What you type stays in this browser, is saved here as you go, and is never sent to us or to your teacher. Hand the written work in the way your teacher asked for it.
The graded check at the bottom is the part that records to your teacher's gradebook.
Part B, from your handoutNot recorded
Your handout says these are the same items available here. Part A stays on paper.
Q1 · 3 points on the handout
Write your own two short algorithms that compute the SAME result but produce DIFFERENT side effects. Describe the shared result and the differing side effects precisely.
Q2 · 3 points on the handout
Expand this Boolean expression into an equivalent conditional statement, then explain when you might prefer the longer conditional form even though it is equivalent: eligible <- score >= 100.
Q3 · 2 points on the handout
ENRICHMENT: Algorithm B (the >= with ELSE) is correct. Using it as a building block, describe the smallest MODIFICATION that turns 'report the higher score' into 'report the LOWER score,' and state why modifying beats rewriting.
Q4 · 0 points on the handout
Next step: you traced and compared these by hand. Now head to the Topic 3.9 page and type and run the harder versions - build the average, combine it with a pass/fail check, and modify find-max into find-min - where the computer checks your output for you.
No graded check on this page yetNot recorded
About the line in your handout
Your handout says this exercise is available online and auto-graded. The exercise IS here, and it is the same work in the same order, but the auto-graded half is not written for this topic yet. Nothing on this page is scored or sent to your teacher.
Hand this in the way your teacher asked for it. Topic 1.1 has its graded check today, and the rest follow.