A(n) ____ is a variable that is used within a function.

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

1. The base case is the aspect of a problem that can be solved without recursion. 2. The recursive case of a problem is solved without recursion. 3. The number of times a method calls itself is known as the depth of iteration. 4. Recursion can be a powerful tool for solving repetitive problems. 5. The following is an example of a base case for a summation algorithm (the sum of the numbers from 0 to n): If n > 0 then summation (n) = n + summation (n-1)

Draw and annotate a class hierarchy that represents various types of faculty at a university. Show what characteristics would be represented in the various classes of the hierarchy. Explain how polymorphism could play a role in the process of assigning courses to each faculty member.

What will be an ideal response?