State graphs and transitions in Agentic AI - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding State Transitions in Agentic AI

In an agentic AI system, a state graph represents possible states and transitions between them. Which statement best describes a deterministic transition?

A Each state has exactly one possible next state for a given action.

B A state can transition to multiple next states randomly for the same action.

C Transitions depend on external random noise, making outcomes unpredictable.

D States loop back to themselves without any change.

💡 Hint

Think about whether the next state is fixed or can vary for the same action.

Deterministic transitions mean that for a given state and action, the next state is always the same, with no randomness involved.

❓ Predict Output

intermediate

Output of State Transition Function

Given the following Python function representing state transitions, what is the output of next_state('S1', 'a')?

Agentic AI

def next_state(current_state, action):
    transitions = {
        'S1': {'a': 'S2', 'b': 'S3'},
        'S2': {'a': 'S2', 'b': 'S1'},
        'S3': {'a': 'S1', 'b': 'S3'}
    }
    return transitions.get(current_state, {}).get(action, 'Invalid')

print(next_state('S1', 'a'))

A 'S3'

B 'Invalid'

C 'S1'

D 'S2'

💡 Hint

Check the dictionary for state 'S1' and action 'a'.

The dictionary maps 'S1' with action 'a' to 'S2', so the function returns 'S2'.

❓ Hyperparameter

advanced

Choosing Transition Probability in Stochastic State Graphs

In a stochastic state graph, transitions have probabilities. If you want the agent to explore more states randomly, which transition probability setting is best?

A Assign high probability to one transition and near zero to others.

B Assign equal probabilities to all possible transitions.

C Assign zero probability to all transitions except one.

D Assign probabilities based on the shortest path only.

💡 Hint

Think about how equal chances affect exploration.

Equal probabilities encourage the agent to explore all possible next states rather than favoring one.

❓ Metrics

advanced

Evaluating State Transition Model Accuracy

You have a model predicting next states in a state graph. Which metric best measures how often the model predicts the correct next state?

A Accuracy

B Precision

C Mean Squared Error (MSE)

D Recall

💡 Hint

Consider a metric that counts correct predictions over total predictions.

Accuracy measures the fraction of correct next state predictions out of all predictions.

🔧 Debug

expert

Debugging State Transition Code

What error does the following code raise when calling get_next_state('S1', 'c')?

def get_next_state(state, action):
    transitions = {
        'S1': {'a': 'S2', 'b': 'S3'},
        'S2': {'a': 'S2', 'b': 'S1'},
        'S3': {'a': 'S1', 'b': 'S3'}
    }
    return transitions[state][action]

print(get_next_state('S1', 'c'))

A TypeError

B IndexError

C KeyError

D No error, returns None

💡 Hint

Check what happens if the action key does not exist in the dictionary.

Accessing a missing key in a dictionary raises a KeyError in Python.

Practice

1. What does a state graph primarily represent in agentic AI?

easy

A. The hardware specifications needed for AI training

B. The exact code syntax for AI algorithms

C. The final output predictions of a machine learning model

D. The different situations an AI agent can be in and how it moves between them

Solution

1. Step 1: Understand the purpose of state graphs

   State graphs show different states (situations) and how an AI agent moves between them.

2. Step 2: Compare options to this definition

   Only The different situations an AI agent can be in and how it moves between them describes states and transitions; others talk about unrelated AI aspects.

3. Final Answer:

   The different situations an AI agent can be in and how it moves between them -> Option D

4. Quick Check:

   State graph = states + transitions [OK]

Hint: State graphs = states + moves between states [OK]

Common Mistakes:

• Confusing state graphs with code syntax
• Thinking state graphs show hardware details
• Assuming state graphs show final model outputs

2. Which of the following correctly shows a transition from state S1 to S2 triggered by action 'a' in a state graph?

easy

A. S1 --a--> S2

B. S1 => S2 : a

C. S1 -a- S2

D. S1 ->a S2

Solution

1. Step 1: Recall standard notation for transitions

   Transitions are often shown as State1 --action--> State2.

2. Step 2: Match options to this notation

   S1 --a--> S2 matches the standard arrow with action label; others use incorrect or unclear syntax.

3. Final Answer:

   S1 --a--> S2 -> Option A

4. Quick Check:

   Transition notation = S1 --a--> S2 [OK]

Hint: Look for arrow with action label between states [OK]

Common Mistakes:

• Using arrows without action labels
• Confusing syntax with programming code
• Ignoring the direction of the arrow

3. Given the state graph transitions:
S1 --a--> S2
S2 --b--> S3
What is the final state after actions ['a', 'b'] starting from S1?

medium

A. S3

B. S1

C. S2

D. Undefined

Solution

1. Step 1: Follow the first action 'a' from S1

   Action 'a' moves from S1 to S2.

2. Step 2: Follow the second action 'b' from S2

   Action 'b' moves from S2 to S3.

3. Final Answer:

   S3 -> Option A

4. Quick Check:

   Actions 'a', 'b' lead S1 -> S2 -> S3 [OK]

Hint: Trace actions step-by-step through states [OK]

Common Mistakes:

• Stopping after first action
• Mixing up action order
• Assuming no transitions exist

4. Consider this state graph code snippet in Python:

transitions = { 'S1': {'a': 'S2'}, 'S2': {'b': 'S3'} }
current_state = 'S1'
actions = ['a', 'c']
for act in actions:
    current_state = transitions[current_state][act]

What error will occur when running this code?

medium

A. IndexError due to list access

B. TypeError because current_state is a string

C. KeyError because action 'c' is not valid from S2

D. No error, final state is S3

Solution

1. Step 1: Check transitions for each action

   From 'S1', action 'a' leads to 'S2'. Next action 'c' is not in transitions['S2'].

2. Step 2: Identify error type

   Accessing transitions['S2']['c'] causes a KeyError because 'c' key is missing.

3. Final Answer:

   KeyError because action 'c' is not valid from S2 -> Option C

4. Quick Check:

   Missing key in dict = KeyError [OK]

Hint: Check if action exists in current state's transitions [OK]

Common Mistakes:

• Assuming all actions are valid
• Confusing KeyError with TypeError
• Ignoring dictionary key checks

5. You want to design an AI agent that can move between states S1, S2, and S3 with transitions:
S1 --a--> S2, S2 --b--> S3, and S3 --c--> S1.
Which data structure best models these transitions for easy lookup and update?

hard

A. A list of tuples with (state, action, next_state)

B. A dictionary where keys are states and values are dictionaries of actions to next states

C. A flat list of states without actions

D. A string describing all transitions

Solution

1. Step 1: Understand the need for quick lookup by state and action

   We want to find next state given current state and action quickly.

2. Step 2: Evaluate data structures

   A dictionary of dictionaries allows direct lookup: transitions[state][action] = next_state.

3. Final Answer:

   A dictionary where keys are states and values are dictionaries of actions to next states -> Option B

4. Quick Check:

   Nested dict = fast state-action lookup [OK]

Hint: Use nested dict for state-action-next_state mapping [OK]

Common Mistakes:

• Using lists which are slower for lookups
• Ignoring the action in transitions
• Storing transitions as plain strings