Queue-based task processing in Agentic AI - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to add a task to the queue.

Agentic AI

task_queue.[1](new_task)

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

Aremove

Bpop

Cappend

Dclear

Attempts:

3 left

💡 Hint

Common Mistakes

Using pop instead of append removes an item instead of adding.

Using remove tries to delete a specific item, not add one.

To add a task to the queue, we use the append method which adds an item to the end of the list.

2fill in blank

medium

Complete the code to get the next task from the queue.

Agentic AI

next_task = task_queue.[1](0)

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

Aappend

Bpop

Cinsert

Dclear

Attempts:

3 left

💡 Hint

Common Mistakes

Using append adds an item instead of removing.

Using insert adds an item at a position, not remove.

To get and remove the first task from the queue, we use pop(0) which removes the item at index 0.

3fill in blank

hard

Fix the error in the code to check if the queue is empty.

Agentic AI

if len(task_queue) [1] 0:
    print('Queue is empty')

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

A>

B!=

C<

D==

Attempts:

3 left

💡 Hint

Common Mistakes

Using '!=' checks for non-empty instead of empty.

Using '>' or '<' does not correctly check for empty.

To check if the queue is empty, we compare its length to zero using ==.

4fill in blank

hard

Fill both blanks to create a dictionary of task names and their priorities for tasks with priority higher than 5.

Agentic AI

high_priority_tasks = {task[1]: task.priority for task in tasks if task.priority [2] 5}

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

A.name

B>

C<

D_id

Attempts:

3 left

💡 Hint

Common Mistakes

Using '<' filters tasks with lower priority.

Using '_id' accesses the wrong attribute.

We access the task name with .name and filter tasks with priority greater than 5 using >.

5fill in blank

hard

Fill all three blanks to create a dictionary of task IDs and their statuses for tasks that are completed.

Agentic AI

completed_tasks = {task[1]: task[2] for task in tasks if task.status [3] 'done'}

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

A.id

B.status

C==

D.name

Attempts:

3 left

💡 Hint

Common Mistakes

Using '.name' instead of '.id' for keys.

Using '!=' instead of '==' for filtering.

The dictionary keys are task IDs accessed by .id, values are statuses accessed by .status, and we filter tasks where status equals 'done' using ==.

Practice

1. What is the main purpose of queue-based task processing in agentic AI?

easy

A. To process all tasks simultaneously

B. To keep tasks in order and process them one by one

C. To randomly select tasks for processing

D. To delete tasks without processing

Solution

1. Step 1: Understand queue behavior

   A queue stores tasks in the order they arrive, so the first task added is the first processed.

2. Step 2: Identify the purpose in task processing

   This order ensures tasks are handled one by one without confusion or overlap.

3. Final Answer:

   To keep tasks in order and process them one by one -> Option B

4. Quick Check:

   Queue = ordered, one-by-one processing [OK]

Hint: Remember: queues process tasks FIFO (first in, first out) [OK]

Common Mistakes:

• Thinking tasks run all at once
• Assuming tasks are processed randomly
• Believing tasks get deleted without processing

2. Which of the following is the correct way to add a task to a queue in Python?

easy

A. queue.append(task)

B. queue.pop(task)

C. queue.remove(task)

D. queue.insert(0, task)

Solution

1. Step 1: Recall queue addition method

   In Python, adding to the end of a list (queue) uses append().

2. Step 2: Check other options

   pop() removes items, remove() deletes by value, insert(0, task) adds to front, not end.

3. Final Answer:

   queue.append(task) -> Option A

4. Quick Check:

   Adding task = append() [OK]

Hint: Add tasks with append() to keep queue order [OK]

Common Mistakes:

• Using pop() which removes tasks
• Using remove() which deletes by value
• Inserting at front breaks queue order

3. Given the Python code below, what will be printed?

tasks = []
tasks.append('task1')
tasks.append('task2')
processed = tasks.pop(0)
print(processed)

medium

A. task2

B. None

C. task1

D. IndexError

Solution

1. Step 1: Understand queue operations in code

   Tasks are added with append, so tasks = ['task1', 'task2'].

2. Step 2: Analyze pop(0) effect

   pop(0) removes and returns the first item, 'task1'.

3. Final Answer:

   task1 -> Option C

4. Quick Check:

   pop(0) returns first task [OK]

Hint: pop(0) removes first item in list [OK]

Common Mistakes:

• Thinking pop(0) removes last item
• Expecting an error from pop(0)
• Confusing pop() with pop(-1)

4. What is wrong with this queue processing code?

tasks = []
tasks.append('task1')
tasks.append('task2')
processed = tasks.pop()
print(processed)

medium

A. It removes the last task instead of the first

B. It causes an IndexError

C. It adds tasks incorrectly

D. It prints None

Solution

1. Step 1: Understand pop() without index

   pop() without argument removes the last item in the list.

2. Step 2: Compare with queue behavior

   Queue should remove the first task (pop(0)), so this removes tasks in wrong order.

3. Final Answer:

   It removes the last task instead of the first -> Option A

4. Quick Check:

   pop() removes last, not first [OK]

Hint: pop() removes last; use pop(0) for queue front [OK]

Common Mistakes:

• Assuming pop() removes first item
• Expecting an error from pop()
• Confusing append() with pop()

5. You want to process tasks in order but also prioritize urgent tasks immediately. Which queue-based approach fits best?

hard

A. Use a single queue and always pop from the front

B. Randomly pick tasks from the queue to process

C. Use a stack to process tasks last-in, first-out

D. Use two queues: one for urgent tasks processed first, then normal tasks

Solution

1. Step 1: Understand the need for prioritization

   Urgent tasks must be processed before normal tasks, so a single queue is not enough.

2. Step 2: Choose a structure supporting priority

   Two queues let urgent tasks be handled first, then normal tasks, preserving order within each.

3. Final Answer:

   Use two queues: one for urgent tasks processed first, then normal tasks -> Option D

4. Quick Check:

   Two queues = priority handling [OK]

Hint: Separate urgent and normal tasks in two queues [OK]

Common Mistakes:

• Using one queue loses priority order
• Using stack reverses task order
• Random picking breaks order and priority