*** 21. What is ISR (Interrupt Service Routine)?

An ISR (Interrupt Service Routine) is a special function executed automatically when an interrupt occurs.

It is also called:

Interrupt Handler

---

Purpose

Handles urgent events like:

• Keyboard input
• Timer events
• Sensor signals
• Hardware communication

---

Flow

Interrupt Occurs
       ↓
CPU pauses current task
       ↓
ISR executes
       ↓
CPU resumes previous task

---

Example

void ISR_Timer() {

    timerFlag = 1;
}

---

Important Features

• Executes quickly
• Hardware-triggered
• High priority

---

Interview Insight

Very important embedded systems interview topic.

---

*** 22. Best practices for writing ISRs?

ISRs should be:

Short, fast, and efficient

---

Best Practices

1. Keep ISR Short

Avoid lengthy operations.

---

2. Avoid Delays

Do not use:

delay()
sleep()

inside ISR.

---

3. Avoid Heavy Computation

Complex logic increases interrupt latency.

---

4. Use volatile Variables

Shared variables should be:

volatile

---

5. Avoid Dynamic Memory Allocation

Avoid:

malloc()
free()

inside ISR.

---

6. Minimize Global Variable Access

Prevents race conditions.

---

7. Clear Interrupt Flags Properly

Otherwise interrupt may repeatedly trigger.

---

Interview Insight

Very common question:

“Why should ISRs be short?”

Because long ISRs block other interrupts and reduce system responsiveness.

---

** 23. What is watchdog timer (WDT)?

A Watchdog Timer (WDT) is a hardware timer used to detect software hangs or failures.

---

Working

Program must periodically reset:

feed/kick the watchdog

If not reset in time:

System automatically resets

---

Purpose

Improves:

• Reliability
• Fault recovery
• System stability

---

Common Uses

• Embedded systems
• Automotive systems
• Medical devices

---

Example Flow

Program running normally
       ↓
WDT refreshed regularly
       ↓
If software hangs
       ↓
WDT timeout occurs
       ↓
System reset

---

Interview Insight

Very common embedded interview question.

---

*** 24. UART vs SPI vs I2C

These are communication protocols used in embedded systems.

---

Comparison Table

---

1. UART

Features

• TX and RX lines
• No clock signal

---

Uses

• Serial communication
• GPS modules
• Bluetooth modules

---

2. SPI

Features

• Full duplex
• Very fast

---

Signals

MOSI
MISO
SCK
SS

---

Uses

• SD cards
• Displays
• Sensors

---

3. I2C

Features

• Two-wire protocol
• Multiple devices supported

---

Signals

SDA
SCL

---

Uses

• EEPROM
• RTC modules
• Sensors

---

Interview Insight

Very frequently asked embedded interview topic.

---

*** 25. Polling vs interrupt

---

Polling

CPU continuously checks device status.

---

Example

while(flag == 0) {
}

---

Interrupt

Hardware notifies CPU only when event occurs.

---

Advantage

CPU can perform other tasks meanwhile.

---

Best Use Cases

Polling

• Simple systems

Interrupt

• Real-time systems
• Time-critical systems

---

Interview Insight

Common question:

“Why are interrupts preferred?”

Because they improve CPU efficiency.

---

** 26. What is real-time system?

A real-time system is a system where correctness depends on:

• Logical result
• Timing of result

---

Important Point

Task must complete within:

Deadline

---

Types of Real-Time Systems

1. Hard Real-Time

Missing deadline is unacceptable.

Examples

• Airbags
• Medical devices

---

2. Soft Real-Time

Occasional delay acceptable.

Examples

• Video streaming
• Gaming

---

Features

• Predictable timing
• Fast response
• Reliability

---

Interview Insight

Very important embedded systems concept.

---

*** 27. What is race condition?

A race condition occurs when multiple threads/tasks access shared data simultaneously and outcome depends on execution order.

---

Example

count++;

Two threads updating same variable may produce incorrect result.

---

Problems

• Data corruption
• Inconsistent output
• Random bugs

---

Prevention

Use:

