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.
It helps reveal the flow of execution of your program, including results of in-between evaluations. In other words, you can see what your program is doing, and why it takes the decisions it is taking.
If something unexpected happens, the trace will show you the sequence of events that lead to it.
Lowercase a is decimal 97 ; upper case is decimal 65
It's easier to think of them in octal, however: a = octal 141, and A is octal 101
octal to binary is easy, each digit is three bits.
141 = 001 100 001
101 = 001 000 001
So, how many bits are changed above?
