CS 159 (Lab 9)

According to the course standards a for loop should only be used with counter-controlled processes.

True

According to the course standards if all three expressions are not needed in a for loop then you should instead make use of a while loop for your pretest looping needs.

True

All while loops can be converted into for loops that abide by course standards.

False

You can make use of x++, ++x, x += 1, and x = x + 1 interchangeably as the

update (third) expression of a for loop to increment the loop control variable.

True

The gcc compiler as used on the guru.itap.purdue.edu server this semester will permit a variable to be declared and initialized in the first expression of a for loop.

False

The update expression of a for loop may only make use of the addition or subtraction operator (includes ++, --, +=, -=, +, -).

False

This for loop will iterate 10 times: for(i = 0; i < 10; i++)

True

This for loop will iterate 5 times: for(i = 12345; i != 0; i /= 10)

True

This for loop will iterate 6 times: for(i = 1; i <= 32; i * 2)

False (i goes 7 times)

The short-circuit method of evaluating logical expressions does not apply to loop control

expressions.

False

Control-forcing statements such as break, continue, and the use of multiple return statements in a user-defined function are prohibited by course standards as mechanisms to terminate repetitive processes.

True

The condition in a recursive function when which the recursive function calls stop is

known as the base case.

True

Recursion should not be used with event-controlled processes as the result may be more function calls than the memory of the computer can handle.

True

A large number of recursive function calls may result in a crash due to running out of

memory.

True

An iterative solution is one that is implemented using a looping construct.

True

Recursive solutions may involve heavy use of the limited resources of the computer

because they involve a potentially large number of function calls.

True

Iterative solutions are always better than recursive ones.

False