The exercise-1 editor asks you to traverse an ArrayList. These six are mostly about removal, because removing during a loop is the mistake this topic exists to teach.
Applied Practice
6 questions · scenario driven · every answer is recorded for your teacher
Question 1 of 6Analyze
A forward loop over [2, 4, 6, 8] removes every even value using an index that always increments.
What actually happens?
Incorrect. The list shrinks as it goes; running off the end is possible but is not what makes this wrong.
Incorrect. Removals do occur. They are simply incomplete.
Incorrect. The skipping means several survive the pass.
Correct. Correct. The index advances while the data slides underneath it, so every other match is missed.
Question 2 of 6Apply
A program must remove every element matching a condition, using an index-based loop.
What is the simplest correct fix?
Incorrect. The enhanced for is worse here: modifying during it throws.
Incorrect. That compounds the skipping rather than fixing it.
Correct. Correct. Traversing backward is the other standard fix, since removal only shifts elements the backward walk has already passed.
Incorrect. Removing twice removes the wrong elements.
Question 3 of 6Analyze
A program calls list.remove(...) inside an enhanced for loop over that same list.
What is the likely result?
Incorrect. This is precisely the case the exception exists to forbid.
Correct. Correct, and the loud failure is better than the index loop's silent skipping.
Incorrect. The index loop fails quietly; this one fails noisily. That difference is the point.
Incorrect. It compiles. The failure happens at run time.
Question 4 of 6Apply
A backward loop removes matching elements from an ArrayList.
Why does traversing backward avoid the skipping problem?
Correct. Correct. The shift lands entirely in territory already covered, so nothing unvisited moves.
Incorrect. Direction has no meaningful speed effect.
Incorrect. Nothing is reversed. Only the visiting order changes.
Incorrect. Removal always shifts the same way. Direction changes whether that matters.
Question 5 of 6Evaluate
A loop is written as for (int i = 0; i < list.size(); i++) and the body sometimes removes an element.
What is true about the bound?
Incorrect. It does not throw, which is exactly what makes the bug hard to spot.
Incorrect. It is an ordinary method call and entirely legal there.
Incorrect. The condition is a live expression, re-evaluated each pass. Caching it in a variable is what creates a stale bound.
Correct. Correct, and it is why this loop skips elements rather than crashing. The bound is fine; the increment is not.
Question 6 of 6Apply
A method must build a NEW list of the elements that pass a test, leaving the original untouched.
Which approach is cleanest?
Incorrect. That leaves nulls in the original, corrupting it and inviting NullPointerException.
Incorrect. That destroys the original, which the requirement forbids.
Correct. Correct, and it sidesteps the entire category of bug this topic is about.
Incorrect. Sorting does not partition by an arbitrary test and reorders the data.
Whether you're a student, parent, or teacher — I'd love to hear from you.
Just want free AP CS resources?
Enter your email below and check the subscribe box — no message needed.
Students get daily practice questions and study tips. Teachers get curriculum resources and teaching strategies.
Typically responds within 24 hours
✓
Message Sent!
Thanks for reaching out. I'll get back to you within 24 hours.
34.8% of Tanner’s CSP students score 5s. The national average is 9.6%.
I’m a Student
I’m a Teacher
✓Free AP CSP Big Ideas cheat sheet (PDF)
✓Daily practice questions covering all 5 Big Ideas
✓Create Task tips that actually work — from a real AP teacher
✓Free class codes with student progress tracking
✓3 full practice exams + Top 100 questions for your class
✓Create Task guidance and pseudocode reference sheets
Which AP CS exams are you prepping for?
✓
You’re in!
Your Big Ideas cheat sheet is on its way.
No thanks, I’ll figure it out myself
Avg student improvement: 2+ score levels | Real AP teacher, not just a tutor
AP Cybersecurity — National Launch 2026–27
Get Early Access to AP Cyber
AP Cyber launches nationally fall 2026. Get in early to help shape the course — start free with Unit 1 and the free teacher gradebook.
✓
You’re in — you’re on the AP Cyber early-access list!
Tanner will follow up personally within 48 hours. Your feedback will directly shape what gets built.
Step 1 of 4
Early Access — Limited Spots
Who are you?
Are you a teacher or a student?
I’m a Teacher
I’m a Student
Free to start — Unit 1 and the teacher gradebook are always free, no credit card.
Founding teachers unlock all 5 units and get direct input on what we build.
Not interested right now
Step 2 of 4
Your School
Tell us about your class
Other AP CS courses you teach
Your Situation
Tell us about yourself
Step 3 of 4
Classroom Needs
What does your classroom need? (select all that apply)
How You Study
What would help you most? (select all that apply)
Step 4 of 4
Almost Done
Where should we send your early-access details?
Free gradebook + Unit 1 | Your feedback shapes the course | Built by a real AP teacher