A(n) _____ represents a single dot on an output device.?

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

1. A recursive algorithm is never the only way to solve a problem. 2. The depth of recursion refers to the length and complexity of the recursive algorithm. 3. For a recursive algorithm, the base case is optional. 4. In a recursive algorithm, there must be a conditional expression which will be used to determine when to terminate the recursive calls.

A ____________ is a linked list in which the “last” node points to the “first” node.

A. infinite linked list B. wrapper list C. fully connected linked list D. circular linked list