[Solved] Identify the bug in this retry with exponential backoff pseudocode:max_retries = 3 base_delay = 100 retry_count = 1 while retry_count | Microservices

Microservices - Resilience Patterns

Identify the bug in this retry with exponential backoff pseudocode:

max_retries = 3
base_delay = 100
retry_count = 1
while retry_count <= max_retries:
  wait_time = base_delay * (2 ** retry_count)
  retry_count += 1
  print(wait_time)

ABase delay should be multiplied by retry_count, not exponent

BRetry count should increment after print statement

CRetry count should start at 0 to calculate correct delay

DMax retries should be less than retry count

Step-by-Step Solution

Solution:

Step 1: Analyze retry count initialization
Retry count starts at 1, so first delay is base_delay * 2^1 = 200 instead of 100.
Step 2: Correct initialization for expected delay
Starting retry_count at 0 ensures first delay is base_delay * 2^0 = base_delay (100).
Final Answer:
Retry count should start at 0 to calculate correct delay -> Option C
Quick Check:
Retry count start = 0 for correct delay [OK]

Quick Trick: Start retry count at zero for correct exponential delay [OK]

Common Mistakes:

MISTAKES

Starting retry count at 1
Multiplying delay incorrectly
Incrementing retry count too early

Master "Resilience Patterns" in Microservices

9 interactive learning modes - each teaches the same concept differently

Learn Why Deep Arch Try Challenge Design Recall Scale

More Microservices Quizzes

Identify the bug in this retry with exponential backoff pseudocode:

Step 1: Analyze retry count initialization

Step 2: Correct initialization for expected delay

Final Answer:

Quick Check:

Want More Practice?