threads P$,$ C$\_$odd, and C$\_$even. Each thread has some sequential independent code sections represented as function calls while also having critical sections. Thread $P$ produces an item and inserts it in into a shared queue $Q,$ which is not bounded $($e$.$g$,$ a linked list is used so we can always insert an item$)$ and increases count by $1.$ Threads C$\_$odd consumes an item from the list when count is odd and greater than zero while C$\_$even consumes an item when count is even and greater than zero. Suppose all linked list functions Insert$()$ and GetItem$()$ work fine when executed in a program with no threads.

However, in the case of multi threads as in the below program, the novice programmer often sees different outputs or significant CPU usage without any output.