Static memory allocation patterns in Embedded C - Time & Space Complexity

Time Complexity: Static memory allocation patterns

O(n)

Understanding Time Complexity

Let's explore how the time cost behaves when using static memory allocation in embedded C.

We want to know how the program's running time changes as the size of statically allocated data grows.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

#define SIZE 100

int data[SIZE];

void initialize() {
    for (int i = 0; i < SIZE; i++) {
        data[i] = i * 2;
    }
}
    

This code statically allocates an array and fills it with values using a loop.

Identify Repeating Operations

Look for repeated actions in the code.

• Primary operation: The for-loop that assigns values to each array element.
• How many times: Exactly SIZE times, once per element.

How Execution Grows With Input

As the array size grows, the loop runs more times, doing more work.

Input Size (n)	Approx. Operations
10	10 assignments
100	100 assignments
1000	1000 assignments

Pattern observation: The number of operations grows directly with the size of the array.

Final Time Complexity

Time Complexity: O(n)

This means the time to initialize grows in a straight line as the array size increases.

Common Mistake

[X] Wrong: "Static memory allocation means the program runs instantly regardless of size."

[OK] Correct: Even though memory is fixed at compile time, the program still needs to do work for each element during initialization, so time grows with size.

Interview Connect

Understanding how loops over statically allocated arrays affect time helps you explain performance clearly and confidently in real projects.

Self-Check

"What if we replaced the for-loop with a function that initializes only half the array? How would the time complexity change?"

Practice

1. What is the main characteristic of static memory allocation in embedded C?

easy

A. Memory size is fixed at compile time and cannot change during execution.

B. Memory is allocated dynamically during program execution.

C. Memory is allocated only when a function is called.

D. Memory size can grow or shrink based on input data.

Solution

1. Step 1: Understand static memory allocation

   Static memory allocation means reserving memory before the program runs, with a fixed size.

2. Step 2: Compare with dynamic allocation

   Dynamic allocation changes size during execution, but static does not.

3. Final Answer:

   Memory size is fixed at compile time and cannot change during execution. -> Option A

4. Quick Check:

   Static memory = fixed size [OK]

Hint: Static means fixed size known before running [OK]

Common Mistakes:

• Confusing static with dynamic allocation
• Thinking static memory can resize
• Assuming static memory is allocated at runtime

2. Which of the following declarations uses static memory allocation correctly in embedded C?

easy

A. int *arr; arr = calloc(10, sizeof(int));

B. int *arr = malloc(10 * sizeof(int));

C. int arr[];

D. int arr[10];

Solution

1. Step 1: Identify static allocation syntax

   Static arrays are declared with fixed size like int arr[10];

2. Step 2: Recognize dynamic allocation

   malloc and calloc allocate memory dynamically at runtime, not static.

3. Final Answer:

   int arr[10]; -> Option D

4. Quick Check:

   Static array declaration = int arr[10]; [OK]

Hint: Static arrays use fixed size brackets [] [OK]

Common Mistakes:

• Using malloc or calloc for static allocation
• Not specifying array size for static arrays
• Confusing pointer declarations with arrays

3. What will be the output of this code snippet in embedded C?

static int buffer[5] = {1, 2, 3, 4, 5};

void main() {
    for(int i = 0; i < 5; i++) {
        buffer[i] += 1;
        printf("%d ", buffer[i]);
    }
}

medium

A. Compilation error due to static keyword

B. 2 3 4 5 6

C. 0 1 2 3 4

D. 1 2 3 4 5

Solution

1. Step 1: Understand static array initialization

   The static array buffer starts with values {1, 2, 3, 4, 5} fixed at compile time.

2. Step 2: Trace the loop increment and print

   Each element is increased by 1, so values become {2, 3, 4, 5, 6} and printed.

3. Final Answer:

   2 3 4 5 6 -> Option B

4. Quick Check:

   Increment each element by 1 = 2 3 4 5 6 [OK]

Hint: Static arrays behave like normal arrays with fixed size [OK]

Common Mistakes:

• Thinking static causes compile error
• Forgetting to increment values before printing
• Confusing static with uninitialized variables

4. Identify the error in this static memory allocation code snippet:

void main() {
    static int data[];
    data[0] = 10;
    printf("%d", data[0]);
}

medium

A. Cannot assign value to static array elements.

B. Static keyword cannot be used inside functions.

C. Array size is not specified for static array.

D. Missing return type for main function.

Solution

1. Step 1: Check static array declaration

   Static arrays must have size or initializer; data[] without size or init is invalid.

2. Step 2: Verify other code parts

   Static inside functions is allowed; assigning values and printing is valid; main return type is void (allowed in embedded C).

3. Final Answer:

   Array size is not specified for static array. -> Option C

4. Quick Check:

   Static array needs size or initializer [OK]

Hint: Static arrays need size or initializer [OK]

Common Mistakes:

• Assuming static arrays can omit size without initializer
• Thinking static is disallowed inside functions
• Confusing main return type errors with static errors

5. You need to store sensor readings in a fixed-size buffer that must retain values between function calls in embedded C. Which static memory allocation pattern is best suited?

hard

A. Declare a static array inside the function to hold readings.

B. Use dynamic memory allocation with malloc inside the function.

C. Declare a local array inside the function without static keyword.

D. Use global variables without static keyword.

Solution

1. Step 1: Understand requirement for retaining values

   Values must persist between calls, so memory must not be reinitialized each time.

2. Step 2: Choose static array inside function

   Static array inside function keeps values between calls and has fixed size, perfect for sensor buffer.

3. Step 3: Exclude other options

   Dynamic allocation is flexible but not static; local array resets each call; global without static may cause namespace issues.

4. Final Answer:

   Declare a static array inside the function to hold readings. -> Option A

5. Quick Check:

   Static inside function retains data between calls [OK]

Hint: Static inside function keeps data persistent [OK]

Common Mistakes:

• Using local arrays that reset each call
• Choosing dynamic allocation when fixed size needed
• Ignoring static keyword for persistence