Question

(Note: Use only C++) Draw Stack trace for binary search recursive program. You will choose your own int array. Queue Data Structure: 1. Burger king franchise manager calls you to develop a queue system for their franchises. He said that we have 3 order counters in each franchise and only 10 customers can wait on a single counter. You’ve following possible scenarios: a) If any counter queue is full then prompt the customer to wait in any other queue which has lesser no. of customers waiting. b) If all counters have same number of customers waiting, then prompt the customer to wait in any of the queue of his/her choice. Restrictions of question : 1. You can’t use any counter variable. 2. Implement the above scenario using all standard queue functions. Good

          (Note: Use only C++)
Draw Stack trace for binary search recursive program.
You will choose your own int array. 
Queue Data Structure:
1. Burger king franchise manager calls you to develop a queue
system for their franchises. He said that we have 3 order counters
in each franchise and only 10 customers can wait on a single
counter. You’ve following possible scenarios:
a) If any counter queue is full then prompt the customer to wait in
any other queue which has lesser no. of customers waiting.
b) If all counters have same number of customers waiting, then
prompt the customer to wait in any of the queue of his/her
choice.
Restrictions of question :
1. You can’t use any counter variable.
2. Implement the above scenario using all standard queue
functions.
Good

Added by Hunter C.

Question

Please give Ace some feedback