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:
why is it necessary to fight against social evils and problem
Answer:
A business' ability to communicate with its employees, customers and associates changed dramatically when the Internet yielded new communication tools. Email and instant messaging have changed the face of business communication.
There's definitely something wrong with your for loop. Try this:
for x in range(n):
You might want to check if all your print statements are correct. You might be missing just a period and it will be counted wrong.
Answer:
Kindly see explaination
Explanation:
The k-map van be defined as a map that provides a pictorial method of grouping together expressions with common factors and therefore eliminating unwanted variables. The Karnaugh map can also be described as a special arrangement of a truth table.
Please kindly check attachment for the 3-variable K-Map to find the minimized SOP form of the function in the question.
