Question: 16
(Choose 1 answer)
0
1
(1)
i
n
Consider the following pseudocode:
g
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
22 2
3
4
5
}
{read a character
if a character is '*' then
dequeue the queue
else
enqueue the character into the queue
How the queue looks like after processing the input "Goo**dMor****ning**"?
(2)
i
31
(3)
0
1
i
21
n
Jaw
4
5
n
g
3
4
5
Bd
g
A. (1)
B. (2)
C. (3)
(4)
0
1
2
31
4
5
i
n
D. (4)
g
