Two-Thread Even Odd Print | Dataford Interview Questions

Using 2 threads, one printing odd and one printing even numbers, print 1-200 in order (busy wait and wait/notify)

Asked in the Round 2 stage. Implement a function that returns the ordered sequence produced by the two threads, once using busy waiting and once using wait/notify style synchronization.

Function contract

def print_numbers(limit):

Input: limit, an integer upper bound.
Output: a dictionary with two keys, busy_wait and wait_notify, each containing the list of numbers printed by that strategy.

Requirements

Use exactly two logical workers, one responsible for odd numbers and one for even numbers.
The output must contain every integer from 1 to limit exactly once, in increasing order.
Provide both a busy-wait approach and a wait/notify approach in the solution.
The implementation should avoid deadlock and terminate cleanly.

Constraints

1 <= limit <= 200
Exactly two logical workers must be used, one odd and one even
The output must contain each integer from 1 to limit exactly once
The implementation must terminate without deadlock

Function Signature

def print_numbers(limit):

Your question is Two-Thread Even Odd Print. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem