(Choose 1 answer)
0
1
2
3
4
5
(1)
i
0
Consider the following pseudocode:
declare a queue of characters, which is implemented by circular array of size 6.
0
1
2
3
4
5
while(there are more characters in the word to
(2)
i
g
0
read)
{read a character if a character is '*' then
(3)
0
1
2
3
4
5
i
g
0
dequeue the queue
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. (1)
B. (3)
C. (4)
D. (2)
15
