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