A queue has configuration a, b, c, d from front to rear. Counting only queue…
BPSC TRE · TRE 3.0 · PGT (Classes 11–12) · Computer Science · 22 Jul 2024 · Shift 1 · Subject
A queue has configuration a, b, c, d from front to rear. Counting only queue operations (deletions from the front and additions at the rear), what minimum is needed to get d, c, b, a?
- A.
2 deletions and 3 additions
- B.
3 deletions and 3 additions
- C.
4 deletions and 4 additions
- D.
More than one of the above
- E.
None of the above
Attempted by 1409 students.
Sign up free to check your answer
Sign up freeLoading lesson…