Question

ooooo T-Mobile 9:04 PM T 46%, 13 Exit Suppose our new improved queue contains n elements that have been added to it. What is the best characterization of the big-O runtime to add one additional member to this queue? O(1) is synonymous with constant time. Assume that constructing a new InternalQueue object is a constant time operation. O(1) O(log n) O(n)

Can someone explain to me ? Thanks in advance!

Answer 1

Since question says maximum size of the queue is n elements and previous queue is full so we have to make a new queue and add element to it. Now I am assuming adding a new element to a queue takes constant time viz. O(1). Since it is given that constructing a new queue takes constant time. So final answer will be max(time to create new queue, time to insert new element to a queue). Since both are constant so answer will be O(1). But if insertion of new element takes more time then the overall answer will be that time that is required to insert new element to queue. Since creatiion of new queue takes constant time.