Login/RegisterData Structures :: Queue - Discussion
7 / 42
Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______; L, M, N, ___, ___
What will happen after ADD O operation takes place?
Afront = 2 rear = 5 queue = ______; L, M, N, O, ___
Bfront = 3 rear = 5 queue = L, M, N, O, ___
Cfront = 3 rear = 4 queue = ______; L, M, N, O, ___
Dfront = 2 rear = 4 queue = L, M, N, O, ___
Show Explanation
1
2. L
3.M
4.N
and when add o in this Queue as its FIFO it comes at position 5
5.O
6.
Asked In ::
Because Queue is FIFO so when we add 0 its obvious that it will come after N at position 5.
1
2. L
3.M
4.N
and when add o in this Queue as its FIFO it comes at position 5
5.O
6.
Read Full Answer
Report Error
Please Login First Click Here
Kindly some one explains how it happens ?
Read Full Answer
Report Error
Please Login First Click Here
