Activation records and call stack in Compiler Design - Time & Space Complexity

Time Complexity: Activation records and call stack

O(n)

Understanding Time Complexity

When functions call other functions, the computer uses activation records to keep track of each call.

We want to understand how the number of these records grows as more function calls happen.

Scenario Under Consideration

Analyze the time complexity of the following recursive function using activation records.

function factorial(n) {
  if (n == 0) return 1;
  else return n * factorial(n - 1);
}
    

This function calls itself repeatedly, creating an activation record for each call until it reaches the base case.

Identify Repeating Operations

Look at the recursive calls that repeat.

• Primary operation: Each call to factorial creates a new activation record.
• How many times: Exactly n + 1 times for input n (from n down to 0).

How Execution Grows With Input

Each increase in n adds one more function call and activation record.

Input Size (n)	Approx. Operations (Activation Records)
10	11
100	101
1000	1001

Pattern observation: The number of activation records grows directly with n.

Final Time Complexity

Time Complexity: O(n)

This means the number of function calls and activation records grows linearly as the input number increases.

Common Mistake

[X] Wrong: "The recursive calls happen all at once, so the time is constant regardless of input size."

[OK] Correct: Each call waits for the next one to finish, so calls stack up one after another, increasing with input size.

Interview Connect

Understanding how activation records grow helps you explain recursion depth and stack usage clearly, a key skill in many programming discussions.

Self-Check

What if the function called itself twice in each call (like in Fibonacci)? How would the time complexity and activation records grow?

Practice

1. What is the main purpose of an activation record in a program's execution?

easy

A. To store information about a function call such as parameters and local variables

B. To manage the computer's memory allocation for the entire program

C. To compile the source code into machine code

D. To display output on the screen

Solution

1. Step 1: Understand what an activation record stores

   An activation record holds details about a specific function call, including parameters, local variables, and return address.

2. Step 2: Identify the main purpose

   This helps the program keep track of function calls and return correctly after execution.

3. Final Answer:

   To store information about a function call such as parameters and local variables -> Option A

4. Quick Check:

   Activation record = function call info [OK]

Hint: Activation record = function call details stored [OK]

Common Mistakes:

• Confusing activation record with overall memory management
• Thinking activation record compiles code
• Assuming activation record handles output display

2. Which of the following correctly describes the call stack's behavior during function calls?

easy

A. It executes functions in parallel without stacking

B. It removes the activation record before the function starts

C. It stores all activation records in a queue structure

D. It adds a new activation record on top when a function is called

Solution

1. Step 1: Recall how the call stack works

   The call stack adds (pushes) a new activation record on top each time a function is called.

2. Step 2: Confirm the correct description

   This stacking ensures the program knows which function is currently running and where to return after completion.

3. Final Answer:

   It adds a new activation record on top when a function is called -> Option D

4. Quick Check:

   Call stack pushes activation records [OK]

Hint: Call stack pushes new records on function call [OK]

Common Mistakes:

• Thinking activation records are removed before function starts
• Confusing stack with queue behavior
• Assuming functions run in parallel without stacking

3. Consider this sequence of function calls: main() calls funcA(), which calls funcB(). What is the order of activation records on the call stack just before funcB() finishes?

medium

A. funcB at bottom, funcA in middle, main on top

B. funcA at bottom, main in middle, funcB on top

C. main at bottom, funcA in middle, funcB on top

D. funcB at bottom, main in middle, funcA on top

Solution

1. Step 1: Understand call stack order

   The call stack adds activation records in order of calls: main first, then funcA, then funcB on top.

2. Step 2: Determine stack order before funcB finishes

   Since funcB is currently running, its record is on top, with funcA below it, and main at the bottom.

3. Final Answer:

   main at bottom, funcA in middle, funcB on top -> Option C

4. Quick Check:

   Call stack order = main, funcA, funcB [OK]

Hint: Last called function's record is on top [OK]

Common Mistakes:

• Reversing the order of activation records
• Confusing bottom and top of the stack
• Assuming parallel execution changes stack order

4. A programmer notices that after a function returns, the call stack still contains its activation record. What is the most likely cause?

medium

A. The function was never called

B. The activation record was not properly removed (popped) from the stack

C. The call stack is implemented as a queue

D. The program has no functions

Solution

1. Step 1: Understand normal call stack behavior on return

   When a function finishes, its activation record should be removed (popped) from the call stack.

2. Step 2: Identify cause of leftover activation record

   If the record remains, it means the stack pop operation did not happen correctly.

3. Final Answer:

   The activation record was not properly removed (popped) from the stack -> Option B

4. Quick Check:

   Activation record must be popped after return [OK]

Hint: Function return must pop activation record [OK]

Common Mistakes:

• Assuming function was never called
• Confusing stack with queue behavior
• Ignoring that program has functions

5. In a recursive function that calls itself 4 times before returning, how many activation records will be on the call stack at the deepest point of recursion?

hard

A. 5

B. 2

C. 1

D. 4

Solution

1. Step 1: Understand recursion and activation records

   Each recursive call adds a new activation record to the call stack.

2. Step 2: Count total activation records

   If the function calls itself 4 times, there are 4 new calls plus the original call, totaling 5 activation records on the stack.

3. Final Answer:

   5 -> Option A

4. Quick Check:

   Recursive calls + original = 5 activation records [OK]

Hint: Count original call plus recursive calls [OK]

Common Mistakes:

• Counting only recursive calls, ignoring original
• Assuming recursion does not add activation records
• Confusing number of calls with return points