QUESTION 2: Interrupt Handling Problem
• TL is the time to perform one insert or remove operation in a linked list implementation
• TA is the time to perform one insert or remove operating in the proposed array implementation
• OH is the overhead time to temporarily extend the array
• P is the probability that any given insert operation will overrun the normal array size n.
A) Derive a formula for computing the value of P, below which the proposed scheme will outperform the linked list implementation
B) What is the value of P when TL = 10 * TA and OH = 100 * TA?