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.
Answer:
try powering it off the turn it back on
Explanation:
<h2>Answer:</h2>
<u>The correct option is</u><u> (B) hang up and call back using the banks official phone number</u>
<h2>Explanation:</h2>
There are a lot of cases where people pretend to call from the banks where the receivers have the account. The caller tries to take the information from the receiver and pretends to be the bank official. If there is any doubt then the receiver should hang up the call and call back the official number of the bank to confirm that whether somebody has called from the bank to get the information.
True this is because algorithms are like logic
The answer should be A, I'm unsure how to explain this to you, sorry, but I hope you remember this for future reference
