Question

suppose we have a circular array implementation of a cube with 10 items in queue sorted in data to Azure data 11 the capacity is 42 where does the Inca Member function place the new entry in the array
​

Answer 1

Answer:

A assumes that the array is infinite. But if the array is finite, the option should be B. For example, take a queue with length 5, implemented with a 5-element array, a head pointer and a tail pointer. Insert 5 elements. Now, delete an element. After a deletion, it is impossible to insert a new element in O(1) time, without shifting the elements.

Explanation:

Mark as brainliest please i want a rank please