Why state machines are used in embedded in Embedded C - Test Your Understanding

Practice - 5 Tasks

1fill in blank

easy

Complete the code to define the initial state of the state machine.

Embedded C

enum State { INIT, RUNNING, ERROR };
State currentState = [1];

Drag options to blanks, or click blank then click option'

ARUNNING

BINIT

CERROR

DSTOPPED

Attempts:

3 left

💡 Hint

Common Mistakes

Choosing a state that is not defined like STOPPED.

Starting directly in ERROR or RUNNING state.

The initial state is usually set to INIT to start the state machine properly.

2fill in blank

medium

Complete the code to transition from INIT to RUNNING state.

Embedded C

if (currentState == INIT) {
    currentState = [1];
}

Drag options to blanks, or click blank then click option'

ARUNNING

BERROR

CINIT

DSTOPPED

Attempts:

3 left

💡 Hint

Common Mistakes

Setting the state back to INIT causing a loop.

Using an undefined state like STOPPED.

After initialization, the state machine moves to the RUNNING state to perform its main tasks.

3fill in blank

hard

Fix the error in the switch statement to handle the ERROR state.

Embedded C

switch (currentState) {
    case INIT:
        // initialization code
        break;
    case RUNNING:
        // running code
        break;
    case [1]:
        // error handling code
        break;
    default:
        break;
}

Drag options to blanks, or click blank then click option'

ASTOPPED

BINIT

CRUNNING

DERROR

Attempts:

3 left

💡 Hint

Common Mistakes

Using a state that does not exist like STOPPED.

Repeating INIT or RUNNING in the error case.

The ERROR state must be handled explicitly in the switch to manage error conditions.

4fill in blank

hard

Fill both blanks to check if the state machine is in RUNNING state and then set it to ERROR.

Embedded C

if (currentState == [1]) {
    currentState = [2];
}

Drag options to blanks, or click blank then click option'

ARUNNING

BINIT

CERROR

DSTOPPED

Attempts:

3 left

💡 Hint

Common Mistakes

Swapping the states in condition and assignment.

Using undefined states like STOPPED.

This code checks if the machine is RUNNING and sets it to ERROR if a problem occurs.

5fill in blank

hard

Fill all three blanks to create a dictionary that maps states to their string names.

Embedded C

const char* stateNames[] = { [1], [2], [3] };

Drag options to blanks, or click blank then click option'

A"INIT"

B"RUNNING"

C"ERROR"

D"STOPPED"

Attempts:

3 left

💡 Hint

Common Mistakes

Including undefined states like STOPPED.

Mixing the order of state names.

This array holds the string names for each state in order: INIT, RUNNING, ERROR.

Practice

1. Why are state machines commonly used in embedded systems?

easy

A. To reduce the physical size of the embedded device

B. To increase the clock speed of the processor

C. To organize device behavior into clear, manageable steps

D. To store large amounts of data efficiently

Solution

1. Step 1: Understand the purpose of state machines

   State machines break down complex device behavior into smaller, clear steps called states.

2. Step 2: Identify the benefit in embedded systems

   This organization helps manage complexity and makes the system easier to design and debug.

3. Final Answer:

   To organize device behavior into clear, manageable steps -> Option C

4. Quick Check:

   State machines = clear steps [OK]

Hint: State machines simplify complex behavior into steps [OK]

Common Mistakes:

• Confusing state machines with hardware speed improvements
• Thinking state machines reduce device size
• Assuming state machines store data

2. Which of the following is the correct way to represent a state machine in embedded C?

easy

A. Using a switch-case statement to handle different states

B. Using a for loop to iterate through states

C. Using a recursive function to call states

D. Using a global variable to store sensor data

Solution

1. Step 1: Identify common state machine structure

   State machines in embedded C are often implemented with switch-case to handle each state clearly.

2. Step 2: Compare other options

   For loops and recursion are not typical for state transitions; global variables store data but don't represent states.

3. Final Answer:

   Using a switch-case statement to handle different states -> Option A

4. Quick Check:

   Switch-case = state machine structure [OK]

Hint: Switch-case is classic for state handling [OK]

Common Mistakes:

• Using loops instead of switch-case for states
• Confusing recursion with state transitions
• Mixing data storage with state control

3. Consider this embedded C code snippet implementing a simple state machine:

enum State {IDLE, RUNNING, STOPPED};
State currentState = IDLE;
switch(currentState) {
  case IDLE:
    currentState = RUNNING;
    break;
  case RUNNING:
    currentState = STOPPED;
    break;
  case STOPPED:
    currentState = IDLE;
    break;
}
printf("%d", currentState);

What will be the output?

medium

A. 0

B. 1

C. 2

D. Compilation error

Solution

1. Step 1: Trace the initial state and switch

   currentState starts at IDLE (0). The switch changes it to RUNNING (1).

2. Step 2: Determine the printed value

   After the switch, currentState is RUNNING, so printf prints 1.

3. Final Answer:

   1 -> Option B

4. Quick Check:

   State IDLE (0) -> RUNNING (1) printed [OK]

Hint: Follow state changes step-by-step [OK]

Common Mistakes:

• Assuming output is initial state value
• Thinking code causes error due to enum
• Confusing state values with strings

4. This embedded C code tries to implement a state machine but has a bug:

enum State {START, PROCESS, END};
State current = START;
switch(current) {
  case START:
    current = PROCESS;
  case PROCESS:
    current = END;
    break;
  case END:
    current = START;
    break;
}

What is the main problem?

medium

A. Missing break after case START causes fall-through

B. Enum values are not initialized

C. Variable current is not declared

D. Switch statement syntax is incorrect

Solution

1. Step 1: Check switch-case structure

   Case START lacks a break, so execution falls through to PROCESS case.

2. Step 2: Understand effect of missing break

   This causes current to skip PROCESS state and jump directly to END, breaking intended flow.

3. Final Answer:

   Missing break after case START causes fall-through -> Option A

4. Quick Check:

   Missing break = fall-through bug [OK]

Hint: Always add break after each case [OK]

Common Mistakes:

• Ignoring missing break causes fall-through
• Thinking enum needs explicit values
• Assuming variable declaration error

5. You want to design an embedded system that controls a traffic light with states: RED, GREEN, YELLOW. Which reason best explains why using a state machine is the best approach?

hard

A. It increases the brightness of the traffic light LEDs

B. It reduces the power consumption of the traffic light hardware

C. It allows the traffic light to store vehicle counts efficiently

D. It clearly defines each light state and transitions, making timing and control simple

Solution

1. Step 1: Identify traffic light control needs

   The system must cycle through RED, GREEN, YELLOW states in order with timing control.

2. Step 2: Understand state machine benefits

   State machines organize these states and transitions clearly, simplifying timing and logic.

3. Final Answer:

   It clearly defines each light state and transitions, making timing and control simple -> Option D

4. Quick Check:

   State machine = clear control flow [OK]

Hint: State machines map clear steps and transitions [OK]

Common Mistakes:

• Confusing state machines with hardware power savings
• Thinking state machines store data counts
• Assuming state machines affect LED brightness