Answer (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.while(there are more characters in the word to read)
0
1
2
3
4
5
(2)
{read a character
0
g
if a character is '*' then
dequeue the queue
else
(3)
0
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*"?
(4)
0
1
2
3
4
5
g
0
A. (2)
B. (1)
C. (4)
D. (3)
antonis ni
Evil (21
