Either B or D those are the most reasonable answers if it were up to me to answer i would pick B but that is up to you go ahead and try your best i hope u have a nice day ✨✌️✨
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.
d- enjoy
b- national service !
Answer:
banded rows and banded columns with alternate rows and columns in different colors and shades.
And hence, A different shading colors for odd even rows.
Explanation:
Suppose you have a plenty of data in a spreadsheet. It has been found that if the rows and columns are being shown through color banding, then they look quite pleasant to our eyes. And the options for the columns and rows banding helps us in developing bands that are formed alternatively, and one being colored and the other being shaded. And all these are rows and columns. So we have banded rows and banded columns. And you can make this by converting the sheet to table, and then using the table style.