• Mutex
• Semaphore
• Atomic operations

---

Example

pthread_mutex_lock(&lock);

count++;

pthread_mutex_unlock(&lock);

---

Interview Insight

Very common multithreading interview question.

---

*** 28. Role of volatile in embedded systems

volatile tells compiler:

Variable may change unexpectedly

---

Why Important?

Embedded systems interact with:

• Hardware registers
• ISRs
• Shared memory

---

Example

volatile int flag;

---

Without volatile

Compiler may optimize variable access incorrectly.

---

Common Uses

• Hardware registers
• Interrupt flags
• Memory-mapped I/O

---

Interview Insight

Very frequently asked embedded C interview topic.

---

*** 29. How to access hardware registers in Embedded C?

Hardware registers are usually accessed using:

Memory-mapped I/O

---

Example

#define PORTA (*(volatile unsigned int*)0x4000)

---

Write to Register

PORTA = 1;

---

Read from Register

int value = PORTA;

---

Why volatile?

Register values may change due to hardware activity.

---

Interview Insight

Very important low-level embedded programming concept.

---

** 30. Bootloader vs firmware

---

Bootloader

Small program that:

• Initializes hardware
• Loads firmware
• Supports firmware updates

---

Examples

• BIOS
• U-Boot

---

Firmware

Software permanently programmed into device memory.

Controls:

• Hardware
• Device operations

---

Examples

• Router firmware
• Washing machine firmware

---

Flow

Power ON
   ↓
Bootloader executes
   ↓
Firmware loads
   ↓
Device operates

---

Interview Insight

Very common embedded systems interview topic.

*** 31. Common optimization techniques in C

Optimization techniques improve:

• Execution speed
• Memory usage
• CPU efficiency

---

Common Techniques

1. Use Efficient Algorithms

Algorithm optimization gives biggest performance gain.

Example

O(n log n) faster than O(n²)

---

2. Minimize Function Calls

Use:

inline

for small frequently used functions.

---

3. Reduce Memory Access

Store frequently used values in local variables.

---

4. Use Bitwise Operations

Example:

x << 1

instead of:

x * 2

---

5. Improve Cache Locality

Access contiguous memory sequentially.

---

6. Avoid Unnecessary Dynamic Allocation

Heap allocation is slower than stack allocation.

---

7. Loop Optimization

• Loop unrolling
• Reduce repeated calculations

---

8. Compiler Optimization Flags

-O1
-O2
-O3

---

Interview Insight

Very common question:

“What optimization should be avoided first?”

Premature optimization without profiling.

---

*** 32. What are common runtime errors in C?

Runtime errors occur during program execution.

---

Common Runtime Errors

1. Segmentation Fault

Invalid memory access.

---

2. Null Pointer Dereference

*p = 10;

when pointer is NULL.

---

3. Buffer Overflow

Writing outside array bounds.

---

4. Division by Zero

x / 0

---

5. Stack Overflow

Deep or infinite recursion.

---

6. Memory Leak

Allocated memory not freed.

---

7. Use-After-Free

Accessing memory after:

free()

---

8. Double-Free

Freeing same memory twice.

---

Interview Insight

Debugging tools:

• gdb
• Valgrind
• AddressSanitizer

are commonly discussed in interviews.

---

*** 33. Explain heap vs stack performance

---

Stack Performance

Advantages

• Very fast allocation/deallocation
• Good cache locality

---

Example

int x;

---

Heap Performance

Advantages

• Dynamic memory allocation
• Flexible size

---

Drawbacks

• Slower allocation
• Fragmentation possible

---

Example

malloc(sizeof(int));

---

Interview Insight

Very common question:

“Why is stack faster than heap?”

Because stack uses simple pointer movement while heap requires memory management logic.

---

*** 34. Explain memory alignment impact on performance

Memory alignment means storing data at addresses suitable for CPU architecture.

---

Example

An int may be aligned at:

4-byte boundary

---

Why Important?

Aligned memory access:

• Faster
• Requires fewer CPU cycles

Misaligned access:

• Slower
• May require multiple memory operations

