Look at the following pseudocode algorithm: algorithm Test14(int x)
If (x

Name: Look at the following pseudocode algorithm: algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What is the depth of Test14(7)? A) 0 B) 1 C) 6 D) 7
Brand: Quizplus
Rating: 4.9 (33 reviews)

Question

Look at the following pseudocode algorithm: algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8) + 8)
End Test14
What is the depth of Test14(7)?
A) 0
B) 1
C) 6
D) 7

Quizplus · Accepted Answer

The depth of the recursive call is the number of times the function calls itself before reaching a base case. Since Test14(7) directly returns 2 * 7 without any recursive call, the depth is 0.

Look at the Following Pseudocode Algorithm: Algorithm Test14(int X)