An Algorithm Can Fall into an Infinite Loop When ____

question 42

Multiple Choice

An algorithm can fall into an infinite loop when ____.

• A) the input operations were missing
• B) the algorithm uses more than one loop
• C) the output operations were missing
• D) the continuation condition of the loop never becomes false

---

Definitions:

Int Num

A declaration in programming that signifies a variable named Num is of the integer data type, capable of storing whole numbers.

Nonnull String

A string reference in programming that is guaranteed not to be null, often used to denote that a method parameter or return type should never be null.

Last Character

Refers to the final character in a string or sequence of characters.

Length

A property or method used to determine the number of elements in an array or characters in a string.