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