M

Mr. Dubey • 100.69K Points
Coach

Q. A normal queue, if implemented using an array of size MAX_SIZE, gets full when

  • (A) Rear = MAX_SIZE – 1
  • (B) Front = (rear + 1)mod MAX_SIZE
  • (C) Front = rear + 1
  • (D) Rear = front
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.


Question analytics