Study guide
8.2 Iteration: for, while, do … while, and repeat … until Loops
Praxis Computer Science 5652
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode
1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy
2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects
2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations
3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security
3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage
4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation
4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing
5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization
5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range
6 Chapter 6: Algorithms: Searching, Sorting, and Recursion
6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents
7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions
7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra
8 Chapter 8: Programming: Selection, Iteration, and Writing Code
8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code
9 Chapter 9: Programming: Procedures, Arrays, and Data Structures
9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)
10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality
10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback
11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs
11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs
12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design
12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding
13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection
14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing
15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments
15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored
16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity
16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs
8.2 Iteration: for, while, do … while, and repeat … until Loops
Key Takeaways Explain This Topic AI
A loop needs three things: initialize the loop variable, test it in the condition, and update it toward termination.
for ( int i ← a; i < b; i ← i + 1 ) runs b − a times; changing < to ≤ adds one more iteration.
Nested loops multiply: an outer loop of m passes and an inner loop of n passes run the inner body m × n times; an inner loop from 1 to i, for i from 1 to n, runs n(n + 1)/2 times.
Repeated statements that differ only by a number can be replaced by a loop whose variable supplies that number.
do … while ( c ) is equivalent to repeat … until ( not c ); both run their body at least once.
Last updated: September 2026
What this competency asks
Within the sequence, selection, and iteration competency, ETS lists tracing, identifying inputs for given outputs, describing purpose, supplying missing code, and identifying equivalent code. For loops specifically, you should be able to:
Convert code that does not use iteration to equivalent code that uses iteration.
Trace code with for , while , do … while , and similar loops, and convert from one type of loop to another (a discussion question).
Anatomy of a loop
Every loop has three parts. A missing or wrong part causes most loop bugs.
Initialization: set the loop variable, as in int i ← 0 .
Condition: decide whether to run the body again, as in i < n .
Update: move toward ending, as in i ← i + 1 . for ( int i ← 0; i < 5; i ← i + 1 ) // all three parts in the header
- print i // print a space after the value
- end for
- int k ← 1 // initialization
- while ( k ≤ 100 ) // condition
- k ← k * 2 // update
- end while
The for loop prints 0 1 2 3 4 . The while loop doubles k through 2, 4, 8, 16, 32, 64, and 128, and stops with k = 128 after 7 passes.
Counting iterations
- Header Values of i Iterations
- for ( int i ← 0; i < n; i ← i + 1 ) 0 … n − 1 n
- for ( int i ← 1; i ≤ n; i ← i + 1 ) 1 … n n
- for ( int i ← 1; i < n; i ← i + 1 ) 1 … n − 1 n − 1
- for ( int i ← 0; i ≤ n; i ← i + 1 ) 0 … n n + 1
- for ( int i ← 0; i < n; i ← i + 2 ) 0, 2, 4, … ⌈n / 2⌉
- for ( int i ← n; i > 0; i ← i - 1 ) n … 1 n
After a for loop ends, the loop variable holds the first value that failed the test. For example, i is n after the first header in the table, although in ETS pseudocode a variable declared in the header is not normally used after the loop.
- Nested loops int count ← 0
- for ( int i ← 1; i ≤ 4; i ← i + 1 )
- for ( int j ← 1; j ≤ i; j ← j + 1 )
- count ← count + 1
- end for
- end for
The inner loop runs 1, 2, 3, and then 4 times, so count = 1 + 2 + 3 + 4 = 10 , or n(n + 1)/2 with n = 4. If the inner loop always ran 5 times, the body would run 4 × 5 = 20 times.
Pre-test and post-test loops
- Loop Test Minimum runs Continues while…
- while ( c ) … end while Before the body 0 c is true
- for ( … ; c ; … ) … end for Before the body 0 c is true
- do … while ( c ) After the body 1 c is true
- repeat … until ( c ) After the body 1 c is false (stops when c becomes true) int k ← 5
- repeat
- k ← k * 2
- until ( k ≥ 20 )
Pass 1: k = 10, and 10 ≥ 20 is false, so the loop repeats. Pass 2: k = 20, and 20 ≥ 20 is true, so it stops. The body runs twice and k ends at 20 .
Post-test loops suit tasks that must happen at least once, such as showing a menu or prompting for input until it is valid.
- Converting code into a loop
- Repeated statements that differ only in a number can be replaced by a loop: // Without iteration
- print 3
- print 6
- print 9
- print 12
- print 15
- // With iteration
- for ( int i ← 1; i ≤ 5; i ← i + 1 )
- print 3 * i
- end for
To convert, find what changes from line to line (here 3, 6, 9, …, which is 3 × 1, 3 × 2, and so on), make the loop variable produce it, and set the bounds so the loop runs the same number of times. Verify both the first and the last output.
- Converting between loop types
- for to while. Move the initialization before the loop and the update to the end of the body: int i ← 0
- while ( i < n )
- total ← total + list[i]
- i ← i + 1
- end while
while to do … while. These are equivalent only if the condition is true the first time. Otherwise the do … while runs once too often. A guarding if makes them equivalent.
do … while to repeat … until. Negate the condition: do … while ( x < 10 ) is equivalent to repeat … until ( x ≥ 10 ) .
Leaving a loop early
Many languages provide break (exit the loop immediately) and continue (skip to the next iteration). They are not part of the ETS notation table. ETS-style code usually exits early by return -ing from a procedure, or by making the condition false with a flag such as while ( ( i < n ) and ( not found ) ) .
Common loop bugs
- Bug Example Result
- Off by one i ≤ n with a 0-based array of length n Reads the invalid index n
- Missing update No i ← i + 1 in a while loop Infinite loop
- Update in the wrong direction while ( k > 0 ) with k ← k + 1 Infinite loop
- Skipped target while ( x ≠ 10 ) with x going 1, 3, 5, … Never equals 10, so it never stops
- Floating-point condition while ( v ≠ 1.0 ) with v increased by 0.1 Round-off makes v skip exactly 1.0
- Wrong initialization Accumulator reset inside the loop Only the last value counts