(Choose 1 answer)
0
1
2
3
4
5
Consider the following pseudocode:
(1)
declare a queue of characters, which is implemented by circular array of size 6.
while(there are more characters in the word to read)
0
1
2
3
4
5
{read a character
(2)
if a character is '*' then
dequeue the queue
else
(3)
0
1
2
3
4
5
enqueue the character into the queue
r
}
How the queue looks like after processing the input "Hello****Worl**d*"?
(4)
0
1
2
3
4
5
r
A. (3)
B. (2)
C. (1)
D. (4)
(12)
