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