Answer:
Yes it is possible for the following cases:-
- When the queue is full.
- When the queue is empty.
Explanation:
When the queue is full the the front and the rear references in the circular array implementation are equal because after inserting an element in the queue we increase the rear pointer.So when inserting the last element the rear pointer will be increased and it will become equal to front pointer.
When the queue is empty the front and rear pointer are equal.We remove an element from queue by deleting the element at front pointer decreasing the front pointer when there is only one element and we are deleting that element front and rear pointer will become equal after deleting that element.
Didn’t you just make a question right now?
C wifi A company is developing a smart TV that connects to a wireless home network. Which technology can best help to establish this connection?
Bluetooth
Infrared
C.
WI-FI
D
Internet of things
E
satellite
Answer: False.
Explanation:
The general case of recursive function is when the solution is obtained recursively by simplification at each step.
However, it is the base case in a recursive function when the solution is obtained directly.
The general case must be reducible to base to arrive at a solution else the recursion would be a infinite recursion.
Answer: D:) people
Explanation: I search it up