---

Example

struct Test {
    char c;
    int x;
};

Compiler may add padding for alignment.

---

Benefits of Alignment

• Better CPU efficiency
• Faster cache access

---

Interview Insight

Very important low-level systems topic.

---

*** 35. Explain stack overflow in recursion

Stack overflow occurs when recursion consumes too much stack memory.

---

Main Causes

1. Infinite Recursion

No base condition.

---

2. Very Deep Recursion

Too many recursive calls.

---

Example

void test() {
    test();
}

---

What Happens?

Each recursive call creates new stack frame until stack memory is exhausted.

---

Result

Program crash

---

Prevention

• Proper base condition
• Use iterative approach when possible

---

Interview Insight

Very common recursion interview question.

---

*** 36. How recursion uses stack memory

Each recursive call creates a new:

Stack Frame

---

Stack Frame Contains

• Function parameters
• Local variables
• Return address

---

Example

factorial(3)

creates:

factorial(3)
factorial(2)
factorial(1)

---

Execution Flow

Calls are pushed into stack and removed after completion.

---

Visualization

Top
-----
f(1)
f(2)
f(3)
-----
Bottom

---

Interview Insight

Very important concept for recursion debugging.

---

*** 37. Explain cache-friendly programming

Cache-friendly programming improves CPU cache usage for better performance.

---

Key Idea

Access nearby memory locations together.

---

Good Example

for(int i = 0; i < n; i++) {
    arr[i];
}

Sequential array access has good cache locality.

---

Poor Example

Linked list traversal often has poor locality because nodes are scattered.

---

Benefits

• Faster execution
• Fewer cache misses
• Better CPU utilization

---

Common Techniques

• Use arrays instead of linked lists when possible
• Access memory sequentially
• Reduce random memory access

---

Interview Insight

Very important performance optimization topic.

---

** 38. Explain compiler optimizations

Compiler optimizations improve generated machine code performance.

---

Common Optimization Levels

---

Common Compiler Optimizations

1. Constant Folding

2 + 3

becomes:

5

---

2. Dead Code Elimination

Unused code removed.

---

3. Inline Expansion

Function calls replaced with function body.

---

4. Loop Optimization

Improves loop execution efficiency.

---

5. Register Allocation

Frequently used variables stored in CPU registers.

---

Interview Insight

Very common question:

“Can optimization change program behavior?”

Yes, especially if program contains undefined behavior.

---

*** 39. Reverse linked list iteratively and recursively

1. Iterative Reversal

---

Logic

Use:

• prev
• current
• next

---

Program

struct Node* reverse(struct Node* head) {

    struct Node *prev = NULL;
    struct Node *current = head;
    struct Node *next = NULL;

    while(current != NULL) {

        next = current->next;

        current->next = prev;

        prev = current;

        current = next;
    }

    return prev;
}

---

Time Complexity

O(n)

---

Space Complexity

O(1)

---

2. Recursive Reversal

---

Program

struct Node* reverse(struct Node* head) {

    if(head == NULL || head->next == NULL)
        return head;

    struct Node* rest = reverse(head->next);

    head->next->next = head;

    head->next = NULL;

    return rest;
}

---

Time Complexity

O(n)

---

Space Complexity

O(n)

due to recursion stack.

---

Interview Insight

Very frequently asked linked-list coding problem.

---

*** 40. Detect loop in linked list (Floyd cycle detection)

Floyd Cycle Detection Algorithm uses:

• Slow pointer
• Fast pointer

---

Logic

Slow Pointer

Moves:

1 step

Fast Pointer

Moves:

2 steps

If loop exists:

Both pointers meet

---

Program

int hasCycle(struct Node *head) {

    struct Node *slow = head;
    struct Node *fast = head;

    while(fast && fast->next) {

        slow = slow->next;

        fast = fast->next->next;

        if(slow == fast)
            return 1;
    }

    return 0;
}

---

Time Complexity

O(n)

---

Space Complexity

O(1)

---

Interview Insight

Also called:

Tortoise and Hare Algorithm

Very common DSA interview question.