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:
Explanation:
I run an online e-commerce store and lately its been very difficult keeping track of customer detail, incoming orders, keyword generation etc. One solution that I thought about would be an application that controls all of that for me. In order to accomplish this I would first need to design and create a GUI that contains all of the necessary buttons and displays for the information. Then I would need to code a webscraper using Python to grab all of the data from e-commerce store as soon as it becomes available, organize it, and display it within the GUI.
Answer: I would say make a plan so that way you have a better understanding of it. I hope this helps! :)
