Q
Medium 1 Mark
Computer Studies Programming Fundamentals
Which characteristic of an algorithm means it must end after a finite number of steps?
Explanation
Finiteness means an algorithm must end after a finite number of steps. An algorithm that runs forever is not a valid algorithm.
Reference: Computer Studies , Page 1
Hint
Finite = limited/ending.
Similar Questions
What is a key advantage of an interpreter over a compiler?
Medium Computer Studies
Which of the following is NOT an advantage of flowcharts?
Medium Computer Studies
What do flow lines (arrows) represent in a flowchart?
Easy Computer Studies
How many inputs may an algorithm take?
Easy Computer Studies
When does a compiler display errors in a program?
Medium Computer Studies