Add the INSTALL DESKTOP COMPUTER use case to the upper right area of the diagram. This use case extends the ADD NEW COMPUTER use case.

Answer the following statements true (T) or false (F)

1. Subproblems that a recursive search solution generates need not reach a base case. 2. You can use induction to prove that a recursive algorithm either is correct or performs a certain amount of work. 3. Little relationship exists between mathematical induction and recursion.

When a variable’s name is placed in the call statement, is it a call by value (i.e., is a copy of the variable’s data being passed) or a call by reference (i.e. the address being passed)? Hint: this is a trick question.

What will be an ideal response?