Stack vs heap in embedded context - Quick Revision & Key Differences

Recall & Review

beginner

What is the stack in embedded systems?

The stack is a special memory area that stores local variables, function parameters, and return addresses. It works like a stack of plates: last in, first out.

beginner

What is the heap in embedded systems?

The heap is a memory area used for dynamic memory allocation. It allows programs to request and release memory during runtime.

intermediate

How does stack memory allocation differ from heap allocation?

Stack allocation is automatic and fast, with fixed size per function call. Heap allocation is manual, slower, and can fragment memory over time.

intermediate

Why is stack size usually limited in embedded systems?

Embedded systems have limited RAM, so stack size is small to save memory. Large stacks can cause overflow and crash the system.

advanced

What risks come with using heap memory in embedded systems?

Heap use can cause fragmentation, unpredictable delays, and memory leaks, which are risky in real-time embedded systems.

Which memory area stores local variables in embedded C?

A ROM

B Heap

C Flash

D Stack

Local variables are stored on the stack, which manages function calls and local data.

What is a key characteristic of heap memory?

A Dynamic size and manual allocation

B Fixed size and automatic allocation

C Read-only memory

D Stores CPU registers

Heap memory allows dynamic allocation and deallocation during program execution.

Why should heap usage be minimized in embedded systems?

A Heap is faster than stack

B Heap is read-only

C Heap causes fragmentation and unpredictable delays

D Heap stores only constants

Heap fragmentation and delays can cause problems in real-time embedded systems.

What happens if the stack overflows in an embedded system?

A System may crash or behave unpredictably

B Program runs faster

C Heap memory increases

D CPU temperature decreases

Stack overflow can overwrite important data and cause system crashes.

Which memory area grows upwards in most embedded systems?

A Stack

B Heap

C Flash

D ROM

Heap usually grows upwards, while stack grows downwards in memory.

Explain the differences between stack and heap memory in embedded systems.

Think about how memory is used during function calls versus dynamic requests.

Describe the risks of using heap memory in real-time embedded applications.

Consider what happens if memory is not managed carefully during runtime.

Practice

1. In embedded C, where are local variables inside functions typically stored?

easy

A. On the stack

B. On the heap

C. In flash memory

D. In CPU registers only

Solution

1. Step 1: Understand local variable storage

   Local variables inside functions are temporary and exist only during function execution.

2. Step 2: Identify stack usage in embedded C

   The stack is used to store temporary data like local variables and return addresses.

3. Final Answer:

   On the stack -> Option A

4. Quick Check:

   Local variables = stack [OK]

Hint: Local variables go on stack, dynamic memory on heap [OK]

Common Mistakes:

• Confusing heap with stack for local variables
• Thinking local variables are stored in flash
• Assuming all variables are in CPU registers

2. Which of the following is the correct way to allocate memory dynamically in embedded C?

easy

A. int p = malloc(sizeof(int));

B. int *p = sizeof(int);

C. int *p = malloc(sizeof(int));

D. malloc(int p);

Solution

1. Step 1: Recall malloc syntax

   malloc returns a pointer to allocated memory, so pointer variable is needed.

2. Step 2: Check each option

   int *p = malloc(sizeof(int)); correctly assigns malloc's return to an int pointer. Others misuse types or syntax.

3. Final Answer:

   int *p = malloc(sizeof(int)); -> Option C

4. Quick Check:

   malloc returns pointer, assign to pointer [OK]

Hint: malloc returns pointer, assign to pointer variable [OK]

Common Mistakes:

• Assigning malloc result to non-pointer variable
• Using sizeof without malloc
• Incorrect function call syntax

3. What will happen if you declare a large array inside a function in embedded C on a system with limited stack size?

medium

A. Stack overflow may occur causing a crash

B. Heap memory will be used automatically

C. The array will be stored in flash memory

D. The compiler will convert it to a global variable

Solution

1. Step 1: Understand stack size limits

   Stack size is limited in embedded systems; large local arrays consume stack space.

2. Step 2: Consequence of large stack allocation

   Allocating large arrays locally can exceed stack size, causing overflow and crash.

3. Final Answer:

   Stack overflow may occur causing a crash -> Option A

4. Quick Check:

   Large local arrays risk stack overflow [OK]

Hint: Large local arrays risk stack overflow in embedded [OK]

Common Mistakes:

• Assuming heap is used automatically
• Thinking large arrays go to flash
• Believing compiler auto-converts locals to globals

4. Consider this code snippet in embedded C:

void func() {
  int *p = malloc(10 * sizeof(int));
  // ... use p ...
  // missing free(p);
}

What is the main problem here?

medium

A. Pointer p is not initialized

B. Stack overflow due to large local array

C. Syntax error in malloc usage

D. Memory leak because allocated heap memory is not freed

Solution

1. Step 1: Analyze malloc usage

   Memory is allocated on the heap with malloc but never freed.

2. Step 2: Identify consequences of missing free

   Not freeing heap memory causes memory leak, wasting limited embedded memory.

3. Final Answer:

   Memory leak because allocated heap memory is not freed -> Option D

4. Quick Check:

   Missing free causes memory leak [OK]

Hint: Always free malloc memory to avoid leaks [OK]

Common Mistakes:

• Confusing stack overflow with memory leak
• Thinking malloc syntax is wrong
• Assuming pointer is uninitialized

5. In an embedded system with 2KB stack and 4KB heap, which approach is best to safely allocate a 1KB buffer for temporary data?

hard

A. Declare a local array of 1KB inside a function

B. Use malloc to allocate 1KB on the heap and free after use

C. Declare a global 1KB array to avoid stack and heap

D. Use a static local array inside the function

Solution

1. Step 1: Evaluate stack usage for large buffer

   1KB local array uses half the stack, risking overflow in embedded systems.

2. Step 2: Consider heap allocation safety

   Allocating 1KB on heap with malloc is safer; heap is larger and managed manually.

3. Step 3: Compare global and static arrays

   Global/static arrays use fixed memory but reduce flexibility and increase RAM usage always.

4. Final Answer:

   Use malloc to allocate 1KB on the heap and free after use -> Option B

5. Quick Check:

   Heap allocation safer for large temporary buffers [OK]

Hint: Use heap malloc for large temporary buffers in embedded [OK]

Common Mistakes:

• Using large local arrays risking stack overflow
• Ignoring freeing heap memory
• Assuming global arrays are always best